Subversion Repositories HelenOS

Rev

Rev 3403 | Rev 3674 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2071 jermar 2
 * Copyright (c) 2001-2004 Jakub Jermar
1 jermar 3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
14
 * - The name of the author may not be used to endorse or promote products
15
 *   derived from this software without specific prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
1757 jermar 29
/** @addtogroup genericproc
1702 cejka 30
 * @{
31
 */
32
 
1248 jermar 33
/**
1702 cejka 34
 * @file
1248 jermar 35
 * @brief   Task management.
36
 */
37
 
1 jermar 38
#include <proc/thread.h>
39
#include <proc/task.h>
703 jermar 40
#include <mm/as.h>
814 palkovsky 41
#include <mm/slab.h>
2183 jermar 42
#include <atomic.h>
1 jermar 43
#include <synch/spinlock.h>
2109 jermar 44
#include <synch/waitq.h>
1 jermar 45
#include <arch.h>
3153 svoboda 46
#include <arch/barrier.h>
2504 jermar 47
#include <adt/avl.h>
1159 jermar 48
#include <adt/btree.h>
788 jermar 49
#include <adt/list.h>
955 palkovsky 50
#include <ipc/ipc.h>
3004 svoboda 51
#include <ipc/ipcrsc.h>
1060 palkovsky 52
#include <print.h>
1579 jermar 53
#include <errno.h>
2050 decky 54
#include <func.h>
1288 jermar 55
#include <syscall/copy.h>
973 palkovsky 56
 
2504 jermar 57
/** Spinlock protecting the tasks_tree AVL tree. */
623 jermar 58
SPINLOCK_INITIALIZE(tasks_lock);
1636 jermar 59
 
2504 jermar 60
/** AVL tree of active tasks.
1636 jermar 61
 *
2504 jermar 62
 * The task is guaranteed to exist after it was found in the tasks_tree as
2087 jermar 63
 * long as:
1636 jermar 64
 * @li the tasks_lock is held,
2087 jermar 65
 * @li the task's lock is held when task's lock is acquired before releasing
66
 *     tasks_lock or
1880 jermar 67
 * @li the task's refcount is greater than 0
1636 jermar 68
 *
69
 */
2504 jermar 70
avltree_t tasks_tree;
1636 jermar 71
 
1005 palkovsky 72
static task_id_t task_counter = 0;
1 jermar 73
 
3403 svoboda 74
/** Initialize kernel tasks support. */
1 jermar 75
void task_init(void)
76
{
15 jermar 77
    TASK = NULL;
2504 jermar 78
    avltree_create(&tasks_tree);
1 jermar 79
}
80
 
2504 jermar 81
/*
3403 svoboda 82
 * The idea behind this walker is to remember a single task different from
83
 * TASK.
2504 jermar 84
 */
85
static bool task_done_walker(avltree_node_t *node, void *arg)
86
{
87
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
88
    task_t **tp = (task_t **) arg;
89
 
90
    if (t != TASK) {
91
        *tp = t;
92
        return false;   /* stop walking */
93
    }
94
 
95
    return true;    /* continue the walk */
96
}
97
 
3403 svoboda 98
/** Kill all tasks except the current task. */
2227 decky 99
void task_done(void)
100
{
101
    task_t *t;
102
    do { /* Repeat until there are any tasks except TASK */
103
 
104
        /* Messing with task structures, avoid deadlock */
105
        ipl_t ipl = interrupts_disable();
106
        spinlock_lock(&tasks_lock);
107
 
108
        t = NULL;
2504 jermar 109
        avltree_walk(&tasks_tree, task_done_walker, &t);
2227 decky 110
 
111
        if (t != NULL) {
112
            task_id_t id = t->taskid;
113
 
114
            spinlock_unlock(&tasks_lock);
115
            interrupts_restore(ipl);
116
 
117
#ifdef CONFIG_DEBUG
3149 svoboda 118
            printf("Killing task %" PRIu64 "\n", id);
2227 decky 119
#endif          
120
            task_kill(id);
2632 decky 121
            thread_usleep(10000);
2227 decky 122
        } else {
123
            spinlock_unlock(&tasks_lock);
124
            interrupts_restore(ipl);
125
        }
126
 
127
    } while (t != NULL);
128
}
107 decky 129
 
