Subversion Repositories HelenOS

Rev

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

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 2001-2004 Jakub 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
 
1248 jermar 29
/**
30
 * @file    task.c
31
 * @brief   Task management.
32
 */
33
 
973 palkovsky 34
#include <main/uinit.h>
1 jermar 35
#include <proc/thread.h>
36
#include <proc/task.h>
1078 jermar 37
#include <proc/uarg.h>
703 jermar 38
#include <mm/as.h>
814 palkovsky 39
#include <mm/slab.h>
1 jermar 40
#include <synch/spinlock.h>
41
#include <arch.h>
42
#include <panic.h>
1159 jermar 43
#include <adt/btree.h>
788 jermar 44
#include <adt/list.h>
955 palkovsky 45
#include <ipc/ipc.h>
1174 jermar 46
#include <security/cap.h>
955 palkovsky 47
#include <memstr.h>
1060 palkovsky 48
#include <print.h>
973 palkovsky 49
#include <elf.h>
1579 jermar 50
#include <errno.h>
1288 jermar 51
#include <syscall/copy.h>
973 palkovsky 52
 
1170 vana 53
#ifndef LOADED_PROG_STACK_PAGES_NO
54
#define LOADED_PROG_STACK_PAGES_NO 1
55
#endif
1168 vana 56
 
623 jermar 57
SPINLOCK_INITIALIZE(tasks_lock);
1159 jermar 58
btree_t tasks_btree;
1005 palkovsky 59
static task_id_t task_counter = 0;
1 jermar 60
 
1585 jermar 61
static void ktaskclnp(void *arg);
62
static void ktaskkill(void *arg);
1579 jermar 63
 
107 decky 64
/** Initialize tasks
65
 *
66
 * Initialize kernel tasks support.
67
 *
68
 */
1 jermar 69
void task_init(void)
70
{
15 jermar 71
    TASK = NULL;
1159 jermar 72
    btree_create(&tasks_btree);
1 jermar 73
}
74
 
107 decky 75
 
76
/** Create new task
77
 *
78
 * Create new task with no threads.
79
 *
703 jermar 80
 * @param as Task's address space.
1062 jermar 81
 * @param name Symbolic name.
107 decky 82
 *
973 palkovsky 83
 * @return New task's structure
107 decky 84
 *
85
 */
1062 jermar 86
task_t *task_create(as_t *as, char *name)
1 jermar 87
{
413 jermar 88
    ipl_t ipl;
1 jermar 89
    task_t *ta;
1040 palkovsky 90
    int i;
1 jermar 91
 
822 palkovsky 92
    ta = (task_t *) malloc(sizeof(task_t), 0);
93
 
1185 jermar 94
    task_create_arch(ta);
95
 
822 palkovsky 96
    spinlock_initialize(&ta->lock, "task_ta_lock");
97
    list_initialize(&ta->th_head);
98
    ta->as = as;
1062 jermar 99
    ta->name = name;
1585 jermar 100
    ta->main_thread = NULL;
1579 jermar 101
    ta->refcount = 0;
102
 
1174 jermar 103
    ta->capabilities = 0;
1579 jermar 104
    ta->accept_new_threads = true;
1040 palkovsky 105
 
955 palkovsky 106
    ipc_answerbox_init(&ta->answerbox);
1040 palkovsky 107
    for (i=0; i < IPC_MAX_PHONES;i++)
108
        ipc_phone_init(&ta->phones[i]);
965 palkovsky 109
    if (ipc_phone_0)
1040 palkovsky 110
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
998 palkovsky 111
    atomic_set(&ta->active_calls, 0);
1460 jermar 112
 
113
    mutex_initialize(&ta->futexes_lock);
114
    btree_create(&ta->futexes);
822 palkovsky 115
 
116
    ipl = interrupts_disable();
1468 jermar 117
 
118
    /*
119
     * Increment address space reference count.
120
     * TODO: Reconsider the locking scheme.
121
     */
122
    mutex_lock(&as->lock);
123
    as->refcount++;
124
    mutex_unlock(&as->lock);
125
 
822 palkovsky 126
    spinlock_lock(&tasks_lock);
1005 palkovsky 127
 
128
    ta->taskid = ++task_counter;
1177 jermar 129
    btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
1005 palkovsky 130
 
822 palkovsky 131
    spinlock_unlock(&tasks_lock);
132
    interrupts_restore(ipl);
133
 
1 jermar 134
    return ta;
135
}
136
 
1579 jermar 137
/** Destroy task.
138
 *
139
 * @param t Task to be destroyed.
140
 */
