Rev 3018 | Rev 3034 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3018 | Rev 3026 | ||
---|---|---|---|
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 | /** AVL tree of all threads. |
90 | /** AVL 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->udebug.lock, "thread_debug_lock"); |
179 | mutex_initialize(&t->udebug.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. The caller must |
272 | * @param task Task to which the thread belongs. The caller must |
273 | * guarantee that the task won't cease to exist during the |
273 | * guarantee that the task won't cease to exist during the |
274 | * call. The task's lock may not be held. |
274 | * call. The task's lock may not be held. |
275 | * @param flags Thread flags. |
275 | * @param flags Thread flags. |
276 | * @param name Symbolic name. |
276 | * @param name Symbolic name. |
277 | * @param uncounted Thread's accounting doesn't affect accumulated task |
277 | * @param uncounted Thread's accounting doesn't affect accumulated task |
278 | * accounting. |
278 | * accounting. |
279 | * |
279 | * |
280 | * @return New thread's structure on success, NULL on failure. |
280 | * @return New thread's structure on success, NULL on failure. |
281 | * |
281 | * |
282 | */ |
282 | */ |
283 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, |
283 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, |
284 | int flags, char *name, bool uncounted) |
284 | int flags, char *name, bool uncounted) |
285 | { |
285 | { |
286 | thread_t *t; |
286 | thread_t *t; |
287 | ipl_t ipl; |
287 | ipl_t ipl; |
288 | 288 | ||
289 | t = (thread_t *) slab_alloc(thread_slab, 0); |
289 | t = (thread_t *) slab_alloc(thread_slab, 0); |
290 | if (!t) |
290 | if (!t) |
291 | return NULL; |
291 | return NULL; |
292 | 292 | ||
293 | /* Not needed, but good for debugging */ |
293 | /* Not needed, but good for debugging */ |
294 | memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, |
294 | memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, |
295 | 0); |
295 | 0); |
296 | 296 | ||
297 | ipl = interrupts_disable(); |
297 | ipl = interrupts_disable(); |
298 | spinlock_lock(&tidlock); |
298 | spinlock_lock(&tidlock); |
299 | t->tid = ++last_tid; |
299 | t->tid = ++last_tid; |
300 | spinlock_unlock(&tidlock); |
300 | spinlock_unlock(&tidlock); |
301 | interrupts_restore(ipl); |
301 | interrupts_restore(ipl); |
302 | 302 | ||
303 | context_save(&t->saved_context); |
303 | context_save(&t->saved_context); |
304 | context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, |
304 | context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, |
305 | THREAD_STACK_SIZE); |
305 | THREAD_STACK_SIZE); |
306 | 306 | ||
307 | the_initialize((the_t *) t->kstack); |
307 | the_initialize((the_t *) t->kstack); |
308 | 308 | ||
309 | ipl = interrupts_disable(); |
309 | ipl = interrupts_disable(); |
310 | t->saved_context.ipl = interrupts_read(); |
310 | t->saved_context.ipl = interrupts_read(); |
311 | interrupts_restore(ipl); |
311 | interrupts_restore(ipl); |
312 | 312 | ||
313 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
313 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
314 | 314 | ||
315 | t->thread_code = func; |
315 | t->thread_code = func; |
316 | t->thread_arg = arg; |
316 | t->thread_arg = arg; |
317 | t->ticks = -1; |
317 | t->ticks = -1; |
318 | t->cycles = 0; |
318 | t->cycles = 0; |
319 | t->uncounted = uncounted; |
319 | t->uncounted = uncounted; |
320 | t->priority = -1; /* start in rq[0] */ |
320 | t->priority = -1; /* start in rq[0] */ |
321 | t->cpu = NULL; |
321 | t->cpu = NULL; |
322 | t->flags = flags; |
322 | t->flags = flags; |
323 | t->state = Entering; |
323 | t->state = Entering; |
324 | t->call_me = NULL; |
324 | t->call_me = NULL; |
325 | t->call_me_with = NULL; |
325 | t->call_me_with = NULL; |
326 | 326 | ||
327 | timeout_initialize(&t->sleep_timeout); |
327 | timeout_initialize(&t->sleep_timeout); |
328 | t->sleep_interruptible = false; |
328 | t->sleep_interruptible = false; |
329 | t->sleep_queue = NULL; |
329 | t->sleep_queue = NULL; |
330 | t->timeout_pending = 0; |
330 | t->timeout_pending = 0; |
331 | 331 | ||
332 | t->in_copy_from_uspace = false; |
332 | t->in_copy_from_uspace = false; |
333 | t->in_copy_to_uspace = false; |
333 | t->in_copy_to_uspace = false; |
334 | 334 | ||
335 | t->interrupted = false; |
335 | t->interrupted = false; |
336 | t->detached = false; |
336 | t->detached = false; |
337 | waitq_initialize(&t->join_wq); |
337 | waitq_initialize(&t->join_wq); |
338 | 338 | ||
339 | t->rwlock_holder_type = RWLOCK_NONE; |
339 | t->rwlock_holder_type = RWLOCK_NONE; |
340 | 340 | ||
341 | t->task = task; |
341 | t->task = task; |
342 | 342 | ||
343 | t->fpu_context_exists = 0; |
343 | t->fpu_context_exists = 0; |
344 | t->fpu_context_engaged = 0; |
344 | t->fpu_context_engaged = 0; |
345 | 345 | ||
346 | avltree_node_initialize(&t->threads_tree_node); |
346 | avltree_node_initialize(&t->threads_tree_node); |
347 | t->threads_tree_node.key = (uintptr_t) t; |
347 | t->threads_tree_node.key = (uintptr_t) t; |
348 | 348 | ||
349 | /* Init debugging stuff */ |
349 | /* Init debugging stuff */ |
350 | udebug_thread_initialize(&t->udebug); |
350 | udebug_thread_initialize(&t->udebug); |
351 | 351 | ||
352 | /* might depend on previous initialization */ |
352 | /* might depend on previous initialization */ |
353 | thread_create_arch(t); |
353 | thread_create_arch(t); |
354 | 354 | ||
355 | if (!(flags & THREAD_FLAG_NOATTACH)) |
355 | if (!(flags & THREAD_FLAG_NOATTACH)) |
356 | thread_attach(t, task); |
356 | thread_attach(t, task); |
357 | 357 | ||
358 | return t; |
358 | return t; |
359 | } |
359 | } |
360 | 360 | ||
361 | /** Destroy thread structure of an unattached thread. |
361 | /** Destroy thread structure of an unattached thread. |
362 | * |
362 | * |
363 | * Thread t must only have been created and never attached. |
363 | * Thread t must only have been created and never attached. |
364 | */ |
364 | */ |
365 | void thread_unattached_free(thread_t *t) |
365 | void thread_unattached_free(thread_t *t) |
366 | { |
366 | { |
367 | slab_free(thread_slab, t); |
367 | slab_free(thread_slab, t); |
368 | } |
368 | } |
369 | 369 | ||
370 | 370 | ||
371 | /** Destroy thread memory structure |
371 | /** Destroy thread memory structure |
372 | * |
372 | * |
373 | * Detach thread from all queues, cpus etc. and destroy it. |
373 | * Detach thread from all queues, cpus etc. and destroy it. |
374 | * |
374 | * |
375 | * Assume thread->lock is held!! |
375 | * Assume thread->lock is held!! |
376 | */ |
376 | */ |
377 | void thread_destroy(thread_t *t) |
377 | void thread_destroy(thread_t *t) |
378 | { |
378 | { |
379 | ASSERT(t->state == Exiting || t->state == Lingering); |
379 | ASSERT(t->state == Exiting || t->state == Lingering); |
380 | ASSERT(t->task); |
380 | ASSERT(t->task); |
381 | ASSERT(t->cpu); |
381 | ASSERT(t->cpu); |
382 | 382 | ||
383 | spinlock_lock(&t->cpu->lock); |
383 | spinlock_lock(&t->cpu->lock); |
384 | if (t->cpu->fpu_owner == t) |
384 | if (t->cpu->fpu_owner == t) |
385 | t->cpu->fpu_owner = NULL; |
385 | t->cpu->fpu_owner = NULL; |
386 | spinlock_unlock(&t->cpu->lock); |
386 | spinlock_unlock(&t->cpu->lock); |
387 | 387 | ||
388 | spinlock_unlock(&t->lock); |
388 | spinlock_unlock(&t->lock); |
389 | 389 | ||
390 | spinlock_lock(&threads_lock); |
390 | spinlock_lock(&threads_lock); |
391 | avltree_delete(&threads_tree, &t->threads_tree_node); |
391 | avltree_delete(&threads_tree, &t->threads_tree_node); |
392 | spinlock_unlock(&threads_lock); |
392 | spinlock_unlock(&threads_lock); |
393 | 393 | ||
394 | /* |
394 | /* |
395 | * Detach from the containing task. |
395 | * Detach from the containing task. |
396 | */ |
396 | */ |
397 | spinlock_lock(&t->task->lock); |
397 | spinlock_lock(&t->task->lock); |
398 | list_remove(&t->th_link); |
398 | list_remove(&t->th_link); |
399 | spinlock_unlock(&t->task->lock); |
399 | spinlock_unlock(&t->task->lock); |
400 | 400 | ||
401 | /* |
401 | /* |
402 | * t is guaranteed to be the very last thread of its task. |
402 | * t is guaranteed to be the very last thread of its task. |
403 | * It is safe to destroy the task. |
403 | * It is safe to destroy the task. |
404 | */ |
404 | */ |
405 | if (atomic_predec(&t->task->refcount) == 0) |
405 | if (atomic_predec(&t->task->refcount) == 0) |
406 | task_destroy(t->task); |
406 | task_destroy(t->task); |
407 | 407 | ||
408 | slab_free(thread_slab, t); |
408 | slab_free(thread_slab, t); |
409 | } |
409 | } |
410 | 410 | ||
411 | /** Make the thread visible to the system. |
411 | /** Make the thread visible to the system. |
412 | * |
412 | * |
413 | * Attach the thread structure to the current task and make it visible in the |
413 | * Attach the thread structure to the current task and make it visible in the |
414 | * threads_tree. |
414 | * threads_tree. |
415 | * |
415 | * |
416 | * @param t Thread to be attached to the task. |
416 | * @param t Thread to be attached to the task. |
417 | * @param task Task to which the thread is to be attached. |
417 | * @param task Task to which the thread is to be attached. |
418 | */ |
418 | */ |
419 | void thread_attach(thread_t *t, task_t *task) |
419 | void thread_attach(thread_t *t, task_t *task) |
420 | { |
420 | { |
421 | ipl_t ipl; |
421 | ipl_t ipl; |
422 | 422 | ||
423 | /* |
423 | /* |
424 | * Attach to the specified task. |
424 | * Attach to the specified task. |
425 | */ |
425 | */ |
426 | ipl = interrupts_disable(); |
426 | ipl = interrupts_disable(); |
427 | spinlock_lock(&task->lock); |
427 | spinlock_lock(&task->lock); |
428 | atomic_inc(&task->refcount); |
428 | atomic_inc(&task->refcount); |
429 | /* Must not count kbox thread into lifecount */ |
429 | /* Must not count kbox thread into lifecount */ |
430 | if (t->flags & THREAD_FLAG_USPACE) |
430 | if (t->flags & THREAD_FLAG_USPACE) |
431 | atomic_inc(&task->lifecount); |
431 | atomic_inc(&task->lifecount); |
432 | list_append(&t->th_link, &task->th_head); |
432 | list_append(&t->th_link, &task->th_head); |
433 | spinlock_unlock(&task->lock); |
433 | spinlock_unlock(&task->lock); |
434 | 434 | ||
435 | /* |
435 | /* |
436 | * Register this thread in the system-wide list. |
436 | * Register this thread in the system-wide list. |
437 | */ |
437 | */ |
438 | spinlock_lock(&threads_lock); |
438 | spinlock_lock(&threads_lock); |
439 | avltree_insert(&threads_tree, &t->threads_tree_node); |
439 | avltree_insert(&threads_tree, &t->threads_tree_node); |
440 | spinlock_unlock(&threads_lock); |
440 | spinlock_unlock(&threads_lock); |
441 | 441 | ||
442 | interrupts_restore(ipl); |
442 | interrupts_restore(ipl); |
443 | } |
443 | } |
444 | 444 | ||
445 | /** Terminate thread. |
445 | /** Terminate thread. |
446 | * |
446 | * |
447 | * End current thread execution and switch it to the exiting state. All pending |
447 | * End current thread execution and switch it to the exiting state. All pending |
448 | * timeouts are executed. |
448 | * timeouts are executed. |
449 | */ |
449 | */ |
450 | void thread_exit(void) |
450 | void thread_exit(void) |
451 | { |
451 | { |
452 | ipl_t ipl; |
452 | ipl_t ipl; |
453 | 453 | ||
454 | if (THREAD->flags & THREAD_FLAG_USPACE) { |
454 | if (THREAD->flags & THREAD_FLAG_USPACE) { |
455 | /* Generate udebug THREAD_E event */ |
455 | /* Generate udebug THREAD_E event */ |
456 | udebug_thread_e_event(); |
456 | udebug_thread_e_event(); |
457 | 457 | ||
458 | if (atomic_predec(&TASK->lifecount) == 0) { |
458 | if (atomic_predec(&TASK->lifecount) == 0) { |
459 | /* |
459 | /* |
460 | * We are the last userspace thread in the task that |
460 | * We are the last userspace thread in the task that |
461 | * still has not exited. With the exception of the |
461 | * still has not exited. With the exception of the |
462 | * moment the task was created, new userspace threads |
462 | * moment the task was created, new userspace threads |
463 | * can only be created by threads of the same task. |
463 | * can only be created by threads of the same task. |
464 | * We are safe to perform cleanup. |
464 | * We are safe to perform cleanup. |
465 | */ |
465 | */ |
466 | ipc_cleanup(); |
466 | ipc_cleanup(); |
467 | futex_cleanup(); |
467 | futex_cleanup(); |
468 | klog_printf("Cleanup of task %llu completed.", |
468 | klog_printf("Cleanup of task %llu completed.", |
469 | TASK->taskid); |
469 | TASK->taskid); |
470 | } |
470 | } |
471 | } |
471 | } |
472 | 472 | ||
473 | restart: |
473 | restart: |
474 | ipl = interrupts_disable(); |
474 | ipl = interrupts_disable(); |
475 | spinlock_lock(&THREAD->lock); |
475 | spinlock_lock(&THREAD->lock); |
476 | if (THREAD->timeout_pending) { |
476 | if (THREAD->timeout_pending) { |
477 | /* busy waiting for timeouts in progress */ |
477 | /* busy waiting for timeouts in progress */ |
478 | spinlock_unlock(&THREAD->lock); |
478 | spinlock_unlock(&THREAD->lock); |
479 | interrupts_restore(ipl); |
479 | interrupts_restore(ipl); |
480 | goto restart; |
480 | goto restart; |
481 | } |
481 | } |
482 | 482 | ||
483 | THREAD->state = Exiting; |
483 | THREAD->state = Exiting; |
484 | spinlock_unlock(&THREAD->lock); |
484 | spinlock_unlock(&THREAD->lock); |
485 | scheduler(); |
485 | scheduler(); |
486 | 486 | ||
487 | /* Not reached */ |
487 | /* Not reached */ |
488 | while (1) |
488 | while (1) |
489 | ; |
489 | ; |
490 | } |
490 | } |
491 | 491 | ||
492 | 492 | ||
493 | /** Thread sleep |
493 | /** Thread sleep |
494 | * |
494 | * |
495 | * Suspend execution of the current thread. |
495 | * Suspend execution of the current thread. |
496 | * |
496 | * |
497 | * @param sec Number of seconds to sleep. |
497 | * @param sec Number of seconds to sleep. |
498 | * |
498 | * |
499 | */ |
499 | */ |
500 | void thread_sleep(uint32_t sec) |
500 | void thread_sleep(uint32_t sec) |
501 | { |
501 | { |
502 | thread_usleep(sec * 1000000); |
502 | thread_usleep(sec * 1000000); |
503 | } |
503 | } |
504 | 504 | ||
505 | /** Wait for another thread to exit. |
505 | /** Wait for another thread to exit. |
506 | * |
506 | * |
507 | * @param t Thread to join on exit. |
507 | * @param t Thread to join on exit. |
508 | * @param usec Timeout in microseconds. |
508 | * @param usec Timeout in microseconds. |
509 | * @param flags Mode of operation. |
509 | * @param flags Mode of operation. |
510 | * |
510 | * |
511 | * @return An error code from errno.h or an error code from synch.h. |
511 | * @return An error code from errno.h or an error code from synch.h. |
512 | */ |
512 | */ |
513 | int thread_join_timeout(thread_t *t, uint32_t usec, int flags) |
513 | int thread_join_timeout(thread_t *t, uint32_t usec, int flags) |
514 | { |
514 | { |
515 | ipl_t ipl; |
515 | ipl_t ipl; |
516 | int rc; |
516 | int rc; |
517 | 517 | ||
518 | if (t == THREAD) |
518 | if (t == THREAD) |
519 | return EINVAL; |
519 | return EINVAL; |
520 | 520 | ||
521 | /* |
521 | /* |
522 | * Since thread join can only be called once on an undetached thread, |
522 | * Since thread join can only be called once on an undetached thread, |
523 | * the thread pointer is guaranteed to be still valid. |
523 | * the thread pointer is guaranteed to be still valid. |
524 | */ |
524 | */ |
525 | 525 | ||
526 | ipl = interrupts_disable(); |
526 | ipl = interrupts_disable(); |
527 | spinlock_lock(&t->lock); |
527 | spinlock_lock(&t->lock); |
528 | ASSERT(!t->detached); |
528 | ASSERT(!t->detached); |
529 | spinlock_unlock(&t->lock); |
529 | spinlock_unlock(&t->lock); |
530 | interrupts_restore(ipl); |
530 | interrupts_restore(ipl); |
531 | 531 | ||
532 | rc = waitq_sleep_timeout(&t->join_wq, usec, flags); |
532 | rc = waitq_sleep_timeout(&t->join_wq, usec, flags); |
533 | 533 | ||
534 | return rc; |
534 | return rc; |
535 | } |
535 | } |
536 | 536 | ||
537 | /** Detach thread. |
537 | /** Detach thread. |
538 | * |
538 | * |
539 | * Mark the thread as detached, if the thread is already in the Lingering |
539 | * Mark the thread as detached, if the thread is already in the Lingering |
540 | * state, deallocate its resources. |
540 | * state, deallocate its resources. |
541 | * |
541 | * |
542 | * @param t Thread to be detached. |
542 | * @param t Thread to be detached. |
543 | */ |
543 | */ |
544 | void thread_detach(thread_t *t) |
544 | void thread_detach(thread_t *t) |
545 | { |
545 | { |
546 | ipl_t ipl; |
546 | ipl_t ipl; |
547 | 547 | ||
548 | /* |
548 | /* |
549 | * Since the thread is expected not to be already detached, |
549 | * Since the thread is expected not to be already detached, |
550 | * pointer to it must be still valid. |
550 | * pointer to it must be still valid. |
551 | */ |
551 | */ |
552 | ipl = interrupts_disable(); |
552 | ipl = interrupts_disable(); |
553 | spinlock_lock(&t->lock); |
553 | spinlock_lock(&t->lock); |
554 | ASSERT(!t->detached); |
554 | ASSERT(!t->detached); |
555 | if (t->state == Lingering) { |
555 | if (t->state == Lingering) { |
556 | thread_destroy(t); /* unlocks &t->lock */ |
556 | thread_destroy(t); /* unlocks &t->lock */ |
557 | interrupts_restore(ipl); |
557 | interrupts_restore(ipl); |
558 | return; |
558 | return; |
559 | } else { |
559 | } else { |
560 | t->detached = true; |
560 | t->detached = true; |
561 | } |
561 | } |
562 | spinlock_unlock(&t->lock); |
562 | spinlock_unlock(&t->lock); |
563 | interrupts_restore(ipl); |
563 | interrupts_restore(ipl); |
564 | } |
564 | } |
565 | 565 | ||
566 | /** Thread usleep |
566 | /** Thread usleep |
567 | * |
567 | * |
568 | * Suspend execution of the current thread. |
568 | * Suspend execution of the current thread. |
569 | * |
569 | * |
570 | * @param usec Number of microseconds to sleep. |
570 | * @param usec Number of microseconds to sleep. |
571 | * |
571 | * |
572 | */ |
572 | */ |
573 | void thread_usleep(uint32_t usec) |
573 | void thread_usleep(uint32_t usec) |
574 | { |
574 | { |
575 | waitq_t wq; |
575 | waitq_t wq; |
576 | 576 | ||
577 | waitq_initialize(&wq); |
577 | waitq_initialize(&wq); |
578 | 578 | ||
579 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING); |
579 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING); |
580 | } |
580 | } |
581 | 581 | ||
582 | /** Register thread out-of-context invocation |
582 | /** Register thread out-of-context invocation |
583 | * |
583 | * |
584 | * Register a function and its argument to be executed |
584 | * Register a function and its argument to be executed |
585 | * on next context switch to the current thread. |
585 | * on next context switch to the current thread. |
586 | * |
586 | * |
587 | * @param call_me Out-of-context function. |
587 | * @param call_me Out-of-context function. |
588 | * @param call_me_with Out-of-context function argument. |
588 | * @param call_me_with Out-of-context function argument. |
589 | * |
589 | * |
590 | */ |
590 | */ |
591 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
591 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
592 | { |
592 | { |
593 | ipl_t ipl; |
593 | ipl_t ipl; |
594 | 594 | ||
595 | ipl = interrupts_disable(); |
595 | ipl = interrupts_disable(); |
596 | spinlock_lock(&THREAD->lock); |
596 | spinlock_lock(&THREAD->lock); |
597 | THREAD->call_me = call_me; |
597 | THREAD->call_me = call_me; |
598 | THREAD->call_me_with = call_me_with; |
598 | THREAD->call_me_with = call_me_with; |
599 | spinlock_unlock(&THREAD->lock); |
599 | spinlock_unlock(&THREAD->lock); |
600 | interrupts_restore(ipl); |
600 | interrupts_restore(ipl); |
601 | } |
601 | } |
602 | 602 | ||
603 | static bool thread_walker(avltree_node_t *node, void *arg) |
603 | static bool thread_walker(avltree_node_t *node, void *arg) |
604 | { |
604 | { |
605 | thread_t *t; |
605 | thread_t *t; |
606 | 606 | ||
607 | t = avltree_get_instance(node, thread_t, threads_tree_node); |
607 | t = avltree_get_instance(node, thread_t, threads_tree_node); |
608 | 608 | ||
609 | uint64_t cycles; |
609 | uint64_t cycles; |
610 | char suffix; |
610 | char suffix; |
611 | order(t->cycles, &cycles, &suffix); |
611 | order(t->cycles, &cycles, &suffix); |
612 | 612 | ||
613 | if (sizeof(void *) == 4) |
613 | if (sizeof(void *) == 4) |
614 | printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ", |
614 | printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ", |
615 | t->tid, t->name, t, thread_states[t->state], t->task, |
615 | t->tid, t->name, t, thread_states[t->state], t->task, |
616 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
616 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
617 | else |
617 | else |
618 | printf("%-6llu %-10s %#18zx %-8s %#18zx %-3ld %#18zx %#18zx %9llu%c ", |
618 | printf("%-6llu %-10s %#18zx %-8s %#18zx %-3ld %#18zx %#18zx %9llu%c ", |
619 | t->tid, t->name, t, thread_states[t->state], t->task, |
619 | t->tid, t->name, t, thread_states[t->state], t->task, |
620 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
620 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
621 | 621 | ||
622 | if (t->cpu) |
622 | if (t->cpu) |
623 | printf("%-4zd", t->cpu->id); |
623 | printf("%-4zd", t->cpu->id); |
624 | else |
624 | else |
625 | printf("none"); |
625 | printf("none"); |
626 | 626 | ||
627 | if (t->state == Sleeping) { |
627 | if (t->state == Sleeping) { |
628 | if (sizeof(uintptr_t) == 4) |
628 | if (sizeof(uintptr_t) == 4) |
629 | printf(" %#10zx", t->sleep_queue); |
629 | printf(" %#10zx", t->sleep_queue); |
630 | else |
630 | else |
631 | printf(" %#18zx", t->sleep_queue); |
631 | printf(" %#18zx", t->sleep_queue); |
632 | } |
632 | } |
633 | 633 | ||
634 | printf("\n"); |
634 | printf("\n"); |
635 | 635 | ||
636 | return true; |
636 | return true; |
637 | } |
637 | } |
638 | 638 | ||
639 | /** Print list of threads debug info */ |
639 | /** Print list of threads debug info */ |
640 | void thread_print_list(void) |
640 | void thread_print_list(void) |
641 | { |
641 | { |
642 | ipl_t ipl; |
642 | ipl_t ipl; |
643 | 643 | ||
644 | /* Messing with thread structures, avoid deadlock */ |
644 | /* Messing with thread structures, avoid deadlock */ |
645 | ipl = interrupts_disable(); |
645 | ipl = interrupts_disable(); |
646 | spinlock_lock(&threads_lock); |
646 | spinlock_lock(&threads_lock); |
647 | 647 | ||
648 | if (sizeof(uintptr_t) == 4) { |
648 | if (sizeof(uintptr_t) == 4) { |
649 | printf("tid name address state task " |
649 | printf("tid name address state task " |
650 | "ctx code stack cycles cpu " |
650 | "ctx code stack cycles cpu " |
651 | "waitqueue\n"); |
651 | "waitqueue\n"); |
652 | printf("------ ---------- ---------- -------- ---------- " |
652 | printf("------ ---------- ---------- -------- ---------- " |
653 | "--- ---------- ---------- ---------- ---- " |
653 | "--- ---------- ---------- ---------- ---- " |
654 | "----------\n"); |
654 | "----------\n"); |
655 | } else { |
655 | } else { |
656 | printf("tid name address state task " |
656 | printf("tid name address state task " |
657 | "ctx code stack cycles cpu " |
657 | "ctx code stack cycles cpu " |
658 | "waitqueue\n"); |
658 | "waitqueue\n"); |
659 | printf("------ ---------- ------------------ -------- ------------------ " |
659 | printf("------ ---------- ------------------ -------- ------------------ " |
660 | "--- ------------------ ------------------ ---------- ---- " |
660 | "--- ------------------ ------------------ ---------- ---- " |
661 | "------------------\n"); |
661 | "------------------\n"); |
662 | } |
662 | } |
663 | 663 | ||
664 | avltree_walk(&threads_tree, thread_walker, NULL); |
664 | avltree_walk(&threads_tree, thread_walker, NULL); |
665 | 665 | ||
666 | spinlock_unlock(&threads_lock); |
666 | spinlock_unlock(&threads_lock); |
667 | interrupts_restore(ipl); |
667 | interrupts_restore(ipl); |
668 | } |
668 | } |
669 | 669 | ||
670 | /** Check whether thread exists. |
670 | /** Check whether thread exists. |
671 | * |
671 | * |
672 | * Note that threads_lock must be already held and |
672 | * Note that threads_lock must be already held and |
673 | * interrupts must be already disabled. |
673 | * interrupts must be already disabled. |
674 | * |
674 | * |
675 | * @param t Pointer to thread. |
675 | * @param t Pointer to thread. |
676 | * |
676 | * |
677 | * @return True if thread t is known to the system, false otherwise. |
677 | * @return True if thread t is known to the system, false otherwise. |
678 | */ |
678 | */ |
679 | bool thread_exists(thread_t *t) |
679 | bool thread_exists(thread_t *t) |
680 | { |
680 | { |
681 | avltree_node_t *node; |
681 | avltree_node_t *node; |
682 | 682 | ||
683 | node = avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) t)); |
683 | node = avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) t)); |
684 | 684 | ||
685 | return node != NULL; |
685 | return node != NULL; |
686 | } |
686 | } |
687 | 687 | ||
688 | 688 | ||
689 | /** Update accounting of current thread. |
689 | /** Update accounting of current thread. |
690 | * |
690 | * |
691 | * Note that thread_lock on THREAD must be already held and |
691 | * Note that thread_lock on THREAD must be already held and |
692 | * interrupts must be already disabled. |
692 | * interrupts must be already disabled. |
693 | * |
693 | * |
694 | */ |
694 | */ |
695 | void thread_update_accounting(void) |
695 | void thread_update_accounting(void) |
696 | { |
696 | { |
697 | uint64_t time = get_cycle(); |
697 | uint64_t time = get_cycle(); |
698 | THREAD->cycles += time - THREAD->last_cycle; |
698 | THREAD->cycles += time - THREAD->last_cycle; |
699 | THREAD->last_cycle = time; |
699 | THREAD->last_cycle = time; |
700 | } |
700 | } |
701 | 701 | ||
702 | /** Process syscall to create new thread. |
702 | /** Process syscall to create new thread. |
703 | * |
703 | * |
704 | */ |
704 | */ |
705 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name, |
705 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name, |
706 | thread_id_t *uspace_thread_id) |
706 | thread_id_t *uspace_thread_id) |
707 | { |
707 | { |
708 | thread_t *t; |
708 | thread_t *t; |
709 | char namebuf[THREAD_NAME_BUFLEN]; |
709 | char namebuf[THREAD_NAME_BUFLEN]; |
710 | uspace_arg_t *kernel_uarg; |
710 | uspace_arg_t *kernel_uarg; |
711 | int rc; |
711 | int rc; |
712 | 712 | ||
713 | rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
713 | rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
714 | if (rc != 0) |
714 | if (rc != 0) |
715 | return (unative_t) rc; |
715 | return (unative_t) rc; |
716 | 716 | ||
717 | /* |
717 | /* |
718 | * In case of failure, kernel_uarg will be deallocated in this function. |
718 | * In case of failure, kernel_uarg will be deallocated in this function. |
719 | * In case of success, kernel_uarg will be freed in uinit(). |
719 | * In case of success, kernel_uarg will be freed in uinit(). |
720 | */ |
720 | */ |
721 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
721 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
722 | 722 | ||
723 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
723 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
724 | if (rc != 0) { |
724 | if (rc != 0) { |
725 | free(kernel_uarg); |
725 | free(kernel_uarg); |
726 | return (unative_t) rc; |
726 | return (unative_t) rc; |
727 | } |
727 | } |
728 | 728 | ||
729 | t = thread_create(uinit, kernel_uarg, TASK, |
729 | t = thread_create(uinit, kernel_uarg, TASK, |
730 | THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false); |
730 | THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false); |
731 | if (t) { |
731 | if (t) { |
732 | if (uspace_thread_id != NULL) { |
732 | if (uspace_thread_id != NULL) { |
733 | int rc; |
733 | int rc; |
734 | 734 | ||
735 | rc = copy_to_uspace(uspace_thread_id, &t->tid, |
735 | rc = copy_to_uspace(uspace_thread_id, &t->tid, |
736 | sizeof(t->tid)); |
736 | sizeof(t->tid)); |
737 | if (rc != 0) { |
737 | if (rc != 0) { |
738 | /* |
738 | /* |
739 | * We have encountered a failure, but the thread |
739 | * We have encountered a failure, but the thread |
740 | * has already been created. We need to undo its |
740 | * has already been created. We need to undo its |
741 | * creation now. |
741 | * creation now. |
742 | */ |
742 | */ |
743 | 743 | ||
744 | /* |
744 | /* |
745 | * The new thread structure is initialized, but |
745 | * The new thread structure is initialized, but |
746 | * is still not visible to the system. |
746 | * is still not visible to the system. |
747 | * We can safely deallocate it. |
747 | * We can safely deallocate it. |
748 | */ |
748 | */ |
749 | slab_free(thread_slab, t); |
749 | slab_free(thread_slab, t); |
750 | free(kernel_uarg); |
750 | free(kernel_uarg); |
751 | 751 | ||
752 | return (unative_t) rc; |
752 | return (unative_t) rc; |
753 | } |
753 | } |
754 | } |
754 | } |
755 | thread_attach(t, TASK); |
755 | thread_attach(t, TASK); |
756 | thread_ready(t); |
756 | thread_ready(t); |
757 | 757 | ||
758 | /* Generate udebug THREAD_B event */ |
758 | /* Generate udebug THREAD_B event */ |
759 | udebug_thread_b_event(t); |
759 | udebug_thread_b_event(t); |
760 | 760 | ||
761 | return 0; |
761 | return 0; |
762 | } else |
762 | } else |
763 | free(kernel_uarg); |
763 | free(kernel_uarg); |
764 | 764 | ||
765 | return (unative_t) ENOMEM; |
765 | return (unative_t) ENOMEM; |
766 | } |
766 | } |
767 | 767 | ||
768 | /** Process syscall to terminate thread. |
768 | /** Process syscall to terminate thread. |
769 | * |
769 | * |
770 | */ |
770 | */ |
771 | unative_t sys_thread_exit(int uspace_status) |
771 | unative_t sys_thread_exit(int uspace_status) |
772 | { |
772 | { |
773 | thread_exit(); |
773 | thread_exit(); |
774 | /* Unreachable */ |
774 | /* Unreachable */ |
775 | return 0; |
775 | return 0; |
776 | } |
776 | } |
777 | 777 | ||
778 | /** Syscall for getting TID. |
778 | /** Syscall for getting TID. |
779 | * |
779 | * |
780 | * @param uspace_thread_id Userspace address of 8-byte buffer where to store |
780 | * @param uspace_thread_id Userspace address of 8-byte buffer where to store |
781 | * current thread ID. |
781 | * current thread ID. |
782 | * |
782 | * |
783 | * @return 0 on success or an error code from @ref errno.h. |
783 | * @return 0 on success or an error code from @ref errno.h. |
784 | */ |
784 | */ |
785 | unative_t sys_thread_get_id(thread_id_t *uspace_thread_id) |
785 | unative_t sys_thread_get_id(thread_id_t *uspace_thread_id) |
786 | { |
786 | { |
787 | /* |
787 | /* |
788 | * No need to acquire lock on THREAD because tid |
788 | * No need to acquire lock on THREAD because tid |
789 | * remains constant for the lifespan of the thread. |
789 | * remains constant for the lifespan of the thread. |
790 | */ |
790 | */ |
791 | return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid, |
791 | return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid, |
792 | sizeof(THREAD->tid)); |
792 | sizeof(THREAD->tid)); |
793 | } |
793 | } |
794 | 794 | ||
795 | /** @} |
795 | /** @} |
796 | */ |
796 | */ |
797 | 797 |