Subversion Repositories HelenOS

Rev

Rev 3431 | Rev 4377 | 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>
3424 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>
3425 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
 
3425 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
/*
3425 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
 
3425 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
3424 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
 
3425 svoboda 130
/** Create new task with no threads.
107 decky 131
 *
3425 svoboda 132
 * @param as        Task's address space.
3597 svoboda 133
 * @param name      Symbolic name (a copy is made).
107 decky 134
 *
3425 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;
3597 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;
2803 svoboda 161
 
3431 svoboda 162
#ifdef CONFIG_UDEBUG
2825 svoboda 163
    /* Init debugging stuff */
3014 svoboda 164
    udebug_task_init(&ta->udebug);
2808 svoboda 165
 
2902 svoboda 166
    /* Init kbox stuff */
2808 svoboda 167
    ipc_answerbox_init(&ta->kernel_box, ta);
168
    ta->kb_thread = NULL;
3426 svoboda 169
    mutex_initialize(&ta->kb_cleanup_lock, MUTEX_PASSIVE);
2902 svoboda 170
    ta->kb_finished = false;
3431 svoboda 171
#endif
2808 svoboda 172
 
2800 svoboda 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
 
3425 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
 *
3425 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
 
3424 svoboda 235
/** Syscall for reading task ID from userspace.
973 palkovsky 236
 *
3425 svoboda 237
 * @param       uspace_task_id userspace address of 8-byte buffer
238
 *          where to store current task ID.
1062 jermar 239
 *
3425 svoboda 240
 * @return      Zero on success or an error code from @ref errno.h.
973 palkovsky 241
 */
3424 svoboda 242
unative_t sys_task_get_id(task_id_t *uspace_task_id)
973 palkovsky 243
{
3424 svoboda 244
    /*
3425 svoboda 245
     * No need to acquire lock on TASK because taskid remains constant for
246
     * the lifespan of the task.
3424 svoboda 247
     */
248
    return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
249
        sizeof(TASK->taskid));
250
}
973 palkovsky 251
 
1178 jermar 252
/** Find task structure corresponding to task ID.
253
 *
3425 svoboda 254
 * The tasks_lock must be already held by the caller of this function and
255
 * interrupts must be disabled.
1178 jermar 256
 *
3425 svoboda 257
 * @param id        Task ID.
1178 jermar 258
 *
3425 svoboda 259
 * @return      Task structure address or NULL if there is no such task
260
 *          ID.
1178 jermar 261
 */
3425 svoboda 262
task_t *task_find_by_id(task_id_t id) { avltree_node_t *node;
1178 jermar 263
 
2504 jermar 264
    node = avltree_search(&tasks_tree, (avltree_key_t) id);
265
 
266
    if (node)
267
        return avltree_get_instance(node, task_t, tasks_tree_node);
268
    return NULL;
1178 jermar 269
}
270
 
2039 decky 271
/** Get accounting data of given task.
272
 *
3425 svoboda 273
 * Note that task lock of 't' must be already held and interrupts must be
274
 * already disabled.
2039 decky 275
 *
3425 svoboda 276
 * @param t     Pointer to thread.
2039 decky 277
 *
3425 svoboda 278
 * @return      Number of cycles used by the task and all its threads
279
 *          so far.
2039 decky 280
 */
281
uint64_t task_get_accounting(task_t *t)
282
{
283
    /* Accumulated value of task */
284
    uint64_t ret = t->cycles;
285
 
286
    /* Current values of threads */
287
    link_t *cur;
288
    for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
289
        thread_t *thr = list_get_instance(cur, thread_t, th_link);
290
 
291
        spinlock_lock(&thr->lock);
2042 decky 292
        /* Process only counted threads */
293
        if (!thr->uncounted) {
2087 jermar 294
            if (thr == THREAD) {
295
                /* Update accounting of current thread */
296
                thread_update_accounting();
297
            }
2042 decky 298
            ret += thr->cycles;
299
        }
2039 decky 300
        spinlock_unlock(&thr->lock);
301
    }
302
 
303
    return ret;
304
}
305
 