3403 svoboda 130
/** Create new task with no threads.
107 decky 131
 *
3403 svoboda 132
 * @param as        Task's address space.
133
 * @param name      Symbolic name.
107 decky 134
 *
3403 svoboda 135
 * @return      New task's structure.
107 decky 136
 *
137
 */
1062 jermar 138
task_t *task_create(as_t *as, char *name)
1 jermar 139
{
413 jermar 140
    ipl_t ipl;
1 jermar 141
    task_t *ta;
1040 palkovsky 142
    int i;
1 jermar 143
 
822 palkovsky 144
    ta = (task_t *) malloc(sizeof(task_t), 0);
145
 
1185 jermar 146
    task_create_arch(ta);
147
 
822 palkovsky 148
    spinlock_initialize(&ta->lock, "task_ta_lock");
149
    list_initialize(&ta->th_head);
150
    ta->as = as;
1062 jermar 151
    ta->name = name;
2446 jermar 152
    atomic_set(&ta->refcount, 0);
153
    atomic_set(&ta->lifecount, 0);
1839 decky 154
    ta->context = CONTEXT;
1579 jermar 155
 
1174 jermar 156
    ta->capabilities = 0;
2039 decky 157
    ta->cycles = 0;
3448 svoboda 158
 
159
#ifdef CONFIG_UDEBUG
160
    /* Init debugging stuff */
161
    udebug_task_init(&ta->udebug);
162
 
163
    /* Init kbox stuff */
164
    ipc_answerbox_init(&ta->kernel_box, ta);
165
    ta->kb_thread = NULL;
166
    mutex_initialize(&ta->kb_cleanup_lock, MUTEX_PASSIVE);
167
    ta->kb_finished = false;
168
#endif
169
 
2802 jermar 170
    ipc_answerbox_init(&ta->answerbox, ta);
1839 decky 171
    for (i = 0; i < IPC_MAX_PHONES; i++)
1040 palkovsky 172
        ipc_phone_init(&ta->phones[i]);
2087 jermar 173
    if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
174
        ta->context)))
1040 palkovsky 175
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
998 palkovsky 176
    atomic_set(&ta->active_calls, 0);
1460 jermar 177
 
3191 svoboda 178
    mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE);
1460 jermar 179
    btree_create(&ta->futexes);
822 palkovsky 180
 
181
    ipl = interrupts_disable();
1468 jermar 182
 
183
    /*
184
     * Increment address space reference count.
185
     */
2183 jermar 186
    atomic_inc(&as->refcount);
1468 jermar 187
 
822 palkovsky 188
    spinlock_lock(&tasks_lock);
1005 palkovsky 189
    ta->taskid = ++task_counter;
2504 jermar 190
    avltree_node_initialize(&ta->tasks_tree_node);
191
    ta->tasks_tree_node.key = ta->taskid;
192
    avltree_insert(&tasks_tree, &ta->tasks_tree_node);
822 palkovsky 193
    spinlock_unlock(&tasks_lock);
194
    interrupts_restore(ipl);
195
 
1 jermar 196
    return ta;
197
}
198
 
1579 jermar 199
/** Destroy task.
200
 *
3403 svoboda 201
 * @param t     Task to be destroyed.
1579 jermar 202
 */
