Subversion Repositories HelenOS

Rev

Rev 4348 | 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>
4345 svoboda 55
#include <string.h>
1288 jermar 56
#include <syscall/copy.h>
4691 svoboda 57
#include <macros.h>
58
#include <ipc/event.h>
973 palkovsky 59
 
2504 jermar 60
/** Spinlock protecting the tasks_tree AVL tree. */
623 jermar 61
SPINLOCK_INITIALIZE(tasks_lock);
1636 jermar 62
 
2504 jermar 63
/** AVL tree of active tasks.
1636 jermar 64
 *
2504 jermar 65
 * The task is guaranteed to exist after it was found in the tasks_tree as
2087 jermar 66
 * long as:
1636 jermar 67
 * @li the tasks_lock is held,
2087 jermar 68
 * @li the task's lock is held when task's lock is acquired before releasing
69
 *     tasks_lock or
1880 jermar 70
 * @li the task's refcount is greater than 0
1636 jermar 71
 *
72
 */
2504 jermar 73
avltree_t tasks_tree;
1636 jermar 74
 
1005 palkovsky 75
static task_id_t task_counter = 0;
1 jermar 76
 
3403 svoboda 77
/** Initialize kernel tasks support. */
1 jermar 78
void task_init(void)
79
{
15 jermar 80
    TASK = NULL;
2504 jermar 81
    avltree_create(&tasks_tree);
1 jermar 82
}
83
 
2504 jermar 84
/*
3403 svoboda 85
 * The idea behind this walker is to remember a single task different from
86
 * TASK.
2504 jermar 87
 */
88
static bool task_done_walker(avltree_node_t *node, void *arg)
89
{
90
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
91
    task_t **tp = (task_t **) arg;
92
 
93
    if (t != TASK) {
94
        *tp = t;
95
        return false;   /* stop walking */
96
    }
97
 
98
    return true;    /* continue the walk */
99
}
100
 
3403 svoboda 101
/** Kill all tasks except the current task. */
2227 decky 102
void task_done(void)
103
{
104
    task_t *t;
105
    do { /* Repeat until there are any tasks except TASK */
106
 
107
        /* Messing with task structures, avoid deadlock */
108
        ipl_t ipl = interrupts_disable();
109
        spinlock_lock(&tasks_lock);
110
 
111
        t = NULL;
2504 jermar 112
        avltree_walk(&tasks_tree, task_done_walker, &t);
2227 decky 113
 
114
        if (t != NULL) {
115
            task_id_t id = t->taskid;
116
 
117
            spinlock_unlock(&tasks_lock);
118
            interrupts_restore(ipl);
119
 
120
#ifdef CONFIG_DEBUG
3149 svoboda 121
            printf("Killing task %" PRIu64 "\n", id);
2227 decky 122
#endif          
123
            task_kill(id);
2632 decky 124
            thread_usleep(10000);
2227 decky 125
        } else {
126
            spinlock_unlock(&tasks_lock);
127
            interrupts_restore(ipl);
128
        }
129
 
130
    } while (t != NULL);
131
}
107 decky 132
 
3403 svoboda 133
/** Create new task with no threads.
107 decky 134
 *
3403 svoboda 135
 * @param as        Task's address space.
3569 svoboda 136
 * @param name      Symbolic name (a copy is made).
107 decky 137
 *
3403 svoboda 138
 * @return      New task's structure.
107 decky 139
 *
140
 */
