source: mainline/generic/src/synch/waitq.c@ 203dcd45

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 203dcd45 was e3c762cd, checked in by Jakub Jermar <jakub@…>, 20 years ago

Complete implementation of copy_from_uspace() and copy_to_uspace()
for amd64 and ia32. Other architectures still compile and run,
but need to implement their own assembly-only memcpy(), memcpy_from_uspace(),
memcpy_to_uspace() and their failover parts. For these architectures
only dummy implementations are provided.

  • Property mode set to 100644
File size: 9.3 KB
Line 
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/**
30 * @file waitq.c
31 * @brief Wait queue.
32 *
33 * Wait queue is the basic synchronization primitive upon which all
34 * other synchronization primitives build.
35 *
36 * It allows threads to wait for an event in first-come, first-served
37 * fashion. Conditional operation as well as timeouts and interruptions
38 * are supported.
39 */
40
41#include <synch/waitq.h>
42#include <synch/synch.h>
43#include <synch/spinlock.h>
44#include <proc/thread.h>
45#include <proc/scheduler.h>
46#include <arch/asm.h>
47#include <arch/types.h>
48#include <typedefs.h>
49#include <time/timeout.h>
50#include <arch.h>
51#include <context.h>
52#include <adt/list.h>
53
54static void waitq_timeouted_sleep(void *data);
55
56/** Initialize wait queue
57 *
58 * Initialize wait queue.
59 *
60 * @param wq Pointer to wait queue to be initialized.
61 */
62void waitq_initialize(waitq_t *wq)
63{
64 spinlock_initialize(&wq->lock, "waitq_lock");
65 list_initialize(&wq->head);
66 wq->missed_wakeups = 0;
67}
68
69/** Handle timeout during waitq_sleep_timeout() call
70 *
71 * This routine is called when waitq_sleep_timeout() timeouts.
72 * Interrupts are disabled.
73 *
74 * It is supposed to try to remove 'its' thread from the wait queue;
75 * it can eventually fail to achieve this goal when these two events
76 * overlap. In that case it behaves just as though there was no
77 * timeout at all.
78 *
79 * @param data Pointer to the thread that called waitq_sleep_timeout().
80 */
81void waitq_timeouted_sleep(void *data)
82{
83 thread_t *t = (thread_t *) data;
84 waitq_t *wq;
85 bool do_wakeup = false;
86
87 spinlock_lock(&threads_lock);
88 if (!thread_exists(t))
89 goto out;
90
91grab_locks:
92 spinlock_lock(&t->lock);
93 if ((wq = t->sleep_queue)) { /* assignment */
94 if (!spinlock_trylock(&wq->lock)) {
95 spinlock_unlock(&t->lock);
96 goto grab_locks; /* avoid deadlock */
97 }
98
99 list_remove(&t->wq_link);
100 t->saved_context = t->sleep_timeout_context;
101 do_wakeup = true;
102
103 spinlock_unlock(&wq->lock);
104 t->sleep_queue = NULL;
105 }
106
107 t->timeout_pending = false;
108 spinlock_unlock(&t->lock);
109
110 if (do_wakeup)
111 thread_ready(t);
112
113out:
114 spinlock_unlock(&threads_lock);
115}
116
117/** Interrupt sleeping thread.
118 *
119 * This routine attempts to interrupt a thread from its sleep in a waitqueue.
120 * If the thread is not found sleeping, no action is taken.
121 *
122 * @param t Thread to be interrupted.
123 */
124void waitq_interrupt_sleep(thread_t *t)
125{
126 waitq_t *wq;
127 bool do_wakeup = false;
128 ipl_t ipl;
129
130 ipl = interrupts_disable();
131 spinlock_lock(&threads_lock);
132 if (!thread_exists(t))
133 goto out;
134
135grab_locks:
136 spinlock_lock(&t->lock);
137 if ((wq = t->sleep_queue)) { /* assignment */
138 if (!spinlock_trylock(&wq->lock)) {
139 spinlock_unlock(&t->lock);
140 goto grab_locks; /* avoid deadlock */
141 }
142
143 list_remove(&t->wq_link);
144 t->saved_context = t->sleep_interruption_context;
145 do_wakeup = true;
146
147 spinlock_unlock(&wq->lock);
148 t->sleep_queue = NULL;
149 }
150 spinlock_unlock(&t->lock);
151
152 if (do_wakeup)
153 thread_ready(t);
154
155out:
156 spinlock_unlock(&threads_lock);
157 interrupts_restore(ipl);
158}
159
160
161/** Sleep until either wakeup, timeout or interruption occurs
162 *
163 * This is a sleep implementation which allows itself to be
164 * interrupted from the sleep, restoring a failover context.
165 *
166 * Sleepers are organised in FIFO fashion in a structure called wait queue.
167 *
168 * This function is really basic in that other functions as waitq_sleep()
169 * and all the *_timeout() functions use it.
170 *
171 * @param wq Pointer to wait queue.
172 * @param usec Timeout in microseconds.
173 * @param nonblocking Blocking vs. non-blocking operation mode switch.
174 *
175 * If usec is greater than zero, regardless of the value of nonblocking,
176 * the call will not return until either timeout or wakeup comes.
177 *
178 * If usec is zero and @nonblocking is zero (false), the call
179 * will not return until wakeup comes.
180 *
181 * If usec is zero and nonblocking is non-zero (true), the call will
182 * immediately return, reporting either success or failure.
183 *
184 * @return Returns one of: ESYNCH_WOULD_BLOCK, ESYNCH_TIMEOUT,
185 * ESYNCH_OK_ATOMIC, ESYNCH_OK_BLOCKED.
186 *
187 * @li ESYNCH_WOULD_BLOCK means that the sleep failed because at the time
188 * of the call there was no pending wakeup.
189 *
190 * @li ESYNCH_TIMEOUT means that the sleep timed out.
191 *
192 * @li ESYNCH_INTERRUPTED means that somebody interrupted the sleeping thread.
193 *
194 * @li ESYNCH_OK_ATOMIC means that the sleep succeeded and that there was
195 * a pending wakeup at the time of the call. The caller was not put
196 * asleep at all.
197 *
198 * @li ESYNCH_OK_BLOCKED means that the sleep succeeded; the full sleep was
199 * attempted.
200 */
201int waitq_sleep_timeout(waitq_t *wq, __u32 usec, int nonblocking)
202{
203 volatile ipl_t ipl; /* must be live after context_restore() */
204
205
206restart:
207 ipl = interrupts_disable();
208
209 /*
210 * Busy waiting for a delayed timeout.
211 * This is an important fix for the race condition between
212 * a delayed timeout and a next call to waitq_sleep_timeout().
213 * Simply, the thread is not allowed to go to sleep if
214 * there are timeouts in progress.
215 */
216 spinlock_lock(&THREAD->lock);
217 if (THREAD->timeout_pending) {
218 spinlock_unlock(&THREAD->lock);
219 interrupts_restore(ipl);
220 goto restart;
221 }
222 spinlock_unlock(&THREAD->lock);
223
224 spinlock_lock(&wq->lock);
225
226 /* checks whether to go to sleep at all */
227 if (wq->missed_wakeups) {
228 wq->missed_wakeups--;
229 spinlock_unlock(&wq->lock);
230 interrupts_restore(ipl);
231 return ESYNCH_OK_ATOMIC;
232 }
233 else {
234 if (nonblocking && (usec == 0)) {
235 /* return immediatelly instead of going to sleep */
236 spinlock_unlock(&wq->lock);
237 interrupts_restore(ipl);
238 return ESYNCH_WOULD_BLOCK;
239 }
240 }
241
242 /*
243 * Now we are firmly decided to go to sleep.
244 */
245 spinlock_lock(&THREAD->lock);
246
247 /*
248 * Set context that will be restored if the sleep
249 * of this thread is ever interrupted.
250 */
251 if (!context_save(&THREAD->sleep_interruption_context)) {
252 /* Short emulation of scheduler() return code. */
253 spinlock_unlock(&THREAD->lock);
254 interrupts_restore(ipl);
255 return ESYNCH_INTERRUPTED;
256 }
257
258 if (usec) {
259 /* We use the timeout variant. */
260 if (!context_save(&THREAD->sleep_timeout_context)) {
261 /* Short emulation of scheduler() return code. */
262 spinlock_unlock(&THREAD->lock);
263 interrupts_restore(ipl);
264 return ESYNCH_TIMEOUT;
265 }
266 THREAD->timeout_pending = true;
267 timeout_register(&THREAD->sleep_timeout, (__u64) usec, waitq_timeouted_sleep, THREAD);
268 }
269
270 list_append(&THREAD->wq_link, &wq->head);
271
272 /*
273 * Suspend execution.
274 */
275 THREAD->state = Sleeping;
276 THREAD->sleep_queue = wq;
277
278 spinlock_unlock(&THREAD->lock);
279
280 scheduler(); /* wq->lock is released in scheduler_separated_stack() */
281 interrupts_restore(ipl);
282
283 return ESYNCH_OK_BLOCKED;
284}
285
286
287/** Wake up first thread sleeping in a wait queue
288 *
289 * Wake up first thread sleeping in a wait queue.
290 * This is the SMP- and IRQ-safe wrapper meant for
291 * general use.
292 *
293 * Besides its 'normal' wakeup operation, it attempts
294 * to unregister possible timeout.
295 *
296 * @param wq Pointer to wait queue.
297 * @param all If this is non-zero, all sleeping threads
298 * will be woken up and missed count will be zeroed.
299 */
300void waitq_wakeup(waitq_t *wq, bool all)
301{
302 ipl_t ipl;
303
304 ipl = interrupts_disable();
305 spinlock_lock(&wq->lock);
306
307 _waitq_wakeup_unsafe(wq, all);
308
309 spinlock_unlock(&wq->lock);
310 interrupts_restore(ipl);
311}
312
313/** Internal SMP- and IRQ-unsafe version of waitq_wakeup()
314 *
315 * This is the internal SMP- and IRQ-unsafe version
316 * of waitq_wakeup(). It assumes wq->lock is already
317 * locked and interrupts are already disabled.
318 *
319 * @param wq Pointer to wait queue.
320 * @param all If this is non-zero, all sleeping threads
321 * will be woken up and missed count will be zeroed.
322 */
323void _waitq_wakeup_unsafe(waitq_t *wq, bool all)
324{
325 thread_t *t;
326
327loop:
328 if (list_empty(&wq->head)) {
329 wq->missed_wakeups++;
330 if (all)
331 wq->missed_wakeups = 0;
332 return;
333 }
334
335 t = list_get_instance(wq->head.next, thread_t, wq_link);
336
337 list_remove(&t->wq_link);
338 spinlock_lock(&t->lock);
339 if (t->timeout_pending && timeout_unregister(&t->sleep_timeout))
340 t->timeout_pending = false;
341 t->sleep_queue = NULL;
342 spinlock_unlock(&t->lock);
343
344 thread_ready(t);
345
346 if (all)
347 goto loop;
348}
Note: See TracBrowser for help on using the repository browser.