Rev 1580 | Rev 1681 | Go to most recent revision | Details | Compare with Previous | 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 | |||
| 1248 | jermar | 29 | /** |
| 30 | * @file waitq.c |
||
| 31 | * @brief Wait queue. |
||
| 32 | * |
||
| 1288 | jermar | 33 | * Wait queue is the basic synchronization primitive upon which all |
| 1248 | jermar | 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 | |||
| 382 | jermar | 41 | #include <synch/waitq.h> |
| 1 | jermar | 42 | #include <synch/synch.h> |
| 43 | #include <synch/spinlock.h> |
||
| 382 | jermar | 44 | #include <proc/thread.h> |
| 414 | jermar | 45 | #include <proc/scheduler.h> |
| 1 | jermar | 46 | #include <arch/asm.h> |
| 47 | #include <arch/types.h> |
||
| 557 | jermar | 48 | #include <typedefs.h> |
| 382 | jermar | 49 | #include <time/timeout.h> |
| 1 | jermar | 50 | #include <arch.h> |
| 382 | jermar | 51 | #include <context.h> |
| 788 | jermar | 52 | #include <adt/list.h> |
| 1 | jermar | 53 | |
| 1156 | jermar | 54 | static void waitq_timeouted_sleep(void *data); |
| 55 | |||
| 382 | jermar | 56 | /** Initialize wait queue |
| 57 | * |
||
| 58 | * Initialize wait queue. |
||
| 59 | * |
||
| 60 | * @param wq Pointer to wait queue to be initialized. |
||
| 61 | */ |
||
| 1 | jermar | 62 | void waitq_initialize(waitq_t *wq) |
| 63 | { |
||
| 552 | palkovsky | 64 | spinlock_initialize(&wq->lock, "waitq_lock"); |
| 1 | jermar | 65 | list_initialize(&wq->head); |
| 66 | wq->missed_wakeups = 0; |
||
| 67 | } |
||
| 68 | |||
| 382 | jermar | 69 | /** Handle timeout during waitq_sleep_timeout() call |
| 1 | jermar | 70 | * |
| 382 | jermar | 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(). |
||
| 1 | jermar | 80 | */ |
| 1156 | jermar | 81 | void waitq_timeouted_sleep(void *data) |
| 1 | jermar | 82 | { |
| 83 | thread_t *t = (thread_t *) data; |
||
| 84 | waitq_t *wq; |
||
| 557 | jermar | 85 | bool do_wakeup = false; |
| 1 | jermar | 86 | |
| 87 | spinlock_lock(&threads_lock); |
||
| 1158 | jermar | 88 | if (!thread_exists(t)) |
| 1 | jermar | 89 | goto out; |
| 90 | |||
| 91 | grab_locks: |
||
| 92 | spinlock_lock(&t->lock); |
||
| 615 | palkovsky | 93 | if ((wq = t->sleep_queue)) { /* assignment */ |
| 1 | jermar | 94 | if (!spinlock_trylock(&wq->lock)) { |
| 95 | spinlock_unlock(&t->lock); |
||
| 557 | jermar | 96 | goto grab_locks; /* avoid deadlock */ |
| 1 | jermar | 97 | } |
| 98 | |||
| 99 | list_remove(&t->wq_link); |
||
| 100 | t->saved_context = t->sleep_timeout_context; |
||
| 557 | jermar | 101 | do_wakeup = true; |
| 1 | jermar | 102 | |
| 103 | spinlock_unlock(&wq->lock); |
||
| 104 | t->sleep_queue = NULL; |
||
| 105 | } |
||
| 106 | |||
| 557 | jermar | 107 | t->timeout_pending = false; |
| 1 | jermar | 108 | spinlock_unlock(&t->lock); |
| 109 | |||
| 557 | jermar | 110 | if (do_wakeup) |
| 111 | thread_ready(t); |
||
| 1 | jermar | 112 | |
| 113 | out: |
||
| 114 | spinlock_unlock(&threads_lock); |
||
| 115 | } |
||
| 116 | |||
| 1156 | jermar | 117 | /** Interrupt sleeping thread. |
| 382 | jermar | 118 | * |
| 1156 | jermar | 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 | */ |
||
| 124 | void 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); |
||
| 1158 | jermar | 132 | if (!thread_exists(t)) |
| 1156 | jermar | 133 | goto out; |
| 134 | |||
| 135 | grab_locks: |
||
| 136 | spinlock_lock(&t->lock); |
||
| 137 | if ((wq = t->sleep_queue)) { /* assignment */ |
||
| 1502 | jermar | 138 | if (!(t->sleep_interruptible)) { |
| 139 | /* |
||
| 140 | * The sleep cannot be interrupted. |
||
| 141 | */ |
||
| 142 | spinlock_unlock(&t->lock); |
||
| 143 | goto out; |
||
| 144 | } |
||
| 145 | |||
| 1156 | jermar | 146 | if (!spinlock_trylock(&wq->lock)) { |
| 147 | spinlock_unlock(&t->lock); |
||
| 148 | goto grab_locks; /* avoid deadlock */ |
||
| 149 | } |
||
| 150 | |||
| 1593 | jermar | 151 | if (t->timeout_pending && timeout_unregister(&t->sleep_timeout)) |
| 152 | t->timeout_pending = false; |
||
| 153 | |||
| 1156 | jermar | 154 | list_remove(&t->wq_link); |
| 155 | t->saved_context = t->sleep_interruption_context; |
||
| 156 | do_wakeup = true; |
||
| 157 | |||
| 158 | spinlock_unlock(&wq->lock); |
||
| 159 | t->sleep_queue = NULL; |
||
| 160 | } |
||
| 161 | spinlock_unlock(&t->lock); |
||
| 162 | |||
| 163 | if (do_wakeup) |
||
| 164 | thread_ready(t); |
||
| 165 | |||
| 166 | out: |
||
| 167 | spinlock_unlock(&threads_lock); |
||
| 168 | interrupts_restore(ipl); |
||
| 169 | } |
||
| 170 | |||
| 171 | /** Sleep until either wakeup, timeout or interruption occurs |
||
| 172 | * |
||
| 1502 | jermar | 173 | * This is a sleep implementation which allows itself to time out or to be |
| 1 | jermar | 174 | * interrupted from the sleep, restoring a failover context. |
| 175 | * |
||
| 1375 | jermar | 176 | * Sleepers are organised in a FIFO fashion in a structure called wait queue. |
| 382 | jermar | 177 | * |
| 1 | jermar | 178 | * This function is really basic in that other functions as waitq_sleep() |
| 179 | * and all the *_timeout() functions use it. |
||
| 180 | * |
||
| 382 | jermar | 181 | * @param wq Pointer to wait queue. |
| 404 | jermar | 182 | * @param usec Timeout in microseconds. |
| 1502 | jermar | 183 | * @param flags Specify mode of the sleep. |
| 1 | jermar | 184 | * |
| 1502 | jermar | 185 | * The sleep can be interrupted only if the |
| 186 | * SYNCH_FLAGS_INTERRUPTIBLE bit is specified in flags. |
||
| 187 | |||
| 188 | * If usec is greater than zero, regardless of the value of the |
||
| 189 | * SYNCH_FLAGS_NON_BLOCKING bit in flags, the call will not return until either timeout, |
||
| 190 | * interruption or wakeup comes. |
||
| 382 | jermar | 191 | * |
| 1502 | jermar | 192 | * If usec is zero and the SYNCH_FLAGS_NON_BLOCKING bit is not set in flags, the call |
| 193 | * will not return until wakeup or interruption comes. |
||
| 1 | jermar | 194 | * |
| 1502 | jermar | 195 | * If usec is zero and the SYNCH_FLAGS_NON_BLOCKING bit is set in flags, the call will |
| 404 | jermar | 196 | * immediately return, reporting either success or failure. |
| 197 | * |
||
| 1502 | jermar | 198 | * @return Returns one of: ESYNCH_WOULD_BLOCK, ESYNCH_TIMEOUT, ESYNCH_INTERRUPTED, |
| 1248 | jermar | 199 | * ESYNCH_OK_ATOMIC, ESYNCH_OK_BLOCKED. |
| 382 | jermar | 200 | * |
| 1248 | jermar | 201 | * @li ESYNCH_WOULD_BLOCK means that the sleep failed because at the time |
| 404 | jermar | 202 | * of the call there was no pending wakeup. |
| 382 | jermar | 203 | * |
| 1248 | jermar | 204 | * @li ESYNCH_TIMEOUT means that the sleep timed out. |
| 404 | jermar | 205 | * |
| 1248 | jermar | 206 | * @li ESYNCH_INTERRUPTED means that somebody interrupted the sleeping thread. |
| 1156 | jermar | 207 | * |
| 1248 | jermar | 208 | * @li ESYNCH_OK_ATOMIC means that the sleep succeeded and that there was |
| 404 | jermar | 209 | * a pending wakeup at the time of the call. The caller was not put |
| 210 | * asleep at all. |
||
| 211 | * |
||
| 1248 | jermar | 212 | * @li ESYNCH_OK_BLOCKED means that the sleep succeeded; the full sleep was |
| 404 | jermar | 213 | * attempted. |
| 1 | jermar | 214 | */ |
| 1502 | jermar | 215 | int waitq_sleep_timeout(waitq_t *wq, __u32 usec, int flags) |
| 1 | jermar | 216 | { |
| 1375 | jermar | 217 | ipl_t ipl; |
| 218 | int rc; |
||
| 1 | jermar | 219 | |
| 1375 | jermar | 220 | ipl = waitq_sleep_prepare(wq); |
| 1502 | jermar | 221 | rc = waitq_sleep_timeout_unsafe(wq, usec, flags); |
| 1375 | jermar | 222 | waitq_sleep_finish(wq, rc, ipl); |
| 223 | return rc; |
||
| 224 | } |
||
| 225 | |||
| 226 | /** Prepare to sleep in a waitq. |
||
| 227 | * |
||
| 228 | * This function will return holding the lock of the wait queue |
||
| 229 | * and interrupts disabled. |
||
| 230 | * |
||
| 231 | * @param wq Wait queue. |
||
| 232 | * |
||
| 233 | * @return Interrupt level as it existed on entry to this function. |
||
| 234 | */ |
||
| 235 | ipl_t waitq_sleep_prepare(waitq_t *wq) |
||
| 236 | { |
||
| 237 | ipl_t ipl; |
||
| 1 | jermar | 238 | |
| 239 | restart: |
||
| 413 | jermar | 240 | ipl = interrupts_disable(); |
| 1375 | jermar | 241 | |
| 1467 | jermar | 242 | if (THREAD) { /* needed during system initiailzation */ |
| 243 | /* |
||
| 244 | * Busy waiting for a delayed timeout. |
||
| 245 | * This is an important fix for the race condition between |
||
| 246 | * a delayed timeout and a next call to waitq_sleep_timeout(). |
||
| 247 | * Simply, the thread is not allowed to go to sleep if |
||
| 248 | * there are timeouts in progress. |
||
| 249 | */ |
||
| 250 | spinlock_lock(&THREAD->lock); |
||
| 251 | if (THREAD->timeout_pending) { |
||
| 252 | spinlock_unlock(&THREAD->lock); |
||
| 253 | interrupts_restore(ipl); |
||
| 254 | goto restart; |
||
| 255 | } |
||
| 15 | jermar | 256 | spinlock_unlock(&THREAD->lock); |
| 1 | jermar | 257 | } |
| 1375 | jermar | 258 | |
| 1 | jermar | 259 | spinlock_lock(&wq->lock); |
| 1375 | jermar | 260 | return ipl; |
| 261 | } |
||
| 262 | |||
| 263 | /** Finish waiting in a wait queue. |
||
| 264 | * |
||
| 265 | * This function restores interrupts to the state that existed prior |
||
| 266 | * to the call to waitq_sleep_prepare(). If necessary, the wait queue |
||
| 267 | * lock is released. |
||
| 268 | * |
||
| 269 | * @param wq Wait queue. |
||
| 270 | * @param rc Return code of waitq_sleep_timeout_unsafe(). |
||
| 271 | * @param ipl Interrupt level returned by waitq_sleep_prepare(). |
||
| 272 | */ |
||
| 273 | void waitq_sleep_finish(waitq_t *wq, int rc, ipl_t ipl) |
||
| 274 | { |
||
| 275 | switch (rc) { |
||
| 276 | case ESYNCH_WOULD_BLOCK: |
||
| 277 | case ESYNCH_OK_ATOMIC: |
||
| 278 | spinlock_unlock(&wq->lock); |
||
| 279 | break; |
||
| 280 | default: |
||
| 281 | break; |
||
| 282 | } |
||
| 283 | interrupts_restore(ipl); |
||
| 284 | } |
||
| 285 | |||
| 286 | /** Internal implementation of waitq_sleep_timeout(). |
||
| 287 | * |
||
| 288 | * This function implements logic of sleeping in a wait queue. |
||
| 289 | * This call must be preceeded by a call to waitq_sleep_prepare() |
||
| 290 | * and followed by a call to waitq_slee_finish(). |
||
| 291 | * |
||
| 292 | * @param wq See waitq_sleep_timeout(). |
||
| 293 | * @param usec See waitq_sleep_timeout(). |
||
| 1502 | jermar | 294 | * @param flags See waitq_sleep_timeout(). |
| 1375 | jermar | 295 | * |
| 296 | * @return See waitq_sleep_timeout(). |
||
| 297 | */ |
||
| 1502 | jermar | 298 | int waitq_sleep_timeout_unsafe(waitq_t *wq, __u32 usec, int flags) |
| 1375 | jermar | 299 | { |
| 1 | jermar | 300 | /* checks whether to go to sleep at all */ |
| 301 | if (wq->missed_wakeups) { |
||
| 302 | wq->missed_wakeups--; |
||
| 303 | return ESYNCH_OK_ATOMIC; |
||
| 304 | } |
||
| 305 | else { |
||
| 1502 | jermar | 306 | if ((flags & SYNCH_FLAGS_NON_BLOCKING) && (usec == 0)) { |
| 1 | jermar | 307 | /* return immediatelly instead of going to sleep */ |
| 308 | return ESYNCH_WOULD_BLOCK; |
||
| 309 | } |
||
| 310 | } |
||
| 311 | |||
| 312 | /* |
||
| 313 | * Now we are firmly decided to go to sleep. |
||
| 314 | */ |
||
| 15 | jermar | 315 | spinlock_lock(&THREAD->lock); |
| 1156 | jermar | 316 | |
| 1580 | jermar | 317 | if (flags & SYNCH_FLAGS_INTERRUPTIBLE) { |
| 1579 | jermar | 318 | |
| 1502 | jermar | 319 | /* |
| 1580 | jermar | 320 | * If the thread was already interrupted, |
| 321 | * don't go to sleep at all. |
||
| 322 | */ |
||
| 323 | if (THREAD->interrupted) { |
||
| 324 | spinlock_unlock(&THREAD->lock); |
||
| 325 | spinlock_unlock(&wq->lock); |
||
| 326 | return ESYNCH_INTERRUPTED; |
||
| 327 | } |
||
| 328 | |||
| 329 | /* |
||
| 1502 | jermar | 330 | * Set context that will be restored if the sleep |
| 331 | * of this thread is ever interrupted. |
||
| 332 | */ |
||
| 333 | THREAD->sleep_interruptible = true; |
||
| 334 | if (!context_save(&THREAD->sleep_interruption_context)) { |
||
| 335 | /* Short emulation of scheduler() return code. */ |
||
| 336 | spinlock_unlock(&THREAD->lock); |
||
| 337 | return ESYNCH_INTERRUPTED; |
||
| 338 | } |
||
| 1580 | jermar | 339 | |
| 1502 | jermar | 340 | } else { |
| 341 | THREAD->sleep_interruptible = false; |
||
| 1156 | jermar | 342 | } |
| 343 | |||
| 1 | jermar | 344 | if (usec) { |
| 345 | /* We use the timeout variant. */ |
||
| 15 | jermar | 346 | if (!context_save(&THREAD->sleep_timeout_context)) { |
| 1156 | jermar | 347 | /* Short emulation of scheduler() return code. */ |
| 15 | jermar | 348 | spinlock_unlock(&THREAD->lock); |
| 1 | jermar | 349 | return ESYNCH_TIMEOUT; |
| 350 | } |
||
| 557 | jermar | 351 | THREAD->timeout_pending = true; |
| 1156 | jermar | 352 | timeout_register(&THREAD->sleep_timeout, (__u64) usec, waitq_timeouted_sleep, THREAD); |
| 1 | jermar | 353 | } |
| 354 | |||
| 15 | jermar | 355 | list_append(&THREAD->wq_link, &wq->head); |
| 1 | jermar | 356 | |
| 357 | /* |
||
| 358 | * Suspend execution. |
||
| 359 | */ |
||
| 15 | jermar | 360 | THREAD->state = Sleeping; |
| 361 | THREAD->sleep_queue = wq; |
||
| 1 | jermar | 362 | |
| 15 | jermar | 363 | spinlock_unlock(&THREAD->lock); |
| 1 | jermar | 364 | |
| 365 | scheduler(); /* wq->lock is released in scheduler_separated_stack() */ |
||
| 366 | |||
| 367 | return ESYNCH_OK_BLOCKED; |
||
| 368 | } |
||
| 369 | |||
| 370 | |||
| 382 | jermar | 371 | /** Wake up first thread sleeping in a wait queue |
| 372 | * |
||
| 373 | * Wake up first thread sleeping in a wait queue. |
||
| 374 | * This is the SMP- and IRQ-safe wrapper meant for |
||
| 375 | * general use. |
||
| 376 | * |
||
| 377 | * Besides its 'normal' wakeup operation, it attempts |
||
| 378 | * to unregister possible timeout. |
||
| 379 | * |
||
| 380 | * @param wq Pointer to wait queue. |
||
| 381 | * @param all If this is non-zero, all sleeping threads |
||
| 382 | * will be woken up and missed count will be zeroed. |
||
| 1 | jermar | 383 | */ |
| 557 | jermar | 384 | void waitq_wakeup(waitq_t *wq, bool all) |
| 1 | jermar | 385 | { |
| 413 | jermar | 386 | ipl_t ipl; |
| 1 | jermar | 387 | |
| 413 | jermar | 388 | ipl = interrupts_disable(); |
| 1 | jermar | 389 | spinlock_lock(&wq->lock); |
| 390 | |||
| 391 | _waitq_wakeup_unsafe(wq, all); |
||
| 392 | |||
| 393 | spinlock_unlock(&wq->lock); |
||
| 413 | jermar | 394 | interrupts_restore(ipl); |
| 1 | jermar | 395 | } |
| 396 | |||
| 382 | jermar | 397 | /** Internal SMP- and IRQ-unsafe version of waitq_wakeup() |
| 398 | * |
||
| 399 | * This is the internal SMP- and IRQ-unsafe version |
||
| 400 | * of waitq_wakeup(). It assumes wq->lock is already |
||
| 401 | * locked and interrupts are already disabled. |
||
| 402 | * |
||
| 403 | * @param wq Pointer to wait queue. |
||
| 404 | * @param all If this is non-zero, all sleeping threads |
||
| 405 | * will be woken up and missed count will be zeroed. |
||
| 1 | jermar | 406 | */ |
| 557 | jermar | 407 | void _waitq_wakeup_unsafe(waitq_t *wq, bool all) |
| 1 | jermar | 408 | { |
| 409 | thread_t *t; |
||
| 410 | |||
| 411 | loop: |
||
| 412 | if (list_empty(&wq->head)) { |
||
| 413 | wq->missed_wakeups++; |
||
| 557 | jermar | 414 | if (all) |
| 415 | wq->missed_wakeups = 0; |
||
| 1 | jermar | 416 | return; |
| 417 | } |
||
| 418 | |||
| 419 | t = list_get_instance(wq->head.next, thread_t, wq_link); |
||
| 420 | |||
| 421 | list_remove(&t->wq_link); |
||
| 422 | spinlock_lock(&t->lock); |
||
| 423 | if (t->timeout_pending && timeout_unregister(&t->sleep_timeout)) |
||
| 557 | jermar | 424 | t->timeout_pending = false; |
| 1 | jermar | 425 | t->sleep_queue = NULL; |
| 426 | spinlock_unlock(&t->lock); |
||
| 427 | |||
| 428 | thread_ready(t); |
||
| 429 | |||
| 557 | jermar | 430 | if (all) |
| 431 | goto loop; |
||
| 1 | jermar | 432 | } |