Subversion Repositories HelenOS

Rev

Rev 4343 | Rev 4345 | 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.
3569 svoboda 133
 * @param name      Symbolic name (a copy is made).
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;
3569 svoboda 151
 
152
    memcpy(ta->name, name, TASK_NAME_BUFLEN);
153
    ta->name[TASK_NAME_BUFLEN - 1] = '\0';
154
 
2446 jermar 155
    atomic_set(&ta->refcount, 0);
156
    atomic_set(&ta->lifecount, 0);
1839 decky 157
    ta->context = CONTEXT;
1579 jermar 158
 
1174 jermar 159
    ta->capabilities = 0;
2039 decky 160
    ta->cycles = 0;
3448 svoboda 161
 
162
#ifdef CONFIG_UDEBUG
163
    /* Init debugging stuff */
164
    udebug_task_init(&ta->udebug);
165
 
166
    /* Init kbox stuff */
3674 svoboda 167
    ipc_answerbox_init(&ta->kb.box, ta);
168
    ta->kb.thread = NULL;
169
    mutex_initialize(&ta->kb.cleanup_lock, MUTEX_PASSIVE);
170
    ta->kb.finished = false;
3448 svoboda 171
#endif
172
 
2802 jermar 173
    ipc_answerbox_init(&ta->answerbox, ta);
1839 decky 174
    for (i = 0; i < IPC_MAX_PHONES; i++)
1040 palkovsky 175
        ipc_phone_init(&ta->phones[i]);
2087 jermar 176
    if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
177
        ta->context)))
1040 palkovsky 178
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
998 palkovsky 179
    atomic_set(&ta->active_calls, 0);
1460 jermar 180
 
3191 svoboda 181
    mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE);
1460 jermar 182
    btree_create(&ta->futexes);
822 palkovsky 183
 
184
    ipl = interrupts_disable();
1468 jermar 185
 
186
    /*
187
     * Increment address space reference count.
188
     */
2183 jermar 189
    atomic_inc(&as->refcount);
1468 jermar 190
 
822 palkovsky 191
    spinlock_lock(&tasks_lock);
1005 palkovsky 192
    ta->taskid = ++task_counter;
2504 jermar 193
    avltree_node_initialize(&ta->tasks_tree_node);
194
    ta->tasks_tree_node.key = ta->taskid;
195
    avltree_insert(&tasks_tree, &ta->tasks_tree_node);
822 palkovsky 196
    spinlock_unlock(&tasks_lock);
197
    interrupts_restore(ipl);
198
 
1 jermar 199
    return ta;
200
}
201
 
1579 jermar 202
/** Destroy task.
203
 *
3403 svoboda 204
 * @param t     Task to be destroyed.
1579 jermar 205
 */
206
void task_destroy(task_t *t)
207
{
2446 jermar 208
    /*
209
     * Remove the task from the task B+tree.
210
     */
211
    spinlock_lock(&tasks_lock);
2504 jermar 212
    avltree_delete(&tasks_tree, &t->tasks_tree_node);
2446 jermar 213
    spinlock_unlock(&tasks_lock);
214
 
215
    /*
216
     * Perform architecture specific task destruction.
217
     */
1587 jermar 218
    task_destroy_arch(t);
2446 jermar 219
 
220
    /*
221
     * Free up dynamically allocated state.
222
     */
1587 jermar 223
    btree_destroy(&t->futexes);
224
 
2446 jermar 225
    /*
226
     * Drop our reference to the address space.
227
     */
2183 jermar 228
    if (atomic_predec(&t->as->refcount) == 0)
1587 jermar 229
        as_destroy(t->as);
230
 
231
    free(t);
232
    TASK = NULL;
1579 jermar 233
}
234
 
1176 jermar 235
/** Syscall for reading task ID from userspace.
236
 *
3403 svoboda 237
 * @param       uspace_task_id userspace address of 8-byte buffer
238
 *          where to store current task ID.
1176 jermar 239
 *
3403 svoboda 240
 * @return      Zero on success or an error code from @ref errno.h.
1176 jermar 241
 */
