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