source: mainline/kernel/generic/src/proc/task.c@ 11675207

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 11675207 was 11675207, checked in by jermar <jermar@…>, 17 years ago

Move everything to kernel/.

  • Property mode set to 100644
File size: 11.2 KB
RevLine 
[f761f1eb]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
[cc73a8a1]29/** @addtogroup genericproc
[b45c443]30 * @{
31 */
32
[9179d0a]33/**
[b45c443]34 * @file
[9179d0a]35 * @brief Task management.
36 */
37
[5be1923]38#include <main/uinit.h>
[f761f1eb]39#include <proc/thread.h>
40#include <proc/task.h>
[0f250f9]41#include <proc/uarg.h>
[20d50a1]42#include <mm/as.h>
[085d973]43#include <mm/slab.h>
[f761f1eb]44#include <synch/spinlock.h>
45#include <arch.h>
46#include <panic.h>
[7f6e755]47#include <adt/btree.h>
[5c9a08b]48#include <adt/list.h>
[6d9c49a]49#include <ipc/ipc.h>
[1077d91]50#include <security/cap.h>
[6d9c49a]51#include <memstr.h>
[37c57f2]52#include <print.h>
[5be1923]53#include <elf.h>
[7509ddc]54#include <errno.h>
[e3c762cd]55#include <syscall/copy.h>
[0dbc4e7]56#include <console/klog.h>
[8e5e78f]57
[a84af84]58#ifndef LOADED_PROG_STACK_PAGES_NO
59#define LOADED_PROG_STACK_PAGES_NO 1
60#endif
[8e5e78f]61
[88169d9]62/** Spinlock protecting the tasks_btree B+tree. */
[dc747e3]63SPINLOCK_INITIALIZE(tasks_lock);
[88169d9]64
65/** B+tree of active tasks.
66 *
67 * The task is guaranteed to exist after it was found in the tasks_btree as long as:
68 * @li the tasks_lock is held,
69 * @li the task's lock is held when task's lock is acquired before releasing tasks_lock or
70 * @li the task's refcount is grater than 0
71 *
72 */
[7f6e755]73btree_t tasks_btree;
[88169d9]74
[286e03d]75static task_id_t task_counter = 0;
[70527f1]76
[b91bb65]77static void ktaskclnp(void *arg);
[48e7dd6]78static void ktaskgc(void *arg);
[7509ddc]79
[70527f1]80/** Initialize tasks
81 *
82 * Initialize kernel tasks support.
83 *
84 */
[f761f1eb]85void task_init(void)
86{
[43114c5]87 TASK = NULL;
[7f6e755]88 btree_create(&tasks_btree);
[f761f1eb]89}
90
[70527f1]91
92/** Create new task
93 *
94 * Create new task with no threads.
95 *
[20d50a1]96 * @param as Task's address space.
[ff14c520]97 * @param name Symbolic name.
[70527f1]98 *
[5be1923]99 * @return New task's structure
[70527f1]100 *
101 */
[ff14c520]102task_t *task_create(as_t *as, char *name)
[f761f1eb]103{
[22f7769]104 ipl_t ipl;
[f761f1eb]105 task_t *ta;
[2ba7810]106 int i;
[f761f1eb]107
[bb68433]108 ta = (task_t *) malloc(sizeof(task_t), 0);
109
[963074b3]110 task_create_arch(ta);
111
[bb68433]112 spinlock_initialize(&ta->lock, "task_ta_lock");
113 list_initialize(&ta->th_head);
114 ta->as = as;
[ff14c520]115 ta->name = name;
[b91bb65]116 ta->main_thread = NULL;
[7509ddc]117 ta->refcount = 0;
118
[1077d91]119 ta->capabilities = 0;
[7509ddc]120 ta->accept_new_threads = true;
[2ba7810]121
[6d9c49a]122 ipc_answerbox_init(&ta->answerbox);
[2ba7810]123 for (i=0; i < IPC_MAX_PHONES;i++)
124 ipc_phone_init(&ta->phones[i]);
[e74cb73]125 if (ipc_phone_0)
[2ba7810]126 ipc_phone_connect(&ta->phones[0], ipc_phone_0);
[5f62ef9]127 atomic_set(&ta->active_calls, 0);
[4fded58]128
129 mutex_initialize(&ta->futexes_lock);
130 btree_create(&ta->futexes);
[bb68433]131
132 ipl = interrupts_disable();
[482826d]133
134 /*
135 * Increment address space reference count.
136 * TODO: Reconsider the locking scheme.
137 */
138 mutex_lock(&as->lock);
139 as->refcount++;
140 mutex_unlock(&as->lock);
141
[bb68433]142 spinlock_lock(&tasks_lock);
[286e03d]143
144 ta->taskid = ++task_counter;
[b7f364e]145 btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL);
[286e03d]146
[bb68433]147 spinlock_unlock(&tasks_lock);
148 interrupts_restore(ipl);
149
[f761f1eb]150 return ta;
151}
152
[7509ddc]153/** Destroy task.
154 *
155 * @param t Task to be destroyed.
156 */
157void task_destroy(task_t *t)
158{
[31e8ddd]159 task_destroy_arch(t);
160 btree_destroy(&t->futexes);
161
162 mutex_lock_active(&t->as->lock);
163 if (--t->as->refcount == 0) {
164 mutex_unlock(&t->as->lock);
165 as_destroy(t->as);
166 /*
167 * t->as is destroyed.
168 */
169 } else {
170 mutex_unlock(&t->as->lock);
171 }
172
173 free(t);
174 TASK = NULL;
[7509ddc]175}
176
[5be1923]177/** Create new task with 1 thread and run it
[ff14c520]178 *
[9179d0a]179 * @param program_addr Address of program executable image.
[ff14c520]180 * @param name Program name.
[5be1923]181 *
[7f0837c]182 * @return Task of the running program or NULL on error.
[5be1923]183 */
[ff14c520]184task_t * task_run_program(void *program_addr, char *name)
[5be1923]185{
186 as_t *as;
187 as_area_t *a;
188 int rc;
[b91bb65]189 thread_t *t1, *t2;
[5be1923]190 task_t *task;
[0f250f9]191 uspace_arg_t *kernel_uarg;
[5be1923]192
193 as = as_create(0);
[a0bb10ef]194 ASSERT(as);
[5be1923]195
[649799a]196 rc = elf_load((elf_header_t *) program_addr, as);
[5be1923]197 if (rc != EE_OK) {
[482826d]198 as_destroy(as);
[5be1923]199 return NULL;
200 }
201
[0f250f9]202 kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
203 kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry;
204 kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
205 kernel_uarg->uspace_thread_function = NULL;
206 kernel_uarg->uspace_thread_arg = NULL;
207 kernel_uarg->uspace_uarg = NULL;
[9f52563]208
[ff14c520]209 task = task_create(as, name);
[a0bb10ef]210 ASSERT(task);
211
[5be1923]212 /*
213 * Create the data as_area.
214 */
[0ee077ee]215 a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
216 LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE,
[8182031]217 USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL);
[5be1923]218
[b91bb65]219 /*
220 * Create the main thread.
221 */
222 t1 = thread_create(uinit, kernel_uarg, task, 0, "uinit");
223 ASSERT(t1);
[a0bb10ef]224
[b91bb65]225 /*
226 * Create killer thread for the new task.
227 */
[48e7dd6]228 t2 = thread_create(ktaskgc, t1, task, 0, "ktaskgc");
[b91bb65]229 ASSERT(t2);
230 thread_ready(t2);
231
232 thread_ready(t1);
233
[5be1923]234 return task;
235}
[37c57f2]236
[ec55358]237/** Syscall for reading task ID from userspace.
238 *
[9179d0a]239 * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID.
[ec55358]240 *
[e3c762cd]241 * @return 0 on success or an error code from @ref errno.h.
[ec55358]242 */
[7f1c620]243unative_t sys_task_get_id(task_id_t *uspace_task_id)
[ec55358]244{
245 /*
246 * No need to acquire lock on TASK because taskid
247 * remains constant for the lifespan of the task.
248 */
[7f1c620]249 return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid));
[ec55358]250}
251
[9a8d91b]252/** Find task structure corresponding to task ID.
253 *
254 * The tasks_lock must be already held by the caller of this function
255 * and interrupts must be disabled.
256 *
257 * @param id Task ID.
258 *
259 * @return Task structure address or NULL if there is no such task ID.
260 */
261task_t *task_find_by_id(task_id_t id)
262{
263 btree_node_t *leaf;
264
265 return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf);
266}
267
[7509ddc]268/** Kill task.
269 *
270 * @param id ID of the task to be killed.
271 *
272 * @return 0 on success or an error code from errno.h
273 */
274int task_kill(task_id_t id)
275{
276 ipl_t ipl;
277 task_t *ta;
278 thread_t *t;
279 link_t *cur;
[9b6aae6]280
281 if (id == 1)
282 return EPERM;
[7509ddc]283
284 ipl = interrupts_disable();
285 spinlock_lock(&tasks_lock);
286
287 if (!(ta = task_find_by_id(id))) {
288 spinlock_unlock(&tasks_lock);
289 interrupts_restore(ipl);
290 return ENOENT;
291 }
[2569ec90]292
[7509ddc]293 spinlock_lock(&ta->lock);
294 ta->refcount++;
295 spinlock_unlock(&ta->lock);
[31e8ddd]296
[2569ec90]297 btree_remove(&tasks_btree, ta->taskid, NULL);
[31e8ddd]298 spinlock_unlock(&tasks_lock);
[7509ddc]299
[34dcd3f]300 t = thread_create(ktaskclnp, NULL, ta, 0, "ktaskclnp");
[7509ddc]301
302 spinlock_lock(&ta->lock);
[34dcd3f]303 ta->accept_new_threads = false;
[7509ddc]304 ta->refcount--;
[b91bb65]305
306 /*
[0182a665]307 * Interrupt all threads except ktaskclnp.
[b91bb65]308 */
[7509ddc]309 for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
310 thread_t *thr;
311 bool sleeping = false;
312
313 thr = list_get_instance(cur, thread_t, th_link);
314 if (thr == t)
315 continue;
316
317 spinlock_lock(&thr->lock);
318 thr->interrupted = true;
319 if (thr->state == Sleeping)
320 sleeping = true;
321 spinlock_unlock(&thr->lock);
322
323 if (sleeping)
324 waitq_interrupt_sleep(thr);
325 }
326
[34dcd3f]327 spinlock_unlock(&ta->lock);
328 interrupts_restore(ipl);
[7509ddc]329
[34dcd3f]330 if (t)
331 thread_ready(t);
332
[7509ddc]333 return 0;
334}
335
[37c57f2]336/** Print task list */
337void task_print_list(void)
338{
339 link_t *cur;
340 ipl_t ipl;
341
342 /* Messing with thread structures, avoid deadlock */
343 ipl = interrupts_disable();
344 spinlock_lock(&tasks_lock);
345
[7f6e755]346 for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) {
347 btree_node_t *node;
348 int i;
349
350 node = list_get_instance(cur, btree_node_t, leaf_link);
351 for (i = 0; i < node->keys; i++) {
352 task_t *t;
353 int j;
354
355 t = (task_t *) node->value[i];
356
357 spinlock_lock(&t->lock);
[fbf7b4c]358 printf("%s(%lld): address=%#zx, as=%#zx, ActiveCalls: %zd",
[c4e4507]359 t->name, t->taskid, t, t->as, atomic_get(&t->active_calls));
[7f6e755]360 for (j=0; j < IPC_MAX_PHONES; j++) {
361 if (t->phones[j].callee)
[fbf7b4c]362 printf(" Ph(%zd): %#zx ", j, t->phones[j].callee);
[7f6e755]363 }
364 printf("\n");
365 spinlock_unlock(&t->lock);
[37c57f2]366 }
367 }
368
369 spinlock_unlock(&tasks_lock);
370 interrupts_restore(ipl);
371}
[7509ddc]372
[b91bb65]373/** Kernel thread used to cleanup the task after it is killed. */
[34dcd3f]374void ktaskclnp(void *arg)
[7509ddc]375{
[34dcd3f]376 ipl_t ipl;
[b91bb65]377 thread_t *t = NULL, *main_thread;
[34dcd3f]378 link_t *cur;
[48e7dd6]379 bool again;
[34dcd3f]380
381 thread_detach(THREAD);
382
383loop:
384 ipl = interrupts_disable();
385 spinlock_lock(&TASK->lock);
386
[b91bb65]387 main_thread = TASK->main_thread;
388
[34dcd3f]389 /*
390 * Find a thread to join.
391 */
[48e7dd6]392 again = false;
[34dcd3f]393 for (cur = TASK->th_head.next; cur != &TASK->th_head; cur = cur->next) {
394 t = list_get_instance(cur, thread_t, th_link);
[48e7dd6]395
396 spinlock_lock(&t->lock);
397 if (t == THREAD) {
398 spinlock_unlock(&t->lock);
399 continue;
400 } else if (t == main_thread) {
401 spinlock_unlock(&t->lock);
[34dcd3f]402 continue;
[48e7dd6]403 } else if (t->join_type != None) {
404 spinlock_unlock(&t->lock);
405 again = true;
[b91bb65]406 continue;
[48e7dd6]407 } else {
408 t->join_type = TaskClnp;
409 spinlock_unlock(&t->lock);
410 again = false;
[34dcd3f]411 break;
[48e7dd6]412 }
[34dcd3f]413 }
414
415 spinlock_unlock(&TASK->lock);
416 interrupts_restore(ipl);
417
[48e7dd6]418 if (again) {
419 /*
420 * Other cleanup (e.g. ktaskgc) is in progress.
421 */
422 scheduler();
423 goto loop;
424 }
425
[34dcd3f]426 if (t != THREAD) {
[48e7dd6]427 ASSERT(t != main_thread); /* uninit is joined and detached in ktaskgc */
[34dcd3f]428 thread_join(t);
429 thread_detach(t);
[b91bb65]430 goto loop; /* go for another thread */
[34dcd3f]431 }
432
433 /*
434 * Now there are no other threads in this task
435 * and no new threads can be created.
436 */
437
[e090e1bc]438 ipc_cleanup();
439 futex_cleanup();
[0dbc4e7]440 klog_printf("Cleanup of task %lld completed.", TASK->taskid);
[7509ddc]441}
[b91bb65]442
[88636f68]443/** Kernel thread used to kill the userspace task when its main thread exits.
[b91bb65]444 *
445 * This thread waits until the main userspace thread (i.e. uninit) exits.
[48e7dd6]446 * When this happens, the task is killed. In the meantime, exited threads
447 * are garbage collected.
[b91bb65]448 *
449 * @param arg Pointer to the thread structure of the task's main thread.
450 */
[48e7dd6]451void ktaskgc(void *arg)
[b91bb65]452{
453 thread_t *t = (thread_t *) arg;
[48e7dd6]454loop:
[b91bb65]455 /*
456 * Userspace threads cannot detach themselves,
457 * therefore the thread pointer is guaranteed to be valid.
458 */
[48e7dd6]459 if (thread_join_timeout(t, 1000000, SYNCH_FLAGS_NONE) == ESYNCH_TIMEOUT) { /* sleep uninterruptibly here! */
460 ipl_t ipl;
461 link_t *cur;
462 thread_t *thr = NULL;
463
464 /*
465 * The join timed out. Try to do some garbage collection of Undead threads.
466 */
467more_gc:
468 ipl = interrupts_disable();
469 spinlock_lock(&TASK->lock);
470
471 for (cur = TASK->th_head.next; cur != &TASK->th_head; cur = cur->next) {
472 thr = list_get_instance(cur, thread_t, th_link);
473 spinlock_lock(&thr->lock);
[0182a665]474 if (thr != t && thr->state == Undead && thr->join_type == None) {
[48e7dd6]475 thr->join_type = TaskGC;
476 spinlock_unlock(&thr->lock);
477 break;
478 }
479 spinlock_unlock(&thr->lock);
480 thr = NULL;
481 }
482 spinlock_unlock(&TASK->lock);
[92922e6]483 interrupts_restore(ipl);
[48e7dd6]484
485 if (thr) {
486 thread_join(thr);
487 thread_detach(thr);
488 scheduler();
489 goto more_gc;
490 }
491
492 goto loop;
493 }
[b91bb65]494 thread_detach(t);
495 task_kill(TASK->taskid);
496}
[b45c443]497
[cc73a8a1]498/** @}
[b45c443]499 */
Note: See TracBrowser for help on using the repository browser.