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