141
void task_destroy(task_t *t)
142
{
1587 jermar 143
    spinlock_lock(&tasks_lock);
144
    btree_remove(&tasks_btree, t->taskid, NULL);
145
    spinlock_unlock(&tasks_lock);
146
 
147
    task_destroy_arch(t);
148
    btree_destroy(&t->futexes);
149
 
150
    mutex_lock_active(&t->as->lock);
151
    if (--t->as->refcount == 0) {
152
        mutex_unlock(&t->as->lock);
153
        as_destroy(t->as);
154
        /*
155
         * t->as is destroyed.
156
         */
157
    } else {
158
        mutex_unlock(&t->as->lock);
159
    }
160
 
161
    free(t);
162
    TASK = NULL;
1579 jermar 163
}
164
 
973 palkovsky 165
/** Create new task with 1 thread and run it
166
 *
1248 jermar 167
 * @param program_addr Address of program executable image.
1062 jermar 168
 * @param name Program name.
169
 *
1229 jermar 170
 * @return Task of the running program or NULL on error.
973 palkovsky 171
 */
1062 jermar 172
task_t * task_run_program(void *program_addr, char *name)
973 palkovsky 173
{
174
    as_t *as;
175
    as_area_t *a;
176
    int rc;
1585 jermar 177
    thread_t *t1, *t2;
973 palkovsky 178
    task_t *task;
1078 jermar 179
    uspace_arg_t *kernel_uarg;
973 palkovsky 180
 
181
    as = as_create(0);
1115 jermar 182
    ASSERT(as);
973 palkovsky 183
 
1025 palkovsky 184
    rc = elf_load((elf_header_t *) program_addr, as);
973 palkovsky 185
    if (rc != EE_OK) {
1468 jermar 186
        as_destroy(as);
973 palkovsky 187
        return NULL;
188
    }
189
 
1078 jermar 190
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
191
    kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
192
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
193
    kernel_uarg->uspace_thread_function = NULL;
194
    kernel_uarg->uspace_thread_arg = NULL;
195
    kernel_uarg->uspace_uarg = NULL;
1066 jermar 196
 
1062 jermar 197
    task = task_create(as, name);
1115 jermar 198
    ASSERT(task);
199
 
973 palkovsky 200
    /*
201
     * Create the data as_area.
202
     */
1424 jermar 203
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
204
        LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
1409 jermar 205
        USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL);
1115 jermar 206
 
1585 jermar 207
    /*
208
     * Create the main thread.
209
     */
210
    t1 = thread_create(uinit, kernel_uarg, task, 0, "uinit");
211
    ASSERT(t1);
973 palkovsky 212
 
1585 jermar 213
    /*
214
     * Create killer thread for the new task.
215
     */
216
    t2 = thread_create(ktaskkill, t1, task, 0, "ktaskkill");
217
    ASSERT(t2);
218
    thread_ready(t2);
219
 
220
    thread_ready(t1);
221
 
973 palkovsky 222
    return task;
223
}
1060 palkovsky 224
 
1176 jermar 225
/** Syscall for reading task ID from userspace.
226
 *
1248 jermar 227
 * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
1176 jermar 228
 *
1288 jermar 229
 * @return 0 on success or an error code from @ref errno.h.
1176 jermar 230
 */
1227 jermar 231
__native sys_task_get_id(task_id_t *uspace_task_id)
1176 jermar 232
{
233
    /*
234
     * No need to acquire lock on TASK because taskid
235
     * remains constant for the lifespan of the task.
236
     */
1288 jermar 237
    return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
1176 jermar 238
}
239
 
1178 jermar 240
/** Find task structure corresponding to task ID.
241
 *
242
 * The tasks_lock must be already held by the caller of this function
243
 * and interrupts must be disabled.
244
 *
245
 * @param id Task ID.
246
 *
247
 * @return Task structure address or NULL if there is no such task ID.
248
 */
249
task_t *task_find_by_id(task_id_t id)
250
{
251
    btree_node_t *leaf;
252
 
253
    return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
254
}
255
 
1579 jermar 256
/** Kill task.
257
 *
258
 * @param id ID of the task to be killed.
259
 *
260
 * @return 0 on success or an error code from errno.h
261
 */
262
int task_kill(task_id_t id)
263
{
264
    ipl_t ipl;
265
    task_t *ta;
266
    thread_t *t;
267
    link_t *cur;
268
 
269
    ipl = interrupts_disable();
270
    spinlock_lock(&tasks_lock);
271
 
272
    if (!(ta = task_find_by_id(id))) {
273
        spinlock_unlock(&tasks_lock);
274
        interrupts_restore(ipl);
275
        return ENOENT;
276
    }
277
 
278
    spinlock_lock(&ta->lock);
279
    ta->refcount++;
280
    spinlock_unlock(&ta->lock);
1587 jermar 281
 
282
    spinlock_unlock(&tasks_lock);
1579 jermar 283
 
1580 jermar 284
    t = thread_create(ktaskclnp, NULL, ta, 0, "ktaskclnp");
1579 jermar 285
 
286
    spinlock_lock(&ta->lock);
1580 jermar 287
    ta->accept_new_threads = false;
1579 jermar 288
    ta->refcount--;
1585 jermar 289
 
290
    /*
291
     * Interrupt all threads except this one.
292
     */
1579 jermar 293
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
294
        thread_t *thr;
295
        bool  sleeping = false;
296
 
297
        thr = list_get_instance(cur, thread_t, th_link);
298
        if (thr == t)
299
            continue;
300
 
301
        spinlock_lock(&thr->lock);
302
        thr->interrupted = true;
303
        if (thr->state == Sleeping)
304
            sleeping = true;
305
        spinlock_unlock(&thr->lock);
306
 
307
        if (sleeping)
308
            waitq_interrupt_sleep(thr);
309
    }