1780 jermar 242
unative_t sys_task_get_id(task_id_t *uspace_task_id)
1176 jermar 243
{
244
    /*
3403 svoboda 245
     * No need to acquire lock on TASK because taskid remains constant for
246
     * the lifespan of the task.
1176 jermar 247
     */
2087 jermar 248
    return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
249
        sizeof(TASK->taskid));
1176 jermar 250
}
251
 
4344 svoboda 252
/** Syscall for setting the task name.
253
 *
254
 * The name simplifies identifying the task in the task list.
255
 *
256
 * @param name  The new name for the task. (typically the same
257
 *      as the command used to execute it).
258
 *
259
 * @return 0 on success or an error code from @ref errno.h.
260
 */
261
unative_t sys_task_set_name(const char *uspace_name, size_t name_len)
262
{
263
    int rc;
264
    char namebuf[TASK_NAME_BUFLEN];
265
 
266
    /* Cap length of name and copy it from userspace. */
267
 
268
    if (name_len > TASK_NAME_BUFLEN - 1)
269
        name_len = TASK_NAME_BUFLEN - 1;
270
 
271
    rc = copy_from_uspace(namebuf, uspace_name, name_len);
272
    if (rc != 0)
273
        return (unative_t) rc;
274
 
275
    namebuf[name_len] = '\0';
276
    strcpy(TASK->name, namebuf);
277
 
278
    return EOK;
279
}
280
 
1178 jermar 281
/** Find task structure corresponding to task ID.
282
 *
3403 svoboda 283
 * The tasks_lock must be already held by the caller of this function and
284
 * interrupts must be disabled.
1178 jermar 285
 *
3403 svoboda 286
 * @param id        Task ID.
1178 jermar 287
 *
3403 svoboda 288
 * @return      Task structure address or NULL if there is no such task
289
 *          ID.
1178 jermar 290
 */
3403 svoboda 291
task_t *task_find_by_id(task_id_t id) { avltree_node_t *node;
1178 jermar 292
 
2504 jermar 293
    node = avltree_search(&tasks_tree, (avltree_key_t) id);
294
 
295
    if (node)
296
        return avltree_get_instance(node, task_t, tasks_tree_node);
297
    return NULL;
1178 jermar 298
}
299
 
2039 decky 300
/** Get accounting data of given task.
301
 *
3403 svoboda 302
 * Note that task lock of 't' must be already held and interrupts must be
303
 * already disabled.
2039 decky 304
 *
3403 svoboda 305
 * @param t     Pointer to thread.
2039 decky 306
 *
3403 svoboda 307
 * @return      Number of cycles used by the task and all its threads
308
 *          so far.
2039 decky 309
 */
310
uint64_t task_get_accounting(task_t *t)
311
{
312
    /* Accumulated value of task */
313
    uint64_t ret = t->cycles;
314
 
315
    /* Current values of threads */
316
    link_t *cur;
317
    for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
318
        thread_t *thr = list_get_instance(cur, thread_t, th_link);
319
 
320
        spinlock_lock(&thr->lock);
2042 decky 321
        /* Process only counted threads */
322
        if (!thr->uncounted) {
2087 jermar 323
            if (thr == THREAD) {
324
                /* Update accounting of current thread */
325
                thread_update_accounting();
326
            }
2042 decky 327
            ret += thr->cycles;
328
        }
2039 decky 329
        spinlock_unlock(&thr->lock);
330
    }
331
 
332
    return ret;
333
}
334
 
1579 jermar 335
/** Kill task.
336
 *
2446 jermar 337
 * This function is idempotent.
338
 * It signals all the task's threads to bail it out.
339
 *
3403 svoboda 340
 * @param id        ID of the task to be killed.
1579 jermar 341
 *
3403 svoboda 342
 * @return      Zero on success or an error code from errno.h.
1579 jermar 343
 */