1062 jermar 141
task_t *task_create(as_t *as, char *name)
1 jermar 142
{
413 jermar 143
    ipl_t ipl;
1 jermar 144
    task_t *ta;
1040 palkovsky 145
    int i;
1 jermar 146
 
822 palkovsky 147
    ta = (task_t *) malloc(sizeof(task_t), 0);
148
 
1185 jermar 149
    task_create_arch(ta);
150
 
822 palkovsky 151
    spinlock_initialize(&ta->lock, "task_ta_lock");
152
    list_initialize(&ta->th_head);
153
    ta->as = as;
3569 svoboda 154
 
155
    memcpy(ta->name, name, TASK_NAME_BUFLEN);
4348 svoboda 156
    ta->name[TASK_NAME_BUFLEN - 1] = 0;
3569 svoboda 157
 
2446 jermar 158
    atomic_set(&ta->refcount, 0);
159
    atomic_set(&ta->lifecount, 0);
1839 decky 160
    ta->context = CONTEXT;
1579 jermar 161
 
1174 jermar 162
    ta->capabilities = 0;
2039 decky 163
    ta->cycles = 0;
3448 svoboda 164
 
165
#ifdef CONFIG_UDEBUG
166
    /* Init debugging stuff */
167
    udebug_task_init(&ta->udebug);
168
 
169
    /* Init kbox stuff */
3674 svoboda 170
    ipc_answerbox_init(&ta->kb.box, ta);
171
    ta->kb.thread = NULL;
172
    mutex_initialize(&ta->kb.cleanup_lock, MUTEX_PASSIVE);
173
    ta->kb.finished = false;
3448 svoboda 174
#endif
175
 
2802 jermar 176
    ipc_answerbox_init(&ta->answerbox, ta);
1839 decky 177
    for (i = 0; i < IPC_MAX_PHONES; i++)
1040 palkovsky 178
        ipc_phone_init(&ta->phones[i]);
2087 jermar 179
    if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
180
        ta->context)))
1040 palkovsky 181
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
998 palkovsky 182
    atomic_set(&ta->active_calls, 0);
1460 jermar 183
 
3191 svoboda 184
    mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE);
1460 jermar 185
    btree_create(&ta->futexes);
822 palkovsky 186
 
187
    ipl = interrupts_disable();
1468 jermar 188
 
189
    /*
190
     * Increment address space reference count.
191
     */
2183 jermar 192
    atomic_inc(&as->refcount);
1468 jermar 193
 
822 palkovsky 194
    spinlock_lock(&tasks_lock);
1005 palkovsky 195
    ta->taskid = ++task_counter;
2504 jermar 196
    avltree_node_initialize(&ta->tasks_tree_node);
197
    ta->tasks_tree_node.key = ta->taskid;
198
    avltree_insert(&tasks_tree, &ta->tasks_tree_node);
822 palkovsky 199
    spinlock_unlock(&tasks_lock);
200
    interrupts_restore(ipl);
4691 svoboda 201
 
202
    /*
203
     * Notify about task creation.
204
     */
205
    if (event_is_subscribed(EVENT_WAIT))
206
        event_notify_3(EVENT_WAIT, TASK_CREATE, LOWER32(ta->taskid),
207
            UPPER32(ta->taskid));
208
 
1 jermar 209
    return ta;
210
}
211
 
1579 jermar 212
/** Destroy task.
213
 *
3403 svoboda 214
 * @param t     Task to be destroyed.
1579 jermar 215
 */
216
void task_destroy(task_t *t)
217
{
2446 jermar 218
    /*
219
     * Remove the task from the task B+tree.
220
     */
221
    spinlock_lock(&tasks_lock);
2504 jermar 222
    avltree_delete(&tasks_tree, &t->tasks_tree_node);
2446 jermar 223
    spinlock_unlock(&tasks_lock);
224
 
225
    /*
226
     * Perform architecture specific task destruction.
227
     */
1587 jermar 228
    task_destroy_arch(t);
2446 jermar 229
 
230
    /*
231
     * Free up dynamically allocated state.
232
     */
1587 jermar 233
    btree_destroy(&t->futexes);
234
 
2446 jermar 235
    /*
236
     * Drop our reference to the address space.
237
     */
2183 jermar 238
    if (atomic_predec(&t->as->refcount) == 0)
1587 jermar 239
        as_destroy(t->as);
240
 
4691 svoboda 241
    /*
242
     * Notify about task destruction.
243
     */
244
    if (event_is_subscribed(EVENT_WAIT))
245
        event_notify_3(EVENT_WAIT, TASK_DESTROY, LOWER32(t->taskid),
246
            UPPER32(t->taskid));
247
 
1587 jermar 248
    free(t);
249
    TASK = NULL;
1579 jermar 250
}
251
 
