2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1982, 1986, 1990, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 * (c) UNIX System Laboratories, Inc.
7 * All or some portions of this file are derived from material licensed
8 * to the University of California by American Telephone and Telegraph
9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
10 * the permission of UNIX System Laboratories, Inc.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)kern_synch.c 8.9 (Berkeley) 5/19/95
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
42 #include "opt_ktrace.h"
43 #include "opt_sched.h"
45 #include <sys/param.h>
46 #include <sys/systm.h>
47 #include <sys/blockcount.h>
48 #include <sys/condvar.h>
50 #include <sys/kernel.h>
53 #include <sys/mutex.h>
55 #include <sys/resourcevar.h>
56 #include <sys/sched.h>
58 #include <sys/signalvar.h>
59 #include <sys/sleepqueue.h>
62 #include <sys/sysctl.h>
63 #include <sys/sysproto.h>
64 #include <sys/vmmeter.h>
67 #include <sys/ktrace.h>
70 #include <sys/epoch.h>
73 #include <machine/cpu.h>
75 static void synch_setup(void *dummy);
76 SYSINIT(synch_setup, SI_SUB_KICK_SCHEDULER, SI_ORDER_FIRST, synch_setup,
80 static const char pause_wchan[MAXCPU];
82 static struct callout loadav_callout;
84 struct loadavg averunnable =
85 { {0, 0, 0}, FSCALE }; /* load average, of runnable procs */
87 * Constants for averages over 1, 5, and 15 minutes
88 * when sampling at 5 second intervals.
90 static fixpt_t cexp[3] = {
91 0.9200444146293232 * FSCALE, /* exp(-1/12) */
92 0.9834714538216174 * FSCALE, /* exp(-1/60) */
93 0.9944598480048967 * FSCALE, /* exp(-1/180) */
96 /* kernel uses `FSCALE', userland (SHOULD) use kern.fscale */
97 SYSCTL_INT(_kern, OID_AUTO, fscale, CTLFLAG_RD, SYSCTL_NULL_INT_PTR, FSCALE,
98 "Fixed-point scale factor used for calculating load average values");
100 static void loadav(void *arg);
102 SDT_PROVIDER_DECLARE(sched);
103 SDT_PROBE_DEFINE(sched, , , preempt);
106 sleepinit(void *unused)
109 hogticks = (hz / 10) * 2; /* Default only. */
114 * vmem tries to lock the sleepq mutexes when free'ing kva, so make sure
117 SYSINIT(sleepinit, SI_SUB_KMEM, SI_ORDER_ANY, sleepinit, NULL);
120 * General sleep call. Suspends the current thread until a wakeup is
121 * performed on the specified identifier. The thread will then be made
122 * runnable with the specified priority. Sleeps at most sbt units of time
123 * (0 means no timeout). If pri includes the PCATCH flag, let signals
124 * interrupt the sleep, otherwise ignore them while sleeping. Returns 0 if
125 * awakened, EWOULDBLOCK if the timeout expires. If PCATCH is set and a
126 * signal becomes pending, ERESTART is returned if the current system
127 * call should be restarted if possible, and EINTR is returned if the system
128 * call should be interrupted by the signal (return EINTR).
130 * The lock argument is unlocked before the caller is suspended, and
131 * re-locked before _sleep() returns. If priority includes the PDROP
132 * flag the lock is not re-locked before returning.
135 _sleep(const void *ident, struct lock_object *lock, int priority,
136 const char *wmesg, sbintime_t sbt, sbintime_t pr, int flags)
139 struct lock_class *class;
140 uintptr_t lock_state;
141 int catch, pri, rval, sleepq_flags;
142 WITNESS_SAVE_DECL(lock_witness);
146 if (KTRPOINT(td, KTR_CSW))
149 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, lock,
150 "Sleeping on \"%s\"", wmesg);
151 KASSERT(sbt != 0 || mtx_owned(&Giant) || lock != NULL,
152 ("sleeping without a lock"));
153 KASSERT(ident != NULL, ("_sleep: NULL ident"));
154 KASSERT(TD_IS_RUNNING(td), ("_sleep: curthread not running"));
155 if (priority & PDROP)
156 KASSERT(lock != NULL && lock != &Giant.lock_object,
157 ("PDROP requires a non-Giant lock"));
159 class = LOCK_CLASS(lock);
163 if (SCHEDULER_STOPPED_TD(td)) {
164 if (lock != NULL && priority & PDROP)
165 class->lc_unlock(lock);
168 catch = priority & PCATCH;
169 pri = priority & PRIMASK;
171 KASSERT(!TD_ON_SLEEPQ(td), ("recursive sleep"));
173 if ((uintptr_t)ident >= (uintptr_t)&pause_wchan[0] &&
174 (uintptr_t)ident <= (uintptr_t)&pause_wchan[MAXCPU - 1])
175 sleepq_flags = SLEEPQ_PAUSE;
177 sleepq_flags = SLEEPQ_SLEEP;
179 sleepq_flags |= SLEEPQ_INTERRUPTIBLE;
182 CTR5(KTR_PROC, "sleep: thread %ld (pid %ld, %s) on %s (%p)",
183 td->td_tid, td->td_proc->p_pid, td->td_name, wmesg, ident);
185 if (lock == &Giant.lock_object)
186 mtx_assert(&Giant, MA_OWNED);
188 if (lock != NULL && lock != &Giant.lock_object &&
189 !(class->lc_flags & LC_SLEEPABLE)) {
190 WITNESS_SAVE(lock, lock_witness);
191 lock_state = class->lc_unlock(lock);
193 /* GCC needs to follow the Yellow Brick Road */
197 * We put ourselves on the sleep queue and start our timeout
198 * before calling thread_suspend_check, as we could stop there,
199 * and a wakeup or a SIGCONT (or both) could occur while we were
200 * stopped without resuming us. Thus, we must be ready for sleep
201 * when cursig() is called. If the wakeup happens while we're
202 * stopped, then td will no longer be on a sleep queue upon
203 * return from cursig().
205 sleepq_add(ident, lock, wmesg, sleepq_flags, 0);
207 sleepq_set_timeout_sbt(ident, sbt, pr, flags);
208 if (lock != NULL && class->lc_flags & LC_SLEEPABLE) {
209 sleepq_release(ident);
210 WITNESS_SAVE(lock, lock_witness);
211 lock_state = class->lc_unlock(lock);
214 if (sbt != 0 && catch)
215 rval = sleepq_timedwait_sig(ident, pri);
217 rval = sleepq_timedwait(ident, pri);
219 rval = sleepq_wait_sig(ident, pri);
221 sleepq_wait(ident, pri);
225 if (KTRPOINT(td, KTR_CSW))
229 if (lock != NULL && lock != &Giant.lock_object && !(priority & PDROP)) {
230 class->lc_lock(lock, lock_state);
231 WITNESS_RESTORE(lock, lock_witness);
237 msleep_spin_sbt(const void *ident, struct mtx *mtx, const char *wmesg,
238 sbintime_t sbt, sbintime_t pr, int flags)
242 WITNESS_SAVE_DECL(mtx);
245 KASSERT(mtx != NULL, ("sleeping without a mutex"));
246 KASSERT(ident != NULL, ("msleep_spin_sbt: NULL ident"));
247 KASSERT(TD_IS_RUNNING(td), ("msleep_spin_sbt: curthread not running"));
249 if (SCHEDULER_STOPPED_TD(td))
253 CTR5(KTR_PROC, "msleep_spin: thread %ld (pid %ld, %s) on %s (%p)",
254 td->td_tid, td->td_proc->p_pid, td->td_name, wmesg, ident);
257 mtx_assert(mtx, MA_OWNED | MA_NOTRECURSED);
258 WITNESS_SAVE(&mtx->lock_object, mtx);
259 mtx_unlock_spin(mtx);
262 * We put ourselves on the sleep queue and start our timeout.
264 sleepq_add(ident, &mtx->lock_object, wmesg, SLEEPQ_SLEEP, 0);
266 sleepq_set_timeout_sbt(ident, sbt, pr, flags);
269 * Can't call ktrace with any spin locks held so it can lock the
270 * ktrace_mtx lock, and WITNESS_WARN considers it an error to hold
271 * any spin lock. Thus, we have to drop the sleepq spin lock while
272 * we handle those requests. This is safe since we have placed our
273 * thread on the sleep queue already.
276 if (KTRPOINT(td, KTR_CSW)) {
277 sleepq_release(ident);
283 sleepq_release(ident);
284 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, "Sleeping on \"%s\"",
289 rval = sleepq_timedwait(ident, 0);
291 sleepq_wait(ident, 0);
295 if (KTRPOINT(td, KTR_CSW))
300 WITNESS_RESTORE(&mtx->lock_object, mtx);
305 * pause_sbt() delays the calling thread by the given signed binary
306 * time. During cold bootup, pause_sbt() uses the DELAY() function
307 * instead of the _sleep() function to do the waiting. The "sbt"
308 * argument must be greater than or equal to zero. A "sbt" value of
309 * zero is equivalent to a "sbt" value of one tick.
312 pause_sbt(const char *wmesg, sbintime_t sbt, sbintime_t pr, int flags)
314 KASSERT(sbt >= 0, ("pause_sbt: timeout must be >= 0"));
316 /* silently convert invalid timeouts */
320 if ((cold && curthread == &thread0) || kdb_active ||
321 SCHEDULER_STOPPED()) {
323 * We delay one second at a time to avoid overflowing the
324 * system specific DELAY() function(s):
326 while (sbt >= SBT_1S) {
330 /* Do the delay remainder, if any */
331 sbt = howmany(sbt, SBT_1US);
334 return (EWOULDBLOCK);
336 return (_sleep(&pause_wchan[curcpu], NULL,
337 (flags & C_CATCH) ? PCATCH : 0, wmesg, sbt, pr, flags));
341 * Make all threads sleeping on the specified identifier runnable.
344 wakeup(const void *ident)
349 wakeup_swapper = sleepq_broadcast(ident, SLEEPQ_SLEEP, 0, 0);
350 sleepq_release(ident);
351 if (wakeup_swapper) {
352 KASSERT(ident != &proc0,
353 ("wakeup and wakeup_swapper and proc0"));
359 * Make a thread sleeping on the specified identifier runnable.
360 * May wake more than one thread if a target thread is currently
364 wakeup_one(const void *ident)
369 wakeup_swapper = sleepq_signal(ident, SLEEPQ_SLEEP | SLEEPQ_DROP, 0, 0);
375 wakeup_any(const void *ident)
380 wakeup_swapper = sleepq_signal(ident, SLEEPQ_SLEEP | SLEEPQ_UNFAIR |
387 * Signal sleeping waiters after the counter has reached zero.
390 _blockcount_wakeup(blockcount_t *bc, u_int old)
393 KASSERT(_BLOCKCOUNT_WAITERS(old),
394 ("%s: no waiters on %p", __func__, bc));
396 if (atomic_cmpset_int(&bc->__count, _BLOCKCOUNT_WAITERS_FLAG, 0))
401 * Wait for a wakeup or a signal. This does not guarantee that the count is
402 * still zero on return. Callers wanting a precise answer should use
403 * blockcount_wait() with an interlock.
405 * If there is no work to wait for, return 0. If the sleep was interrupted by a
406 * signal, return EINTR or ERESTART, and return EAGAIN otherwise.
409 _blockcount_sleep(blockcount_t *bc, struct lock_object *lock, const char *wmesg,
413 uintptr_t lock_state;
418 KASSERT(lock != &Giant.lock_object,
419 ("%s: cannot use Giant as the interlock", __func__));
421 catch = (prio & PCATCH) != 0;
422 drop = (prio & PDROP) != 0;
426 * Synchronize with the fence in blockcount_release(). If we end up
427 * waiting, the sleepqueue lock acquisition will provide the required
430 * If there is no work to wait for, but waiters are present, try to put
431 * ourselves to sleep to avoid jumping ahead.
433 if (atomic_load_acq_int(&bc->__count) == 0) {
434 if (lock != NULL && drop)
435 LOCK_CLASS(lock)->lc_unlock(lock);
443 lock_state = LOCK_CLASS(lock)->lc_unlock(lock);
444 old = blockcount_read(bc);
447 if (_BLOCKCOUNT_COUNT(old) == 0) {
448 sleepq_release(wchan);
451 if (_BLOCKCOUNT_WAITERS(old))
453 } while (!atomic_fcmpset_int(&bc->__count, &old,
454 old | _BLOCKCOUNT_WAITERS_FLAG));
455 sleepq_add(wchan, NULL, wmesg, catch ? SLEEPQ_INTERRUPTIBLE : 0, 0);
457 ret = sleepq_wait_sig(wchan, prio);
459 sleepq_wait(wchan, prio);
465 if (lock != NULL && !drop)
466 LOCK_CLASS(lock)->lc_lock(lock, lock_state);
474 thread_unlock(curthread);
477 panic("%s: did not reenter debugger", __func__);
481 * The machine independent parts of context switching.
483 * The thread lock is required on entry and is no longer held on return.
488 uint64_t runtime, new_switchtime;
491 td = curthread; /* XXX */
492 THREAD_LOCK_ASSERT(td, MA_OWNED | MA_NOTRECURSED);
493 KASSERT(!TD_ON_RUNQ(td), ("mi_switch: called by old code"));
495 if (!TD_ON_LOCK(td) && !TD_IS_RUNNING(td))
496 mtx_assert(&Giant, MA_NOTOWNED);
498 KASSERT(td->td_critnest == 1 || KERNEL_PANICKED(),
499 ("mi_switch: switch in a critical section"));
500 KASSERT((flags & (SW_INVOL | SW_VOL)) != 0,
501 ("mi_switch: switch must be voluntary or involuntary"));
504 * Don't perform context switches from the debugger.
508 if (SCHEDULER_STOPPED_TD(td))
510 if (flags & SW_VOL) {
511 td->td_ru.ru_nvcsw++;
512 td->td_swvoltick = ticks;
514 td->td_ru.ru_nivcsw++;
515 td->td_swinvoltick = ticks;
518 SCHED_STAT_INC(sched_switch_stats[flags & SW_TYPE_MASK]);
521 * Compute the amount of time during which the current
522 * thread was running, and add that to its total so far.
524 new_switchtime = cpu_ticks();
525 runtime = new_switchtime - PCPU_GET(switchtime);
526 td->td_runtime += runtime;
527 td->td_incruntime += runtime;
528 PCPU_SET(switchtime, new_switchtime);
529 td->td_generation++; /* bump preempt-detect counter */
531 PCPU_SET(switchticks, ticks);
532 CTR4(KTR_PROC, "mi_switch: old thread %ld (td_sched %p, pid %ld, %s)",
533 td->td_tid, td_get_sched(td), td->td_proc->p_pid, td->td_name);
535 if (SDT_PROBES_ENABLED() &&
536 ((flags & SW_PREEMPT) != 0 || ((flags & SW_INVOL) != 0 &&
537 (flags & SW_TYPE_MASK) == SWT_NEEDRESCHED)))
538 SDT_PROBE0(sched, , , preempt);
540 sched_switch(td, flags);
541 CTR4(KTR_PROC, "mi_switch: new thread %ld (td_sched %p, pid %ld, %s)",
542 td->td_tid, td_get_sched(td), td->td_proc->p_pid, td->td_name);
545 * If the last thread was exiting, finish cleaning it up.
547 if ((td = PCPU_GET(deadthread))) {
548 PCPU_SET(deadthread, NULL);
555 * Change thread state to be runnable, placing it on the run queue if
556 * it is in memory. If it is swapped out, return true so our caller
557 * will know to awaken the swapper.
559 * Requires the thread lock on entry, drops on exit.
562 setrunnable(struct thread *td, int srqflags)
566 THREAD_LOCK_ASSERT(td, MA_OWNED);
567 KASSERT(td->td_proc->p_state != PRS_ZOMBIE,
568 ("setrunnable: pid %d is a zombie", td->td_proc->p_pid));
571 switch (td->td_state) {
576 KASSERT((td->td_flags & TDF_INMEM) != 0,
577 ("setrunnable: td %p not in mem, flags 0x%X inhibit 0x%X",
578 td, td->td_flags, td->td_inhibitors));
579 /* unlocks thread lock according to flags */
580 sched_wakeup(td, srqflags);
584 * If we are only inhibited because we are swapped out
585 * arrange to swap in this process.
587 if (td->td_inhibitors == TDI_SWAPPED &&
588 (td->td_flags & TDF_SWAPINREQ) == 0) {
589 td->td_flags |= TDF_SWAPINREQ;
594 panic("setrunnable: state 0x%x", td->td_state);
596 if ((srqflags & (SRQ_HOLD | SRQ_HOLDTD)) == 0)
603 * Compute a tenex style load average of a quantity on
604 * 1, 5 and 15 minute intervals.
615 for (i = 0; i < 3; i++)
616 avg->ldavg[i] = (cexp[i] * avg->ldavg[i] +
617 nrun * FSCALE * (FSCALE - cexp[i])) >> FSHIFT;
620 * Schedule the next update to occur after 5 seconds, but add a
621 * random variation to avoid synchronisation with processes that
622 * run at regular intervals.
624 callout_reset_sbt(&loadav_callout,
625 SBT_1US * (4000000 + (int)(random() % 2000001)), SBT_1US,
626 loadav, NULL, C_DIRECT_EXEC | C_PREL(32));
631 synch_setup(void *dummy)
633 callout_init(&loadav_callout, 1);
635 /* Kick off timeout driven events by calling first time. */
643 return ((u_int)ticks - (u_int)curthread->td_swvoltick >= hogticks);
651 kern_yield(PRI_USER);
662 if (prio == PRI_USER)
663 prio = td->td_user_pri;
665 sched_prio(td, prio);
666 mi_switch(SW_VOL | SWT_RELINQUISH);
671 * General purpose yield system call.
674 sys_yield(struct thread *td, struct yield_args *uap)
678 if (PRI_BASE(td->td_pri_class) == PRI_TIMESHARE)
679 sched_prio(td, PRI_MAX_TIMESHARE);
680 mi_switch(SW_VOL | SWT_RELINQUISH);
681 td->td_retval[0] = 0;