Rev 7 | Rev 10 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 7 | Rev 8 | ||
---|---|---|---|
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 | 49 | ||
50 | #ifdef __SMP__ |
50 | #ifdef __SMP__ |
51 | #include <arch/interrupt.h> |
51 | #include <arch/interrupt.h> |
52 | #include <arch/apic.h> |
52 | #include <arch/apic.h> |
53 | #endif /* __SMP__ */ |
53 | #endif /* __SMP__ */ |
54 | 54 | ||
55 | char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; |
55 | char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; |
56 | 56 | ||
57 | spinlock_t threads_lock; |
57 | spinlock_t threads_lock; |
58 | link_t threads_head; |
58 | link_t threads_head; |
59 | 59 | ||
60 | static spinlock_t tidlock; |
60 | static spinlock_t tidlock; |
61 | __u32 last_tid = 0; |
61 | __u32 last_tid = 0; |
62 | 62 | ||
63 | /* |
63 | /* |
64 | * cushion() is provided to ensure that every thread |
64 | * cushion() is provided to ensure that every thread |
65 | * makes a call to thread_exit() when its implementing |
65 | * makes a call to thread_exit() when its implementing |
66 | * function returns. |
66 | * function returns. |
67 | * |
67 | * |
68 | * cpu_priority_high()'d |
68 | * cpu_priority_high()'d |
69 | */ |
69 | */ |
70 | void cushion(void) |
70 | void cushion(void) |
71 | { |
71 | { |
72 | void (*f)(void *) = the->thread->thread_code; |
72 | void (*f)(void *) = the->thread->thread_code; |
73 | void *arg = the->thread->thread_arg; |
73 | void *arg = the->thread->thread_arg; |
74 | 74 | ||
75 | /* this is where each thread wakes up after its creation */ |
75 | /* this is where each thread wakes up after its creation */ |
76 | spinlock_unlock(&the->thread->lock); |
76 | spinlock_unlock(&the->thread->lock); |
77 | cpu_priority_low(); |
77 | cpu_priority_low(); |
78 | 78 | ||
79 | f(arg); |
79 | f(arg); |
80 | thread_exit(); |
80 | thread_exit(); |
81 | /* not reached */ |
81 | /* not reached */ |
82 | } |
82 | } |
83 | 83 | ||
84 | void thread_init(void) |
84 | void thread_init(void) |
85 | { |
85 | { |
86 | the->thread = NULL; |
86 | the->thread = NULL; |
87 | nrdy = 0; |
87 | nrdy = 0; |
88 | spinlock_initialize(&threads_lock); |
88 | spinlock_initialize(&threads_lock); |
89 | list_initialize(&threads_head); |
89 | list_initialize(&threads_head); |
90 | } |
90 | } |
91 | 91 | ||
92 | void thread_ready(thread_t *t) |
92 | void thread_ready(thread_t *t) |
93 | { |
93 | { |
94 | cpu_t *cpu; |
94 | cpu_t *cpu; |
95 | runq_t *r; |
95 | runq_t *r; |
96 | pri_t pri; |
96 | pri_t pri; |
97 | int i, avg, send_ipi = 0; |
97 | int i, avg, send_ipi = 0; |
98 | 98 | ||
99 | pri = cpu_priority_high(); |
99 | pri = cpu_priority_high(); |
100 | 100 | ||
101 | spinlock_lock(&t->lock); |
101 | spinlock_lock(&t->lock); |
102 | 102 | ||
103 | i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri; |
103 | i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri; |
104 | 104 | ||
105 | cpu = the->cpu; |
105 | cpu = the->cpu; |
106 | if (t->flags & X_WIRED) { |
106 | if (t->flags & X_WIRED) { |
107 | cpu = t->cpu; |
107 | cpu = t->cpu; |
108 | } |
108 | } |
109 | spinlock_unlock(&t->lock); |
109 | spinlock_unlock(&t->lock); |
110 | 110 | ||
111 | /* |
111 | /* |
112 | * Append t to respective ready queue on respective processor. |
112 | * Append t to respective ready queue on respective processor. |
113 | */ |
113 | */ |
114 | r = &cpu->rq[i]; |
114 | r = &cpu->rq[i]; |
115 | spinlock_lock(&r->lock); |
115 | spinlock_lock(&r->lock); |
116 | list_append(&t->rq_link, &r->rq_head); |
116 | list_append(&t->rq_link, &r->rq_head); |
117 | r->n++; |
117 | r->n++; |
118 | spinlock_unlock(&r->lock); |
118 | spinlock_unlock(&r->lock); |
119 | 119 | ||
120 | spinlock_lock(&nrdylock); |
120 | spinlock_lock(&nrdylock); |
121 | avg = ++nrdy / config.cpu_active; |
121 | avg = ++nrdy / config.cpu_active; |
122 | spinlock_unlock(&nrdylock); |
122 | spinlock_unlock(&nrdylock); |
123 | 123 | ||
124 | spinlock_lock(&cpu->lock); |
124 | spinlock_lock(&cpu->lock); |
125 | if ((++cpu->nrdy) > avg && (config.cpu_active == config.cpu_count)) { |
125 | if ((++cpu->nrdy) > avg && (config.cpu_active == config.cpu_count)) { |
126 | /* |
126 | /* |
127 | * If there are idle halted CPU's, this will wake them up. |
127 | * If there are idle halted CPU's, this will wake them up. |
128 | */ |
128 | */ |
129 | #ifdef __SMP__ |
129 | #ifdef __SMP__ |
130 | l_apic_broadcast_custom_ipi(VECTOR_WAKEUP_IPI); |
130 | ipi_broadcast(VECTOR_WAKEUP_IPI); |
131 | #endif /* __SMP__ */ |
131 | #endif /* __SMP__ */ |
132 | } |
132 | } |
133 | spinlock_unlock(&cpu->lock); |
133 | spinlock_unlock(&cpu->lock); |
134 | 134 | ||
135 | cpu_priority_restore(pri); |
135 | cpu_priority_restore(pri); |
136 | } |
136 | } |
137 | 137 | ||
138 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags) |
138 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags) |
139 | { |
139 | { |
140 | thread_t *t; |
140 | thread_t *t; |
141 | __address frame_ks, frame_us = NULL; |
141 | __address frame_ks, frame_us = NULL; |
142 | 142 | ||
143 | t = (thread_t *) malloc(sizeof(thread_t)); |
143 | t = (thread_t *) malloc(sizeof(thread_t)); |
144 | if (t) { |
144 | if (t) { |
145 | pri_t pri; |
145 | pri_t pri; |
146 | 146 | ||
147 | spinlock_initialize(&t->lock); |
147 | spinlock_initialize(&t->lock); |
148 | 148 | ||
149 | frame_ks = frame_alloc(FRAME_KA); |
149 | frame_ks = frame_alloc(FRAME_KA); |
150 | if (THREAD_USER_STACK & flags) { |
150 | if (THREAD_USER_STACK & flags) { |
151 | frame_us = frame_alloc(0); |
151 | frame_us = frame_alloc(0); |
152 | } |
152 | } |
153 | 153 | ||
154 | pri = cpu_priority_high(); |
154 | pri = cpu_priority_high(); |
155 | spinlock_lock(&tidlock); |
155 | spinlock_lock(&tidlock); |
156 | t->tid = ++last_tid; |
156 | t->tid = ++last_tid; |
157 | spinlock_unlock(&tidlock); |
157 | spinlock_unlock(&tidlock); |
158 | cpu_priority_restore(pri); |
158 | cpu_priority_restore(pri); |
159 | 159 | ||
160 | memsetb(frame_ks, THREAD_STACK_SIZE, 0); |
160 | memsetb(frame_ks, THREAD_STACK_SIZE, 0); |
161 | link_initialize(&t->rq_link); |
161 | link_initialize(&t->rq_link); |
162 | link_initialize(&t->wq_link); |
162 | link_initialize(&t->wq_link); |
163 | link_initialize(&t->th_link); |
163 | link_initialize(&t->th_link); |
164 | link_initialize(&t->threads_link); |
164 | link_initialize(&t->threads_link); |
165 | t->kstack = (__u8 *) frame_ks; |
165 | t->kstack = (__u8 *) frame_ks; |
166 | t->ustack = (__u8 *) frame_us; |
166 | t->ustack = (__u8 *) frame_us; |
167 | 167 | ||
168 | 168 | ||
169 | context_save(&t->saved_context); |
169 | context_save(&t->saved_context); |
170 | t->saved_context.pc = (__address) cushion; |
170 | t->saved_context.pc = (__address) cushion; |
171 | t->saved_context.sp = (__address) &t->kstack[THREAD_STACK_SIZE-8]; |
171 | t->saved_context.sp = (__address) &t->kstack[THREAD_STACK_SIZE-8]; |
172 | 172 | ||
173 | pri = cpu_priority_high(); |
173 | pri = cpu_priority_high(); |
174 | t->saved_context.pri = cpu_priority_read(); |
174 | t->saved_context.pri = cpu_priority_read(); |
175 | cpu_priority_restore(pri); |
175 | cpu_priority_restore(pri); |
176 | 176 | ||
177 | t->thread_code = func; |
177 | t->thread_code = func; |
178 | t->thread_arg = arg; |
178 | t->thread_arg = arg; |
179 | t->ticks = -1; |
179 | t->ticks = -1; |
180 | t->pri = -1; /* start in rq[0] */ |
180 | t->pri = -1; /* start in rq[0] */ |
181 | t->cpu = NULL; |
181 | t->cpu = NULL; |
182 | t->flags = 0; |
182 | t->flags = 0; |
183 | t->state = Entering; |
183 | t->state = Entering; |
184 | t->call_me = NULL; |
184 | t->call_me = NULL; |
185 | t->call_me_with = NULL; |
185 | t->call_me_with = NULL; |
186 | 186 | ||
187 | timeout_initialize(&t->sleep_timeout); |
187 | timeout_initialize(&t->sleep_timeout); |
188 | t->sleep_queue = NULL; |
188 | t->sleep_queue = NULL; |
189 | t->timeout_pending = 0; |
189 | t->timeout_pending = 0; |
190 | 190 | ||
191 | t->rwlock_holder_type = RWLOCK_NONE; |
191 | t->rwlock_holder_type = RWLOCK_NONE; |
192 | 192 | ||
193 | t->task = task; |
193 | t->task = task; |
194 | 194 | ||
195 | /* |
195 | /* |
196 | * Register this thread in the system-wide list. |
196 | * Register this thread in the system-wide list. |
197 | */ |
197 | */ |
198 | pri = cpu_priority_high(); |
198 | pri = cpu_priority_high(); |
199 | spinlock_lock(&threads_lock); |
199 | spinlock_lock(&threads_lock); |
200 | list_append(&t->threads_link, &threads_head); |
200 | list_append(&t->threads_link, &threads_head); |
201 | spinlock_unlock(&threads_lock); |
201 | spinlock_unlock(&threads_lock); |
202 | 202 | ||
203 | /* |
203 | /* |
204 | * Attach to the containing task. |
204 | * Attach to the containing task. |
205 | */ |
205 | */ |
206 | spinlock_lock(&task->lock); |
206 | spinlock_lock(&task->lock); |
207 | list_append(&t->th_link, &task->th_head); |
207 | list_append(&t->th_link, &task->th_head); |
208 | spinlock_unlock(&task->lock); |
208 | spinlock_unlock(&task->lock); |
209 | 209 | ||
210 | cpu_priority_restore(pri); |
210 | cpu_priority_restore(pri); |
211 | } |
211 | } |
212 | 212 | ||
213 | return t; |
213 | return t; |
214 | } |
214 | } |
215 | 215 | ||
216 | void thread_exit(void) |
216 | void thread_exit(void) |
217 | { |
217 | { |
218 | pri_t pri; |
218 | pri_t pri; |
219 | 219 | ||
220 | restart: |
220 | restart: |
221 | pri = cpu_priority_high(); |
221 | pri = cpu_priority_high(); |
222 | spinlock_lock(&the->thread->lock); |
222 | spinlock_lock(&the->thread->lock); |
223 | if (the->thread->timeout_pending) { /* busy waiting for timeouts in progress */ |
223 | if (the->thread->timeout_pending) { /* busy waiting for timeouts in progress */ |
224 | spinlock_unlock(&the->thread->lock); |
224 | spinlock_unlock(&the->thread->lock); |
225 | cpu_priority_restore(pri); |
225 | cpu_priority_restore(pri); |
226 | goto restart; |
226 | goto restart; |
227 | } |
227 | } |
228 | the->thread->state = Exiting; |
228 | the->thread->state = Exiting; |
229 | spinlock_unlock(&the->thread->lock); |
229 | spinlock_unlock(&the->thread->lock); |
230 | scheduler(); |
230 | scheduler(); |
231 | } |
231 | } |
232 | 232 | ||
233 | void thread_sleep(__u32 sec) |
233 | void thread_sleep(__u32 sec) |
234 | { |
234 | { |
235 | thread_usleep(sec*1000000); |
235 | thread_usleep(sec*1000000); |
236 | } |
236 | } |
237 | 237 | ||
238 | /* |
238 | /* |
239 | * Suspend execution of current thread for usec microseconds. |
239 | * Suspend execution of current thread for usec microseconds. |
240 | */ |
240 | */ |
241 | void thread_usleep(__u32 usec) |
241 | void thread_usleep(__u32 usec) |
242 | { |
242 | { |
243 | waitq_t wq; |
243 | waitq_t wq; |
244 | 244 | ||
245 | waitq_initialize(&wq); |
245 | waitq_initialize(&wq); |
246 | 246 | ||
247 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING); |
247 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING); |
248 | } |
248 | } |
249 | 249 | ||
250 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
250 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
251 | { |
251 | { |
252 | pri_t pri; |
252 | pri_t pri; |
253 | 253 | ||
254 | pri = cpu_priority_high(); |
254 | pri = cpu_priority_high(); |
255 | spinlock_lock(&the->thread->lock); |
255 | spinlock_lock(&the->thread->lock); |
256 | the->thread->call_me = call_me; |
256 | the->thread->call_me = call_me; |
257 | the->thread->call_me_with = call_me_with; |
257 | the->thread->call_me_with = call_me_with; |
258 | spinlock_unlock(&the->thread->lock); |
258 | spinlock_unlock(&the->thread->lock); |
259 | cpu_priority_restore(pri); |
259 | cpu_priority_restore(pri); |
260 | } |
260 | } |
261 | 261 |