1176 jermar 252
/** Syscall for reading task ID from userspace.
253
 *
3403 svoboda 254
 * @param       uspace_task_id userspace address of 8-byte buffer
255
 *          where to store current task ID.
1176 jermar 256
 *
3403 svoboda 257
 * @return      Zero on success or an error code from @ref errno.h.
1176 jermar 258
 */
1780 jermar 259
unative_t sys_task_get_id(task_id_t *uspace_task_id)
1176 jermar 260
{
261
    /*
3403 svoboda 262
     * No need to acquire lock on TASK because taskid remains constant for
263
     * the lifespan of the task.
1176 jermar 264
     */
2087 jermar 265
    return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
266
        sizeof(TASK->taskid));
1176 jermar 267
}
268
 
4344 svoboda 269
/** Syscall for setting the task name.
270
 *
271
 * The name simplifies identifying the task in the task list.
272
 *
273
 * @param name  The new name for the task. (typically the same
274
 *      as the command used to execute it).
275
 *
276
 * @return 0 on success or an error code from @ref errno.h.
277
 */
278
unative_t sys_task_set_name(const char *uspace_name, size_t name_len)
279
{
280
    int rc;
281
    char namebuf[TASK_NAME_BUFLEN];
282
 
283
    /* Cap length of name and copy it from userspace. */
284
 
285
    if (name_len > TASK_NAME_BUFLEN - 1)
286
        name_len = TASK_NAME_BUFLEN - 1;
287
 
288
    rc = copy_from_uspace(namebuf, uspace_name, name_len);
289
    if (rc != 0)
290
        return (unative_t) rc;
291
 
292
    namebuf[name_len] = '\0';
4348 svoboda 293
    str_cpy(TASK->name, TASK_NAME_BUFLEN, namebuf);
4344 svoboda 294
 
295
    return EOK;
296
}
297
 
1178 jermar 298
/** Find task structure corresponding to task ID.
299
 *
3403 svoboda 300
 * The tasks_lock must be already held by the caller of this function and
301
 * interrupts must be disabled.
1178 jermar 302
 *
3403 svoboda 303
 * @param id        Task ID.
1178 jermar 304
 *
3403 svoboda 305
 * @return      Task structure address or NULL if there is no such task
306
 *          ID.
1178 jermar 307
 */
3403 svoboda 308
task_t *task_find_by_id(task_id_t id) { avltree_node_t *node;
1178 jermar 309
 
2504 jermar 310
    node = avltree_search(&tasks_tree, (avltree_key_t) id);
311
 
312
    if (node)
313
        return avltree_get_instance(node, task_t, tasks_tree_node);
314
    return NULL;
1178 jermar 315
}
316
 
2039 decky 317
/** Get accounting data of given task.
318
 *
3403 svoboda 319
 * Note that task lock of 't' must be already held and interrupts must be
320
 * already disabled.
2039 decky 321
 *
3403 svoboda 322
 * @param t     Pointer to thread.
2039 decky 323
 *
3403 svoboda 324
 * @return      Number of cycles used by the task and all its threads
325
 *          so far.
2039 decky 326
 */
327
uint64_t task_get_accounting(task_t *t)
328
{
329
    /* Accumulated value of task */
330
    uint64_t ret = t->cycles;
331
 
332
    /* Current values of threads */
333
    link_t *cur;
334
    for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
335
        thread_t *thr = list_get_instance(cur, thread_t, th_link);
336
 
337
        spinlock_lock(&thr->lock);
2042 decky 338
        /* Process only counted threads */
339
        if (!thr->uncounted) {
2087 jermar 340
            if (thr == THREAD) {
341
                /* Update accounting of current thread */
342
                thread_update_accounting();
343
            }
2042 decky 344
            ret += thr->cycles;
345
        }
2039 decky 346
        spinlock_unlock(&thr->lock);
347
    }
348
 
349
    return ret;
350
}
351
 
1579 jermar 352
/** Kill task.
353
 *
2446 jermar 354
 * This function is idempotent.
355
 * It signals all the task's threads to bail it out.
356
 *
3403 svoboda 357
 * @param id        ID of the task to be killed.
1579 jermar 358
 *
3403 svoboda 359
 * @return      Zero on success or an error code from errno.h.
1579 jermar 360
 */
