Subversion Repositories HelenOS

Rev

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