Rev 1585 | Rev 1588 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1585 | Rev 1587 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** |
29 | /** |
30 | * @file task.c |
30 | * @file task.c |
31 | * @brief Task management. |
31 | * @brief Task management. |
32 | */ |
32 | */ |
33 | 33 | ||
34 | #include <main/uinit.h> |
34 | #include <main/uinit.h> |
35 | #include <proc/thread.h> |
35 | #include <proc/thread.h> |
36 | #include <proc/task.h> |
36 | #include <proc/task.h> |
37 | #include <proc/uarg.h> |
37 | #include <proc/uarg.h> |
38 | #include <mm/as.h> |
38 | #include <mm/as.h> |
39 | #include <mm/slab.h> |
39 | #include <mm/slab.h> |
40 | #include <synch/spinlock.h> |
40 | #include <synch/spinlock.h> |
41 | #include <arch.h> |
41 | #include <arch.h> |
42 | #include <panic.h> |
42 | #include <panic.h> |
43 | #include <adt/btree.h> |
43 | #include <adt/btree.h> |
44 | #include <adt/list.h> |
44 | #include <adt/list.h> |
45 | #include <ipc/ipc.h> |
45 | #include <ipc/ipc.h> |
46 | #include <security/cap.h> |
46 | #include <security/cap.h> |
47 | #include <memstr.h> |
47 | #include <memstr.h> |
48 | #include <print.h> |
48 | #include <print.h> |
49 | #include <elf.h> |
49 | #include <elf.h> |
50 | #include <errno.h> |
50 | #include <errno.h> |
51 | #include <syscall/copy.h> |
51 | #include <syscall/copy.h> |
52 | 52 | ||
53 | #ifndef LOADED_PROG_STACK_PAGES_NO |
53 | #ifndef LOADED_PROG_STACK_PAGES_NO |
54 | #define LOADED_PROG_STACK_PAGES_NO 1 |
54 | #define LOADED_PROG_STACK_PAGES_NO 1 |
55 | #endif |
55 | #endif |
56 | 56 | ||
57 | SPINLOCK_INITIALIZE(tasks_lock); |
57 | SPINLOCK_INITIALIZE(tasks_lock); |
58 | btree_t tasks_btree; |
58 | btree_t tasks_btree; |
59 | static task_id_t task_counter = 0; |
59 | static task_id_t task_counter = 0; |
60 | 60 | ||
61 | static void ktaskclnp(void *arg); |
61 | static void ktaskclnp(void *arg); |
62 | static void ktaskkill(void *arg); |
62 | static void ktaskkill(void *arg); |
63 | 63 | ||
64 | /** Initialize tasks |
64 | /** Initialize tasks |
65 | * |
65 | * |
66 | * Initialize kernel tasks support. |
66 | * Initialize kernel tasks support. |
67 | * |
67 | * |
68 | */ |
68 | */ |
69 | void task_init(void) |
69 | void task_init(void) |
70 | { |
70 | { |
71 | TASK = NULL; |
71 | TASK = NULL; |
72 | btree_create(&tasks_btree); |
72 | btree_create(&tasks_btree); |
73 | } |
73 | } |
74 | 74 | ||
75 | 75 | ||
76 | /** Create new task |
76 | /** Create new task |
77 | * |
77 | * |
78 | * Create new task with no threads. |
78 | * Create new task with no threads. |
79 | * |
79 | * |
80 | * @param as Task's address space. |
80 | * @param as Task's address space. |
81 | * @param name Symbolic name. |
81 | * @param name Symbolic name. |
82 | * |
82 | * |
83 | * @return New task's structure |
83 | * @return New task's structure |
84 | * |
84 | * |
85 | */ |
85 | */ |
86 | task_t *task_create(as_t *as, char *name) |
86 | task_t *task_create(as_t *as, char *name) |
87 | { |
87 | { |
88 | ipl_t ipl; |
88 | ipl_t ipl; |
89 | task_t *ta; |
89 | task_t *ta; |
90 | int i; |
90 | int i; |
91 | 91 | ||
92 | ta = (task_t *) malloc(sizeof(task_t), 0); |
92 | ta = (task_t *) malloc(sizeof(task_t), 0); |
93 | 93 | ||
94 | task_create_arch(ta); |
94 | task_create_arch(ta); |
95 | 95 | ||
96 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
96 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
97 | list_initialize(&ta->th_head); |
97 | list_initialize(&ta->th_head); |
98 | ta->as = as; |
98 | ta->as = as; |
99 | ta->name = name; |
99 | ta->name = name; |
100 | ta->main_thread = NULL; |
100 | ta->main_thread = NULL; |
101 | ta->refcount = 0; |
101 | ta->refcount = 0; |
102 | 102 | ||
103 | ta->capabilities = 0; |
103 | ta->capabilities = 0; |
104 | ta->accept_new_threads = true; |
104 | ta->accept_new_threads = true; |
105 | 105 | ||
106 | ipc_answerbox_init(&ta->answerbox); |
106 | ipc_answerbox_init(&ta->answerbox); |
107 | for (i=0; i < IPC_MAX_PHONES;i++) |
107 | for (i=0; i < IPC_MAX_PHONES;i++) |
108 | ipc_phone_init(&ta->phones[i]); |
108 | ipc_phone_init(&ta->phones[i]); |
109 | if (ipc_phone_0) |
109 | if (ipc_phone_0) |
110 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
110 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
111 | atomic_set(&ta->active_calls, 0); |
111 | atomic_set(&ta->active_calls, 0); |
112 | 112 | ||
113 | mutex_initialize(&ta->futexes_lock); |
113 | mutex_initialize(&ta->futexes_lock); |
114 | btree_create(&ta->futexes); |
114 | btree_create(&ta->futexes); |
115 | 115 | ||
116 | ipl = interrupts_disable(); |
116 | ipl = interrupts_disable(); |
117 | 117 | ||
118 | /* |
118 | /* |
119 | * Increment address space reference count. |
119 | * Increment address space reference count. |
120 | * TODO: Reconsider the locking scheme. |
120 | * TODO: Reconsider the locking scheme. |
121 | */ |
121 | */ |
122 | mutex_lock(&as->lock); |
122 | mutex_lock(&as->lock); |
123 | as->refcount++; |
123 | as->refcount++; |
124 | mutex_unlock(&as->lock); |
124 | mutex_unlock(&as->lock); |
125 | 125 | ||
126 | spinlock_lock(&tasks_lock); |
126 | spinlock_lock(&tasks_lock); |
127 | 127 | ||
128 | ta->taskid = ++task_counter; |
128 | ta->taskid = ++task_counter; |
129 | btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL); |
129 | btree_insert(&tasks_btree, (btree_key_t) ta->taskid, (void *) ta, NULL); |
130 | 130 | ||
131 | spinlock_unlock(&tasks_lock); |
131 | spinlock_unlock(&tasks_lock); |
132 | interrupts_restore(ipl); |
132 | interrupts_restore(ipl); |
133 | 133 | ||
134 | return ta; |
134 | return ta; |
135 | } |
135 | } |
136 | 136 | ||
137 | /** Destroy task. |
137 | /** Destroy task. |
138 | * |
138 | * |
139 | * @param t Task to be destroyed. |
139 | * @param t Task to be destroyed. |
140 | */ |
140 | */ |
141 | void task_destroy(task_t *t) |
141 | void task_destroy(task_t *t) |
142 | { |
142 | { |
- | 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; |
|
143 | } |
163 | } |
144 | 164 | ||
145 | /** Create new task with 1 thread and run it |
165 | /** Create new task with 1 thread and run it |
146 | * |
166 | * |
147 | * @param program_addr Address of program executable image. |
167 | * @param program_addr Address of program executable image. |
148 | * @param name Program name. |
168 | * @param name Program name. |
149 | * |
169 | * |
150 | * @return Task of the running program or NULL on error. |
170 | * @return Task of the running program or NULL on error. |
151 | */ |
171 | */ |
152 | task_t * task_run_program(void *program_addr, char *name) |
172 | task_t * task_run_program(void *program_addr, char *name) |
153 | { |
173 | { |
154 | as_t *as; |
174 | as_t *as; |
155 | as_area_t *a; |
175 | as_area_t *a; |
156 | int rc; |
176 | int rc; |
157 | thread_t *t1, *t2; |
177 | thread_t *t1, *t2; |
158 | task_t *task; |
178 | task_t *task; |
159 | uspace_arg_t *kernel_uarg; |
179 | uspace_arg_t *kernel_uarg; |
160 | 180 | ||
161 | as = as_create(0); |
181 | as = as_create(0); |
162 | ASSERT(as); |
182 | ASSERT(as); |
163 | 183 | ||
164 | rc = elf_load((elf_header_t *) program_addr, as); |
184 | rc = elf_load((elf_header_t *) program_addr, as); |
165 | if (rc != EE_OK) { |
185 | if (rc != EE_OK) { |
166 | as_destroy(as); |
186 | as_destroy(as); |
167 | return NULL; |
187 | return NULL; |
168 | } |
188 | } |
169 | 189 | ||
170 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
190 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
171 | kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry; |
191 | kernel_uarg->uspace_entry = (void *) ((elf_header_t *) program_addr)->e_entry; |
172 | kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS; |
192 | kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS; |
173 | kernel_uarg->uspace_thread_function = NULL; |
193 | kernel_uarg->uspace_thread_function = NULL; |
174 | kernel_uarg->uspace_thread_arg = NULL; |
194 | kernel_uarg->uspace_thread_arg = NULL; |
175 | kernel_uarg->uspace_uarg = NULL; |
195 | kernel_uarg->uspace_uarg = NULL; |
176 | 196 | ||
177 | task = task_create(as, name); |
197 | task = task_create(as, name); |
178 | ASSERT(task); |
198 | ASSERT(task); |
179 | 199 | ||
180 | /* |
200 | /* |
181 | * Create the data as_area. |
201 | * Create the data as_area. |
182 | */ |
202 | */ |
183 | a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE, |
203 | a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE, |
184 | LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, |
204 | LOADED_PROG_STACK_PAGES_NO*PAGE_SIZE, |
185 | USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL); |
205 | USTACK_ADDRESS, AS_AREA_ATTR_NONE, &anon_backend, NULL); |
186 | 206 | ||
187 | /* |
207 | /* |
188 | * Create the main thread. |
208 | * Create the main thread. |
189 | */ |
209 | */ |
190 | t1 = thread_create(uinit, kernel_uarg, task, 0, "uinit"); |
210 | t1 = thread_create(uinit, kernel_uarg, task, 0, "uinit"); |
191 | ASSERT(t1); |
211 | ASSERT(t1); |
192 | 212 | ||
193 | /* |
213 | /* |
194 | * Create killer thread for the new task. |
214 | * Create killer thread for the new task. |
195 | */ |
215 | */ |
196 | t2 = thread_create(ktaskkill, t1, task, 0, "ktaskkill"); |
216 | t2 = thread_create(ktaskkill, t1, task, 0, "ktaskkill"); |
197 | ASSERT(t2); |
217 | ASSERT(t2); |
198 | thread_ready(t2); |
218 | thread_ready(t2); |
199 | 219 | ||
200 | thread_ready(t1); |
220 | thread_ready(t1); |
201 | 221 | ||
202 | return task; |
222 | return task; |
203 | } |
223 | } |
204 | 224 | ||
205 | /** Syscall for reading task ID from userspace. |
225 | /** Syscall for reading task ID from userspace. |
206 | * |
226 | * |
207 | * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID. |
227 | * @param uspace_task_id Userspace address of 8-byte buffer where to store current task ID. |
208 | * |
228 | * |
209 | * @return 0 on success or an error code from @ref errno.h. |
229 | * @return 0 on success or an error code from @ref errno.h. |
210 | */ |
230 | */ |
211 | __native sys_task_get_id(task_id_t *uspace_task_id) |
231 | __native sys_task_get_id(task_id_t *uspace_task_id) |
212 | { |
232 | { |
213 | /* |
233 | /* |
214 | * No need to acquire lock on TASK because taskid |
234 | * No need to acquire lock on TASK because taskid |
215 | * remains constant for the lifespan of the task. |
235 | * remains constant for the lifespan of the task. |
216 | */ |
236 | */ |
217 | return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid)); |
237 | return (__native) copy_to_uspace(uspace_task_id, &TASK->taskid, sizeof(TASK->taskid)); |
218 | } |
238 | } |
219 | 239 | ||
220 | /** Find task structure corresponding to task ID. |
240 | /** Find task structure corresponding to task ID. |
221 | * |
241 | * |
222 | * The tasks_lock must be already held by the caller of this function |
242 | * The tasks_lock must be already held by the caller of this function |
223 | * and interrupts must be disabled. |
243 | * and interrupts must be disabled. |
224 | * |
244 | * |
225 | * @param id Task ID. |
245 | * @param id Task ID. |
226 | * |
246 | * |
227 | * @return Task structure address or NULL if there is no such task ID. |
247 | * @return Task structure address or NULL if there is no such task ID. |
228 | */ |
248 | */ |
229 | task_t *task_find_by_id(task_id_t id) |
249 | task_t *task_find_by_id(task_id_t id) |
230 | { |
250 | { |
231 | btree_node_t *leaf; |
251 | btree_node_t *leaf; |
232 | 252 | ||
233 | return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf); |
253 | return (task_t *) btree_search(&tasks_btree, (btree_key_t) id, &leaf); |
234 | } |
254 | } |
235 | 255 | ||
236 | /** Kill task. |
256 | /** Kill task. |
237 | * |
257 | * |
238 | * @param id ID of the task to be killed. |
258 | * @param id ID of the task to be killed. |
239 | * |
259 | * |
240 | * @return 0 on success or an error code from errno.h |
260 | * @return 0 on success or an error code from errno.h |
241 | */ |
261 | */ |
242 | int task_kill(task_id_t id) |
262 | int task_kill(task_id_t id) |
243 | { |
263 | { |
244 | ipl_t ipl; |
264 | ipl_t ipl; |
245 | task_t *ta; |
265 | task_t *ta; |
246 | thread_t *t; |
266 | thread_t *t; |
247 | link_t *cur; |
267 | link_t *cur; |
248 | 268 | ||
249 | ipl = interrupts_disable(); |
269 | ipl = interrupts_disable(); |
250 | spinlock_lock(&tasks_lock); |
270 | spinlock_lock(&tasks_lock); |
251 | 271 | ||
252 | if (!(ta = task_find_by_id(id))) { |
272 | if (!(ta = task_find_by_id(id))) { |
253 | spinlock_unlock(&tasks_lock); |
273 | spinlock_unlock(&tasks_lock); |
254 | interrupts_restore(ipl); |
274 | interrupts_restore(ipl); |
255 | return ENOENT; |
275 | return ENOENT; |
256 | } |
276 | } |
257 | 277 | ||
258 | spinlock_lock(&ta->lock); |
278 | spinlock_lock(&ta->lock); |
259 | ta->refcount++; |
279 | ta->refcount++; |
260 | spinlock_unlock(&ta->lock); |
280 | spinlock_unlock(&ta->lock); |
- | 281 | ||
- | 282 | spinlock_unlock(&tasks_lock); |
|
261 | 283 | ||
262 | t = thread_create(ktaskclnp, NULL, ta, 0, "ktaskclnp"); |
284 | t = thread_create(ktaskclnp, NULL, ta, 0, "ktaskclnp"); |
263 | 285 | ||
264 | spinlock_lock(&ta->lock); |
286 | spinlock_lock(&ta->lock); |
265 | ta->accept_new_threads = false; |
287 | ta->accept_new_threads = false; |
266 | ta->refcount--; |
288 | ta->refcount--; |
267 | 289 | ||
268 | /* |
290 | /* |
269 | * Interrupt all threads except this one. |
291 | * Interrupt all threads except this one. |
270 | */ |
292 | */ |
271 | for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) { |
293 | for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) { |
272 | thread_t *thr; |
294 | thread_t *thr; |
273 | bool sleeping = false; |
295 | bool sleeping = false; |
274 | 296 | ||
275 | thr = list_get_instance(cur, thread_t, th_link); |
297 | thr = list_get_instance(cur, thread_t, th_link); |
276 | if (thr == t) |
298 | if (thr == t) |
277 | continue; |
299 | continue; |
278 | 300 | ||
279 | spinlock_lock(&thr->lock); |
301 | spinlock_lock(&thr->lock); |
280 | thr->interrupted = true; |
302 | thr->interrupted = true; |
281 | if (thr->state == Sleeping) |
303 | if (thr->state == Sleeping) |
282 | sleeping = true; |
304 | sleeping = true; |
283 | spinlock_unlock(&thr->lock); |
305 | spinlock_unlock(&thr->lock); |
284 | 306 | ||
285 | if (sleeping) |
307 | if (sleeping) |
286 | waitq_interrupt_sleep(thr); |
308 | waitq_interrupt_sleep(thr); |
287 | } |
309 | } |
288 | 310 | ||
289 | spinlock_unlock(&ta->lock); |
311 | spinlock_unlock(&ta->lock); |
290 | interrupts_restore(ipl); |
312 | interrupts_restore(ipl); |
291 | 313 | ||
292 | if (t) |
314 | if (t) |
293 | thread_ready(t); |
315 | thread_ready(t); |
294 | 316 | ||
295 | return 0; |
317 | return 0; |
296 | } |
318 | } |
297 | 319 | ||
298 | /** Print task list */ |
320 | /** Print task list */ |
299 | void task_print_list(void) |
321 | void task_print_list(void) |
300 | { |
322 | { |
301 | link_t *cur; |
323 | link_t *cur; |
302 | ipl_t ipl; |
324 | ipl_t ipl; |
303 | 325 | ||
304 | /* Messing with thread structures, avoid deadlock */ |
326 | /* Messing with thread structures, avoid deadlock */ |
305 | ipl = interrupts_disable(); |
327 | ipl = interrupts_disable(); |
306 | spinlock_lock(&tasks_lock); |
328 | spinlock_lock(&tasks_lock); |
307 | 329 | ||
308 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
330 | for (cur = tasks_btree.leaf_head.next; cur != &tasks_btree.leaf_head; cur = cur->next) { |
309 | btree_node_t *node; |
331 | btree_node_t *node; |
310 | int i; |
332 | int i; |
311 | 333 | ||
312 | node = list_get_instance(cur, btree_node_t, leaf_link); |
334 | node = list_get_instance(cur, btree_node_t, leaf_link); |
313 | for (i = 0; i < node->keys; i++) { |
335 | for (i = 0; i < node->keys; i++) { |
314 | task_t *t; |
336 | task_t *t; |
315 | int j; |
337 | int j; |
316 | 338 | ||
317 | t = (task_t *) node->value[i]; |
339 | t = (task_t *) node->value[i]; |
318 | 340 | ||
319 | spinlock_lock(&t->lock); |
341 | spinlock_lock(&t->lock); |
320 | printf("%s(%lld): address=%#zX, as=%#zX, ActiveCalls: %zd", |
342 | printf("%s(%lld): address=%#zX, as=%#zX, ActiveCalls: %zd", |
321 | t->name, t->taskid, t, t->as, atomic_get(&t->active_calls)); |
343 | t->name, t->taskid, t, t->as, atomic_get(&t->active_calls)); |
322 | for (j=0; j < IPC_MAX_PHONES; j++) { |
344 | for (j=0; j < IPC_MAX_PHONES; j++) { |
323 | if (t->phones[j].callee) |
345 | if (t->phones[j].callee) |
324 | printf(" Ph(%zd): %#zX ", j, t->phones[j].callee); |
346 | printf(" Ph(%zd): %#zX ", j, t->phones[j].callee); |
325 | } |
347 | } |
326 | printf("\n"); |
348 | printf("\n"); |
327 | spinlock_unlock(&t->lock); |
349 | spinlock_unlock(&t->lock); |
328 | } |
350 | } |
329 | } |
351 | } |
330 | 352 | ||
331 | spinlock_unlock(&tasks_lock); |
353 | spinlock_unlock(&tasks_lock); |
332 | interrupts_restore(ipl); |
354 | interrupts_restore(ipl); |
333 | } |
355 | } |
334 | 356 | ||
335 | /** Kernel thread used to cleanup the task after it is killed. */ |
357 | /** Kernel thread used to cleanup the task after it is killed. */ |
336 | void ktaskclnp(void *arg) |
358 | void ktaskclnp(void *arg) |
337 | { |
359 | { |
338 | ipl_t ipl; |
360 | ipl_t ipl; |
339 | thread_t *t = NULL, *main_thread; |
361 | thread_t *t = NULL, *main_thread; |
340 | link_t *cur; |
362 | link_t *cur; |
341 | 363 | ||
342 | thread_detach(THREAD); |
364 | thread_detach(THREAD); |
343 | 365 | ||
344 | loop: |
366 | loop: |
345 | ipl = interrupts_disable(); |
367 | ipl = interrupts_disable(); |
346 | spinlock_lock(&TASK->lock); |
368 | spinlock_lock(&TASK->lock); |
347 | 369 | ||
348 | main_thread = TASK->main_thread; |
370 | main_thread = TASK->main_thread; |
349 | 371 | ||
350 | /* |
372 | /* |
351 | * Find a thread to join. |
373 | * Find a thread to join. |
352 | */ |
374 | */ |
353 | for (cur = TASK->th_head.next; cur != &TASK->th_head; cur = cur->next) { |
375 | for (cur = TASK->th_head.next; cur != &TASK->th_head; cur = cur->next) { |
354 | t = list_get_instance(cur, thread_t, th_link); |
376 | t = list_get_instance(cur, thread_t, th_link); |
355 | if (t == THREAD) |
377 | if (t == THREAD) |
356 | continue; |
378 | continue; |
357 | else if (t == main_thread) |
379 | else if (t == main_thread) |
358 | continue; |
380 | continue; |
359 | else |
381 | else |
360 | break; |
382 | break; |
361 | } |
383 | } |
362 | 384 | ||
363 | spinlock_unlock(&TASK->lock); |
385 | spinlock_unlock(&TASK->lock); |
364 | interrupts_restore(ipl); |
386 | interrupts_restore(ipl); |
365 | 387 | ||
366 | if (t != THREAD) { |
388 | if (t != THREAD) { |
367 | ASSERT(t != main_thread); /* uninit is joined and detached in ktaskkill */ |
389 | ASSERT(t != main_thread); /* uninit is joined and detached in ktaskkill */ |
368 | thread_join(t); |
390 | thread_join(t); |
369 | thread_detach(t); |
391 | thread_detach(t); |
370 | goto loop; /* go for another thread */ |
392 | goto loop; /* go for another thread */ |
371 | } |
393 | } |
372 | 394 | ||
373 | /* |
395 | /* |
374 | * Now there are no other threads in this task |
396 | * Now there are no other threads in this task |
375 | * and no new threads can be created. |
397 | * and no new threads can be created. |
376 | */ |
398 | */ |
377 | 399 | ||
378 | ipc_cleanup(); |
400 | ipc_cleanup(); |
379 | futex_cleanup(); |
401 | futex_cleanup(); |
380 | } |
402 | } |
381 | 403 | ||
382 | /** Kernel task used to kill a userspace task when its main thread exits. |
404 | /** Kernel task used to kill a userspace task when its main thread exits. |
383 | * |
405 | * |
384 | * This thread waits until the main userspace thread (i.e. uninit) exits. |
406 | * This thread waits until the main userspace thread (i.e. uninit) exits. |
385 | * When this happens, the task is killed. |
407 | * When this happens, the task is killed. |
386 | * |
408 | * |
387 | * @param arg Pointer to the thread structure of the task's main thread. |
409 | * @param arg Pointer to the thread structure of the task's main thread. |
388 | */ |
410 | */ |
389 | void ktaskkill(void *arg) |
411 | void ktaskkill(void *arg) |
390 | { |
412 | { |
391 | thread_t *t = (thread_t *) arg; |
413 | thread_t *t = (thread_t *) arg; |
392 | 414 | ||
393 | /* |
415 | /* |
394 | * Userspace threads cannot detach themselves, |
416 | * Userspace threads cannot detach themselves, |
395 | * therefore the thread pointer is guaranteed to be valid. |
417 | * therefore the thread pointer is guaranteed to be valid. |
396 | */ |
418 | */ |
397 | thread_join(t); /* sleep uninterruptibly here! */ |
419 | thread_join(t); /* sleep uninterruptibly here! */ |
398 | thread_detach(t); |
420 | thread_detach(t); |
399 | task_kill(TASK->taskid); |
421 | task_kill(TASK->taskid); |
400 | } |
422 | } |
401 | 423 |