361
int task_kill(task_id_t id)
362
{
363
    ipl_t ipl;
364
    task_t *ta;
365
    link_t *cur;
1600 jermar 366
 
367
    if (id == 1)
368
        return EPERM;
1579 jermar 369
 
370
    ipl = interrupts_disable();
371
    spinlock_lock(&tasks_lock);
372
    if (!(ta = task_find_by_id(id))) {
373
        spinlock_unlock(&tasks_lock);
374
        interrupts_restore(ipl);
375
        return ENOENT;
376
    }
1587 jermar 377
    spinlock_unlock(&tasks_lock);
1579 jermar 378
 
1585 jermar 379
    /*
3403 svoboda 380
     * Interrupt all threads.
2446 jermar 381
     */
382
    spinlock_lock(&ta->lock);
1579 jermar 383
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
384
        thread_t *thr;
2446 jermar 385
        bool sleeping = false;
1579 jermar 386
 
387
        thr = list_get_instance(cur, thread_t, th_link);
4343 svoboda 388
 
1579 jermar 389
        spinlock_lock(&thr->lock);
390
        thr->interrupted = true;
391
        if (thr->state == Sleeping)
392
            sleeping = true;
393
        spinlock_unlock(&thr->lock);
394
 
395
        if (sleeping)
2109 jermar 396
            waitq_interrupt_sleep(thr);
1579 jermar 397
    }
1580 jermar 398
    spinlock_unlock(&ta->lock);
399
    interrupts_restore(ipl);
1579 jermar 400
 
401
    return 0;
402
}
403
 
2504 jermar 404
static bool task_print_walker(avltree_node_t *node, void *arg)
405
{
406
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
407
    int j;
408
 
409
    spinlock_lock(&t->lock);
410
 
411
    uint64_t cycles;
412
    char suffix;
413
    order(task_get_accounting(t), &cycles, &suffix);
3149 svoboda 414
 
415
#ifdef __32_BITS__  
4344 svoboda 416
    printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %10p %10p %9" PRIu64
3153 svoboda 417
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
418
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
3149 svoboda 419
#endif
420
 
421
#ifdef __64_BITS__
4344 svoboda 422
    printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %18p %18p %9" PRIu64
3153 svoboda 423
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
424
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
3149 svoboda 425
#endif
426
 
2504 jermar 427
    for (j = 0; j < IPC_MAX_PHONES; j++) {
428
        if (t->phones[j].callee)
3149 svoboda 429
            printf(" %d:%p", j, t->phones[j].callee);
2504 jermar 430
    }
431
    printf("\n");
432
 
433
    spinlock_unlock(&t->lock);
434
    return true;
435
}
436
 
1060 palkovsky 437
/** Print task list */
438
void task_print_list(void)
439
{
440
    ipl_t ipl;
441
 
2227 decky 442
    /* Messing with task structures, avoid deadlock */
1060 palkovsky 443
    ipl = interrupts_disable();
444
    spinlock_lock(&tasks_lock);
445
 
3149 svoboda 446
#ifdef __32_BITS__  
4344 svoboda 447
    printf("taskid name         ctx address    as         "
3153 svoboda 448
        "cycles     threads calls  callee\n");
4344 svoboda 449
    printf("------ ------------ --- ---------- ---------- "
3153 svoboda 450
        "---------- ------- ------ ------>\n");
3149 svoboda 451
#endif
452
 
453
#ifdef __64_BITS__
4344 svoboda 454
    printf("taskid name         ctx address            as                 "
3153 svoboda 455
        "cycles     threads calls  callee\n");
4344 svoboda 456
    printf("------ ------------ --- ------------------ ------------------ "
3153 svoboda 457
        "---------- ------- ------ ------>\n");
3149 svoboda 458
#endif
459
 
2504 jermar 460
    avltree_walk(&tasks_tree, task_print_walker, NULL);
1159 jermar 461
 
1060 palkovsky 462
    spinlock_unlock(&tasks_lock);
463
    interrupts_restore(ipl);
464
}
1579 jermar 465
 
1757 jermar 466
/** @}
1702 cejka 467
 */