Rev 7 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | #include <proc/scheduler.h> |
||
30 | #include <proc/thread.h> |
||
31 | #include <proc/task.h> |
||
32 | #include <mm/heap.h> |
||
33 | #include <mm/frame.h> |
||
34 | #include <mm/page.h> |
||
35 | #include <arch/asm.h> |
||
36 | #include <arch.h> |
||
37 | #include <synch/synch.h> |
||
38 | #include <synch/spinlock.h> |
||
39 | #include <synch/waitq.h> |
||
40 | #include <synch/rwlock.h> |
||
41 | #include <cpu.h> |
||
42 | #include <func.h> |
||
43 | #include <context.h> |
||
44 | #include <list.h> |
||
45 | #include <typedefs.h> |
||
46 | #include <time/clock.h> |
||
47 | #include <list.h> |
||
48 | |||
49 | char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; |
||
50 | |||
51 | spinlock_t threads_lock; |
||
52 | link_t threads_head; |
||
53 | |||
54 | static spinlock_t tidlock; |
||
55 | __u32 last_tid = 0; |
||
56 | |||
57 | /* |
||
58 | * cushion() is provided to ensure that every thread |
||
59 | * makes a call to thread_exit() when its implementing |
||
60 | * function returns. |
||
61 | * |
||
62 | * cpu_priority_high()'d |
||
63 | */ |
||
64 | void cushion(void) |
||
65 | { |
||
66 | void (*f)(void *) = the->thread->thread_code; |
||
67 | void *arg = the->thread->thread_arg; |
||
68 | |||
69 | /* this is where each thread wakes up after its creation */ |
||
70 | spinlock_unlock(&the->thread->lock); |
||
71 | cpu_priority_low(); |
||
72 | |||
73 | f(arg); |
||
74 | thread_exit(); |
||
75 | /* not reached */ |
||
76 | } |
||
77 | |||
78 | void thread_init(void) |
||
79 | { |
||
80 | the->thread = NULL; |
||
81 | nrdy = 0; |
||
82 | spinlock_initialize(&threads_lock); |
||
83 | list_initialize(&threads_head); |
||
84 | } |
||
85 | |||
86 | void thread_ready(thread_t *t) |
||
87 | { |
||
88 | cpu_t *cpu; |
||
89 | runq_t *r; |
||
90 | pri_t pri; |
||
91 | int i; |
||
92 | |||
93 | pri = cpu_priority_high(); |
||
94 | |||
95 | spinlock_lock(&t->lock); |
||
96 | |||
97 | i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri; |
||
98 | |||
99 | cpu = the->cpu; |
||
100 | if (t->flags & X_WIRED) { |
||
101 | cpu = t->cpu; |
||
102 | } |
||
103 | spinlock_unlock(&t->lock); |
||
104 | |||
105 | /* |
||
106 | * Append t to respective ready queue on respective processor. |
||
107 | */ |
||
108 | r = &cpu->rq[i]; |
||
109 | spinlock_lock(&r->lock); |
||
110 | list_append(&t->rq_link, &r->rq_head); |
||
111 | r->n++; |
||
112 | spinlock_unlock(&r->lock); |
||
113 | |||
114 | spinlock_lock(&nrdylock); |
||
115 | nrdy++; |
||
116 | spinlock_unlock(&nrdylock); |
||
117 | |||
118 | spinlock_lock(&cpu->lock); |
||
119 | cpu->nrdy++; |
||
120 | spinlock_unlock(&cpu->lock); |
||
121 | |||
122 | cpu_priority_restore(pri); |
||
123 | } |
||
124 | |||
125 | thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags) |
||
126 | { |
||
127 | thread_t *t; |
||
128 | __address frame_ks, frame_us = NULL; |
||
129 | |||
130 | t = (thread_t *) malloc(sizeof(thread_t)); |
||
131 | if (t) { |
||
132 | pri_t pri; |
||
133 | |||
134 | spinlock_initialize(&t->lock); |
||
135 | |||
136 | frame_ks = frame_alloc(FRAME_KA); |
||
137 | if (THREAD_USER_STACK & flags) { |
||
138 | frame_us = frame_alloc(0); |
||
139 | } |
||
140 | |||
141 | pri = cpu_priority_high(); |
||
142 | spinlock_lock(&tidlock); |
||
143 | t->tid = ++last_tid; |
||
144 | spinlock_unlock(&tidlock); |
||
145 | cpu_priority_restore(pri); |
||
146 | |||
147 | memsetb(frame_ks, THREAD_STACK_SIZE, 0); |
||
148 | link_initialize(&t->rq_link); |
||
149 | link_initialize(&t->wq_link); |
||
150 | link_initialize(&t->th_link); |
||
151 | link_initialize(&t->threads_link); |
||
152 | t->kstack = (__u8 *) frame_ks; |
||
153 | t->ustack = (__u8 *) frame_us; |
||
154 | |||
155 | |||
156 | context_save(&t->saved_context); |
||
157 | t->saved_context.pc = (__address) cushion; |
||
158 | t->saved_context.sp = (__address) &t->kstack[THREAD_STACK_SIZE-8]; |
||
159 | |||
160 | pri = cpu_priority_high(); |
||
161 | t->saved_context.pri = cpu_priority_read(); |
||
162 | cpu_priority_restore(pri); |
||
163 | |||
164 | t->thread_code = func; |
||
165 | t->thread_arg = arg; |
||
166 | t->ticks = -1; |
||
167 | t->pri = -1; /* start in rq[0] */ |
||
168 | t->cpu = NULL; |
||
169 | t->flags = 0; |
||
170 | t->state = Entering; |
||
171 | t->call_me = NULL; |
||
172 | t->call_me_with = NULL; |
||
173 | |||
174 | timeout_initialize(&t->sleep_timeout); |
||
175 | t->sleep_queue = NULL; |
||
176 | t->timeout_pending = 0; |
||
177 | |||
178 | t->rwlock_holder_type = RWLOCK_NONE; |
||
179 | |||
180 | t->task = task; |
||
181 | |||
182 | /* |
||
183 | * Register this thread in the system-wide list. |
||
184 | */ |
||
185 | pri = cpu_priority_high(); |
||
186 | spinlock_lock(&threads_lock); |
||
187 | list_append(&t->threads_link, &threads_head); |
||
188 | spinlock_unlock(&threads_lock); |
||
189 | |||
190 | /* |
||
191 | * Attach to the containing task. |
||
192 | */ |
||
193 | spinlock_lock(&task->lock); |
||
194 | list_append(&t->th_link, &task->th_head); |
||
195 | spinlock_unlock(&task->lock); |
||
196 | |||
197 | cpu_priority_restore(pri); |
||
198 | } |
||
199 | |||
200 | return t; |
||
201 | } |
||
202 | |||
203 | void thread_exit(void) |
||
204 | { |
||
205 | pri_t pri; |
||
206 | |||
207 | restart: |
||
208 | pri = cpu_priority_high(); |
||
209 | spinlock_lock(&the->thread->lock); |
||
210 | if (the->thread->timeout_pending) { /* busy waiting for timeouts in progress */ |
||
211 | spinlock_unlock(&the->thread->lock); |
||
212 | cpu_priority_restore(pri); |
||
213 | goto restart; |
||
214 | } |
||
215 | the->thread->state = Exiting; |
||
216 | spinlock_unlock(&the->thread->lock); |
||
217 | scheduler(); |
||
218 | } |
||
219 | |||
220 | void thread_sleep(__u32 sec) |
||
221 | { |
||
222 | thread_usleep(sec*1000000); |
||
223 | } |
||
224 | |||
225 | /* |
||
226 | * Suspend execution of current thread for usec microseconds. |
||
227 | */ |
||
228 | void thread_usleep(__u32 usec) |
||
229 | { |
||
230 | waitq_t wq; |
||
231 | |||
232 | waitq_initialize(&wq); |
||
233 | |||
234 | (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING); |
||
235 | } |
||
236 | |||
237 | void thread_register_call_me(void (* call_me)(void *), void *call_me_with) |
||
238 | { |
||
239 | pri_t pri; |
||
240 | |||
241 | pri = cpu_priority_high(); |
||
242 | spinlock_lock(&the->thread->lock); |
||
243 | the->thread->call_me = call_me; |
||
244 | the->thread->call_me_with = call_me_with; |
||
245 | spinlock_unlock(&the->thread->lock); |
||
246 | cpu_priority_restore(pri); |
||
247 | } |