1579 jermar 306
/** Kill task.
307
 *
2446 jermar 308
 * This function is idempotent.
309
 * It signals all the task's threads to bail it out.
310
 *
3425 svoboda 311
 * @param id        ID of the task to be killed.
1579 jermar 312
 *
3425 svoboda 313
 * @return      Zero on success or an error code from errno.h.
1579 jermar 314
 */
315
int task_kill(task_id_t id)
316
{
317
    ipl_t ipl;
318
    task_t *ta;
319
    link_t *cur;
1600 jermar 320
 
321
    if (id == 1)
322
        return EPERM;
1579 jermar 323
 
324
    ipl = interrupts_disable();
325
    spinlock_lock(&tasks_lock);
326
    if (!(ta = task_find_by_id(id))) {
327
        spinlock_unlock(&tasks_lock);
328
        interrupts_restore(ipl);
329
        return ENOENT;
330
    }
1587 jermar 331
    spinlock_unlock(&tasks_lock);
1579 jermar 332
 
1585 jermar 333
    /*
3425 svoboda 334
     * Interrupt all threads.
2446 jermar 335
     */
336
    spinlock_lock(&ta->lock);
1579 jermar 337
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
338
        thread_t *thr;
2446 jermar 339
        bool sleeping = false;
1579 jermar 340
 
341
        thr = list_get_instance(cur, thread_t, th_link);
342
 
343
        spinlock_lock(&thr->lock);
344
        thr->interrupted = true;
345
        if (thr->state == Sleeping)
346
            sleeping = true;
347
        spinlock_unlock(&thr->lock);
348
 
349
        if (sleeping)
2109 jermar 350
            waitq_interrupt_sleep(thr);
1579 jermar 351
    }
1580 jermar 352
    spinlock_unlock(&ta->lock);
353
    interrupts_restore(ipl);
1579 jermar 354
 
355
    return 0;
356
}
357
 
2504 jermar 358
static bool task_print_walker(avltree_node_t *node, void *arg)
359
{
360
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
361
    int j;
362
 
363
    spinlock_lock(&t->lock);
364
 
365
    uint64_t cycles;
366
    char suffix;
367
    order(task_get_accounting(t), &cycles, &suffix);
3424 svoboda 368
 
369
#ifdef __32_BITS__  
370
    printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %10p %10p %9" PRIu64
371
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
372
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
373
#endif
374
 
375
#ifdef __64_BITS__
376
    printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %18p %18p %9" PRIu64
377
        "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles,
378
        suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls));
379
#endif
380
 
2504 jermar 381
    for (j = 0; j < IPC_MAX_PHONES; j++) {
382
        if (t->phones[j].callee)
3424 svoboda 383
            printf(" %d:%p", j, t->phones[j].callee);
2504 jermar 384
    }
385
    printf("\n");
386
 
387
    spinlock_unlock(&t->lock);
388
    return true;
389
}
390
 
1060 palkovsky 391
/** Print task list */
392
void task_print_list(void)
393
{
394
    ipl_t ipl;
395
 
2227 decky 396
    /* Messing with task structures, avoid deadlock */
1060 palkovsky 397
    ipl = interrupts_disable();
398
    spinlock_lock(&tasks_lock);
399
 
3424 svoboda 400
#ifdef __32_BITS__  
401
    printf("taskid name       ctx address    as         "
402
        "cycles     threads calls  callee\n");
403
    printf("------ ---------- --- ---------- ---------- "
404
        "---------- ------- ------ ------>\n");
405
#endif
406
 
407
#ifdef __64_BITS__
408
    printf("taskid name       ctx address            as                 "
409
        "cycles     threads calls  callee\n");
410
    printf("------ ---------- --- ------------------ ------------------ "
411
        "---------- ------- ------ ------>\n");
412
#endif
413
 
2504 jermar 414
    avltree_walk(&tasks_tree, task_print_walker, NULL);
1159 jermar 415
 
1060 palkovsky 416
    spinlock_unlock(&tasks_lock);
417
    interrupts_restore(ipl);
418
}
1579 jermar 419
 
1757 jermar 420
/** @}
1702 cejka 421
 */