Rev 1171 | Rev 1184 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1171 | Rev 1177 | ||
---|---|---|---|
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 | #include <proc/scheduler.h> |
29 | #include <proc/scheduler.h> |
30 | #include <proc/thread.h> |
30 | #include <proc/thread.h> |
31 | #include <proc/task.h> |
31 | #include <proc/task.h> |
32 | #include <proc/uarg.h> |
32 | #include <proc/uarg.h> |
33 | #include <mm/frame.h> |
33 | #include <mm/frame.h> |
34 | #include <mm/page.h> |
34 | #include <mm/page.h> |
35 | #include <arch/asm.h> |
35 | #include <arch/asm.h> |
36 | #include <arch.h> |
36 | #include <arch.h> |
37 | #include <synch/synch.h> |
37 | #include <synch/synch.h> |
38 | #include <synch/spinlock.h> |
38 | #include <synch/spinlock.h> |
39 | #include <synch/waitq.h> |
39 | #include <synch/waitq.h> |
40 | #include <synch/rwlock.h> |
40 | #include <synch/rwlock.h> |
41 | #include <cpu.h> |
41 | #include <cpu.h> |
42 | #include <func.h> |
42 | #include <func.h> |
43 | #include <context.h> |
43 | #include <context.h> |
44 | #include <adt/btree.h> |
44 | #include <adt/btree.h> |
45 | #include <adt/list.h> |
45 | #include <adt/list.h> |
46 | #include <typedefs.h> |
46 | #include <typedefs.h> |
47 | #include <time/clock.h> |
47 | #include <time/clock.h> |
48 | #include <adt/list.h> |
48 | #include <adt/list.h> |
49 | #include <config.h> |
49 | #include <config.h> |
50 | #include <arch/interrupt.h> |
50 | #include <arch/interrupt.h> |
51 | #include <smp/ipi.h> |
51 | #include <smp/ipi.h> |
52 | #include <arch/faddr.h> |
52 | #include <arch/faddr.h> |
53 | #include <atomic.h> |
53 | #include <atomic.h> |
54 | #include <memstr.h> |
54 | #include <memstr.h> |
55 | #include <print.h> |
55 | #include <print.h> |
56 | #include <mm/slab.h> |
56 | #include <mm/slab.h> |
57 | #include <debug.h> |
57 | #include <debug.h> |
58 | #include <main/uinit.h> |
58 | #include <main/uinit.h> |
59 | 59 | ||
60 | char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /**< Thread states */ |
60 | char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /**< Thread states */ |
61 | 61 | ||
62 | /** Lock protecting threads_head list. For locking rules, see declaration thereof. */ |
62 | /** Lock protecting threads_head list. For locking rules, see declaration thereof. */ |
63 | SPINLOCK_INITIALIZE(threads_lock); |
63 | SPINLOCK_INITIALIZE(threads_lock); |
64 | btree_t threads_btree; /**< B+tree of all threads. */ |
64 | btree_t threads_btree; /**< B+tree of all threads. */ |
65 | 65 | ||
66 | SPINLOCK_INITIALIZE(tidlock); |
66 | SPINLOCK_INITIALIZE(tidlock); |
67 | __u32 last_tid = 0; |
67 | __u32 last_tid = 0; |
68 | 68 | ||
69 | static slab_cache_t *thread_slab; |
69 | static slab_cache_t *thread_slab; |
70 | #ifdef ARCH_HAS_FPU |
70 | #ifdef ARCH_HAS_FPU |
71 | slab_cache_t *fpu_context_slab; |
71 | slab_cache_t *fpu_context_slab; |
72 | #endif |
72 | #endif |
73 | 73 | ||
74 | /** Thread wrapper |
74 | /** Thread wrapper |
75 | * |
75 | * |
76 | * This wrapper is provided to ensure that every thread |
76 | * This wrapper is provided to ensure that every thread |
77 | * makes a call to thread_exit() when its implementing |
77 | * makes a call to thread_exit() when its implementing |
78 | * function returns. |
78 | * function returns. |
79 | * |
79 | * |
80 | * interrupts_disable() is assumed. |
80 | * interrupts_disable() is assumed. |
81 | * |
81 | * |
82 | */ |
82 | */ |
83 | static void cushion(void) |
83 | static void cushion(void) |
84 | { |
84 | { |
85 | void (*f)(void *) = THREAD->thread_code; |
85 | void (*f)(void *) = THREAD->thread_code; |
86 | void *arg = THREAD->thread_arg; |
86 | void *arg = THREAD->thread_arg; |
87 | 87 | ||
88 | /* this is where each thread wakes up after its creation */ |
88 | /* this is where each thread wakes up after its creation */ |
89 | spinlock_unlock(&THREAD->lock); |
89 | spinlock_unlock(&THREAD->lock); |
90 | interrupts_enable(); |
90 | interrupts_enable(); |
91 | 91 | ||
92 | f(arg); |
92 | f(arg); |
93 | thread_exit(); |
93 | thread_exit(); |
94 | /* not reached */ |
94 | /* not reached */ |
95 | } |
95 | } |
96 | 96 | ||
97 | /** Initialization and allocation for thread_t structure */ |
97 | /** Initialization and allocation for thread_t structure */ |
98 | static int thr_constructor(void *obj, int kmflags) |
98 | static int thr_constructor(void *obj, int kmflags) |
99 | { |
99 | { |
100 | thread_t *t = (thread_t *)obj; |
100 | thread_t *t = (thread_t *)obj; |
101 | pfn_t pfn; |
101 | pfn_t pfn; |
102 | int status; |
102 | int status; |
103 | 103 | ||
104 | spinlock_initialize(&t->lock, "thread_t_lock"); |
104 | spinlock_initialize(&t->lock, "thread_t_lock"); |
105 | link_initialize(&t->rq_link); |
105 | link_initialize(&t->rq_link); |
106 | link_initialize(&t->wq_link); |
106 | link_initialize(&t->wq_link); |
107 | link_initialize(&t->th_link); |
107 | link_initialize(&t->th_link); |
108 | 108 | ||
109 | #ifdef ARCH_HAS_FPU |
109 | #ifdef ARCH_HAS_FPU |
110 | # ifdef CONFIG_FPU_LAZY |
110 | # ifdef CONFIG_FPU_LAZY |
111 | t->saved_fpu_context = NULL; |
111 | t->saved_fpu_context = NULL; |
112 | # else |
112 | # else |
113 | t->saved_fpu_context = slab_alloc(fpu_context_slab,kmflags); |
113 | t->saved_fpu_context = slab_alloc(fpu_context_slab,kmflags); |
114 | if (!t->saved_fpu_context) |
114 | if (!t->saved_fpu_context) |
115 | return -1; |
115 | return -1; |
116 | # endif |
116 | # endif |
117 | #endif |
117 | #endif |
118 | 118 | ||
119 | pfn = frame_alloc_rc(STACK_FRAMES, FRAME_KA | kmflags,&status); |
119 | pfn = frame_alloc_rc(STACK_FRAMES, FRAME_KA | kmflags,&status); |
120 | if (status) { |
120 | if (status) { |
121 | #ifdef ARCH_HAS_FPU |
121 | #ifdef ARCH_HAS_FPU |
122 | if (t->saved_fpu_context) |
122 | if (t->saved_fpu_context) |
123 | slab_free(fpu_context_slab,t->saved_fpu_context); |
123 | slab_free(fpu_context_slab,t->saved_fpu_context); |
124 | #endif |
124 | #endif |
125 | return -1; |
125 | return -1; |
126 | } |
126 | } |
127 | t->kstack = (__u8 *)PA2KA(PFN2ADDR(pfn)); |
127 | t->kstack = (__u8 *)PA2KA(PFN2ADDR(pfn)); |
128 | 128 | ||
129 | return 0; |
129 | return 0; |
130 | } |
130 | } |
131 | 131 | ||
132 | /** Destruction of thread_t object */ |
132 | /** Destruction of thread_t object */ |
133 | static int thr_destructor(void *obj) |
133 | static int thr_destructor(void *obj) |
134 | { |
134 | { |
135 | thread_t *t = (thread_t *)obj; |
135 | thread_t *t = (thread_t *)obj; |
136 | 136 | ||
137 | frame_free(ADDR2PFN(KA2PA(t->kstack))); |
137 | frame_free(ADDR2PFN(KA2PA(t->kstack))); |
138 | #ifdef ARCH_HAS_FPU |
138 | #ifdef ARCH_HAS_FPU |
139 | if (t->saved_fpu_context) |
139 | if (t->saved_fpu_context) |
140 | slab_free(fpu_context_slab,t->saved_fpu_context); |
140 | slab_free(fpu_context_slab,t->saved_fpu_context); |
141 | #endif |
141 | #endif |
142 | return 1; /* One page freed */ |
142 | return 1; /* One page freed */ |
143 | } |
143 | } |
144 | 144 | ||
145 | /** Initialize threads |
145 | /** Initialize threads |
146 | * |
146 | * |
147 | * Initialize kernel threads support. |
147 | * Initialize kernel threads support. |
148 | * |
148 | * |
149 | */ |
149 | */ |
150 | void thread_init(void) |
150 | void thread_init(void) |
151 | { |
151 | { |
152 | THREAD = NULL; |
152 | THREAD = NULL; |
153 | atomic_set(&nrdy,0); |
153 | atomic_set(&nrdy,0); |
154 | thread_slab = slab_cache_create("thread_slab", |
154 | thread_slab = slab_cache_create("thread_slab", |
155 | sizeof(thread_t),0, |
155 | sizeof(thread_t),0, |
156 | thr_constructor, thr_destructor, 0); |
156 | thr_constructor, thr_destructor, 0); |
157 | #ifdef ARCH_HAS_FPU |
157 | #ifdef ARCH_HAS_FPU |
158 | fpu_context_slab = slab_cache_create("fpu_slab", |
158 | fpu_context_slab = slab_cache_create("fpu_slab", |
159 | sizeof(fpu_context_t), |
159 | sizeof(fpu_context_t), |
160 | FPU_CONTEXT_ALIGN, |
160 | FPU_CONTEXT_ALIGN, |
161 | NULL, NULL, 0); |
161 | NULL, NULL, 0); |
162 | #endif |
162 | #endif |
163 | 163 | ||
164 | btree_create(&threads_btree); |
164 | btree_create(&threads_btree); |
165 | } |
165 | } |
166 | 166 | ||
167 | /** Make thread ready |
167 | /** Make thread ready |
168 | * |
168 | * |
169 | * Switch thread t to the ready state. |
169 | * Switch thread t to the ready state. |
170 | * |
170 | * |
171 | * @param t Thread to make ready. |
171 | * @param t Thread to make ready. |
172 | * |
172 | * |
173 | */ |
173 | */ |
174 | void thread_ready(thread_t *t) |
174 | void thread_ready(thread_t *t) |
175 | { |
175 | { |
176 | cpu_t *cpu; |
176 | cpu_t *cpu; |
177 | runq_t *r; |
177 | runq_t *r; |
178 | ipl_t ipl; |
178 | ipl_t ipl; |
179 | int i, avg; |
179 | int i, avg; |
180 | 180 | ||
181 | ipl = interrupts_disable(); |
181 | ipl = interrupts_disable(); |
182 | 182 | ||
183 | spinlock_lock(&t->lock); |
183 | spinlock_lock(&t->lock); |
184 | 184 | ||
185 | ASSERT(! (t->state == Ready)); |
185 | ASSERT(! (t->state == Ready)); |
186 | 186 | ||
187 | i = (t->priority < RQ_COUNT -1) ? ++t->priority : t->priority; |
187 | i = (t->priority < RQ_COUNT -1) ? ++t->priority : t->priority; |
188 | 188 | ||
189 | cpu = CPU; |
189 | cpu = CPU; |
190 | if (t->flags & X_WIRED) { |
190 | if (t->flags & X_WIRED) { |
191 | cpu = t->cpu; |
191 | cpu = t->cpu; |
192 | } |
192 | } |
193 | t->state = Ready; |
193 | t->state = Ready; |
194 | spinlock_unlock(&t->lock); |
194 | spinlock_unlock(&t->lock); |
195 | 195 | ||
196 | /* |
196 | /* |
197 | * Append t to respective ready queue on respective processor. |
197 | * Append t to respective ready queue on respective processor. |
198 | */ |
198 | */ |
199 | r = &cpu->rq[i]; |
199 | r = &cpu->rq[i]; |
200 | spinlock_lock(&r->lock); |
200 | spinlock_lock(&r->lock); |
201 | list_append(&t->rq_link, &r->rq_head); |
201 | list_append(&t->rq_link, &r->rq_head); |
202 | r->n++; |
202 | r->n++; |
203 | spinlock_unlock(&r->lock); |
203 | spinlock_unlock(&r->lock); |
204 | 204 | ||
205 | atomic_inc(&nrdy); |
205 | atomic_inc(&nrdy); |
206 | avg = atomic_get(&nrdy) / config.cpu_active; |
206 | avg = atomic_get(&nrdy) / config.cpu_active; |
207 | atomic_inc(&cpu->nrdy); |
207 | atomic_inc(&cpu->nrdy); |
208 | 208 | ||
209 | interrupts_restore(ipl); |
209 | interrupts_restore(ipl); |
210 | } |
210 | } |
211 | 211 | ||
212 | /** Destroy thread memory structure |
212 | /** Destroy thread memory structure |
213 | * |
213 | * |
214 | * Detach thread from all queues, cpus etc. and destroy it. |
214 | * Detach thread from all queues, cpus etc. and destroy it. |
215 | * |
215 | * |
216 | * Assume thread->lock is held!! |
216 | * Assume thread->lock is held!! |
217 | */ |
217 | */ |
218 | void thread_destroy(thread_t *t) |
218 | void thread_destroy(thread_t *t) |
219 | { |
219 | { |
220 | ASSERT(t->state == Exiting); |
220 | ASSERT(t->state == Exiting); |
221 | ASSERT(t->task); |
221 | ASSERT(t->task); |
222 | ASSERT(t->cpu); |
222 | ASSERT(t->cpu); |
223 | 223 | ||
224 | spinlock_lock(&t->cpu->lock); |
224 | spinlock_lock(&t->cpu->lock); |
225 | if(t->cpu->fpu_owner==t) |
225 | if(t->cpu->fpu_owner==t) |
226 | t->cpu->fpu_owner=NULL; |
226 | t->cpu->fpu_owner=NULL; |
227 | spinlock_unlock(&t->cpu->lock); |
227 | spinlock_unlock(&t->cpu->lock); |
228 | 228 | ||
229 | /* |
229 | /* |
230 | * Detach from the containing task. |
230 | * Detach from the containing task. |
231 | */ |
231 | */ |
232 | spinlock_lock(&t->task->lock); |
232 | spinlock_lock(&t->task->lock); |
233 | list_remove(&t->th_link); |
233 | list_remove(&t->th_link); |
234 | spinlock_unlock(&t->task->lock); |
234 | spinlock_unlock(&t->task->lock); |
235 | 235 | ||
236 | spinlock_unlock(&t->lock); |
236 | spinlock_unlock(&t->lock); |
237 | 237 | ||
238 | spinlock_lock(&threads_lock); |
238 | spinlock_lock(&threads_lock); |
239 | btree_remove(&threads_btree, (__native) t, NULL); |
239 | btree_remove(&threads_btree, (btree_key_t) ((__address ) t), NULL); |
240 | spinlock_unlock(&threads_lock); |
240 | spinlock_unlock(&threads_lock); |
241 | 241 | ||
242 | slab_free(thread_slab, t); |
242 | slab_free(thread_slab, t); |
243 | } |
243 | } |
244 | 244 | ||
245 | /** Create new thread |
245 | /** Create new thread |
246 | * |
246 | * |
247 | * Create a new thread. |
247 | * Create a new thread. |
248 | * |
248 | * |
249 | * @param func Thread's implementing function. |
249 | * @param func Thread's implementing function. |
250 | * @param arg Thread's implementing function argument. |
250 | * @param arg Thread's implementing function argument. |
251 | * @param task Task to which the thread belongs. |
251 | * @param task Task to which the thread belongs. |
252 | * @param flags Thread flags. |
252 | * @param flags Thread flags. |
253 | * @param name Symbolic name. |
253 | * @param name Symbolic name. |
254 | * |
254 | * |
255 | * @return New thread's structure on success, NULL on failure. |
255 | * @return New thread's structure on success, NULL on failure. |
256 | * |
256 | * |
257 | */ |
257 | */ |
258 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags, char *name) |
258 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags, char *name) |
259 | { |
259 | { |
260 | thread_t *t; |
260 | thread_t *t; |
261 | ipl_t ipl; |
261 | ipl_t ipl; |
262 | 262 | ||
263 | t = (thread_t *) slab_alloc(thread_slab, 0); |
263 | t = (thread_t *) slab_alloc(thread_slab, 0); |
264 | if (!t) |
264 | if (!t) |
265 | return NULL; |
265 | return NULL; |
266 | 266 | ||
267 | thread_create_arch(t); |
267 | thread_create_arch(t); |
268 | 268 | ||
269 | /* Not needed, but good for debugging */ |
269 | /* Not needed, but good for debugging */ |
270 | memsetb((__address)t->kstack, THREAD_STACK_SIZE * 1<<STACK_FRAMES, 0); |
270 | memsetb((__address)t->kstack, THREAD_STACK_SIZE * 1<<STACK_FRAMES, 0); |
271 | 271 | ||
272 | ipl = interrupts_disable(); |
272 | ipl = interrupts_disable(); |
273 | spinlock_lock(&tidlock); |
273 | spinlock_lock(&tidlock); |
274 | t->tid = ++last_tid; |
274 | t->tid = ++last_tid; |
275 | spinlock_unlock(&tidlock); |
275 | spinlock_unlock(&tidlock); |
276 | interrupts_restore(ipl); |
276 | interrupts_restore(ipl); |
277 | 277 | ||
278 | context_save(&t->saved_context); |
278 | context_save(&t->saved_context); |
279 | context_set(&t->saved_context, FADDR(cushion), (__address) t->kstack, THREAD_STACK_SIZE); |
279 | context_set(&t->saved_context, FADDR(cushion), (__address) t->kstack, THREAD_STACK_SIZE); |
280 | 280 | ||
281 | the_initialize((the_t *) t->kstack); |
281 | the_initialize((the_t *) t->kstack); |
282 | 282 | ||
283 | ipl = interrupts_disable(); |
283 | ipl = interrupts_disable(); |
284 | t->saved_context.ipl = interrupts_read(); |
284 | t->saved_context.ipl = interrupts_read(); |
285 | interrupts_restore(ipl); |
285 | interrupts_restore(ipl); |
286 | 286 | ||
287 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
287 | memcpy(t->name, name, THREAD_NAME_BUFLEN); |
288 | 288 | ||
289 | t->thread_code = func; |
289 | t->thread_code = func; |
290 | t->thread_arg = arg; |
290 | t->thread_arg = arg; |
291 | t->ticks = -1; |
291 | t->ticks = -1; |
292 | t->priority = -1; /* start in rq[0] */ |
292 | t->priority = -1; /* start in rq[0] */ |
293 | t->cpu = NULL; |
293 | t->cpu = NULL; |
294 | t->flags = 0; |
294 | t->flags = 0; |
295 | t->state = Entering; |
295 | t->state = Entering; |
296 | t->call_me = NULL; |
296 | t->call_me = NULL; |
297 | t->call_me_with = NULL; |
297 | t->call_me_with = NULL; |
298 | 298 | ||
299 | timeout_initialize(&t->sleep_timeout); |
299 | timeout_initialize(&t->sleep_timeout); |
300 | t->sleep_queue = NULL; |
300 | t->sleep_queue = NULL; |
301 | t->timeout_pending = 0; |
301 | t->timeout_pending = 0; |
302 | 302 | ||
303 | t->rwlock_holder_type = RWLOCK_NONE; |
303 | t->rwlock_holder_type = RWLOCK_NONE; |
304 | 304 | ||
305 | t->task = task; |
305 | t->task = task; |
306 | 306 | ||
307 | t->fpu_context_exists = 0; |
307 | t->fpu_context_exists = 0; |
308 | t->fpu_context_engaged = 0; |
308 | t->fpu_context_engaged = 0; |
309 | 309 | ||
310 | /* |
310 | /* |
311 | * Register this thread in the system-wide list. |
311 | * Register this thread in the system-wide list. |
312 | */ |
312 | */ |
313 | ipl = interrupts_disable(); |
313 | ipl = interrupts_disable(); |
314 | spinlock_lock(&threads_lock); |
314 | spinlock_lock(&threads_lock); |
315 | btree_insert(&threads_btree, (__native) t, (void *) t, NULL); |
315 | btree_insert(&threads_btree, (btree_key_t) ((__address) t), (void *) t, NULL); |
316 | spinlock_unlock(&threads_lock); |
316 | spinlock_unlock(&threads_lock); |
317 | 317 | ||
318 | /* |
318 | /* |
319 | * Attach to the containing task. |
319 | * Attach to the containing task. |
320 | */ |
320 | */ |
321 | spinlock_lock(&task->lock); |
321 | spinlock_lock(&task->lock); |
322 | list_append(&t->th_link, &task->th_head); |
322 | list_append(&t->th_link, &task->th_head); |
323 | spinlock_unlock(&task->lock); |
323 | spinlock_unlock(&task->lock); |
324 | 324 | ||
325 | interrupts_restore(ipl); |
325 | interrupts_restore(ipl); |
326 | 326 | ||
327 | return t; |
327 | return t; |
328 | } |
328 | } |
329 | 329 | ||
330 | /** Make thread exiting |
330 | /** Make thread exiting |
331 | * |
331 | * |
332 | * End current thread execution and switch it to the exiting |
332 | * End current thread execution and switch it to the exiting |
333 | * state. All pending timeouts are executed. |
333 | * state. All pending timeouts are executed. |
334 | * |
334 | * |
335 | */ |
335 | */ |
336 | void thread_exit(void) |
336 | void thread_exit(void) |
337 | { |
337 | { |
338 | ipl_t ipl; |
338 | ipl_t ipl; |
339 | 339 | ||
340 | restart: |
340 | restart: |
341 | ipl = interrupts_disable(); |
341 | ipl = interrupts_disable(); |
342 | spinlock_lock(&THREAD->lock); |
342 | spinlock_lock(&THREAD->lock); |
343 | if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */ |
343 | if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */ |
344 | spinlock_unlock(&THREAD->lock); |
344 | spinlock_unlock(&THREAD->lock); |
345 | interrupts_restore(ipl); |
345 | interrupts_restore(ipl); |
346 | goto restart; |
346 | goto restart; |
347 | } |
347 | } |
348 | THREAD->state = Exiting; |
348 | THREAD->state = Exiting; |
349 | spinlock_unlock(&THREAD->lock); |
349 | spinlock_unlock(&THREAD->lock); |
350 | scheduler(); |
350 | scheduler(); |
351 | } |
351 | } |
352 | 352 | ||
353 | 353 | ||
354 | /** Thread sleep |
354 | /** Thread sleep |
355 | * |
355 | * |
356 | * Suspend execution of the current thread. |
356 | * Suspend execution of the current thread. |
357 | * |
357 | * |
358 | * @param sec Number of seconds to sleep. |
358 | * @param sec Number of seconds to sleep. |
359 | * |
359 | * |
360 | */ |
360 | */ |
361 | void thread_sleep(__u32 sec) |
361 | void thread_sleep(__u32 sec) |
362 | { |
362 | { |
363 | thread_usleep(sec*1000000); |
363 | thread_usleep(sec*1000000); |
364 | } |
364 | } |
365 | 365 | ||
366 | /** Thread usleep |
366 | /** Thread usleep |
367 | * |
367 | * |
368 | * Suspend execution of the current thread. |
368 | * Suspend execution of the current thread. |
369 | * |
369 | * |
370 | * @param usec Number of microseconds to sleep. |
370 | * @param usec Number of microseconds to sleep. |
371 | * |
371 | * |
372 | */ |
372 | */ |
373 | void thread_usleep(__u32 usec) |
373 | void thread_usleep(__u32 usec) |
374 | { |
374 | { |
375 | waitq_t wq; |
375 | waitq_t wq; |
376 | 376 | ||
377 | waitq_initialize(&wq); |
377 | waitq_initialize(&wq); |
378 | 378 | ||
379 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING); |
379 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING); |
380 | } |
380 | } |
381 | 381 | ||
382 | /** Register thread out-of-context invocation |
382 | /** Register thread out-of-context invocation |
383 | * |
383 | * |
384 | * Register a function and its argument to be executed |
384 | * Register a function and its argument to be executed |
385 | * on next context switch to the current thread. |
385 | * on next context switch to the current thread. |
386 | * |
386 | * |
387 | * @param call_me Out-of-context function. |
387 | * @param call_me Out-of-context function. |
388 | * @param call_me_with Out-of-context function argument. |
388 | * @param call_me_with Out-of-context function argument. |
389 | * |
389 | * |
390 | */ |
390 | */ |
391 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
391 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
392 | { |
392 | { |
393 | ipl_t ipl; |
393 | ipl_t ipl; |
394 | 394 | ||
395 | ipl = interrupts_disable(); |
395 | ipl = interrupts_disable(); |
396 | spinlock_lock(&THREAD->lock); |
396 | spinlock_lock(&THREAD->lock); |
397 | THREAD->call_me = call_me; |
397 | THREAD->call_me = call_me; |
398 | THREAD->call_me_with = call_me_with; |
398 | THREAD->call_me_with = call_me_with; |
399 | spinlock_unlock(&THREAD->lock); |
399 | spinlock_unlock(&THREAD->lock); |
400 | interrupts_restore(ipl); |
400 | interrupts_restore(ipl); |
401 | } |
401 | } |
402 | 402 | ||
403 | /** Print list of threads debug info */ |
403 | /** Print list of threads debug info */ |
404 | void thread_print_list(void) |
404 | void thread_print_list(void) |
405 | { |
405 | { |
406 | link_t *cur; |
406 | link_t *cur; |
407 | ipl_t ipl; |
407 | ipl_t ipl; |
408 | 408 | ||
409 | /* Messing with thread structures, avoid deadlock */ |
409 | /* Messing with thread structures, avoid deadlock */ |
410 | ipl = interrupts_disable(); |
410 | ipl = interrupts_disable(); |
411 | spinlock_lock(&threads_lock); |
411 | spinlock_lock(&threads_lock); |
412 | 412 | ||
413 | for (cur = threads_btree.leaf_head.next; cur != &threads_btree.leaf_head; cur = cur->next) { |
413 | for (cur = threads_btree.leaf_head.next; cur != &threads_btree.leaf_head; cur = cur->next) { |
414 | btree_node_t *node; |
414 | btree_node_t *node; |
415 | int i; |
415 | int i; |
416 | 416 | ||
417 | node = list_get_instance(cur, btree_node_t, leaf_link); |
417 | node = list_get_instance(cur, btree_node_t, leaf_link); |
418 | for (i = 0; i < node->keys; i++) { |
418 | for (i = 0; i < node->keys; i++) { |
419 | thread_t *t; |
419 | thread_t *t; |
420 | 420 | ||
421 | t = (thread_t *) node->value[i]; |
421 | t = (thread_t *) node->value[i]; |
422 | printf("%s: address=%P, tid=%d, state=%s, task=%P, code=%P, stack=%P, cpu=", |
422 | printf("%s: address=%P, tid=%d, state=%s, task=%P, code=%P, stack=%P, cpu=", |
423 | t->name, t, t->tid, thread_states[t->state], t->task, t->thread_code, t->kstack); |
423 | t->name, t, t->tid, thread_states[t->state], t->task, t->thread_code, t->kstack); |
424 | if (t->cpu) |
424 | if (t->cpu) |
425 | printf("cpu%d ", t->cpu->id); |
425 | printf("cpu%d ", t->cpu->id); |
426 | else |
426 | else |
427 | printf("none"); |
427 | printf("none"); |
428 | printf("\n"); |
428 | printf("\n"); |
429 | } |
429 | } |
430 | } |
430 | } |
431 | 431 | ||
432 | spinlock_unlock(&threads_lock); |
432 | spinlock_unlock(&threads_lock); |
433 | interrupts_restore(ipl); |
433 | interrupts_restore(ipl); |
434 | } |
434 | } |
435 | 435 | ||
436 | /** Check whether thread exists. |
436 | /** Check whether thread exists. |
437 | * |
437 | * |
438 | * Note that threads_lock must be already held and |
438 | * Note that threads_lock must be already held and |
439 | * interrupts must be already disabled. |
439 | * interrupts must be already disabled. |
440 | * |
440 | * |
441 | * @param t Pointer to thread. |
441 | * @param t Pointer to thread. |
442 | * |
442 | * |
443 | * @return True if thread t is known to the system, false otherwise. |
443 | * @return True if thread t is known to the system, false otherwise. |
444 | */ |
444 | */ |
445 | bool thread_exists(thread_t *t) |
445 | bool thread_exists(thread_t *t) |
446 | { |
446 | { |
447 | btree_node_t *leaf; |
447 | btree_node_t *leaf; |
448 | 448 | ||
449 | return btree_search(&threads_btree, (__native) t, &leaf) != NULL; |
449 | return btree_search(&threads_btree, (btree_key_t) ((__address) t), &leaf) != NULL; |
450 | } |
450 | } |
451 | 451 | ||
452 | /** Process syscall to create new thread. |
452 | /** Process syscall to create new thread. |
453 | * |
453 | * |
454 | */ |
454 | */ |
455 | __native sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name) |
455 | __native sys_thread_create(uspace_arg_t *uspace_uarg, char *uspace_name) |
456 | { |
456 | { |
457 | thread_t *t; |
457 | thread_t *t; |
458 | char namebuf[THREAD_NAME_BUFLEN]; |
458 | char namebuf[THREAD_NAME_BUFLEN]; |
459 | uspace_arg_t *kernel_uarg; |
459 | uspace_arg_t *kernel_uarg; |
460 | __u32 tid; |
460 | __u32 tid; |
461 | 461 | ||
462 | copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
462 | copy_from_uspace(namebuf, uspace_name, THREAD_NAME_BUFLEN); |
463 | 463 | ||
464 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
464 | kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0); |
465 | copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
465 | copy_from_uspace(kernel_uarg, uspace_uarg, sizeof(uspace_arg_t)); |
466 | 466 | ||
467 | if ((t = thread_create(uinit, kernel_uarg, TASK, 0, namebuf))) { |
467 | if ((t = thread_create(uinit, kernel_uarg, TASK, 0, namebuf))) { |
468 | tid = t->tid; |
468 | tid = t->tid; |
469 | thread_ready(t); |
469 | thread_ready(t); |
470 | return (__native) tid; |
470 | return (__native) tid; |
471 | } else { |
471 | } else { |
472 | free(kernel_uarg); |
472 | free(kernel_uarg); |
473 | } |
473 | } |
474 | 474 | ||
475 | return (__native) -1; |
475 | return (__native) -1; |
476 | } |
476 | } |
477 | 477 | ||
478 | /** Process syscall to terminate thread. |
478 | /** Process syscall to terminate thread. |
479 | * |
479 | * |
480 | */ |
480 | */ |
481 | __native sys_thread_exit(int uspace_status) |
481 | __native sys_thread_exit(int uspace_status) |
482 | { |
482 | { |
483 | thread_exit(); |
483 | thread_exit(); |
484 | /* Unreachable */ |
484 | /* Unreachable */ |
485 | return 0; |
485 | return 0; |
486 | } |
486 | } |
487 | 487 |