2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2002-2007, Jeffrey Roberson <jeff@freebsd.org>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice unmodified, this list of conditions, and the following
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
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.
30 * This file implements the ULE scheduler. ULE supports independent CPU
31 * run queues and fine grain locking. It has superior interactive
32 * performance under load even on uni-processor systems.
35 * ULE is the last three letters in schedule. It owes its name to a
36 * generic user created for a scheduling system by Paul Mikesell at
37 * Isilon Systems and a general lack of creativity on the part of the author.
40 #include <sys/cdefs.h>
41 __FBSDID("$FreeBSD$");
43 #include "opt_hwpmc_hooks.h"
44 #include "opt_sched.h"
46 #include <sys/param.h>
47 #include <sys/systm.h>
49 #include <sys/kernel.h>
51 #include <sys/limits.h>
53 #include <sys/mutex.h>
55 #include <sys/resource.h>
56 #include <sys/resourcevar.h>
57 #include <sys/sched.h>
61 #include <sys/sysctl.h>
62 #include <sys/sysproto.h>
63 #include <sys/turnstile.h>
65 #include <sys/vmmeter.h>
66 #include <sys/cpuset.h>
70 #include <sys/pmckern.h>
74 #include <sys/dtrace_bsd.h>
75 int __read_mostly dtrace_vtime_active;
76 dtrace_vtime_switch_func_t dtrace_vtime_switch_func;
79 #include <machine/cpu.h>
80 #include <machine/smp.h>
84 #define TS_NAME_LEN (MAXCOMLEN + sizeof(" td ") + sizeof(__XSTRING(UINT_MAX)))
85 #define TDQ_NAME_LEN (sizeof("sched lock ") + sizeof(__XSTRING(MAXCPU)))
86 #define TDQ_LOADNAME_LEN (sizeof("CPU ") + sizeof(__XSTRING(MAXCPU)) - 1 + sizeof(" load"))
89 * Thread scheduler specific section. All fields are protected
93 struct runq *ts_runq; /* Run-queue we're queued on. */
94 short ts_flags; /* TSF_* flags. */
95 int ts_cpu; /* CPU that we have affinity for. */
96 int ts_rltick; /* Real last tick, for affinity. */
97 int ts_slice; /* Ticks of slice remaining. */
98 u_int ts_slptime; /* Number of ticks we vol. slept */
99 u_int ts_runtime; /* Number of ticks we were running */
100 int ts_ltick; /* Last tick that we were running on */
101 int ts_ftick; /* First tick that we were running on */
102 int ts_ticks; /* Tick count */
104 char ts_name[TS_NAME_LEN];
107 /* flags kept in ts_flags */
108 #define TSF_BOUND 0x0001 /* Thread can not migrate. */
109 #define TSF_XFERABLE 0x0002 /* Thread was added as transferable. */
111 #define THREAD_CAN_MIGRATE(td) ((td)->td_pinned == 0)
112 #define THREAD_CAN_SCHED(td, cpu) \
113 CPU_ISSET((cpu), &(td)->td_cpuset->cs_mask)
115 _Static_assert(sizeof(struct thread) + sizeof(struct td_sched) <=
116 sizeof(struct thread0_storage),
117 "increase struct thread0_storage.t0st_sched size");
120 * Priority ranges used for interactive and non-interactive timeshare
121 * threads. The timeshare priorities are split up into four ranges.
122 * The first range handles interactive threads. The last three ranges
123 * (NHALF, x, and NHALF) handle non-interactive threads with the outer
124 * ranges supporting nice values.
126 #define PRI_TIMESHARE_RANGE (PRI_MAX_TIMESHARE - PRI_MIN_TIMESHARE + 1)
127 #define PRI_INTERACT_RANGE ((PRI_TIMESHARE_RANGE - SCHED_PRI_NRESV) / 2)
128 #define PRI_BATCH_RANGE (PRI_TIMESHARE_RANGE - PRI_INTERACT_RANGE)
130 #define PRI_MIN_INTERACT PRI_MIN_TIMESHARE
131 #define PRI_MAX_INTERACT (PRI_MIN_TIMESHARE + PRI_INTERACT_RANGE - 1)
132 #define PRI_MIN_BATCH (PRI_MIN_TIMESHARE + PRI_INTERACT_RANGE)
133 #define PRI_MAX_BATCH PRI_MAX_TIMESHARE
136 * Cpu percentage computation macros and defines.
138 * SCHED_TICK_SECS: Number of seconds to average the cpu usage across.
139 * SCHED_TICK_TARG: Number of hz ticks to average the cpu usage across.
140 * SCHED_TICK_MAX: Maximum number of ticks before scaling back.
141 * SCHED_TICK_SHIFT: Shift factor to avoid rounding away results.
142 * SCHED_TICK_HZ: Compute the number of hz ticks for a given ticks count.
143 * SCHED_TICK_TOTAL: Gives the amount of time we've been recording ticks.
145 #define SCHED_TICK_SECS 10
146 #define SCHED_TICK_TARG (hz * SCHED_TICK_SECS)
147 #define SCHED_TICK_MAX (SCHED_TICK_TARG + hz)
148 #define SCHED_TICK_SHIFT 10
149 #define SCHED_TICK_HZ(ts) ((ts)->ts_ticks >> SCHED_TICK_SHIFT)
150 #define SCHED_TICK_TOTAL(ts) (max((ts)->ts_ltick - (ts)->ts_ftick, hz))
153 * These macros determine priorities for non-interactive threads. They are
154 * assigned a priority based on their recent cpu utilization as expressed
155 * by the ratio of ticks to the tick total. NHALF priorities at the start
156 * and end of the MIN to MAX timeshare range are only reachable with negative
157 * or positive nice respectively.
159 * PRI_RANGE: Priority range for utilization dependent priorities.
160 * PRI_NRESV: Number of nice values.
161 * PRI_TICKS: Compute a priority in PRI_RANGE from the ticks count and total.
162 * PRI_NICE: Determines the part of the priority inherited from nice.
164 #define SCHED_PRI_NRESV (PRIO_MAX - PRIO_MIN)
165 #define SCHED_PRI_NHALF (SCHED_PRI_NRESV / 2)
166 #define SCHED_PRI_MIN (PRI_MIN_BATCH + SCHED_PRI_NHALF)
167 #define SCHED_PRI_MAX (PRI_MAX_BATCH - SCHED_PRI_NHALF)
168 #define SCHED_PRI_RANGE (SCHED_PRI_MAX - SCHED_PRI_MIN + 1)
169 #define SCHED_PRI_TICKS(ts) \
170 (SCHED_TICK_HZ((ts)) / \
171 (roundup(SCHED_TICK_TOTAL((ts)), SCHED_PRI_RANGE) / SCHED_PRI_RANGE))
172 #define SCHED_PRI_NICE(nice) (nice)
175 * These determine the interactivity of a process. Interactivity differs from
176 * cpu utilization in that it expresses the voluntary time slept vs time ran
177 * while cpu utilization includes all time not running. This more accurately
178 * models the intent of the thread.
180 * SLP_RUN_MAX: Maximum amount of sleep time + run time we'll accumulate
181 * before throttling back.
182 * SLP_RUN_FORK: Maximum slp+run time to inherit at fork time.
183 * INTERACT_MAX: Maximum interactivity value. Smaller is better.
184 * INTERACT_THRESH: Threshold for placement on the current runq.
186 #define SCHED_SLP_RUN_MAX ((hz * 5) << SCHED_TICK_SHIFT)
187 #define SCHED_SLP_RUN_FORK ((hz / 2) << SCHED_TICK_SHIFT)
188 #define SCHED_INTERACT_MAX (100)
189 #define SCHED_INTERACT_HALF (SCHED_INTERACT_MAX / 2)
190 #define SCHED_INTERACT_THRESH (30)
193 * These parameters determine the slice behavior for batch work.
195 #define SCHED_SLICE_DEFAULT_DIVISOR 10 /* ~94 ms, 12 stathz ticks. */
196 #define SCHED_SLICE_MIN_DIVISOR 6 /* DEFAULT/MIN = ~16 ms. */
198 /* Flags kept in td_flags. */
199 #define TDF_SLICEEND TDF_SCHED2 /* Thread time slice is over. */
202 * tickincr: Converts a stathz tick into a hz domain scaled by
203 * the shift factor. Without the shift the error rate
204 * due to rounding would be unacceptably high.
205 * realstathz: stathz is sometimes 0 and run off of hz.
206 * sched_slice: Runtime of each thread before rescheduling.
207 * preempt_thresh: Priority threshold for preemption and remote IPIs.
209 static int __read_mostly sched_interact = SCHED_INTERACT_THRESH;
210 static int __read_mostly tickincr = 8 << SCHED_TICK_SHIFT;
211 static int __read_mostly realstathz = 127; /* reset during boot. */
212 static int __read_mostly sched_slice = 10; /* reset during boot. */
213 static int __read_mostly sched_slice_min = 1; /* reset during boot. */
215 #ifdef FULL_PREEMPTION
216 static int __read_mostly preempt_thresh = PRI_MAX_IDLE;
218 static int __read_mostly preempt_thresh = PRI_MIN_KERN;
221 static int __read_mostly preempt_thresh = 0;
223 static int __read_mostly static_boost = PRI_MIN_BATCH;
224 static int __read_mostly sched_idlespins = 10000;
225 static int __read_mostly sched_idlespinthresh = -1;
228 * tdq - per processor runqs and statistics. All fields are protected by the
229 * tdq_lock. The load and lowpri may be accessed without to avoid excess
230 * locking in sched_pickcpu();
234 * Ordered to improve efficiency of cpu_search() and switch().
235 * tdq_lock is padded to avoid false sharing with tdq_load and
238 struct mtx_padalign tdq_lock; /* run queue lock. */
239 struct cpu_group *tdq_cg; /* Pointer to cpu topology. */
240 volatile int tdq_load; /* Aggregate load. */
241 volatile int tdq_cpu_idle; /* cpu_idle() is active. */
242 int tdq_sysload; /* For loadavg, !ITHD load. */
243 volatile int tdq_transferable; /* Transferable thread count. */
244 volatile short tdq_switchcnt; /* Switches this tick. */
245 volatile short tdq_oldswitchcnt; /* Switches last tick. */
246 u_char tdq_lowpri; /* Lowest priority thread. */
247 u_char tdq_ipipending; /* IPI pending. */
248 u_char tdq_idx; /* Current insert index. */
249 u_char tdq_ridx; /* Current removal index. */
250 int tdq_id; /* cpuid. */
251 struct runq tdq_realtime; /* real-time run queue. */
252 struct runq tdq_timeshare; /* timeshare run queue. */
253 struct runq tdq_idle; /* Queue of IDLE threads. */
254 char tdq_name[TDQ_NAME_LEN];
256 char tdq_loadname[TDQ_LOADNAME_LEN];
260 /* Idle thread states and config. */
261 #define TDQ_RUNNING 1
265 struct cpu_group __read_mostly *cpu_top; /* CPU topology */
267 #define SCHED_AFFINITY_DEFAULT (max(1, hz / 1000))
268 #define SCHED_AFFINITY(ts, t) ((ts)->ts_rltick > ticks - ((t) * affinity))
273 static int rebalance = 1;
274 static int balance_interval = 128; /* Default set in sched_initticks(). */
275 static int __read_mostly affinity;
276 static int __read_mostly steal_idle = 1;
277 static int __read_mostly steal_thresh = 2;
278 static int __read_mostly always_steal = 0;
279 static int __read_mostly trysteal_limit = 2;
282 * One thread queue per processor.
284 static struct tdq __read_mostly *balance_tdq;
285 static int balance_ticks;
286 DPCPU_DEFINE_STATIC(struct tdq, tdq);
287 DPCPU_DEFINE_STATIC(uint32_t, randomval);
289 #define TDQ_SELF() (DPCPU_PTR(tdq))
290 #define TDQ_CPU(x) (DPCPU_ID_PTR((x), tdq))
291 #define TDQ_ID(x) ((x)->tdq_id)
293 static struct tdq tdq_cpu;
295 #define TDQ_ID(x) (0)
296 #define TDQ_SELF() (&tdq_cpu)
297 #define TDQ_CPU(x) (&tdq_cpu)
300 #define TDQ_LOCK_ASSERT(t, type) mtx_assert(TDQ_LOCKPTR((t)), (type))
301 #define TDQ_LOCK(t) mtx_lock_spin(TDQ_LOCKPTR((t)))
302 #define TDQ_LOCK_FLAGS(t, f) mtx_lock_spin_flags(TDQ_LOCKPTR((t)), (f))
303 #define TDQ_UNLOCK(t) mtx_unlock_spin(TDQ_LOCKPTR((t)))
304 #define TDQ_LOCKPTR(t) ((struct mtx *)(&(t)->tdq_lock))
306 static void sched_priority(struct thread *);
307 static void sched_thread_priority(struct thread *, u_char);
308 static int sched_interact_score(struct thread *);
309 static void sched_interact_update(struct thread *);
310 static void sched_interact_fork(struct thread *);
311 static void sched_pctcpu_update(struct td_sched *, int);
313 /* Operations on per processor queues */
314 static struct thread *tdq_choose(struct tdq *);
315 static void tdq_setup(struct tdq *, int i);
316 static void tdq_load_add(struct tdq *, struct thread *);
317 static void tdq_load_rem(struct tdq *, struct thread *);
318 static __inline void tdq_runq_add(struct tdq *, struct thread *, int);
319 static __inline void tdq_runq_rem(struct tdq *, struct thread *);
320 static inline int sched_shouldpreempt(int, int, int);
321 void tdq_print(int cpu);
322 static void runq_print(struct runq *rq);
323 static void tdq_add(struct tdq *, struct thread *, int);
325 static struct thread *tdq_move(struct tdq *, struct tdq *);
326 static int tdq_idled(struct tdq *);
327 static void tdq_notify(struct tdq *, struct thread *);
328 static struct thread *tdq_steal(struct tdq *, int);
329 static struct thread *runq_steal(struct runq *, int);
330 static int sched_pickcpu(struct thread *, int);
331 static void sched_balance(void);
332 static int sched_balance_pair(struct tdq *, struct tdq *);
333 static inline struct tdq *sched_setcpu(struct thread *, int, int);
334 static inline void thread_unblock_switch(struct thread *, struct mtx *);
335 static struct mtx *sched_switch_migrate(struct tdq *, struct thread *, int);
336 static int sysctl_kern_sched_topology_spec(SYSCTL_HANDLER_ARGS);
337 static int sysctl_kern_sched_topology_spec_internal(struct sbuf *sb,
338 struct cpu_group *cg, int indent);
341 static void sched_setup(void *dummy);
342 SYSINIT(sched_setup, SI_SUB_RUN_QUEUE, SI_ORDER_FIRST, sched_setup, NULL);
344 static void sched_initticks(void *dummy);
345 SYSINIT(sched_initticks, SI_SUB_CLOCKS, SI_ORDER_THIRD, sched_initticks,
348 SDT_PROVIDER_DEFINE(sched);
350 SDT_PROBE_DEFINE3(sched, , , change__pri, "struct thread *",
351 "struct proc *", "uint8_t");
352 SDT_PROBE_DEFINE3(sched, , , dequeue, "struct thread *",
353 "struct proc *", "void *");
354 SDT_PROBE_DEFINE4(sched, , , enqueue, "struct thread *",
355 "struct proc *", "void *", "int");
356 SDT_PROBE_DEFINE4(sched, , , lend__pri, "struct thread *",
357 "struct proc *", "uint8_t", "struct thread *");
358 SDT_PROBE_DEFINE2(sched, , , load__change, "int", "int");
359 SDT_PROBE_DEFINE2(sched, , , off__cpu, "struct thread *",
361 SDT_PROBE_DEFINE(sched, , , on__cpu);
362 SDT_PROBE_DEFINE(sched, , , remain__cpu);
363 SDT_PROBE_DEFINE2(sched, , , surrender, "struct thread *",
367 * Print the threads waiting on a run-queue.
370 runq_print(struct runq *rq)
378 for (i = 0; i < RQB_LEN; i++) {
379 printf("\t\trunq bits %d 0x%zx\n",
380 i, rq->rq_status.rqb_bits[i]);
381 for (j = 0; j < RQB_BPW; j++)
382 if (rq->rq_status.rqb_bits[i] & (1ul << j)) {
383 pri = j + (i << RQB_L2BPW);
384 rqh = &rq->rq_queues[pri];
385 TAILQ_FOREACH(td, rqh, td_runq) {
386 printf("\t\t\ttd %p(%s) priority %d rqindex %d pri %d\n",
387 td, td->td_name, td->td_priority,
388 td->td_rqindex, pri);
395 * Print the status of a per-cpu thread queue. Should be a ddb show cmd.
404 printf("tdq %d:\n", TDQ_ID(tdq));
405 printf("\tlock %p\n", TDQ_LOCKPTR(tdq));
406 printf("\tLock name: %s\n", tdq->tdq_name);
407 printf("\tload: %d\n", tdq->tdq_load);
408 printf("\tswitch cnt: %d\n", tdq->tdq_switchcnt);
409 printf("\told switch cnt: %d\n", tdq->tdq_oldswitchcnt);
410 printf("\ttimeshare idx: %d\n", tdq->tdq_idx);
411 printf("\ttimeshare ridx: %d\n", tdq->tdq_ridx);
412 printf("\tload transferable: %d\n", tdq->tdq_transferable);
413 printf("\tlowest priority: %d\n", tdq->tdq_lowpri);
414 printf("\trealtime runq:\n");
415 runq_print(&tdq->tdq_realtime);
416 printf("\ttimeshare runq:\n");
417 runq_print(&tdq->tdq_timeshare);
418 printf("\tidle runq:\n");
419 runq_print(&tdq->tdq_idle);
423 sched_shouldpreempt(int pri, int cpri, int remote)
426 * If the new priority is not better than the current priority there is
432 * Always preempt idle.
434 if (cpri >= PRI_MIN_IDLE)
437 * If preemption is disabled don't preempt others.
439 if (preempt_thresh == 0)
442 * Preempt if we exceed the threshold.
444 if (pri <= preempt_thresh)
447 * If we're interactive or better and there is non-interactive
448 * or worse running preempt only remote processors.
450 if (remote && pri <= PRI_MAX_INTERACT && cpri > PRI_MAX_INTERACT)
456 * Add a thread to the actual run-queue. Keeps transferable counts up to
457 * date with what is actually on the run-queue. Selects the correct
458 * queue position for timeshare threads.
461 tdq_runq_add(struct tdq *tdq, struct thread *td, int flags)
466 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
467 THREAD_LOCK_ASSERT(td, MA_OWNED);
469 pri = td->td_priority;
470 ts = td_get_sched(td);
472 if (THREAD_CAN_MIGRATE(td)) {
473 tdq->tdq_transferable++;
474 ts->ts_flags |= TSF_XFERABLE;
476 if (pri < PRI_MIN_BATCH) {
477 ts->ts_runq = &tdq->tdq_realtime;
478 } else if (pri <= PRI_MAX_BATCH) {
479 ts->ts_runq = &tdq->tdq_timeshare;
480 KASSERT(pri <= PRI_MAX_BATCH && pri >= PRI_MIN_BATCH,
481 ("Invalid priority %d on timeshare runq", pri));
483 * This queue contains only priorities between MIN and MAX
484 * realtime. Use the whole queue to represent these values.
486 if ((flags & (SRQ_BORROWING|SRQ_PREEMPTED)) == 0) {
487 pri = RQ_NQS * (pri - PRI_MIN_BATCH) / PRI_BATCH_RANGE;
488 pri = (pri + tdq->tdq_idx) % RQ_NQS;
490 * This effectively shortens the queue by one so we
491 * can have a one slot difference between idx and
492 * ridx while we wait for threads to drain.
494 if (tdq->tdq_ridx != tdq->tdq_idx &&
495 pri == tdq->tdq_ridx)
496 pri = (unsigned char)(pri - 1) % RQ_NQS;
499 runq_add_pri(ts->ts_runq, td, pri, flags);
502 ts->ts_runq = &tdq->tdq_idle;
503 runq_add(ts->ts_runq, td, flags);
507 * Remove a thread from a run-queue. This typically happens when a thread
508 * is selected to run. Running threads are not on the queue and the
509 * transferable count does not reflect them.
512 tdq_runq_rem(struct tdq *tdq, struct thread *td)
516 ts = td_get_sched(td);
517 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
518 KASSERT(ts->ts_runq != NULL,
519 ("tdq_runq_remove: thread %p null ts_runq", td));
520 if (ts->ts_flags & TSF_XFERABLE) {
521 tdq->tdq_transferable--;
522 ts->ts_flags &= ~TSF_XFERABLE;
524 if (ts->ts_runq == &tdq->tdq_timeshare) {
525 if (tdq->tdq_idx != tdq->tdq_ridx)
526 runq_remove_idx(ts->ts_runq, td, &tdq->tdq_ridx);
528 runq_remove_idx(ts->ts_runq, td, NULL);
530 runq_remove(ts->ts_runq, td);
534 * Load is maintained for all threads RUNNING and ON_RUNQ. Add the load
535 * for this thread to the referenced thread queue.
538 tdq_load_add(struct tdq *tdq, struct thread *td)
541 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
542 THREAD_LOCK_ASSERT(td, MA_OWNED);
545 if ((td->td_flags & TDF_NOLOAD) == 0)
547 KTR_COUNTER0(KTR_SCHED, "load", tdq->tdq_loadname, tdq->tdq_load);
548 SDT_PROBE2(sched, , , load__change, (int)TDQ_ID(tdq), tdq->tdq_load);
552 * Remove the load from a thread that is transitioning to a sleep state or
556 tdq_load_rem(struct tdq *tdq, struct thread *td)
559 THREAD_LOCK_ASSERT(td, MA_OWNED);
560 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
561 KASSERT(tdq->tdq_load != 0,
562 ("tdq_load_rem: Removing with 0 load on queue %d", TDQ_ID(tdq)));
565 if ((td->td_flags & TDF_NOLOAD) == 0)
567 KTR_COUNTER0(KTR_SCHED, "load", tdq->tdq_loadname, tdq->tdq_load);
568 SDT_PROBE2(sched, , , load__change, (int)TDQ_ID(tdq), tdq->tdq_load);
572 * Bound timeshare latency by decreasing slice size as load increases. We
573 * consider the maximum latency as the sum of the threads waiting to run
574 * aside from curthread and target no more than sched_slice latency but
575 * no less than sched_slice_min runtime.
578 tdq_slice(struct tdq *tdq)
583 * It is safe to use sys_load here because this is called from
584 * contexts where timeshare threads are running and so there
585 * cannot be higher priority load in the system.
587 load = tdq->tdq_sysload - 1;
588 if (load >= SCHED_SLICE_MIN_DIVISOR)
589 return (sched_slice_min);
591 return (sched_slice);
592 return (sched_slice / load);
596 * Set lowpri to its exact value by searching the run-queue and
597 * evaluating curthread. curthread may be passed as an optimization.
600 tdq_setlowpri(struct tdq *tdq, struct thread *ctd)
604 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
606 ctd = pcpu_find(TDQ_ID(tdq))->pc_curthread;
607 td = tdq_choose(tdq);
608 if (td == NULL || td->td_priority > ctd->td_priority)
609 tdq->tdq_lowpri = ctd->td_priority;
611 tdq->tdq_lowpri = td->td_priority;
616 * We need some randomness. Implement a classic Linear Congruential
617 * Generator X_{n+1}=(aX_n+c) mod m. These values are optimized for
618 * m = 2^32, a = 69069 and c = 5. We only return the upper 16 bits
619 * of the random state (in the low bits of our answer) to keep
620 * the maximum randomness.
627 rndptr = DPCPU_PTR(randomval);
628 *rndptr = *rndptr * 69069 + 5;
630 return (*rndptr >> 16);
636 int cs_pri; /* Min priority for low. */
637 int cs_limit; /* Max load for low, min load for high. */
642 #define CPU_SEARCH_LOWEST 0x1
643 #define CPU_SEARCH_HIGHEST 0x2
644 #define CPU_SEARCH_BOTH (CPU_SEARCH_LOWEST|CPU_SEARCH_HIGHEST)
646 static __always_inline int cpu_search(const struct cpu_group *cg,
647 struct cpu_search *low, struct cpu_search *high, const int match);
648 int __noinline cpu_search_lowest(const struct cpu_group *cg,
649 struct cpu_search *low);
650 int __noinline cpu_search_highest(const struct cpu_group *cg,
651 struct cpu_search *high);
652 int __noinline cpu_search_both(const struct cpu_group *cg,
653 struct cpu_search *low, struct cpu_search *high);
656 * Search the tree of cpu_groups for the lowest or highest loaded cpu
657 * according to the match argument. This routine actually compares the
658 * load on all paths through the tree and finds the least loaded cpu on
659 * the least loaded path, which may differ from the least loaded cpu in
660 * the system. This balances work among caches and buses.
662 * This inline is instantiated in three forms below using constants for the
663 * match argument. It is reduced to the minimum set for each case. It is
664 * also recursive to the depth of the tree.
666 static __always_inline int
667 cpu_search(const struct cpu_group *cg, struct cpu_search *low,
668 struct cpu_search *high, const int match)
670 struct cpu_search lgroup;
671 struct cpu_search hgroup;
673 struct cpu_group *child;
675 int cpu, i, hload, lload, load, total, rnd;
678 cpumask = cg->cg_mask;
679 if (match & CPU_SEARCH_LOWEST) {
683 if (match & CPU_SEARCH_HIGHEST) {
688 /* Iterate through the child CPU groups and then remaining CPUs. */
689 for (i = cg->cg_children, cpu = mp_maxid; ; ) {
691 #ifdef HAVE_INLINE_FFSL
692 cpu = CPU_FFS(&cpumask) - 1;
694 while (cpu >= 0 && !CPU_ISSET(cpu, &cpumask))
701 child = &cg->cg_child[i - 1];
703 if (match & CPU_SEARCH_LOWEST)
705 if (match & CPU_SEARCH_HIGHEST)
707 if (child) { /* Handle child CPU group. */
708 CPU_NAND(&cpumask, &child->cg_mask);
710 case CPU_SEARCH_LOWEST:
711 load = cpu_search_lowest(child, &lgroup);
713 case CPU_SEARCH_HIGHEST:
714 load = cpu_search_highest(child, &hgroup);
716 case CPU_SEARCH_BOTH:
717 load = cpu_search_both(child, &lgroup, &hgroup);
720 } else { /* Handle child CPU. */
721 CPU_CLR(cpu, &cpumask);
723 load = tdq->tdq_load * 256;
724 rnd = sched_random() % 32;
725 if (match & CPU_SEARCH_LOWEST) {
726 if (cpu == low->cs_prefer)
728 /* If that CPU is allowed and get data. */
729 if (tdq->tdq_lowpri > lgroup.cs_pri &&
730 tdq->tdq_load <= lgroup.cs_limit &&
731 CPU_ISSET(cpu, &lgroup.cs_mask)) {
733 lgroup.cs_load = load - rnd;
736 if (match & CPU_SEARCH_HIGHEST)
737 if (tdq->tdq_load >= hgroup.cs_limit &&
738 tdq->tdq_transferable &&
739 CPU_ISSET(cpu, &hgroup.cs_mask)) {
741 hgroup.cs_load = load - rnd;
746 /* We have info about child item. Compare it. */
747 if (match & CPU_SEARCH_LOWEST) {
748 if (lgroup.cs_cpu >= 0 &&
750 (load == lload && lgroup.cs_load < low->cs_load))) {
752 low->cs_cpu = lgroup.cs_cpu;
753 low->cs_load = lgroup.cs_load;
756 if (match & CPU_SEARCH_HIGHEST)
757 if (hgroup.cs_cpu >= 0 &&
759 (load == hload && hgroup.cs_load > high->cs_load))) {
761 high->cs_cpu = hgroup.cs_cpu;
762 high->cs_load = hgroup.cs_load;
766 if (i == 0 && CPU_EMPTY(&cpumask))
769 #ifndef HAVE_INLINE_FFSL
778 * cpu_search instantiations must pass constants to maintain the inline
782 cpu_search_lowest(const struct cpu_group *cg, struct cpu_search *low)
784 return cpu_search(cg, low, NULL, CPU_SEARCH_LOWEST);
788 cpu_search_highest(const struct cpu_group *cg, struct cpu_search *high)
790 return cpu_search(cg, NULL, high, CPU_SEARCH_HIGHEST);
794 cpu_search_both(const struct cpu_group *cg, struct cpu_search *low,
795 struct cpu_search *high)
797 return cpu_search(cg, low, high, CPU_SEARCH_BOTH);
801 * Find the cpu with the least load via the least loaded path that has a
802 * lowpri greater than pri pri. A pri of -1 indicates any priority is
806 sched_lowest(const struct cpu_group *cg, cpuset_t mask, int pri, int maxload,
809 struct cpu_search low;
812 low.cs_prefer = prefer;
815 low.cs_limit = maxload;
816 cpu_search_lowest(cg, &low);
821 * Find the cpu with the highest load via the highest loaded path.
824 sched_highest(const struct cpu_group *cg, cpuset_t mask, int minload)
826 struct cpu_search high;
830 high.cs_limit = minload;
831 cpu_search_highest(cg, &high);
836 sched_balance_group(struct cpu_group *cg)
839 cpuset_t hmask, lmask;
840 int high, low, anylow;
844 high = sched_highest(cg, hmask, 2);
845 /* Stop if there is no more CPU with transferrable threads. */
848 CPU_CLR(high, &hmask);
849 CPU_COPY(&hmask, &lmask);
850 /* Stop if there is no more CPU left for low. */
851 if (CPU_EMPTY(&lmask))
856 low = sched_lowest(cg, lmask, -1, tdq->tdq_load - 1, high);
857 /* Stop if we looked well and found no less loaded CPU. */
858 if (anylow && low == -1)
860 /* Go to next high if we found no less loaded CPU. */
863 /* Transfer thread from high to low. */
864 if (sched_balance_pair(tdq, TDQ_CPU(low))) {
865 /* CPU that got thread can no longer be a donor. */
866 CPU_CLR(low, &hmask);
869 * If failed, then there is no threads on high
870 * that can run on this low. Drop low from low
871 * mask and look for different one.
873 CPU_CLR(low, &lmask);
885 balance_ticks = max(balance_interval / 2, 1) +
886 (sched_random() % balance_interval);
889 sched_balance_group(cpu_top);
894 * Lock two thread queues using their address to maintain lock order.
897 tdq_lock_pair(struct tdq *one, struct tdq *two)
901 TDQ_LOCK_FLAGS(two, MTX_DUPOK);
904 TDQ_LOCK_FLAGS(one, MTX_DUPOK);
909 * Unlock two thread queues. Order is not important here.
912 tdq_unlock_pair(struct tdq *one, struct tdq *two)
919 * Transfer load between two imbalanced thread queues.
922 sched_balance_pair(struct tdq *high, struct tdq *low)
927 tdq_lock_pair(high, low);
930 * Transfer a thread from high to low.
932 if (high->tdq_transferable != 0 && high->tdq_load > low->tdq_load &&
933 (td = tdq_move(high, low)) != NULL) {
935 * In case the target isn't the current cpu notify it of the
936 * new load, possibly sending an IPI to force it to reschedule.
939 if (cpu != PCPU_GET(cpuid))
942 tdq_unlock_pair(high, low);
947 * Move a thread from one thread queue to another.
949 static struct thread *
950 tdq_move(struct tdq *from, struct tdq *to)
957 TDQ_LOCK_ASSERT(from, MA_OWNED);
958 TDQ_LOCK_ASSERT(to, MA_OWNED);
962 td = tdq_steal(tdq, cpu);
965 ts = td_get_sched(td);
967 * Although the run queue is locked the thread may be blocked. Lock
968 * it to clear this and acquire the run-queue lock.
971 /* Drop recursive lock on from acquired via thread_lock(). */
975 td->td_lock = TDQ_LOCKPTR(to);
976 tdq_add(to, td, SRQ_YIELDING);
981 * This tdq has idled. Try to steal a thread from another cpu and switch
985 tdq_idled(struct tdq *tdq)
987 struct cpu_group *cg;
992 if (smp_started == 0 || steal_idle == 0 || tdq->tdq_cg == NULL)
995 CPU_CLR(PCPU_GET(cpuid), &mask);
997 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
998 for (cg = tdq->tdq_cg; ; ) {
999 cpu = sched_highest(cg, mask, steal_thresh);
1001 * We were assigned a thread but not preempted. Returning
1002 * 0 here will cause our caller to switch to it.
1012 steal = TDQ_CPU(cpu);
1014 * The data returned by sched_highest() is stale and
1015 * the chosen CPU no longer has an eligible thread.
1017 * Testing this ahead of tdq_lock_pair() only catches
1018 * this situation about 20% of the time on an 8 core
1019 * 16 thread Ryzen 7, but it still helps performance.
1021 if (steal->tdq_load < steal_thresh ||
1022 steal->tdq_transferable == 0)
1024 tdq_lock_pair(tdq, steal);
1026 * We were assigned a thread while waiting for the locks.
1027 * Switch to it now instead of stealing a thread.
1032 * The data returned by sched_highest() is stale and
1033 * the chosen CPU no longer has an eligible thread, or
1034 * we were preempted and the CPU loading info may be out
1035 * of date. The latter is rare. In either case restart
1038 if (steal->tdq_load < steal_thresh ||
1039 steal->tdq_transferable == 0 ||
1040 switchcnt != tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt) {
1041 tdq_unlock_pair(tdq, steal);
1045 * Steal the thread and switch to it.
1047 if (tdq_move(steal, tdq) != NULL)
1050 * We failed to acquire a thread even though it looked
1051 * like one was available. This could be due to affinity
1052 * restrictions or for other reasons. Loop again after
1053 * removing this CPU from the set. The restart logic
1054 * above does not restore this CPU to the set due to the
1055 * likelyhood of failing here again.
1057 CPU_CLR(cpu, &mask);
1058 tdq_unlock_pair(tdq, steal);
1061 mi_switch(SW_VOL | SWT_IDLE, NULL);
1062 thread_unlock(curthread);
1067 * Notify a remote cpu of new work. Sends an IPI if criteria are met.
1070 tdq_notify(struct tdq *tdq, struct thread *td)
1076 if (tdq->tdq_ipipending)
1078 cpu = td_get_sched(td)->ts_cpu;
1079 pri = td->td_priority;
1080 ctd = pcpu_find(cpu)->pc_curthread;
1081 if (!sched_shouldpreempt(pri, ctd->td_priority, 1))
1085 * Make sure that our caller's earlier update to tdq_load is
1086 * globally visible before we read tdq_cpu_idle. Idle thread
1087 * accesses both of them without locks, and the order is important.
1089 atomic_thread_fence_seq_cst();
1091 if (TD_IS_IDLETHREAD(ctd)) {
1093 * If the MD code has an idle wakeup routine try that before
1094 * falling back to IPI.
1096 if (!tdq->tdq_cpu_idle || cpu_idle_wakeup(cpu))
1099 tdq->tdq_ipipending = 1;
1100 ipi_cpu(cpu, IPI_PREEMPT);
1104 * Steals load from a timeshare queue. Honors the rotating queue head
1107 static struct thread *
1108 runq_steal_from(struct runq *rq, int cpu, u_char start)
1112 struct thread *td, *first;
1116 rqb = &rq->rq_status;
1117 bit = start & (RQB_BPW -1);
1120 for (i = RQB_WORD(start); i < RQB_LEN; bit = 0, i++) {
1121 if (rqb->rqb_bits[i] == 0)
1124 bit = RQB_FFS(rqb->rqb_bits[i]);
1125 for (; bit < RQB_BPW; bit++) {
1126 if ((rqb->rqb_bits[i] & (1ul << bit)) == 0)
1128 rqh = &rq->rq_queues[bit + (i << RQB_L2BPW)];
1129 TAILQ_FOREACH(td, rqh, td_runq) {
1131 if (THREAD_CAN_MIGRATE(td) &&
1132 THREAD_CAN_SCHED(td, cpu))
1144 if (first && THREAD_CAN_MIGRATE(first) &&
1145 THREAD_CAN_SCHED(first, cpu))
1151 * Steals load from a standard linear queue.
1153 static struct thread *
1154 runq_steal(struct runq *rq, int cpu)
1162 rqb = &rq->rq_status;
1163 for (word = 0; word < RQB_LEN; word++) {
1164 if (rqb->rqb_bits[word] == 0)
1166 for (bit = 0; bit < RQB_BPW; bit++) {
1167 if ((rqb->rqb_bits[word] & (1ul << bit)) == 0)
1169 rqh = &rq->rq_queues[bit + (word << RQB_L2BPW)];
1170 TAILQ_FOREACH(td, rqh, td_runq)
1171 if (THREAD_CAN_MIGRATE(td) &&
1172 THREAD_CAN_SCHED(td, cpu))
1180 * Attempt to steal a thread in priority order from a thread queue.
1182 static struct thread *
1183 tdq_steal(struct tdq *tdq, int cpu)
1187 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
1188 if ((td = runq_steal(&tdq->tdq_realtime, cpu)) != NULL)
1190 if ((td = runq_steal_from(&tdq->tdq_timeshare,
1191 cpu, tdq->tdq_ridx)) != NULL)
1193 return (runq_steal(&tdq->tdq_idle, cpu));
1197 * Sets the thread lock and ts_cpu to match the requested cpu. Unlocks the
1198 * current lock and returns with the assigned queue locked.
1200 static inline struct tdq *
1201 sched_setcpu(struct thread *td, int cpu, int flags)
1206 THREAD_LOCK_ASSERT(td, MA_OWNED);
1208 td_get_sched(td)->ts_cpu = cpu;
1210 * If the lock matches just return the queue.
1212 if (td->td_lock == TDQ_LOCKPTR(tdq))
1216 * If the thread isn't running its lockptr is a
1217 * turnstile or a sleepqueue. We can just lock_set without
1220 if (TD_CAN_RUN(td)) {
1222 thread_lock_set(td, TDQ_LOCKPTR(tdq));
1227 * The hard case, migration, we need to block the thread first to
1228 * prevent order reversals with other cpus locks.
1231 thread_lock_block(td);
1233 thread_lock_unblock(td, TDQ_LOCKPTR(tdq));
1238 SCHED_STAT_DEFINE(pickcpu_intrbind, "Soft interrupt binding");
1239 SCHED_STAT_DEFINE(pickcpu_idle_affinity, "Picked idle cpu based on affinity");
1240 SCHED_STAT_DEFINE(pickcpu_affinity, "Picked cpu based on affinity");
1241 SCHED_STAT_DEFINE(pickcpu_lowest, "Selected lowest load");
1242 SCHED_STAT_DEFINE(pickcpu_local, "Migrated to current cpu");
1243 SCHED_STAT_DEFINE(pickcpu_migration, "Selection may have caused migration");
1246 sched_pickcpu(struct thread *td, int flags)
1248 struct cpu_group *cg, *ccg;
1249 struct td_sched *ts;
1252 int cpu, pri, self, intr;
1254 self = PCPU_GET(cpuid);
1255 ts = td_get_sched(td);
1256 KASSERT(!CPU_ABSENT(ts->ts_cpu), ("sched_pickcpu: Start scheduler on "
1257 "absent CPU %d for thread %s.", ts->ts_cpu, td->td_name));
1258 if (smp_started == 0)
1261 * Don't migrate a running thread from sched_switch().
1263 if ((flags & SRQ_OURSELF) || !THREAD_CAN_MIGRATE(td))
1264 return (ts->ts_cpu);
1266 * Prefer to run interrupt threads on the processors that generate
1269 if (td->td_priority <= PRI_MAX_ITHD && THREAD_CAN_SCHED(td, self) &&
1270 curthread->td_intr_nesting_level) {
1272 if (tdq->tdq_lowpri >= PRI_MIN_IDLE) {
1273 SCHED_STAT_INC(pickcpu_idle_affinity);
1282 tdq = TDQ_CPU(ts->ts_cpu);
1286 * If the thread can run on the last cpu and the affinity has not
1287 * expired and it is idle, run it there.
1289 if (THREAD_CAN_SCHED(td, ts->ts_cpu) &&
1290 tdq->tdq_lowpri >= PRI_MIN_IDLE &&
1291 SCHED_AFFINITY(ts, CG_SHARE_L2)) {
1292 if (cg->cg_flags & CG_FLAG_THREAD) {
1293 /* Check all SMT threads for being idle. */
1294 for (cpu = CPU_FFS(&cg->cg_mask) - 1; ; cpu++) {
1295 if (CPU_ISSET(cpu, &cg->cg_mask) &&
1296 TDQ_CPU(cpu)->tdq_lowpri < PRI_MIN_IDLE)
1298 if (cpu >= mp_maxid) {
1299 SCHED_STAT_INC(pickcpu_idle_affinity);
1300 return (ts->ts_cpu);
1304 SCHED_STAT_INC(pickcpu_idle_affinity);
1305 return (ts->ts_cpu);
1310 * Search for the last level cache CPU group in the tree.
1311 * Skip SMT, identical groups and caches with expired affinity.
1312 * Interrupt threads affinity is explicit and never expires.
1314 for (ccg = NULL; cg != NULL; cg = cg->cg_parent) {
1315 if (cg->cg_flags & CG_FLAG_THREAD)
1317 if (cg->cg_children == 1 || cg->cg_count == 1)
1319 if (cg->cg_level == CG_SHARE_NONE ||
1320 (!intr && !SCHED_AFFINITY(ts, cg->cg_level)))
1324 /* Found LLC shared by all CPUs, so do a global search. */
1328 mask = td->td_cpuset->cs_mask;
1329 pri = td->td_priority;
1331 * Try hard to keep interrupts within found LLC. Search the LLC for
1332 * the least loaded CPU we can run now. For NUMA systems it should
1333 * be within target domain, and it also reduces scheduling overhead.
1335 if (ccg != NULL && intr) {
1336 cpu = sched_lowest(ccg, mask, pri, INT_MAX, ts->ts_cpu);
1338 SCHED_STAT_INC(pickcpu_intrbind);
1340 /* Search the LLC for the least loaded idle CPU we can run now. */
1342 cpu = sched_lowest(ccg, mask, max(pri, PRI_MAX_TIMESHARE),
1343 INT_MAX, ts->ts_cpu);
1345 SCHED_STAT_INC(pickcpu_affinity);
1347 /* Search globally for the least loaded CPU we can run now. */
1349 cpu = sched_lowest(cpu_top, mask, pri, INT_MAX, ts->ts_cpu);
1351 SCHED_STAT_INC(pickcpu_lowest);
1353 /* Search globally for the least loaded CPU. */
1355 cpu = sched_lowest(cpu_top, mask, -1, INT_MAX, ts->ts_cpu);
1357 SCHED_STAT_INC(pickcpu_lowest);
1359 KASSERT(cpu >= 0, ("sched_pickcpu: Failed to find a cpu."));
1360 KASSERT(!CPU_ABSENT(cpu), ("sched_pickcpu: Picked absent CPU %d.", cpu));
1362 * Compare the lowest loaded cpu to current cpu.
1365 if (THREAD_CAN_SCHED(td, self) && TDQ_SELF()->tdq_lowpri > pri &&
1366 tdq->tdq_lowpri < PRI_MIN_IDLE &&
1367 TDQ_SELF()->tdq_load <= tdq->tdq_load + 1) {
1368 SCHED_STAT_INC(pickcpu_local);
1371 if (cpu != ts->ts_cpu)
1372 SCHED_STAT_INC(pickcpu_migration);
1378 * Pick the highest priority task we have and return it.
1380 static struct thread *
1381 tdq_choose(struct tdq *tdq)
1385 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
1386 td = runq_choose(&tdq->tdq_realtime);
1389 td = runq_choose_from(&tdq->tdq_timeshare, tdq->tdq_ridx);
1391 KASSERT(td->td_priority >= PRI_MIN_BATCH,
1392 ("tdq_choose: Invalid priority on timeshare queue %d",
1396 td = runq_choose(&tdq->tdq_idle);
1398 KASSERT(td->td_priority >= PRI_MIN_IDLE,
1399 ("tdq_choose: Invalid priority on idle queue %d",
1408 * Initialize a thread queue.
1411 tdq_setup(struct tdq *tdq, int id)
1415 printf("ULE: setup cpu %d\n", id);
1416 runq_init(&tdq->tdq_realtime);
1417 runq_init(&tdq->tdq_timeshare);
1418 runq_init(&tdq->tdq_idle);
1420 snprintf(tdq->tdq_name, sizeof(tdq->tdq_name),
1421 "sched lock %d", (int)TDQ_ID(tdq));
1422 mtx_init(&tdq->tdq_lock, tdq->tdq_name, "sched lock",
1423 MTX_SPIN | MTX_RECURSE);
1425 snprintf(tdq->tdq_loadname, sizeof(tdq->tdq_loadname),
1426 "CPU %d load", (int)TDQ_ID(tdq));
1432 sched_setup_smp(void)
1437 cpu_top = smp_topo();
1439 tdq = DPCPU_ID_PTR(i, tdq);
1441 tdq->tdq_cg = smp_topo_find(cpu_top, i);
1442 if (tdq->tdq_cg == NULL)
1443 panic("Can't find cpu group for %d\n", i);
1445 balance_tdq = TDQ_SELF();
1450 * Setup the thread queues and initialize the topology based on MD
1454 sched_setup(void *dummy)
1461 tdq_setup(TDQ_SELF(), 0);
1465 /* Add thread0's load since it's running. */
1467 thread0.td_lock = TDQ_LOCKPTR(TDQ_SELF());
1468 tdq_load_add(tdq, &thread0);
1469 tdq->tdq_lowpri = thread0.td_priority;
1474 * This routine determines time constants after stathz and hz are setup.
1478 sched_initticks(void *dummy)
1482 realstathz = stathz ? stathz : hz;
1483 sched_slice = realstathz / SCHED_SLICE_DEFAULT_DIVISOR;
1484 sched_slice_min = sched_slice / SCHED_SLICE_MIN_DIVISOR;
1485 hogticks = imax(1, (2 * hz * sched_slice + realstathz / 2) /
1489 * tickincr is shifted out by 10 to avoid rounding errors due to
1490 * hz not being evenly divisible by stathz on all platforms.
1492 incr = (hz << SCHED_TICK_SHIFT) / realstathz;
1494 * This does not work for values of stathz that are more than
1495 * 1 << SCHED_TICK_SHIFT * hz. In practice this does not happen.
1502 * Set the default balance interval now that we know
1503 * what realstathz is.
1505 balance_interval = realstathz;
1506 balance_ticks = balance_interval;
1507 affinity = SCHED_AFFINITY_DEFAULT;
1509 if (sched_idlespinthresh < 0)
1510 sched_idlespinthresh = 2 * max(10000, 6 * hz) / realstathz;
1515 * This is the core of the interactivity algorithm. Determines a score based
1516 * on past behavior. It is the ratio of sleep time to run time scaled to
1517 * a [0, 100] integer. This is the voluntary sleep time of a process, which
1518 * differs from the cpu usage because it does not account for time spent
1519 * waiting on a run-queue. Would be prettier if we had floating point.
1521 * When a thread's sleep time is greater than its run time the
1525 * interactivity score = ---------------------
1526 * sleep time / run time
1529 * When a thread's run time is greater than its sleep time the
1533 * interactivity score = --------------------- + scaling factor
1534 * run time / sleep time
1537 sched_interact_score(struct thread *td)
1539 struct td_sched *ts;
1542 ts = td_get_sched(td);
1544 * The score is only needed if this is likely to be an interactive
1545 * task. Don't go through the expense of computing it if there's
1548 if (sched_interact <= SCHED_INTERACT_HALF &&
1549 ts->ts_runtime >= ts->ts_slptime)
1550 return (SCHED_INTERACT_HALF);
1552 if (ts->ts_runtime > ts->ts_slptime) {
1553 div = max(1, ts->ts_runtime / SCHED_INTERACT_HALF);
1554 return (SCHED_INTERACT_HALF +
1555 (SCHED_INTERACT_HALF - (ts->ts_slptime / div)));
1557 if (ts->ts_slptime > ts->ts_runtime) {
1558 div = max(1, ts->ts_slptime / SCHED_INTERACT_HALF);
1559 return (ts->ts_runtime / div);
1561 /* runtime == slptime */
1563 return (SCHED_INTERACT_HALF);
1566 * This can happen if slptime and runtime are 0.
1573 * Scale the scheduling priority according to the "interactivity" of this
1577 sched_priority(struct thread *td)
1582 if (PRI_BASE(td->td_pri_class) != PRI_TIMESHARE)
1585 * If the score is interactive we place the thread in the realtime
1586 * queue with a priority that is less than kernel and interrupt
1587 * priorities. These threads are not subject to nice restrictions.
1589 * Scores greater than this are placed on the normal timeshare queue
1590 * where the priority is partially decided by the most recent cpu
1591 * utilization and the rest is decided by nice value.
1593 * The nice value of the process has a linear effect on the calculated
1594 * score. Negative nice values make it easier for a thread to be
1595 * considered interactive.
1597 score = imax(0, sched_interact_score(td) + td->td_proc->p_nice);
1598 if (score < sched_interact) {
1599 pri = PRI_MIN_INTERACT;
1600 pri += ((PRI_MAX_INTERACT - PRI_MIN_INTERACT + 1) /
1601 sched_interact) * score;
1602 KASSERT(pri >= PRI_MIN_INTERACT && pri <= PRI_MAX_INTERACT,
1603 ("sched_priority: invalid interactive priority %d score %d",
1606 pri = SCHED_PRI_MIN;
1607 if (td_get_sched(td)->ts_ticks)
1608 pri += min(SCHED_PRI_TICKS(td_get_sched(td)),
1609 SCHED_PRI_RANGE - 1);
1610 pri += SCHED_PRI_NICE(td->td_proc->p_nice);
1611 KASSERT(pri >= PRI_MIN_BATCH && pri <= PRI_MAX_BATCH,
1612 ("sched_priority: invalid priority %d: nice %d, "
1613 "ticks %d ftick %d ltick %d tick pri %d",
1614 pri, td->td_proc->p_nice, td_get_sched(td)->ts_ticks,
1615 td_get_sched(td)->ts_ftick, td_get_sched(td)->ts_ltick,
1616 SCHED_PRI_TICKS(td_get_sched(td))));
1618 sched_user_prio(td, pri);
1624 * This routine enforces a maximum limit on the amount of scheduling history
1625 * kept. It is called after either the slptime or runtime is adjusted. This
1626 * function is ugly due to integer math.
1629 sched_interact_update(struct thread *td)
1631 struct td_sched *ts;
1634 ts = td_get_sched(td);
1635 sum = ts->ts_runtime + ts->ts_slptime;
1636 if (sum < SCHED_SLP_RUN_MAX)
1639 * This only happens from two places:
1640 * 1) We have added an unusual amount of run time from fork_exit.
1641 * 2) We have added an unusual amount of sleep time from sched_sleep().
1643 if (sum > SCHED_SLP_RUN_MAX * 2) {
1644 if (ts->ts_runtime > ts->ts_slptime) {
1645 ts->ts_runtime = SCHED_SLP_RUN_MAX;
1648 ts->ts_slptime = SCHED_SLP_RUN_MAX;
1654 * If we have exceeded by more than 1/5th then the algorithm below
1655 * will not bring us back into range. Dividing by two here forces
1656 * us into the range of [4/5 * SCHED_INTERACT_MAX, SCHED_INTERACT_MAX]
1658 if (sum > (SCHED_SLP_RUN_MAX / 5) * 6) {
1659 ts->ts_runtime /= 2;
1660 ts->ts_slptime /= 2;
1663 ts->ts_runtime = (ts->ts_runtime / 5) * 4;
1664 ts->ts_slptime = (ts->ts_slptime / 5) * 4;
1668 * Scale back the interactivity history when a child thread is created. The
1669 * history is inherited from the parent but the thread may behave totally
1670 * differently. For example, a shell spawning a compiler process. We want
1671 * to learn that the compiler is behaving badly very quickly.
1674 sched_interact_fork(struct thread *td)
1676 struct td_sched *ts;
1680 ts = td_get_sched(td);
1681 sum = ts->ts_runtime + ts->ts_slptime;
1682 if (sum > SCHED_SLP_RUN_FORK) {
1683 ratio = sum / SCHED_SLP_RUN_FORK;
1684 ts->ts_runtime /= ratio;
1685 ts->ts_slptime /= ratio;
1690 * Called from proc0_init() to setup the scheduler fields.
1695 struct td_sched *ts0;
1698 * Set up the scheduler specific parts of thread0.
1700 ts0 = td_get_sched(&thread0);
1701 ts0->ts_ltick = ticks;
1702 ts0->ts_ftick = ticks;
1704 ts0->ts_cpu = curcpu; /* set valid CPU number */
1708 * This is only somewhat accurate since given many processes of the same
1709 * priority they will switch when their slices run out, which will be
1710 * at most sched_slice stathz ticks.
1713 sched_rr_interval(void)
1716 /* Convert sched_slice from stathz to hz. */
1717 return (imax(1, (sched_slice * hz + realstathz / 2) / realstathz));
1721 * Update the percent cpu tracking information when it is requested or
1722 * the total history exceeds the maximum. We keep a sliding history of
1723 * tick counts that slowly decays. This is less precise than the 4BSD
1724 * mechanism since it happens with less regular and frequent events.
1727 sched_pctcpu_update(struct td_sched *ts, int run)
1732 * The signed difference may be negative if the thread hasn't run for
1733 * over half of the ticks rollover period.
1735 if ((u_int)(t - ts->ts_ltick) >= SCHED_TICK_TARG) {
1737 ts->ts_ftick = t - SCHED_TICK_TARG;
1738 } else if (t - ts->ts_ftick >= SCHED_TICK_MAX) {
1739 ts->ts_ticks = (ts->ts_ticks / (ts->ts_ltick - ts->ts_ftick)) *
1740 (ts->ts_ltick - (t - SCHED_TICK_TARG));
1741 ts->ts_ftick = t - SCHED_TICK_TARG;
1744 ts->ts_ticks += (t - ts->ts_ltick) << SCHED_TICK_SHIFT;
1749 * Adjust the priority of a thread. Move it to the appropriate run-queue
1750 * if necessary. This is the back-end for several priority related
1754 sched_thread_priority(struct thread *td, u_char prio)
1756 struct td_sched *ts;
1760 KTR_POINT3(KTR_SCHED, "thread", sched_tdname(td), "prio",
1761 "prio:%d", td->td_priority, "new prio:%d", prio,
1762 KTR_ATTR_LINKED, sched_tdname(curthread));
1763 SDT_PROBE3(sched, , , change__pri, td, td->td_proc, prio);
1764 if (td != curthread && prio < td->td_priority) {
1765 KTR_POINT3(KTR_SCHED, "thread", sched_tdname(curthread),
1766 "lend prio", "prio:%d", td->td_priority, "new prio:%d",
1767 prio, KTR_ATTR_LINKED, sched_tdname(td));
1768 SDT_PROBE4(sched, , , lend__pri, td, td->td_proc, prio,
1771 ts = td_get_sched(td);
1772 THREAD_LOCK_ASSERT(td, MA_OWNED);
1773 if (td->td_priority == prio)
1776 * If the priority has been elevated due to priority
1777 * propagation, we may have to move ourselves to a new
1778 * queue. This could be optimized to not re-add in some
1781 if (TD_ON_RUNQ(td) && prio < td->td_priority) {
1783 td->td_priority = prio;
1784 sched_add(td, SRQ_BORROWING);
1788 * If the thread is currently running we may have to adjust the lowpri
1789 * information so other cpus are aware of our current priority.
1791 if (TD_IS_RUNNING(td)) {
1792 tdq = TDQ_CPU(ts->ts_cpu);
1793 oldpri = td->td_priority;
1794 td->td_priority = prio;
1795 if (prio < tdq->tdq_lowpri)
1796 tdq->tdq_lowpri = prio;
1797 else if (tdq->tdq_lowpri == oldpri)
1798 tdq_setlowpri(tdq, td);
1801 td->td_priority = prio;
1805 * Update a thread's priority when it is lent another thread's
1809 sched_lend_prio(struct thread *td, u_char prio)
1812 td->td_flags |= TDF_BORROWING;
1813 sched_thread_priority(td, prio);
1817 * Restore a thread's priority when priority propagation is
1818 * over. The prio argument is the minimum priority the thread
1819 * needs to have to satisfy other possible priority lending
1820 * requests. If the thread's regular priority is less
1821 * important than prio, the thread will keep a priority boost
1825 sched_unlend_prio(struct thread *td, u_char prio)
1829 if (td->td_base_pri >= PRI_MIN_TIMESHARE &&
1830 td->td_base_pri <= PRI_MAX_TIMESHARE)
1831 base_pri = td->td_user_pri;
1833 base_pri = td->td_base_pri;
1834 if (prio >= base_pri) {
1835 td->td_flags &= ~TDF_BORROWING;
1836 sched_thread_priority(td, base_pri);
1838 sched_lend_prio(td, prio);
1842 * Standard entry for setting the priority to an absolute value.
1845 sched_prio(struct thread *td, u_char prio)
1849 /* First, update the base priority. */
1850 td->td_base_pri = prio;
1853 * If the thread is borrowing another thread's priority, don't
1854 * ever lower the priority.
1856 if (td->td_flags & TDF_BORROWING && td->td_priority < prio)
1859 /* Change the real priority. */
1860 oldprio = td->td_priority;
1861 sched_thread_priority(td, prio);
1864 * If the thread is on a turnstile, then let the turnstile update
1867 if (TD_ON_LOCK(td) && oldprio != prio)
1868 turnstile_adjust(td, oldprio);
1872 * Set the base user priority, does not effect current running priority.
1875 sched_user_prio(struct thread *td, u_char prio)
1878 td->td_base_user_pri = prio;
1879 if (td->td_lend_user_pri <= prio)
1881 td->td_user_pri = prio;
1885 sched_lend_user_prio(struct thread *td, u_char prio)
1888 THREAD_LOCK_ASSERT(td, MA_OWNED);
1889 td->td_lend_user_pri = prio;
1890 td->td_user_pri = min(prio, td->td_base_user_pri);
1891 if (td->td_priority > td->td_user_pri)
1892 sched_prio(td, td->td_user_pri);
1893 else if (td->td_priority != td->td_user_pri)
1894 td->td_flags |= TDF_NEEDRESCHED;
1899 * This tdq is about to idle. Try to steal a thread from another CPU before
1900 * choosing the idle thread.
1903 tdq_trysteal(struct tdq *tdq)
1905 struct cpu_group *cg;
1910 if (smp_started == 0 || trysteal_limit == 0 || tdq->tdq_cg == NULL)
1913 CPU_CLR(PCPU_GET(cpuid), &mask);
1914 /* We don't want to be preempted while we're iterating. */
1917 for (i = 1, cg = tdq->tdq_cg; ; ) {
1918 cpu = sched_highest(cg, mask, steal_thresh);
1920 * If a thread was added while interrupts were disabled don't
1923 if (tdq->tdq_load > 0) {
1930 if (cg == NULL || i > trysteal_limit) {
1936 steal = TDQ_CPU(cpu);
1938 * The data returned by sched_highest() is stale and
1939 * the chosen CPU no longer has an eligible thread.
1941 if (steal->tdq_load < steal_thresh ||
1942 steal->tdq_transferable == 0)
1944 tdq_lock_pair(tdq, steal);
1946 * If we get to this point, unconditonally exit the loop
1947 * to bound the time spent in the critcal section.
1949 * If a thread was added while interrupts were disabled don't
1952 if (tdq->tdq_load > 0) {
1957 * The data returned by sched_highest() is stale and
1958 * the chosen CPU no longer has an eligible thread.
1960 if (steal->tdq_load < steal_thresh ||
1961 steal->tdq_transferable == 0) {
1966 * If we fail to acquire one due to affinity restrictions,
1967 * bail out and let the idle thread to a more complete search
1968 * outside of a critical section.
1970 if (tdq_move(steal, tdq) == NULL) {
1982 * Handle migration from sched_switch(). This happens only for
1986 sched_switch_migrate(struct tdq *tdq, struct thread *td, int flags)
1990 KASSERT(!CPU_ABSENT(td_get_sched(td)->ts_cpu), ("sched_switch_migrate: "
1991 "thread %s queued on absent CPU %d.", td->td_name,
1992 td_get_sched(td)->ts_cpu));
1993 tdn = TDQ_CPU(td_get_sched(td)->ts_cpu);
1995 tdq_load_rem(tdq, td);
1997 * Do the lock dance required to avoid LOR. We grab an extra
1998 * spinlock nesting to prevent preemption while we're
1999 * not holding either run-queue lock.
2002 thread_lock_block(td); /* This releases the lock on tdq. */
2005 * Acquire both run-queue locks before placing the thread on the new
2006 * run-queue to avoid deadlocks created by placing a thread with a
2007 * blocked lock on the run-queue of a remote processor. The deadlock
2008 * occurs when a third processor attempts to lock the two queues in
2009 * question while the target processor is spinning with its own
2010 * run-queue lock held while waiting for the blocked lock to clear.
2012 tdq_lock_pair(tdn, tdq);
2013 tdq_add(tdn, td, flags);
2014 tdq_notify(tdn, td);
2018 return (TDQ_LOCKPTR(tdn));
2022 * Variadic version of thread_lock_unblock() that does not assume td_lock
2026 thread_unblock_switch(struct thread *td, struct mtx *mtx)
2028 atomic_store_rel_ptr((volatile uintptr_t *)&td->td_lock,
2033 * Switch threads. This function has to handle threads coming in while
2034 * blocked for some reason, running, or idle. It also must deal with
2035 * migrating a thread from one queue to another as running threads may
2036 * be assigned elsewhere via binding.
2039 sched_switch(struct thread *td, struct thread *newtd, int flags)
2042 struct td_sched *ts;
2045 int cpuid, preempted;
2047 THREAD_LOCK_ASSERT(td, MA_OWNED);
2048 KASSERT(newtd == NULL, ("sched_switch: Unsupported newtd argument"));
2050 cpuid = PCPU_GET(cpuid);
2052 ts = td_get_sched(td);
2054 sched_pctcpu_update(ts, 1);
2055 ts->ts_rltick = ticks;
2056 td->td_lastcpu = td->td_oncpu;
2057 td->td_oncpu = NOCPU;
2058 preempted = (td->td_flags & TDF_SLICEEND) == 0 &&
2059 (flags & SW_PREEMPT) != 0;
2060 td->td_flags &= ~(TDF_NEEDRESCHED | TDF_SLICEEND);
2061 td->td_owepreempt = 0;
2062 if (!TD_IS_IDLETHREAD(td))
2063 tdq->tdq_switchcnt++;
2065 * The lock pointer in an idle thread should never change. Reset it
2066 * to CAN_RUN as well.
2068 if (TD_IS_IDLETHREAD(td)) {
2069 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2071 } else if (TD_IS_RUNNING(td)) {
2072 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2073 srqflag = preempted ?
2074 SRQ_OURSELF|SRQ_YIELDING|SRQ_PREEMPTED :
2075 SRQ_OURSELF|SRQ_YIELDING;
2077 if (THREAD_CAN_MIGRATE(td) && !THREAD_CAN_SCHED(td, ts->ts_cpu))
2078 ts->ts_cpu = sched_pickcpu(td, 0);
2080 if (ts->ts_cpu == cpuid)
2081 tdq_runq_add(tdq, td, srqflag);
2083 KASSERT(THREAD_CAN_MIGRATE(td) ||
2084 (ts->ts_flags & TSF_BOUND) != 0,
2085 ("Thread %p shouldn't migrate", td));
2086 mtx = sched_switch_migrate(tdq, td, srqflag);
2089 /* This thread must be going to sleep. */
2091 mtx = thread_lock_block(td);
2092 tdq_load_rem(tdq, td);
2094 if (tdq->tdq_load == 0)
2099 #if (KTR_COMPILE & KTR_SCHED) != 0
2100 if (TD_IS_IDLETHREAD(td))
2101 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(td), "idle",
2102 "prio:%d", td->td_priority);
2104 KTR_STATE3(KTR_SCHED, "thread", sched_tdname(td), KTDSTATE(td),
2105 "prio:%d", td->td_priority, "wmesg:\"%s\"", td->td_wmesg,
2106 "lockname:\"%s\"", td->td_lockname);
2110 * We enter here with the thread blocked and assigned to the
2111 * appropriate cpu run-queue or sleep-queue and with the current
2112 * thread-queue locked.
2114 TDQ_LOCK_ASSERT(tdq, MA_OWNED | MA_NOTRECURSED);
2115 newtd = choosethread();
2117 * Call the MD code to switch contexts if necessary.
2121 if (PMC_PROC_IS_USING_PMCS(td->td_proc))
2122 PMC_SWITCH_CONTEXT(td, PMC_FN_CSW_OUT);
2124 SDT_PROBE2(sched, , , off__cpu, newtd, newtd->td_proc);
2125 lock_profile_release_lock(&TDQ_LOCKPTR(tdq)->lock_object);
2126 TDQ_LOCKPTR(tdq)->mtx_lock = (uintptr_t)newtd;
2127 sched_pctcpu_update(td_get_sched(newtd), 0);
2129 #ifdef KDTRACE_HOOKS
2131 * If DTrace has set the active vtime enum to anything
2132 * other than INACTIVE (0), then it should have set the
2135 if (dtrace_vtime_active)
2136 (*dtrace_vtime_switch_func)(newtd);
2139 cpu_switch(td, newtd, mtx);
2141 * We may return from cpu_switch on a different cpu. However,
2142 * we always return with td_lock pointing to the current cpu's
2145 cpuid = PCPU_GET(cpuid);
2147 lock_profile_obtain_lock_success(
2148 &TDQ_LOCKPTR(tdq)->lock_object, 0, 0, __FILE__, __LINE__);
2150 SDT_PROBE0(sched, , , on__cpu);
2152 if (PMC_PROC_IS_USING_PMCS(td->td_proc))
2153 PMC_SWITCH_CONTEXT(td, PMC_FN_CSW_IN);
2156 thread_unblock_switch(td, mtx);
2157 SDT_PROBE0(sched, , , remain__cpu);
2160 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(td), "running",
2161 "prio:%d", td->td_priority);
2164 * Assert that all went well and return.
2166 TDQ_LOCK_ASSERT(tdq, MA_OWNED|MA_NOTRECURSED);
2167 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2168 td->td_oncpu = cpuid;
2172 * Adjust thread priorities as a result of a nice request.
2175 sched_nice(struct proc *p, int nice)
2179 PROC_LOCK_ASSERT(p, MA_OWNED);
2182 FOREACH_THREAD_IN_PROC(p, td) {
2185 sched_prio(td, td->td_base_user_pri);
2191 * Record the sleep time for the interactivity scorer.
2194 sched_sleep(struct thread *td, int prio)
2197 THREAD_LOCK_ASSERT(td, MA_OWNED);
2199 td->td_slptick = ticks;
2200 if (TD_IS_SUSPENDED(td) || prio >= PSOCK)
2201 td->td_flags |= TDF_CANSWAP;
2202 if (PRI_BASE(td->td_pri_class) != PRI_TIMESHARE)
2204 if (static_boost == 1 && prio)
2205 sched_prio(td, prio);
2206 else if (static_boost && td->td_priority > static_boost)
2207 sched_prio(td, static_boost);
2211 * Schedule a thread to resume execution and record how long it voluntarily
2212 * slept. We also update the pctcpu, interactivity, and priority.
2215 sched_wakeup(struct thread *td)
2217 struct td_sched *ts;
2220 THREAD_LOCK_ASSERT(td, MA_OWNED);
2221 ts = td_get_sched(td);
2222 td->td_flags &= ~TDF_CANSWAP;
2224 * If we slept for more than a tick update our interactivity and
2227 slptick = td->td_slptick;
2229 if (slptick && slptick != ticks) {
2230 ts->ts_slptime += (ticks - slptick) << SCHED_TICK_SHIFT;
2231 sched_interact_update(td);
2232 sched_pctcpu_update(ts, 0);
2235 * Reset the slice value since we slept and advanced the round-robin.
2238 sched_add(td, SRQ_BORING);
2242 * Penalize the parent for creating a new child and initialize the child's
2246 sched_fork(struct thread *td, struct thread *child)
2248 THREAD_LOCK_ASSERT(td, MA_OWNED);
2249 sched_pctcpu_update(td_get_sched(td), 1);
2250 sched_fork_thread(td, child);
2252 * Penalize the parent and child for forking.
2254 sched_interact_fork(child);
2255 sched_priority(child);
2256 td_get_sched(td)->ts_runtime += tickincr;
2257 sched_interact_update(td);
2262 * Fork a new thread, may be within the same process.
2265 sched_fork_thread(struct thread *td, struct thread *child)
2267 struct td_sched *ts;
2268 struct td_sched *ts2;
2272 THREAD_LOCK_ASSERT(td, MA_OWNED);
2276 ts = td_get_sched(td);
2277 ts2 = td_get_sched(child);
2278 child->td_oncpu = NOCPU;
2279 child->td_lastcpu = NOCPU;
2280 child->td_lock = TDQ_LOCKPTR(tdq);
2281 child->td_cpuset = cpuset_ref(td->td_cpuset);
2282 child->td_domain.dr_policy = td->td_cpuset->cs_domain;
2283 ts2->ts_cpu = ts->ts_cpu;
2286 * Grab our parents cpu estimation information.
2288 ts2->ts_ticks = ts->ts_ticks;
2289 ts2->ts_ltick = ts->ts_ltick;
2290 ts2->ts_ftick = ts->ts_ftick;
2292 * Do not inherit any borrowed priority from the parent.
2294 child->td_priority = child->td_base_pri;
2296 * And update interactivity score.
2298 ts2->ts_slptime = ts->ts_slptime;
2299 ts2->ts_runtime = ts->ts_runtime;
2300 /* Attempt to quickly learn interactivity. */
2301 ts2->ts_slice = tdq_slice(tdq) - sched_slice_min;
2303 bzero(ts2->ts_name, sizeof(ts2->ts_name));
2308 * Adjust the priority class of a thread.
2311 sched_class(struct thread *td, int class)
2314 THREAD_LOCK_ASSERT(td, MA_OWNED);
2315 if (td->td_pri_class == class)
2317 td->td_pri_class = class;
2321 * Return some of the child's priority and interactivity to the parent.
2324 sched_exit(struct proc *p, struct thread *child)
2328 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(child), "proc exit",
2329 "prio:%d", child->td_priority);
2330 PROC_LOCK_ASSERT(p, MA_OWNED);
2331 td = FIRST_THREAD_IN_PROC(p);
2332 sched_exit_thread(td, child);
2336 * Penalize another thread for the time spent on this one. This helps to
2337 * worsen the priority and interactivity of processes which schedule batch
2338 * jobs such as make. This has little effect on the make process itself but
2339 * causes new processes spawned by it to receive worse scores immediately.
2342 sched_exit_thread(struct thread *td, struct thread *child)
2345 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(child), "thread exit",
2346 "prio:%d", child->td_priority);
2348 * Give the child's runtime to the parent without returning the
2349 * sleep time as a penalty to the parent. This causes shells that
2350 * launch expensive things to mark their children as expensive.
2353 td_get_sched(td)->ts_runtime += td_get_sched(child)->ts_runtime;
2354 sched_interact_update(td);
2360 sched_preempt(struct thread *td)
2364 SDT_PROBE2(sched, , , surrender, td, td->td_proc);
2368 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2369 tdq->tdq_ipipending = 0;
2370 if (td->td_priority > tdq->tdq_lowpri) {
2373 flags = SW_INVOL | SW_PREEMPT;
2374 if (td->td_critnest > 1)
2375 td->td_owepreempt = 1;
2376 else if (TD_IS_IDLETHREAD(td))
2377 mi_switch(flags | SWT_REMOTEWAKEIDLE, NULL);
2379 mi_switch(flags | SWT_REMOTEPREEMPT, NULL);
2385 * Fix priorities on return to user-space. Priorities may be elevated due
2386 * to static priorities in msleep() or similar.
2389 sched_userret_slowpath(struct thread *td)
2393 td->td_priority = td->td_user_pri;
2394 td->td_base_pri = td->td_user_pri;
2395 tdq_setlowpri(TDQ_SELF(), td);
2400 * Handle a stathz tick. This is really only relevant for timeshare
2404 sched_clock(struct thread *td)
2407 struct td_sched *ts;
2409 THREAD_LOCK_ASSERT(td, MA_OWNED);
2413 * We run the long term load balancer infrequently on the first cpu.
2415 if (balance_tdq == tdq && smp_started != 0 && rebalance != 0) {
2416 if (balance_ticks && --balance_ticks == 0)
2421 * Save the old switch count so we have a record of the last ticks
2422 * activity. Initialize the new switch count based on our load.
2423 * If there is some activity seed it to reflect that.
2425 tdq->tdq_oldswitchcnt = tdq->tdq_switchcnt;
2426 tdq->tdq_switchcnt = tdq->tdq_load;
2428 * Advance the insert index once for each tick to ensure that all
2429 * threads get a chance to run.
2431 if (tdq->tdq_idx == tdq->tdq_ridx) {
2432 tdq->tdq_idx = (tdq->tdq_idx + 1) % RQ_NQS;
2433 if (TAILQ_EMPTY(&tdq->tdq_timeshare.rq_queues[tdq->tdq_ridx]))
2434 tdq->tdq_ridx = tdq->tdq_idx;
2436 ts = td_get_sched(td);
2437 sched_pctcpu_update(ts, 1);
2438 if (td->td_pri_class & PRI_FIFO_BIT)
2440 if (PRI_BASE(td->td_pri_class) == PRI_TIMESHARE) {
2442 * We used a tick; charge it to the thread so
2443 * that we can compute our interactivity.
2445 td_get_sched(td)->ts_runtime += tickincr;
2446 sched_interact_update(td);
2451 * Force a context switch if the current thread has used up a full
2452 * time slice (default is 100ms).
2454 if (!TD_IS_IDLETHREAD(td) && ++ts->ts_slice >= tdq_slice(tdq)) {
2456 td->td_flags |= TDF_NEEDRESCHED | TDF_SLICEEND;
2461 sched_estcpu(struct thread *td __unused)
2468 * Return whether the current CPU has runnable tasks. Used for in-kernel
2469 * cooperative idle threads.
2472 sched_runnable(void)
2480 if ((curthread->td_flags & TDF_IDLETD) != 0) {
2481 if (tdq->tdq_load > 0)
2484 if (tdq->tdq_load - 1 > 0)
2492 * Choose the highest priority thread to run. The thread is removed from
2493 * the run-queue while running however the load remains. For SMP we set
2494 * the tdq in the global idle bitmask if it idles here.
2503 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2504 td = tdq_choose(tdq);
2506 tdq_runq_rem(tdq, td);
2507 tdq->tdq_lowpri = td->td_priority;
2510 tdq->tdq_lowpri = PRI_MAX_IDLE;
2511 return (PCPU_GET(idlethread));
2515 * Set owepreempt if necessary. Preemption never happens directly in ULE,
2516 * we always request it once we exit a critical section.
2519 sched_setpreempt(struct thread *td)
2525 THREAD_LOCK_ASSERT(curthread, MA_OWNED);
2528 pri = td->td_priority;
2529 cpri = ctd->td_priority;
2531 ctd->td_flags |= TDF_NEEDRESCHED;
2532 if (panicstr != NULL || pri >= cpri || cold || TD_IS_INHIBITED(ctd))
2534 if (!sched_shouldpreempt(pri, cpri, 0))
2536 ctd->td_owepreempt = 1;
2540 * Add a thread to a thread queue. Select the appropriate runq and add the
2541 * thread to it. This is the internal function called when the tdq is
2545 tdq_add(struct tdq *tdq, struct thread *td, int flags)
2548 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2549 KASSERT((td->td_inhibitors == 0),
2550 ("sched_add: trying to run inhibited thread"));
2551 KASSERT((TD_CAN_RUN(td) || TD_IS_RUNNING(td)),
2552 ("sched_add: bad thread state"));
2553 KASSERT(td->td_flags & TDF_INMEM,
2554 ("sched_add: thread swapped out"));
2556 if (td->td_priority < tdq->tdq_lowpri)
2557 tdq->tdq_lowpri = td->td_priority;
2558 tdq_runq_add(tdq, td, flags);
2559 tdq_load_add(tdq, td);
2563 * Select the target thread queue and add a thread to it. Request
2564 * preemption or IPI a remote processor if required.
2567 sched_add(struct thread *td, int flags)
2574 KTR_STATE2(KTR_SCHED, "thread", sched_tdname(td), "runq add",
2575 "prio:%d", td->td_priority, KTR_ATTR_LINKED,
2576 sched_tdname(curthread));
2577 KTR_POINT1(KTR_SCHED, "thread", sched_tdname(curthread), "wokeup",
2578 KTR_ATTR_LINKED, sched_tdname(td));
2579 SDT_PROBE4(sched, , , enqueue, td, td->td_proc, NULL,
2580 flags & SRQ_PREEMPTED);
2581 THREAD_LOCK_ASSERT(td, MA_OWNED);
2583 * Recalculate the priority before we select the target cpu or
2586 if (PRI_BASE(td->td_pri_class) == PRI_TIMESHARE)
2590 * Pick the destination cpu and if it isn't ours transfer to the
2593 cpu = sched_pickcpu(td, flags);
2594 tdq = sched_setcpu(td, cpu, flags);
2595 tdq_add(tdq, td, flags);
2596 if (cpu != PCPU_GET(cpuid)) {
2597 tdq_notify(tdq, td);
2604 * Now that the thread is moving to the run-queue, set the lock
2605 * to the scheduler's lock.
2607 thread_lock_set(td, TDQ_LOCKPTR(tdq));
2608 tdq_add(tdq, td, flags);
2610 if (!(flags & SRQ_YIELDING))
2611 sched_setpreempt(td);
2615 * Remove a thread from a run-queue without running it. This is used
2616 * when we're stealing a thread from a remote queue. Otherwise all threads
2617 * exit by calling sched_exit_thread() and sched_throw() themselves.
2620 sched_rem(struct thread *td)
2624 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(td), "runq rem",
2625 "prio:%d", td->td_priority);
2626 SDT_PROBE3(sched, , , dequeue, td, td->td_proc, NULL);
2627 tdq = TDQ_CPU(td_get_sched(td)->ts_cpu);
2628 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2629 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2630 KASSERT(TD_ON_RUNQ(td),
2631 ("sched_rem: thread not on run queue"));
2632 tdq_runq_rem(tdq, td);
2633 tdq_load_rem(tdq, td);
2635 if (td->td_priority == tdq->tdq_lowpri)
2636 tdq_setlowpri(tdq, NULL);
2640 * Fetch cpu utilization information. Updates on demand.
2643 sched_pctcpu(struct thread *td)
2646 struct td_sched *ts;
2649 ts = td_get_sched(td);
2651 THREAD_LOCK_ASSERT(td, MA_OWNED);
2652 sched_pctcpu_update(ts, TD_IS_RUNNING(td));
2656 /* How many rtick per second ? */
2657 rtick = min(SCHED_TICK_HZ(ts) / SCHED_TICK_SECS, hz);
2658 pctcpu = (FSCALE * ((FSCALE * rtick)/hz)) >> FSHIFT;
2665 * Enforce affinity settings for a thread. Called after adjustments to
2669 sched_affinity(struct thread *td)
2672 struct td_sched *ts;
2674 THREAD_LOCK_ASSERT(td, MA_OWNED);
2675 ts = td_get_sched(td);
2676 if (THREAD_CAN_SCHED(td, ts->ts_cpu))
2678 if (TD_ON_RUNQ(td)) {
2680 sched_add(td, SRQ_BORING);
2683 if (!TD_IS_RUNNING(td))
2686 * Force a switch before returning to userspace. If the
2687 * target thread is not running locally send an ipi to force
2690 td->td_flags |= TDF_NEEDRESCHED;
2691 if (td != curthread)
2692 ipi_cpu(ts->ts_cpu, IPI_PREEMPT);
2697 * Bind a thread to a target cpu.
2700 sched_bind(struct thread *td, int cpu)
2702 struct td_sched *ts;
2704 THREAD_LOCK_ASSERT(td, MA_OWNED|MA_NOTRECURSED);
2705 KASSERT(td == curthread, ("sched_bind: can only bind curthread"));
2706 ts = td_get_sched(td);
2707 if (ts->ts_flags & TSF_BOUND)
2709 KASSERT(THREAD_CAN_MIGRATE(td), ("%p must be migratable", td));
2710 ts->ts_flags |= TSF_BOUND;
2712 if (PCPU_GET(cpuid) == cpu)
2715 /* When we return from mi_switch we'll be on the correct cpu. */
2716 mi_switch(SW_VOL, NULL);
2720 * Release a bound thread.
2723 sched_unbind(struct thread *td)
2725 struct td_sched *ts;
2727 THREAD_LOCK_ASSERT(td, MA_OWNED);
2728 KASSERT(td == curthread, ("sched_unbind: can only bind curthread"));
2729 ts = td_get_sched(td);
2730 if ((ts->ts_flags & TSF_BOUND) == 0)
2732 ts->ts_flags &= ~TSF_BOUND;
2737 sched_is_bound(struct thread *td)
2739 THREAD_LOCK_ASSERT(td, MA_OWNED);
2740 return (td_get_sched(td)->ts_flags & TSF_BOUND);
2747 sched_relinquish(struct thread *td)
2750 mi_switch(SW_VOL | SWT_RELINQUISH, NULL);
2755 * Return the total system load.
2766 total += TDQ_CPU(i)->tdq_sysload;
2769 return (TDQ_SELF()->tdq_sysload);
2774 sched_sizeof_proc(void)
2776 return (sizeof(struct proc));
2780 sched_sizeof_thread(void)
2782 return (sizeof(struct thread) + sizeof(struct td_sched));
2786 #define TDQ_IDLESPIN(tdq) \
2787 ((tdq)->tdq_cg != NULL && ((tdq)->tdq_cg->cg_flags & CG_FLAG_THREAD) == 0)
2789 #define TDQ_IDLESPIN(tdq) 1
2793 * The actual idle process.
2796 sched_idletd(void *dummy)
2800 int oldswitchcnt, switchcnt;
2803 mtx_assert(&Giant, MA_NOTOWNED);
2806 THREAD_NO_SLEEPING();
2809 if (tdq->tdq_load) {
2811 mi_switch(SW_VOL | SWT_IDLE, NULL);
2814 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2816 if (always_steal || switchcnt != oldswitchcnt) {
2817 oldswitchcnt = switchcnt;
2818 if (tdq_idled(tdq) == 0)
2821 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2823 oldswitchcnt = switchcnt;
2826 * If we're switching very frequently, spin while checking
2827 * for load rather than entering a low power state that
2828 * may require an IPI. However, don't do any busy
2829 * loops while on SMT machines as this simply steals
2830 * cycles from cores doing useful work.
2832 if (TDQ_IDLESPIN(tdq) && switchcnt > sched_idlespinthresh) {
2833 for (i = 0; i < sched_idlespins; i++) {
2840 /* If there was context switch during spin, restart it. */
2841 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2842 if (tdq->tdq_load != 0 || switchcnt != oldswitchcnt)
2845 /* Run main MD idle handler. */
2846 tdq->tdq_cpu_idle = 1;
2848 * Make sure that tdq_cpu_idle update is globally visible
2849 * before cpu_idle() read tdq_load. The order is important
2850 * to avoid race with tdq_notify.
2852 atomic_thread_fence_seq_cst();
2854 * Checking for again after the fence picks up assigned
2855 * threads often enough to make it worthwhile to do so in
2856 * order to avoid calling cpu_idle().
2858 if (tdq->tdq_load != 0) {
2859 tdq->tdq_cpu_idle = 0;
2862 cpu_idle(switchcnt * 4 > sched_idlespinthresh);
2863 tdq->tdq_cpu_idle = 0;
2866 * Account thread-less hardware interrupts and
2867 * other wakeup reasons equal to context switches.
2869 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2870 if (switchcnt != oldswitchcnt)
2872 tdq->tdq_switchcnt++;
2878 * A CPU is entering for the first time or a thread is exiting.
2881 sched_throw(struct thread *td)
2883 struct thread *newtd;
2887 /* Correct spinlock nesting and acquire the correct lock. */
2891 PCPU_SET(switchtime, cpu_ticks());
2892 PCPU_SET(switchticks, ticks);
2895 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2896 tdq_load_rem(tdq, td);
2897 lock_profile_release_lock(&TDQ_LOCKPTR(tdq)->lock_object);
2898 td->td_lastcpu = td->td_oncpu;
2899 td->td_oncpu = NOCPU;
2901 KASSERT(curthread->td_md.md_spinlock_count == 1, ("invalid count"));
2902 newtd = choosethread();
2903 TDQ_LOCKPTR(tdq)->mtx_lock = (uintptr_t)newtd;
2904 cpu_throw(td, newtd); /* doesn't return */
2908 * This is called from fork_exit(). Just acquire the correct locks and
2909 * let fork do the rest of the work.
2912 sched_fork_exit(struct thread *td)
2918 * Finish setting up thread glue so that it begins execution in a
2919 * non-nested critical section with the scheduler lock held.
2921 cpuid = PCPU_GET(cpuid);
2923 if (TD_IS_IDLETHREAD(td))
2924 td->td_lock = TDQ_LOCKPTR(tdq);
2925 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2926 td->td_oncpu = cpuid;
2927 TDQ_LOCK_ASSERT(tdq, MA_OWNED | MA_NOTRECURSED);
2928 lock_profile_obtain_lock_success(
2929 &TDQ_LOCKPTR(tdq)->lock_object, 0, 0, __FILE__, __LINE__);
2931 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(td), "running",
2932 "prio:%d", td->td_priority);
2933 SDT_PROBE0(sched, , , on__cpu);
2937 * Create on first use to catch odd startup conditons.
2940 sched_tdname(struct thread *td)
2943 struct td_sched *ts;
2945 ts = td_get_sched(td);
2946 if (ts->ts_name[0] == '\0')
2947 snprintf(ts->ts_name, sizeof(ts->ts_name),
2948 "%s tid %d", td->td_name, td->td_tid);
2949 return (ts->ts_name);
2951 return (td->td_name);
2957 sched_clear_tdname(struct thread *td)
2959 struct td_sched *ts;
2961 ts = td_get_sched(td);
2962 ts->ts_name[0] = '\0';
2969 * Build the CPU topology dump string. Is recursively called to collect
2970 * the topology tree.
2973 sysctl_kern_sched_topology_spec_internal(struct sbuf *sb, struct cpu_group *cg,
2976 char cpusetbuf[CPUSETBUFSIZ];
2979 sbuf_printf(sb, "%*s<group level=\"%d\" cache-level=\"%d\">\n", indent,
2980 "", 1 + indent / 2, cg->cg_level);
2981 sbuf_printf(sb, "%*s <cpu count=\"%d\" mask=\"%s\">", indent, "",
2982 cg->cg_count, cpusetobj_strprint(cpusetbuf, &cg->cg_mask));
2984 for (i = 0; i < MAXCPU; i++) {
2985 if (CPU_ISSET(i, &cg->cg_mask)) {
2987 sbuf_printf(sb, ", ");
2990 sbuf_printf(sb, "%d", i);
2993 sbuf_printf(sb, "</cpu>\n");
2995 if (cg->cg_flags != 0) {
2996 sbuf_printf(sb, "%*s <flags>", indent, "");
2997 if ((cg->cg_flags & CG_FLAG_HTT) != 0)
2998 sbuf_printf(sb, "<flag name=\"HTT\">HTT group</flag>");
2999 if ((cg->cg_flags & CG_FLAG_THREAD) != 0)
3000 sbuf_printf(sb, "<flag name=\"THREAD\">THREAD group</flag>");
3001 if ((cg->cg_flags & CG_FLAG_SMT) != 0)
3002 sbuf_printf(sb, "<flag name=\"SMT\">SMT group</flag>");
3003 sbuf_printf(sb, "</flags>\n");
3006 if (cg->cg_children > 0) {
3007 sbuf_printf(sb, "%*s <children>\n", indent, "");
3008 for (i = 0; i < cg->cg_children; i++)
3009 sysctl_kern_sched_topology_spec_internal(sb,
3010 &cg->cg_child[i], indent+2);
3011 sbuf_printf(sb, "%*s </children>\n", indent, "");
3013 sbuf_printf(sb, "%*s</group>\n", indent, "");
3018 * Sysctl handler for retrieving topology dump. It's a wrapper for
3019 * the recursive sysctl_kern_smp_topology_spec_internal().
3022 sysctl_kern_sched_topology_spec(SYSCTL_HANDLER_ARGS)
3027 KASSERT(cpu_top != NULL, ("cpu_top isn't initialized"));
3029 topo = sbuf_new_for_sysctl(NULL, NULL, 512, req);
3033 sbuf_printf(topo, "<groups>\n");
3034 err = sysctl_kern_sched_topology_spec_internal(topo, cpu_top, 1);
3035 sbuf_printf(topo, "</groups>\n");
3038 err = sbuf_finish(topo);
3047 sysctl_kern_quantum(SYSCTL_HANDLER_ARGS)
3049 int error, new_val, period;
3051 period = 1000000 / realstathz;
3052 new_val = period * sched_slice;
3053 error = sysctl_handle_int(oidp, &new_val, 0, req);
3054 if (error != 0 || req->newptr == NULL)
3058 sched_slice = imax(1, (new_val + period / 2) / period);
3059 sched_slice_min = sched_slice / SCHED_SLICE_MIN_DIVISOR;
3060 hogticks = imax(1, (2 * hz * sched_slice + realstathz / 2) /
3065 SYSCTL_NODE(_kern, OID_AUTO, sched, CTLFLAG_RW, 0, "Scheduler");
3066 SYSCTL_STRING(_kern_sched, OID_AUTO, name, CTLFLAG_RD, "ULE", 0,
3068 SYSCTL_PROC(_kern_sched, OID_AUTO, quantum, CTLTYPE_INT | CTLFLAG_RW,
3069 NULL, 0, sysctl_kern_quantum, "I",
3070 "Quantum for timeshare threads in microseconds");
3071 SYSCTL_INT(_kern_sched, OID_AUTO, slice, CTLFLAG_RW, &sched_slice, 0,
3072 "Quantum for timeshare threads in stathz ticks");
3073 SYSCTL_INT(_kern_sched, OID_AUTO, interact, CTLFLAG_RW, &sched_interact, 0,
3074 "Interactivity score threshold");
3075 SYSCTL_INT(_kern_sched, OID_AUTO, preempt_thresh, CTLFLAG_RW,
3077 "Maximal (lowest) priority for preemption");
3078 SYSCTL_INT(_kern_sched, OID_AUTO, static_boost, CTLFLAG_RW, &static_boost, 0,
3079 "Assign static kernel priorities to sleeping threads");
3080 SYSCTL_INT(_kern_sched, OID_AUTO, idlespins, CTLFLAG_RW, &sched_idlespins, 0,
3081 "Number of times idle thread will spin waiting for new work");
3082 SYSCTL_INT(_kern_sched, OID_AUTO, idlespinthresh, CTLFLAG_RW,
3083 &sched_idlespinthresh, 0,
3084 "Threshold before we will permit idle thread spinning");
3086 SYSCTL_INT(_kern_sched, OID_AUTO, affinity, CTLFLAG_RW, &affinity, 0,
3087 "Number of hz ticks to keep thread affinity for");
3088 SYSCTL_INT(_kern_sched, OID_AUTO, balance, CTLFLAG_RW, &rebalance, 0,
3089 "Enables the long-term load balancer");
3090 SYSCTL_INT(_kern_sched, OID_AUTO, balance_interval, CTLFLAG_RW,
3091 &balance_interval, 0,
3092 "Average period in stathz ticks to run the long-term balancer");
3093 SYSCTL_INT(_kern_sched, OID_AUTO, steal_idle, CTLFLAG_RW, &steal_idle, 0,
3094 "Attempts to steal work from other cores before idling");
3095 SYSCTL_INT(_kern_sched, OID_AUTO, steal_thresh, CTLFLAG_RW, &steal_thresh, 0,
3096 "Minimum load on remote CPU before we'll steal");
3097 SYSCTL_INT(_kern_sched, OID_AUTO, trysteal_limit, CTLFLAG_RW, &trysteal_limit,
3098 0, "Topological distance limit for stealing threads in sched_switch()");
3099 SYSCTL_INT(_kern_sched, OID_AUTO, always_steal, CTLFLAG_RW, &always_steal, 0,
3100 "Always run the stealer from the idle thread");
3101 SYSCTL_PROC(_kern_sched, OID_AUTO, topology_spec, CTLTYPE_STRING |
3102 CTLFLAG_MPSAFE | CTLFLAG_RD, NULL, 0, sysctl_kern_sched_topology_spec, "A",
3103 "XML dump of detected CPU topology");
3106 /* ps compat. All cpu percentages from ULE are weighted. */
3107 static int ccpu = 0;
3108 SYSCTL_INT(_kern, OID_AUTO, ccpu, CTLFLAG_RD, &ccpu, 0, "");