310
 
1580 jermar 311
    spinlock_unlock(&ta->lock);
312
    interrupts_restore(ipl);
1579 jermar 313
 
1580 jermar 314
    if (t)
315
        thread_ready(t);
316
 
1579 jermar 317
    return 0;
318
}
319
 
1060 palkovsky 320
/** Print task list */
321
void task_print_list(void)
322
{
323
    link_t *cur;
324
    ipl_t ipl;
325
 
326
    /* Messing with thread structures, avoid deadlock */
327
    ipl = interrupts_disable();
328
    spinlock_lock(&tasks_lock);
329
 
1159 jermar 330
    for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
331
        btree_node_t *node;
332
        int i;
333
 
334
        node = list_get_instance(cur, btree_node_t, leaf_link);
335
        for (i = 0; i < node->keys; i++) {
336
            task_t *t;
337
            int j;
338
 
339
            t = (task_t *) node->value[i];
340
 
341
            spinlock_lock(&t->lock);
1573 palkovsky 342
            printf("%s(%lld): address=%#zX, as=%#zX, ActiveCalls: %zd",
343
                t->name, t->taskid, t, t->as, atomic_get(&t->active_calls));
1159 jermar 344
            for (j=0; j < IPC_MAX_PHONES; j++) {
345
                if (t->phones[j].callee)
1196 cejka 346
                    printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
1159 jermar 347
            }
348
            printf("\n");
349
            spinlock_unlock(&t->lock);
1060 palkovsky 350
        }
351
    }
352
 
353
    spinlock_unlock(&tasks_lock);
354
    interrupts_restore(ipl);
355
}
1579 jermar 356
 
1585 jermar 357
/** Kernel thread used to cleanup the task after it is killed. */
1580 jermar 358
void ktaskclnp(void *arg)
1579 jermar 359
{
1580 jermar 360
    ipl_t ipl;
1585 jermar 361
    thread_t *t = NULL, *main_thread;
1580 jermar 362
    link_t *cur;
363
 
364
    thread_detach(THREAD);
365
 
366
loop:
367
    ipl = interrupts_disable();
368
    spinlock_lock(&TASK->lock);
369
 
1585 jermar 370
    main_thread = TASK->main_thread;
371
 
1579 jermar 372
    /*
1580 jermar 373
     * Find a thread to join.
374
     */
375
    for (cur = TASK->th_head.next; cur != &TASK->th_head; cur = cur->next) {
376
        t = list_get_instance(cur, thread_t, th_link);
377
        if (t == THREAD)
378
            continue;
1585 jermar 379
        else if (t == main_thread)
380
            continue;
1580 jermar 381
        else
382
            break;
383
    }
384
 
385
    spinlock_unlock(&TASK->lock);
386
    interrupts_restore(ipl);
387
 
388
    if (t != THREAD) {
1585 jermar 389
        ASSERT(t != main_thread);   /* uninit is joined and detached in ktaskkill */
1580 jermar 390
        thread_join(t);
391
        thread_detach(t);
1585 jermar 392
        goto loop;  /* go for another thread */
1580 jermar 393
    }
394
 
395
    /*
396
     * Now there are no other threads in this task
397
     * and no new threads can be created.
398
     */
399
 
1583 jermar 400
    ipc_cleanup();
401
    futex_cleanup();
1579 jermar 402
}
1585 jermar 403
 
404
/** Kernel task used to kill a userspace task when its main thread exits.
405
 *
406
 * This thread waits until the main userspace thread (i.e. uninit) exits.
407
 * When this happens, the task is killed.
408
 *
409
 * @param arg Pointer to the thread structure of the task's main thread.
410
 */
411
void ktaskkill(void *arg)
412
{
413
    thread_t *t = (thread_t *) arg;
414
 
415
    /*
416
     * Userspace threads cannot detach themselves,
417
     * therefore the thread pointer is guaranteed to be valid.
418
     */
419
    thread_join(t); /* sleep uninterruptibly here! */
420
    thread_detach(t);
421
    task_kill(TASK->taskid);
422
}