203
void task_destroy(task_t *t)
204
{
2446 jermar 205
    /*
206
     * Remove the task from the task B+tree.
207
     */
208
    spinlock_lock(&tasks_lock);
2504 jermar 209
    avltree_delete(&tasks_tree, &t->tasks_tree_node);
2446 jermar 210
    spinlock_unlock(&tasks_lock);
211
 
212
    /*
213
     * Perform architecture specific task destruction.
214
     */
1587 jermar 215
    task_destroy_arch(t);
2446 jermar 216
 
217
    /*
218
     * Free up dynamically allocated state.
219
     */
1587 jermar 220
    btree_destroy(&t->futexes);
221
 
2446 jermar 222
    /*
223
     * Drop our reference to the address space.
224
     */
2183 jermar 225
    if (atomic_predec(&t->as->refcount) == 0)
1587 jermar 226
        as_destroy(t->as);
227
 
228
    free(t);
229
    TASK = NULL;
1579 jermar 230
}
231
 
1176 jermar 232
/** Syscall for reading task ID from userspace.
233
 *
3403 svoboda 234
 * @param       uspace_task_id userspace address of 8-byte buffer
235
 *          where to store current task ID.
1176 jermar 236
 *
3403 svoboda 237
 * @return      Zero on success or an error code from @ref errno.h.
1176 jermar 238
 */
1780 jermar 239
unative_t sys_task_get_id(task_id_t *uspace_task_id)
1176 jermar 240
{
241
    /*
3403 svoboda 242
     * No need to acquire lock on TASK because taskid remains constant for
243
     * the lifespan of the task.
1176 jermar 244
     */
2087 jermar 245
    return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
246
        sizeof(TASK->taskid));
1176 jermar 247
}
248
 
1178 jermar 249
/** Find task structure corresponding to task ID.
250
 *
3403 svoboda 251
 * The tasks_lock must be already held by the caller of this function and
252
 * interrupts must be disabled.
1178 jermar 253
 *
3403 svoboda 254
 * @param id        Task ID.
1178 jermar 255
 *
3403 svoboda 256
 * @return      Task structure address or NULL if there is no such task
257
 *          ID.
1178 jermar 258
 */
3403 svoboda 259
task_t *task_find_by_id(task_id_t id) { avltree_node_t *node;
1178 jermar 260
 
2504 jermar 261
    node = avltree_search(&tasks_tree, (avltree_key_t) id);
262
 
263
    if (node)
264
        return avltree_get_instance(node, task_t, tasks_tree_node);
265
    return NULL;
1178 jermar 266
}
267
 
2039 decky 268
/** Get accounting data of given task.
269
 *
3403 svoboda 270
 * Note that task lock of 't' must be already held and interrupts must be
271
 * already disabled.
2039 decky 272
 *
3403 svoboda 273
 * @param t     Pointer to thread.
2039 decky 274
 *
3403 svoboda 275
 * @return      Number of cycles used by the task and all its threads
276
 *          so far.
2039 decky 277
 */
278
uint64_t task_get_accounting(task_t *t)
279
{
280
    /* Accumulated value of task */
281
    uint64_t ret = t->cycles;
282
 
283
    /* Current values of threads */
284
    link_t *cur;
285
    for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
286
        thread_t *thr = list_get_instance(cur, thread_t, th_link);
287
 
288
        spinlock_lock(&thr->lock);
2042 decky 289
        /* Process only counted threads */
290
        if (!thr->uncounted) {
2087 jermar 291
            if (thr == THREAD) {
292
                /* Update accounting of current thread */
293
                thread_update_accounting();
294
            }
2042 decky 295
            ret += thr->cycles;
296
        }
2039 decky 297
        spinlock_unlock(&thr->lock);
298
    }
299
 
300
    return ret;
301
}
302
 
1579 jermar 303
/** Kill task.
304
 *
2446 jermar 305
 * This function is idempotent.
306
 * It signals all the task's threads to bail it out.
307
 *
3403 svoboda 308
 * @param id        ID of the task to be killed.
1579 jermar 309
 *
3403 svoboda 310
 * @return      Zero on success or an error code from errno.h.
1579 jermar 311
 */
