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