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