312
int task_kill(task_id_t id)
313
{
314
    ipl_t ipl;
315
    task_t *ta;
316
    link_t *cur;
1600 jermar 317
 
318
    if (id == 1)
319
        return EPERM;
1579 jermar 320
 
321
    ipl = interrupts_disable();
322
    spinlock_lock(&tasks_lock);
323
    if (!(ta = task_find_by_id(id))) {
324
        spinlock_unlock(&tasks_lock);
325
        interrupts_restore(ipl);
326
        return ENOENT;
327
    }
1587 jermar 328
    spinlock_unlock(&tasks_lock);
1579 jermar 329
 
1585 jermar 330
    /*
3403 svoboda 331
     * Interrupt all threads.
2446 jermar 332
     */
333
    spinlock_lock(&ta->lock);
1579 jermar 334
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
335
        thread_t *thr;
2446 jermar 336
        bool sleeping = false;
1579 jermar 337
 
338
        thr = list_get_instance(cur, thread_t, th_link);
339
 
340
        spinlock_lock(&thr->lock);
341
        thr->interrupted = true;
342
        if (thr->state == Sleeping)
343
            sleeping = true;
344
        spinlock_unlock(&thr->lock);
345
 
346
        if (sleeping)
2109 jermar 347
            waitq_interrupt_sleep(thr);
1579 jermar 348
    }
1580 jermar 349
    spinlock_unlock(&ta->lock);
350
    interrupts_restore(ipl);
1579 jermar 351
 
352
    return 0;
353
}
354
 
2504 jermar 355
static bool task_print_walker(avltree_node_t *node, void *arg)
356
{
357
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
358
    int j;
359
 
360
    spinlock_lock(&t->lock);
361
 
362
    uint64_t cycles;
363
    char suffix;
364
    order(task_get_accounting(t), &cycles, &suffix);
3149 svoboda 365
 
366
#ifdef __32_BITS__  
3153 svoboda 367
    printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %10p %10p %9" PRIu64
368
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
369
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
3149 svoboda 370
#endif
371
 
372
#ifdef __64_BITS__
3153 svoboda 373
    printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %18p %18p %9" PRIu64
374
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
375
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
3149 svoboda 376
#endif
377
 
2504 jermar 378
    for (j = 0; j < IPC_MAX_PHONES; j++) {
379
        if (t->phones[j].callee)
3149 svoboda 380
            printf(" %d:%p", j, t->phones[j].callee);
2504 jermar 381
    }
382
    printf("\n");
383
 
384
    spinlock_unlock(&t->lock);
385
    return true;
386
}
387
 
1060 palkovsky 388
/** Print task list */
389
void task_print_list(void)
390
{
391
    ipl_t ipl;
392
 
2227 decky 393
    /* Messing with task structures, avoid deadlock */
1060 palkovsky 394
    ipl = interrupts_disable();
395
    spinlock_lock(&tasks_lock);
396
 
3149 svoboda 397
#ifdef __32_BITS__  
398
    printf("taskid name       ctx address    as         "
3153 svoboda 399
        "cycles     threads calls  callee\n");
3149 svoboda 400
    printf("------ ---------- --- ---------- ---------- "
3153 svoboda 401
        "---------- ------- ------ ------>\n");
3149 svoboda 402
#endif
403
 
404
#ifdef __64_BITS__
405
    printf("taskid name       ctx address            as                 "
3153 svoboda 406
        "cycles     threads calls  callee\n");
3149 svoboda 407
    printf("------ ---------- --- ------------------ ------------------ "
3153 svoboda 408
        "---------- ------- ------ ------>\n");
3149 svoboda 409
#endif
410
 
2504 jermar 411
    avltree_walk(&tasks_tree, task_print_walker, NULL);
1159 jermar 412
 
1060 palkovsky 413
    spinlock_unlock(&tasks_lock);
414
    interrupts_restore(ipl);
415
}
1579 jermar 416
 
1757 jermar 417
/** @}
1702 cejka 418
 */