Rev 2487 | Rev 2504 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2487 | Rev 2502 | ||
---|---|---|---|
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/btree.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_btree B+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 | /** B+tree of all threads. |
90 | /** ALV tree of all threads. |
91 | * |
91 | * |
92 | * When a thread is found in the threads_btree B+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 | btree_t threads_btree; |
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 | return 0; |
179 | return 0; |
180 | } |
180 | } |
181 | 181 | ||
182 | /** Destruction of thread_t object */ |
182 | /** Destruction of thread_t object */ |
183 | static int thr_destructor(void *obj) |
183 | static int thr_destructor(void *obj) |
184 | { |
184 | { |
185 | thread_t *t = (thread_t *) obj; |
185 | thread_t *t = (thread_t *) obj; |
186 | 186 | ||
187 | /* call the architecture-specific part of the destructor */ |
187 | /* call the architecture-specific part of the destructor */ |
188 | thr_destructor_arch(t); |
188 | thr_destructor_arch(t); |
189 | 189 | ||
190 | frame_free(KA2PA(t->kstack)); |
190 | frame_free(KA2PA(t->kstack)); |
191 | #ifdef ARCH_HAS_FPU |
191 | #ifdef ARCH_HAS_FPU |
192 | if (t->saved_fpu_context) |
192 | if (t->saved_fpu_context) |
193 | slab_free(fpu_context_slab, t->saved_fpu_context); |
193 | slab_free(fpu_context_slab, t->saved_fpu_context); |
194 | #endif |
194 | #endif |
195 | return 1; /* One page freed */ |
195 | return 1; /* One page freed */ |
196 | } |
196 | } |
197 | 197 | ||
198 | /** Initialize threads |
198 | /** Initialize threads |
199 | * |
199 | * |
200 | * Initialize kernel threads support. |
200 | * Initialize kernel threads support. |
201 | * |
201 | * |
202 | */ |
202 | */ |
203 | void thread_init(void) |
203 | void thread_init(void) |
204 | { |
204 | { |
205 | THREAD = NULL; |
205 | THREAD = NULL; |
206 | atomic_set(&nrdy,0); |
206 | atomic_set(&nrdy,0); |
207 | thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0, |
207 | thread_slab = slab_cache_create("thread_slab", sizeof(thread_t), 0, |
208 | thr_constructor, thr_destructor, 0); |
208 | thr_constructor, thr_destructor, 0); |
209 | 209 | ||
210 | #ifdef ARCH_HAS_FPU |
210 | #ifdef ARCH_HAS_FPU |
211 | fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t), |
211 | fpu_context_slab = slab_cache_create("fpu_slab", sizeof(fpu_context_t), |
212 | FPU_CONTEXT_ALIGN, NULL, NULL, 0); |
212 | FPU_CONTEXT_ALIGN, NULL, NULL, 0); |
213 | #endif |
213 | #endif |
214 | 214 | ||
215 | btree_create(&threads_btree); |
215 | avltree_create(&threads_tree); |
216 | } |
216 | } |
217 | 217 | ||
218 | /** Make thread ready |
218 | /** Make thread ready |
219 | * |
219 | * |
220 | * Switch thread t to the ready state. |
220 | * Switch thread t to the ready state. |
221 | * |
221 | * |
222 | * @param t Thread to make ready. |
222 | * @param t Thread to make ready. |
223 | * |
223 | * |
224 | */ |
224 | */ |
225 | void thread_ready(thread_t *t) |
225 | void thread_ready(thread_t *t) |
226 | { |
226 | { |
227 | cpu_t *cpu; |
227 | cpu_t *cpu; |
228 | runq_t *r; |
228 | runq_t *r; |
229 | ipl_t ipl; |
229 | ipl_t ipl; |
230 | int i, avg; |
230 | int i, avg; |
231 | 231 | ||
232 | ipl = interrupts_disable(); |
232 | ipl = interrupts_disable(); |
233 | 233 | ||
234 | spinlock_lock(&t->lock); |
234 | spinlock_lock(&t->lock); |
235 | 235 | ||
236 | ASSERT(!(t->state == Ready)); |
236 | ASSERT(!(t->state == Ready)); |
237 | 237 | ||
238 | i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority; |
238 | i = (t->priority < RQ_COUNT - 1) ? ++t->priority : t->priority; |
239 | 239 | ||
240 | cpu = CPU; |
240 | cpu = CPU; |
241 | if (t->flags & THREAD_FLAG_WIRED) { |
241 | if (t->flags & THREAD_FLAG_WIRED) { |
242 | ASSERT(t->cpu != NULL); |
242 | ASSERT(t->cpu != NULL); |
243 | cpu = t->cpu; |
243 | cpu = t->cpu; |
244 | } |
244 | } |
245 | t->state = Ready; |
245 | t->state = Ready; |
246 | spinlock_unlock(&t->lock); |
246 | spinlock_unlock(&t->lock); |
247 | 247 | ||
248 | /* |
248 | /* |
249 | * Append t to respective ready queue on respective processor. |
249 | * Append t to respective ready queue on respective processor. |
250 | */ |
250 | */ |
251 | r = &cpu->rq[i]; |
251 | r = &cpu->rq[i]; |
252 | spinlock_lock(&r->lock); |
252 | spinlock_lock(&r->lock); |
253 | list_append(&t->rq_link, &r->rq_head); |
253 | list_append(&t->rq_link, &r->rq_head); |
254 | r->n++; |
254 | r->n++; |
255 | spinlock_unlock(&r->lock); |
255 | spinlock_unlock(&r->lock); |
256 | 256 | ||
257 | atomic_inc(&nrdy); |
257 | atomic_inc(&nrdy); |
258 | avg = atomic_get(&nrdy) / config.cpu_active; |
258 | avg = atomic_get(&nrdy) / config.cpu_active; |
259 | atomic_inc(&cpu->nrdy); |
259 | atomic_inc(&cpu->nrdy); |
260 | 260 | ||
261 | interrupts_restore(ipl); |
261 | interrupts_restore(ipl); |
262 | } |
262 | } |
263 | 263 | ||
264 | /** Create new thread |
264 | /** Create new thread |
265 | * |
265 | * |
266 | * Create a new thread. |
266 | * Create a new thread. |
267 | * |
267 | * |
268 | * @param func Thread's implementing function. |
268 | * @param func Thread's implementing function. |
269 | * @param arg Thread's implementing function argument. |
269 | * @param arg Thread's implementing function argument. |
270 | * @param task Task to which the thread belongs. |
270 | * @param task Task to which the thread belongs. |
271 | * @param flags Thread flags. |
271 | * @param flags Thread flags. |
272 | * @param name Symbolic name. |
272 | * @param name Symbolic name. |
273 | * @param uncounted Thread's accounting doesn't affect accumulated task |
273 | * @param uncounted Thread's accounting doesn't affect accumulated task |
274 | * accounting. |
274 | * accounting. |
275 | * |
275 | * |
276 | * @return New thread's structure on success, NULL on failure. |
276 | * @return New thread's structure on success, NULL on failure. |
277 | * |
277 | * |
278 | */ |
278 | */ |
279 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, |
279 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, |
280 | int flags, char *name, bool uncounted) |
280 | int flags, char *name, bool uncounted) |
281 | { |
281 | { |
282 | thread_t *t; |
282 | thread_t *t; |
283 | ipl_t ipl; |
283 | ipl_t ipl; |
284 | 284 | ||
285 | t = (thread_t *) slab_alloc(thread_slab, 0); |
285 | t = (thread_t *) slab_alloc(thread_slab, 0); |
286 | if (!t) |
286 | if (!t) |
287 | return NULL; |
287 | return NULL; |
288 | 288 | ||
289 | /* Not needed, but good for debugging */ |
289 | /* Not needed, but good for debugging */ |
290 | memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, |
290 | memsetb((uintptr_t) t->kstack, THREAD_STACK_SIZE * 1 << STACK_FRAMES, |
291 | 0); |
291 | 0); |
292 | 292 | ||
293 | ipl = interrupts_disable(); |
293 | ipl = interrupts_disable(); |
294 | spinlock_lock(&tidlock); |
294 | spinlock_lock(&tidlock); |
295 | t->tid = ++last_tid; |
295 | t->tid = ++last_tid; |
296 | spinlock_unlock(&tidlock); |
296 | spinlock_unlock(&tidlock); |
297 | interrupts_restore(ipl); |
297 | interrupts_restore(ipl); |
298 | 298 | ||
299 | context_save(&t->saved_context); |
299 | context_save(&t->saved_context); |
300 | context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, |
300 | context_set(&t->saved_context, FADDR(cushion), (uintptr_t) t->kstack, |
301 | THREAD_STACK_SIZE); |
301 | THREAD_STACK_SIZE); |
302 | 302 | ||
303 | the_initialize((the_t *) t->kstack); |
303 | the_initialize((the_t *) t->kstack); |
304 | 304 | ||
305 | ipl = interrupts_disable(); |
305 | ipl = interrupts_disable(); |
306 | t->saved_context.ipl = interrupts_read(); |
306 | t->saved_context.ipl = interrupts_read(); |
307 | interrupts_restore(ipl); |
307 | interrupts_restore(ipl); |
308 | 308 | ||
309 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
309 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
310 | 310 | ||
311 | t->thread_code = func; |
311 | t->thread_code = func; |
312 | t->thread_arg = arg; |
312 | t->thread_arg = arg; |
313 | t->ticks = -1; |
313 | t->ticks = -1; |
314 | t->cycles = 0; |
314 | t->cycles = 0; |
315 | t->uncounted = uncounted; |
315 | t->uncounted = uncounted; |
316 | t->priority = -1; /* start in rq[0] */ |
316 | t->priority = -1; /* start in rq[0] */ |
317 | t->cpu = NULL; |
317 | t->cpu = NULL; |
318 | t->flags = flags; |
318 | t->flags = flags; |
319 | t->state = Entering; |
319 | t->state = Entering; |
320 | t->call_me = NULL; |
320 | t->call_me = NULL; |
321 | t->call_me_with = NULL; |
321 | t->call_me_with = NULL; |
322 | 322 | ||
323 | timeout_initialize(&t->sleep_timeout); |
323 | timeout_initialize(&t->sleep_timeout); |
324 | t->sleep_interruptible = false; |
324 | t->sleep_interruptible = false; |
325 | t->sleep_queue = NULL; |
325 | t->sleep_queue = NULL; |
326 | t->timeout_pending = 0; |
326 | t->timeout_pending = 0; |
327 | 327 | ||
328 | t->in_copy_from_uspace = false; |
328 | t->in_copy_from_uspace = false; |
329 | t->in_copy_to_uspace = false; |
329 | t->in_copy_to_uspace = false; |
330 | 330 | ||
331 | t->interrupted = false; |
331 | t->interrupted = false; |
332 | t->detached = false; |
332 | t->detached = false; |
333 | waitq_initialize(&t->join_wq); |
333 | waitq_initialize(&t->join_wq); |
334 | 334 | ||
335 | t->rwlock_holder_type = RWLOCK_NONE; |
335 | t->rwlock_holder_type = RWLOCK_NONE; |
336 | 336 | ||
337 | t->task = task; |
337 | t->task = task; |
338 | 338 | ||
339 | t->fpu_context_exists = 0; |
339 | t->fpu_context_exists = 0; |
340 | t->fpu_context_engaged = 0; |
340 | t->fpu_context_engaged = 0; |
341 | 341 | ||
- | 342 | avltree_node_initialize(&t->threads_tree_node); |
|
- | 343 | t->threads_tree_node.key = (uintptr_t) t; |
|
- | 344 | ||
342 | /* might depend on previous initialization */ |
345 | /* might depend on previous initialization */ |
343 | thread_create_arch(t); |
346 | thread_create_arch(t); |
344 | 347 | ||
345 | if (!(flags & THREAD_FLAG_NOATTACH)) |
348 | if (!(flags & THREAD_FLAG_NOATTACH)) |
346 | thread_attach(t, task); |
349 | thread_attach(t, task); |
347 | 350 | ||
348 | return t; |
351 | return t; |
349 | } |
352 | } |
350 | 353 | ||
351 | /** Destroy thread memory structure |
354 | /** Destroy thread memory structure |
352 | * |
355 | * |
353 | * Detach thread from all queues, cpus etc. and destroy it. |
356 | * Detach thread from all queues, cpus etc. and destroy it. |
354 | * |
357 | * |
355 | * Assume thread->lock is held!! |
358 | * Assume thread->lock is held!! |
356 | */ |
359 | */ |
357 | void thread_destroy(thread_t *t) |
360 | void thread_destroy(thread_t *t) |
358 | { |
361 | { |
359 | ASSERT(t->state == Exiting || t->state == Lingering); |
362 | ASSERT(t->state == Exiting || t->state == Lingering); |
360 | ASSERT(t->task); |
363 | ASSERT(t->task); |
361 | ASSERT(t->cpu); |
364 | ASSERT(t->cpu); |
362 | 365 | ||
363 | spinlock_lock(&t->cpu->lock); |
366 | spinlock_lock(&t->cpu->lock); |
364 | if (t->cpu->fpu_owner == t) |
367 | if (t->cpu->fpu_owner == t) |
365 | t->cpu->fpu_owner = NULL; |
368 | t->cpu->fpu_owner = NULL; |
366 | spinlock_unlock(&t->cpu->lock); |
369 | spinlock_unlock(&t->cpu->lock); |
367 | 370 | ||
368 | spinlock_unlock(&t->lock); |
371 | spinlock_unlock(&t->lock); |
369 | 372 | ||
370 | spinlock_lock(&threads_lock); |
373 | spinlock_lock(&threads_lock); |
371 | btree_remove(&threads_btree, (btree_key_t) ((uintptr_t ) t), NULL); |
374 | avltree_delete(&threads_tree, &t->threads_tree_node); |
372 | spinlock_unlock(&threads_lock); |
375 | spinlock_unlock(&threads_lock); |
373 | 376 | ||
374 | /* |
377 | /* |
375 | * Detach from the containing task. |
378 | * Detach from the containing task. |
376 | */ |
379 | */ |
377 | spinlock_lock(&t->task->lock); |
380 | spinlock_lock(&t->task->lock); |
378 | list_remove(&t->th_link); |
381 | list_remove(&t->th_link); |
379 | spinlock_unlock(&t->task->lock); |
382 | spinlock_unlock(&t->task->lock); |
380 | 383 | ||
381 | /* |
384 | /* |
382 | * t is guaranteed to be the very last thread of its task. |
385 | * t is guaranteed to be the very last thread of its task. |
383 | * It is safe to destroy the task. |
386 | * It is safe to destroy the task. |
384 | */ |
387 | */ |
385 | if (atomic_predec(&t->task->refcount) == 0) |
388 | if (atomic_predec(&t->task->refcount) == 0) |
386 | task_destroy(t->task); |
389 | task_destroy(t->task); |
387 | 390 | ||
388 | slab_free(thread_slab, t); |
391 | slab_free(thread_slab, t); |
389 | } |
392 | } |
390 | 393 | ||
391 | /** Make the thread visible to the system. |
394 | /** Make the thread visible to the system. |
392 | * |
395 | * |
393 | * Attach the thread structure to the current task and make it visible in the |
396 | * Attach the thread structure to the current task and make it visible in the |
394 | * threads_btree. |
397 | * threads_tree. |
395 | * |
398 | * |
396 | * @param t Thread to be attached to the task. |
399 | * @param t Thread to be attached to the task. |
397 | * @param task Task to which the thread is to be attached. |
400 | * @param task Task to which the thread is to be attached. |
398 | */ |
401 | */ |
399 | void thread_attach(thread_t *t, task_t *task) |
402 | void thread_attach(thread_t *t, task_t *task) |
400 | { |
403 | { |
401 | ipl_t ipl; |
404 | ipl_t ipl; |
402 | 405 | ||
403 | /* |
406 | /* |
404 | * Attach to the current task. |
407 | * Attach to the current task. |
405 | */ |
408 | */ |
406 | ipl = interrupts_disable(); |
409 | ipl = interrupts_disable(); |
407 | spinlock_lock(&task->lock); |
410 | spinlock_lock(&task->lock); |
408 | atomic_inc(&task->refcount); |
411 | atomic_inc(&task->refcount); |
409 | atomic_inc(&task->lifecount); |
412 | atomic_inc(&task->lifecount); |
410 | list_append(&t->th_link, &task->th_head); |
413 | list_append(&t->th_link, &task->th_head); |
411 | spinlock_unlock(&task->lock); |
414 | spinlock_unlock(&task->lock); |
412 | 415 | ||
413 | /* |
416 | /* |
414 | * Register this thread in the system-wide list. |
417 | * Register this thread in the system-wide list. |
415 | */ |
418 | */ |
416 | spinlock_lock(&threads_lock); |
419 | spinlock_lock(&threads_lock); |
417 | btree_insert(&threads_btree, (btree_key_t) ((uintptr_t) t), (void *) t, |
420 | avltree_insert(&threads_tree, &t->threads_tree_node); |
418 | NULL); |
- | |
419 | spinlock_unlock(&threads_lock); |
421 | spinlock_unlock(&threads_lock); |
420 | 422 | ||
421 | interrupts_restore(ipl); |
423 | interrupts_restore(ipl); |
422 | } |
424 | } |
423 | 425 | ||
424 | /** Terminate thread. |
426 | /** Terminate thread. |
425 | * |
427 | * |
426 | * End current thread execution and switch it to the exiting state. All pending |
428 | * End current thread execution and switch it to the exiting state. All pending |
427 | * timeouts are executed. |
429 | * timeouts are executed. |
428 | */ |
430 | */ |
429 | void thread_exit(void) |
431 | void thread_exit(void) |
430 | { |
432 | { |
431 | ipl_t ipl; |
433 | ipl_t ipl; |
432 | 434 | ||
433 | if (atomic_predec(&TASK->lifecount) == 0) { |
435 | if (atomic_predec(&TASK->lifecount) == 0) { |
434 | /* |
436 | /* |
435 | * We are the last thread in the task that still has not exited. |
437 | * We are the last thread in the task that still has not exited. |
436 | * With the exception of the moment the task was created, new |
438 | * With the exception of the moment the task was created, new |
437 | * threads can only be created by threads of the same task. |
439 | * threads can only be created by threads of the same task. |
438 | * We are safe to perform cleanup. |
440 | * We are safe to perform cleanup. |
439 | */ |
441 | */ |
440 | if (THREAD->flags & THREAD_FLAG_USPACE) { |
442 | if (THREAD->flags & THREAD_FLAG_USPACE) { |
441 | ipc_cleanup(); |
443 | ipc_cleanup(); |
442 | futex_cleanup(); |
444 | futex_cleanup(); |
443 | klog_printf("Cleanup of task %llu completed.", |
445 | klog_printf("Cleanup of task %llu completed.", |
444 | TASK->taskid); |
446 | TASK->taskid); |
445 | } |
447 | } |
446 | } |
448 | } |
447 | 449 | ||
448 | restart: |
450 | restart: |
449 | ipl = interrupts_disable(); |
451 | ipl = interrupts_disable(); |
450 | spinlock_lock(&THREAD->lock); |
452 | spinlock_lock(&THREAD->lock); |
451 | if (THREAD->timeout_pending) { |
453 | if (THREAD->timeout_pending) { |
452 | /* busy waiting for timeouts in progress */ |
454 | /* busy waiting for timeouts in progress */ |
453 | spinlock_unlock(&THREAD->lock); |
455 | spinlock_unlock(&THREAD->lock); |
454 | interrupts_restore(ipl); |
456 | interrupts_restore(ipl); |
455 | goto restart; |
457 | goto restart; |
456 | } |
458 | } |
457 | 459 | ||
458 | THREAD->state = Exiting; |
460 | THREAD->state = Exiting; |
459 | spinlock_unlock(&THREAD->lock); |
461 | spinlock_unlock(&THREAD->lock); |
460 | scheduler(); |
462 | scheduler(); |
461 | 463 | ||
462 | /* Not reached */ |
464 | /* Not reached */ |
463 | while (1) |
465 | while (1) |
464 | ; |
466 | ; |
465 | } |
467 | } |
466 | 468 | ||
467 | 469 | ||
468 | /** Thread sleep |
470 | /** Thread sleep |
469 | * |
471 | * |
470 | * Suspend execution of the current thread. |
472 | * Suspend execution of the current thread. |
471 | * |
473 | * |
472 | * @param sec Number of seconds to sleep. |
474 | * @param sec Number of seconds to sleep. |
473 | * |
475 | * |
474 | */ |
476 | */ |
475 | void thread_sleep(uint32_t sec) |
477 | void thread_sleep(uint32_t sec) |
476 | { |
478 | { |
477 | thread_usleep(sec * 1000000); |
479 | thread_usleep(sec * 1000000); |
478 | } |
480 | } |
479 | 481 | ||
480 | /** Wait for another thread to exit. |
482 | /** Wait for another thread to exit. |
481 | * |
483 | * |
482 | * @param t Thread to join on exit. |
484 | * @param t Thread to join on exit. |
483 | * @param usec Timeout in microseconds. |
485 | * @param usec Timeout in microseconds. |
484 | * @param flags Mode of operation. |
486 | * @param flags Mode of operation. |
485 | * |
487 | * |
486 | * @return An error code from errno.h or an error code from synch.h. |
488 | * @return An error code from errno.h or an error code from synch.h. |
487 | */ |
489 | */ |
488 | int thread_join_timeout(thread_t *t, uint32_t usec, int flags) |
490 | int thread_join_timeout(thread_t *t, uint32_t usec, int flags) |
489 | { |
491 | { |
490 | ipl_t ipl; |
492 | ipl_t ipl; |
491 | int rc; |
493 | int rc; |
492 | 494 | ||
493 | if (t == THREAD) |
495 | if (t == THREAD) |
494 | return EINVAL; |
496 | return EINVAL; |
495 | 497 | ||
496 | /* |
498 | /* |
497 | * Since thread join can only be called once on an undetached thread, |
499 | * Since thread join can only be called once on an undetached thread, |
498 | * the thread pointer is guaranteed to be still valid. |
500 | * the thread pointer is guaranteed to be still valid. |
499 | */ |
501 | */ |
500 | 502 | ||
501 | ipl = interrupts_disable(); |
503 | ipl = interrupts_disable(); |
502 | spinlock_lock(&t->lock); |
504 | spinlock_lock(&t->lock); |
503 | ASSERT(!t->detached); |
505 | ASSERT(!t->detached); |
504 | spinlock_unlock(&t->lock); |
506 | spinlock_unlock(&t->lock); |
505 | interrupts_restore(ipl); |
507 | interrupts_restore(ipl); |
506 | 508 | ||
507 | rc = waitq_sleep_timeout(&t->join_wq, usec, flags); |
509 | rc = waitq_sleep_timeout(&t->join_wq, usec, flags); |
508 | 510 | ||
509 | return rc; |
511 | return rc; |
510 | } |
512 | } |
511 | 513 | ||
512 | /** Detach thread. |
514 | /** Detach thread. |
513 | * |
515 | * |
514 | * Mark the thread as detached, if the thread is already in the Lingering |
516 | * Mark the thread as detached, if the thread is already in the Lingering |
515 | * state, deallocate its resources. |
517 | * state, deallocate its resources. |
516 | * |
518 | * |
517 | * @param t Thread to be detached. |
519 | * @param t Thread to be detached. |
518 | */ |
520 | */ |
519 | void thread_detach(thread_t *t) |
521 | void thread_detach(thread_t *t) |
520 | { |
522 | { |
521 | ipl_t ipl; |
523 | ipl_t ipl; |
522 | 524 | ||
523 | /* |
525 | /* |
524 | * Since the thread is expected not to be already detached, |
526 | * Since the thread is expected not to be already detached, |
525 | * pointer to it must be still valid. |
527 | * pointer to it must be still valid. |
526 | */ |
528 | */ |
527 | ipl = interrupts_disable(); |
529 | ipl = interrupts_disable(); |
528 | spinlock_lock(&t->lock); |
530 | spinlock_lock(&t->lock); |
529 | ASSERT(!t->detached); |
531 | ASSERT(!t->detached); |
530 | if (t->state == Lingering) { |
532 | if (t->state == Lingering) { |
531 | thread_destroy(t); /* unlocks &t->lock */ |
533 | thread_destroy(t); /* unlocks &t->lock */ |
532 | interrupts_restore(ipl); |
534 | interrupts_restore(ipl); |
533 | return; |
535 | return; |
534 | } else { |
536 | } else { |
535 | t->detached = true; |
537 | t->detached = true; |
536 | } |
538 | } |
537 | spinlock_unlock(&t->lock); |
539 | spinlock_unlock(&t->lock); |
538 | interrupts_restore(ipl); |
540 | interrupts_restore(ipl); |
539 | } |
541 | } |
540 | 542 | ||
541 | /** Thread usleep |
543 | /** Thread usleep |
542 | * |
544 | * |
543 | * Suspend execution of the current thread. |
545 | * Suspend execution of the current thread. |
544 | * |
546 | * |
545 | * @param usec Number of microseconds to sleep. |
547 | * @param usec Number of microseconds to sleep. |
546 | * |
548 | * |
547 | */ |
549 | */ |
548 | void thread_usleep(uint32_t usec) |
550 | void thread_usleep(uint32_t usec) |
549 | { |
551 | { |
550 | waitq_t wq; |
552 | waitq_t wq; |
551 | 553 | ||
552 | waitq_initialize(&wq); |
554 | waitq_initialize(&wq); |
553 | 555 | ||
554 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING); |
556 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_FLAGS_NON_BLOCKING); |
555 | } |
557 | } |
556 | 558 | ||
557 | /** Register thread out-of-context invocation |
559 | /** Register thread out-of-context invocation |
558 | * |
560 | * |
559 | * Register a function and its argument to be executed |
561 | * Register a function and its argument to be executed |
560 | * on next context switch to the current thread. |
562 | * on next context switch to the current thread. |
561 | * |
563 | * |
562 | * @param call_me Out-of-context function. |
564 | * @param call_me Out-of-context function. |
563 | * @param call_me_with Out-of-context function argument. |
565 | * @param call_me_with Out-of-context function argument. |
564 | * |
566 | * |
565 | */ |
567 | */ |
566 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
568 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
567 | { |
569 | { |
568 | ipl_t ipl; |
570 | ipl_t ipl; |
569 | 571 | ||
570 | ipl = interrupts_disable(); |
572 | ipl = interrupts_disable(); |
571 | spinlock_lock(&THREAD->lock); |
573 | spinlock_lock(&THREAD->lock); |
572 | THREAD->call_me = call_me; |
574 | THREAD->call_me = call_me; |
573 | THREAD->call_me_with = call_me_with; |
575 | THREAD->call_me_with = call_me_with; |
574 | spinlock_unlock(&THREAD->lock); |
576 | spinlock_unlock(&THREAD->lock); |
575 | interrupts_restore(ipl); |
577 | interrupts_restore(ipl); |
576 | } |
578 | } |
577 | 579 | ||
- | 580 | static void thread_walker(avltree_node_t *node) |
|
- | 581 | { |
|
- | 582 | thread_t *t; |
|
- | 583 | ||
- | 584 | t = avltree_get_instance(node, thread_t, threads_tree_node); |
|
- | 585 | ||
- | 586 | uint64_t cycles; |
|
- | 587 | char suffix; |
|
- | 588 | order(t->cycles, &cycles, &suffix); |
|
- | 589 | ||
- | 590 | printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx %#10zx %9llu%c ", |
|
- | 591 | t->tid, t->name, t, thread_states[t->state], t->task, |
|
- | 592 | t->task->context, t->thread_code, t->kstack, cycles, suffix); |
|
- | 593 | ||
- | 594 | if (t->cpu) |
|
- | 595 | printf("%-4zd", t->cpu->id); |
|
- | 596 | else |
|
- | 597 | printf("none"); |
|
- | 598 | ||
- | 599 | if (t->state == Sleeping) |
|
- | 600 | printf(" %#10zx", t->sleep_queue); |
|
- | 601 | ||
- | 602 | printf("\n"); |
|
- | 603 | } |
|
- | 604 | ||
578 | /** Print list of threads debug info */ |
605 | /** Print list of threads debug info */ |
579 | void thread_print_list(void) |
606 | void thread_print_list(void) |
580 | { |
607 | { |
581 | link_t *cur; |
- | |
582 | ipl_t ipl; |
608 | ipl_t ipl; |
583 | 609 | ||
584 | /* Messing with thread structures, avoid deadlock */ |
610 | /* Messing with thread structures, avoid deadlock */ |
585 | ipl = interrupts_disable(); |
611 | ipl = interrupts_disable(); |
586 | spinlock_lock(&threads_lock); |
612 | spinlock_lock(&threads_lock); |
587 | 613 | ||
588 | printf("tid name address state task ctx code " |
614 | printf("tid name address state task ctx code " |
589 | " stack cycles cpu waitqueue\n"); |
615 | " stack cycles cpu waitqueue\n"); |
590 | printf("------ ---------- ---------- -------- ---------- --- --------" |
616 | printf("------ ---------- ---------- -------- ---------- --- --------" |
591 | "-- ---------- ---------- ---- ---------\n"); |
617 | "-- ---------- ---------- ---- ---------\n"); |
592 | 618 | ||
593 | for (cur = threads_btree.leaf_head.next; |
619 | avltree_walk(&threads_tree, thread_walker); |
594 | cur != &threads_btree.leaf_head; cur = cur->next) { |
- | |
595 | btree_node_t *node; |
- | |
596 | unsigned int i; |
- | |
597 | - | ||
598 | node = list_get_instance(cur, btree_node_t, leaf_link); |
- | |
599 | for (i = 0; i < node->keys; i++) { |
- | |
600 | thread_t *t; |
- | |
601 | - | ||
602 | t = (thread_t *) node->value[i]; |
- | |
603 | - | ||
604 | uint64_t cycles; |
- | |
605 | char suffix; |
- | |
606 | order(t->cycles, &cycles, &suffix); |
- | |
607 | - | ||
608 | printf("%-6llu %-10s %#10zx %-8s %#10zx %-3ld %#10zx " |
- | |
609 | "%#10zx %9llu%c ", t->tid, t->name, t, |
- | |
610 | thread_states[t->state], t->task, t->task->context, |
- | |
611 | t->thread_code, t->kstack, cycles, suffix); |
- | |
612 | - | ||
613 | if (t->cpu) |
- | |
614 | printf("%-4zd", t->cpu->id); |
- | |
615 | else |
- | |
616 | printf("none"); |
- | |
617 | - | ||
618 | if (t->state == Sleeping) |
- | |
619 | printf(" %#10zx", t->sleep_queue); |
- | |
620 | - | ||
621 | printf("\n"); |
- | |
622 | } |
- | |
623 | } |
- | |
624 | 620 | ||
625 | spinlock_unlock(&threads_lock); |
621 | spinlock_unlock(&threads_lock); |
626 | interrupts_restore(ipl); |
622 | interrupts_restore(ipl); |
627 | } |
623 | } |
628 | 624 | ||
629 | /** Check whether thread exists. |
625 | /** Check whether thread exists. |
630 | * |
626 | * |
631 | * Note that threads_lock must be already held and |
627 | * Note that threads_lock must be already held and |
632 | * interrupts must be already disabled. |
628 | * interrupts must be already disabled. |
633 | * |
629 | * |
634 | * @param t Pointer to thread. |
630 | * @param t Pointer to thread. |
635 | * |
631 | * |
636 | * @return True if thread t is known to the system, false otherwise. |
632 | * @return True if thread t is known to the system, false otherwise. |
637 | */ |
633 | */ |
638 | bool thread_exists(thread_t *t) |
634 | bool thread_exists(thread_t *t) |
639 | { |
635 | { |
640 | btree_node_t *leaf; |
636 | avltree_node_t *node; |
- | 637 | ||
- | 638 | node = avltree_search(&threads_tree, (avltree_key_t) ((uintptr_t) t)); |
|
641 | 639 | ||
642 | return btree_search(&threads_btree, (btree_key_t) ((uintptr_t) t), |
- | |
643 | &leaf) != NULL; |
640 | return node != NULL; |
644 | } |
641 | } |
645 | 642 | ||
646 | 643 | ||
647 | /** Update accounting of current thread. |
644 | /** Update accounting of current thread. |
648 | * |
645 | * |
649 | * Note that thread_lock on THREAD must be already held and |
646 | * Note that thread_lock on THREAD must be already held and |
650 | * interrupts must be already disabled. |
647 | * interrupts must be already disabled. |
651 | * |
648 | * |
652 | */ |
649 | */ |
653 | void thread_update_accounting(void) |
650 | void thread_update_accounting(void) |
654 | { |
651 | { |
655 | uint64_t time = get_cycle(); |
652 | uint64_t time = get_cycle(); |
656 | THREAD->cycles += time - THREAD->last_cycle; |
653 | THREAD->cycles += time - THREAD->last_cycle; |
657 | THREAD->last_cycle = time; |
654 | THREAD->last_cycle = time; |
658 | } |
655 | } |
659 | 656 | ||
660 | /** Process syscall to create new thread. |
657 | /** Process syscall to create new thread. |
661 | * |
658 | * |
662 | */ |
659 | */ |
663 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name, |
660 | unative_t sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name, |
664 | thread_id_t *uspace_thread_id) |
661 | thread_id_t *uspace_thread_id) |
665 | { |
662 | { |
666 | thread_t *t; |
663 | thread_t *t; |
667 | char namebuf[THREAD_NAME_BUFLEN]; |
664 | char namebuf[THREAD_NAME_BUFLEN]; |
668 | uspace_arg_t *kernel_uarg; |
665 | uspace_arg_t *kernel_uarg; |
669 | int rc; |
666 | int rc; |
670 | 667 | ||
671 | rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
668 | rc = copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
672 | if (rc != 0) |
669 | if (rc != 0) |
673 | return (unative_t) rc; |
670 | return (unative_t) rc; |
674 | 671 | ||
675 | /* |
672 | /* |
676 | * In case of failure, kernel_uarg will be deallocated in this function. |
673 | * In case of failure, kernel_uarg will be deallocated in this function. |
677 | * In case of success, kernel_uarg will be freed in uinit(). |
674 | * In case of success, kernel_uarg will be freed in uinit(). |
678 | */ |
675 | */ |
679 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
676 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
680 | 677 | ||
681 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
678 | rc = copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
682 | if (rc != 0) { |
679 | if (rc != 0) { |
683 | free(kernel_uarg); |
680 | free(kernel_uarg); |
684 | return (unative_t) rc; |
681 | return (unative_t) rc; |
685 | } |
682 | } |
686 | 683 | ||
687 | t = thread_create(uinit, kernel_uarg, TASK, |
684 | t = thread_create(uinit, kernel_uarg, TASK, |
688 | THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false); |
685 | THREAD_FLAG_USPACE | THREAD_FLAG_NOATTACH, namebuf, false); |
689 | if (t) { |
686 | if (t) { |
690 | if (uspace_thread_id != NULL) { |
687 | if (uspace_thread_id != NULL) { |
691 | int rc; |
688 | int rc; |
692 | 689 | ||
693 | rc = copy_to_uspace(uspace_thread_id, &t->tid, |
690 | rc = copy_to_uspace(uspace_thread_id, &t->tid, |
694 | sizeof(t->tid)); |
691 | sizeof(t->tid)); |
695 | if (rc != 0) { |
692 | if (rc != 0) { |
696 | /* |
693 | /* |
697 | * We have encountered a failure, but the thread |
694 | * We have encountered a failure, but the thread |
698 | * has already been created. We need to undo its |
695 | * has already been created. We need to undo its |
699 | * creation now. |
696 | * creation now. |
700 | */ |
697 | */ |
701 | 698 | ||
702 | /* |
699 | /* |
703 | * The new thread structure is initialized, but |
700 | * The new thread structure is initialized, but |
704 | * is still not visible to the system. |
701 | * is still not visible to the system. |
705 | * We can safely deallocate it. |
702 | * We can safely deallocate it. |
706 | */ |
703 | */ |
707 | slab_free(thread_slab, t); |
704 | slab_free(thread_slab, t); |
708 | free(kernel_uarg); |
705 | free(kernel_uarg); |
709 | 706 | ||
710 | return (unative_t) rc; |
707 | return (unative_t) rc; |
711 | } |
708 | } |
712 | } |
709 | } |
713 | thread_attach(t, TASK); |
710 | thread_attach(t, TASK); |
714 | thread_ready(t); |
711 | thread_ready(t); |
715 | 712 | ||
716 | return 0; |
713 | return 0; |
717 | } else |
714 | } else |
718 | free(kernel_uarg); |
715 | free(kernel_uarg); |
719 | 716 | ||
720 | return (unative_t) ENOMEM; |
717 | return (unative_t) ENOMEM; |
721 | } |
718 | } |
722 | 719 | ||
723 | /** Process syscall to terminate thread. |
720 | /** Process syscall to terminate thread. |
724 | * |
721 | * |
725 | */ |
722 | */ |
726 | unative_t sys_thread_exit(int uspace_status) |
723 | unative_t sys_thread_exit(int uspace_status) |
727 | { |
724 | { |
728 | thread_exit(); |
725 | thread_exit(); |
729 | /* Unreachable */ |
726 | /* Unreachable */ |
730 | return 0; |
727 | return 0; |
731 | } |
728 | } |
732 | 729 | ||
733 | /** Syscall for getting TID. |
730 | /** Syscall for getting TID. |
734 | * |
731 | * |
735 | * @param uspace_thread_id Userspace address of 8-byte buffer where to store |
732 | * @param uspace_thread_id Userspace address of 8-byte buffer where to store |
736 | * current thread ID. |
733 | * current thread ID. |
737 | * |
734 | * |
738 | * @return 0 on success or an error code from @ref errno.h. |
735 | * @return 0 on success or an error code from @ref errno.h. |
739 | */ |
736 | */ |
740 | unative_t sys_thread_get_id(thread_id_t *uspace_thread_id) |
737 | unative_t sys_thread_get_id(thread_id_t *uspace_thread_id) |
741 | { |
738 | { |
742 | /* |
739 | /* |
743 | * No need to acquire lock on THREAD because tid |
740 | * No need to acquire lock on THREAD because tid |
744 | * remains constant for the lifespan of the thread. |
741 | * remains constant for the lifespan of the thread. |
745 | */ |
742 | */ |
746 | return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid, |
743 | return (unative_t) copy_to_uspace(uspace_thread_id, &THREAD->tid, |
747 | sizeof(THREAD->tid)); |
744 | sizeof(THREAD->tid)); |
748 | } |
745 | } |
749 | 746 | ||
750 | /** @} |
747 | /** @} |
751 | */ |
748 | */ |
752 | 749 |