Rev 97 | Rev 111 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 97 | Rev 107 | ||
---|---|---|---|
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 <mm/heap.h> |
32 | #include <mm/heap.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 <list.h> |
44 | #include <list.h> |
45 | #include <typedefs.h> |
45 | #include <typedefs.h> |
46 | #include <time/clock.h> |
46 | #include <time/clock.h> |
47 | #include <list.h> |
47 | #include <list.h> |
48 | #include <config.h> |
48 | #include <config.h> |
49 | #include <arch/interrupt.h> |
49 | #include <arch/interrupt.h> |
50 | #include <smp/ipi.h> |
50 | #include <smp/ipi.h> |
51 | #include <arch/faddr.h> |
51 | #include <arch/faddr.h> |
52 | 52 | ||
53 | char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; |
53 | char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /**< Thread states */ |
54 | 54 | ||
55 | spinlock_t threads_lock; |
55 | spinlock_t threads_lock; |
56 | link_t threads_head; |
56 | link_t threads_head; |
57 | 57 | ||
58 | static spinlock_t tidlock; |
58 | static spinlock_t tidlock; |
59 | __u32 last_tid = 0; |
59 | __u32 last_tid = 0; |
60 | 60 | ||
- | 61 | ||
- | 62 | /** Thread wrapper |
|
61 | /* |
63 | * |
62 | * cushion() is provided to ensure that every thread |
64 | * This wrapper is provided to ensure that every thread |
63 | * makes a call to thread_exit() when its implementing |
65 | * makes a call to thread_exit() when its implementing |
64 | * function returns. |
66 | * function returns. |
65 | * |
67 | * |
66 | * cpu_priority_high()'d |
68 | * cpu_priority_high() is assumed. |
- | 69 | * |
|
67 | */ |
70 | */ |
68 | void cushion(void) |
71 | void cushion(void) |
69 | { |
72 | { |
70 | void (*f)(void *) = THREAD->thread_code; |
73 | void (*f)(void *) = THREAD->thread_code; |
71 | void *arg = THREAD->thread_arg; |
74 | void *arg = THREAD->thread_arg; |
72 | 75 | ||
73 | before_thread_runs(); |
76 | before_thread_runs(); |
74 | 77 | ||
75 | /* this is where each thread wakes up after its creation */ |
78 | /* this is where each thread wakes up after its creation */ |
76 | spinlock_unlock(&THREAD->lock); |
79 | spinlock_unlock(&THREAD->lock); |
77 | cpu_priority_low(); |
80 | cpu_priority_low(); |
78 | 81 | ||
79 | f(arg); |
82 | f(arg); |
80 | thread_exit(); |
83 | thread_exit(); |
81 | /* not reached */ |
84 | /* not reached */ |
82 | } |
85 | } |
83 | 86 | ||
- | 87 | ||
- | 88 | /** Initialize threads |
|
- | 89 | * |
|
- | 90 | * Initialize kernel threads support. |
|
- | 91 | * |
|
- | 92 | */ |
|
84 | void thread_init(void) |
93 | void thread_init(void) |
85 | { |
94 | { |
86 | THREAD = NULL; |
95 | THREAD = NULL; |
87 | nrdy = 0; |
96 | nrdy = 0; |
88 | spinlock_initialize(&threads_lock); |
97 | spinlock_initialize(&threads_lock); |
89 | list_initialize(&threads_head); |
98 | list_initialize(&threads_head); |
90 | } |
99 | } |
91 | 100 | ||
- | 101 | ||
- | 102 | /** Make thread ready |
|
- | 103 | * |
|
- | 104 | * Switch thread t to the ready state. |
|
- | 105 | * |
|
- | 106 | * @param t Thread to make ready. |
|
- | 107 | * |
|
- | 108 | */ |
|
92 | void thread_ready(thread_t *t) |
109 | void thread_ready(thread_t *t) |
93 | { |
110 | { |
94 | cpu_t *cpu; |
111 | cpu_t *cpu; |
95 | runq_t *r; |
112 | runq_t *r; |
96 | pri_t pri; |
113 | pri_t pri; |
97 | int i, avg, send_ipi = 0; |
114 | int i, avg, send_ipi = 0; |
98 | 115 | ||
99 | pri = cpu_priority_high(); |
116 | pri = cpu_priority_high(); |
100 | 117 | ||
101 | spinlock_lock(&t->lock); |
118 | spinlock_lock(&t->lock); |
102 | 119 | ||
103 | i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri; |
120 | i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri; |
104 | 121 | ||
105 | cpu = CPU; |
122 | cpu = CPU; |
106 | if (t->flags & X_WIRED) { |
123 | if (t->flags & X_WIRED) { |
107 | cpu = t->cpu; |
124 | cpu = t->cpu; |
108 | } |
125 | } |
109 | spinlock_unlock(&t->lock); |
126 | spinlock_unlock(&t->lock); |
110 | 127 | ||
111 | /* |
128 | /* |
112 | * Append t to respective ready queue on respective processor. |
129 | * Append t to respective ready queue on respective processor. |
113 | */ |
130 | */ |
114 | r = &cpu->rq[i]; |
131 | r = &cpu->rq[i]; |
115 | spinlock_lock(&r->lock); |
132 | spinlock_lock(&r->lock); |
116 | list_append(&t->rq_link, &r->rq_head); |
133 | list_append(&t->rq_link, &r->rq_head); |
117 | r->n++; |
134 | r->n++; |
118 | spinlock_unlock(&r->lock); |
135 | spinlock_unlock(&r->lock); |
119 | 136 | ||
120 | spinlock_lock(&nrdylock); |
137 | spinlock_lock(&nrdylock); |
121 | avg = ++nrdy / config.cpu_active; |
138 | avg = ++nrdy / config.cpu_active; |
122 | spinlock_unlock(&nrdylock); |
139 | spinlock_unlock(&nrdylock); |
123 | 140 | ||
124 | spinlock_lock(&cpu->lock); |
141 | spinlock_lock(&cpu->lock); |
125 | if ((++cpu->nrdy) > avg) { |
142 | if ((++cpu->nrdy) > avg) { |
126 | /* |
143 | /* |
127 | * If there are idle halted CPU's, this will wake them up. |
144 | * If there are idle halted CPU's, this will wake them up. |
128 | */ |
145 | */ |
129 | ipi_broadcast(VECTOR_WAKEUP_IPI); |
146 | ipi_broadcast(VECTOR_WAKEUP_IPI); |
130 | } |
147 | } |
131 | spinlock_unlock(&cpu->lock); |
148 | spinlock_unlock(&cpu->lock); |
132 | 149 | ||
133 | cpu_priority_restore(pri); |
150 | cpu_priority_restore(pri); |
134 | } |
151 | } |
135 | 152 | ||
- | 153 | ||
- | 154 | /** Create new thread |
|
- | 155 | * |
|
- | 156 | * Create a new thread. |
|
- | 157 | * |
|
- | 158 | * @param func Thread's implementing function. |
|
- | 159 | * @param arg Thread's implementing function argument. |
|
- | 160 | * @param task Task to which the thread belongs. |
|
- | 161 | * @param flags Thread flags. |
|
- | 162 | * |
|
- | 163 | * @return New thread's structure on success, NULL on failure. |
|
- | 164 | * |
|
- | 165 | */ |
|
136 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags) |
166 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags) |
137 | { |
167 | { |
138 | thread_t *t; |
168 | thread_t *t; |
139 | __address frame_ks, frame_us = NULL; |
169 | __address frame_ks, frame_us = NULL; |
140 | 170 | ||
141 | t = (thread_t *) malloc(sizeof(thread_t)); |
171 | t = (thread_t *) malloc(sizeof(thread_t)); |
142 | if (t) { |
172 | if (t) { |
143 | pri_t pri; |
173 | pri_t pri; |
144 | 174 | ||
145 | spinlock_initialize(&t->lock); |
175 | spinlock_initialize(&t->lock); |
146 | 176 | ||
147 | frame_ks = frame_alloc(FRAME_KA); |
177 | frame_ks = frame_alloc(FRAME_KA); |
148 | if (THREAD_USER_STACK & flags) { |
178 | if (THREAD_USER_STACK & flags) { |
149 | frame_us = frame_alloc(0); |
179 | frame_us = frame_alloc(0); |
150 | } |
180 | } |
151 | 181 | ||
152 | pri = cpu_priority_high(); |
182 | pri = cpu_priority_high(); |
153 | spinlock_lock(&tidlock); |
183 | spinlock_lock(&tidlock); |
154 | t->tid = ++last_tid; |
184 | t->tid = ++last_tid; |
155 | spinlock_unlock(&tidlock); |
185 | spinlock_unlock(&tidlock); |
156 | cpu_priority_restore(pri); |
186 | cpu_priority_restore(pri); |
157 | 187 | ||
158 | memsetb(frame_ks, THREAD_STACK_SIZE, 0); |
188 | memsetb(frame_ks, THREAD_STACK_SIZE, 0); |
159 | link_initialize(&t->rq_link); |
189 | link_initialize(&t->rq_link); |
160 | link_initialize(&t->wq_link); |
190 | link_initialize(&t->wq_link); |
161 | link_initialize(&t->th_link); |
191 | link_initialize(&t->th_link); |
162 | link_initialize(&t->threads_link); |
192 | link_initialize(&t->threads_link); |
163 | t->kstack = (__u8 *) frame_ks; |
193 | t->kstack = (__u8 *) frame_ks; |
164 | t->ustack = (__u8 *) frame_us; |
194 | t->ustack = (__u8 *) frame_us; |
165 | 195 | ||
166 | 196 | ||
167 | context_save(&t->saved_context); |
197 | context_save(&t->saved_context); |
168 | context_set(&t->saved_context, FADDR(cushion), t->kstack, THREAD_STACK_SIZE); |
198 | context_set(&t->saved_context, FADDR(cushion), t->kstack, THREAD_STACK_SIZE); |
169 | 199 | ||
170 | pri = cpu_priority_high(); |
200 | pri = cpu_priority_high(); |
171 | t->saved_context.pri = cpu_priority_read(); |
201 | t->saved_context.pri = cpu_priority_read(); |
172 | cpu_priority_restore(pri); |
202 | cpu_priority_restore(pri); |
173 | 203 | ||
174 | t->thread_code = func; |
204 | t->thread_code = func; |
175 | t->thread_arg = arg; |
205 | t->thread_arg = arg; |
176 | t->ticks = -1; |
206 | t->ticks = -1; |
177 | t->pri = -1; /* start in rq[0] */ |
207 | t->pri = -1; /* start in rq[0] */ |
178 | t->cpu = NULL; |
208 | t->cpu = NULL; |
179 | t->flags = 0; |
209 | t->flags = 0; |
180 | t->state = Entering; |
210 | t->state = Entering; |
181 | t->call_me = NULL; |
211 | t->call_me = NULL; |
182 | t->call_me_with = NULL; |
212 | t->call_me_with = NULL; |
183 | 213 | ||
184 | timeout_initialize(&t->sleep_timeout); |
214 | timeout_initialize(&t->sleep_timeout); |
185 | t->sleep_queue = NULL; |
215 | t->sleep_queue = NULL; |
186 | t->timeout_pending = 0; |
216 | t->timeout_pending = 0; |
187 | 217 | ||
188 | t->rwlock_holder_type = RWLOCK_NONE; |
218 | t->rwlock_holder_type = RWLOCK_NONE; |
189 | 219 | ||
190 | t->task = task; |
220 | t->task = task; |
191 | 221 | ||
192 | t->fpu_context_exists=0; |
222 | t->fpu_context_exists=0; |
193 | t->fpu_context_engaged=0; |
223 | t->fpu_context_engaged=0; |
194 | 224 | ||
195 | /* |
225 | /* |
196 | * Register this thread in the system-wide list. |
226 | * Register this thread in the system-wide list. |
197 | */ |
227 | */ |
198 | pri = cpu_priority_high(); |
228 | pri = cpu_priority_high(); |
199 | spinlock_lock(&threads_lock); |
229 | spinlock_lock(&threads_lock); |
200 | list_append(&t->threads_link, &threads_head); |
230 | list_append(&t->threads_link, &threads_head); |
201 | spinlock_unlock(&threads_lock); |
231 | spinlock_unlock(&threads_lock); |
202 | 232 | ||
203 | /* |
233 | /* |
204 | * Attach to the containing task. |
234 | * Attach to the containing task. |
205 | */ |
235 | */ |
206 | spinlock_lock(&task->lock); |
236 | spinlock_lock(&task->lock); |
207 | list_append(&t->th_link, &task->th_head); |
237 | list_append(&t->th_link, &task->th_head); |
208 | spinlock_unlock(&task->lock); |
238 | spinlock_unlock(&task->lock); |
209 | 239 | ||
210 | cpu_priority_restore(pri); |
240 | cpu_priority_restore(pri); |
211 | } |
241 | } |
212 | 242 | ||
213 | return t; |
243 | return t; |
214 | } |
244 | } |
215 | 245 | ||
- | 246 | ||
- | 247 | /** Make thread exiting |
|
- | 248 | * |
|
- | 249 | * End current thread execution and switch it to the exiting |
|
- | 250 | * state. All pending timeouts are executed. |
|
- | 251 | * |
|
- | 252 | */ |
|
216 | void thread_exit(void) |
253 | void thread_exit(void) |
217 | { |
254 | { |
218 | pri_t pri; |
255 | pri_t pri; |
219 | 256 | ||
220 | restart: |
257 | restart: |
221 | pri = cpu_priority_high(); |
258 | pri = cpu_priority_high(); |
222 | spinlock_lock(&THREAD->lock); |
259 | spinlock_lock(&THREAD->lock); |
223 | if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */ |
260 | if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */ |
224 | spinlock_unlock(&THREAD->lock); |
261 | spinlock_unlock(&THREAD->lock); |
225 | cpu_priority_restore(pri); |
262 | cpu_priority_restore(pri); |
226 | goto restart; |
263 | goto restart; |
227 | } |
264 | } |
228 | THREAD->state = Exiting; |
265 | THREAD->state = Exiting; |
229 | spinlock_unlock(&THREAD->lock); |
266 | spinlock_unlock(&THREAD->lock); |
230 | scheduler(); |
267 | scheduler(); |
231 | } |
268 | } |
232 | 269 | ||
- | 270 | ||
- | 271 | /** Thread sleep |
|
- | 272 | * |
|
- | 273 | * Suspend execution of the current thread. |
|
- | 274 | * |
|
- | 275 | * @param sec Number of seconds to sleep. |
|
- | 276 | * |
|
- | 277 | */ |
|
233 | void thread_sleep(__u32 sec) |
278 | void thread_sleep(__u32 sec) |
234 | { |
279 | { |
235 | thread_usleep(sec*1000000); |
280 | thread_usleep(sec*1000000); |
236 | } |
281 | } |
237 | 282 | ||
- | 283 | ||
- | 284 | /** Thread usleep |
|
238 | /* |
285 | * |
239 | * Suspend execution of current thread for usec microseconds. |
286 | * Suspend execution of the current thread. |
- | 287 | * |
|
- | 288 | * @param usec Number of microseconds to sleep. |
|
- | 289 | * |
|
240 | */ |
290 | */ |
241 | void thread_usleep(__u32 usec) |
291 | void thread_usleep(__u32 usec) |
242 | { |
292 | { |
243 | waitq_t wq; |
293 | waitq_t wq; |
244 | 294 | ||
245 | waitq_initialize(&wq); |
295 | waitq_initialize(&wq); |
246 | 296 | ||
247 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING); |
297 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING); |
248 | } |
298 | } |
249 | 299 | ||
- | 300 | ||
- | 301 | /** Register thread out-of-context invocation |
|
- | 302 | * |
|
- | 303 | * Register a function and its argument to be executed |
|
- | 304 | * on next context switch to the current thread. |
|
- | 305 | * |
|
- | 306 | * @param call_me Out-of-context function. |
|
- | 307 | * @param call_me_with Out-of-context function argument. |
|
- | 308 | * |
|
- | 309 | */ |
|
250 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
310 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
251 | { |
311 | { |
252 | pri_t pri; |
312 | pri_t pri; |
253 | 313 | ||
254 | pri = cpu_priority_high(); |
314 | pri = cpu_priority_high(); |
255 | spinlock_lock(&THREAD->lock); |
315 | spinlock_lock(&THREAD->lock); |
256 | THREAD->call_me = call_me; |
316 | THREAD->call_me = call_me; |
257 | THREAD->call_me_with = call_me_with; |
317 | THREAD->call_me_with = call_me_with; |
258 | spinlock_unlock(&THREAD->lock); |
318 | spinlock_unlock(&THREAD->lock); |
259 | cpu_priority_restore(pri); |
319 | cpu_priority_restore(pri); |
260 | } |
320 | } |
261 | 321 |