1 /*- 2 * Copyright (c) 2004 John Baldwin <jhb@FreeBSD.org> 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 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. Neither the name of the author nor the names of any co-contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30 /* 31 * Implementation of sleep queues used to hold queue of threads blocked on 32 * a wait channel. Sleep queues different from turnstiles in that wait 33 * channels are not owned by anyone, so there is no priority propagation. 34 * Sleep queues can also provide a timeout and can also be interrupted by 35 * signals. That said, there are several similarities between the turnstile 36 * and sleep queue implementations. (Note: turnstiles were implemented 37 * first.) For example, both use a hash table of the same size where each 38 * bucket is referred to as a "chain" that contains both a spin lock and 39 * a linked list of queues. An individual queue is located by using a hash 40 * to pick a chain, locking the chain, and then walking the chain searching 41 * for the queue. This means that a wait channel object does not need to 42 * embed it's queue head just as locks do not embed their turnstile queue 43 * head. Threads also carry around a sleep queue that they lend to the 44 * wait channel when blocking. Just as in turnstiles, the queue includes 45 * a free list of the sleep queues of other threads blocked on the same 46 * wait channel in the case of multiple waiters. 47 * 48 * Some additional functionality provided by sleep queues include the 49 * ability to set a timeout. The timeout is managed using a per-thread 50 * callout that resumes a thread if it is asleep. A thread may also 51 * catch signals while it is asleep (aka an interruptible sleep). The 52 * signal code uses sleepq_abort() to interrupt a sleeping thread. Finally, 53 * sleep queues also provide some extra assertions. One is not allowed to 54 * mix the sleep/wakeup and cv APIs for a given wait channel. Also, one 55 * must consistently use the same lock to synchronize with a wait channel, 56 * though this check is currently only a warning for sleep/wakeup due to 57 * pre-existing abuse of that API. The same lock must also be held when 58 * awakening threads, though that is currently only enforced for condition 59 * variables. 60 */ 61 62 #include "opt_sleepqueue_profiling.h" 63 64 #include <sys/cdefs.h> 65 __FBSDID("$FreeBSD$"); 66 67 #include <sys/param.h> 68 #include <sys/systm.h> 69 #include <sys/lock.h> 70 #include <sys/kernel.h> 71 #include <sys/ktr.h> 72 #include <sys/malloc.h> 73 #include <sys/mutex.h> 74 #include <sys/proc.h> 75 #include <sys/sched.h> 76 #include <sys/signalvar.h> 77 #include <sys/sleepqueue.h> 78 #include <sys/sysctl.h> 79 80 /* 81 * Constants for the hash table of sleep queue chains. These constants are 82 * the same ones that 4BSD (and possibly earlier versions of BSD) used. 83 * Basically, we ignore the lower 8 bits of the address since most wait 84 * channel pointers are aligned and only look at the next 7 bits for the 85 * hash. SC_TABLESIZE must be a power of two for SC_MASK to work properly. 86 */ 87 #define SC_TABLESIZE 128 /* Must be power of 2. */ 88 #define SC_MASK (SC_TABLESIZE - 1) 89 #define SC_SHIFT 8 90 #define SC_HASH(wc) (((uintptr_t)(wc) >> SC_SHIFT) & SC_MASK) 91 #define SC_LOOKUP(wc) &sleepq_chains[SC_HASH(wc)] 92 93 /* 94 * There two different lists of sleep queues. Both lists are connected 95 * via the sq_hash entries. The first list is the sleep queue chain list 96 * that a sleep queue is on when it is attached to a wait channel. The 97 * second list is the free list hung off of a sleep queue that is attached 98 * to a wait channel. 99 * 100 * Each sleep queue also contains the wait channel it is attached to, the 101 * list of threads blocked on that wait channel, flags specific to the 102 * wait channel, and the lock used to synchronize with a wait channel. 103 * The flags are used to catch mismatches between the various consumers 104 * of the sleep queue API (e.g. sleep/wakeup and condition variables). 105 * The lock pointer is only used when invariants are enabled for various 106 * debugging checks. 107 * 108 * Locking key: 109 * c - sleep queue chain lock 110 */ 111 struct sleepqueue { 112 TAILQ_HEAD(, thread) sq_blocked; /* (c) Blocked threads. */ 113 LIST_ENTRY(sleepqueue) sq_hash; /* (c) Chain and free list. */ 114 LIST_HEAD(, sleepqueue) sq_free; /* (c) Free queues. */ 115 void *sq_wchan; /* (c) Wait channel. */ 116 #ifdef INVARIANTS 117 int sq_type; /* (c) Queue type. */ 118 struct mtx *sq_lock; /* (c) Associated lock. */ 119 #endif 120 }; 121 122 struct sleepqueue_chain { 123 LIST_HEAD(, sleepqueue) sc_queues; /* List of sleep queues. */ 124 struct mtx sc_lock; /* Spin lock for this chain. */ 125 #ifdef SLEEPQUEUE_PROFILING 126 u_int sc_depth; /* Length of sc_queues. */ 127 u_int sc_max_depth; /* Max length of sc_queues. */ 128 #endif 129 }; 130 131 #ifdef SLEEPQUEUE_PROFILING 132 u_int sleepq_max_depth; 133 SYSCTL_NODE(_debug, OID_AUTO, sleepq, CTLFLAG_RD, 0, "sleepq profiling"); 134 SYSCTL_NODE(_debug_sleepq, OID_AUTO, chains, CTLFLAG_RD, 0, 135 "sleepq chain stats"); 136 SYSCTL_UINT(_debug_sleepq, OID_AUTO, max_depth, CTLFLAG_RD, &sleepq_max_depth, 137 0, "maxmimum depth achieved of a single chain"); 138 #endif 139 static struct sleepqueue_chain sleepq_chains[SC_TABLESIZE]; 140 141 static MALLOC_DEFINE(M_SLEEPQUEUE, "sleep queues", "sleep queues"); 142 143 /* 144 * Prototypes for non-exported routines. 145 */ 146 static int sleepq_check_timeout(void); 147 static void sleepq_switch(void *wchan); 148 static void sleepq_timeout(void *arg); 149 static void sleepq_resume_thread(struct sleepqueue *sq, struct thread *td, int pri); 150 151 /* 152 * Early initialization of sleep queues that is called from the sleepinit() 153 * SYSINIT. 154 */ 155 void 156 init_sleepqueues(void) 157 { 158 #ifdef SLEEPQUEUE_PROFILING 159 struct sysctl_oid *chain_oid; 160 char chain_name[10]; 161 #endif 162 int i; 163 164 for (i = 0; i < SC_TABLESIZE; i++) { 165 LIST_INIT(&sleepq_chains[i].sc_queues); 166 mtx_init(&sleepq_chains[i].sc_lock, "sleepq chain", NULL, 167 MTX_SPIN); 168 #ifdef SLEEPQUEUE_PROFILING 169 snprintf(chain_name, sizeof(chain_name), "%d", i); 170 chain_oid = SYSCTL_ADD_NODE(NULL, 171 SYSCTL_STATIC_CHILDREN(_debug_sleepq_chains), OID_AUTO, 172 chain_name, CTLFLAG_RD, NULL, "sleepq chain stats"); 173 SYSCTL_ADD_UINT(NULL, SYSCTL_CHILDREN(chain_oid), OID_AUTO, 174 "depth", CTLFLAG_RD, &sleepq_chains[i].sc_depth, 0, NULL); 175 SYSCTL_ADD_UINT(NULL, SYSCTL_CHILDREN(chain_oid), OID_AUTO, 176 "max_depth", CTLFLAG_RD, &sleepq_chains[i].sc_max_depth, 0, 177 NULL); 178 #endif 179 } 180 thread0.td_sleepqueue = sleepq_alloc(); 181 } 182 183 /* 184 * Malloc and initialize a new sleep queue for a new thread. 185 */ 186 struct sleepqueue * 187 sleepq_alloc(void) 188 { 189 struct sleepqueue *sq; 190 191 sq = malloc(sizeof(struct sleepqueue), M_SLEEPQUEUE, M_WAITOK | M_ZERO); 192 TAILQ_INIT(&sq->sq_blocked); 193 LIST_INIT(&sq->sq_free); 194 return (sq); 195 } 196 197 /* 198 * Free a sleep queue when a thread is destroyed. 199 */ 200 void 201 sleepq_free(struct sleepqueue *sq) 202 { 203 204 MPASS(sq != NULL); 205 MPASS(TAILQ_EMPTY(&sq->sq_blocked)); 206 free(sq, M_SLEEPQUEUE); 207 } 208 209 /* 210 * Lock the sleep queue chain associated with the specified wait channel. 211 */ 212 void 213 sleepq_lock(void *wchan) 214 { 215 struct sleepqueue_chain *sc; 216 217 sc = SC_LOOKUP(wchan); 218 mtx_lock_spin(&sc->sc_lock); 219 } 220 221 /* 222 * Look up the sleep queue associated with a given wait channel in the hash 223 * table locking the associated sleep queue chain. If no queue is found in 224 * the table, NULL is returned. 225 */ 226 struct sleepqueue * 227 sleepq_lookup(void *wchan) 228 { 229 struct sleepqueue_chain *sc; 230 struct sleepqueue *sq; 231 232 KASSERT(wchan != NULL, ("%s: invalid NULL wait channel", __func__)); 233 sc = SC_LOOKUP(wchan); 234 mtx_assert(&sc->sc_lock, MA_OWNED); 235 LIST_FOREACH(sq, &sc->sc_queues, sq_hash) 236 if (sq->sq_wchan == wchan) 237 return (sq); 238 return (NULL); 239 } 240 241 /* 242 * Unlock the sleep queue chain associated with a given wait channel. 243 */ 244 void 245 sleepq_release(void *wchan) 246 { 247 struct sleepqueue_chain *sc; 248 249 sc = SC_LOOKUP(wchan); 250 mtx_unlock_spin(&sc->sc_lock); 251 } 252 253 /* 254 * Places the current thread on the sleep queue for the specified wait 255 * channel. If INVARIANTS is enabled, then it associates the passed in 256 * lock with the sleepq to make sure it is held when that sleep queue is 257 * woken up. 258 */ 259 void 260 sleepq_add(void *wchan, struct mtx *lock, const char *wmesg, int flags) 261 { 262 struct sleepqueue_chain *sc; 263 struct sleepqueue *sq; 264 struct thread *td; 265 266 td = curthread; 267 sc = SC_LOOKUP(wchan); 268 mtx_assert(&sc->sc_lock, MA_OWNED); 269 MPASS(td->td_sleepqueue != NULL); 270 MPASS(wchan != NULL); 271 272 /* Look up the sleep queue associated with the wait channel 'wchan'. */ 273 sq = sleepq_lookup(wchan); 274 275 /* 276 * If the wait channel does not already have a sleep queue, use 277 * this thread's sleep queue. Otherwise, insert the current thread 278 * into the sleep queue already in use by this wait channel. 279 */ 280 if (sq == NULL) { 281 #ifdef SLEEPQUEUE_PROFILING 282 sc->sc_depth++; 283 if (sc->sc_depth > sc->sc_max_depth) { 284 sc->sc_max_depth = sc->sc_depth; 285 if (sc->sc_max_depth > sleepq_max_depth) 286 sleepq_max_depth = sc->sc_max_depth; 287 } 288 #endif 289 sq = td->td_sleepqueue; 290 LIST_INSERT_HEAD(&sc->sc_queues, sq, sq_hash); 291 KASSERT(TAILQ_EMPTY(&sq->sq_blocked), 292 ("thread's sleep queue has a non-empty queue")); 293 KASSERT(LIST_EMPTY(&sq->sq_free), 294 ("thread's sleep queue has a non-empty free list")); 295 KASSERT(sq->sq_wchan == NULL, ("stale sq_wchan pointer")); 296 sq->sq_wchan = wchan; 297 #ifdef INVARIANTS 298 sq->sq_lock = lock; 299 sq->sq_type = flags & SLEEPQ_TYPE; 300 #endif 301 } else { 302 MPASS(wchan == sq->sq_wchan); 303 MPASS(lock == sq->sq_lock); 304 MPASS((flags & SLEEPQ_TYPE) == sq->sq_type); 305 LIST_INSERT_HEAD(&sq->sq_free, td->td_sleepqueue, sq_hash); 306 } 307 TAILQ_INSERT_TAIL(&sq->sq_blocked, td, td_slpq); 308 td->td_sleepqueue = NULL; 309 mtx_lock_spin(&sched_lock); 310 td->td_wchan = wchan; 311 td->td_wmesg = wmesg; 312 if (flags & SLEEPQ_INTERRUPTIBLE) 313 td->td_flags |= TDF_SINTR; 314 mtx_unlock_spin(&sched_lock); 315 } 316 317 /* 318 * Sets a timeout that will remove the current thread from the specified 319 * sleep queue after timo ticks if the thread has not already been awakened. 320 */ 321 void 322 sleepq_set_timeout(void *wchan, int timo) 323 { 324 struct sleepqueue_chain *sc; 325 struct thread *td; 326 327 td = curthread; 328 sc = SC_LOOKUP(wchan); 329 mtx_assert(&sc->sc_lock, MA_OWNED); 330 MPASS(TD_ON_SLEEPQ(td)); 331 MPASS(td->td_sleepqueue == NULL); 332 MPASS(wchan != NULL); 333 callout_reset(&td->td_slpcallout, timo, sleepq_timeout, td); 334 } 335 336 /* 337 * Marks the pending sleep of the current thread as interruptible and 338 * makes an initial check for pending signals before putting a thread 339 * to sleep. 340 */ 341 int 342 sleepq_catch_signals(void *wchan) 343 { 344 struct sleepqueue_chain *sc; 345 struct sleepqueue *sq; 346 struct thread *td; 347 struct proc *p; 348 int sig; 349 350 td = curthread; 351 p = td->td_proc; 352 sc = SC_LOOKUP(wchan); 353 mtx_assert(&sc->sc_lock, MA_OWNED); 354 MPASS(td->td_sleepqueue == NULL); 355 MPASS(wchan != NULL); 356 CTR3(KTR_PROC, "sleepq catching signals: thread %p (pid %ld, %s)", 357 (void *)td, (long)p->p_pid, p->p_comm); 358 359 /* Mark thread as being in an interruptible sleep. */ 360 MPASS(td->td_flags & TDF_SINTR); 361 MPASS(TD_ON_SLEEPQ(td)); 362 sleepq_release(wchan); 363 364 /* See if there are any pending signals for this thread. */ 365 PROC_LOCK(p); 366 mtx_lock(&p->p_sigacts->ps_mtx); 367 sig = cursig(td); 368 mtx_unlock(&p->p_sigacts->ps_mtx); 369 if (sig == 0 && thread_suspend_check(1)) 370 sig = SIGSTOP; 371 PROC_UNLOCK(p); 372 373 /* 374 * If there were pending signals and this thread is still on 375 * the sleep queue, remove it from the sleep queue. If the 376 * thread was removed from the sleep queue while we were blocked 377 * above, then clear TDF_SINTR before returning. 378 */ 379 sleepq_lock(wchan); 380 sq = sleepq_lookup(wchan); 381 mtx_lock_spin(&sched_lock); 382 if (TD_ON_SLEEPQ(td) && sig != 0) 383 sleepq_resume_thread(sq, td, -1); 384 else if (!TD_ON_SLEEPQ(td) && sig == 0) 385 td->td_flags &= ~TDF_SINTR; 386 mtx_unlock_spin(&sched_lock); 387 return (sig); 388 } 389 390 /* 391 * Switches to another thread if we are still asleep on a sleep queue and 392 * drop the lock on the sleep queue chain. Returns with sched_lock held. 393 */ 394 static void 395 sleepq_switch(void *wchan) 396 { 397 struct sleepqueue_chain *sc; 398 struct thread *td; 399 400 td = curthread; 401 sc = SC_LOOKUP(wchan); 402 mtx_assert(&sc->sc_lock, MA_OWNED); 403 404 /* 405 * If we have a sleep queue, then we've already been woken up, so 406 * just return. 407 */ 408 if (td->td_sleepqueue != NULL) { 409 MPASS(!TD_ON_SLEEPQ(td)); 410 mtx_unlock_spin(&sc->sc_lock); 411 mtx_lock_spin(&sched_lock); 412 return; 413 } 414 415 /* 416 * Otherwise, actually go to sleep. 417 */ 418 mtx_lock_spin(&sched_lock); 419 mtx_unlock_spin(&sc->sc_lock); 420 421 sched_sleep(td); 422 TD_SET_SLEEPING(td); 423 mi_switch(SW_VOL, NULL); 424 KASSERT(TD_IS_RUNNING(td), ("running but not TDS_RUNNING")); 425 CTR3(KTR_PROC, "sleepq resume: thread %p (pid %ld, %s)", 426 (void *)td, (long)td->td_proc->p_pid, (void *)td->td_proc->p_comm); 427 } 428 429 /* 430 * Check to see if we timed out. 431 */ 432 static int 433 sleepq_check_timeout(void) 434 { 435 struct thread *td; 436 437 mtx_assert(&sched_lock, MA_OWNED); 438 td = curthread; 439 440 /* 441 * If TDF_TIMEOUT is set, we timed out. 442 */ 443 if (td->td_flags & TDF_TIMEOUT) { 444 td->td_flags &= ~TDF_TIMEOUT; 445 return (EWOULDBLOCK); 446 } 447 448 /* 449 * If TDF_TIMOFAIL is set, the timeout ran after we had 450 * already been woken up. 451 */ 452 if (td->td_flags & TDF_TIMOFAIL) 453 td->td_flags &= ~TDF_TIMOFAIL; 454 455 /* 456 * If callout_stop() fails, then the timeout is running on 457 * another CPU, so synchronize with it to avoid having it 458 * accidentally wake up a subsequent sleep. 459 */ 460 else if (callout_stop(&td->td_slpcallout) == 0) { 461 td->td_flags |= TDF_TIMEOUT; 462 TD_SET_SLEEPING(td); 463 mi_switch(SW_INVOL, NULL); 464 } 465 return (0); 466 } 467 468 /* 469 * Check to see if we were awoken by a signal. 470 */ 471 static int 472 sleepq_check_signals(void) 473 { 474 struct thread *td; 475 476 mtx_assert(&sched_lock, MA_OWNED); 477 td = curthread; 478 479 /* 480 * If TDF_SINTR is clear, then we were awakened while executing 481 * sleepq_catch_signals(). 482 */ 483 if (!(td->td_flags & TDF_SINTR)) 484 return (0); 485 486 /* We are no longer in an interruptible sleep. */ 487 td->td_flags &= ~TDF_SINTR; 488 489 if (td->td_flags & TDF_INTERRUPT) 490 return (td->td_intrval); 491 return (0); 492 } 493 494 /* 495 * If we were in an interruptible sleep and we weren't interrupted and 496 * didn't timeout, check to see if there are any pending signals and 497 * which return value we should use if so. The return value from an 498 * earlier call to sleepq_catch_signals() should be passed in as the 499 * argument. 500 */ 501 int 502 sleepq_calc_signal_retval(int sig) 503 { 504 struct thread *td; 505 struct proc *p; 506 int rval; 507 508 td = curthread; 509 p = td->td_proc; 510 PROC_LOCK(p); 511 mtx_lock(&p->p_sigacts->ps_mtx); 512 /* XXX: Should we always be calling cursig()? */ 513 if (sig == 0) 514 sig = cursig(td); 515 if (sig != 0) { 516 if (SIGISMEMBER(p->p_sigacts->ps_sigintr, sig)) 517 rval = EINTR; 518 else 519 rval = ERESTART; 520 } else 521 rval = 0; 522 mtx_unlock(&p->p_sigacts->ps_mtx); 523 PROC_UNLOCK(p); 524 return (rval); 525 } 526 527 /* 528 * Block the current thread until it is awakened from its sleep queue. 529 */ 530 void 531 sleepq_wait(void *wchan) 532 { 533 534 MPASS(!(curthread->td_flags & TDF_SINTR)); 535 sleepq_switch(wchan); 536 mtx_unlock_spin(&sched_lock); 537 } 538 539 /* 540 * Block the current thread until it is awakened from its sleep queue 541 * or it is interrupted by a signal. 542 */ 543 int 544 sleepq_wait_sig(void *wchan) 545 { 546 int rval; 547 548 sleepq_switch(wchan); 549 rval = sleepq_check_signals(); 550 mtx_unlock_spin(&sched_lock); 551 return (rval); 552 } 553 554 /* 555 * Block the current thread until it is awakened from its sleep queue 556 * or it times out while waiting. 557 */ 558 int 559 sleepq_timedwait(void *wchan) 560 { 561 int rval; 562 563 MPASS(!(curthread->td_flags & TDF_SINTR)); 564 sleepq_switch(wchan); 565 rval = sleepq_check_timeout(); 566 mtx_unlock_spin(&sched_lock); 567 return (rval); 568 } 569 570 /* 571 * Block the current thread until it is awakened from its sleep queue, 572 * it is interrupted by a signal, or it times out waiting to be awakened. 573 */ 574 int 575 sleepq_timedwait_sig(void *wchan, int signal_caught) 576 { 577 int rvalt, rvals; 578 579 sleepq_switch(wchan); 580 rvalt = sleepq_check_timeout(); 581 rvals = sleepq_check_signals(); 582 mtx_unlock_spin(&sched_lock); 583 if (signal_caught || rvalt == 0) 584 return (rvals); 585 else 586 return (rvalt); 587 } 588 589 /* 590 * Removes a thread from a sleep queue and makes it 591 * runnable. 592 */ 593 static void 594 sleepq_resume_thread(struct sleepqueue *sq, struct thread *td, int pri) 595 { 596 struct sleepqueue_chain *sc; 597 598 MPASS(td != NULL); 599 MPASS(sq->sq_wchan != NULL); 600 MPASS(td->td_wchan == sq->sq_wchan); 601 sc = SC_LOOKUP(sq->sq_wchan); 602 mtx_assert(&sc->sc_lock, MA_OWNED); 603 mtx_assert(&sched_lock, MA_OWNED); 604 605 /* Remove the thread from the queue. */ 606 TAILQ_REMOVE(&sq->sq_blocked, td, td_slpq); 607 608 /* 609 * Get a sleep queue for this thread. If this is the last waiter, 610 * use the queue itself and take it out of the chain, otherwise, 611 * remove a queue from the free list. 612 */ 613 if (LIST_EMPTY(&sq->sq_free)) { 614 td->td_sleepqueue = sq; 615 #ifdef INVARIANTS 616 sq->sq_wchan = NULL; 617 #endif 618 #ifdef SLEEPQUEUE_PROFILING 619 sc->sc_depth--; 620 #endif 621 } else 622 td->td_sleepqueue = LIST_FIRST(&sq->sq_free); 623 LIST_REMOVE(td->td_sleepqueue, sq_hash); 624 625 td->td_wmesg = NULL; 626 td->td_wchan = NULL; 627 628 /* 629 * Note that thread td might not be sleeping if it is running 630 * sleepq_catch_signals() on another CPU or is blocked on 631 * its proc lock to check signals. It doesn't hurt to clear 632 * the sleeping flag if it isn't set though, so we just always 633 * do it. However, we can't assert that it is set. 634 */ 635 CTR3(KTR_PROC, "sleepq_wakeup: thread %p (pid %ld, %s)", 636 (void *)td, (long)td->td_proc->p_pid, td->td_proc->p_comm); 637 TD_CLR_SLEEPING(td); 638 639 /* Adjust priority if requested. */ 640 MPASS(pri == -1 || (pri >= PRI_MIN && pri <= PRI_MAX)); 641 if (pri != -1 && td->td_priority > pri) 642 sched_prio(td, pri); 643 setrunnable(td); 644 } 645 646 /* 647 * Find the highest priority thread sleeping on a wait channel and resume it. 648 */ 649 void 650 sleepq_signal(void *wchan, int flags, int pri) 651 { 652 struct sleepqueue *sq; 653 struct thread *td, *besttd; 654 655 CTR2(KTR_PROC, "sleepq_signal(%p, %d)", wchan, flags); 656 KASSERT(wchan != NULL, ("%s: invalid NULL wait channel", __func__)); 657 sq = sleepq_lookup(wchan); 658 if (sq == NULL) { 659 sleepq_release(wchan); 660 return; 661 } 662 KASSERT(sq->sq_type == (flags & SLEEPQ_TYPE), 663 ("%s: mismatch between sleep/wakeup and cv_*", __func__)); 664 665 /* 666 * Find the highest priority thread on the queue. If there is a 667 * tie, use the thread that first appears in the queue as it has 668 * been sleeping the longest since threads are always added to 669 * the tail of sleep queues. 670 */ 671 besttd = NULL; 672 TAILQ_FOREACH(td, &sq->sq_blocked, td_slpq) { 673 if (besttd == NULL || td->td_priority < besttd->td_priority) 674 besttd = td; 675 } 676 MPASS(besttd != NULL); 677 mtx_lock_spin(&sched_lock); 678 sleepq_resume_thread(sq, besttd, pri); 679 mtx_unlock_spin(&sched_lock); 680 sleepq_release(wchan); 681 } 682 683 /* 684 * Resume all threads sleeping on a specified wait channel. 685 */ 686 void 687 sleepq_broadcast(void *wchan, int flags, int pri) 688 { 689 struct sleepqueue *sq; 690 691 CTR2(KTR_PROC, "sleepq_broadcast(%p, %d)", wchan, flags); 692 KASSERT(wchan != NULL, ("%s: invalid NULL wait channel", __func__)); 693 sq = sleepq_lookup(wchan); 694 if (sq == NULL) { 695 sleepq_release(wchan); 696 return; 697 } 698 KASSERT(sq->sq_type == (flags & SLEEPQ_TYPE), 699 ("%s: mismatch between sleep/wakeup and cv_*", __func__)); 700 701 /* Resume all blocked threads on the sleep queue. */ 702 mtx_lock_spin(&sched_lock); 703 while (!TAILQ_EMPTY(&sq->sq_blocked)) 704 sleepq_resume_thread(sq, TAILQ_FIRST(&sq->sq_blocked), pri); 705 mtx_unlock_spin(&sched_lock); 706 sleepq_release(wchan); 707 } 708 709 /* 710 * Time sleeping threads out. When the timeout expires, the thread is 711 * removed from the sleep queue and made runnable if it is still asleep. 712 */ 713 static void 714 sleepq_timeout(void *arg) 715 { 716 struct sleepqueue *sq; 717 struct thread *td; 718 void *wchan; 719 720 td = arg; 721 CTR3(KTR_PROC, "sleepq_timeout: thread %p (pid %ld, %s)", 722 (void *)td, (long)td->td_proc->p_pid, (void *)td->td_proc->p_comm); 723 724 /* 725 * First, see if the thread is asleep and get the wait channel if 726 * it is. 727 */ 728 mtx_lock_spin(&sched_lock); 729 if (TD_ON_SLEEPQ(td)) { 730 wchan = td->td_wchan; 731 mtx_unlock_spin(&sched_lock); 732 sleepq_lock(wchan); 733 sq = sleepq_lookup(wchan); 734 mtx_lock_spin(&sched_lock); 735 } else { 736 wchan = NULL; 737 sq = NULL; 738 } 739 740 /* 741 * At this point, if the thread is still on the sleep queue, 742 * we have that sleep queue locked as it cannot migrate sleep 743 * queues while we dropped sched_lock. If it had resumed and 744 * was on another CPU while the lock was dropped, it would have 745 * seen that TDF_TIMEOUT and TDF_TIMOFAIL are clear and the 746 * call to callout_stop() to stop this routine would have failed 747 * meaning that it would have already set TDF_TIMEOUT to 748 * synchronize with this function. 749 */ 750 if (TD_ON_SLEEPQ(td)) { 751 MPASS(td->td_wchan == wchan); 752 MPASS(sq != NULL); 753 td->td_flags |= TDF_TIMEOUT; 754 sleepq_resume_thread(sq, td, -1); 755 mtx_unlock_spin(&sched_lock); 756 sleepq_release(wchan); 757 return; 758 } else if (wchan != NULL) 759 sleepq_release(wchan); 760 761 /* 762 * Now check for the edge cases. First, if TDF_TIMEOUT is set, 763 * then the other thread has already yielded to us, so clear 764 * the flag and resume it. If TDF_TIMEOUT is not set, then the 765 * we know that the other thread is not on a sleep queue, but it 766 * hasn't resumed execution yet. In that case, set TDF_TIMOFAIL 767 * to let it know that the timeout has already run and doesn't 768 * need to be canceled. 769 */ 770 if (td->td_flags & TDF_TIMEOUT) { 771 MPASS(TD_IS_SLEEPING(td)); 772 td->td_flags &= ~TDF_TIMEOUT; 773 TD_CLR_SLEEPING(td); 774 setrunnable(td); 775 } else 776 td->td_flags |= TDF_TIMOFAIL; 777 mtx_unlock_spin(&sched_lock); 778 } 779 780 /* 781 * Resumes a specific thread from the sleep queue associated with a specific 782 * wait channel if it is on that queue. 783 */ 784 void 785 sleepq_remove(struct thread *td, void *wchan) 786 { 787 struct sleepqueue *sq; 788 789 /* 790 * Look up the sleep queue for this wait channel, then re-check 791 * that the thread is asleep on that channel, if it is not, then 792 * bail. 793 */ 794 MPASS(wchan != NULL); 795 sleepq_lock(wchan); 796 sq = sleepq_lookup(wchan); 797 mtx_lock_spin(&sched_lock); 798 if (!TD_ON_SLEEPQ(td) || td->td_wchan != wchan) { 799 mtx_unlock_spin(&sched_lock); 800 sleepq_release(wchan); 801 return; 802 } 803 MPASS(sq != NULL); 804 805 /* Thread is asleep on sleep queue sq, so wake it up. */ 806 sleepq_resume_thread(sq, td, -1); 807 sleepq_release(wchan); 808 mtx_unlock_spin(&sched_lock); 809 } 810 811 /* 812 * Abort a thread as if an interrupt had occurred. Only abort 813 * interruptible waits (unfortunately it isn't safe to abort others). 814 * 815 * XXX: What in the world does the comment below mean? 816 * Also, whatever the signal code does... 817 */ 818 void 819 sleepq_abort(struct thread *td) 820 { 821 void *wchan; 822 823 mtx_assert(&sched_lock, MA_OWNED); 824 MPASS(TD_ON_SLEEPQ(td)); 825 MPASS(td->td_flags & TDF_SINTR); 826 827 /* 828 * If the TDF_TIMEOUT flag is set, just leave. A 829 * timeout is scheduled anyhow. 830 */ 831 if (td->td_flags & TDF_TIMEOUT) 832 return; 833 834 CTR3(KTR_PROC, "sleepq_abort: thread %p (pid %ld, %s)", 835 (void *)td, (long)td->td_proc->p_pid, (void *)td->td_proc->p_comm); 836 wchan = td->td_wchan; 837 mtx_unlock_spin(&sched_lock); 838 sleepq_remove(td, wchan); 839 mtx_lock_spin(&sched_lock); 840 } 841