344
int task_kill(task_id_t id)
345
{
346
    ipl_t ipl;
347
    task_t *ta;
348
    link_t *cur;
1600 jermar 349
 
350
    if (id == 1)
351
        return EPERM;
1579 jermar 352
 
353
    ipl = interrupts_disable();
354
    spinlock_lock(&tasks_lock);
355
    if (!(ta = task_find_by_id(id))) {
356
        spinlock_unlock(&tasks_lock);
357
        interrupts_restore(ipl);
358
        return ENOENT;
359
    }
1587 jermar 360
    spinlock_unlock(&tasks_lock);
1579 jermar 361
 
1585 jermar 362
    /*
3403 svoboda 363
     * Interrupt all threads.
2446 jermar 364
     */
365
    spinlock_lock(&ta->lock);
1579 jermar 366
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
367
        thread_t *thr;
2446 jermar 368
        bool sleeping = false;
1579 jermar 369
 
370
        thr = list_get_instance(cur, thread_t, th_link);
4343 svoboda 371
 
1579 jermar 372
        spinlock_lock(&thr->lock);
373
        thr->interrupted = true;
374
        if (thr->state == Sleeping)
375
            sleeping = true;
376
        spinlock_unlock(&thr->lock);
377
 
378
        if (sleeping)
2109 jermar 379
            waitq_interrupt_sleep(thr);
1579 jermar 380
    }
1580 jermar 381
    spinlock_unlock(&ta->lock);
382
    interrupts_restore(ipl);
1579 jermar 383
 
384
    return 0;
385
}
386
 
2504 jermar 387
static bool task_print_walker(avltree_node_t *node, void *arg)
388
{
389
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
390
    int j;
391
 
392
    spinlock_lock(&t->lock);
393
 
394
    uint64_t cycles;
395
    char suffix;
396
    order(task_get_accounting(t), &cycles, &suffix);
3149 svoboda 397
 
398
#ifdef __32_BITS__  
4344 svoboda 399
    printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %10p %10p %9" PRIu64
3153 svoboda 400
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
401
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
3149 svoboda 402
#endif
403
 
404
#ifdef __64_BITS__
4344 svoboda 405
    printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %18p %18p %9" PRIu64
3153 svoboda 406
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
407
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
3149 svoboda 408
#endif
409
 
2504 jermar 410
    for (j = 0; j < IPC_MAX_PHONES; j++) {
411
        if (t->phones[j].callee)
3149 svoboda 412
            printf(" %d:%p", j, t->phones[j].callee);
2504 jermar 413
    }
414
    printf("\n");
415
 
416
    spinlock_unlock(&t->lock);
417
    return true;
418
}
419
 
1060 palkovsky 420
/** Print task list */
421
void task_print_list(void)
422
{
423
    ipl_t ipl;
424
 
2227 decky 425
    /* Messing with task structures, avoid deadlock */
1060 palkovsky 426
    ipl = interrupts_disable();
427
    spinlock_lock(&tasks_lock);
428
 
3149 svoboda 429
#ifdef __32_BITS__  
4344 svoboda 430
    printf("taskid name         ctx address    as         "
3153 svoboda 431
        "cycles     threads calls  callee\n");
4344 svoboda 432
    printf("------ ------------ --- ---------- ---------- "
3153 svoboda 433
        "---------- ------- ------ ------>\n");
3149 svoboda 434
#endif
435
 
436
#ifdef __64_BITS__
4344 svoboda 437
    printf("taskid name         ctx address            as                 "
3153 svoboda 438
        "cycles     threads calls  callee\n");
4344 svoboda 439
    printf("------ ------------ --- ------------------ ------------------ "
3153 svoboda 440
        "---------- ------- ------ ------>\n");
3149 svoboda 441
#endif
442
 
2504 jermar 443
    avltree_walk(&tasks_tree, task_print_walker, NULL);
1159 jermar 444
 
1060 palkovsky 445
    spinlock_unlock(&tasks_lock);
446
    interrupts_restore(ipl);
447
}
1579 jermar 448
 
1757 jermar 449
/** @}
1702 cejka 450
 */