Rev 212 | Rev 214 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 212 | Rev 213 | ||
---|---|---|---|
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 <cpu.h> |
32 | #include <cpu.h> |
33 | #include <mm/vm.h> |
33 | #include <mm/vm.h> |
34 | #include <config.h> |
34 | #include <config.h> |
35 | #include <context.h> |
35 | #include <context.h> |
36 | #include <func.h> |
36 | #include <func.h> |
37 | #include <arch.h> |
37 | #include <arch.h> |
38 | #include <arch/asm.h> |
38 | #include <arch/asm.h> |
39 | #include <list.h> |
39 | #include <list.h> |
40 | #include <panic.h> |
40 | #include <panic.h> |
41 | #include <typedefs.h> |
41 | #include <typedefs.h> |
42 | #include <mm/page.h> |
42 | #include <mm/page.h> |
43 | #include <synch/spinlock.h> |
43 | #include <synch/spinlock.h> |
44 | #include <arch/faddr.h> |
44 | #include <arch/faddr.h> |
45 | #include <arch/atomic.h> |
45 | #include <arch/atomic.h> |
46 | #include <print.h> |
46 | #include <print.h> |
47 | #include <mm/frame.h> |
47 | #include <mm/frame.h> |
48 | #include <mm/heap.h> |
48 | #include <mm/heap.h> |
49 | 49 | ||
50 | 50 | ||
51 | volatile int nrdy; |
51 | volatile int nrdy; |
52 | 52 | ||
53 | 53 | ||
54 | /** Take actions before new thread runs |
54 | /** Take actions before new thread runs |
55 | * |
55 | * |
56 | * Perform actions that need to be |
56 | * Perform actions that need to be |
57 | * taken before the newly selected |
57 | * taken before the newly selected |
58 | * tread is passed control. |
58 | * tread is passed control. |
59 | * |
59 | * |
60 | */ |
60 | */ |
61 | void before_thread_runs(void) |
61 | void before_thread_runs(void) |
62 | { |
62 | { |
63 | before_thread_runs_arch(); |
63 | before_thread_runs_arch(); |
64 | fpu_context_restore(&(THREAD->saved_fpu_context)); |
64 | fpu_context_restore(&(THREAD->saved_fpu_context)); |
65 | } |
65 | } |
66 | 66 | ||
67 | 67 | ||
68 | /** Initialize scheduler |
68 | /** Initialize scheduler |
69 | * |
69 | * |
70 | * Initialize kernel scheduler. |
70 | * Initialize kernel scheduler. |
71 | * |
71 | * |
72 | */ |
72 | */ |
73 | void scheduler_init(void) |
73 | void scheduler_init(void) |
74 | { |
74 | { |
75 | } |
75 | } |
76 | 76 | ||
77 | 77 | ||
78 | /** Get thread to be scheduled |
78 | /** Get thread to be scheduled |
79 | * |
79 | * |
80 | * Get the optimal thread to be scheduled |
80 | * Get the optimal thread to be scheduled |
81 | * according to thread accounting and scheduler |
81 | * according to thread accounting and scheduler |
82 | * policy. |
82 | * policy. |
83 | * |
83 | * |
84 | * @return Thread to be scheduled. |
84 | * @return Thread to be scheduled. |
85 | * |
85 | * |
86 | */ |
86 | */ |
87 | struct thread *find_best_thread(void) |
87 | struct thread *find_best_thread(void) |
88 | { |
88 | { |
89 | thread_t *t; |
89 | thread_t *t; |
90 | runq_t *r; |
90 | runq_t *r; |
91 | int i, n; |
91 | int i, n; |
92 | 92 | ||
93 | loop: |
93 | loop: |
94 | cpu_priority_high(); |
94 | cpu_priority_high(); |
95 | 95 | ||
96 | spinlock_lock(&CPU->lock); |
96 | spinlock_lock(&CPU->lock); |
97 | n = CPU->nrdy; |
97 | n = CPU->nrdy; |
98 | spinlock_unlock(&CPU->lock); |
98 | spinlock_unlock(&CPU->lock); |
99 | 99 | ||
100 | cpu_priority_low(); |
100 | cpu_priority_low(); |
101 | 101 | ||
102 | if (n == 0) { |
102 | if (n == 0) { |
103 | #ifdef __SMP__ |
103 | #ifdef __SMP__ |
104 | /* |
104 | /* |
105 | * If the load balancing thread is not running, wake it up and |
105 | * If the load balancing thread is not running, wake it up and |
106 | * set CPU-private flag that the kcpulb has been started. |
106 | * set CPU-private flag that the kcpulb has been started. |
107 | */ |
107 | */ |
108 | if (test_and_set(&CPU->kcpulbstarted) == 0) { |
108 | if (test_and_set(&CPU->kcpulbstarted) == 0) { |
109 | waitq_wakeup(&CPU->kcpulb_wq, 0); |
109 | waitq_wakeup(&CPU->kcpulb_wq, 0); |
110 | goto loop; |
110 | goto loop; |
111 | } |
111 | } |
112 | #endif /* __SMP__ */ |
112 | #endif /* __SMP__ */ |
113 | 113 | ||
114 | /* |
114 | /* |
115 | * For there was nothing to run, the CPU goes to sleep |
115 | * For there was nothing to run, the CPU goes to sleep |
116 | * until a hardware interrupt or an IPI comes. |
116 | * until a hardware interrupt or an IPI comes. |
117 | * This improves energy saving and hyperthreading. |
117 | * This improves energy saving and hyperthreading. |
118 | * On the other hand, several hardware interrupts can be ignored. |
118 | * On the other hand, several hardware interrupts can be ignored. |
119 | */ |
119 | */ |
120 | cpu_sleep(); |
120 | cpu_sleep(); |
121 | goto loop; |
121 | goto loop; |
122 | } |
122 | } |
123 | 123 | ||
124 | cpu_priority_high(); |
124 | cpu_priority_high(); |
125 | 125 | ||
126 | i = 0; |
126 | i = 0; |
127 | retry: |
127 | retry: |
128 | for (; i<RQ_COUNT; i++) { |
128 | for (; i<RQ_COUNT; i++) { |
129 | r = &CPU->rq[i]; |
129 | r = &CPU->rq[i]; |
130 | spinlock_lock(&r->lock); |
130 | spinlock_lock(&r->lock); |
131 | if (r->n == 0) { |
131 | if (r->n == 0) { |
132 | /* |
132 | /* |
133 | * If this queue is empty, try a lower-priority queue. |
133 | * If this queue is empty, try a lower-priority queue. |
134 | */ |
134 | */ |
135 | spinlock_unlock(&r->lock); |
135 | spinlock_unlock(&r->lock); |
136 | continue; |
136 | continue; |
137 | } |
137 | } |
138 | 138 | ||
139 | /* avoid deadlock with relink_rq() */ |
139 | /* avoid deadlock with relink_rq() */ |
140 | if (!spinlock_trylock(&CPU->lock)) { |
140 | if (!spinlock_trylock(&CPU->lock)) { |
141 | /* |
141 | /* |
142 | * Unlock r and try again. |
142 | * Unlock r and try again. |
143 | */ |
143 | */ |
144 | spinlock_unlock(&r->lock); |
144 | spinlock_unlock(&r->lock); |
145 | goto retry; |
145 | goto retry; |
146 | } |
146 | } |
147 | CPU->nrdy--; |
147 | CPU->nrdy--; |
148 | spinlock_unlock(&CPU->lock); |
148 | spinlock_unlock(&CPU->lock); |
149 | 149 | ||
150 | atomic_dec(&nrdy); |
150 | atomic_dec(&nrdy); |
151 | r->n--; |
151 | r->n--; |
152 | 152 | ||
153 | /* |
153 | /* |
154 | * Take the first thread from the queue. |
154 | * Take the first thread from the queue. |
155 | */ |
155 | */ |
156 | t = list_get_instance(r->rq_head.next, thread_t, rq_link); |
156 | t = list_get_instance(r->rq_head.next, thread_t, rq_link); |
157 | list_remove(&t->rq_link); |
157 | list_remove(&t->rq_link); |
158 | 158 | ||
159 | spinlock_unlock(&r->lock); |
159 | spinlock_unlock(&r->lock); |
160 | 160 | ||
161 | spinlock_lock(&t->lock); |
161 | spinlock_lock(&t->lock); |
162 | t->cpu = CPU; |
162 | t->cpu = CPU; |
163 | 163 | ||
164 | t->ticks = us2ticks((i+1)*10000); |
164 | t->ticks = us2ticks((i+1)*10000); |
165 | t->pri = i; /* eventually correct rq index */ |
165 | t->pri = i; /* eventually correct rq index */ |
166 | 166 | ||
167 | /* |
167 | /* |
168 | * Clear the X_STOLEN flag so that t can be migrated when load balancing needs emerge. |
168 | * Clear the X_STOLEN flag so that t can be migrated when load balancing needs emerge. |
169 | */ |
169 | */ |
170 | t->flags &= ~X_STOLEN; |
170 | t->flags &= ~X_STOLEN; |
171 | spinlock_unlock(&t->lock); |
171 | spinlock_unlock(&t->lock); |
172 | 172 | ||
173 | return t; |
173 | return t; |
174 | } |
174 | } |
175 | goto loop; |
175 | goto loop; |
176 | 176 | ||
177 | } |
177 | } |
178 | 178 | ||
179 | 179 | ||
180 | /** Prevent rq starvation |
180 | /** Prevent rq starvation |
181 | * |
181 | * |
182 | * Prevent low priority threads from starving in rq's. |
182 | * Prevent low priority threads from starving in rq's. |
183 | * |
183 | * |
184 | * When the function decides to relink rq's, it reconnects |
184 | * When the function decides to relink rq's, it reconnects |
185 | * respective pointers so that in result threads with 'pri' |
185 | * respective pointers so that in result threads with 'pri' |
186 | * greater or equal 'start' are moved to a higher-priority queue. |
186 | * greater or equal 'start' are moved to a higher-priority queue. |
187 | * |
187 | * |
188 | * @param start Threshold priority. |
188 | * @param start Threshold priority. |
189 | * |
189 | * |
190 | */ |
190 | */ |
191 | void relink_rq(int start) |
191 | void relink_rq(int start) |
192 | { |
192 | { |
193 | link_t head; |
193 | link_t head; |
194 | runq_t *r; |
194 | runq_t *r; |
195 | int i, n; |
195 | int i, n; |
196 | 196 | ||
197 | list_initialize(&head); |
197 | list_initialize(&head); |
198 | spinlock_lock(&CPU->lock); |
198 | spinlock_lock(&CPU->lock); |
199 | if (CPU->needs_relink > NEEDS_RELINK_MAX) { |
199 | if (CPU->needs_relink > NEEDS_RELINK_MAX) { |
200 | for (i = start; i<RQ_COUNT-1; i++) { |
200 | for (i = start; i<RQ_COUNT-1; i++) { |
201 | /* remember and empty rq[i + 1] */ |
201 | /* remember and empty rq[i + 1] */ |
202 | r = &CPU->rq[i + 1]; |
202 | r = &CPU->rq[i + 1]; |
203 | spinlock_lock(&r->lock); |
203 | spinlock_lock(&r->lock); |
204 | list_concat(&head, &r->rq_head); |
204 | list_concat(&head, &r->rq_head); |
205 | n = r->n; |
205 | n = r->n; |
206 | r->n = 0; |
206 | r->n = 0; |
207 | spinlock_unlock(&r->lock); |
207 | spinlock_unlock(&r->lock); |
208 | 208 | ||
209 | /* append rq[i + 1] to rq[i] */ |
209 | /* append rq[i + 1] to rq[i] */ |
210 | r = &CPU->rq[i]; |
210 | r = &CPU->rq[i]; |
211 | spinlock_lock(&r->lock); |
211 | spinlock_lock(&r->lock); |
212 | list_concat(&r->rq_head, &head); |
212 | list_concat(&r->rq_head, &head); |
213 | r->n += n; |
213 | r->n += n; |
214 | spinlock_unlock(&r->lock); |
214 | spinlock_unlock(&r->lock); |
215 | } |
215 | } |
216 | CPU->needs_relink = 0; |
216 | CPU->needs_relink = 0; |
217 | } |
217 | } |
218 | spinlock_unlock(&CPU->lock); |
218 | spinlock_unlock(&CPU->lock); |
219 | 219 | ||
220 | } |
220 | } |
221 | 221 | ||
222 | 222 | ||
223 | /** The scheduler |
223 | /** The scheduler |
224 | * |
224 | * |
225 | * The thread scheduling procedure. |
225 | * The thread scheduling procedure. |
226 | * |
226 | * |
227 | */ |
227 | */ |
228 | void scheduler(void) |
228 | void scheduler(void) |
229 | { |
229 | { |
230 | volatile pri_t pri; |
230 | volatile pri_t pri; |
231 | 231 | ||
232 | pri = cpu_priority_high(); |
232 | pri = cpu_priority_high(); |
233 | 233 | ||
234 | if (haltstate) |
234 | if (haltstate) |
235 | halt(); |
235 | halt(); |
236 | 236 | ||
237 | if (THREAD) { |
237 | if (THREAD) { |
238 | spinlock_lock(&THREAD->lock); |
238 | spinlock_lock(&THREAD->lock); |
239 | fpu_context_save(&(THREAD->saved_fpu_context)); |
239 | fpu_context_save(&(THREAD->saved_fpu_context)); |
240 | if (!context_save(&THREAD->saved_context)) { |
240 | if (!context_save(&THREAD->saved_context)) { |
241 | /* |
241 | /* |
242 | * This is the place where threads leave scheduler(); |
242 | * This is the place where threads leave scheduler(); |
243 | */ |
243 | */ |
244 | before_thread_runs(); |
244 | before_thread_runs(); |
245 | spinlock_unlock(&THREAD->lock); |
245 | spinlock_unlock(&THREAD->lock); |
246 | cpu_priority_restore(THREAD->saved_context.pri); |
246 | cpu_priority_restore(THREAD->saved_context.pri); |
247 | return; |
247 | return; |
248 | } |
248 | } |
249 | 249 | ||
250 | /* |
250 | /* |
251 | * CPU priority of preempted thread is recorded here |
251 | * CPU priority of preempted thread is recorded here |
252 | * to facilitate scheduler() invocations from |
252 | * to facilitate scheduler() invocations from |
253 | * cpu_priority_high()'ed code (e.g. waitq_sleep_timeout()). |
253 | * cpu_priority_high()'ed code (e.g. waitq_sleep_timeout()). |
254 | */ |
254 | */ |
255 | THREAD->saved_context.pri = pri; |
255 | THREAD->saved_context.pri = pri; |
256 | } |
256 | } |
257 | 257 | ||
258 | /* |
258 | /* |
259 | * Through the 'THE' structure, we keep track of THREAD, TASK, CPU |
259 | * Through the 'THE' structure, we keep track of THREAD, TASK, CPU |
260 | * and preemption counter. At this point THE could be coming either |
260 | * and preemption counter. At this point THE could be coming either |
261 | * from THREAD's or CPU's stack. |
261 | * from THREAD's or CPU's stack. |
262 | */ |
262 | */ |
263 | the_copy(THE, (the_t *) CPU->stack); |
263 | the_copy(THE, (the_t *) CPU->stack); |
264 | 264 | ||
265 | /* |
265 | /* |
266 | * We may not keep the old stack. |
266 | * We may not keep the old stack. |
267 | * Reason: If we kept the old stack and got blocked, for instance, in |
267 | * Reason: If we kept the old stack and got blocked, for instance, in |
268 | * find_best_thread(), the old thread could get rescheduled by another |
268 | * find_best_thread(), the old thread could get rescheduled by another |
269 | * CPU and overwrite the part of its own stack that was also used by |
269 | * CPU and overwrite the part of its own stack that was also used by |
270 | * the scheduler on this CPU. |
270 | * the scheduler on this CPU. |
271 | * |
271 | * |
272 | * Moreover, we have to bypass the compiler-generated POP sequence |
272 | * Moreover, we have to bypass the compiler-generated POP sequence |
273 | * which is fooled by SP being set to the very top of the stack. |
273 | * which is fooled by SP being set to the very top of the stack. |
274 | * Therefore the scheduler() function continues in |
274 | * Therefore the scheduler() function continues in |
275 | * scheduler_separated_stack(). |
275 | * scheduler_separated_stack(). |
276 | */ |
276 | */ |
277 | context_save(&CPU->saved_context); |
277 | context_save(&CPU->saved_context); |
278 | context_set(&CPU->saved_context, FADDR(scheduler_separated_stack), CPU->stack, CPU_STACK_SIZE); |
278 | context_set(&CPU->saved_context, FADDR(scheduler_separated_stack), CPU->stack, CPU_STACK_SIZE); |
279 | context_restore(&CPU->saved_context); |
279 | context_restore(&CPU->saved_context); |
280 | /* not reached */ |
280 | /* not reached */ |
281 | } |
281 | } |
282 | 282 | ||
283 | 283 | ||
284 | /** Scheduler stack switch wrapper |
284 | /** Scheduler stack switch wrapper |
285 | * |
285 | * |
286 | * Second part of the scheduler() function |
286 | * Second part of the scheduler() function |
287 | * using new stack. Handling the actual context |
287 | * using new stack. Handling the actual context |
288 | * switch to a new thread. |
288 | * switch to a new thread. |
289 | * |
289 | * |
290 | */ |
290 | */ |
291 | void scheduler_separated_stack(void) |
291 | void scheduler_separated_stack(void) |
292 | { |
292 | { |
293 | int priority; |
293 | int priority; |
294 | 294 | ||
295 | if (THREAD) { |
295 | if (THREAD) { |
296 | switch (THREAD->state) { |
296 | switch (THREAD->state) { |
297 | case Running: |
297 | case Running: |
298 | THREAD->state = Ready; |
298 | THREAD->state = Ready; |
299 | spinlock_unlock(&THREAD->lock); |
299 | spinlock_unlock(&THREAD->lock); |
300 | thread_ready(THREAD); |
300 | thread_ready(THREAD); |
301 | break; |
301 | break; |
302 | 302 | ||
303 | case Exiting: |
303 | case Exiting: |
304 | frame_free((__address) THREAD->kstack); |
304 | frame_free((__address) THREAD->kstack); |
305 | if (THREAD->ustack) { |
305 | if (THREAD->ustack) { |
306 | frame_free((__address) THREAD->ustack); |
306 | frame_free((__address) THREAD->ustack); |
307 | } |
307 | } |
308 | 308 | ||
309 | /* |
309 | /* |
310 | * Detach from the containing task. |
310 | * Detach from the containing task. |
311 | */ |
311 | */ |
312 | spinlock_lock(&TASK->lock); |
312 | spinlock_lock(&TASK->lock); |
313 | list_remove(&THREAD->th_link); |
313 | list_remove(&THREAD->th_link); |
314 | spinlock_unlock(&TASK->lock); |
314 | spinlock_unlock(&TASK->lock); |
315 | 315 | ||
316 | spinlock_unlock(&THREAD->lock); |
316 | spinlock_unlock(&THREAD->lock); |
317 | 317 | ||
318 | spinlock_lock(&threads_lock); |
318 | spinlock_lock(&threads_lock); |
319 | list_remove(&THREAD->threads_link); |
319 | list_remove(&THREAD->threads_link); |
320 | spinlock_unlock(&threads_lock); |
320 | spinlock_unlock(&threads_lock); |
321 | 321 | ||
322 | spinlock_lock(&CPU->lock); |
322 | spinlock_lock(&CPU->lock); |
323 | if(CPU->fpu_owner==THREAD) CPU->fpu_owner=NULL; |
323 | if(CPU->fpu_owner==THREAD) CPU->fpu_owner=NULL; |
324 | spinlock_unlock(&CPU->lock); |
324 | spinlock_unlock(&CPU->lock); |
325 | 325 | ||
326 | free(THREAD); |
326 | free(THREAD); |
327 | 327 | ||
328 | break; |
328 | break; |
329 | 329 | ||
330 | case Sleeping: |
330 | case Sleeping: |
331 | /* |
331 | /* |
332 | * Prefer the thread after it's woken up. |
332 | * Prefer the thread after it's woken up. |
333 | */ |
333 | */ |
334 | THREAD->pri = -1; |
334 | THREAD->pri = -1; |
335 | 335 | ||
336 | /* |
336 | /* |
337 | * We need to release wq->lock which we locked in waitq_sleep(). |
337 | * We need to release wq->lock which we locked in waitq_sleep(). |
338 | * Address of wq->lock is kept in THREAD->sleep_queue. |
338 | * Address of wq->lock is kept in THREAD->sleep_queue. |
339 | */ |
339 | */ |
340 | spinlock_unlock(&THREAD->sleep_queue->lock); |
340 | spinlock_unlock(&THREAD->sleep_queue->lock); |
341 | 341 | ||
342 | /* |
342 | /* |
343 | * Check for possible requests for out-of-context invocation. |
343 | * Check for possible requests for out-of-context invocation. |
344 | */ |
344 | */ |
345 | if (THREAD->call_me) { |
345 | if (THREAD->call_me) { |
346 | THREAD->call_me(THREAD->call_me_with); |
346 | THREAD->call_me(THREAD->call_me_with); |
347 | THREAD->call_me = NULL; |
347 | THREAD->call_me = NULL; |
348 | THREAD->call_me_with = NULL; |
348 | THREAD->call_me_with = NULL; |
349 | } |
349 | } |
350 | 350 | ||
351 | spinlock_unlock(&THREAD->lock); |
351 | spinlock_unlock(&THREAD->lock); |
352 | 352 | ||
353 | break; |
353 | break; |
354 | 354 | ||
355 | default: |
355 | default: |
356 | /* |
356 | /* |
357 | * Entering state is unexpected. |
357 | * Entering state is unexpected. |
358 | */ |
358 | */ |
359 | panic("tid%d: unexpected state %s\n", THREAD->tid, thread_states[THREAD->state]); |
359 | panic("tid%d: unexpected state %s\n", THREAD->tid, thread_states[THREAD->state]); |
360 | break; |
360 | break; |
361 | } |
361 | } |
362 | THREAD = NULL; |
362 | THREAD = NULL; |
363 | } |
363 | } |
364 | 364 | ||
365 | printf("Ahoj"); |
365 | printf("Ahoj"); |
366 | THREAD = find_best_thread(); |
366 | THREAD = find_best_thread(); |
367 | // putchar('@'); |
367 | // putchar('@'); |
368 | printf("Lidi"); |
368 | printf("Lidi"); |
369 | // printf("*1*"); |
369 | // printf("*1*"); |
370 | 370 | ||
371 | spinlock_lock(&THREAD->lock); |
371 | spinlock_lock(&THREAD->lock); |
372 | priority = THREAD->pri; |
372 | priority = THREAD->pri; |
373 | spinlock_unlock(&THREAD->lock); |
373 | spinlock_unlock(&THREAD->lock); |
374 | 374 | ||
375 | relink_rq(priority); |
375 | relink_rq(priority); |
376 | 376 | ||
377 | spinlock_lock(&THREAD->lock); |
377 | spinlock_lock(&THREAD->lock); |
378 | 378 | ||
379 | /* |
379 | /* |
380 | * If both the old and the new task are the same, lots of work is avoided. |
380 | * If both the old and the new task are the same, lots of work is avoided. |
381 | */ |
381 | */ |
382 | if (TASK != THREAD->task) { |
382 | if (TASK != THREAD->task) { |
383 | vm_t *m1 = NULL; |
383 | vm_t *m1 = NULL; |
384 | vm_t *m2; |
384 | vm_t *m2; |
385 | 385 | ||
386 | if (TASK) { |
386 | if (TASK) { |
387 | spinlock_lock(&TASK->lock); |
387 | spinlock_lock(&TASK->lock); |
388 | m1 = TASK->vm; |
388 | m1 = TASK->vm; |
389 | spinlock_unlock(&TASK->lock); |
389 | spinlock_unlock(&TASK->lock); |
390 | } |
390 | } |
391 | 391 | ||
392 | spinlock_lock(&THREAD->task->lock); |
392 | spinlock_lock(&THREAD->task->lock); |
393 | m2 = THREAD->task->vm; |
393 | m2 = THREAD->task->vm; |
394 | spinlock_unlock(&THREAD->task->lock); |
394 | spinlock_unlock(&THREAD->task->lock); |
395 | 395 | ||
396 | /* |
396 | /* |
397 | * Note that it is possible for two tasks to share one vm mapping. |
397 | * Note that it is possible for two tasks to share one vm mapping. |
398 | */ |
398 | */ |
399 | if (m1 != m2) { |
399 | if (m1 != m2) { |
400 | /* |
400 | /* |
401 | * Both tasks and vm mappings are different. |
401 | * Both tasks and vm mappings are different. |
402 | * Replace the old one with the new one. |
402 | * Replace the old one with the new one. |
403 | */ |
403 | */ |
404 | vm_install(m2); |
404 | vm_install(m2); |
405 | } |
405 | } |
406 | TASK = THREAD->task; |
406 | TASK = THREAD->task; |
407 | } |
407 | } |
408 | 408 | ||
409 | THREAD->state = Running; |
409 | THREAD->state = Running; |
410 | 410 | ||
411 | #ifdef SCHEDULER_VERBOSE |
411 | #ifdef SCHEDULER_VERBOSE |
412 | printf("cpu%d: tid %d (pri=%d,ticks=%d,nrdy=%d)\n", CPU->id, THREAD->tid, THREAD->pri, THREAD->ticks, CPU->nrdy); |
412 | printf("cpu%d: tid %d (pri=%d,ticks=%d,nrdy=%d)\n", CPU->id, THREAD->tid, THREAD->pri, THREAD->ticks, CPU->nrdy); |
413 | #endif |
413 | #endif |
414 | 414 | ||
- | 415 | /* |
|
- | 416 | * Copy the knowledge of CPU, TASK, THREAD and preemption counter to thread's stack. |
|
- | 417 | */ |
|
415 | the_copy(THE, (the_t *) THREAD->kstack); |
418 | the_copy(THE, (the_t *) THREAD->kstack); |
416 | 419 | ||
417 | context_restore(&THREAD->saved_context); |
420 | context_restore(&THREAD->saved_context); |
418 | /* not reached */ |
421 | /* not reached */ |
419 | } |
422 | } |
420 | 423 | ||
421 | 424 | ||
422 | #ifdef __SMP__ |
425 | #ifdef __SMP__ |
423 | /** Load balancing thread |
426 | /** Load balancing thread |
424 | * |
427 | * |
425 | * SMP load balancing thread, supervising thread supplies |
428 | * SMP load balancing thread, supervising thread supplies |
426 | * for the CPU it's wired to. |
429 | * for the CPU it's wired to. |
427 | * |
430 | * |
428 | * @param arg Generic thread argument (unused). |
431 | * @param arg Generic thread argument (unused). |
429 | * |
432 | * |
430 | */ |
433 | */ |
431 | void kcpulb(void *arg) |
434 | void kcpulb(void *arg) |
432 | { |
435 | { |
433 | thread_t *t; |
436 | thread_t *t; |
434 | int count, i, j, k = 0; |
437 | int count, i, j, k = 0; |
435 | pri_t pri; |
438 | pri_t pri; |
436 | 439 | ||
437 | loop: |
440 | loop: |
438 | /* |
441 | /* |
439 | * Sleep until there's some work to do. |
442 | * Sleep until there's some work to do. |
440 | */ |
443 | */ |
441 | waitq_sleep(&CPU->kcpulb_wq); |
444 | waitq_sleep(&CPU->kcpulb_wq); |
442 | 445 | ||
443 | not_satisfied: |
446 | not_satisfied: |
444 | /* |
447 | /* |
445 | * Calculate the number of threads that will be migrated/stolen from |
448 | * Calculate the number of threads that will be migrated/stolen from |
446 | * other CPU's. Note that situation can have changed between two |
449 | * other CPU's. Note that situation can have changed between two |
447 | * passes. Each time get the most up to date counts. |
450 | * passes. Each time get the most up to date counts. |
448 | */ |
451 | */ |
449 | pri = cpu_priority_high(); |
452 | pri = cpu_priority_high(); |
450 | spinlock_lock(&CPU->lock); |
453 | spinlock_lock(&CPU->lock); |
451 | count = nrdy / config.cpu_active; |
454 | count = nrdy / config.cpu_active; |
452 | count -= CPU->nrdy; |
455 | count -= CPU->nrdy; |
453 | spinlock_unlock(&CPU->lock); |
456 | spinlock_unlock(&CPU->lock); |
454 | cpu_priority_restore(pri); |
457 | cpu_priority_restore(pri); |
455 | 458 | ||
456 | if (count <= 0) |
459 | if (count <= 0) |
457 | goto satisfied; |
460 | goto satisfied; |
458 | 461 | ||
459 | /* |
462 | /* |
460 | * Searching least priority queues on all CPU's first and most priority queues on all CPU's last. |
463 | * Searching least priority queues on all CPU's first and most priority queues on all CPU's last. |
461 | */ |
464 | */ |
462 | for (j=RQ_COUNT-1; j >= 0; j--) { |
465 | for (j=RQ_COUNT-1; j >= 0; j--) { |
463 | for (i=0; i < config.cpu_active; i++) { |
466 | for (i=0; i < config.cpu_active; i++) { |
464 | link_t *l; |
467 | link_t *l; |
465 | runq_t *r; |
468 | runq_t *r; |
466 | cpu_t *cpu; |
469 | cpu_t *cpu; |
467 | 470 | ||
468 | cpu = &cpus[(i + k) % config.cpu_active]; |
471 | cpu = &cpus[(i + k) % config.cpu_active]; |
469 | 472 | ||
470 | /* |
473 | /* |
471 | * Not interested in ourselves. |
474 | * Not interested in ourselves. |
472 | * Doesn't require interrupt disabling for kcpulb is X_WIRED. |
475 | * Doesn't require interrupt disabling for kcpulb is X_WIRED. |
473 | */ |
476 | */ |
474 | if (CPU == cpu) |
477 | if (CPU == cpu) |
475 | continue; |
478 | continue; |
476 | 479 | ||
477 | restart: pri = cpu_priority_high(); |
480 | restart: pri = cpu_priority_high(); |
478 | r = &cpu->rq[j]; |
481 | r = &cpu->rq[j]; |
479 | spinlock_lock(&r->lock); |
482 | spinlock_lock(&r->lock); |
480 | if (r->n == 0) { |
483 | if (r->n == 0) { |
481 | spinlock_unlock(&r->lock); |
484 | spinlock_unlock(&r->lock); |
482 | cpu_priority_restore(pri); |
485 | cpu_priority_restore(pri); |
483 | continue; |
486 | continue; |
484 | } |
487 | } |
485 | 488 | ||
486 | t = NULL; |
489 | t = NULL; |
487 | l = r->rq_head.prev; /* search rq from the back */ |
490 | l = r->rq_head.prev; /* search rq from the back */ |
488 | while (l != &r->rq_head) { |
491 | while (l != &r->rq_head) { |
489 | t = list_get_instance(l, thread_t, rq_link); |
492 | t = list_get_instance(l, thread_t, rq_link); |
490 | /* |
493 | /* |
491 | * We don't want to steal CPU-wired threads neither threads already stolen. |
494 | * We don't want to steal CPU-wired threads neither threads already stolen. |
492 | * The latter prevents threads from migrating between CPU's without ever being run. |
495 | * The latter prevents threads from migrating between CPU's without ever being run. |
493 | * We don't want to steal threads whose FPU context is still in CPU. |
496 | * We don't want to steal threads whose FPU context is still in CPU. |
494 | */ |
497 | */ |
495 | spinlock_lock(&t->lock); |
498 | spinlock_lock(&t->lock); |
496 | if ( (!(t->flags & (X_WIRED | X_STOLEN))) && (!(t->fpu_context_engaged)) ) { |
499 | if ( (!(t->flags & (X_WIRED | X_STOLEN))) && (!(t->fpu_context_engaged)) ) { |
497 | 500 | ||
498 | /* |
501 | /* |
499 | * Remove t from r. |
502 | * Remove t from r. |
500 | */ |
503 | */ |
501 | 504 | ||
502 | spinlock_unlock(&t->lock); |
505 | spinlock_unlock(&t->lock); |
503 | 506 | ||
504 | /* |
507 | /* |
505 | * Here we have to avoid deadlock with relink_rq(), |
508 | * Here we have to avoid deadlock with relink_rq(), |
506 | * because it locks cpu and r in a different order than we do. |
509 | * because it locks cpu and r in a different order than we do. |
507 | */ |
510 | */ |
508 | if (!spinlock_trylock(&cpu->lock)) { |
511 | if (!spinlock_trylock(&cpu->lock)) { |
509 | /* Release all locks and try again. */ |
512 | /* Release all locks and try again. */ |
510 | spinlock_unlock(&r->lock); |
513 | spinlock_unlock(&r->lock); |
511 | cpu_priority_restore(pri); |
514 | cpu_priority_restore(pri); |
512 | goto restart; |
515 | goto restart; |
513 | } |
516 | } |
514 | cpu->nrdy--; |
517 | cpu->nrdy--; |
515 | spinlock_unlock(&cpu->lock); |
518 | spinlock_unlock(&cpu->lock); |
516 | 519 | ||
517 | atomic_dec(&nrdy); |
520 | atomic_dec(&nrdy); |
518 | 521 | ||
519 | r->n--; |
522 | r->n--; |
520 | list_remove(&t->rq_link); |
523 | list_remove(&t->rq_link); |
521 | 524 | ||
522 | break; |
525 | break; |
523 | } |
526 | } |
524 | spinlock_unlock(&t->lock); |
527 | spinlock_unlock(&t->lock); |
525 | l = l->prev; |
528 | l = l->prev; |
526 | t = NULL; |
529 | t = NULL; |
527 | } |
530 | } |
528 | spinlock_unlock(&r->lock); |
531 | spinlock_unlock(&r->lock); |
529 | 532 | ||
530 | if (t) { |
533 | if (t) { |
531 | /* |
534 | /* |
532 | * Ready t on local CPU |
535 | * Ready t on local CPU |
533 | */ |
536 | */ |
534 | spinlock_lock(&t->lock); |
537 | spinlock_lock(&t->lock); |
535 | #ifdef KCPULB_VERBOSE |
538 | #ifdef KCPULB_VERBOSE |
536 | printf("kcpulb%d: TID %d -> cpu%d, nrdy=%d, avg=%d\n", CPU->id, t->tid, CPU->id, CPU->nrdy, nrdy / config.cpu_active); |
539 | printf("kcpulb%d: TID %d -> cpu%d, nrdy=%d, avg=%d\n", CPU->id, t->tid, CPU->id, CPU->nrdy, nrdy / config.cpu_active); |
537 | #endif |
540 | #endif |
538 | t->flags |= X_STOLEN; |
541 | t->flags |= X_STOLEN; |
539 | spinlock_unlock(&t->lock); |
542 | spinlock_unlock(&t->lock); |
540 | 543 | ||
541 | thread_ready(t); |
544 | thread_ready(t); |
542 | 545 | ||
543 | cpu_priority_restore(pri); |
546 | cpu_priority_restore(pri); |
544 | 547 | ||
545 | if (--count == 0) |
548 | if (--count == 0) |
546 | goto satisfied; |
549 | goto satisfied; |
547 | 550 | ||
548 | /* |
551 | /* |
549 | * We are not satisfied yet, focus on another CPU next time. |
552 | * We are not satisfied yet, focus on another CPU next time. |
550 | */ |
553 | */ |
551 | k++; |
554 | k++; |
552 | 555 | ||
553 | continue; |
556 | continue; |
554 | } |
557 | } |
555 | cpu_priority_restore(pri); |
558 | cpu_priority_restore(pri); |
556 | } |
559 | } |
557 | } |
560 | } |
558 | 561 | ||
559 | if (CPU->nrdy) { |
562 | if (CPU->nrdy) { |
560 | /* |
563 | /* |
561 | * Be a little bit light-weight and let migrated threads run. |
564 | * Be a little bit light-weight and let migrated threads run. |
562 | */ |
565 | */ |
563 | scheduler(); |
566 | scheduler(); |
564 | } |
567 | } |
565 | else { |
568 | else { |
566 | /* |
569 | /* |
567 | * We failed to migrate a single thread. |
570 | * We failed to migrate a single thread. |
568 | * Something more sophisticated should be done. |
571 | * Something more sophisticated should be done. |
569 | */ |
572 | */ |
570 | scheduler(); |
573 | scheduler(); |
571 | } |
574 | } |
572 | 575 | ||
573 | goto not_satisfied; |
576 | goto not_satisfied; |
574 | 577 | ||
575 | satisfied: |
578 | satisfied: |
576 | /* |
579 | /* |
577 | * Tell find_best_thread() to wake us up later again. |
580 | * Tell find_best_thread() to wake us up later again. |
578 | */ |
581 | */ |
579 | CPU->kcpulbstarted = 0; |
582 | CPU->kcpulbstarted = 0; |
580 | goto loop; |
583 | goto loop; |
581 | } |
584 | } |
582 | 585 | ||
583 | #endif /* __SMP__ */ |
586 | #endif /* __SMP__ */ |
584 | 587 |