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