Rev 2854 | Rev 2866 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2854 | Rev 2865 | ||
---|---|---|---|
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 Thread management functions. |
35 | * @brief Thread management functions. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <proc/scheduler.h> |
38 | #include <proc/scheduler.h> |
39 | #include <proc/thread.h> |
39 | #include <proc/thread.h> |
40 | #include <proc/task.h> |
40 | #include <proc/task.h> |
41 | #include <proc/uarg.h> |
41 | #include <proc/uarg.h> |
42 | #include <mm/frame.h> |
42 | #include <mm/frame.h> |
43 | #include <mm/page.h> |
43 | #include <mm/page.h> |
44 | #include <arch/asm.h> |
44 | #include <arch/asm.h> |
45 | #include <arch/cycle.h> |
45 | #include <arch/cycle.h> |
46 | #include <arch.h> |
46 | #include <arch.h> |
47 | #include <synch/synch.h> |
47 | #include <synch/synch.h> |
48 | #include <synch/spinlock.h> |
48 | #include <synch/spinlock.h> |
49 | #include <synch/waitq.h> |
49 | #include <synch/waitq.h> |
50 | #include <synch/rwlock.h> |
50 | #include <synch/rwlock.h> |
51 | #include <cpu.h> |
51 | #include <cpu.h> |
52 | #include <func.h> |
52 | #include <func.h> |
53 | #include <context.h> |
53 | #include <context.h> |
54 | #include <adt/avl.h> |
54 | #include <adt/avl.h> |
55 | #include <adt/list.h> |
55 | #include <adt/list.h> |
56 | #include <time/clock.h> |
56 | #include <time/clock.h> |
57 | #include <time/timeout.h> |
57 | #include <time/timeout.h> |
58 | #include <config.h> |
58 | #include <config.h> |
59 | #include <arch/interrupt.h> |
59 | #include <arch/interrupt.h> |
60 | #include <smp/ipi.h> |
60 | #include <smp/ipi.h> |
61 | #include <arch/faddr.h> |
61 | #include <arch/faddr.h> |
62 | #include <atomic.h> |
62 | #include <atomic.h> |
63 | #include <memstr.h> |
63 | #include <memstr.h> |
64 | #include <print.h> |
64 | #include <print.h> |
65 | #include <mm/slab.h> |
65 | #include <mm/slab.h> |
66 | #include <debug.h> |
66 | #include <debug.h> |
67 | #include <main/uinit.h> |
67 | #include <main/uinit.h> |
68 | #include <syscall/copy.h> |
68 | #include <syscall/copy.h> |
69 | #include <errno.h> |
69 | #include <errno.h> |
70 | #include <console/klog.h> |
70 | #include <console/klog.h> |
71 | 71 | ||
72 | 72 | ||
73 | /** Thread states */ |
73 | /** Thread states */ |
74 | char *thread_states[] = { |
74 | char *thread_states[] = { |
75 | "Invalid", |
75 | "Invalid", |
76 | "Running", |
76 | "Running", |
77 | "Sleeping", |
77 | "Sleeping", |
78 | "Ready", |
78 | "Ready", |
79 | "Entering", |
79 | "Entering", |
80 | "Exiting", |
80 | "Exiting", |
81 | "Lingering" |
81 | "Lingering" |
82 | }; |
82 | }; |
83 | 83 | ||
84 | /** Lock protecting the threads_tree AVL tree. |
84 | /** Lock protecting the threads_tree AVL tree. |
85 | * |
85 | * |
86 | * For locking rules, see declaration thereof. |
86 | * For locking rules, see declaration thereof. |
87 | */ |
87 | */ |
88 | SPINLOCK_INITIALIZE(threads_lock); |
88 | SPINLOCK_INITIALIZE(threads_lock); |
89 | 89 | ||
90 | /** ALV tree of all threads. |
90 | /** ALV tree of all threads. |
91 | * |
91 | * |
92 | * When a thread is found in the threads_tree AVL tree, it is guaranteed to |
92 | * When a thread is found in the threads_tree AVL tree, it is guaranteed to |
93 | * exist as long as the threads_lock is held. |
93 | * exist as long as the threads_lock is held. |
94 | */ |
94 | */ |
95 | avltree_t threads_tree; |
95 | avltree_t threads_tree; |
96 | 96 | ||
97 | SPINLOCK_INITIALIZE(tidlock); |
97 | SPINLOCK_INITIALIZE(tidlock); |
98 | thread_id_t last_tid = 0; |
98 | thread_id_t last_tid = 0; |
99 | 99 | ||
100 | static slab_cache_t *thread_slab; |
100 | static slab_cache_t *thread_slab; |
101 | #ifdef ARCH_HAS_FPU |
101 | #ifdef ARCH_HAS_FPU |
102 | slab_cache_t *fpu_context_slab; |
102 | slab_cache_t *fpu_context_slab; |
103 | #endif |
103 | #endif |
104 | 104 | ||
105 | /** Thread wrapper. |
105 | /** Thread wrapper. |
106 | * |
106 | * |
107 | * This wrapper is provided to ensure that every thread makes a call to |
107 | * This wrapper is provided to ensure that every thread makes a call to |
108 | * thread_exit() when its implementing function returns. |
108 | * thread_exit() when its implementing function returns. |
109 | * |
109 | * |
110 | * interrupts_disable() is assumed. |
110 | * interrupts_disable() is assumed. |
111 | * |
111 | * |
112 | */ |
112 | */ |
113 | static void cushion(void) |
113 | static void cushion(void) |
114 | { |
114 | { |
115 | void (*f)(void *) = THREAD->thread_code; |
115 | void (*f)(void *) = THREAD->thread_code; |
116 | void *arg = THREAD->thread_arg; |
116 | void *arg = THREAD->thread_arg; |
117 | THREAD->last_cycle = get_cycle(); |
117 | THREAD->last_cycle = get_cycle(); |
118 | 118 | ||
119 | /* This is where each thread wakes up after its creation */ |
119 | /* This is where each thread wakes up after its creation */ |
120 | spinlock_unlock(&THREAD->lock); |
120 | spinlock_unlock(&THREAD->lock); |
121 | interrupts_enable(); |
121 | interrupts_enable(); |
122 | 122 | ||
123 | f(arg); |
123 | f(arg); |
124 | 124 | ||
125 | /* Accumulate accounting to the task */ |
125 | /* Accumulate accounting to the task */ |
126 | ipl_t ipl = interrupts_disable(); |
126 | ipl_t ipl = interrupts_disable(); |
127 | 127 | ||
128 | spinlock_lock(&THREAD->lock); |
128 | spinlock_lock(&THREAD->lock); |
129 | if (!THREAD->uncounted) { |
129 | if (!THREAD->uncounted) { |
130 | thread_update_accounting(); |
130 | thread_update_accounting(); |
131 | uint64_t cycles = THREAD->cycles; |
131 | uint64_t cycles = THREAD->cycles; |
132 | THREAD->cycles = 0; |
132 | THREAD->cycles = 0; |
133 | spinlock_unlock(&THREAD->lock); |
133 | spinlock_unlock(&THREAD->lock); |
134 | 134 | ||
135 | spinlock_lock(&TASK->lock); |
135 | spinlock_lock(&TASK->lock); |
136 | TASK->cycles += cycles; |
136 | TASK->cycles += cycles; |
137 | spinlock_unlock(&TASK->lock); |
137 | spinlock_unlock(&TASK->lock); |
138 | } else |
138 | } else |
139 | spinlock_unlock(&THREAD->lock); |
139 | spinlock_unlock(&THREAD->lock); |
140 | 140 | ||
141 | interrupts_restore(ipl); |
141 | interrupts_restore(ipl); |
142 | 142 | ||
143 | thread_exit(); |
143 | thread_exit(); |
144 | /* not reached */ |
144 | /* not reached */ |
145 | } |
145 | } |
146 | 146 | ||
147 | /** Initialization and allocation for thread_t structure */ |
147 | /** Initialization and allocation for thread_t structure */ |
148 | static int thr_constructor(void *obj, int kmflags) |
148 | static int thr_constructor(void *obj, int kmflags) |
149 | { |
149 | { |
150 | thread_t *t = (thread_t *) obj; |
150 | thread_t *t = (thread_t *) obj; |
151 | 151 | ||
152 | spinlock_initialize(&t->lock, "thread_t_lock"); |
152 | spinlock_initialize(&t->lock, "thread_t_lock"); |
153 | link_initialize(&t->rq_link); |
153 | link_initialize(&t->rq_link); |
154 | link_initialize(&t->wq_link); |
154 | link_initialize(&t->wq_link); |
155 | link_initialize(&t->th_link); |
155 | link_initialize(&t->th_link); |
156 | 156 | ||
157 | /* call the architecture-specific part of the constructor */ |
157 | /* call the architecture-specific part of the constructor */ |
158 | thr_constructor_arch(t); |
158 | thr_constructor_arch(t); |
159 | 159 | ||
160 | #ifdef ARCH_HAS_FPU |
160 | #ifdef ARCH_HAS_FPU |
161 | #ifdef CONFIG_FPU_LAZY |
161 | #ifdef CONFIG_FPU_LAZY |
162 | t->saved_fpu_context = NULL; |
162 | t->saved_fpu_context = NULL; |
163 | #else |
163 | #else |
164 | t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags); |
164 | t->saved_fpu_context = slab_alloc(fpu_context_slab, kmflags); |
165 | if (!t->saved_fpu_context) |
165 | if (!t->saved_fpu_context) |
166 | return -1; |
166 | return -1; |
167 | #endif |
167 | #endif |
168 | #endif |
168 | #endif |
169 | 169 | ||
170 | t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA | kmflags); |
170 | t->kstack = (uint8_t *) frame_alloc(STACK_FRAMES, FRAME_KA | kmflags); |
171 | if (!t->kstack) { |
171 | if (!t->kstack) { |
172 | #ifdef ARCH_HAS_FPU |
172 | #ifdef ARCH_HAS_FPU |
173 | if (t->saved_fpu_context) |
173 | if (t->saved_fpu_context) |
174 | slab_free(fpu_context_slab, t->saved_fpu_context); |
174 | slab_free(fpu_context_slab, t->saved_fpu_context); |
175 | #endif |
175 | #endif |
176 | return -1; |
176 | return -1; |
177 | } |
177 | } |
178 | 178 | ||
179 | spinlock_initialize(&t->debug_lock, "thread_debug_lock"); |
179 | spinlock_initialize(&t->debug_lock, "thread_debug_lock"); |
180 | 180 | ||
181 | return 0; |
181 | return 0; |
182 | } |
182 | } |
183 | 183 | ||
184 | /** Destruction of thread_t object */ |
184 | /** Destruction of thread_t object */ |
185 | static int thr_destructor(void *obj) |
185 | static int thr_destructor(void *obj) |
186 | { |
186 | { |
187 | thread_t *t = (thread_t *) obj; |
187 | thread_t *t = (thread_t *) obj; |
188 | 188 | ||
189 | /* call the architecture-specific part of the destructor */ |
189 | /* call the architecture-specific part of the destructor */ |
190 | thr_destructor_arch(t); |
190 | thr_destructor_arch(t); |
191 | 191 | ||
192 | frame_free(KA2PA(t->kstack)); |
192 | frame_free(KA2PA(t->kstack)); |
193 | #ifdef ARCH_HAS_FPU |
193 | #ifdef ARCH_HAS_FPU |
194 | if (t->saved_fpu_context) |
194 | if (t->saved_fpu_context) |
195 | slab_free(fpu_context_slab, t->saved_fpu_context); |
195 | slab_free(fpu_context_slab, t->saved_fpu_context); |
196 | #endif |
196 | #endif |
197 | return 1; /* One page freed */ |
197 | return 1; /* One page freed */ |
198 | } |
198 | } |
199 | 199 | ||
200 | /** Initialize threads |
200 | /** Initialize threads |
201 | * |
201 | * |
202 | * Initialize kernel threads support. |
202 | * Initialize kernel threads support. |
203 | * |
203 | * |
204 | */ |
204 | */ |
205 | void thread_init(void) |
205 | void thread_init(void) |
206 | { |
206 | { |
207 | THREAD = NULL; |
207 | THREAD = NULL; |
208 | atomic_set(&nrdy,0); |
208 | atomic_set(&nrdy,0); |
209 | thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0, |
209 | thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0, |
210 | thr_constructor, thr_destructor, 0); |
210 | thr_constructor, thr_destructor, 0); |
211 | 211 | ||
212 | #ifdef ARCH_HAS_FPU |
212 | #ifdef ARCH_HAS_FPU |
213 | fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t), |
213 | fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t), |
214 | FPU_CONTEXT_ALIGN, NULL, NULL, 0); |
214 | FPU_CONTEXT_ALIGN, NULL, NULL, 0); |
215 | #endif |
215 | #endif |
216 | 216 | ||
217 | avltree_create(&threads_tree); |
217 | avltree_create(&threads_tree); |
218 | } |
218 | } |
219 | 219 | ||
220 | /** Make thread ready |
220 | /** Make thread ready |
221 | * |
221 | * |
222 | * Switch thread t to the ready state. |
222 | * Switch thread t to the ready state. |
223 | * |
223 | * |
224 | * @param t Thread to make ready. |
224 | * @param t Thread to make ready. |
225 | * |
225 | * |
226 | */ |
226 | */ |
227 | void thread_ready(thread_t *t) |
227 | void thread_ready(thread_t *t) |
228 | { |
228 | { |
229 | cpu_t *cpu; |
229 | cpu_t *cpu; |
230 | runq_t *r; |
230 | runq_t *r; |
231 | ipl_t ipl; |
231 | ipl_t ipl; |
232 | int i, avg; |
232 | int i, avg; |
233 | 233 | ||
234 | ipl = interrupts_disable(); |
234 | ipl = interrupts_disable(); |
235 | 235 | ||
236 | spinlock_lock(&t->lock); |
236 | spinlock_lock(&t->lock); |
237 | 237 | ||
238 | ASSERT(!(t->state == Ready)); |
238 | ASSERT(!(t->state == Ready)); |
239 | 239 | ||
240 | i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority; |
240 | i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority; |
241 | 241 | ||
242 | cpu = CPU; |
242 | cpu = CPU; |
243 | if (t->flags & THREAD_FLAG_WIRED) { |
243 | if (t->flags & THREAD_FLAG_WIRED) { |
244 | ASSERT(t->cpu != NULL); |
244 | ASSERT(t->cpu != NULL); |
245 | cpu = t->cpu; |
245 | cpu = t->cpu; |
246 | } |
246 | } |
247 | t->state = Ready; |
247 | t->state = Ready; |
248 | spinlock_unlock(&t->lock); |
248 | spinlock_unlock(&t->lock); |
249 | 249 | ||
250 | /* |
250 | /* |
251 | * Append t to respective ready queue on respective processor. |
251 | * Append t to respective ready queue on respective processor. |
252 | */ |
252 | */ |
253 | r = &cpu->rq[i]; |
253 | r = &cpu->rq[i]; |
254 | spinlock_lock(&r->lock); |
254 | spinlock_lock(&r->lock); |
255 | list_append(&t->rq_link, &r->rq_head); |
255 | list_append(&t->rq_link, &r->rq_head); |
256 | r->n++; |
256 | r->n++; |
257 | spinlock_unlock(&r->lock); |
257 | spinlock_unlock(&r->lock); |
258 | 258 | ||
259 | atomic_inc(&nrdy); |
259 | atomic_inc(&nrdy); |
260 | avg = atomic_get(&nrdy) / config.cpu_active; |
260 | avg = atomic_get(&nrdy) / config.cpu_active; |
261 | atomic_inc(&cpu->nrdy); |
261 | atomic_inc(&cpu->nrdy); |
262 | 262 | ||
263 | interrupts_restore(ipl); |
263 | interrupts_restore(ipl); |
264 | } |
264 | } |
265 | 265 | ||
266 | /** Create new thread |
266 | /** Create new thread |
267 | * |
267 | * |
268 | * Create a new thread. |
268 | * Create a new thread. |
269 | * |
269 | * |
270 | * @param func Thread's implementing function. |
270 | * @param func Thread's implementing function. |
271 | * @param arg Thread's implementing function argument. |
271 | * @param arg Thread's implementing function argument. |
272 | * @param task Task to which the thread belongs. |
272 | * @param task Task to which the thread belongs. |
273 | * @param flags Thread flags. |
273 | * @param flags Thread flags. |
274 | * @param name Symbolic name. |
274 | * @param name Symbolic name. |
275 | * @param uncounted Thread's accounting doesn't affect accumulated task |
275 | * @param uncounted Thread's accounting doesn't affect accumulated task |
276 | * accounting. |
276 | * accounting. |
277 | * |
277 | * |
278 | * @return New thread's structure on success, NULL on failure. |
278 | * @return New thread's structure on success, NULL on failure. |
279 | * |
279 | * |
280 | */ |
280 | */ |
281 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, |
281 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, |
282 | int flags, char *name, bool uncounted) |
282 | int flags, char *name, bool uncounted) |
283 | { |
283 | { |
284 | thread_t *t; |
284 | thread_t *t; |
285 | ipl_t ipl; |
285 | ipl_t ipl; |
286 | 286 | ||
287 | t = (thread_t *) slab_alloc(thread_slab, 0); |
287 | t = (thread_t *) slab_alloc(thread_slab, 0); |
288 | if (!t) |
288 | if (!t) |
289 | return NULL; |
289 | return NULL; |
290 | 290 | ||
291 | /* Not needed, but good for debugging */ |
291 | /* Not needed, but good for debugging */ |
292 | memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, |
292 | memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, |
293 | 0); |
293 | 0); |
294 | 294 | ||
295 | ipl = interrupts_disable(); |
295 | ipl = interrupts_disable(); |
296 | spinlock_lock(&tidlock); |
296 | spinlock_lock(&tidlock); |
297 | t->tid = ++last_tid; |
297 | t->tid = ++last_tid; |
298 | spinlock_unlock(&tidlock); |
298 | spinlock_unlock(&tidlock); |
299 | interrupts_restore(ipl); |
299 | interrupts_restore(ipl); |
300 | 300 | ||
301 | context_save(&t->saved_context); |
301 | context_save(&t->saved_context); |
302 | context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, |
302 | context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, |
303 | THREAD_STACK_SIZE); |
303 | THREAD_STACK_SIZE); |
304 | 304 | ||
305 | the_initialize((the_t *) t->kstack); |
305 | the_initialize((the_t *) t->kstack); |
306 | 306 | ||
307 | ipl = interrupts_disable(); |
307 | ipl = interrupts_disable(); |
308 | t->saved_context.ipl = interrupts_read(); |
308 | t->saved_context.ipl = interrupts_read(); |
309 | interrupts_restore(ipl); |
309 | interrupts_restore(ipl); |
310 | 310 | ||
311 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
311 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
312 | 312 | ||
313 | t->thread_code = func; |
313 | t->thread_code = func; |
314 | t->thread_arg = arg; |
314 | t->thread_arg = arg; |
315 | t->ticks = -1; |
315 | t->ticks = -1; |
316 | t->cycles = 0; |
316 | t->cycles = 0; |
317 | t->uncounted = uncounted; |
317 | t->uncounted = uncounted; |
318 | t->priority = -1; /* start in rq[0] */ |
318 | t->priority = -1; /* start in rq[0] */ |
319 | t->cpu = NULL; |
319 | t->cpu = NULL; |
320 | t->flags = flags; |
320 | t->flags = flags; |
321 | t->state = Entering; |
321 | t->state = Entering; |
322 | t->call_me = NULL; |
322 | t->call_me = NULL; |
323 | t->call_me_with = NULL; |
323 | t->call_me_with = NULL; |
324 | 324 | ||
325 | timeout_initialize(&t->sleep_timeout); |
325 | timeout_initialize(&t->sleep_timeout); |
326 | t->sleep_interruptible = false; |
326 | t->sleep_interruptible = false; |
327 | t->sleep_queue = NULL; |
327 | t->sleep_queue = NULL; |
328 | t->timeout_pending = 0; |
328 | t->timeout_pending = 0; |
329 | 329 | ||
330 | t->in_copy_from_uspace = false; |
330 | t->in_copy_from_uspace = false; |
331 | t->in_copy_to_uspace = false; |
331 | t->in_copy_to_uspace = false; |
332 | 332 | ||
333 | t->interrupted = false; |
333 | t->interrupted = false; |
334 | t->detached = false; |
334 | t->detached = false; |
335 | waitq_initialize(&t->join_wq); |
335 | waitq_initialize(&t->join_wq); |
336 | 336 | ||
337 | t->rwlock_holder_type = RWLOCK_NONE; |
337 | t->rwlock_holder_type = RWLOCK_NONE; |
338 | 338 | ||
339 | t->task = task; |
339 | t->task = task; |
340 | 340 | ||
341 | t->fpu_context_exists = 0; |
341 | t->fpu_context_exists = 0; |
342 | t->fpu_context_engaged = 0; |
342 | t->fpu_context_engaged = 0; |
343 | 343 | ||
344 | avltree_node_initialize(&t->threads_tree_node); |
344 | avltree_node_initialize(&t->threads_tree_node); |
345 | t->threads_tree_node.key = (uintptr_t) t; |
345 | t->threads_tree_node.key = (uintptr_t) t; |
346 | 346 | ||
347 | /* Init debugging stuff */ |
347 | /* Init debugging stuff */ |
348 | waitq_initialize(&t->go_wq); |
348 | waitq_initialize(&t->go_wq); |
349 | t->debug_go_call = NULL; |
349 | t->debug_go_call = NULL; |
350 | t->uspace_state = NULL; |
350 | t->uspace_state = NULL; |
351 | t->debug_stop = true; |
351 | t->debug_stop = true; |
352 | t->debug_active = false; |
352 | t->debug_active = false; |
353 | 353 | ||
354 | /* might depend on previous initialization */ |
354 | /* might depend on previous initialization */ |
355 | thread_create_arch(t); |
355 | thread_create_arch(t); |
356 | 356 | ||
357 | if (!(flags & THREAD_FLAG_NOATTACH)) |
357 | if (!(flags & THREAD_FLAG_NOATTACH)) |
358 | thread_attach(t, task); |
358 | thread_attach(t, task); |
359 | 359 | ||
360 | return t; |
360 | return t; |
361 | } |
361 | } |
362 | 362 | ||
363 | /** Destroy thread structure of an unattached thread. |
363 | /** Destroy thread structure of an unattached thread. |
364 | * |
364 | * |
365 | * Thread t must only have been created and never attached. |
365 | * Thread t must only have been created and never attached. |
366 | */ |
366 | */ |
367 | void thread_unattached_free(thread_t *t) |
367 | void thread_unattached_free(thread_t *t) |
368 | { |
368 | { |
369 | slab_free(thread_slab, t); |
369 | slab_free(thread_slab, t); |
370 | } |
370 | } |
371 | 371 | ||
372 | 372 | ||
373 | /** Destroy thread memory structure |
373 | /** Destroy thread memory structure |
374 | * |
374 | * |
375 | * Detach thread from all queues, cpus etc. and destroy it. |
375 | * Detach thread from all queues, cpus etc. and destroy it. |
376 | * |
376 | * |
377 | * Assume thread->lock is held!! |
377 | * Assume thread->lock is held!! |
378 | */ |
378 | */ |
379 | void thread_destroy(thread_t *t) |
379 | void thread_destroy(thread_t *t) |
380 | { |
380 | { |
381 | ASSERT(t->state == Exiting || t->state == Lingering); |
381 | ASSERT(t->state == Exiting || t->state == Lingering); |
382 | ASSERT(t->task); |
382 | ASSERT(t->task); |
383 | ASSERT(t->cpu); |
383 | ASSERT(t->cpu); |
384 | 384 | ||
385 | spinlock_lock(&t->cpu->lock); |
385 | spinlock_lock(&t->cpu->lock); |
386 | if (t->cpu->fpu_owner == t) |
386 | if (t->cpu->fpu_owner == t) |
387 | t->cpu->fpu_owner = NULL; |
387 | t->cpu->fpu_owner = NULL; |
388 | spinlock_unlock(&t->cpu->lock); |
388 | spinlock_unlock(&t->cpu->lock); |
389 | 389 | ||
390 | spinlock_unlock(&t->lock); |
390 | spinlock_unlock(&t->lock); |
391 | 391 | ||
392 | spinlock_lock(&threads_lock); |
392 | spinlock_lock(&threads_lock); |
393 | avltree_delete(&threads_tree, &t->threads_tree_node); |
393 | avltree_delete(&threads_tree, &t->threads_tree_node); |
394 | spinlock_unlock(&threads_lock); |
394 | spinlock_unlock(&threads_lock); |
395 | 395 | ||
396 | /* |
396 | /* |
397 | * Detach from the containing task. |
397 | * Detach from the containing task. |
398 | */ |
398 | */ |
399 | spinlock_lock(&t->task->lock); |
399 | spinlock_lock(&t->task->lock); |
400 | list_remove(&t->th_link); |
400 | list_remove(&t->th_link); |
401 | spinlock_unlock(&t->task->lock); |
401 | spinlock_unlock(&t->task->lock); |
402 | 402 | ||
403 | /* |
403 | /* |
404 | * t is guaranteed to be the very last thread of its task. |
404 | * t is guaranteed to be the very last thread of its task. |
405 | * It is safe to destroy the task. |
405 | * It is safe to destroy the task. |
406 | */ |
406 | */ |
407 | if (atomic_predec(&t->task->refcount) == 0) |
407 | if (atomic_predec(&t->task->refcount) == 0) |
408 | task_destroy(t->task); |
408 | task_destroy(t->task); |
409 | 409 | ||
410 | slab_free(thread_slab, t); |
410 | slab_free(thread_slab, t); |
411 | } |
411 | } |
412 | 412 | ||
413 | /** Attach thread to the given task. |
413 | /** Attach thread to the given task. |
414 | * |
414 | * |
415 | * The task's lock must already be held and interrupts must be disabled. |
415 | * The task's lock must already be held and interrupts must be disabled. |
416 | * |
416 | * |
417 | * @param t Thread to be attached to the task. |
417 | * @param t Thread to be attached to the task. |
418 | * @param task Task to which the thread is to be attached. |
418 | * @param task Task to which the thread is to be attached. |
419 | */ |
419 | */ |
420 | static void _thread_attach_task(thread_t *t, task_t *task) |
420 | static void _thread_attach_task(thread_t *t, task_t *task) |
421 | { |
421 | { |
422 | atomic_inc(&task->refcount); |
422 | atomic_inc(&task->refcount); |
423 | atomic_inc(&task->lifecount); |
423 | atomic_inc(&task->lifecount); |
424 | 424 | ||
425 | list_append(&t->th_link, &task->th_head); |
425 | list_append(&t->th_link, &task->th_head); |
426 | 426 | ||
427 | /* |
427 | /* |
428 | * Copy task debugging state to thread struct. |
428 | * Copy task debugging state to thread struct. |
429 | * The thread needs to know it is being debugged, |
429 | * The thread needs to know it is being debugged, |
430 | * otherwise it would neither stop nor respond to |
430 | * otherwise it would neither stop nor respond to |
431 | * debug ops. |
431 | * debug ops. |
432 | */ |
432 | */ |
433 | if (t->flags & THREAD_FLAG_USPACE) { |
433 | if (t->flags & THREAD_FLAG_USPACE) { |
434 | if (task->dt_state == UDEBUG_TS_BEGINNING || |
434 | if (task->dt_state == UDEBUG_TS_BEGINNING || |
435 | task->dt_state == UDEBUG_TS_ACTIVE) { |
435 | task->dt_state == UDEBUG_TS_ACTIVE) { |
436 | t->debug_active = true; |
436 | t->debug_active = true; |
437 | } |
437 | } |
438 | } |
438 | } |
439 | - | ||
440 | /* FIXME: this must be done very carefully.. an unstoppable |
- | |
441 | thread cannot appear just-so, it must be possible to catch it. */ |
- | |
442 | if (t->flags & THREAD_FLAG_USPACE) |
- | |
443 | ++task->not_stoppable_count; |
- | |
444 | } |
439 | } |
445 | 440 | ||
446 | /** Add thread to the threads tree. |
441 | /** Add thread to the threads tree. |
447 | * |
442 | * |
448 | * Interrupts must be already disabled. |
443 | * Interrupts must be already disabled. |
449 | * |
444 | * |
450 | * @param t Thread to be attached to the task. |
445 | * @param t Thread to be attached to the task. |
451 | * @param task Task to which the thread is to be attached. |
446 | * @param task Task to which the thread is to be attached. |
452 | */ |
447 | */ |
453 | static void _thread_attach_tree(thread_t *t) |
448 | static void _thread_attach_tree(thread_t *t) |
454 | { |
449 | { |
455 | /* |
450 | /* |
456 | * Register this thread in the system-wide list. |
451 | * Register this thread in the system-wide list. |
457 | */ |
452 | */ |
458 | spinlock_lock(&threads_lock); |
453 | spinlock_lock(&threads_lock); |
459 | avltree_insert(&threads_tree, &t->threads_tree_node); |
454 | avltree_insert(&threads_tree, &t->threads_tree_node); |
460 | spinlock_unlock(&threads_lock); |
455 | spinlock_unlock(&threads_lock); |
461 | } |
456 | } |
462 | 457 | ||
463 | 458 | ||
464 | /** Make the thread visible to the system. |
459 | /** Make the thread visible to the system. |
465 | * |
460 | * |
466 | * Attach the thread structure to the current task and make it visible in the |
461 | * Attach the thread structure to the current task and make it visible in the |
467 | * threads_tree. |
462 | * threads_tree. |
468 | * |
463 | * |
469 | * @param t Thread to be attached to the task. |
464 | * @param t Thread to be attached to the task. |
470 | * @param task Task to which the thread is to be attached. |
465 | * @param task Task to which the thread is to be attached. |
471 | */ |
466 | */ |
472 | void thread_attach(thread_t *t, task_t *task) |
467 | void thread_attach(thread_t *t, task_t *task) |
473 | { |
468 | { |
474 | ipl_t ipl; |
469 | ipl_t ipl; |
475 | 470 | ||
476 | ipl = interrupts_disable(); |
471 | ipl = interrupts_disable(); |
477 | 472 | ||
478 | /* |
473 | /* |
479 | * Attach to the current task. |
474 | * Attach to the current task. |
480 | */ |
475 | */ |
481 | spinlock_lock(&task->lock); |
476 | spinlock_lock(&task->lock); |
482 | _thread_attach_task(t, task); |
477 | _thread_attach_task(t, task); |
483 | spinlock_unlock(&task->lock); |
478 | spinlock_unlock(&task->lock); |
484 | 479 | ||
485 | /* |
480 | /* |
486 | * Register this thread in the system-wide list. |
481 | * Register this thread in the system-wide list. |
487 | */ |
482 | */ |
488 | _thread_attach_tree(t); |
483 | _thread_attach_tree(t); |
489 | 484 | ||
490 | interrupts_restore(ipl); |
485 | interrupts_restore(ipl); |
491 | } |
486 | } |
492 | 487 | ||
493 | /** Attach thread to a task given by its ID. |
488 | /** Attach thread to a task given by its ID. |
494 | * |
489 | * |
495 | * Unlike thread_attach(), this function allows to attach a thread |
490 | * Unlike thread_attach(), this function allows to attach a thread |
496 | * to an arbitrary task. |
491 | * to an arbitrary task. |
497 | * |
492 | * |
498 | * @param t Thread to be attached to the task. |
493 | * @param t Thread to be attached to the task. |
499 | * @param taskid Task id to which the thread is to be attached. |
494 | * @param taskid Task id to which the thread is to be attached. |
500 | * @return An error code from errno.h |
495 | * @return An error code from errno.h |
501 | */ |
496 | */ |
502 | int thread_attach_by_id(thread_t *t, task_id_t taskid) |
497 | int thread_attach_by_id(thread_t *t, task_id_t taskid) |
503 | { |
498 | { |
504 | ipl_t ipl; |
499 | ipl_t ipl; |
505 | task_t *task; |
500 | task_t *task; |
506 | 501 | ||
507 | ipl = interrupts_disable(); |
502 | ipl = interrupts_disable(); |
508 | 503 | ||
509 | spinlock_lock(&tasks_lock); |
504 | spinlock_lock(&tasks_lock); |
510 | task = task_find_by_id(taskid); |
505 | task = task_find_by_id(taskid); |
511 | if (task == NULL) { |
506 | if (task == NULL) { |
512 | spinlock_unlock(&tasks_lock); |
507 | spinlock_unlock(&tasks_lock); |
513 | interrupts_restore(ipl); |
508 | interrupts_restore(ipl); |
514 | return ENOENT; |
509 | return ENOENT; |
515 | } |
510 | } |
516 | 511 | ||
517 | spinlock_lock(&task->lock); |
512 | spinlock_lock(&task->lock); |
518 | spinlock_unlock(&tasks_lock); |
513 | spinlock_unlock(&tasks_lock); |
519 | 514 | ||
520 | /* |
515 | /* |
521 | * Attach to the current task. |
516 | * Attach to the current task. |
522 | */ |
517 | */ |
523 | _thread_attach_task(t, task); |
518 | _thread_attach_task(t, task); |
524 | 519 | ||
525 | spinlock_unlock(&task->lock); |
520 | spinlock_unlock(&task->lock); |
526 | 521 | ||
527 | /* |
522 | /* |
528 | * Register this thread in the system-wide list. |
523 | * Register this thread in the system-wide list. |
529 | */ |
524 | */ |
530 | _thread_attach_tree(t); |
525 | _thread_attach_tree(t); |
531 | 526 | ||
532 | interrupts_restore(ipl); |
527 | interrupts_restore(ipl); |
533 | 528 | ||
534 | return EOK; |
529 | return EOK; |
535 | } |
530 | } |
536 | 531 | ||
537 | 532 | ||
538 | /** Terminate thread. |
533 | /** Terminate thread. |
539 | * |
534 | * |
540 | * End current thread execution and switch it to the exiting state. All pending |
535 | * End current thread execution and switch it to the exiting state. All pending |
541 | * timeouts are executed. |
536 | * timeouts are executed. |
542 | */ |
537 | */ |
543 | void thread_exit(void) |
538 | void thread_exit(void) |
544 | { |
539 | { |
545 | ipl_t ipl; |
540 | ipl_t ipl; |
546 | 541 | ||
547 | if (atomic_predec(&TASK->lifecount) == 0) { |
542 | if (atomic_predec(&TASK->lifecount) == 0) { |
548 | /* |
543 | /* |
549 | * We are the last thread in the task that still has not exited. |
544 | * We are the last thread in the task that still has not exited. |
550 | * With the exception of the moment the task was created, new |
545 | * With the exception of the moment the task was created, new |
551 | * threads can only be created by threads of the same task. |
546 | * threads can only be created by threads of the same task. |
552 | * We are safe to perform cleanup. |
547 | * We are safe to perform cleanup. |
553 | */ |
548 | */ |
554 | if (THREAD->flags & THREAD_FLAG_USPACE) { |
549 | if (THREAD->flags & THREAD_FLAG_USPACE) { |
555 | ipc_cleanup(); |
550 | ipc_cleanup(); |
556 | futex_cleanup(); |
551 | futex_cleanup(); |
557 | klog_printf("Cleanup of task %llu completed.", |
552 | klog_printf("Cleanup of task %llu completed.", |
558 | TASK->taskid); |
553 | TASK->taskid); |
559 | } |
554 | } |
560 | } |
555 | } |
561 | 556 | ||
562 | restart: |
557 | restart: |
563 | ipl = interrupts_disable(); |
558 | ipl = interrupts_disable(); |
564 | spinlock_lock(&THREAD->lock); |
559 | spinlock_lock(&THREAD->lock); |
565 | if (THREAD->timeout_pending) { |
560 | if (THREAD->timeout_pending) { |
566 | /* busy waiting for timeouts in progress */ |
561 | /* busy waiting for timeouts in progress */ |
567 | spinlock_unlock(&THREAD->lock); |
562 | spinlock_unlock(&THREAD->lock); |
568 | interrupts_restore(ipl); |
563 | interrupts_restore(ipl); |
569 | goto restart; |
564 | goto restart; |
570 | } |
565 | } |
571 | 566 | ||
572 | THREAD->state = Exiting; |
567 | THREAD->state = Exiting; |
573 | spinlock_unlock(&THREAD->lock); |
568 | spinlock_unlock(&THREAD->lock); |
574 | scheduler(); |
569 | scheduler(); |
575 | 570 | ||
576 | /* Not reached */ |
571 | /* Not reached */ |
577 | while (1) |
572 | while (1) |
578 | ; |
573 | ; |
579 | } |
574 | } |
580 | 575 | ||
581 | 576 | ||
582 | /** Thread sleep |
577 | /** Thread sleep |
583 | * |
578 | * |
584 | * Suspend execution of the current thread. |
579 | * Suspend execution of the current thread. |
585 | * |
580 | * |
586 | * @param sec Number of seconds to sleep. |
581 | * @param sec Number of seconds to sleep. |
587 | * |
582 | * |
588 | */ |
583 | */ |
589 | void thread_sleep(uint32_t sec) |
584 | void thread_sleep(uint32_t sec) |
590 | { |
585 | { |
591 | thread_usleep(sec * 1000000); |
586 | thread_usleep(sec * 1000000); |
592 | } |
587 | } |
593 | 588 | ||
594 | /** Wait for another thread to exit. |
589 | /** Wait for another thread to exit. |
595 | * |
590 | * |
596 | * @param t Thread to join on exit. |
591 | * @param t Thread to join on exit. |
597 | * @param usec Timeout in microseconds. |
592 | * @param usec Timeout in microseconds. |
598 | * @param flags Mode of operation. |
593 | * @param flags Mode of operation. |
599 | * |
594 | * |
600 | * @return An error code from errno.h or an error code from synch.h. |
595 | * @return An error code from errno.h or an error code from synch.h. |
601 | */ |
596 | */ |
602 | int thread_join_timeout(thread_t *t, uint32_t usec, int flags) |
597 | int thread_join_timeout(thread_t *t, uint32_t usec, int flags) |
603 | { |
598 | { |
604 | ipl_t ipl; |
599 | ipl_t ipl; |
605 | int rc; |
600 | int rc; |
606 | 601 | ||
607 | if (t == THREAD) |
602 | if (t == THREAD) |
608 | return EINVAL; |
603 | return EINVAL; |
609 | 604 | ||
610 | /* |
605 | /* |
611 | * Since thread join can only be called once on an undetached thread, |
606 | * Since thread join can only be called once on an undetached thread, |
612 | * the thread pointer is guaranteed to be still valid. |
607 | * the thread pointer is guaranteed to be still valid. |
613 | */ |
608 | */ |
614 | 609 | ||
615 | ipl = interrupts_disable(); |
610 | ipl = interrupts_disable(); |
616 | spinlock_lock(&t->lock); |
611 | spinlock_lock(&t->lock); |
617 | ASSERT(!t->detached); |
612 | ASSERT(!t->detached); |
618 | spinlock_unlock(&t->lock); |
613 | spinlock_unlock(&t->lock); |
619 | interrupts_restore(ipl); |
614 | interrupts_restore(ipl); |
620 | 615 | ||
621 | rc = waitq_sleep_timeout(&t->join_wq, usec, flags); |
616 | rc = waitq_sleep_timeout(&t->join_wq, usec, flags); |
622 | 617 | ||
623 | return rc; |
618 | return rc; |
624 | } |
619 | } |
625 | 620 | ||
626 | /** Detach thread. |
621 | /** Detach thread. |
627 | * |
622 | * |
628 | * Mark the thread as detached, if the thread is already in the Lingering |
623 | * Mark the thread as detached, if the thread is already in the Lingering |
629 | * state, deallocate its resources. |
624 | * state, deallocate its resources. |
630 | * |
625 | * |
631 | * @param t Thread to be detached. |
626 | * @param t Thread to be detached. |
632 | */ |
627 | */ |
633 | void thread_detach(thread_t *t) |
628 | void thread_detach(thread_t *t) |
634 | { |
629 | { |
635 | ipl_t ipl; |
630 | ipl_t ipl; |
636 | 631 | ||
637 | /* |
632 | /* |
638 | * Since the thread is expected not to be already detached, |
633 | * Since the thread is expected not to be already detached, |
639 | * pointer to it must be still valid. |
634 | * pointer to it must be still valid. |
640 | */ |
635 | */ |
641 | ipl = interrupts_disable(); |
636 | ipl = interrupts_disable(); |
642 | spinlock_lock(&t->lock); |
637 | spinlock_lock(&t->lock); |
643 | ASSERT(!t->detached); |
638 | ASSERT(!t->detached); |
644 | if (t->state == Lingering) { |
639 | if (t->state == Lingering) { |
645 | thread_destroy(t); /* unlocks &t->lock */ |
640 | thread_destroy(t); /* unlocks &t->lock */ |
646 | interrupts_restore(ipl); |
641 | interrupts_restore(ipl); |
647 | return; |
642 | return; |
648 | } else { |
643 | } else { |
649 | t->detached = true; |
644 | t->detached = true; |
650 | } |
645 | } |
651 | spinlock_unlock(&t->lock); |
646 | spinlock_unlock(&t->lock); |
652 | interrupts_restore(ipl); |
647 | interrupts_restore(ipl); |
653 | } |
648 | } |
654 | 649 | ||
655 | /** Thread usleep |
650 | /** Thread usleep |
656 | * |
651 | * |
657 | * Suspend execution of the current thread. |
652 | * Suspend execution of the current thread. |
658 | * |
653 | * |
659 | * @param usec Number of microseconds to sleep. |
654 | * @param usec Number of microseconds to sleep. |
660 | * |
655 | * |
661 | */ |
656 | */ |
662 | void thread_usleep(uint32_t usec) |
657 | void thread_usleep(uint32_t usec) |
663 | { |
658 | { |
664 | waitq_t wq; |
659 | waitq_t wq; |
665 | 660 | ||
666 | waitq_initialize(&wq); |
661 | waitq_initialize(&wq); |
667 | 662 | ||
668 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING); |
663 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING); |
669 | } |
664 | } |
670 | 665 | ||
671 | /** Register thread out-of-context invocation |
666 | /** Register thread out-of-context invocation |
672 | * |
667 | * |
673 | * Register a function and its argument to be executed |
668 | * Register a function and its argument to be executed |
674 | * on next context switch to the current thread. |
669 | * on next context switch to the current thread. |
675 | * |
670 | * |
676 | * @param call_me Out-of-context function. |
671 | * @param call_me Out-of-context function. |
677 | * @param call_me_with Out-of-context function argument. |
672 | * @param call_me_with Out-of-context function argument. |
678 | * |
673 | * |
679 | */ |
674 | */ |
680 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
675 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
681 | { |
676 | { |
682 | ipl_t ipl; |
677 | ipl_t ipl; |
683 | 678 | ||
684 | ipl = interrupts_disable(); |
679 | ipl = interrupts_disable(); |
685 | spinlock_lock(&THREAD->lock); |
680 | spinlock_lock(&THREAD->lock); |
686 | THREAD->call_me = call_me; |
681 | THREAD->call_me = call_me; |
687 | THREAD->call_me_with = call_me_with; |
682 | THREAD->call_me_with = call_me_with; |
688 | spinlock_unlock(&THREAD->lock); |
683 | spinlock_unlock(&THREAD->lock); |
689 | interrupts_restore(ipl); |
684 | interrupts_restore(ipl); |
690 | } |
685 | } |
691 | 686 | ||
692 | static bool thread_walker(avltree_node_t *node, void *arg) |
687 | static bool thread_walker(avltree_node_t *node, void *arg) |
693 | { |
688 | { |
694 | thread_t *t; |
689 | thread_t *t; |
695 | 690 | ||
696 | t = avltree_get_instance(node, thread_t, threads_tree_node); |
691 | t = avltree_get_instance(node, thread_t, threads_tree_node); |
697 | 692 | ||
698 | uint64_t cycles; |
693 | uint64_t cycles; |
699 | char suffix; |
694 | char suffix; |
700 | order(t->cycles, &cycles, &suffix); |
695 | order(t->cycles, &cycles, &suffix); |
701 | 696 | ||
702 | if (sizeof(void *) == 4) |
697 | if (sizeof(void *) == 4) |
703 | printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ", |
698 | printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ", |
704 | t->tid, t->name, t, thread_states[t->state], t->task, |
699 | t->tid, t->name, t, thread_states[t->state], t->task, |
705 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
700 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
706 | else |
701 | else |
707 | printf("%-6llu %-10s %#18zx %-8s %#18zx %-3ld %#18zx %#18zx %9llu%c ", |
702 | printf("%-6llu %-10s %#18zx %-8s %#18zx %-3ld %#18zx %#18zx %9llu%c ", |
708 | t->tid, t->name, t, thread_states[t->state], t->task, |
703 | t->tid, t->name, t, thread_states[t->state], t->task, |
709 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
704 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
710 | 705 | ||
711 | if (t->cpu) |
706 | if (t->cpu) |
712 | printf("%-4zd", t->cpu->id); |
707 | printf("%-4zd", t->cpu->id); |
713 | else |
708 | else |
714 | printf("none"); |
709 | printf("none"); |
715 | 710 | ||
716 | if (t->state == Sleeping) { |
711 | if (t->state == Sleeping) { |
717 | if (sizeof(uintptr_t) == 4) |
712 | if (sizeof(uintptr_t) == 4) |
718 | printf(" %#10zx", t->sleep_queue); |
713 | printf(" %#10zx", t->sleep_queue); |
719 | else |
714 | else |
720 | printf(" %#18zx", t->sleep_queue); |
715 | printf(" %#18zx", t->sleep_queue); |
721 | } |
716 | } |
722 | 717 | ||
723 | printf("\n"); |
718 | printf("\n"); |
724 | 719 | ||
725 | return true; |
720 | return true; |
726 | } |
721 | } |
727 | 722 | ||
728 | /** Print list of threads debug info */ |
723 | /** Print list of threads debug info */ |
729 | void thread_print_list(void) |
724 | void thread_print_list(void) |
730 | { |
725 | { |
731 | ipl_t ipl; |
726 | ipl_t ipl; |
732 | 727 | ||
733 | /* Messing with thread structures, avoid deadlock */ |
728 | /* Messing with thread structures, avoid deadlock */ |
734 | ipl = interrupts_disable(); |
729 | ipl = interrupts_disable(); |
735 | spinlock_lock(&threads_lock); |
730 | spinlock_lock(&threads_lock); |
736 | 731 | ||
737 | if (sizeof(uintptr_t) == 4) { |
732 | if (sizeof(uintptr_t) == 4) { |
738 | printf("tid name address state task " |
733 | printf("tid name address state task " |
739 | "ctx code stack cycles cpu " |
734 | "ctx code stack cycles cpu " |
740 | "waitqueue\n"); |
735 | "waitqueue\n"); |
741 | printf("------ ---------- ---------- -------- ---------- " |
736 | printf("------ ---------- ---------- -------- ---------- " |
742 | "--- ---------- ---------- ---------- ---- " |
737 | "--- ---------- ---------- ---------- ---- " |
743 | "----------\n"); |
738 | "----------\n"); |
744 | } else { |
739 | } else { |
745 | printf("tid name address state task " |
740 | printf("tid name address state task " |
746 | "ctx code stack cycles cpu " |
741 | "ctx code stack cycles cpu " |
747 | "waitqueue\n"); |
742 | "waitqueue\n"); |
748 | printf("------ ---------- ------------------ -------- ------------------ " |
743 | printf("------ ---------- ------------------ -------- ------------------ " |
749 | "--- ------------------ ------------------ ---------- ---- " |
744 | "--- ------------------ ------------------ ---------- ---- " |
750 | "------------------\n"); |
745 | "------------------\n"); |
751 | } |
746 | } |
752 | 747 | ||
753 | avltree_walk(&threads_tree, thread_walker, NULL); |
748 | avltree_walk(&threads_tree, thread_walker, NULL); |
754 | 749 | ||
755 | spinlock_unlock(&threads_lock); |
750 | spinlock_unlock(&threads_lock); |
756 | interrupts_restore(ipl); |
751 | interrupts_restore(ipl); |
757 | } |
752 | } |
758 | 753 | ||
759 | /** Check whether thread exists. |
754 | /** Check whether thread exists. |
760 | * |
755 | * |
761 | * Note that threads_lock must be already held and |
756 | * Note that threads_lock must be already held and |
762 | * interrupts must be already disabled. |
757 | * interrupts must be already disabled. |
763 | * |
758 | * |
764 | * @param t Pointer to thread. |
759 | * @param t Pointer to thread. |
765 | * |
760 | * |
766 | * @return True if thread t is known to the system, false otherwise. |
761 | * @return True if thread t is known to the system, false otherwise. |
767 | */ |
762 | */ |
768 | bool thread_exists(thread_t *t) |
763 | bool thread_exists(thread_t *t) |
769 | { |
764 | { |
770 | avltree_node_t *node; |
765 | avltree_node_t *node; |
771 | 766 | ||
772 | node = avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) t)); |
767 | node = avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) t)); |
773 | 768 | ||
774 | return node != NULL; |
769 | return node != NULL; |
775 | } |
770 | } |
776 | 771 | ||
777 | 772 | ||
778 | /** Update accounting of current thread. |
773 | /** Update accounting of current thread. |
779 | * |
774 | * |
780 | * Note that thread_lock on THREAD must be already held and |
775 | * Note that thread_lock on THREAD must be already held and |
781 | * interrupts must be already disabled. |
776 | * interrupts must be already disabled. |
782 | * |
777 | * |
783 | */ |
778 | */ |
784 | void thread_update_accounting(void) |
779 | void thread_update_accounting(void) |
785 | { |
780 | { |
786 | uint64_t time = get_cycle(); |
781 | uint64_t time = get_cycle(); |
787 | THREAD->cycles += time - THREAD->last_cycle; |
782 | THREAD->cycles += time - THREAD->last_cycle; |
788 | THREAD->last_cycle = time; |
783 | THREAD->last_cycle = time; |
789 | } |
784 | } |
790 | 785 | ||
791 | /** Process syscall to create new thread. |
786 | /** Process syscall to create new thread. |
792 | * |
787 | * |
793 | */ |
788 | */ |
794 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name, |
789 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name, |
795 | thread_id_t *uspace_thread_id) |
790 | thread_id_t *uspace_thread_id) |
796 | { |
791 | { |
797 | thread_t *t; |
792 | thread_t *t; |
798 | char namebuf[THREAD_NAME_BUFLEN]; |
793 | char namebuf[THREAD_NAME_BUFLEN]; |
799 | uspace_arg_t *kernel_uarg; |
794 | uspace_arg_t *kernel_uarg; |
800 | int rc; |
795 | int rc; |
801 | 796 | ||
802 | rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
797 | rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
803 | if (rc != 0) |
798 | if (rc != 0) |
804 | return (unative_t) rc; |
799 | return (unative_t) rc; |
805 | 800 | ||
806 | /* |
801 | /* |
807 | * In case of failure, kernel_uarg will be deallocated in this function. |
802 | * In case of failure, kernel_uarg will be deallocated in this function. |
808 | * In case of success, kernel_uarg will be freed in uinit(). |
803 | * In case of success, kernel_uarg will be freed in uinit(). |
809 | */ |
804 | */ |
810 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
805 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
811 | 806 | ||
812 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
807 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
813 | if (rc != 0) { |
808 | if (rc != 0) { |
814 | free(kernel_uarg); |
809 | free(kernel_uarg); |
815 | return (unative_t) rc; |
810 | return (unative_t) rc; |
816 | } |
811 | } |
817 | 812 | ||
818 | t = thread_create(uinit, kernel_uarg, TASK, |
813 | t = thread_create(uinit, kernel_uarg, TASK, |
819 | THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false); |
814 | THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false); |
820 | if (t) { |
815 | if (t) { |
821 | if (uspace_thread_id != NULL) { |
816 | if (uspace_thread_id != NULL) { |
822 | int rc; |
817 | int rc; |
823 | 818 | ||
824 | rc = copy_to_uspace(uspace_thread_id, &t->tid, |
819 | rc = copy_to_uspace(uspace_thread_id, &t->tid, |
825 | sizeof(t->tid)); |
820 | sizeof(t->tid)); |
826 | if (rc != 0) { |
821 | if (rc != 0) { |
827 | /* |
822 | /* |
828 | * We have encountered a failure, but the thread |
823 | * We have encountered a failure, but the thread |
829 | * has already been created. We need to undo its |
824 | * has already been created. We need to undo its |
830 | * creation now. |
825 | * creation now. |
831 | */ |
826 | */ |
832 | 827 | ||
833 | /* |
828 | /* |
834 | * The new thread structure is initialized, but |
829 | * The new thread structure is initialized, but |
835 | * is still not visible to the system. |
830 | * is still not visible to the system. |
836 | * We can safely deallocate it. |
831 | * We can safely deallocate it. |
837 | */ |
832 | */ |
838 | slab_free(thread_slab, t); |
833 | slab_free(thread_slab, t); |
839 | free(kernel_uarg); |
834 | free(kernel_uarg); |
840 | 835 | ||
841 | return (unative_t) rc; |
836 | return (unative_t) rc; |
842 | } |
837 | } |
843 | } |
838 | } |
844 | thread_attach(t, TASK); |
839 | thread_attach(t, TASK); |
845 | thread_ready(t); |
840 | thread_ready(t); |
846 | 841 | ||
847 | return 0; |
842 | return 0; |
848 | } else |
843 | } else |
849 | free(kernel_uarg); |
844 | free(kernel_uarg); |
850 | 845 | ||
851 | return (unative_t) ENOMEM; |
846 | return (unative_t) ENOMEM; |
852 | } |
847 | } |
853 | 848 | ||
854 | /** Process syscall to terminate thread. |
849 | /** Process syscall to terminate thread. |
855 | * |
850 | * |
856 | */ |
851 | */ |
857 | unative_t sys_thread_exit(int uspace_status) |
852 | unative_t sys_thread_exit(int uspace_status) |
858 | { |
853 | { |
859 | thread_exit(); |
854 | thread_exit(); |
860 | /* Unreachable */ |
855 | /* Unreachable */ |
861 | return 0; |
856 | return 0; |
862 | } |
857 | } |
863 | 858 | ||
864 | /** Syscall for getting TID. |
859 | /** Syscall for getting TID. |
865 | * |
860 | * |
866 | * @param uspace_thread_id Userspace address of 8-byte buffer where to store |
861 | * @param uspace_thread_id Userspace address of 8-byte buffer where to store |
867 | * current thread ID. |
862 | * current thread ID. |
868 | * |
863 | * |
869 | * @return 0 on success or an error code from @ref errno.h. |
864 | * @return 0 on success or an error code from @ref errno.h. |
870 | */ |
865 | */ |
871 | unative_t sys_thread_get_id(thread_id_t *uspace_thread_id) |
866 | unative_t sys_thread_get_id(thread_id_t *uspace_thread_id) |
872 | { |
867 | { |
873 | /* |
868 | /* |
874 | * No need to acquire lock on THREAD because tid |
869 | * No need to acquire lock on THREAD because tid |
875 | * remains constant for the lifespan of the thread. |
870 | * remains constant for the lifespan of the thread. |
876 | */ |
871 | */ |
877 | return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid, |
872 | return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid, |
878 | sizeof(THREAD->tid)); |
873 | sizeof(THREAD->tid)); |
879 | } |
874 | } |
880 | 875 | ||
881 | /** @} |
876 | /** @} |
882 | */ |
877 | */ |
883 | 878 |