Rev 3022 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3022 | Rev 4055 | ||
---|---|---|---|
Line 33... | Line 33... | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief Task management. |
35 | * @brief Task management. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <main/uinit.h> |
- | |
39 | #include <proc/thread.h> |
38 | #include <proc/thread.h> |
40 | #include <proc/task.h> |
39 | #include <proc/task.h> |
41 | #include <proc/uarg.h> |
- | |
42 | #include <mm/as.h> |
40 | #include <mm/as.h> |
43 | #include <mm/slab.h> |
41 | #include <mm/slab.h> |
44 | #include <atomic.h> |
42 | #include <atomic.h> |
45 | #include <synch/spinlock.h> |
43 | #include <synch/spinlock.h> |
46 | #include <synch/waitq.h> |
44 | #include <synch/waitq.h> |
47 | #include <arch.h> |
45 | #include <arch.h> |
48 | #include <panic.h> |
46 | #include <arch/barrier.h> |
49 | #include <adt/avl.h> |
47 | #include <adt/avl.h> |
50 | #include <adt/btree.h> |
48 | #include <adt/btree.h> |
51 | #include <adt/list.h> |
49 | #include <adt/list.h> |
52 | #include <ipc/ipc.h> |
50 | #include <ipc/ipc.h> |
53 | #include <security/cap.h> |
51 | #include <ipc/ipcrsc.h> |
54 | #include <memstr.h> |
- | |
55 | #include <print.h> |
52 | #include <print.h> |
56 | #include <lib/elf.h> |
- | |
57 | #include <errno.h> |
53 | #include <errno.h> |
58 | #include <func.h> |
54 | #include <func.h> |
- | 55 | #include <string.h> |
|
59 | #include <syscall/copy.h> |
56 | #include <syscall/copy.h> |
60 | 57 | ||
61 | #ifndef LOADED_PROG_STACK_PAGES_NO |
- | |
62 | #define LOADED_PROG_STACK_PAGES_NO 1 |
- | |
63 | #endif |
- | |
64 | - | ||
65 | /** Spinlock protecting the tasks_tree AVL tree. */ |
58 | /** Spinlock protecting the tasks_tree AVL tree. */ |
66 | SPINLOCK_INITIALIZE(tasks_lock); |
59 | SPINLOCK_INITIALIZE(tasks_lock); |
67 | 60 | ||
68 | /** AVL tree of active tasks. |
61 | /** AVL tree of active tasks. |
69 | * |
62 | * |
Line 77... | Line 70... | ||
77 | */ |
70 | */ |
78 | avltree_t tasks_tree; |
71 | avltree_t tasks_tree; |
79 | 72 | ||
80 | static task_id_t task_counter = 0; |
73 | static task_id_t task_counter = 0; |
81 | 74 | ||
82 | /** Initialize tasks |
- | |
83 | * |
- | |
84 | * Initialize kernel tasks support. |
75 | /** Initialize kernel tasks support. */ |
85 | * |
- | |
86 | */ |
- | |
87 | void task_init(void) |
76 | void task_init(void) |
88 | { |
77 | { |
89 | TASK = NULL; |
78 | TASK = NULL; |
90 | avltree_create(&tasks_tree); |
79 | avltree_create(&tasks_tree); |
91 | } |
80 | } |
92 | 81 | ||
93 | /* |
82 | /* |
94 | * The idea behind this walker is to remember a single task different from TASK. |
83 | * The idea behind this walker is to remember a single task different from |
- | 84 | * TASK. |
|
95 | */ |
85 | */ |
96 | static bool task_done_walker(avltree_node_t *node, void *arg) |
86 | static bool task_done_walker(avltree_node_t *node, void *arg) |
97 | { |
87 | { |
98 | task_t *t = avltree_get_instance(node, task_t, tasks_tree_node); |
88 | task_t *t = avltree_get_instance(node, task_t, tasks_tree_node); |
99 | task_t **tp = (task_t **) arg; |
89 | task_t **tp = (task_t **) arg; |
Line 104... | Line 94... | ||
104 | } |
94 | } |
105 | 95 | ||
106 | return true; /* continue the walk */ |
96 | return true; /* continue the walk */ |
107 | } |
97 | } |
108 | 98 | ||
109 | /** Kill all tasks except the current task. |
99 | /** Kill all tasks except the current task. */ |
110 | * |
- | |
111 | */ |
- | |
112 | void task_done(void) |
100 | void task_done(void) |
113 | { |
101 | { |
114 | task_t *t; |
102 | task_t *t; |
115 | do { /* Repeat until there are any tasks except TASK */ |
103 | do { /* Repeat until there are any tasks except TASK */ |
116 | 104 | ||
Line 126... | Line 114... | ||
126 | 114 | ||
127 | spinlock_unlock(&tasks_lock); |
115 | spinlock_unlock(&tasks_lock); |
128 | interrupts_restore(ipl); |
116 | interrupts_restore(ipl); |
129 | 117 | ||
130 | #ifdef CONFIG_DEBUG |
118 | #ifdef CONFIG_DEBUG |
131 | printf("Killing task %llu\n", id); |
119 | printf("Killing task %" PRIu64 "\n", id); |
132 | #endif |
120 | #endif |
133 | task_kill(id); |
121 | task_kill(id); |
134 | thread_usleep(10000); |
122 | thread_usleep(10000); |
135 | } else { |
123 | } else { |
136 | spinlock_unlock(&tasks_lock); |
124 | spinlock_unlock(&tasks_lock); |
Line 138... | Line 126... | ||
138 | } |
126 | } |
139 | 127 | ||
140 | } while (t != NULL); |
128 | } while (t != NULL); |
141 | } |
129 | } |
142 | 130 | ||
143 | /** Create new task |
131 | /** Create new task with no threads. |
144 | * |
132 | * |
145 | * Create new task with no threads. |
133 | * @param as Task's address space. |
- | 134 | * @param name Symbolic name (a copy is made). |
|
146 | * |
135 | * |
147 | * @param as Task's address space. |
- | |
148 | * @param name Symbolic name. |
- | |
149 | * |
- | |
150 | * @return New task's structure |
136 | * @return New task's structure. |
151 | * |
137 | * |
152 | */ |
138 | */ |
153 | task_t *task_create(as_t *as, char *name) |
139 | task_t *task_create(as_t *as, char *name) |
154 | { |
140 | { |
155 | ipl_t ipl; |
141 | ipl_t ipl; |
Line 161... | Line 147... | ||
161 | task_create_arch(ta); |
147 | task_create_arch(ta); |
162 | 148 | ||
163 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
149 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
164 | list_initialize(&ta->th_head); |
150 | list_initialize(&ta->th_head); |
165 | ta->as = as; |
151 | ta->as = as; |
- | 152 | ||
- | 153 | memcpy(ta->name, name, TASK_NAME_BUFLEN); |
|
166 | ta->name = name; |
154 | ta->name[TASK_NAME_BUFLEN - 1] = '\0'; |
- | 155 | ||
167 | atomic_set(&ta->refcount, 0); |
156 | atomic_set(&ta->refcount, 0); |
168 | atomic_set(&ta->lifecount, 0); |
157 | atomic_set(&ta->lifecount, 0); |
169 | ta->context = CONTEXT; |
158 | ta->context = CONTEXT; |
170 | 159 | ||
171 | ta->capabilities = 0; |
160 | ta->capabilities = 0; |
172 | ta->cycles = 0; |
161 | ta->cycles = 0; |
- | 162 | ||
- | 163 | #ifdef CONFIG_UDEBUG |
|
- | 164 | /* Init debugging stuff */ |
|
- | 165 | udebug_task_init(&ta->udebug); |
|
173 | 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 | ||
174 | ipc_answerbox_init(&ta->answerbox, ta); |
174 | ipc_answerbox_init(&ta->answerbox, ta); |
175 | for (i = 0; i < IPC_MAX_PHONES; i++) |
175 | for (i = 0; i < IPC_MAX_PHONES; i++) |
176 | ipc_phone_init(&ta->phones[i]); |
176 | ipc_phone_init(&ta->phones[i]); |
177 | if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context, |
177 | if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context, |
178 | ta->context))) |
178 | ta->context))) |
179 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
179 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
180 | atomic_set(&ta->active_calls, 0); |
180 | atomic_set(&ta->active_calls, 0); |
181 | 181 | ||
182 | mutex_initialize(&ta->futexes_lock); |
182 | mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE); |
183 | btree_create(&ta->futexes); |
183 | btree_create(&ta->futexes); |
184 | 184 | ||
185 | ipl = interrupts_disable(); |
185 | ipl = interrupts_disable(); |
186 | 186 | ||
187 | /* |
187 | /* |
Line 200... | Line 200... | ||
200 | return ta; |
200 | return ta; |
201 | } |
201 | } |
202 | 202 | ||
203 | /** Destroy task. |
203 | /** Destroy task. |
204 | * |
204 | * |
205 | * @param t Task to be destroyed. |
205 | * @param t Task to be destroyed. |
206 | */ |
206 | */ |
207 | void task_destroy(task_t *t) |
207 | void task_destroy(task_t *t) |
208 | { |
208 | { |
209 | /* |
209 | /* |
210 | * Remove the task from the task B+tree. |
210 | * Remove the task from the task B+tree. |
Line 231... | Line 231... | ||
231 | 231 | ||
232 | free(t); |
232 | free(t); |
233 | TASK = NULL; |
233 | TASK = NULL; |
234 | } |
234 | } |
235 | 235 | ||
236 | /** Create new task with 1 thread and run it |
236 | /** Syscall for reading task ID from userspace. |
237 | * |
237 | * |
238 | * @param program_addr Address of program executable image. |
238 | * @param uspace_task_id userspace address of 8-byte buffer |
239 | * @param name Program name. |
239 | * where to store current task ID. |
240 | * |
240 | * |
241 | * @return Task of the running program or NULL on error. |
241 | * @return Zero on success or an error code from @ref errno.h. |
242 | */ |
242 | */ |
243 | task_t *task_run_program(void *program_addr, char *name) |
243 | unative_t sys_task_get_id(task_id_t *uspace_task_id) |
244 | { |
244 | { |
245 | as_t *as; |
- | |
246 | as_area_t *a; |
- | |
247 | unsigned int rc; |
- | |
248 | thread_t *t; |
- | |
249 | task_t *task; |
- | |
250 | uspace_arg_t *kernel_uarg; |
- | |
251 | - | ||
252 | as = as_create(0); |
- | |
253 | ASSERT(as); |
- | |
254 | - | ||
255 | rc = elf_load((elf_header_t *) program_addr, as); |
- | |
256 | if (rc != EE_OK) { |
- | |
257 | as_destroy(as); |
- | |
258 | return NULL; |
- | |
259 | } |
- | |
260 | - | ||
261 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
- | |
262 | kernel_uarg->uspace_entry = |
- | |
263 | (void *) ((elf_header_t *) program_addr)->e_entry; |
- | |
264 | kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS; |
- | |
265 | kernel_uarg->uspace_thread_function = NULL; |
- | |
266 | kernel_uarg->uspace_thread_arg = NULL; |
- | |
267 | kernel_uarg->uspace_uarg = NULL; |
- | |
268 | - | ||
269 | task = task_create(as, name); |
- | |
270 | ASSERT(task); |
- | |
271 | - | ||
272 | /* |
245 | /* |
- | 246 | * No need to acquire lock on TASK because taskid remains constant for |
|
273 | * Create the data as_area. |
247 | * the lifespan of the task. |
274 | */ |
248 | */ |
275 | a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE, |
- | |
276 | LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS, |
- | |
277 | AS_AREA_ATTR_NONE, &anon_backend, NULL); |
- | |
278 | - | ||
279 | /* |
- | |
280 | * Create the main thread. |
- | |
281 | */ |
- | |
282 | t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE, |
249 | return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid, |
283 | "uinit", false); |
250 | sizeof(TASK->taskid)); |
284 | ASSERT(t); |
- | |
285 | - | ||
286 | thread_ready(t); |
- | |
287 | - | ||
288 | return task; |
- | |
289 | } |
251 | } |
290 | 252 | ||
291 | /** Syscall for reading task ID from userspace. |
253 | /** Syscall for setting the task name. |
292 | * |
254 | * |
- | 255 | * The name simplifies identifying the task in the task list. |
|
- | 256 | * |
|
293 | * @param uspace_task_id Userspace address of 8-byte buffer where to store |
257 | * @param name The new name for the task. (typically the same |
294 | * current task ID. |
258 | * as the command used to execute it). |
295 | * |
259 | * |
296 | * @return 0 on success or an error code from @ref errno.h. |
260 | * @return 0 on success or an error code from @ref errno.h. |
297 | */ |
261 | */ |
298 | unative_t sys_task_get_id(task_id_t *uspace_task_id) |
262 | unative_t sys_task_set_name(const char *uspace_name, size_t name_len) |
299 | { |
263 | { |
- | 264 | int rc; |
|
- | 265 | char namebuf[TASK_NAME_BUFLEN]; |
|
300 | /* |
266 | |
301 | * No need to acquire lock on TASK because taskid |
267 | /* Cap length of name and copy it from userspace. */ |
- | 268 | ||
302 | * remains constant for the lifespan of the task. |
269 | if (name_len > TASK_NAME_BUFLEN - 1) |
- | 270 | name_len = TASK_NAME_BUFLEN - 1; |
|
303 | */ |
271 | |
304 | return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid, |
272 | rc = copy_from_uspace(namebuf, uspace_name, name_len); |
- | 273 | if (rc != 0) |
|
305 | sizeof(TASK->taskid)); |
274 | return (unative_t) rc; |
- | 275 | ||
- | 276 | namebuf[name_len] = '\0'; |
|
- | 277 | strncpy(TASK->name, namebuf, TASK_NAME_BUFLEN); |
|
- | 278 | ||
- | 279 | return EOK; |
|
306 | } |
280 | } |
307 | 281 | ||
308 | /** Find task structure corresponding to task ID. |
282 | /** Find task structure corresponding to task ID. |
309 | * |
283 | * |
310 | * The tasks_lock must be already held by the caller of this function |
284 | * The tasks_lock must be already held by the caller of this function and |
311 | * and interrupts must be disabled. |
285 | * interrupts must be disabled. |
312 | * |
286 | * |
313 | * @param id Task ID. |
287 | * @param id Task ID. |
314 | * |
288 | * |
315 | * @return Task structure address or NULL if there is no such task ID. |
289 | * @return Task structure address or NULL if there is no such task |
- | 290 | * ID. |
|
316 | */ |
291 | */ |
317 | task_t *task_find_by_id(task_id_t id) |
292 | task_t *task_find_by_id(task_id_t id) { avltree_node_t *node; |
318 | { |
- | |
319 | avltree_node_t *node; |
- | |
320 | 293 | ||
321 | node = avltree_search(&tasks_tree, (avltree_key_t) id); |
294 | node = avltree_search(&tasks_tree, (avltree_key_t) id); |
322 | 295 | ||
323 | if (node) |
296 | if (node) |
324 | return avltree_get_instance(node, task_t, tasks_tree_node); |
297 | return avltree_get_instance(node, task_t, tasks_tree_node); |
325 | return NULL; |
298 | return NULL; |
326 | } |
299 | } |
327 | 300 | ||
328 | /** Get accounting data of given task. |
301 | /** Get accounting data of given task. |
329 | * |
302 | * |
330 | * Note that task lock of 't' must be already held and |
303 | * Note that task lock of 't' must be already held and interrupts must be |
331 | * interrupts must be already disabled. |
304 | * already disabled. |
332 | * |
305 | * |
333 | * @param t Pointer to thread. |
306 | * @param t Pointer to thread. |
334 | * |
307 | * |
- | 308 | * @return Number of cycles used by the task and all its threads |
|
- | 309 | * so far. |
|
335 | */ |
310 | */ |
336 | uint64_t task_get_accounting(task_t *t) |
311 | uint64_t task_get_accounting(task_t *t) |
337 | { |
312 | { |
338 | /* Accumulated value of task */ |
313 | /* Accumulated value of task */ |
339 | uint64_t ret = t->cycles; |
314 | uint64_t ret = t->cycles; |
Line 361... | Line 336... | ||
361 | /** Kill task. |
336 | /** Kill task. |
362 | * |
337 | * |
363 | * This function is idempotent. |
338 | * This function is idempotent. |
364 | * It signals all the task's threads to bail it out. |
339 | * It signals all the task's threads to bail it out. |
365 | * |
340 | * |
366 | * @param id ID of the task to be killed. |
341 | * @param id ID of the task to be killed. |
367 | * |
342 | * |
368 | * @return 0 on success or an error code from errno.h |
343 | * @return Zero on success or an error code from errno.h. |
369 | */ |
344 | */ |
370 | int task_kill(task_id_t id) |
345 | int task_kill(task_id_t id) |
371 | { |
346 | { |
372 | ipl_t ipl; |
347 | ipl_t ipl; |
373 | task_t *ta; |
348 | task_t *ta; |
Line 384... | Line 359... | ||
384 | return ENOENT; |
359 | return ENOENT; |
385 | } |
360 | } |
386 | spinlock_unlock(&tasks_lock); |
361 | spinlock_unlock(&tasks_lock); |
387 | 362 | ||
388 | /* |
363 | /* |
389 | * Interrupt all threads except ktaskclnp. |
364 | * Interrupt all threads. |
390 | */ |
365 | */ |
391 | spinlock_lock(&ta->lock); |
366 | spinlock_lock(&ta->lock); |
392 | for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) { |
367 | for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) { |
393 | thread_t *thr; |
368 | thread_t *thr; |
394 | bool sleeping = false; |
369 | bool sleeping = false; |
395 | 370 | ||
396 | thr = list_get_instance(cur, thread_t, th_link); |
371 | thr = list_get_instance(cur, thread_t, th_link); |
397 | 372 | ||
398 | spinlock_lock(&thr->lock); |
373 | spinlock_lock(&thr->lock); |
399 | thr->interrupted = true; |
374 | thr->interrupted = true; |
400 | if (thr->state == Sleeping) |
375 | if (thr->state == Sleeping) |
401 | sleeping = true; |
376 | sleeping = true; |
402 | spinlock_unlock(&thr->lock); |
377 | spinlock_unlock(&thr->lock); |
Line 418... | Line 393... | ||
418 | spinlock_lock(&t->lock); |
393 | spinlock_lock(&t->lock); |
419 | 394 | ||
420 | uint64_t cycles; |
395 | uint64_t cycles; |
421 | char suffix; |
396 | char suffix; |
422 | order(task_get_accounting(t), &cycles, &suffix); |
397 | order(task_get_accounting(t), &cycles, &suffix); |
423 | 398 | ||
424 | if (sizeof(void *) == 4) |
399 | #ifdef __32_BITS__ |
425 | printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd", |
400 | printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %10p %10p %9" PRIu64 |
426 | t->taskid, t->name, t->context, t, t->as, cycles, suffix, |
401 | "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles, |
427 | t->refcount, atomic_get(&t->active_calls)); |
402 | suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls)); |
428 | else |
403 | #endif |
- | 404 | ||
- | 405 | #ifdef __64_BITS__ |
|
429 | printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd", |
406 | printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %18p %18p %9" PRIu64 |
430 | t->taskid, t->name, t->context, t, t->as, cycles, suffix, |
407 | "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles, |
431 | t->refcount, atomic_get(&t->active_calls)); |
408 | suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls)); |
- | 409 | #endif |
|
- | 410 | ||
432 | for (j = 0; j < IPC_MAX_PHONES; j++) { |
411 | for (j = 0; j < IPC_MAX_PHONES; j++) { |
433 | if (t->phones[j].callee) |
412 | if (t->phones[j].callee) |
434 | printf(" %zd:%#zx", j, t->phones[j].callee); |
413 | printf(" %d:%p", j, t->phones[j].callee); |
435 | } |
414 | } |
436 | printf("\n"); |
415 | printf("\n"); |
437 | 416 | ||
438 | spinlock_unlock(&t->lock); |
417 | spinlock_unlock(&t->lock); |
439 | return true; |
418 | return true; |
Line 445... | Line 424... | ||
445 | ipl_t ipl; |
424 | ipl_t ipl; |
446 | 425 | ||
447 | /* Messing with task structures, avoid deadlock */ |
426 | /* Messing with task structures, avoid deadlock */ |
448 | ipl = interrupts_disable(); |
427 | ipl = interrupts_disable(); |
449 | spinlock_lock(&tasks_lock); |
428 | spinlock_lock(&tasks_lock); |
450 | 429 | ||
451 | if (sizeof(void *) == 4) { |
430 | #ifdef __32_BITS__ |
452 | printf("taskid name ctx address as " |
431 | printf("taskid name ctx address as " |
453 | "cycles threads calls callee\n"); |
432 | "cycles threads calls callee\n"); |
454 | printf("------ ---------- --- ---------- ---------- " |
433 | printf("------ ------------ --- ---------- ---------- " |
455 | "---------- ------- ------ ------>\n"); |
434 | "---------- ------- ------ ------>\n"); |
456 | } else { |
435 | #endif |
- | 436 | ||
- | 437 | #ifdef __64_BITS__ |
|
457 | printf("taskid name ctx address as " |
438 | printf("taskid name ctx address as " |
458 | "cycles threads calls callee\n"); |
439 | "cycles threads calls callee\n"); |
459 | printf("------ ---------- --- ------------------ ------------------ " |
440 | printf("------ ------------ --- ------------------ ------------------ " |
460 | "---------- ------- ------ ------>\n"); |
441 | "---------- ------- ------ ------>\n"); |
461 | } |
442 | #endif |
462 | 443 | ||
463 | avltree_walk(&tasks_tree, task_print_walker, NULL); |
444 | avltree_walk(&tasks_tree, task_print_walker, NULL); |
464 | 445 | ||
465 | spinlock_unlock(&tasks_lock); |
446 | spinlock_unlock(&tasks_lock); |
466 | interrupts_restore(ipl); |
447 | interrupts_restore(ipl); |