Subversion Repositories HelenOS

Rev

Rev 1583 | Rev 1587 | 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
{
143
}
144
 
973 palkovsky 145
/** Create new task with 1 thread and run it
146
 *
1248 jermar 147
 * @param program_addr Address of program executable image.
1062 jermar 148
 * @param name Program name.
149
 *
1229 jermar 150
 * @return Task of the running program or NULL on error.
973 palkovsky 151
 */
1062 jermar 152
task_t * task_run_program(void *program_addr, char *name)
973 palkovsky 153
{
154
    as_t *as;
155
    as_area_t *a;
156
    int rc;
1585 jermar 157
    thread_t *t1, *t2;
973 palkovsky 158
    task_t *task;
1078 jermar 159
    uspace_arg_t *kernel_uarg;
973 palkovsky 160
 
161
    as = as_create(0);
1115 jermar 162
    ASSERT(as);
973 palkovsky 163
 
1025 palkovsky 164
    rc = elf_load((elf_header_t *) program_addr, as);
973 palkovsky 165
    if (rc != EE_OK) {
1468 jermar 166
        as_destroy(as);
973 palkovsky 167
        return NULL;
168
    }
169
 
1078 jermar 170
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
171
    kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
172
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
173
    kernel_uarg->uspace_thread_function = NULL;
174
    kernel_uarg->uspace_thread_arg = NULL;
175
    kernel_uarg->uspace_uarg = NULL;
1066 jermar 176
 
1062 jermar 177
    task = task_create(as, name);
1115 jermar 178
    ASSERT(task);
179
 
973 palkovsky 180
    /*
181
     * Create the data as_area.
182
     */
1424 jermar 183
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
184
        LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
1409 jermar 185
        USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL);
1115 jermar 186
 
1585 jermar 187
    /*
188
     * Create the main thread.
189
     */
190
    t1 = thread_create(uinit, kernel_uarg, task, 0, "uinit");
191
    ASSERT(t1);
973 palkovsky 192
 
1585 jermar 193
    /*
194
     * Create killer thread for the new task.
195
     */
196
    t2 = thread_create(ktaskkill, t1, task, 0, "ktaskkill");
197
    ASSERT(t2);
198
    thread_ready(t2);
199
 
200
    thread_ready(t1);
201
 
973 palkovsky 202
    return task;
203
}
1060 palkovsky 204
 
1176 jermar 205
/** Syscall for reading task ID from userspace.
206
 *
1248 jermar 207
 * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
1176 jermar 208
 *
1288 jermar 209
 * @return 0 on success or an error code from @ref errno.h.
1176 jermar 210
 */
1227 jermar 211
__native sys_task_get_id(task_id_t *uspace_task_id)
1176 jermar 212
{
213
    /*
214
     * No need to acquire lock on TASK because taskid
215
     * remains constant for the lifespan of the task.
216
     */
1288 jermar 217
    return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
1176 jermar 218
}
219
 
1178 jermar 220
/** Find task structure corresponding to task ID.
221
 *
222
 * The tasks_lock must be already held by the caller of this function
223
 * and interrupts must be disabled.
224
 *
225
 * @param id Task ID.
226
 *
227
 * @return Task structure address or NULL if there is no such task ID.
228
 */
229
task_t *task_find_by_id(task_id_t id)
230
{
231
    btree_node_t *leaf;
232
 
233
    return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
234
}
235
 
1579 jermar 236
/** Kill task.
237
 *
238
 * @param id ID of the task to be killed.
239
 *
240
 * @return 0 on success or an error code from errno.h
241
 */
242
int task_kill(task_id_t id)
243
{
244
    ipl_t ipl;
245
    task_t *ta;
246
    thread_t *t;
247
    link_t *cur;
248
 
249
    ipl = interrupts_disable();
250
    spinlock_lock(&tasks_lock);
251
 
252
    if (!(ta = task_find_by_id(id))) {
253
        spinlock_unlock(&tasks_lock);
254
        interrupts_restore(ipl);
255
        return ENOENT;
256
    }
257
 
258
    spinlock_lock(&ta->lock);
259
    ta->refcount++;
260
    spinlock_unlock(&ta->lock);
261
 
1580 jermar 262
    t = thread_create(ktaskclnp, NULL, ta, 0, "ktaskclnp");
1579 jermar 263
 
264
    spinlock_lock(&ta->lock);
1580 jermar 265
    ta->accept_new_threads = false;
1579 jermar 266
    ta->refcount--;
1585 jermar 267
 
268
    /*
269
     * Interrupt all threads except this one.
270
     */
1579 jermar 271
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
272
        thread_t *thr;
273
        bool  sleeping = false;
274
 
275
        thr = list_get_instance(cur, thread_t, th_link);
276
        if (thr == t)
277
            continue;
278
 
279
        spinlock_lock(&thr->lock);
280
        thr->interrupted = true;
281
        if (thr->state == Sleeping)
282
            sleeping = true;
283
        spinlock_unlock(&thr->lock);
284
 
285
        if (sleeping)
286
            waitq_interrupt_sleep(thr);
287
    }
