2 * Copyright (c) 2002-2007, Jeffrey Roberson <jeff@freebsd.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice unmodified, this list of conditions, and the following
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * This file implements the ULE scheduler. ULE supports independent CPU
29 * run queues and fine grain locking. It has superior interactive
30 * performance under load even on uni-processor systems.
33 * ULE is the last three letters in schedule. It owes its name to a
34 * generic user created for a scheduling system by Paul Mikesell at
35 * Isilon Systems and a general lack of creativity on the part of the author.
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
41 #include "opt_hwpmc_hooks.h"
42 #include "opt_sched.h"
44 #include <sys/param.h>
45 #include <sys/systm.h>
47 #include <sys/kernel.h>
49 #include <sys/limits.h>
51 #include <sys/mutex.h>
53 #include <sys/resource.h>
54 #include <sys/resourcevar.h>
55 #include <sys/sched.h>
59 #include <sys/sysctl.h>
60 #include <sys/sysproto.h>
61 #include <sys/turnstile.h>
63 #include <sys/vmmeter.h>
64 #include <sys/cpuset.h>
68 #include <sys/pmckern.h>
72 #include <sys/dtrace_bsd.h>
73 int dtrace_vtime_active;
74 dtrace_vtime_switch_func_t dtrace_vtime_switch_func;
77 #include <machine/cpu.h>
78 #include <machine/smp.h>
82 #define TS_NAME_LEN (MAXCOMLEN + sizeof(" td ") + sizeof(__XSTRING(UINT_MAX)))
83 #define TDQ_NAME_LEN (sizeof("sched lock ") + sizeof(__XSTRING(MAXCPU)))
84 #define TDQ_LOADNAME_LEN (sizeof("CPU ") + sizeof(__XSTRING(MAXCPU)) - 1 + sizeof(" load"))
87 * Thread scheduler specific section. All fields are protected
91 struct runq *ts_runq; /* Run-queue we're queued on. */
92 short ts_flags; /* TSF_* flags. */
93 int ts_cpu; /* CPU that we have affinity for. */
94 int ts_rltick; /* Real last tick, for affinity. */
95 int ts_slice; /* Ticks of slice remaining. */
96 u_int ts_slptime; /* Number of ticks we vol. slept */
97 u_int ts_runtime; /* Number of ticks we were running */
98 int ts_ltick; /* Last tick that we were running on */
99 int ts_ftick; /* First tick that we were running on */
100 int ts_ticks; /* Tick count */
102 char ts_name[TS_NAME_LEN];
105 /* flags kept in ts_flags */
106 #define TSF_BOUND 0x0001 /* Thread can not migrate. */
107 #define TSF_XFERABLE 0x0002 /* Thread was added as transferable. */
109 static struct td_sched td_sched0;
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)
116 * Priority ranges used for interactive and non-interactive timeshare
117 * threads. The timeshare priorities are split up into four ranges.
118 * The first range handles interactive threads. The last three ranges
119 * (NHALF, x, and NHALF) handle non-interactive threads with the outer
120 * ranges supporting nice values.
122 #define PRI_TIMESHARE_RANGE (PRI_MAX_TIMESHARE - PRI_MIN_TIMESHARE + 1)
123 #define PRI_INTERACT_RANGE ((PRI_TIMESHARE_RANGE - SCHED_PRI_NRESV) / 2)
124 #define PRI_BATCH_RANGE (PRI_TIMESHARE_RANGE - PRI_INTERACT_RANGE)
126 #define PRI_MIN_INTERACT PRI_MIN_TIMESHARE
127 #define PRI_MAX_INTERACT (PRI_MIN_TIMESHARE + PRI_INTERACT_RANGE - 1)
128 #define PRI_MIN_BATCH (PRI_MIN_TIMESHARE + PRI_INTERACT_RANGE)
129 #define PRI_MAX_BATCH PRI_MAX_TIMESHARE
132 * Cpu percentage computation macros and defines.
134 * SCHED_TICK_SECS: Number of seconds to average the cpu usage across.
135 * SCHED_TICK_TARG: Number of hz ticks to average the cpu usage across.
136 * SCHED_TICK_MAX: Maximum number of ticks before scaling back.
137 * SCHED_TICK_SHIFT: Shift factor to avoid rounding away results.
138 * SCHED_TICK_HZ: Compute the number of hz ticks for a given ticks count.
139 * SCHED_TICK_TOTAL: Gives the amount of time we've been recording ticks.
141 #define SCHED_TICK_SECS 10
142 #define SCHED_TICK_TARG (hz * SCHED_TICK_SECS)
143 #define SCHED_TICK_MAX (SCHED_TICK_TARG + hz)
144 #define SCHED_TICK_SHIFT 10
145 #define SCHED_TICK_HZ(ts) ((ts)->ts_ticks >> SCHED_TICK_SHIFT)
146 #define SCHED_TICK_TOTAL(ts) (max((ts)->ts_ltick - (ts)->ts_ftick, hz))
149 * These macros determine priorities for non-interactive threads. They are
150 * assigned a priority based on their recent cpu utilization as expressed
151 * by the ratio of ticks to the tick total. NHALF priorities at the start
152 * and end of the MIN to MAX timeshare range are only reachable with negative
153 * or positive nice respectively.
155 * PRI_RANGE: Priority range for utilization dependent priorities.
156 * PRI_NRESV: Number of nice values.
157 * PRI_TICKS: Compute a priority in PRI_RANGE from the ticks count and total.
158 * PRI_NICE: Determines the part of the priority inherited from nice.
160 #define SCHED_PRI_NRESV (PRIO_MAX - PRIO_MIN)
161 #define SCHED_PRI_NHALF (SCHED_PRI_NRESV / 2)
162 #define SCHED_PRI_MIN (PRI_MIN_BATCH + SCHED_PRI_NHALF)
163 #define SCHED_PRI_MAX (PRI_MAX_BATCH - SCHED_PRI_NHALF)
164 #define SCHED_PRI_RANGE (SCHED_PRI_MAX - SCHED_PRI_MIN + 1)
165 #define SCHED_PRI_TICKS(ts) \
166 (SCHED_TICK_HZ((ts)) / \
167 (roundup(SCHED_TICK_TOTAL((ts)), SCHED_PRI_RANGE) / SCHED_PRI_RANGE))
168 #define SCHED_PRI_NICE(nice) (nice)
171 * These determine the interactivity of a process. Interactivity differs from
172 * cpu utilization in that it expresses the voluntary time slept vs time ran
173 * while cpu utilization includes all time not running. This more accurately
174 * models the intent of the thread.
176 * SLP_RUN_MAX: Maximum amount of sleep time + run time we'll accumulate
177 * before throttling back.
178 * SLP_RUN_FORK: Maximum slp+run time to inherit at fork time.
179 * INTERACT_MAX: Maximum interactivity value. Smaller is better.
180 * INTERACT_THRESH: Threshold for placement on the current runq.
182 #define SCHED_SLP_RUN_MAX ((hz * 5) << SCHED_TICK_SHIFT)
183 #define SCHED_SLP_RUN_FORK ((hz / 2) << SCHED_TICK_SHIFT)
184 #define SCHED_INTERACT_MAX (100)
185 #define SCHED_INTERACT_HALF (SCHED_INTERACT_MAX / 2)
186 #define SCHED_INTERACT_THRESH (30)
189 * These parameters determine the slice behavior for batch work.
191 #define SCHED_SLICE_DEFAULT_DIVISOR 10 /* ~94 ms, 12 stathz ticks. */
192 #define SCHED_SLICE_MIN_DIVISOR 6 /* DEFAULT/MIN = ~16 ms. */
194 /* Flags kept in td_flags. */
195 #define TDF_SLICEEND TDF_SCHED2 /* Thread time slice is over. */
198 * tickincr: Converts a stathz tick into a hz domain scaled by
199 * the shift factor. Without the shift the error rate
200 * due to rounding would be unacceptably high.
201 * realstathz: stathz is sometimes 0 and run off of hz.
202 * sched_slice: Runtime of each thread before rescheduling.
203 * preempt_thresh: Priority threshold for preemption and remote IPIs.
205 static int sched_interact = SCHED_INTERACT_THRESH;
206 static int tickincr = 8 << SCHED_TICK_SHIFT;
207 static int realstathz = 127; /* reset during boot. */
208 static int sched_slice = 10; /* reset during boot. */
209 static int sched_slice_min = 1; /* reset during boot. */
211 #ifdef FULL_PREEMPTION
212 static int preempt_thresh = PRI_MAX_IDLE;
214 static int preempt_thresh = PRI_MIN_KERN;
217 static int preempt_thresh = 0;
219 static int static_boost = PRI_MIN_BATCH;
220 static int sched_idlespins = 10000;
221 static int sched_idlespinthresh = -1;
224 * tdq - per processor runqs and statistics. All fields are protected by the
225 * tdq_lock. The load and lowpri may be accessed without to avoid excess
226 * locking in sched_pickcpu();
230 * Ordered to improve efficiency of cpu_search() and switch().
231 * tdq_lock is padded to avoid false sharing with tdq_load and
234 struct mtx_padalign tdq_lock; /* run queue lock. */
235 struct cpu_group *tdq_cg; /* Pointer to cpu topology. */
236 volatile int tdq_load; /* Aggregate load. */
237 volatile int tdq_cpu_idle; /* cpu_idle() is active. */
238 int tdq_sysload; /* For loadavg, !ITHD load. */
239 int tdq_transferable; /* Transferable thread count. */
240 short tdq_switchcnt; /* Switches this tick. */
241 short tdq_oldswitchcnt; /* Switches last tick. */
242 u_char tdq_lowpri; /* Lowest priority thread. */
243 u_char tdq_ipipending; /* IPI pending. */
244 u_char tdq_idx; /* Current insert index. */
245 u_char tdq_ridx; /* Current removal index. */
246 struct runq tdq_realtime; /* real-time run queue. */
247 struct runq tdq_timeshare; /* timeshare run queue. */
248 struct runq tdq_idle; /* Queue of IDLE threads. */
249 char tdq_name[TDQ_NAME_LEN];
251 char tdq_loadname[TDQ_LOADNAME_LEN];
255 /* Idle thread states and config. */
256 #define TDQ_RUNNING 1
260 struct cpu_group *cpu_top; /* CPU topology */
262 #define SCHED_AFFINITY_DEFAULT (max(1, hz / 1000))
263 #define SCHED_AFFINITY(ts, t) ((ts)->ts_rltick > ticks - ((t) * affinity))
268 static int rebalance = 1;
269 static int balance_interval = 128; /* Default set in sched_initticks(). */
271 static int steal_idle = 1;
272 static int steal_thresh = 2;
275 * One thread queue per processor.
277 static struct tdq tdq_cpu[MAXCPU];
278 static struct tdq *balance_tdq;
279 static int balance_ticks;
280 static DPCPU_DEFINE(uint32_t, randomval);
282 #define TDQ_SELF() (&tdq_cpu[PCPU_GET(cpuid)])
283 #define TDQ_CPU(x) (&tdq_cpu[(x)])
284 #define TDQ_ID(x) ((int)((x) - tdq_cpu))
286 static struct tdq tdq_cpu;
288 #define TDQ_ID(x) (0)
289 #define TDQ_SELF() (&tdq_cpu)
290 #define TDQ_CPU(x) (&tdq_cpu)
293 #define TDQ_LOCK_ASSERT(t, type) mtx_assert(TDQ_LOCKPTR((t)), (type))
294 #define TDQ_LOCK(t) mtx_lock_spin(TDQ_LOCKPTR((t)))
295 #define TDQ_LOCK_FLAGS(t, f) mtx_lock_spin_flags(TDQ_LOCKPTR((t)), (f))
296 #define TDQ_UNLOCK(t) mtx_unlock_spin(TDQ_LOCKPTR((t)))
297 #define TDQ_LOCKPTR(t) ((struct mtx *)(&(t)->tdq_lock))
299 static void sched_priority(struct thread *);
300 static void sched_thread_priority(struct thread *, u_char);
301 static int sched_interact_score(struct thread *);
302 static void sched_interact_update(struct thread *);
303 static void sched_interact_fork(struct thread *);
304 static void sched_pctcpu_update(struct td_sched *, int);
306 /* Operations on per processor queues */
307 static struct thread *tdq_choose(struct tdq *);
308 static void tdq_setup(struct tdq *);
309 static void tdq_load_add(struct tdq *, struct thread *);
310 static void tdq_load_rem(struct tdq *, struct thread *);
311 static __inline void tdq_runq_add(struct tdq *, struct thread *, int);
312 static __inline void tdq_runq_rem(struct tdq *, struct thread *);
313 static inline int sched_shouldpreempt(int, int, int);
314 void tdq_print(int cpu);
315 static void runq_print(struct runq *rq);
316 static void tdq_add(struct tdq *, struct thread *, int);
318 static int tdq_move(struct tdq *, struct tdq *);
319 static int tdq_idled(struct tdq *);
320 static void tdq_notify(struct tdq *, struct thread *);
321 static struct thread *tdq_steal(struct tdq *, int);
322 static struct thread *runq_steal(struct runq *, int);
323 static int sched_pickcpu(struct thread *, int);
324 static void sched_balance(void);
325 static int sched_balance_pair(struct tdq *, struct tdq *);
326 static inline struct tdq *sched_setcpu(struct thread *, int, int);
327 static inline void thread_unblock_switch(struct thread *, struct mtx *);
328 static struct mtx *sched_switch_migrate(struct tdq *, struct thread *, int);
329 static int sysctl_kern_sched_topology_spec(SYSCTL_HANDLER_ARGS);
330 static int sysctl_kern_sched_topology_spec_internal(struct sbuf *sb,
331 struct cpu_group *cg, int indent);
334 static void sched_setup(void *dummy);
335 SYSINIT(sched_setup, SI_SUB_RUN_QUEUE, SI_ORDER_FIRST, sched_setup, NULL);
337 static void sched_initticks(void *dummy);
338 SYSINIT(sched_initticks, SI_SUB_CLOCKS, SI_ORDER_THIRD, sched_initticks,
341 SDT_PROVIDER_DEFINE(sched);
343 SDT_PROBE_DEFINE3(sched, , , change__pri, "struct thread *",
344 "struct proc *", "uint8_t");
345 SDT_PROBE_DEFINE3(sched, , , dequeue, "struct thread *",
346 "struct proc *", "void *");
347 SDT_PROBE_DEFINE4(sched, , , enqueue, "struct thread *",
348 "struct proc *", "void *", "int");
349 SDT_PROBE_DEFINE4(sched, , , lend__pri, "struct thread *",
350 "struct proc *", "uint8_t", "struct thread *");
351 SDT_PROBE_DEFINE2(sched, , , load__change, "int", "int");
352 SDT_PROBE_DEFINE2(sched, , , off__cpu, "struct thread *",
354 SDT_PROBE_DEFINE(sched, , , on__cpu);
355 SDT_PROBE_DEFINE(sched, , , remain__cpu);
356 SDT_PROBE_DEFINE2(sched, , , surrender, "struct thread *",
360 * Print the threads waiting on a run-queue.
363 runq_print(struct runq *rq)
371 for (i = 0; i < RQB_LEN; i++) {
372 printf("\t\trunq bits %d 0x%zx\n",
373 i, rq->rq_status.rqb_bits[i]);
374 for (j = 0; j < RQB_BPW; j++)
375 if (rq->rq_status.rqb_bits[i] & (1ul << j)) {
376 pri = j + (i << RQB_L2BPW);
377 rqh = &rq->rq_queues[pri];
378 TAILQ_FOREACH(td, rqh, td_runq) {
379 printf("\t\t\ttd %p(%s) priority %d rqindex %d pri %d\n",
380 td, td->td_name, td->td_priority,
381 td->td_rqindex, pri);
388 * Print the status of a per-cpu thread queue. Should be a ddb show cmd.
397 printf("tdq %d:\n", TDQ_ID(tdq));
398 printf("\tlock %p\n", TDQ_LOCKPTR(tdq));
399 printf("\tLock name: %s\n", tdq->tdq_name);
400 printf("\tload: %d\n", tdq->tdq_load);
401 printf("\tswitch cnt: %d\n", tdq->tdq_switchcnt);
402 printf("\told switch cnt: %d\n", tdq->tdq_oldswitchcnt);
403 printf("\ttimeshare idx: %d\n", tdq->tdq_idx);
404 printf("\ttimeshare ridx: %d\n", tdq->tdq_ridx);
405 printf("\tload transferable: %d\n", tdq->tdq_transferable);
406 printf("\tlowest priority: %d\n", tdq->tdq_lowpri);
407 printf("\trealtime runq:\n");
408 runq_print(&tdq->tdq_realtime);
409 printf("\ttimeshare runq:\n");
410 runq_print(&tdq->tdq_timeshare);
411 printf("\tidle runq:\n");
412 runq_print(&tdq->tdq_idle);
416 sched_shouldpreempt(int pri, int cpri, int remote)
419 * If the new priority is not better than the current priority there is
425 * Always preempt idle.
427 if (cpri >= PRI_MIN_IDLE)
430 * If preemption is disabled don't preempt others.
432 if (preempt_thresh == 0)
435 * Preempt if we exceed the threshold.
437 if (pri <= preempt_thresh)
440 * If we're interactive or better and there is non-interactive
441 * or worse running preempt only remote processors.
443 if (remote && pri <= PRI_MAX_INTERACT && cpri > PRI_MAX_INTERACT)
449 * Add a thread to the actual run-queue. Keeps transferable counts up to
450 * date with what is actually on the run-queue. Selects the correct
451 * queue position for timeshare threads.
454 tdq_runq_add(struct tdq *tdq, struct thread *td, int flags)
459 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
460 THREAD_LOCK_ASSERT(td, MA_OWNED);
462 pri = td->td_priority;
465 if (THREAD_CAN_MIGRATE(td)) {
466 tdq->tdq_transferable++;
467 ts->ts_flags |= TSF_XFERABLE;
469 if (pri < PRI_MIN_BATCH) {
470 ts->ts_runq = &tdq->tdq_realtime;
471 } else if (pri <= PRI_MAX_BATCH) {
472 ts->ts_runq = &tdq->tdq_timeshare;
473 KASSERT(pri <= PRI_MAX_BATCH && pri >= PRI_MIN_BATCH,
474 ("Invalid priority %d on timeshare runq", pri));
476 * This queue contains only priorities between MIN and MAX
477 * realtime. Use the whole queue to represent these values.
479 if ((flags & (SRQ_BORROWING|SRQ_PREEMPTED)) == 0) {
480 pri = RQ_NQS * (pri - PRI_MIN_BATCH) / PRI_BATCH_RANGE;
481 pri = (pri + tdq->tdq_idx) % RQ_NQS;
483 * This effectively shortens the queue by one so we
484 * can have a one slot difference between idx and
485 * ridx while we wait for threads to drain.
487 if (tdq->tdq_ridx != tdq->tdq_idx &&
488 pri == tdq->tdq_ridx)
489 pri = (unsigned char)(pri - 1) % RQ_NQS;
492 runq_add_pri(ts->ts_runq, td, pri, flags);
495 ts->ts_runq = &tdq->tdq_idle;
496 runq_add(ts->ts_runq, td, flags);
500 * Remove a thread from a run-queue. This typically happens when a thread
501 * is selected to run. Running threads are not on the queue and the
502 * transferable count does not reflect them.
505 tdq_runq_rem(struct tdq *tdq, struct thread *td)
510 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
511 KASSERT(ts->ts_runq != NULL,
512 ("tdq_runq_remove: thread %p null ts_runq", td));
513 if (ts->ts_flags & TSF_XFERABLE) {
514 tdq->tdq_transferable--;
515 ts->ts_flags &= ~TSF_XFERABLE;
517 if (ts->ts_runq == &tdq->tdq_timeshare) {
518 if (tdq->tdq_idx != tdq->tdq_ridx)
519 runq_remove_idx(ts->ts_runq, td, &tdq->tdq_ridx);
521 runq_remove_idx(ts->ts_runq, td, NULL);
523 runq_remove(ts->ts_runq, td);
527 * Load is maintained for all threads RUNNING and ON_RUNQ. Add the load
528 * for this thread to the referenced thread queue.
531 tdq_load_add(struct tdq *tdq, struct thread *td)
534 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
535 THREAD_LOCK_ASSERT(td, MA_OWNED);
538 if ((td->td_flags & TDF_NOLOAD) == 0)
540 KTR_COUNTER0(KTR_SCHED, "load", tdq->tdq_loadname, tdq->tdq_load);
541 SDT_PROBE2(sched, , , load__change, (int)TDQ_ID(tdq), tdq->tdq_load);
545 * Remove the load from a thread that is transitioning to a sleep state or
549 tdq_load_rem(struct tdq *tdq, struct thread *td)
552 THREAD_LOCK_ASSERT(td, MA_OWNED);
553 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
554 KASSERT(tdq->tdq_load != 0,
555 ("tdq_load_rem: Removing with 0 load on queue %d", TDQ_ID(tdq)));
558 if ((td->td_flags & TDF_NOLOAD) == 0)
560 KTR_COUNTER0(KTR_SCHED, "load", tdq->tdq_loadname, tdq->tdq_load);
561 SDT_PROBE2(sched, , , load__change, (int)TDQ_ID(tdq), tdq->tdq_load);
565 * Bound timeshare latency by decreasing slice size as load increases. We
566 * consider the maximum latency as the sum of the threads waiting to run
567 * aside from curthread and target no more than sched_slice latency but
568 * no less than sched_slice_min runtime.
571 tdq_slice(struct tdq *tdq)
576 * It is safe to use sys_load here because this is called from
577 * contexts where timeshare threads are running and so there
578 * cannot be higher priority load in the system.
580 load = tdq->tdq_sysload - 1;
581 if (load >= SCHED_SLICE_MIN_DIVISOR)
582 return (sched_slice_min);
584 return (sched_slice);
585 return (sched_slice / load);
589 * Set lowpri to its exact value by searching the run-queue and
590 * evaluating curthread. curthread may be passed as an optimization.
593 tdq_setlowpri(struct tdq *tdq, struct thread *ctd)
597 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
599 ctd = pcpu_find(TDQ_ID(tdq))->pc_curthread;
600 td = tdq_choose(tdq);
601 if (td == NULL || td->td_priority > ctd->td_priority)
602 tdq->tdq_lowpri = ctd->td_priority;
604 tdq->tdq_lowpri = td->td_priority;
609 * We need some randomness. Implement a classic Linear Congruential
610 * Generator X_{n+1}=(aX_n+c) mod m. These values are optimized for
611 * m = 2^32, a = 69069 and c = 5. We only return the upper 16 bits
612 * of the random state (in the low bits of our answer) to keep
613 * the maximum randomness.
620 rndptr = DPCPU_PTR(randomval);
621 *rndptr = *rndptr * 69069 + 5;
623 return (*rndptr >> 16);
629 int cs_pri; /* Min priority for low. */
630 int cs_limit; /* Max load for low, min load for high. */
635 #define CPU_SEARCH_LOWEST 0x1
636 #define CPU_SEARCH_HIGHEST 0x2
637 #define CPU_SEARCH_BOTH (CPU_SEARCH_LOWEST|CPU_SEARCH_HIGHEST)
639 #define CPUSET_FOREACH(cpu, mask) \
640 for ((cpu) = 0; (cpu) <= mp_maxid; (cpu)++) \
641 if (CPU_ISSET(cpu, &mask))
643 static __always_inline int cpu_search(const struct cpu_group *cg,
644 struct cpu_search *low, struct cpu_search *high, const int match);
645 int __noinline cpu_search_lowest(const struct cpu_group *cg,
646 struct cpu_search *low);
647 int __noinline cpu_search_highest(const struct cpu_group *cg,
648 struct cpu_search *high);
649 int __noinline cpu_search_both(const struct cpu_group *cg,
650 struct cpu_search *low, struct cpu_search *high);
653 * Search the tree of cpu_groups for the lowest or highest loaded cpu
654 * according to the match argument. This routine actually compares the
655 * load on all paths through the tree and finds the least loaded cpu on
656 * the least loaded path, which may differ from the least loaded cpu in
657 * the system. This balances work among caches and busses.
659 * This inline is instantiated in three forms below using constants for the
660 * match argument. It is reduced to the minimum set for each case. It is
661 * also recursive to the depth of the tree.
663 static __always_inline int
664 cpu_search(const struct cpu_group *cg, struct cpu_search *low,
665 struct cpu_search *high, const int match)
667 struct cpu_search lgroup;
668 struct cpu_search hgroup;
670 struct cpu_group *child;
672 int cpu, i, hload, lload, load, total, rnd;
675 cpumask = cg->cg_mask;
676 if (match & CPU_SEARCH_LOWEST) {
680 if (match & CPU_SEARCH_HIGHEST) {
685 /* Iterate through the child CPU groups and then remaining CPUs. */
686 for (i = cg->cg_children, cpu = mp_maxid; ; ) {
688 #ifdef HAVE_INLINE_FFSL
689 cpu = CPU_FFS(&cpumask) - 1;
691 while (cpu >= 0 && !CPU_ISSET(cpu, &cpumask))
698 child = &cg->cg_child[i - 1];
700 if (match & CPU_SEARCH_LOWEST)
702 if (match & CPU_SEARCH_HIGHEST)
704 if (child) { /* Handle child CPU group. */
705 CPU_NAND(&cpumask, &child->cg_mask);
707 case CPU_SEARCH_LOWEST:
708 load = cpu_search_lowest(child, &lgroup);
710 case CPU_SEARCH_HIGHEST:
711 load = cpu_search_highest(child, &hgroup);
713 case CPU_SEARCH_BOTH:
714 load = cpu_search_both(child, &lgroup, &hgroup);
717 } else { /* Handle child CPU. */
718 CPU_CLR(cpu, &cpumask);
720 load = tdq->tdq_load * 256;
721 rnd = sched_random() % 32;
722 if (match & CPU_SEARCH_LOWEST) {
723 if (cpu == low->cs_prefer)
725 /* If that CPU is allowed and get data. */
726 if (tdq->tdq_lowpri > lgroup.cs_pri &&
727 tdq->tdq_load <= lgroup.cs_limit &&
728 CPU_ISSET(cpu, &lgroup.cs_mask)) {
730 lgroup.cs_load = load - rnd;
733 if (match & CPU_SEARCH_HIGHEST)
734 if (tdq->tdq_load >= hgroup.cs_limit &&
735 tdq->tdq_transferable &&
736 CPU_ISSET(cpu, &hgroup.cs_mask)) {
738 hgroup.cs_load = load - rnd;
743 /* We have info about child item. Compare it. */
744 if (match & CPU_SEARCH_LOWEST) {
745 if (lgroup.cs_cpu >= 0 &&
747 (load == lload && lgroup.cs_load < low->cs_load))) {
749 low->cs_cpu = lgroup.cs_cpu;
750 low->cs_load = lgroup.cs_load;
753 if (match & CPU_SEARCH_HIGHEST)
754 if (hgroup.cs_cpu >= 0 &&
756 (load == hload && hgroup.cs_load > high->cs_load))) {
758 high->cs_cpu = hgroup.cs_cpu;
759 high->cs_load = hgroup.cs_load;
763 if (i == 0 && CPU_EMPTY(&cpumask))
766 #ifndef HAVE_INLINE_FFSL
775 * cpu_search instantiations must pass constants to maintain the inline
779 cpu_search_lowest(const struct cpu_group *cg, struct cpu_search *low)
781 return cpu_search(cg, low, NULL, CPU_SEARCH_LOWEST);
785 cpu_search_highest(const struct cpu_group *cg, struct cpu_search *high)
787 return cpu_search(cg, NULL, high, CPU_SEARCH_HIGHEST);
791 cpu_search_both(const struct cpu_group *cg, struct cpu_search *low,
792 struct cpu_search *high)
794 return cpu_search(cg, low, high, CPU_SEARCH_BOTH);
798 * Find the cpu with the least load via the least loaded path that has a
799 * lowpri greater than pri pri. A pri of -1 indicates any priority is
803 sched_lowest(const struct cpu_group *cg, cpuset_t mask, int pri, int maxload,
806 struct cpu_search low;
809 low.cs_prefer = prefer;
812 low.cs_limit = maxload;
813 cpu_search_lowest(cg, &low);
818 * Find the cpu with the highest load via the highest loaded path.
821 sched_highest(const struct cpu_group *cg, cpuset_t mask, int minload)
823 struct cpu_search high;
827 high.cs_limit = minload;
828 cpu_search_highest(cg, &high);
833 sched_balance_group(struct cpu_group *cg)
835 cpuset_t hmask, lmask;
836 int high, low, anylow;
840 high = sched_highest(cg, hmask, 1);
841 /* Stop if there is no more CPU with transferrable threads. */
844 CPU_CLR(high, &hmask);
845 CPU_COPY(&hmask, &lmask);
846 /* Stop if there is no more CPU left for low. */
847 if (CPU_EMPTY(&lmask))
851 low = sched_lowest(cg, lmask, -1,
852 TDQ_CPU(high)->tdq_load - 1, high);
853 /* Stop if we looked well and found no less loaded CPU. */
854 if (anylow && low == -1)
856 /* Go to next high if we found no less loaded CPU. */
859 /* Transfer thread from high to low. */
860 if (sched_balance_pair(TDQ_CPU(high), TDQ_CPU(low))) {
861 /* CPU that got thread can no longer be a donor. */
862 CPU_CLR(low, &hmask);
865 * If failed, then there is no threads on high
866 * that can run on this low. Drop low from low
867 * mask and look for different one.
869 CPU_CLR(low, &lmask);
881 if (smp_started == 0 || rebalance == 0)
884 balance_ticks = max(balance_interval / 2, 1) +
885 (sched_random() % balance_interval);
888 sched_balance_group(cpu_top);
893 * Lock two thread queues using their address to maintain lock order.
896 tdq_lock_pair(struct tdq *one, struct tdq *two)
900 TDQ_LOCK_FLAGS(two, MTX_DUPOK);
903 TDQ_LOCK_FLAGS(one, MTX_DUPOK);
908 * Unlock two thread queues. Order is not important here.
911 tdq_unlock_pair(struct tdq *one, struct tdq *two)
918 * Transfer load between two imbalanced thread queues.
921 sched_balance_pair(struct tdq *high, struct tdq *low)
926 tdq_lock_pair(high, low);
929 * Determine what the imbalance is and then adjust that to how many
930 * threads we actually have to give up (transferable).
932 if (high->tdq_transferable != 0 && high->tdq_load > low->tdq_load &&
933 (moved = tdq_move(high, low)) > 0) {
935 * In case the target isn't the current cpu IPI it to force a
936 * reschedule with the new workload.
939 if (cpu != PCPU_GET(cpuid))
940 ipi_cpu(cpu, IPI_PREEMPT);
942 tdq_unlock_pair(high, low);
947 * Move a thread from one thread queue to another.
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);
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;
993 if (smp_started == 0 || steal_idle == 0)
996 CPU_CLR(PCPU_GET(cpuid), &mask);
997 /* We don't want to be preempted while we're iterating. */
999 for (cg = tdq->tdq_cg; cg != NULL; ) {
1000 if ((cg->cg_flags & CG_FLAG_THREAD) == 0)
1001 thresh = steal_thresh;
1004 cpu = sched_highest(cg, mask, thresh);
1009 steal = TDQ_CPU(cpu);
1010 CPU_CLR(cpu, &mask);
1011 tdq_lock_pair(tdq, steal);
1012 if (steal->tdq_load < thresh || steal->tdq_transferable == 0) {
1013 tdq_unlock_pair(tdq, steal);
1017 * If a thread was added while interrupts were disabled don't
1018 * steal one here. If we fail to acquire one due to affinity
1019 * restrictions loop again with this cpu removed from the
1022 if (tdq->tdq_load == 0 && tdq_move(steal, tdq) == 0) {
1023 tdq_unlock_pair(tdq, steal);
1028 mi_switch(SW_VOL | SWT_IDLE, NULL);
1029 thread_unlock(curthread);
1038 * Notify a remote cpu of new work. Sends an IPI if criteria are met.
1041 tdq_notify(struct tdq *tdq, struct thread *td)
1047 if (tdq->tdq_ipipending)
1049 cpu = td->td_sched->ts_cpu;
1050 pri = td->td_priority;
1051 ctd = pcpu_find(cpu)->pc_curthread;
1052 if (!sched_shouldpreempt(pri, ctd->td_priority, 1))
1056 * Make sure that our caller's earlier update to tdq_load is
1057 * globally visible before we read tdq_cpu_idle. Idle thread
1058 * accesses both of them without locks, and the order is important.
1060 atomic_thread_fence_seq_cst();
1062 if (TD_IS_IDLETHREAD(ctd)) {
1064 * If the MD code has an idle wakeup routine try that before
1065 * falling back to IPI.
1067 if (!tdq->tdq_cpu_idle || cpu_idle_wakeup(cpu))
1070 tdq->tdq_ipipending = 1;
1071 ipi_cpu(cpu, IPI_PREEMPT);
1075 * Steals load from a timeshare queue. Honors the rotating queue head
1078 static struct thread *
1079 runq_steal_from(struct runq *rq, int cpu, u_char start)
1083 struct thread *td, *first;
1087 rqb = &rq->rq_status;
1088 bit = start & (RQB_BPW -1);
1091 for (i = RQB_WORD(start); i < RQB_LEN; bit = 0, i++) {
1092 if (rqb->rqb_bits[i] == 0)
1095 bit = RQB_FFS(rqb->rqb_bits[i]);
1096 for (; bit < RQB_BPW; bit++) {
1097 if ((rqb->rqb_bits[i] & (1ul << bit)) == 0)
1099 rqh = &rq->rq_queues[bit + (i << RQB_L2BPW)];
1100 TAILQ_FOREACH(td, rqh, td_runq) {
1101 if (first && THREAD_CAN_MIGRATE(td) &&
1102 THREAD_CAN_SCHED(td, cpu))
1113 if (first && THREAD_CAN_MIGRATE(first) &&
1114 THREAD_CAN_SCHED(first, cpu))
1120 * Steals load from a standard linear queue.
1122 static struct thread *
1123 runq_steal(struct runq *rq, int cpu)
1131 rqb = &rq->rq_status;
1132 for (word = 0; word < RQB_LEN; word++) {
1133 if (rqb->rqb_bits[word] == 0)
1135 for (bit = 0; bit < RQB_BPW; bit++) {
1136 if ((rqb->rqb_bits[word] & (1ul << bit)) == 0)
1138 rqh = &rq->rq_queues[bit + (word << RQB_L2BPW)];
1139 TAILQ_FOREACH(td, rqh, td_runq)
1140 if (THREAD_CAN_MIGRATE(td) &&
1141 THREAD_CAN_SCHED(td, cpu))
1149 * Attempt to steal a thread in priority order from a thread queue.
1151 static struct thread *
1152 tdq_steal(struct tdq *tdq, int cpu)
1156 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
1157 if ((td = runq_steal(&tdq->tdq_realtime, cpu)) != NULL)
1159 if ((td = runq_steal_from(&tdq->tdq_timeshare,
1160 cpu, tdq->tdq_ridx)) != NULL)
1162 return (runq_steal(&tdq->tdq_idle, cpu));
1166 * Sets the thread lock and ts_cpu to match the requested cpu. Unlocks the
1167 * current lock and returns with the assigned queue locked.
1169 static inline struct tdq *
1170 sched_setcpu(struct thread *td, int cpu, int flags)
1175 THREAD_LOCK_ASSERT(td, MA_OWNED);
1177 td->td_sched->ts_cpu = cpu;
1179 * If the lock matches just return the queue.
1181 if (td->td_lock == TDQ_LOCKPTR(tdq))
1185 * If the thread isn't running its lockptr is a
1186 * turnstile or a sleepqueue. We can just lock_set without
1189 if (TD_CAN_RUN(td)) {
1191 thread_lock_set(td, TDQ_LOCKPTR(tdq));
1196 * The hard case, migration, we need to block the thread first to
1197 * prevent order reversals with other cpus locks.
1200 thread_lock_block(td);
1202 thread_lock_unblock(td, TDQ_LOCKPTR(tdq));
1207 SCHED_STAT_DEFINE(pickcpu_intrbind, "Soft interrupt binding");
1208 SCHED_STAT_DEFINE(pickcpu_idle_affinity, "Picked idle cpu based on affinity");
1209 SCHED_STAT_DEFINE(pickcpu_affinity, "Picked cpu based on affinity");
1210 SCHED_STAT_DEFINE(pickcpu_lowest, "Selected lowest load");
1211 SCHED_STAT_DEFINE(pickcpu_local, "Migrated to current cpu");
1212 SCHED_STAT_DEFINE(pickcpu_migration, "Selection may have caused migration");
1215 sched_pickcpu(struct thread *td, int flags)
1217 struct cpu_group *cg, *ccg;
1218 struct td_sched *ts;
1223 self = PCPU_GET(cpuid);
1225 if (smp_started == 0)
1228 * Don't migrate a running thread from sched_switch().
1230 if ((flags & SRQ_OURSELF) || !THREAD_CAN_MIGRATE(td))
1231 return (ts->ts_cpu);
1233 * Prefer to run interrupt threads on the processors that generate
1236 pri = td->td_priority;
1237 if (td->td_priority <= PRI_MAX_ITHD && THREAD_CAN_SCHED(td, self) &&
1238 curthread->td_intr_nesting_level && ts->ts_cpu != self) {
1239 SCHED_STAT_INC(pickcpu_intrbind);
1241 if (TDQ_CPU(self)->tdq_lowpri > pri) {
1242 SCHED_STAT_INC(pickcpu_affinity);
1243 return (ts->ts_cpu);
1247 * If the thread can run on the last cpu and the affinity has not
1248 * expired or it is idle run it there.
1250 tdq = TDQ_CPU(ts->ts_cpu);
1252 if (THREAD_CAN_SCHED(td, ts->ts_cpu) &&
1253 tdq->tdq_lowpri >= PRI_MIN_IDLE &&
1254 SCHED_AFFINITY(ts, CG_SHARE_L2)) {
1255 if (cg->cg_flags & CG_FLAG_THREAD) {
1256 CPUSET_FOREACH(cpu, cg->cg_mask) {
1257 if (TDQ_CPU(cpu)->tdq_lowpri < PRI_MIN_IDLE)
1262 if (cpu > mp_maxid) {
1263 SCHED_STAT_INC(pickcpu_idle_affinity);
1264 return (ts->ts_cpu);
1268 * Search for the last level cache CPU group in the tree.
1269 * Skip caches with expired affinity time and SMT groups.
1270 * Affinity to higher level caches will be handled less aggressively.
1272 for (ccg = NULL; cg != NULL; cg = cg->cg_parent) {
1273 if (cg->cg_flags & CG_FLAG_THREAD)
1275 if (!SCHED_AFFINITY(ts, cg->cg_level))
1282 /* Search the group for the less loaded idle CPU we can run now. */
1283 mask = td->td_cpuset->cs_mask;
1284 if (cg != NULL && cg != cpu_top &&
1285 CPU_CMP(&cg->cg_mask, &cpu_top->cg_mask) != 0)
1286 cpu = sched_lowest(cg, mask, max(pri, PRI_MAX_TIMESHARE),
1287 INT_MAX, ts->ts_cpu);
1288 /* Search globally for the less loaded CPU we can run now. */
1290 cpu = sched_lowest(cpu_top, mask, pri, INT_MAX, ts->ts_cpu);
1291 /* Search globally for the less loaded CPU. */
1293 cpu = sched_lowest(cpu_top, mask, -1, INT_MAX, ts->ts_cpu);
1294 KASSERT(cpu != -1, ("sched_pickcpu: Failed to find a cpu."));
1296 * Compare the lowest loaded cpu to current cpu.
1298 if (THREAD_CAN_SCHED(td, self) && TDQ_CPU(self)->tdq_lowpri > pri &&
1299 TDQ_CPU(cpu)->tdq_lowpri < PRI_MIN_IDLE &&
1300 TDQ_CPU(self)->tdq_load <= TDQ_CPU(cpu)->tdq_load + 1) {
1301 SCHED_STAT_INC(pickcpu_local);
1304 SCHED_STAT_INC(pickcpu_lowest);
1305 if (cpu != ts->ts_cpu)
1306 SCHED_STAT_INC(pickcpu_migration);
1312 * Pick the highest priority task we have and return it.
1314 static struct thread *
1315 tdq_choose(struct tdq *tdq)
1319 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
1320 td = runq_choose(&tdq->tdq_realtime);
1323 td = runq_choose_from(&tdq->tdq_timeshare, tdq->tdq_ridx);
1325 KASSERT(td->td_priority >= PRI_MIN_BATCH,
1326 ("tdq_choose: Invalid priority on timeshare queue %d",
1330 td = runq_choose(&tdq->tdq_idle);
1332 KASSERT(td->td_priority >= PRI_MIN_IDLE,
1333 ("tdq_choose: Invalid priority on idle queue %d",
1342 * Initialize a thread queue.
1345 tdq_setup(struct tdq *tdq)
1349 printf("ULE: setup cpu %d\n", TDQ_ID(tdq));
1350 runq_init(&tdq->tdq_realtime);
1351 runq_init(&tdq->tdq_timeshare);
1352 runq_init(&tdq->tdq_idle);
1353 snprintf(tdq->tdq_name, sizeof(tdq->tdq_name),
1354 "sched lock %d", (int)TDQ_ID(tdq));
1355 mtx_init(&tdq->tdq_lock, tdq->tdq_name, "sched lock",
1356 MTX_SPIN | MTX_RECURSE);
1358 snprintf(tdq->tdq_loadname, sizeof(tdq->tdq_loadname),
1359 "CPU %d load", (int)TDQ_ID(tdq));
1365 sched_setup_smp(void)
1370 cpu_top = smp_topo();
1374 tdq->tdq_cg = smp_topo_find(cpu_top, i);
1375 if (tdq->tdq_cg == NULL)
1376 panic("Can't find cpu group for %d\n", i);
1378 balance_tdq = TDQ_SELF();
1384 * Setup the thread queues and initialize the topology based on MD
1388 sched_setup(void *dummy)
1399 /* Add thread0's load since it's running. */
1401 thread0.td_lock = TDQ_LOCKPTR(TDQ_SELF());
1402 tdq_load_add(tdq, &thread0);
1403 tdq->tdq_lowpri = thread0.td_priority;
1408 * This routine determines time constants after stathz and hz are setup.
1412 sched_initticks(void *dummy)
1416 realstathz = stathz ? stathz : hz;
1417 sched_slice = realstathz / SCHED_SLICE_DEFAULT_DIVISOR;
1418 sched_slice_min = sched_slice / SCHED_SLICE_MIN_DIVISOR;
1419 hogticks = imax(1, (2 * hz * sched_slice + realstathz / 2) /
1423 * tickincr is shifted out by 10 to avoid rounding errors due to
1424 * hz not being evenly divisible by stathz on all platforms.
1426 incr = (hz << SCHED_TICK_SHIFT) / realstathz;
1428 * This does not work for values of stathz that are more than
1429 * 1 << SCHED_TICK_SHIFT * hz. In practice this does not happen.
1436 * Set the default balance interval now that we know
1437 * what realstathz is.
1439 balance_interval = realstathz;
1440 affinity = SCHED_AFFINITY_DEFAULT;
1442 if (sched_idlespinthresh < 0)
1443 sched_idlespinthresh = 2 * max(10000, 6 * hz) / realstathz;
1448 * This is the core of the interactivity algorithm. Determines a score based
1449 * on past behavior. It is the ratio of sleep time to run time scaled to
1450 * a [0, 100] integer. This is the voluntary sleep time of a process, which
1451 * differs from the cpu usage because it does not account for time spent
1452 * waiting on a run-queue. Would be prettier if we had floating point.
1455 sched_interact_score(struct thread *td)
1457 struct td_sched *ts;
1462 * The score is only needed if this is likely to be an interactive
1463 * task. Don't go through the expense of computing it if there's
1466 if (sched_interact <= SCHED_INTERACT_HALF &&
1467 ts->ts_runtime >= ts->ts_slptime)
1468 return (SCHED_INTERACT_HALF);
1470 if (ts->ts_runtime > ts->ts_slptime) {
1471 div = max(1, ts->ts_runtime / SCHED_INTERACT_HALF);
1472 return (SCHED_INTERACT_HALF +
1473 (SCHED_INTERACT_HALF - (ts->ts_slptime / div)));
1475 if (ts->ts_slptime > ts->ts_runtime) {
1476 div = max(1, ts->ts_slptime / SCHED_INTERACT_HALF);
1477 return (ts->ts_runtime / div);
1479 /* runtime == slptime */
1481 return (SCHED_INTERACT_HALF);
1484 * This can happen if slptime and runtime are 0.
1491 * Scale the scheduling priority according to the "interactivity" of this
1495 sched_priority(struct thread *td)
1500 if (PRI_BASE(td->td_pri_class) != PRI_TIMESHARE)
1503 * If the score is interactive we place the thread in the realtime
1504 * queue with a priority that is less than kernel and interrupt
1505 * priorities. These threads are not subject to nice restrictions.
1507 * Scores greater than this are placed on the normal timeshare queue
1508 * where the priority is partially decided by the most recent cpu
1509 * utilization and the rest is decided by nice value.
1511 * The nice value of the process has a linear effect on the calculated
1512 * score. Negative nice values make it easier for a thread to be
1513 * considered interactive.
1515 score = imax(0, sched_interact_score(td) + td->td_proc->p_nice);
1516 if (score < sched_interact) {
1517 pri = PRI_MIN_INTERACT;
1518 pri += ((PRI_MAX_INTERACT - PRI_MIN_INTERACT + 1) /
1519 sched_interact) * score;
1520 KASSERT(pri >= PRI_MIN_INTERACT && pri <= PRI_MAX_INTERACT,
1521 ("sched_priority: invalid interactive priority %d score %d",
1524 pri = SCHED_PRI_MIN;
1525 if (td->td_sched->ts_ticks)
1526 pri += min(SCHED_PRI_TICKS(td->td_sched),
1527 SCHED_PRI_RANGE - 1);
1528 pri += SCHED_PRI_NICE(td->td_proc->p_nice);
1529 KASSERT(pri >= PRI_MIN_BATCH && pri <= PRI_MAX_BATCH,
1530 ("sched_priority: invalid priority %d: nice %d, "
1531 "ticks %d ftick %d ltick %d tick pri %d",
1532 pri, td->td_proc->p_nice, td->td_sched->ts_ticks,
1533 td->td_sched->ts_ftick, td->td_sched->ts_ltick,
1534 SCHED_PRI_TICKS(td->td_sched)));
1536 sched_user_prio(td, pri);
1542 * This routine enforces a maximum limit on the amount of scheduling history
1543 * kept. It is called after either the slptime or runtime is adjusted. This
1544 * function is ugly due to integer math.
1547 sched_interact_update(struct thread *td)
1549 struct td_sched *ts;
1553 sum = ts->ts_runtime + ts->ts_slptime;
1554 if (sum < SCHED_SLP_RUN_MAX)
1557 * This only happens from two places:
1558 * 1) We have added an unusual amount of run time from fork_exit.
1559 * 2) We have added an unusual amount of sleep time from sched_sleep().
1561 if (sum > SCHED_SLP_RUN_MAX * 2) {
1562 if (ts->ts_runtime > ts->ts_slptime) {
1563 ts->ts_runtime = SCHED_SLP_RUN_MAX;
1566 ts->ts_slptime = SCHED_SLP_RUN_MAX;
1572 * If we have exceeded by more than 1/5th then the algorithm below
1573 * will not bring us back into range. Dividing by two here forces
1574 * us into the range of [4/5 * SCHED_INTERACT_MAX, SCHED_INTERACT_MAX]
1576 if (sum > (SCHED_SLP_RUN_MAX / 5) * 6) {
1577 ts->ts_runtime /= 2;
1578 ts->ts_slptime /= 2;
1581 ts->ts_runtime = (ts->ts_runtime / 5) * 4;
1582 ts->ts_slptime = (ts->ts_slptime / 5) * 4;
1586 * Scale back the interactivity history when a child thread is created. The
1587 * history is inherited from the parent but the thread may behave totally
1588 * differently. For example, a shell spawning a compiler process. We want
1589 * to learn that the compiler is behaving badly very quickly.
1592 sched_interact_fork(struct thread *td)
1597 sum = td->td_sched->ts_runtime + td->td_sched->ts_slptime;
1598 if (sum > SCHED_SLP_RUN_FORK) {
1599 ratio = sum / SCHED_SLP_RUN_FORK;
1600 td->td_sched->ts_runtime /= ratio;
1601 td->td_sched->ts_slptime /= ratio;
1606 * Called from proc0_init() to setup the scheduler fields.
1613 * Set up the scheduler specific parts of proc0.
1615 proc0.p_sched = NULL; /* XXX */
1616 thread0.td_sched = &td_sched0;
1617 td_sched0.ts_ltick = ticks;
1618 td_sched0.ts_ftick = ticks;
1619 td_sched0.ts_slice = 0;
1623 * This is only somewhat accurate since given many processes of the same
1624 * priority they will switch when their slices run out, which will be
1625 * at most sched_slice stathz ticks.
1628 sched_rr_interval(void)
1631 /* Convert sched_slice from stathz to hz. */
1632 return (imax(1, (sched_slice * hz + realstathz / 2) / realstathz));
1636 * Update the percent cpu tracking information when it is requested or
1637 * the total history exceeds the maximum. We keep a sliding history of
1638 * tick counts that slowly decays. This is less precise than the 4BSD
1639 * mechanism since it happens with less regular and frequent events.
1642 sched_pctcpu_update(struct td_sched *ts, int run)
1646 if (t - ts->ts_ltick >= SCHED_TICK_TARG) {
1648 ts->ts_ftick = t - SCHED_TICK_TARG;
1649 } else if (t - ts->ts_ftick >= SCHED_TICK_MAX) {
1650 ts->ts_ticks = (ts->ts_ticks / (ts->ts_ltick - ts->ts_ftick)) *
1651 (ts->ts_ltick - (t - SCHED_TICK_TARG));
1652 ts->ts_ftick = t - SCHED_TICK_TARG;
1655 ts->ts_ticks += (t - ts->ts_ltick) << SCHED_TICK_SHIFT;
1660 * Adjust the priority of a thread. Move it to the appropriate run-queue
1661 * if necessary. This is the back-end for several priority related
1665 sched_thread_priority(struct thread *td, u_char prio)
1667 struct td_sched *ts;
1671 KTR_POINT3(KTR_SCHED, "thread", sched_tdname(td), "prio",
1672 "prio:%d", td->td_priority, "new prio:%d", prio,
1673 KTR_ATTR_LINKED, sched_tdname(curthread));
1674 SDT_PROBE3(sched, , , change__pri, td, td->td_proc, prio);
1675 if (td != curthread && prio < td->td_priority) {
1676 KTR_POINT3(KTR_SCHED, "thread", sched_tdname(curthread),
1677 "lend prio", "prio:%d", td->td_priority, "new prio:%d",
1678 prio, KTR_ATTR_LINKED, sched_tdname(td));
1679 SDT_PROBE4(sched, , , lend__pri, td, td->td_proc, prio,
1683 THREAD_LOCK_ASSERT(td, MA_OWNED);
1684 if (td->td_priority == prio)
1687 * If the priority has been elevated due to priority
1688 * propagation, we may have to move ourselves to a new
1689 * queue. This could be optimized to not re-add in some
1692 if (TD_ON_RUNQ(td) && prio < td->td_priority) {
1694 td->td_priority = prio;
1695 sched_add(td, SRQ_BORROWING);
1699 * If the thread is currently running we may have to adjust the lowpri
1700 * information so other cpus are aware of our current priority.
1702 if (TD_IS_RUNNING(td)) {
1703 tdq = TDQ_CPU(ts->ts_cpu);
1704 oldpri = td->td_priority;
1705 td->td_priority = prio;
1706 if (prio < tdq->tdq_lowpri)
1707 tdq->tdq_lowpri = prio;
1708 else if (tdq->tdq_lowpri == oldpri)
1709 tdq_setlowpri(tdq, td);
1712 td->td_priority = prio;
1716 * Update a thread's priority when it is lent another thread's
1720 sched_lend_prio(struct thread *td, u_char prio)
1723 td->td_flags |= TDF_BORROWING;
1724 sched_thread_priority(td, prio);
1728 * Restore a thread's priority when priority propagation is
1729 * over. The prio argument is the minimum priority the thread
1730 * needs to have to satisfy other possible priority lending
1731 * requests. If the thread's regular priority is less
1732 * important than prio, the thread will keep a priority boost
1736 sched_unlend_prio(struct thread *td, u_char prio)
1740 if (td->td_base_pri >= PRI_MIN_TIMESHARE &&
1741 td->td_base_pri <= PRI_MAX_TIMESHARE)
1742 base_pri = td->td_user_pri;
1744 base_pri = td->td_base_pri;
1745 if (prio >= base_pri) {
1746 td->td_flags &= ~TDF_BORROWING;
1747 sched_thread_priority(td, base_pri);
1749 sched_lend_prio(td, prio);
1753 * Standard entry for setting the priority to an absolute value.
1756 sched_prio(struct thread *td, u_char prio)
1760 /* First, update the base priority. */
1761 td->td_base_pri = prio;
1764 * If the thread is borrowing another thread's priority, don't
1765 * ever lower the priority.
1767 if (td->td_flags & TDF_BORROWING && td->td_priority < prio)
1770 /* Change the real priority. */
1771 oldprio = td->td_priority;
1772 sched_thread_priority(td, prio);
1775 * If the thread is on a turnstile, then let the turnstile update
1778 if (TD_ON_LOCK(td) && oldprio != prio)
1779 turnstile_adjust(td, oldprio);
1783 * Set the base user priority, does not effect current running priority.
1786 sched_user_prio(struct thread *td, u_char prio)
1789 td->td_base_user_pri = prio;
1790 if (td->td_lend_user_pri <= prio)
1792 td->td_user_pri = prio;
1796 sched_lend_user_prio(struct thread *td, u_char prio)
1799 THREAD_LOCK_ASSERT(td, MA_OWNED);
1800 td->td_lend_user_pri = prio;
1801 td->td_user_pri = min(prio, td->td_base_user_pri);
1802 if (td->td_priority > td->td_user_pri)
1803 sched_prio(td, td->td_user_pri);
1804 else if (td->td_priority != td->td_user_pri)
1805 td->td_flags |= TDF_NEEDRESCHED;
1809 * Handle migration from sched_switch(). This happens only for
1813 sched_switch_migrate(struct tdq *tdq, struct thread *td, int flags)
1817 tdn = TDQ_CPU(td->td_sched->ts_cpu);
1819 tdq_load_rem(tdq, td);
1821 * Do the lock dance required to avoid LOR. We grab an extra
1822 * spinlock nesting to prevent preemption while we're
1823 * not holding either run-queue lock.
1826 thread_lock_block(td); /* This releases the lock on tdq. */
1829 * Acquire both run-queue locks before placing the thread on the new
1830 * run-queue to avoid deadlocks created by placing a thread with a
1831 * blocked lock on the run-queue of a remote processor. The deadlock
1832 * occurs when a third processor attempts to lock the two queues in
1833 * question while the target processor is spinning with its own
1834 * run-queue lock held while waiting for the blocked lock to clear.
1836 tdq_lock_pair(tdn, tdq);
1837 tdq_add(tdn, td, flags);
1838 tdq_notify(tdn, td);
1842 return (TDQ_LOCKPTR(tdn));
1846 * Variadic version of thread_lock_unblock() that does not assume td_lock
1850 thread_unblock_switch(struct thread *td, struct mtx *mtx)
1852 atomic_store_rel_ptr((volatile uintptr_t *)&td->td_lock,
1857 * Switch threads. This function has to handle threads coming in while
1858 * blocked for some reason, running, or idle. It also must deal with
1859 * migrating a thread from one queue to another as running threads may
1860 * be assigned elsewhere via binding.
1863 sched_switch(struct thread *td, struct thread *newtd, int flags)
1866 struct td_sched *ts;
1869 int cpuid, preempted;
1871 THREAD_LOCK_ASSERT(td, MA_OWNED);
1872 KASSERT(newtd == NULL, ("sched_switch: Unsupported newtd argument"));
1874 cpuid = PCPU_GET(cpuid);
1875 tdq = TDQ_CPU(cpuid);
1878 sched_pctcpu_update(ts, 1);
1879 ts->ts_rltick = ticks;
1880 td->td_lastcpu = td->td_oncpu;
1881 td->td_oncpu = NOCPU;
1882 preempted = !((td->td_flags & TDF_SLICEEND) ||
1883 (flags & SWT_RELINQUISH));
1884 td->td_flags &= ~(TDF_NEEDRESCHED | TDF_SLICEEND);
1885 td->td_owepreempt = 0;
1886 if (!TD_IS_IDLETHREAD(td))
1887 tdq->tdq_switchcnt++;
1889 * The lock pointer in an idle thread should never change. Reset it
1890 * to CAN_RUN as well.
1892 if (TD_IS_IDLETHREAD(td)) {
1893 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
1895 } else if (TD_IS_RUNNING(td)) {
1896 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
1897 srqflag = preempted ?
1898 SRQ_OURSELF|SRQ_YIELDING|SRQ_PREEMPTED :
1899 SRQ_OURSELF|SRQ_YIELDING;
1901 if (THREAD_CAN_MIGRATE(td) && !THREAD_CAN_SCHED(td, ts->ts_cpu))
1902 ts->ts_cpu = sched_pickcpu(td, 0);
1904 if (ts->ts_cpu == cpuid)
1905 tdq_runq_add(tdq, td, srqflag);
1907 KASSERT(THREAD_CAN_MIGRATE(td) ||
1908 (ts->ts_flags & TSF_BOUND) != 0,
1909 ("Thread %p shouldn't migrate", td));
1910 mtx = sched_switch_migrate(tdq, td, srqflag);
1913 /* This thread must be going to sleep. */
1915 mtx = thread_lock_block(td);
1916 tdq_load_rem(tdq, td);
1919 * We enter here with the thread blocked and assigned to the
1920 * appropriate cpu run-queue or sleep-queue and with the current
1921 * thread-queue locked.
1923 TDQ_LOCK_ASSERT(tdq, MA_OWNED | MA_NOTRECURSED);
1924 newtd = choosethread();
1926 * Call the MD code to switch contexts if necessary.
1930 if (PMC_PROC_IS_USING_PMCS(td->td_proc))
1931 PMC_SWITCH_CONTEXT(td, PMC_FN_CSW_OUT);
1933 SDT_PROBE2(sched, , , off__cpu, newtd, newtd->td_proc);
1934 lock_profile_release_lock(&TDQ_LOCKPTR(tdq)->lock_object);
1935 TDQ_LOCKPTR(tdq)->mtx_lock = (uintptr_t)newtd;
1936 sched_pctcpu_update(newtd->td_sched, 0);
1938 #ifdef KDTRACE_HOOKS
1940 * If DTrace has set the active vtime enum to anything
1941 * other than INACTIVE (0), then it should have set the
1944 if (dtrace_vtime_active)
1945 (*dtrace_vtime_switch_func)(newtd);
1948 cpu_switch(td, newtd, mtx);
1950 * We may return from cpu_switch on a different cpu. However,
1951 * we always return with td_lock pointing to the current cpu's
1954 cpuid = PCPU_GET(cpuid);
1955 tdq = TDQ_CPU(cpuid);
1956 lock_profile_obtain_lock_success(
1957 &TDQ_LOCKPTR(tdq)->lock_object, 0, 0, __FILE__, __LINE__);
1959 SDT_PROBE0(sched, , , on__cpu);
1961 if (PMC_PROC_IS_USING_PMCS(td->td_proc))
1962 PMC_SWITCH_CONTEXT(td, PMC_FN_CSW_IN);
1965 thread_unblock_switch(td, mtx);
1966 SDT_PROBE0(sched, , , remain__cpu);
1969 * Assert that all went well and return.
1971 TDQ_LOCK_ASSERT(tdq, MA_OWNED|MA_NOTRECURSED);
1972 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
1973 td->td_oncpu = cpuid;
1977 * Adjust thread priorities as a result of a nice request.
1980 sched_nice(struct proc *p, int nice)
1984 PROC_LOCK_ASSERT(p, MA_OWNED);
1987 FOREACH_THREAD_IN_PROC(p, td) {
1990 sched_prio(td, td->td_base_user_pri);
1996 * Record the sleep time for the interactivity scorer.
1999 sched_sleep(struct thread *td, int prio)
2002 THREAD_LOCK_ASSERT(td, MA_OWNED);
2004 td->td_slptick = ticks;
2005 if (TD_IS_SUSPENDED(td) || prio >= PSOCK)
2006 td->td_flags |= TDF_CANSWAP;
2007 if (PRI_BASE(td->td_pri_class) != PRI_TIMESHARE)
2009 if (static_boost == 1 && prio)
2010 sched_prio(td, prio);
2011 else if (static_boost && td->td_priority > static_boost)
2012 sched_prio(td, static_boost);
2016 * Schedule a thread to resume execution and record how long it voluntarily
2017 * slept. We also update the pctcpu, interactivity, and priority.
2020 sched_wakeup(struct thread *td)
2022 struct td_sched *ts;
2025 THREAD_LOCK_ASSERT(td, MA_OWNED);
2027 td->td_flags &= ~TDF_CANSWAP;
2029 * If we slept for more than a tick update our interactivity and
2032 slptick = td->td_slptick;
2034 if (slptick && slptick != ticks) {
2035 ts->ts_slptime += (ticks - slptick) << SCHED_TICK_SHIFT;
2036 sched_interact_update(td);
2037 sched_pctcpu_update(ts, 0);
2040 * Reset the slice value since we slept and advanced the round-robin.
2043 sched_add(td, SRQ_BORING);
2047 * Penalize the parent for creating a new child and initialize the child's
2051 sched_fork(struct thread *td, struct thread *child)
2053 THREAD_LOCK_ASSERT(td, MA_OWNED);
2054 sched_pctcpu_update(td->td_sched, 1);
2055 sched_fork_thread(td, child);
2057 * Penalize the parent and child for forking.
2059 sched_interact_fork(child);
2060 sched_priority(child);
2061 td->td_sched->ts_runtime += tickincr;
2062 sched_interact_update(td);
2067 * Fork a new thread, may be within the same process.
2070 sched_fork_thread(struct thread *td, struct thread *child)
2072 struct td_sched *ts;
2073 struct td_sched *ts2;
2077 THREAD_LOCK_ASSERT(td, MA_OWNED);
2082 ts2 = child->td_sched;
2083 child->td_lock = TDQ_LOCKPTR(tdq);
2084 child->td_cpuset = cpuset_ref(td->td_cpuset);
2085 ts2->ts_cpu = ts->ts_cpu;
2088 * Grab our parents cpu estimation information.
2090 ts2->ts_ticks = ts->ts_ticks;
2091 ts2->ts_ltick = ts->ts_ltick;
2092 ts2->ts_ftick = ts->ts_ftick;
2094 * Do not inherit any borrowed priority from the parent.
2096 child->td_priority = child->td_base_pri;
2098 * And update interactivity score.
2100 ts2->ts_slptime = ts->ts_slptime;
2101 ts2->ts_runtime = ts->ts_runtime;
2102 /* Attempt to quickly learn interactivity. */
2103 ts2->ts_slice = tdq_slice(tdq) - sched_slice_min;
2105 bzero(ts2->ts_name, sizeof(ts2->ts_name));
2110 * Adjust the priority class of a thread.
2113 sched_class(struct thread *td, int class)
2116 THREAD_LOCK_ASSERT(td, MA_OWNED);
2117 if (td->td_pri_class == class)
2119 td->td_pri_class = class;
2123 * Return some of the child's priority and interactivity to the parent.
2126 sched_exit(struct proc *p, struct thread *child)
2130 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(child), "proc exit",
2131 "prio:%d", child->td_priority);
2132 PROC_LOCK_ASSERT(p, MA_OWNED);
2133 td = FIRST_THREAD_IN_PROC(p);
2134 sched_exit_thread(td, child);
2138 * Penalize another thread for the time spent on this one. This helps to
2139 * worsen the priority and interactivity of processes which schedule batch
2140 * jobs such as make. This has little effect on the make process itself but
2141 * causes new processes spawned by it to receive worse scores immediately.
2144 sched_exit_thread(struct thread *td, struct thread *child)
2147 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(child), "thread exit",
2148 "prio:%d", child->td_priority);
2150 * Give the child's runtime to the parent without returning the
2151 * sleep time as a penalty to the parent. This causes shells that
2152 * launch expensive things to mark their children as expensive.
2155 td->td_sched->ts_runtime += child->td_sched->ts_runtime;
2156 sched_interact_update(td);
2162 sched_preempt(struct thread *td)
2166 SDT_PROBE2(sched, , , surrender, td, td->td_proc);
2170 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2171 tdq->tdq_ipipending = 0;
2172 if (td->td_priority > tdq->tdq_lowpri) {
2175 flags = SW_INVOL | SW_PREEMPT;
2176 if (td->td_critnest > 1)
2177 td->td_owepreempt = 1;
2178 else if (TD_IS_IDLETHREAD(td))
2179 mi_switch(flags | SWT_REMOTEWAKEIDLE, NULL);
2181 mi_switch(flags | SWT_REMOTEPREEMPT, NULL);
2187 * Fix priorities on return to user-space. Priorities may be elevated due
2188 * to static priorities in msleep() or similar.
2191 sched_userret(struct thread *td)
2194 * XXX we cheat slightly on the locking here to avoid locking in
2195 * the usual case. Setting td_priority here is essentially an
2196 * incomplete workaround for not setting it properly elsewhere.
2197 * Now that some interrupt handlers are threads, not setting it
2198 * properly elsewhere can clobber it in the window between setting
2199 * it here and returning to user mode, so don't waste time setting
2200 * it perfectly here.
2202 KASSERT((td->td_flags & TDF_BORROWING) == 0,
2203 ("thread with borrowed priority returning to userland"));
2204 if (td->td_priority != td->td_user_pri) {
2206 td->td_priority = td->td_user_pri;
2207 td->td_base_pri = td->td_user_pri;
2208 tdq_setlowpri(TDQ_SELF(), td);
2214 * Handle a stathz tick. This is really only relevant for timeshare
2218 sched_clock(struct thread *td)
2221 struct td_sched *ts;
2223 THREAD_LOCK_ASSERT(td, MA_OWNED);
2227 * We run the long term load balancer infrequently on the first cpu.
2229 if (balance_tdq == tdq) {
2230 if (balance_ticks && --balance_ticks == 0)
2235 * Save the old switch count so we have a record of the last ticks
2236 * activity. Initialize the new switch count based on our load.
2237 * If there is some activity seed it to reflect that.
2239 tdq->tdq_oldswitchcnt = tdq->tdq_switchcnt;
2240 tdq->tdq_switchcnt = tdq->tdq_load;
2242 * Advance the insert index once for each tick to ensure that all
2243 * threads get a chance to run.
2245 if (tdq->tdq_idx == tdq->tdq_ridx) {
2246 tdq->tdq_idx = (tdq->tdq_idx + 1) % RQ_NQS;
2247 if (TAILQ_EMPTY(&tdq->tdq_timeshare.rq_queues[tdq->tdq_ridx]))
2248 tdq->tdq_ridx = tdq->tdq_idx;
2251 sched_pctcpu_update(ts, 1);
2252 if (td->td_pri_class & PRI_FIFO_BIT)
2254 if (PRI_BASE(td->td_pri_class) == PRI_TIMESHARE) {
2256 * We used a tick; charge it to the thread so
2257 * that we can compute our interactivity.
2259 td->td_sched->ts_runtime += tickincr;
2260 sched_interact_update(td);
2265 * Force a context switch if the current thread has used up a full
2266 * time slice (default is 100ms).
2268 if (!TD_IS_IDLETHREAD(td) && ++ts->ts_slice >= tdq_slice(tdq)) {
2270 td->td_flags |= TDF_NEEDRESCHED | TDF_SLICEEND;
2275 * Called once per hz tick.
2284 * Return whether the current CPU has runnable tasks. Used for in-kernel
2285 * cooperative idle threads.
2288 sched_runnable(void)
2296 if ((curthread->td_flags & TDF_IDLETD) != 0) {
2297 if (tdq->tdq_load > 0)
2300 if (tdq->tdq_load - 1 > 0)
2308 * Choose the highest priority thread to run. The thread is removed from
2309 * the run-queue while running however the load remains. For SMP we set
2310 * the tdq in the global idle bitmask if it idles here.
2319 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2320 td = tdq_choose(tdq);
2322 tdq_runq_rem(tdq, td);
2323 tdq->tdq_lowpri = td->td_priority;
2326 tdq->tdq_lowpri = PRI_MAX_IDLE;
2327 return (PCPU_GET(idlethread));
2331 * Set owepreempt if necessary. Preemption never happens directly in ULE,
2332 * we always request it once we exit a critical section.
2335 sched_setpreempt(struct thread *td)
2341 THREAD_LOCK_ASSERT(curthread, MA_OWNED);
2344 pri = td->td_priority;
2345 cpri = ctd->td_priority;
2347 ctd->td_flags |= TDF_NEEDRESCHED;
2348 if (panicstr != NULL || pri >= cpri || cold || TD_IS_INHIBITED(ctd))
2350 if (!sched_shouldpreempt(pri, cpri, 0))
2352 ctd->td_owepreempt = 1;
2356 * Add a thread to a thread queue. Select the appropriate runq and add the
2357 * thread to it. This is the internal function called when the tdq is
2361 tdq_add(struct tdq *tdq, struct thread *td, int flags)
2364 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2365 KASSERT((td->td_inhibitors == 0),
2366 ("sched_add: trying to run inhibited thread"));
2367 KASSERT((TD_CAN_RUN(td) || TD_IS_RUNNING(td)),
2368 ("sched_add: bad thread state"));
2369 KASSERT(td->td_flags & TDF_INMEM,
2370 ("sched_add: thread swapped out"));
2372 if (td->td_priority < tdq->tdq_lowpri)
2373 tdq->tdq_lowpri = td->td_priority;
2374 tdq_runq_add(tdq, td, flags);
2375 tdq_load_add(tdq, td);
2379 * Select the target thread queue and add a thread to it. Request
2380 * preemption or IPI a remote processor if required.
2383 sched_add(struct thread *td, int flags)
2390 KTR_STATE2(KTR_SCHED, "thread", sched_tdname(td), "runq add",
2391 "prio:%d", td->td_priority, KTR_ATTR_LINKED,
2392 sched_tdname(curthread));
2393 KTR_POINT1(KTR_SCHED, "thread", sched_tdname(curthread), "wokeup",
2394 KTR_ATTR_LINKED, sched_tdname(td));
2395 SDT_PROBE4(sched, , , enqueue, td, td->td_proc, NULL,
2396 flags & SRQ_PREEMPTED);
2397 THREAD_LOCK_ASSERT(td, MA_OWNED);
2399 * Recalculate the priority before we select the target cpu or
2402 if (PRI_BASE(td->td_pri_class) == PRI_TIMESHARE)
2406 * Pick the destination cpu and if it isn't ours transfer to the
2409 cpu = sched_pickcpu(td, flags);
2410 tdq = sched_setcpu(td, cpu, flags);
2411 tdq_add(tdq, td, flags);
2412 if (cpu != PCPU_GET(cpuid)) {
2413 tdq_notify(tdq, td);
2420 * Now that the thread is moving to the run-queue, set the lock
2421 * to the scheduler's lock.
2423 thread_lock_set(td, TDQ_LOCKPTR(tdq));
2424 tdq_add(tdq, td, flags);
2426 if (!(flags & SRQ_YIELDING))
2427 sched_setpreempt(td);
2431 * Remove a thread from a run-queue without running it. This is used
2432 * when we're stealing a thread from a remote queue. Otherwise all threads
2433 * exit by calling sched_exit_thread() and sched_throw() themselves.
2436 sched_rem(struct thread *td)
2440 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(td), "runq rem",
2441 "prio:%d", td->td_priority);
2442 SDT_PROBE3(sched, , , dequeue, td, td->td_proc, NULL);
2443 tdq = TDQ_CPU(td->td_sched->ts_cpu);
2444 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2445 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2446 KASSERT(TD_ON_RUNQ(td),
2447 ("sched_rem: thread not on run queue"));
2448 tdq_runq_rem(tdq, td);
2449 tdq_load_rem(tdq, td);
2451 if (td->td_priority == tdq->tdq_lowpri)
2452 tdq_setlowpri(tdq, NULL);
2456 * Fetch cpu utilization information. Updates on demand.
2459 sched_pctcpu(struct thread *td)
2462 struct td_sched *ts;
2469 THREAD_LOCK_ASSERT(td, MA_OWNED);
2470 sched_pctcpu_update(ts, TD_IS_RUNNING(td));
2474 /* How many rtick per second ? */
2475 rtick = min(SCHED_TICK_HZ(ts) / SCHED_TICK_SECS, hz);
2476 pctcpu = (FSCALE * ((FSCALE * rtick)/hz)) >> FSHIFT;
2483 * Enforce affinity settings for a thread. Called after adjustments to
2487 sched_affinity(struct thread *td)
2490 struct td_sched *ts;
2492 THREAD_LOCK_ASSERT(td, MA_OWNED);
2494 if (THREAD_CAN_SCHED(td, ts->ts_cpu))
2496 if (TD_ON_RUNQ(td)) {
2498 sched_add(td, SRQ_BORING);
2501 if (!TD_IS_RUNNING(td))
2504 * Force a switch before returning to userspace. If the
2505 * target thread is not running locally send an ipi to force
2508 td->td_flags |= TDF_NEEDRESCHED;
2509 if (td != curthread)
2510 ipi_cpu(ts->ts_cpu, IPI_PREEMPT);
2515 * Bind a thread to a target cpu.
2518 sched_bind(struct thread *td, int cpu)
2520 struct td_sched *ts;
2522 THREAD_LOCK_ASSERT(td, MA_OWNED|MA_NOTRECURSED);
2523 KASSERT(td == curthread, ("sched_bind: can only bind curthread"));
2525 if (ts->ts_flags & TSF_BOUND)
2527 KASSERT(THREAD_CAN_MIGRATE(td), ("%p must be migratable", td));
2528 ts->ts_flags |= TSF_BOUND;
2530 if (PCPU_GET(cpuid) == cpu)
2533 /* When we return from mi_switch we'll be on the correct cpu. */
2534 mi_switch(SW_VOL, NULL);
2538 * Release a bound thread.
2541 sched_unbind(struct thread *td)
2543 struct td_sched *ts;
2545 THREAD_LOCK_ASSERT(td, MA_OWNED);
2546 KASSERT(td == curthread, ("sched_unbind: can only bind curthread"));
2548 if ((ts->ts_flags & TSF_BOUND) == 0)
2550 ts->ts_flags &= ~TSF_BOUND;
2555 sched_is_bound(struct thread *td)
2557 THREAD_LOCK_ASSERT(td, MA_OWNED);
2558 return (td->td_sched->ts_flags & TSF_BOUND);
2565 sched_relinquish(struct thread *td)
2568 mi_switch(SW_VOL | SWT_RELINQUISH, NULL);
2573 * Return the total system load.
2584 total += TDQ_CPU(i)->tdq_sysload;
2587 return (TDQ_SELF()->tdq_sysload);
2592 sched_sizeof_proc(void)
2594 return (sizeof(struct proc));
2598 sched_sizeof_thread(void)
2600 return (sizeof(struct thread) + sizeof(struct td_sched));
2604 #define TDQ_IDLESPIN(tdq) \
2605 ((tdq)->tdq_cg != NULL && ((tdq)->tdq_cg->cg_flags & CG_FLAG_THREAD) == 0)
2607 #define TDQ_IDLESPIN(tdq) 1
2611 * The actual idle process.
2614 sched_idletd(void *dummy)
2618 int oldswitchcnt, switchcnt;
2621 mtx_assert(&Giant, MA_NOTOWNED);
2624 THREAD_NO_SLEEPING();
2627 if (tdq->tdq_load) {
2629 mi_switch(SW_VOL | SWT_IDLE, NULL);
2632 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2634 if (switchcnt != oldswitchcnt) {
2635 oldswitchcnt = switchcnt;
2636 if (tdq_idled(tdq) == 0)
2639 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2641 oldswitchcnt = switchcnt;
2644 * If we're switching very frequently, spin while checking
2645 * for load rather than entering a low power state that
2646 * may require an IPI. However, don't do any busy
2647 * loops while on SMT machines as this simply steals
2648 * cycles from cores doing useful work.
2650 if (TDQ_IDLESPIN(tdq) && switchcnt > sched_idlespinthresh) {
2651 for (i = 0; i < sched_idlespins; i++) {
2658 /* If there was context switch during spin, restart it. */
2659 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2660 if (tdq->tdq_load != 0 || switchcnt != oldswitchcnt)
2663 /* Run main MD idle handler. */
2664 tdq->tdq_cpu_idle = 1;
2666 * Make sure that tdq_cpu_idle update is globally visible
2667 * before cpu_idle() read tdq_load. The order is important
2668 * to avoid race with tdq_notify.
2670 atomic_thread_fence_seq_cst();
2671 cpu_idle(switchcnt * 4 > sched_idlespinthresh);
2672 tdq->tdq_cpu_idle = 0;
2675 * Account thread-less hardware interrupts and
2676 * other wakeup reasons equal to context switches.
2678 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2679 if (switchcnt != oldswitchcnt)
2681 tdq->tdq_switchcnt++;
2687 * A CPU is entering for the first time or a thread is exiting.
2690 sched_throw(struct thread *td)
2692 struct thread *newtd;
2697 /* Correct spinlock nesting and acquire the correct lock. */
2700 PCPU_SET(switchtime, cpu_ticks());
2701 PCPU_SET(switchticks, ticks);
2703 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2704 tdq_load_rem(tdq, td);
2705 lock_profile_release_lock(&TDQ_LOCKPTR(tdq)->lock_object);
2707 KASSERT(curthread->td_md.md_spinlock_count == 1, ("invalid count"));
2708 newtd = choosethread();
2709 TDQ_LOCKPTR(tdq)->mtx_lock = (uintptr_t)newtd;
2710 cpu_throw(td, newtd); /* doesn't return */
2714 * This is called from fork_exit(). Just acquire the correct locks and
2715 * let fork do the rest of the work.
2718 sched_fork_exit(struct thread *td)
2724 * Finish setting up thread glue so that it begins execution in a
2725 * non-nested critical section with the scheduler lock held.
2727 cpuid = PCPU_GET(cpuid);
2728 tdq = TDQ_CPU(cpuid);
2729 if (TD_IS_IDLETHREAD(td))
2730 td->td_lock = TDQ_LOCKPTR(tdq);
2731 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2732 td->td_oncpu = cpuid;
2733 TDQ_LOCK_ASSERT(tdq, MA_OWNED | MA_NOTRECURSED);
2734 lock_profile_obtain_lock_success(
2735 &TDQ_LOCKPTR(tdq)->lock_object, 0, 0, __FILE__, __LINE__);
2739 * Create on first use to catch odd startup conditons.
2742 sched_tdname(struct thread *td)
2745 struct td_sched *ts;
2748 if (ts->ts_name[0] == '\0')
2749 snprintf(ts->ts_name, sizeof(ts->ts_name),
2750 "%s tid %d", td->td_name, td->td_tid);
2751 return (ts->ts_name);
2753 return (td->td_name);
2759 sched_clear_tdname(struct thread *td)
2761 struct td_sched *ts;
2764 ts->ts_name[0] = '\0';
2771 * Build the CPU topology dump string. Is recursively called to collect
2772 * the topology tree.
2775 sysctl_kern_sched_topology_spec_internal(struct sbuf *sb, struct cpu_group *cg,
2778 char cpusetbuf[CPUSETBUFSIZ];
2781 sbuf_printf(sb, "%*s<group level=\"%d\" cache-level=\"%d\">\n", indent,
2782 "", 1 + indent / 2, cg->cg_level);
2783 sbuf_printf(sb, "%*s <cpu count=\"%d\" mask=\"%s\">", indent, "",
2784 cg->cg_count, cpusetobj_strprint(cpusetbuf, &cg->cg_mask));
2786 for (i = 0; i < MAXCPU; i++) {
2787 if (CPU_ISSET(i, &cg->cg_mask)) {
2789 sbuf_printf(sb, ", ");
2792 sbuf_printf(sb, "%d", i);
2795 sbuf_printf(sb, "</cpu>\n");
2797 if (cg->cg_flags != 0) {
2798 sbuf_printf(sb, "%*s <flags>", indent, "");
2799 if ((cg->cg_flags & CG_FLAG_HTT) != 0)
2800 sbuf_printf(sb, "<flag name=\"HTT\">HTT group</flag>");
2801 if ((cg->cg_flags & CG_FLAG_THREAD) != 0)
2802 sbuf_printf(sb, "<flag name=\"THREAD\">THREAD group</flag>");
2803 if ((cg->cg_flags & CG_FLAG_SMT) != 0)
2804 sbuf_printf(sb, "<flag name=\"SMT\">SMT group</flag>");
2805 sbuf_printf(sb, "</flags>\n");
2808 if (cg->cg_children > 0) {
2809 sbuf_printf(sb, "%*s <children>\n", indent, "");
2810 for (i = 0; i < cg->cg_children; i++)
2811 sysctl_kern_sched_topology_spec_internal(sb,
2812 &cg->cg_child[i], indent+2);
2813 sbuf_printf(sb, "%*s </children>\n", indent, "");
2815 sbuf_printf(sb, "%*s</group>\n", indent, "");
2820 * Sysctl handler for retrieving topology dump. It's a wrapper for
2821 * the recursive sysctl_kern_smp_topology_spec_internal().
2824 sysctl_kern_sched_topology_spec(SYSCTL_HANDLER_ARGS)
2829 KASSERT(cpu_top != NULL, ("cpu_top isn't initialized"));
2831 topo = sbuf_new_for_sysctl(NULL, NULL, 512, req);
2835 sbuf_printf(topo, "<groups>\n");
2836 err = sysctl_kern_sched_topology_spec_internal(topo, cpu_top, 1);
2837 sbuf_printf(topo, "</groups>\n");
2840 err = sbuf_finish(topo);
2849 sysctl_kern_quantum(SYSCTL_HANDLER_ARGS)
2851 int error, new_val, period;
2853 period = 1000000 / realstathz;
2854 new_val = period * sched_slice;
2855 error = sysctl_handle_int(oidp, &new_val, 0, req);
2856 if (error != 0 || req->newptr == NULL)
2860 sched_slice = imax(1, (new_val + period / 2) / period);
2861 sched_slice_min = sched_slice / SCHED_SLICE_MIN_DIVISOR;
2862 hogticks = imax(1, (2 * hz * sched_slice + realstathz / 2) /
2867 SYSCTL_NODE(_kern, OID_AUTO, sched, CTLFLAG_RW, 0, "Scheduler");
2868 SYSCTL_STRING(_kern_sched, OID_AUTO, name, CTLFLAG_RD, "ULE", 0,
2870 SYSCTL_PROC(_kern_sched, OID_AUTO, quantum, CTLTYPE_INT | CTLFLAG_RW,
2871 NULL, 0, sysctl_kern_quantum, "I",
2872 "Quantum for timeshare threads in microseconds");
2873 SYSCTL_INT(_kern_sched, OID_AUTO, slice, CTLFLAG_RW, &sched_slice, 0,
2874 "Quantum for timeshare threads in stathz ticks");
2875 SYSCTL_INT(_kern_sched, OID_AUTO, interact, CTLFLAG_RW, &sched_interact, 0,
2876 "Interactivity score threshold");
2877 SYSCTL_INT(_kern_sched, OID_AUTO, preempt_thresh, CTLFLAG_RW,
2879 "Maximal (lowest) priority for preemption");
2880 SYSCTL_INT(_kern_sched, OID_AUTO, static_boost, CTLFLAG_RW, &static_boost, 0,
2881 "Assign static kernel priorities to sleeping threads");
2882 SYSCTL_INT(_kern_sched, OID_AUTO, idlespins, CTLFLAG_RW, &sched_idlespins, 0,
2883 "Number of times idle thread will spin waiting for new work");
2884 SYSCTL_INT(_kern_sched, OID_AUTO, idlespinthresh, CTLFLAG_RW,
2885 &sched_idlespinthresh, 0,
2886 "Threshold before we will permit idle thread spinning");
2888 SYSCTL_INT(_kern_sched, OID_AUTO, affinity, CTLFLAG_RW, &affinity, 0,
2889 "Number of hz ticks to keep thread affinity for");
2890 SYSCTL_INT(_kern_sched, OID_AUTO, balance, CTLFLAG_RW, &rebalance, 0,
2891 "Enables the long-term load balancer");
2892 SYSCTL_INT(_kern_sched, OID_AUTO, balance_interval, CTLFLAG_RW,
2893 &balance_interval, 0,
2894 "Average period in stathz ticks to run the long-term balancer");
2895 SYSCTL_INT(_kern_sched, OID_AUTO, steal_idle, CTLFLAG_RW, &steal_idle, 0,
2896 "Attempts to steal work from other cores before idling");
2897 SYSCTL_INT(_kern_sched, OID_AUTO, steal_thresh, CTLFLAG_RW, &steal_thresh, 0,
2898 "Minimum load on remote CPU before we'll steal");
2899 SYSCTL_PROC(_kern_sched, OID_AUTO, topology_spec, CTLTYPE_STRING |
2900 CTLFLAG_RD, NULL, 0, sysctl_kern_sched_topology_spec, "A",
2901 "XML dump of detected CPU topology");
2904 /* ps compat. All cpu percentages from ULE are weighted. */
2905 static int ccpu = 0;
2906 SYSCTL_INT(_kern, OID_AUTO, ccpu, CTLFLAG_RD, &ccpu, 0, "");