Rev 3386 | Rev 4327 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3386 | Rev 4153 | ||
---|---|---|---|
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 | /** @addtogroup genericproc |
29 | /** @addtogroup genericproc |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief Task management. |
35 | * @brief Task management. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <proc/thread.h> |
38 | #include <proc/thread.h> |
39 | #include <proc/task.h> |
39 | #include <proc/task.h> |
40 | #include <mm/as.h> |
40 | #include <mm/as.h> |
41 | #include <mm/slab.h> |
41 | #include <mm/slab.h> |
42 | #include <atomic.h> |
42 | #include <atomic.h> |
43 | #include <synch/spinlock.h> |
43 | #include <synch/spinlock.h> |
44 | #include <synch/waitq.h> |
44 | #include <synch/waitq.h> |
45 | #include <arch.h> |
45 | #include <arch.h> |
46 | #include <arch/barrier.h> |
46 | #include <arch/barrier.h> |
47 | #include <adt/avl.h> |
47 | #include <adt/avl.h> |
48 | #include <adt/btree.h> |
48 | #include <adt/btree.h> |
49 | #include <adt/list.h> |
49 | #include <adt/list.h> |
50 | #include <ipc/ipc.h> |
50 | #include <ipc/ipc.h> |
51 | #include <ipc/ipcrsc.h> |
51 | #include <ipc/ipcrsc.h> |
52 | #include <print.h> |
52 | #include <print.h> |
53 | #include <errno.h> |
53 | #include <errno.h> |
54 | #include <func.h> |
54 | #include <func.h> |
- | 55 | #include <string.h> |
|
55 | #include <syscall/copy.h> |
56 | #include <syscall/copy.h> |
56 | 57 | ||
57 | /** Spinlock protecting the tasks_tree AVL tree. */ |
58 | /** Spinlock protecting the tasks_tree AVL tree. */ |
58 | SPINLOCK_INITIALIZE(tasks_lock); |
59 | SPINLOCK_INITIALIZE(tasks_lock); |
59 | 60 | ||
60 | /** AVL tree of active tasks. |
61 | /** AVL tree of active tasks. |
61 | * |
62 | * |
62 | * The task is guaranteed to exist after it was found in the tasks_tree as |
63 | * The task is guaranteed to exist after it was found in the tasks_tree as |
63 | * long as: |
64 | * long as: |
64 | * @li the tasks_lock is held, |
65 | * @li the tasks_lock is held, |
65 | * @li the task's lock is held when task's lock is acquired before releasing |
66 | * @li the task's lock is held when task's lock is acquired before releasing |
66 | * tasks_lock or |
67 | * tasks_lock or |
67 | * @li the task's refcount is greater than 0 |
68 | * @li the task's refcount is greater than 0 |
68 | * |
69 | * |
69 | */ |
70 | */ |
70 | avltree_t tasks_tree; |
71 | avltree_t tasks_tree; |
71 | 72 | ||
72 | static task_id_t task_counter = 0; |
73 | static task_id_t task_counter = 0; |
73 | 74 | ||
74 | /** Initialize kernel tasks support. */ |
75 | /** Initialize kernel tasks support. */ |
75 | void task_init(void) |
76 | void task_init(void) |
76 | { |
77 | { |
77 | TASK = NULL; |
78 | TASK = NULL; |
78 | avltree_create(&tasks_tree); |
79 | avltree_create(&tasks_tree); |
79 | } |
80 | } |
80 | 81 | ||
81 | /* |
82 | /* |
82 | * The idea behind this walker is to remember a single task different from |
83 | * The idea behind this walker is to remember a single task different from |
83 | * TASK. |
84 | * TASK. |
84 | */ |
85 | */ |
85 | static bool task_done_walker(avltree_node_t *node, void *arg) |
86 | static bool task_done_walker(avltree_node_t *node, void *arg) |
86 | { |
87 | { |
87 | 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); |
88 | task_t **tp = (task_t **) arg; |
89 | task_t **tp = (task_t **) arg; |
89 | 90 | ||
90 | if (t != TASK) { |
91 | if (t != TASK) { |
91 | *tp = t; |
92 | *tp = t; |
92 | return false; /* stop walking */ |
93 | return false; /* stop walking */ |
93 | } |
94 | } |
94 | 95 | ||
95 | return true; /* continue the walk */ |
96 | return true; /* continue the walk */ |
96 | } |
97 | } |
97 | 98 | ||
98 | /** Kill all tasks except the current task. */ |
99 | /** Kill all tasks except the current task. */ |
99 | void task_done(void) |
100 | void task_done(void) |
100 | { |
101 | { |
101 | task_t *t; |
102 | task_t *t; |
102 | do { /* Repeat until there are any tasks except TASK */ |
103 | do { /* Repeat until there are any tasks except TASK */ |
103 | 104 | ||
104 | /* Messing with task structures, avoid deadlock */ |
105 | /* Messing with task structures, avoid deadlock */ |
105 | ipl_t ipl = interrupts_disable(); |
106 | ipl_t ipl = interrupts_disable(); |
106 | spinlock_lock(&tasks_lock); |
107 | spinlock_lock(&tasks_lock); |
107 | 108 | ||
108 | t = NULL; |
109 | t = NULL; |
109 | avltree_walk(&tasks_tree, task_done_walker, &t); |
110 | avltree_walk(&tasks_tree, task_done_walker, &t); |
110 | 111 | ||
111 | if (t != NULL) { |
112 | if (t != NULL) { |
112 | task_id_t id = t->taskid; |
113 | task_id_t id = t->taskid; |
113 | 114 | ||
114 | spinlock_unlock(&tasks_lock); |
115 | spinlock_unlock(&tasks_lock); |
115 | interrupts_restore(ipl); |
116 | interrupts_restore(ipl); |
116 | 117 | ||
117 | #ifdef CONFIG_DEBUG |
118 | #ifdef CONFIG_DEBUG |
118 | printf("Killing task %" PRIu64 "\n", id); |
119 | printf("Killing task %" PRIu64 "\n", id); |
119 | #endif |
120 | #endif |
120 | task_kill(id); |
121 | task_kill(id); |
121 | thread_usleep(10000); |
122 | thread_usleep(10000); |
122 | } else { |
123 | } else { |
123 | spinlock_unlock(&tasks_lock); |
124 | spinlock_unlock(&tasks_lock); |
124 | interrupts_restore(ipl); |
125 | interrupts_restore(ipl); |
125 | } |
126 | } |
126 | 127 | ||
127 | } while (t != NULL); |
128 | } while (t != NULL); |
128 | } |
129 | } |
129 | 130 | ||
130 | /** Create new task with no threads. |
131 | /** Create new task with no threads. |
131 | * |
132 | * |
132 | * @param as Task's address space. |
133 | * @param as Task's address space. |
133 | * @param name Symbolic name. |
134 | * @param name Symbolic name (a copy is made). |
134 | * |
135 | * |
135 | * @return New task's structure. |
136 | * @return New task's structure. |
136 | * |
137 | * |
137 | */ |
138 | */ |
138 | task_t *task_create(as_t *as, char *name) |
139 | task_t *task_create(as_t *as, char *name) |
139 | { |
140 | { |
140 | ipl_t ipl; |
141 | ipl_t ipl; |
141 | task_t *ta; |
142 | task_t *ta; |
142 | int i; |
143 | int i; |
143 | 144 | ||
144 | ta = (task_t *) malloc(sizeof(task_t), 0); |
145 | ta = (task_t *) malloc(sizeof(task_t), 0); |
145 | 146 | ||
146 | task_create_arch(ta); |
147 | task_create_arch(ta); |
147 | 148 | ||
148 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
149 | spinlock_initialize(&ta->lock, "task_ta_lock"); |
149 | list_initialize(&ta->th_head); |
150 | list_initialize(&ta->th_head); |
150 | ta->as = as; |
151 | ta->as = as; |
- | 152 | ||
- | 153 | memcpy(ta->name, name, TASK_NAME_BUFLEN); |
|
151 | ta->name = name; |
154 | ta->name[TASK_NAME_BUFLEN - 1] = '\0'; |
- | 155 | ||
152 | atomic_set(&ta->refcount, 0); |
156 | atomic_set(&ta->refcount, 0); |
153 | atomic_set(&ta->lifecount, 0); |
157 | atomic_set(&ta->lifecount, 0); |
154 | ta->context = CONTEXT; |
158 | ta->context = CONTEXT; |
155 | 159 | ||
156 | ta->capabilities = 0; |
160 | ta->capabilities = 0; |
157 | ta->cycles = 0; |
161 | ta->cycles = 0; |
- | 162 | ||
- | 163 | #ifdef CONFIG_UDEBUG |
|
- | 164 | /* Init debugging stuff */ |
|
- | 165 | udebug_task_init(&ta->udebug); |
|
158 | 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 | ||
159 | ipc_answerbox_init(&ta->answerbox, ta); |
174 | ipc_answerbox_init(&ta->answerbox, ta); |
160 | for (i = 0; i < IPC_MAX_PHONES; i++) |
175 | for (i = 0; i < IPC_MAX_PHONES; i++) |
161 | ipc_phone_init(&ta->phones[i]); |
176 | ipc_phone_init(&ta->phones[i]); |
162 | if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context, |
177 | if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context, |
163 | ta->context))) |
178 | ta->context))) |
164 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
179 | ipc_phone_connect(&ta->phones[0], ipc_phone_0); |
165 | atomic_set(&ta->active_calls, 0); |
180 | atomic_set(&ta->active_calls, 0); |
166 | 181 | ||
167 | mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE); |
182 | mutex_initialize(&ta->futexes_lock, MUTEX_PASSIVE); |
168 | btree_create(&ta->futexes); |
183 | btree_create(&ta->futexes); |
169 | 184 | ||
170 | ipl = interrupts_disable(); |
185 | ipl = interrupts_disable(); |
171 | 186 | ||
172 | /* |
187 | /* |
173 | * Increment address space reference count. |
188 | * Increment address space reference count. |
174 | */ |
189 | */ |
175 | atomic_inc(&as->refcount); |
190 | atomic_inc(&as->refcount); |
176 | 191 | ||
177 | spinlock_lock(&tasks_lock); |
192 | spinlock_lock(&tasks_lock); |
178 | ta->taskid = ++task_counter; |
193 | ta->taskid = ++task_counter; |
179 | avltree_node_initialize(&ta->tasks_tree_node); |
194 | avltree_node_initialize(&ta->tasks_tree_node); |
180 | ta->tasks_tree_node.key = ta->taskid; |
195 | ta->tasks_tree_node.key = ta->taskid; |
181 | avltree_insert(&tasks_tree, &ta->tasks_tree_node); |
196 | avltree_insert(&tasks_tree, &ta->tasks_tree_node); |
182 | spinlock_unlock(&tasks_lock); |
197 | spinlock_unlock(&tasks_lock); |
183 | interrupts_restore(ipl); |
198 | interrupts_restore(ipl); |
184 | 199 | ||
185 | return ta; |
200 | return ta; |
186 | } |
201 | } |
187 | 202 | ||
188 | /** Destroy task. |
203 | /** Destroy task. |
189 | * |
204 | * |
190 | * @param t Task to be destroyed. |
205 | * @param t Task to be destroyed. |
191 | */ |
206 | */ |
192 | void task_destroy(task_t *t) |
207 | void task_destroy(task_t *t) |
193 | { |
208 | { |
194 | /* |
209 | /* |
195 | * Remove the task from the task B+tree. |
210 | * Remove the task from the task B+tree. |
196 | */ |
211 | */ |
197 | spinlock_lock(&tasks_lock); |
212 | spinlock_lock(&tasks_lock); |
198 | avltree_delete(&tasks_tree, &t->tasks_tree_node); |
213 | avltree_delete(&tasks_tree, &t->tasks_tree_node); |
199 | spinlock_unlock(&tasks_lock); |
214 | spinlock_unlock(&tasks_lock); |
200 | 215 | ||
201 | /* |
216 | /* |
202 | * Perform architecture specific task destruction. |
217 | * Perform architecture specific task destruction. |
203 | */ |
218 | */ |
204 | task_destroy_arch(t); |
219 | task_destroy_arch(t); |
205 | 220 | ||
206 | /* |
221 | /* |
207 | * Free up dynamically allocated state. |
222 | * Free up dynamically allocated state. |
208 | */ |
223 | */ |
209 | btree_destroy(&t->futexes); |
224 | btree_destroy(&t->futexes); |
210 | 225 | ||
211 | /* |
226 | /* |
212 | * Drop our reference to the address space. |
227 | * Drop our reference to the address space. |
213 | */ |
228 | */ |
214 | if (atomic_predec(&t->as->refcount) == 0) |
229 | if (atomic_predec(&t->as->refcount) == 0) |
215 | as_destroy(t->as); |
230 | as_destroy(t->as); |
216 | 231 | ||
217 | free(t); |
232 | free(t); |
218 | TASK = NULL; |
233 | TASK = NULL; |
219 | } |
234 | } |
220 | 235 | ||
221 | /** Syscall for reading task ID from userspace. |
236 | /** Syscall for reading task ID from userspace. |
222 | * |
237 | * |
223 | * @param uspace_task_id userspace address of 8-byte buffer |
238 | * @param uspace_task_id userspace address of 8-byte buffer |
224 | * where to store current task ID. |
239 | * where to store current task ID. |
225 | * |
240 | * |
226 | * @return Zero on success or an error code from @ref errno.h. |
241 | * @return Zero on success or an error code from @ref errno.h. |
227 | */ |
242 | */ |
228 | unative_t sys_task_get_id(task_id_t *uspace_task_id) |
243 | unative_t sys_task_get_id(task_id_t *uspace_task_id) |
229 | { |
244 | { |
230 | /* |
245 | /* |
231 | * No need to acquire lock on TASK because taskid remains constant for |
246 | * No need to acquire lock on TASK because taskid remains constant for |
232 | * the lifespan of the task. |
247 | * the lifespan of the task. |
233 | */ |
248 | */ |
234 | return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid, |
249 | return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid, |
235 | sizeof(TASK->taskid)); |
250 | sizeof(TASK->taskid)); |
236 | } |
251 | } |
237 | 252 | ||
- | 253 | /** Syscall for setting the task name. |
|
- | 254 | * |
|
- | 255 | * The name simplifies identifying the task in the task list. |
|
- | 256 | * |
|
- | 257 | * @param name The new name for the task. (typically the same |
|
- | 258 | * as the command used to execute it). |
|
- | 259 | * |
|
- | 260 | * @return 0 on success or an error code from @ref errno.h. |
|
- | 261 | */ |
|
- | 262 | unative_t sys_task_set_name(const char *uspace_name, size_t name_len) |
|
- | 263 | { |
|
- | 264 | int rc; |
|
- | 265 | char namebuf[TASK_NAME_BUFLEN]; |
|
- | 266 | ||
- | 267 | /* Cap length of name and copy it from userspace. */ |
|
- | 268 | ||
- | 269 | if (name_len > TASK_NAME_BUFLEN - 1) |
|
- | 270 | name_len = TASK_NAME_BUFLEN - 1; |
|
- | 271 | ||
- | 272 | rc = copy_from_uspace(namebuf, uspace_name, name_len); |
|
- | 273 | if (rc != 0) |
|
- | 274 | return (unative_t) rc; |
|
- | 275 | ||
- | 276 | namebuf[name_len] = '\0'; |
|
- | 277 | strncpy(TASK->name, namebuf, TASK_NAME_BUFLEN); |
|
- | 278 | ||
- | 279 | return EOK; |
|
- | 280 | } |
|
- | 281 | ||
238 | /** Find task structure corresponding to task ID. |
282 | /** Find task structure corresponding to task ID. |
239 | * |
283 | * |
240 | * The tasks_lock must be already held by the caller of this function and |
284 | * The tasks_lock must be already held by the caller of this function and |
241 | * interrupts must be disabled. |
285 | * interrupts must be disabled. |
242 | * |
286 | * |
243 | * @param id Task ID. |
287 | * @param id Task ID. |
244 | * |
288 | * |
245 | * @return Task structure address or NULL if there is no such task |
289 | * @return Task structure address or NULL if there is no such task |
246 | * ID. |
290 | * ID. |
247 | */ |
291 | */ |
248 | task_t *task_find_by_id(task_id_t id) { avltree_node_t *node; |
292 | task_t *task_find_by_id(task_id_t id) { avltree_node_t *node; |
249 | 293 | ||
250 | node = avltree_search(&tasks_tree, (avltree_key_t) id); |
294 | node = avltree_search(&tasks_tree, (avltree_key_t) id); |
251 | 295 | ||
252 | if (node) |
296 | if (node) |
253 | return avltree_get_instance(node, task_t, tasks_tree_node); |
297 | return avltree_get_instance(node, task_t, tasks_tree_node); |
254 | return NULL; |
298 | return NULL; |
255 | } |
299 | } |
256 | 300 | ||
257 | /** Get accounting data of given task. |
301 | /** Get accounting data of given task. |
258 | * |
302 | * |
259 | * Note that task lock of 't' must be already held and interrupts must be |
303 | * Note that task lock of 't' must be already held and interrupts must be |
260 | * already disabled. |
304 | * already disabled. |
261 | * |
305 | * |
262 | * @param t Pointer to thread. |
306 | * @param t Pointer to thread. |
263 | * |
307 | * |
264 | * @return Number of cycles used by the task and all its threads |
308 | * @return Number of cycles used by the task and all its threads |
265 | * so far. |
309 | * so far. |
266 | */ |
310 | */ |
267 | uint64_t task_get_accounting(task_t *t) |
311 | uint64_t task_get_accounting(task_t *t) |
268 | { |
312 | { |
269 | /* Accumulated value of task */ |
313 | /* Accumulated value of task */ |
270 | uint64_t ret = t->cycles; |
314 | uint64_t ret = t->cycles; |
271 | 315 | ||
272 | /* Current values of threads */ |
316 | /* Current values of threads */ |
273 | link_t *cur; |
317 | link_t *cur; |
274 | for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) { |
318 | for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) { |
275 | thread_t *thr = list_get_instance(cur, thread_t, th_link); |
319 | thread_t *thr = list_get_instance(cur, thread_t, th_link); |
276 | 320 | ||
277 | spinlock_lock(&thr->lock); |
321 | spinlock_lock(&thr->lock); |
278 | /* Process only counted threads */ |
322 | /* Process only counted threads */ |
279 | if (!thr->uncounted) { |
323 | if (!thr->uncounted) { |
280 | if (thr == THREAD) { |
324 | if (thr == THREAD) { |
281 | /* Update accounting of current thread */ |
325 | /* Update accounting of current thread */ |
282 | thread_update_accounting(); |
326 | thread_update_accounting(); |
283 | } |
327 | } |
284 | ret += thr->cycles; |
328 | ret += thr->cycles; |
285 | } |
329 | } |
286 | spinlock_unlock(&thr->lock); |
330 | spinlock_unlock(&thr->lock); |
287 | } |
331 | } |
288 | 332 | ||
289 | return ret; |
333 | return ret; |
290 | } |
334 | } |
291 | 335 | ||
292 | /** Kill task. |
336 | /** Kill task. |
293 | * |
337 | * |
294 | * This function is idempotent. |
338 | * This function is idempotent. |
295 | * It signals all the task's threads to bail it out. |
339 | * It signals all the task's threads to bail it out. |
296 | * |
340 | * |
297 | * @param id ID of the task to be killed. |
341 | * @param id ID of the task to be killed. |
298 | * |
342 | * |
299 | * @return Zero on success or an error code from errno.h. |
343 | * @return Zero on success or an error code from errno.h. |
300 | */ |
344 | */ |
301 | int task_kill(task_id_t id) |
345 | int task_kill(task_id_t id) |
302 | { |
346 | { |
303 | ipl_t ipl; |
347 | ipl_t ipl; |
304 | task_t *ta; |
348 | task_t *ta; |
305 | link_t *cur; |
349 | link_t *cur; |
306 | 350 | ||
307 | if (id == 1) |
351 | if (id == 1) |
308 | return EPERM; |
352 | return EPERM; |
309 | 353 | ||
310 | ipl = interrupts_disable(); |
354 | ipl = interrupts_disable(); |
311 | spinlock_lock(&tasks_lock); |
355 | spinlock_lock(&tasks_lock); |
312 | if (!(ta = task_find_by_id(id))) { |
356 | if (!(ta = task_find_by_id(id))) { |
313 | spinlock_unlock(&tasks_lock); |
357 | spinlock_unlock(&tasks_lock); |
314 | interrupts_restore(ipl); |
358 | interrupts_restore(ipl); |
315 | return ENOENT; |
359 | return ENOENT; |
316 | } |
360 | } |
317 | spinlock_unlock(&tasks_lock); |
361 | spinlock_unlock(&tasks_lock); |
318 | 362 | ||
319 | /* |
363 | /* |
320 | * Interrupt all threads. |
364 | * Interrupt all threads. |
321 | */ |
365 | */ |
322 | spinlock_lock(&ta->lock); |
366 | spinlock_lock(&ta->lock); |
323 | 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) { |
324 | thread_t *thr; |
368 | thread_t *thr; |
325 | bool sleeping = false; |
369 | bool sleeping = false; |
326 | 370 | ||
327 | thr = list_get_instance(cur, thread_t, th_link); |
371 | thr = list_get_instance(cur, thread_t, th_link); |
328 | 372 | ||
329 | spinlock_lock(&thr->lock); |
373 | spinlock_lock(&thr->lock); |
330 | thr->interrupted = true; |
374 | thr->interrupted = true; |
331 | if (thr->state == Sleeping) |
375 | if (thr->state == Sleeping) |
332 | sleeping = true; |
376 | sleeping = true; |
333 | spinlock_unlock(&thr->lock); |
377 | spinlock_unlock(&thr->lock); |
334 | 378 | ||
335 | if (sleeping) |
379 | if (sleeping) |
336 | waitq_interrupt_sleep(thr); |
380 | waitq_interrupt_sleep(thr); |
337 | } |
381 | } |
338 | spinlock_unlock(&ta->lock); |
382 | spinlock_unlock(&ta->lock); |
339 | interrupts_restore(ipl); |
383 | interrupts_restore(ipl); |
340 | 384 | ||
341 | return 0; |
385 | return 0; |
342 | } |
386 | } |
343 | 387 | ||
344 | static bool task_print_walker(avltree_node_t *node, void *arg) |
388 | static bool task_print_walker(avltree_node_t *node, void *arg) |
345 | { |
389 | { |
346 | task_t *t = avltree_get_instance(node, task_t, tasks_tree_node); |
390 | task_t *t = avltree_get_instance(node, task_t, tasks_tree_node); |
347 | int j; |
391 | int j; |
348 | 392 | ||
349 | spinlock_lock(&t->lock); |
393 | spinlock_lock(&t->lock); |
350 | 394 | ||
351 | uint64_t cycles; |
395 | uint64_t cycles; |
352 | char suffix; |
396 | char suffix; |
353 | order(task_get_accounting(t), &cycles, &suffix); |
397 | order(task_get_accounting(t), &cycles, &suffix); |
354 | 398 | ||
355 | #ifdef __32_BITS__ |
399 | #ifdef __32_BITS__ |
356 | printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %10p %10p %9" PRIu64 |
400 | printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %10p %10p %9" PRIu64 |
357 | "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles, |
401 | "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles, |
358 | suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls)); |
402 | suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls)); |
359 | #endif |
403 | #endif |
360 | 404 | ||
361 | #ifdef __64_BITS__ |
405 | #ifdef __64_BITS__ |
362 | printf("%-6" PRIu64 " %-10s %-3" PRIu32 " %18p %18p %9" PRIu64 |
406 | printf("%-6" PRIu64 " %-12s %-3" PRIu32 " %18p %18p %9" PRIu64 |
363 | "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles, |
407 | "%c %7ld %6ld", t->taskid, t->name, t->context, t, t->as, cycles, |
364 | suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls)); |
408 | suffix, atomic_get(&t->refcount), atomic_get(&t->active_calls)); |
365 | #endif |
409 | #endif |
366 | 410 | ||
367 | for (j = 0; j < IPC_MAX_PHONES; j++) { |
411 | for (j = 0; j < IPC_MAX_PHONES; j++) { |
368 | if (t->phones[j].callee) |
412 | if (t->phones[j].callee) |
369 | printf(" %d:%p", j, t->phones[j].callee); |
413 | printf(" %d:%p", j, t->phones[j].callee); |
370 | } |
414 | } |
371 | printf("\n"); |
415 | printf("\n"); |
372 | 416 | ||
373 | spinlock_unlock(&t->lock); |
417 | spinlock_unlock(&t->lock); |
374 | return true; |
418 | return true; |
375 | } |
419 | } |
376 | 420 | ||
377 | /** Print task list */ |
421 | /** Print task list */ |
378 | void task_print_list(void) |
422 | void task_print_list(void) |
379 | { |
423 | { |
380 | ipl_t ipl; |
424 | ipl_t ipl; |
381 | 425 | ||
382 | /* Messing with task structures, avoid deadlock */ |
426 | /* Messing with task structures, avoid deadlock */ |
383 | ipl = interrupts_disable(); |
427 | ipl = interrupts_disable(); |
384 | spinlock_lock(&tasks_lock); |
428 | spinlock_lock(&tasks_lock); |
385 | 429 | ||
386 | #ifdef __32_BITS__ |
430 | #ifdef __32_BITS__ |
387 | printf("taskid name ctx address as " |
431 | printf("taskid name ctx address as " |
388 | "cycles threads calls callee\n"); |
432 | "cycles threads calls callee\n"); |
389 | printf("------ ---------- --- ---------- ---------- " |
433 | printf("------ ------------ --- ---------- ---------- " |
390 | "---------- ------- ------ ------>\n"); |
434 | "---------- ------- ------ ------>\n"); |
391 | #endif |
435 | #endif |
392 | 436 | ||
393 | #ifdef __64_BITS__ |
437 | #ifdef __64_BITS__ |
394 | printf("taskid name ctx address as " |
438 | printf("taskid name ctx address as " |
395 | "cycles threads calls callee\n"); |
439 | "cycles threads calls callee\n"); |
396 | printf("------ ---------- --- ------------------ ------------------ " |
440 | printf("------ ------------ --- ------------------ ------------------ " |
397 | "---------- ------- ------ ------>\n"); |
441 | "---------- ------- ------ ------>\n"); |
398 | #endif |
442 | #endif |
399 | 443 | ||
400 | avltree_walk(&tasks_tree, task_print_walker, NULL); |
444 | avltree_walk(&tasks_tree, task_print_walker, NULL); |
401 | 445 | ||
402 | spinlock_unlock(&tasks_lock); |
446 | spinlock_unlock(&tasks_lock); |
403 | interrupts_restore(ipl); |
447 | interrupts_restore(ipl); |
404 | } |
448 | } |
405 | 449 | ||
406 | /** @} |
450 | /** @} |
407 | */ |
451 | */ |
408 | 452 |