288
 
1580 jermar 289
    spinlock_unlock(&ta->lock);
290
    interrupts_restore(ipl);
1579 jermar 291
 
1580 jermar 292
    if (t)
293
        thread_ready(t);
294
 
1579 jermar 295
    return 0;
296
}
297
 
1060 palkovsky 298
/** Print task list */
299
void task_print_list(void)
300
{
301
    link_t *cur;
302
    ipl_t ipl;
303
 
304
    /* Messing with thread structures, avoid deadlock */
305
    ipl = interrupts_disable();
306
    spinlock_lock(&tasks_lock);
307
 
1159 jermar 308
    for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
309
        btree_node_t *node;
310
        int i;
311
 
312
        node = list_get_instance(cur, btree_node_t, leaf_link);
313
        for (i = 0; i < node->keys; i++) {
314
            task_t *t;
315
            int j;
316
 
317
            t = (task_t *) node->value[i];
318
 
319
            spinlock_lock(&t->lock);
1573 palkovsky 320
            printf("%s(%lld): address=%#zX, as=%#zX, ActiveCalls: %zd",
321
                t->name, t->taskid, t, t->as, atomic_get(&t->active_calls));
1159 jermar 322
            for (j=0; j < IPC_MAX_PHONES; j++) {
323
                if (t->phones[j].callee)
1196 cejka 324
                    printf(" Ph(%zd): %#zX ", j, t->phones[j].callee);
1159 jermar 325
            }
326
            printf("\n");
327
            spinlock_unlock(&t->lock);
1060 palkovsky 328
        }
329
    }
330
 
331
    spinlock_unlock(&tasks_lock);
332
    interrupts_restore(ipl);
333
}
1579 jermar 334
 
1585 jermar 335
/** Kernel thread used to cleanup the task after it is killed. */
1580 jermar 336
void ktaskclnp(void *arg)
1579 jermar 337
{
1580 jermar 338
    ipl_t ipl;
1585 jermar 339
    thread_t *t = NULL, *main_thread;
1580 jermar 340
    link_t *cur;
341
 
342
    thread_detach(THREAD);
343
 
344
loop:
345
    ipl = interrupts_disable();
346
    spinlock_lock(&TASK->lock);
347
 
1585 jermar 348
    main_thread = TASK->main_thread;
349
 
1579 jermar 350
    /*
1580 jermar 351
     * Find a thread to join.
352
     */
353
    for (cur = TASK->th_head.next; cur != &TASK->th_head; cur = cur->next) {
354
        t = list_get_instance(cur, thread_t, th_link);
355
        if (t == THREAD)
356
            continue;
1585 jermar 357
        else if (t == main_thread)
358
            continue;
1580 jermar 359
        else
360
            break;
361
    }
362
 
363
    spinlock_unlock(&TASK->lock);
364
    interrupts_restore(ipl);
365
 
366
    if (t != THREAD) {
1585 jermar 367
        ASSERT(t != main_thread);   /* uninit is joined and detached in ktaskkill */
1580 jermar 368
        thread_join(t);
369
        thread_detach(t);
1585 jermar 370
        goto loop;  /* go for another thread */
1580 jermar 371
    }
372
 
373
    /*
374
     * Now there are no other threads in this task
375
     * and no new threads can be created.
376
     */
377
 
1583 jermar 378
    ipc_cleanup();
379
    futex_cleanup();
1579 jermar 380
}
1585 jermar 381
 
382
/** Kernel task used to kill a userspace task when its main thread exits.
383
 *
384
 * This thread waits until the main userspace thread (i.e. uninit) exits.
385
 * When this happens, the task is killed.
386
 *
387
 * @param arg Pointer to the thread structure of the task's main thread.
388
 */
389
void ktaskkill(void *arg)
390
{
391
    thread_t *t = (thread_t *) arg;
392
 
393
    /*
394
     * Userspace threads cannot detach themselves,
395
     * therefore the thread pointer is guaranteed to be valid.
396
     */
397
    thread_join(t); /* sleep uninterruptibly here! */
398
    thread_detach(t);
399
    task_kill(TASK->taskid);
400
}