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_kdtrace.h"
43 #include "opt_sched.h"
45 #include <sys/param.h>
46 #include <sys/systm.h>
48 #include <sys/kernel.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>
80 #if defined(__powerpc__) && defined(E500)
81 #error "This architecture is not currently compatible with ULE"
86 #define TS_NAME_LEN (MAXCOMLEN + sizeof(" td ") + sizeof(__XSTRING(UINT_MAX)))
87 #define TDQ_NAME_LEN (sizeof("sched lock ") + sizeof(__XSTRING(MAXCPU)))
88 #define TDQ_LOADNAME_LEN (sizeof("CPU ") + sizeof(__XSTRING(MAXCPU)) - 1 + sizeof(" load"))
91 * Thread scheduler specific section. All fields are protected
95 struct runq *ts_runq; /* Run-queue we're queued on. */
96 short ts_flags; /* TSF_* flags. */
97 u_char ts_cpu; /* CPU that we have affinity for. */
98 int ts_rltick; /* Real last tick, for affinity. */
99 int ts_slice; /* Ticks of slice remaining. */
100 u_int ts_slptime; /* Number of ticks we vol. slept */
101 u_int ts_runtime; /* Number of ticks we were running */
102 int ts_ltick; /* Last tick that we were running on */
103 int ts_ftick; /* First tick that we were running on */
104 int ts_ticks; /* Tick count */
106 char ts_name[TS_NAME_LEN];
109 /* flags kept in ts_flags */
110 #define TSF_BOUND 0x0001 /* Thread can not migrate. */
111 #define TSF_XFERABLE 0x0002 /* Thread was added as transferable. */
113 static struct td_sched td_sched0;
115 #define THREAD_CAN_MIGRATE(td) ((td)->td_pinned == 0)
116 #define THREAD_CAN_SCHED(td, cpu) \
117 CPU_ISSET((cpu), &(td)->td_cpuset->cs_mask)
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 * tickincr: Converts a stathz tick into a hz domain scaled by
194 * the shift factor. Without the shift the error rate
195 * due to rounding would be unacceptably high.
196 * realstathz: stathz is sometimes 0 and run off of hz.
197 * sched_slice: Runtime of each thread before rescheduling.
198 * preempt_thresh: Priority threshold for preemption and remote IPIs.
200 static int sched_interact = SCHED_INTERACT_THRESH;
201 static int realstathz;
203 static int sched_slice = 1;
205 #ifdef FULL_PREEMPTION
206 static int preempt_thresh = PRI_MAX_IDLE;
208 static int preempt_thresh = PRI_MIN_KERN;
211 static int preempt_thresh = 0;
213 static int static_boost = PRI_MIN_BATCH;
214 static int sched_idlespins = 10000;
215 static int sched_idlespinthresh = -1;
218 * tdq - per processor runqs and statistics. All fields are protected by the
219 * tdq_lock. The load and lowpri may be accessed without to avoid excess
220 * locking in sched_pickcpu();
223 /* Ordered to improve efficiency of cpu_search() and switch(). */
224 struct mtx tdq_lock; /* run queue lock. */
225 struct cpu_group *tdq_cg; /* Pointer to cpu topology. */
226 volatile int tdq_load; /* Aggregate load. */
227 volatile int tdq_cpu_idle; /* cpu_idle() is active. */
228 int tdq_sysload; /* For loadavg, !ITHD load. */
229 int tdq_transferable; /* Transferable thread count. */
230 short tdq_switchcnt; /* Switches this tick. */
231 short tdq_oldswitchcnt; /* Switches last tick. */
232 u_char tdq_lowpri; /* Lowest priority thread. */
233 u_char tdq_ipipending; /* IPI pending. */
234 u_char tdq_idx; /* Current insert index. */
235 u_char tdq_ridx; /* Current removal index. */
236 struct runq tdq_realtime; /* real-time run queue. */
237 struct runq tdq_timeshare; /* timeshare run queue. */
238 struct runq tdq_idle; /* Queue of IDLE threads. */
239 char tdq_name[TDQ_NAME_LEN];
241 char tdq_loadname[TDQ_LOADNAME_LEN];
245 /* Idle thread states and config. */
246 #define TDQ_RUNNING 1
250 struct cpu_group *cpu_top; /* CPU topology */
252 #define SCHED_AFFINITY_DEFAULT (max(1, hz / 1000))
253 #define SCHED_AFFINITY(ts, t) ((ts)->ts_rltick > ticks - ((t) * affinity))
258 static int rebalance = 1;
259 static int balance_interval = 128; /* Default set in sched_initticks(). */
261 static int steal_idle = 1;
262 static int steal_thresh = 2;
265 * One thread queue per processor.
267 static struct tdq tdq_cpu[MAXCPU];
268 static struct tdq *balance_tdq;
269 static int balance_ticks;
270 static DPCPU_DEFINE(uint32_t, randomval);
272 #define TDQ_SELF() (&tdq_cpu[PCPU_GET(cpuid)])
273 #define TDQ_CPU(x) (&tdq_cpu[(x)])
274 #define TDQ_ID(x) ((int)((x) - tdq_cpu))
276 static struct tdq tdq_cpu;
278 #define TDQ_ID(x) (0)
279 #define TDQ_SELF() (&tdq_cpu)
280 #define TDQ_CPU(x) (&tdq_cpu)
283 #define TDQ_LOCK_ASSERT(t, type) mtx_assert(TDQ_LOCKPTR((t)), (type))
284 #define TDQ_LOCK(t) mtx_lock_spin(TDQ_LOCKPTR((t)))
285 #define TDQ_LOCK_FLAGS(t, f) mtx_lock_spin_flags(TDQ_LOCKPTR((t)), (f))
286 #define TDQ_UNLOCK(t) mtx_unlock_spin(TDQ_LOCKPTR((t)))
287 #define TDQ_LOCKPTR(t) (&(t)->tdq_lock)
289 static void sched_priority(struct thread *);
290 static void sched_thread_priority(struct thread *, u_char);
291 static int sched_interact_score(struct thread *);
292 static void sched_interact_update(struct thread *);
293 static void sched_interact_fork(struct thread *);
294 static void sched_pctcpu_update(struct td_sched *, int);
296 /* Operations on per processor queues */
297 static struct thread *tdq_choose(struct tdq *);
298 static void tdq_setup(struct tdq *);
299 static void tdq_load_add(struct tdq *, struct thread *);
300 static void tdq_load_rem(struct tdq *, struct thread *);
301 static __inline void tdq_runq_add(struct tdq *, struct thread *, int);
302 static __inline void tdq_runq_rem(struct tdq *, struct thread *);
303 static inline int sched_shouldpreempt(int, int, int);
304 void tdq_print(int cpu);
305 static void runq_print(struct runq *rq);
306 static void tdq_add(struct tdq *, struct thread *, int);
308 static int tdq_move(struct tdq *, struct tdq *);
309 static int tdq_idled(struct tdq *);
310 static void tdq_notify(struct tdq *, struct thread *);
311 static struct thread *tdq_steal(struct tdq *, int);
312 static struct thread *runq_steal(struct runq *, int);
313 static int sched_pickcpu(struct thread *, int);
314 static void sched_balance(void);
315 static int sched_balance_pair(struct tdq *, struct tdq *);
316 static inline struct tdq *sched_setcpu(struct thread *, int, int);
317 static inline void thread_unblock_switch(struct thread *, struct mtx *);
318 static struct mtx *sched_switch_migrate(struct tdq *, struct thread *, int);
319 static int sysctl_kern_sched_topology_spec(SYSCTL_HANDLER_ARGS);
320 static int sysctl_kern_sched_topology_spec_internal(struct sbuf *sb,
321 struct cpu_group *cg, int indent);
324 static void sched_setup(void *dummy);
325 SYSINIT(sched_setup, SI_SUB_RUN_QUEUE, SI_ORDER_FIRST, sched_setup, NULL);
327 static void sched_initticks(void *dummy);
328 SYSINIT(sched_initticks, SI_SUB_CLOCKS, SI_ORDER_THIRD, sched_initticks,
331 SDT_PROVIDER_DEFINE(sched);
333 SDT_PROBE_DEFINE3(sched, , , change_pri, change-pri, "struct thread *",
334 "struct proc *", "uint8_t");
335 SDT_PROBE_DEFINE3(sched, , , dequeue, dequeue, "struct thread *",
336 "struct proc *", "void *");
337 SDT_PROBE_DEFINE4(sched, , , enqueue, enqueue, "struct thread *",
338 "struct proc *", "void *", "int");
339 SDT_PROBE_DEFINE4(sched, , , lend_pri, lend-pri, "struct thread *",
340 "struct proc *", "uint8_t", "struct thread *");
341 SDT_PROBE_DEFINE2(sched, , , load_change, load-change, "int", "int");
342 SDT_PROBE_DEFINE2(sched, , , off_cpu, off-cpu, "struct thread *",
344 SDT_PROBE_DEFINE(sched, , , on_cpu, on-cpu);
345 SDT_PROBE_DEFINE(sched, , , remain_cpu, remain-cpu);
346 SDT_PROBE_DEFINE2(sched, , , surrender, surrender, "struct thread *",
350 * Print the threads waiting on a run-queue.
353 runq_print(struct runq *rq)
361 for (i = 0; i < RQB_LEN; i++) {
362 printf("\t\trunq bits %d 0x%zx\n",
363 i, rq->rq_status.rqb_bits[i]);
364 for (j = 0; j < RQB_BPW; j++)
365 if (rq->rq_status.rqb_bits[i] & (1ul << j)) {
366 pri = j + (i << RQB_L2BPW);
367 rqh = &rq->rq_queues[pri];
368 TAILQ_FOREACH(td, rqh, td_runq) {
369 printf("\t\t\ttd %p(%s) priority %d rqindex %d pri %d\n",
370 td, td->td_name, td->td_priority,
371 td->td_rqindex, pri);
378 * Print the status of a per-cpu thread queue. Should be a ddb show cmd.
387 printf("tdq %d:\n", TDQ_ID(tdq));
388 printf("\tlock %p\n", TDQ_LOCKPTR(tdq));
389 printf("\tLock name: %s\n", tdq->tdq_name);
390 printf("\tload: %d\n", tdq->tdq_load);
391 printf("\tswitch cnt: %d\n", tdq->tdq_switchcnt);
392 printf("\told switch cnt: %d\n", tdq->tdq_oldswitchcnt);
393 printf("\ttimeshare idx: %d\n", tdq->tdq_idx);
394 printf("\ttimeshare ridx: %d\n", tdq->tdq_ridx);
395 printf("\tload transferable: %d\n", tdq->tdq_transferable);
396 printf("\tlowest priority: %d\n", tdq->tdq_lowpri);
397 printf("\trealtime runq:\n");
398 runq_print(&tdq->tdq_realtime);
399 printf("\ttimeshare runq:\n");
400 runq_print(&tdq->tdq_timeshare);
401 printf("\tidle runq:\n");
402 runq_print(&tdq->tdq_idle);
406 sched_shouldpreempt(int pri, int cpri, int remote)
409 * If the new priority is not better than the current priority there is
415 * Always preempt idle.
417 if (cpri >= PRI_MIN_IDLE)
420 * If preemption is disabled don't preempt others.
422 if (preempt_thresh == 0)
425 * Preempt if we exceed the threshold.
427 if (pri <= preempt_thresh)
430 * If we're interactive or better and there is non-interactive
431 * or worse running preempt only remote processors.
433 if (remote && pri <= PRI_MAX_INTERACT && cpri > PRI_MAX_INTERACT)
439 * Add a thread to the actual run-queue. Keeps transferable counts up to
440 * date with what is actually on the run-queue. Selects the correct
441 * queue position for timeshare threads.
444 tdq_runq_add(struct tdq *tdq, struct thread *td, int flags)
449 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
450 THREAD_LOCK_ASSERT(td, MA_OWNED);
452 pri = td->td_priority;
455 if (THREAD_CAN_MIGRATE(td)) {
456 tdq->tdq_transferable++;
457 ts->ts_flags |= TSF_XFERABLE;
459 if (pri < PRI_MIN_BATCH) {
460 ts->ts_runq = &tdq->tdq_realtime;
461 } else if (pri <= PRI_MAX_BATCH) {
462 ts->ts_runq = &tdq->tdq_timeshare;
463 KASSERT(pri <= PRI_MAX_BATCH && pri >= PRI_MIN_BATCH,
464 ("Invalid priority %d on timeshare runq", pri));
466 * This queue contains only priorities between MIN and MAX
467 * realtime. Use the whole queue to represent these values.
469 if ((flags & (SRQ_BORROWING|SRQ_PREEMPTED)) == 0) {
470 pri = RQ_NQS * (pri - PRI_MIN_BATCH) / PRI_BATCH_RANGE;
471 pri = (pri + tdq->tdq_idx) % RQ_NQS;
473 * This effectively shortens the queue by one so we
474 * can have a one slot difference between idx and
475 * ridx while we wait for threads to drain.
477 if (tdq->tdq_ridx != tdq->tdq_idx &&
478 pri == tdq->tdq_ridx)
479 pri = (unsigned char)(pri - 1) % RQ_NQS;
482 runq_add_pri(ts->ts_runq, td, pri, flags);
485 ts->ts_runq = &tdq->tdq_idle;
486 runq_add(ts->ts_runq, td, flags);
490 * Remove a thread from a run-queue. This typically happens when a thread
491 * is selected to run. Running threads are not on the queue and the
492 * transferable count does not reflect them.
495 tdq_runq_rem(struct tdq *tdq, struct thread *td)
500 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
501 KASSERT(ts->ts_runq != NULL,
502 ("tdq_runq_remove: thread %p null ts_runq", td));
503 if (ts->ts_flags & TSF_XFERABLE) {
504 tdq->tdq_transferable--;
505 ts->ts_flags &= ~TSF_XFERABLE;
507 if (ts->ts_runq == &tdq->tdq_timeshare) {
508 if (tdq->tdq_idx != tdq->tdq_ridx)
509 runq_remove_idx(ts->ts_runq, td, &tdq->tdq_ridx);
511 runq_remove_idx(ts->ts_runq, td, NULL);
513 runq_remove(ts->ts_runq, td);
517 * Load is maintained for all threads RUNNING and ON_RUNQ. Add the load
518 * for this thread to the referenced thread queue.
521 tdq_load_add(struct tdq *tdq, struct thread *td)
524 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
525 THREAD_LOCK_ASSERT(td, MA_OWNED);
528 if ((td->td_flags & TDF_NOLOAD) == 0)
530 KTR_COUNTER0(KTR_SCHED, "load", tdq->tdq_loadname, tdq->tdq_load);
531 SDT_PROBE2(sched, , , load_change, (int)TDQ_ID(tdq), tdq->tdq_load);
535 * Remove the load from a thread that is transitioning to a sleep state or
539 tdq_load_rem(struct tdq *tdq, struct thread *td)
542 THREAD_LOCK_ASSERT(td, MA_OWNED);
543 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
544 KASSERT(tdq->tdq_load != 0,
545 ("tdq_load_rem: Removing with 0 load on queue %d", TDQ_ID(tdq)));
548 if ((td->td_flags & TDF_NOLOAD) == 0)
550 KTR_COUNTER0(KTR_SCHED, "load", tdq->tdq_loadname, tdq->tdq_load);
551 SDT_PROBE2(sched, , , load_change, (int)TDQ_ID(tdq), tdq->tdq_load);
555 * Set lowpri to its exact value by searching the run-queue and
556 * evaluating curthread. curthread may be passed as an optimization.
559 tdq_setlowpri(struct tdq *tdq, struct thread *ctd)
563 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
565 ctd = pcpu_find(TDQ_ID(tdq))->pc_curthread;
566 td = tdq_choose(tdq);
567 if (td == NULL || td->td_priority > ctd->td_priority)
568 tdq->tdq_lowpri = ctd->td_priority;
570 tdq->tdq_lowpri = td->td_priority;
577 int cs_pri; /* Min priority for low. */
578 int cs_limit; /* Max load for low, min load for high. */
583 #define CPU_SEARCH_LOWEST 0x1
584 #define CPU_SEARCH_HIGHEST 0x2
585 #define CPU_SEARCH_BOTH (CPU_SEARCH_LOWEST|CPU_SEARCH_HIGHEST)
587 #define CPUSET_FOREACH(cpu, mask) \
588 for ((cpu) = 0; (cpu) <= mp_maxid; (cpu)++) \
589 if (CPU_ISSET(cpu, &mask))
591 static __inline int cpu_search(const struct cpu_group *cg, struct cpu_search *low,
592 struct cpu_search *high, const int match);
593 int cpu_search_lowest(const struct cpu_group *cg, struct cpu_search *low);
594 int cpu_search_highest(const struct cpu_group *cg, struct cpu_search *high);
595 int cpu_search_both(const struct cpu_group *cg, struct cpu_search *low,
596 struct cpu_search *high);
599 * Search the tree of cpu_groups for the lowest or highest loaded cpu
600 * according to the match argument. This routine actually compares the
601 * load on all paths through the tree and finds the least loaded cpu on
602 * the least loaded path, which may differ from the least loaded cpu in
603 * the system. This balances work among caches and busses.
605 * This inline is instantiated in three forms below using constants for the
606 * match argument. It is reduced to the minimum set for each case. It is
607 * also recursive to the depth of the tree.
610 cpu_search(const struct cpu_group *cg, struct cpu_search *low,
611 struct cpu_search *high, const int match)
613 struct cpu_search lgroup;
614 struct cpu_search hgroup;
616 struct cpu_group *child;
618 int cpu, i, hload, lload, load, total, rnd;
621 cpumask = cg->cg_mask;
622 if (match & CPU_SEARCH_LOWEST) {
624 low->cs_load = INT_MAX;
627 if (match & CPU_SEARCH_HIGHEST) {
633 /* Iterate through the child CPU groups and then remaining CPUs. */
634 for (i = 0, cpu = 0; i <= cg->cg_children; ) {
635 if (i >= cg->cg_children) {
636 while (cpu <= mp_maxid && !CPU_ISSET(cpu, &cpumask))
642 child = &cg->cg_child[i];
644 if (child) { /* Handle child CPU group. */
645 CPU_NAND(&cpumask, &child->cg_mask);
647 case CPU_SEARCH_LOWEST:
648 load = cpu_search_lowest(child, &lgroup);
650 case CPU_SEARCH_HIGHEST:
651 load = cpu_search_highest(child, &hgroup);
653 case CPU_SEARCH_BOTH:
654 load = cpu_search_both(child, &lgroup, &hgroup);
657 } else { /* Handle child CPU. */
659 load = tdq->tdq_load * 256;
660 rnd = DPCPU_SET(randomval,
661 DPCPU_GET(randomval) * 69069 + 5) >> 26;
662 if (match & CPU_SEARCH_LOWEST) {
663 if (cpu == low->cs_prefer)
665 /* If that CPU is allowed and get data. */
666 if (CPU_ISSET(cpu, &lgroup.cs_mask) &&
667 tdq->tdq_lowpri > lgroup.cs_pri &&
668 tdq->tdq_load <= lgroup.cs_limit) {
670 lgroup.cs_load = load - rnd;
673 if (match & CPU_SEARCH_HIGHEST)
674 if (CPU_ISSET(cpu, &hgroup.cs_mask) &&
675 tdq->tdq_load >= hgroup.cs_limit &&
676 tdq->tdq_transferable) {
678 hgroup.cs_load = load - rnd;
683 /* We have info about child item. Compare it. */
684 if (match & CPU_SEARCH_LOWEST) {
685 if (lgroup.cs_load != INT_MAX &&
687 (load == lload && lgroup.cs_load < low->cs_load))) {
689 low->cs_cpu = lgroup.cs_cpu;
690 low->cs_load = lgroup.cs_load;
693 if (match & CPU_SEARCH_HIGHEST)
694 if (hgroup.cs_load >= 0 &&
696 (load == hload && hgroup.cs_load > high->cs_load))) {
698 high->cs_cpu = hgroup.cs_cpu;
699 high->cs_load = hgroup.cs_load;
710 * cpu_search instantiations must pass constants to maintain the inline
714 cpu_search_lowest(const struct cpu_group *cg, struct cpu_search *low)
716 return cpu_search(cg, low, NULL, CPU_SEARCH_LOWEST);
720 cpu_search_highest(const struct cpu_group *cg, struct cpu_search *high)
722 return cpu_search(cg, NULL, high, CPU_SEARCH_HIGHEST);
726 cpu_search_both(const struct cpu_group *cg, struct cpu_search *low,
727 struct cpu_search *high)
729 return cpu_search(cg, low, high, CPU_SEARCH_BOTH);
733 * Find the cpu with the least load via the least loaded path that has a
734 * lowpri greater than pri pri. A pri of -1 indicates any priority is
738 sched_lowest(const struct cpu_group *cg, cpuset_t mask, int pri, int maxload,
741 struct cpu_search low;
744 low.cs_prefer = prefer;
747 low.cs_limit = maxload;
748 cpu_search_lowest(cg, &low);
753 * Find the cpu with the highest load via the highest loaded path.
756 sched_highest(const struct cpu_group *cg, cpuset_t mask, int minload)
758 struct cpu_search high;
762 high.cs_limit = minload;
763 cpu_search_highest(cg, &high);
768 * Simultaneously find the highest and lowest loaded cpu reachable via
772 sched_both(const struct cpu_group *cg, cpuset_t mask, int *lowcpu, int *highcpu)
774 struct cpu_search high;
775 struct cpu_search low;
780 low.cs_limit = INT_MAX;
785 cpu_search_both(cg, &low, &high);
786 *lowcpu = low.cs_cpu;
787 *highcpu = high.cs_cpu;
792 sched_balance_group(struct cpu_group *cg)
794 cpuset_t hmask, lmask;
795 int high, low, anylow;
799 high = sched_highest(cg, hmask, 1);
800 /* Stop if there is no more CPU with transferrable threads. */
803 CPU_CLR(high, &hmask);
804 CPU_COPY(&hmask, &lmask);
805 /* Stop if there is no more CPU left for low. */
806 if (CPU_EMPTY(&lmask))
810 low = sched_lowest(cg, lmask, -1,
811 TDQ_CPU(high)->tdq_load - 1, high);
812 /* Stop if we looked well and found no less loaded CPU. */
813 if (anylow && low == -1)
815 /* Go to next high if we found no less loaded CPU. */
818 /* Transfer thread from high to low. */
819 if (sched_balance_pair(TDQ_CPU(high), TDQ_CPU(low))) {
820 /* CPU that got thread can no longer be a donor. */
821 CPU_CLR(low, &hmask);
824 * If failed, then there is no threads on high
825 * that can run on this low. Drop low from low
826 * mask and look for different one.
828 CPU_CLR(low, &lmask);
841 * Select a random time between .5 * balance_interval and
842 * 1.5 * balance_interval.
844 balance_ticks = max(balance_interval / 2, 1);
845 balance_ticks += random() % balance_interval;
846 if (smp_started == 0 || rebalance == 0)
850 sched_balance_group(cpu_top);
855 * Lock two thread queues using their address to maintain lock order.
858 tdq_lock_pair(struct tdq *one, struct tdq *two)
862 TDQ_LOCK_FLAGS(two, MTX_DUPOK);
865 TDQ_LOCK_FLAGS(one, MTX_DUPOK);
870 * Unlock two thread queues. Order is not important here.
873 tdq_unlock_pair(struct tdq *one, struct tdq *two)
880 * Transfer load between two imbalanced thread queues.
883 sched_balance_pair(struct tdq *high, struct tdq *low)
888 tdq_lock_pair(high, low);
891 * Determine what the imbalance is and then adjust that to how many
892 * threads we actually have to give up (transferable).
894 if (high->tdq_transferable != 0 && high->tdq_load > low->tdq_load &&
895 (moved = tdq_move(high, low)) > 0) {
897 * In case the target isn't the current cpu IPI it to force a
898 * reschedule with the new workload.
902 if (cpu != PCPU_GET(cpuid))
903 ipi_cpu(cpu, IPI_PREEMPT);
906 tdq_unlock_pair(high, low);
911 * Move a thread from one thread queue to another.
914 tdq_move(struct tdq *from, struct tdq *to)
921 TDQ_LOCK_ASSERT(from, MA_OWNED);
922 TDQ_LOCK_ASSERT(to, MA_OWNED);
926 td = tdq_steal(tdq, cpu);
931 * Although the run queue is locked the thread may be blocked. Lock
932 * it to clear this and acquire the run-queue lock.
935 /* Drop recursive lock on from acquired via thread_lock(). */
939 td->td_lock = TDQ_LOCKPTR(to);
940 tdq_add(to, td, SRQ_YIELDING);
945 * This tdq has idled. Try to steal a thread from another cpu and switch
949 tdq_idled(struct tdq *tdq)
951 struct cpu_group *cg;
957 if (smp_started == 0 || steal_idle == 0)
960 CPU_CLR(PCPU_GET(cpuid), &mask);
961 /* We don't want to be preempted while we're iterating. */
963 for (cg = tdq->tdq_cg; cg != NULL; ) {
964 if ((cg->cg_flags & CG_FLAG_THREAD) == 0)
965 thresh = steal_thresh;
968 cpu = sched_highest(cg, mask, thresh);
973 steal = TDQ_CPU(cpu);
975 tdq_lock_pair(tdq, steal);
976 if (steal->tdq_load < thresh || steal->tdq_transferable == 0) {
977 tdq_unlock_pair(tdq, steal);
981 * If a thread was added while interrupts were disabled don't
982 * steal one here. If we fail to acquire one due to affinity
983 * restrictions loop again with this cpu removed from the
986 if (tdq->tdq_load == 0 && tdq_move(steal, tdq) == 0) {
987 tdq_unlock_pair(tdq, steal);
992 mi_switch(SW_VOL | SWT_IDLE, NULL);
993 thread_unlock(curthread);
1002 * Notify a remote cpu of new work. Sends an IPI if criteria are met.
1005 tdq_notify(struct tdq *tdq, struct thread *td)
1011 if (tdq->tdq_ipipending)
1013 cpu = td->td_sched->ts_cpu;
1014 pri = td->td_priority;
1015 ctd = pcpu_find(cpu)->pc_curthread;
1016 if (!sched_shouldpreempt(pri, ctd->td_priority, 1))
1018 if (TD_IS_IDLETHREAD(ctd)) {
1020 * If the MD code has an idle wakeup routine try that before
1021 * falling back to IPI.
1023 if (!tdq->tdq_cpu_idle || cpu_idle_wakeup(cpu))
1026 tdq->tdq_ipipending = 1;
1027 ipi_cpu(cpu, IPI_PREEMPT);
1031 * Steals load from a timeshare queue. Honors the rotating queue head
1034 static struct thread *
1035 runq_steal_from(struct runq *rq, int cpu, u_char start)
1039 struct thread *td, *first;
1044 rqb = &rq->rq_status;
1045 bit = start & (RQB_BPW -1);
1049 for (i = RQB_WORD(start); i < RQB_LEN; bit = 0, i++) {
1050 if (rqb->rqb_bits[i] == 0)
1053 for (pri = bit; pri < RQB_BPW; pri++)
1054 if (rqb->rqb_bits[i] & (1ul << pri))
1059 pri = RQB_FFS(rqb->rqb_bits[i]);
1060 pri += (i << RQB_L2BPW);
1061 rqh = &rq->rq_queues[pri];
1062 TAILQ_FOREACH(td, rqh, td_runq) {
1063 if (first && THREAD_CAN_MIGRATE(td) &&
1064 THREAD_CAN_SCHED(td, cpu))
1074 if (first && THREAD_CAN_MIGRATE(first) &&
1075 THREAD_CAN_SCHED(first, cpu))
1081 * Steals load from a standard linear queue.
1083 static struct thread *
1084 runq_steal(struct runq *rq, int cpu)
1092 rqb = &rq->rq_status;
1093 for (word = 0; word < RQB_LEN; word++) {
1094 if (rqb->rqb_bits[word] == 0)
1096 for (bit = 0; bit < RQB_BPW; bit++) {
1097 if ((rqb->rqb_bits[word] & (1ul << bit)) == 0)
1099 rqh = &rq->rq_queues[bit + (word << RQB_L2BPW)];
1100 TAILQ_FOREACH(td, rqh, td_runq)
1101 if (THREAD_CAN_MIGRATE(td) &&
1102 THREAD_CAN_SCHED(td, cpu))
1110 * Attempt to steal a thread in priority order from a thread queue.
1112 static struct thread *
1113 tdq_steal(struct tdq *tdq, int cpu)
1117 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
1118 if ((td = runq_steal(&tdq->tdq_realtime, cpu)) != NULL)
1120 if ((td = runq_steal_from(&tdq->tdq_timeshare,
1121 cpu, tdq->tdq_ridx)) != NULL)
1123 return (runq_steal(&tdq->tdq_idle, cpu));
1127 * Sets the thread lock and ts_cpu to match the requested cpu. Unlocks the
1128 * current lock and returns with the assigned queue locked.
1130 static inline struct tdq *
1131 sched_setcpu(struct thread *td, int cpu, int flags)
1136 THREAD_LOCK_ASSERT(td, MA_OWNED);
1138 td->td_sched->ts_cpu = cpu;
1140 * If the lock matches just return the queue.
1142 if (td->td_lock == TDQ_LOCKPTR(tdq))
1146 * If the thread isn't running its lockptr is a
1147 * turnstile or a sleepqueue. We can just lock_set without
1150 if (TD_CAN_RUN(td)) {
1152 thread_lock_set(td, TDQ_LOCKPTR(tdq));
1157 * The hard case, migration, we need to block the thread first to
1158 * prevent order reversals with other cpus locks.
1161 thread_lock_block(td);
1163 thread_lock_unblock(td, TDQ_LOCKPTR(tdq));
1168 SCHED_STAT_DEFINE(pickcpu_intrbind, "Soft interrupt binding");
1169 SCHED_STAT_DEFINE(pickcpu_idle_affinity, "Picked idle cpu based on affinity");
1170 SCHED_STAT_DEFINE(pickcpu_affinity, "Picked cpu based on affinity");
1171 SCHED_STAT_DEFINE(pickcpu_lowest, "Selected lowest load");
1172 SCHED_STAT_DEFINE(pickcpu_local, "Migrated to current cpu");
1173 SCHED_STAT_DEFINE(pickcpu_migration, "Selection may have caused migration");
1176 sched_pickcpu(struct thread *td, int flags)
1178 struct cpu_group *cg, *ccg;
1179 struct td_sched *ts;
1184 self = PCPU_GET(cpuid);
1186 if (smp_started == 0)
1189 * Don't migrate a running thread from sched_switch().
1191 if ((flags & SRQ_OURSELF) || !THREAD_CAN_MIGRATE(td))
1192 return (ts->ts_cpu);
1194 * Prefer to run interrupt threads on the processors that generate
1197 pri = td->td_priority;
1198 if (td->td_priority <= PRI_MAX_ITHD && THREAD_CAN_SCHED(td, self) &&
1199 curthread->td_intr_nesting_level && ts->ts_cpu != self) {
1200 SCHED_STAT_INC(pickcpu_intrbind);
1202 if (TDQ_CPU(self)->tdq_lowpri > pri) {
1203 SCHED_STAT_INC(pickcpu_affinity);
1204 return (ts->ts_cpu);
1208 * If the thread can run on the last cpu and the affinity has not
1209 * expired or it is idle run it there.
1211 tdq = TDQ_CPU(ts->ts_cpu);
1213 if (THREAD_CAN_SCHED(td, ts->ts_cpu) &&
1214 tdq->tdq_lowpri >= PRI_MIN_IDLE &&
1215 SCHED_AFFINITY(ts, CG_SHARE_L2)) {
1216 if (cg->cg_flags & CG_FLAG_THREAD) {
1217 CPUSET_FOREACH(cpu, cg->cg_mask) {
1218 if (TDQ_CPU(cpu)->tdq_lowpri < PRI_MIN_IDLE)
1223 if (cpu > mp_maxid) {
1224 SCHED_STAT_INC(pickcpu_idle_affinity);
1225 return (ts->ts_cpu);
1229 * Search for the last level cache CPU group in the tree.
1230 * Skip caches with expired affinity time and SMT groups.
1231 * Affinity to higher level caches will be handled less aggressively.
1233 for (ccg = NULL; cg != NULL; cg = cg->cg_parent) {
1234 if (cg->cg_flags & CG_FLAG_THREAD)
1236 if (!SCHED_AFFINITY(ts, cg->cg_level))
1243 /* Search the group for the less loaded idle CPU we can run now. */
1244 mask = td->td_cpuset->cs_mask;
1245 if (cg != NULL && cg != cpu_top &&
1246 CPU_CMP(&cg->cg_mask, &cpu_top->cg_mask) != 0)
1247 cpu = sched_lowest(cg, mask, max(pri, PRI_MAX_TIMESHARE),
1248 INT_MAX, ts->ts_cpu);
1249 /* Search globally for the less loaded CPU we can run now. */
1251 cpu = sched_lowest(cpu_top, mask, pri, INT_MAX, ts->ts_cpu);
1252 /* Search globally for the less loaded CPU. */
1254 cpu = sched_lowest(cpu_top, mask, -1, INT_MAX, ts->ts_cpu);
1255 KASSERT(cpu != -1, ("sched_pickcpu: Failed to find a cpu."));
1257 * Compare the lowest loaded cpu to current cpu.
1259 if (THREAD_CAN_SCHED(td, self) && TDQ_CPU(self)->tdq_lowpri > pri &&
1260 TDQ_CPU(cpu)->tdq_lowpri < PRI_MIN_IDLE &&
1261 TDQ_CPU(self)->tdq_load <= TDQ_CPU(cpu)->tdq_load + 1) {
1262 SCHED_STAT_INC(pickcpu_local);
1265 SCHED_STAT_INC(pickcpu_lowest);
1266 if (cpu != ts->ts_cpu)
1267 SCHED_STAT_INC(pickcpu_migration);
1273 * Pick the highest priority task we have and return it.
1275 static struct thread *
1276 tdq_choose(struct tdq *tdq)
1280 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
1281 td = runq_choose(&tdq->tdq_realtime);
1284 td = runq_choose_from(&tdq->tdq_timeshare, tdq->tdq_ridx);
1286 KASSERT(td->td_priority >= PRI_MIN_BATCH,
1287 ("tdq_choose: Invalid priority on timeshare queue %d",
1291 td = runq_choose(&tdq->tdq_idle);
1293 KASSERT(td->td_priority >= PRI_MIN_IDLE,
1294 ("tdq_choose: Invalid priority on idle queue %d",
1303 * Initialize a thread queue.
1306 tdq_setup(struct tdq *tdq)
1310 printf("ULE: setup cpu %d\n", TDQ_ID(tdq));
1311 runq_init(&tdq->tdq_realtime);
1312 runq_init(&tdq->tdq_timeshare);
1313 runq_init(&tdq->tdq_idle);
1314 snprintf(tdq->tdq_name, sizeof(tdq->tdq_name),
1315 "sched lock %d", (int)TDQ_ID(tdq));
1316 mtx_init(&tdq->tdq_lock, tdq->tdq_name, "sched lock",
1317 MTX_SPIN | MTX_RECURSE);
1319 snprintf(tdq->tdq_loadname, sizeof(tdq->tdq_loadname),
1320 "CPU %d load", (int)TDQ_ID(tdq));
1326 sched_setup_smp(void)
1331 cpu_top = smp_topo();
1335 tdq->tdq_cg = smp_topo_find(cpu_top, i);
1336 if (tdq->tdq_cg == NULL)
1337 panic("Can't find cpu group for %d\n", i);
1339 balance_tdq = TDQ_SELF();
1345 * Setup the thread queues and initialize the topology based on MD
1349 sched_setup(void *dummy)
1360 * To avoid divide-by-zero, we set realstathz a dummy value
1361 * in case which sched_clock() called before sched_initticks().
1364 sched_slice = (realstathz/10); /* ~100ms */
1365 tickincr = 1 << SCHED_TICK_SHIFT;
1367 /* Add thread0's load since it's running. */
1369 thread0.td_lock = TDQ_LOCKPTR(TDQ_SELF());
1370 tdq_load_add(tdq, &thread0);
1371 tdq->tdq_lowpri = thread0.td_priority;
1376 * This routine determines the tickincr after stathz and hz are setup.
1380 sched_initticks(void *dummy)
1384 realstathz = stathz ? stathz : hz;
1385 sched_slice = (realstathz/10); /* ~100ms */
1388 * tickincr is shifted out by 10 to avoid rounding errors due to
1389 * hz not being evenly divisible by stathz on all platforms.
1391 incr = (hz << SCHED_TICK_SHIFT) / realstathz;
1393 * This does not work for values of stathz that are more than
1394 * 1 << SCHED_TICK_SHIFT * hz. In practice this does not happen.
1401 * Set the default balance interval now that we know
1402 * what realstathz is.
1404 balance_interval = realstathz;
1406 * Set steal thresh to roughly log2(mp_ncpu) but no greater than 4.
1407 * This prevents excess thrashing on large machines and excess idle
1408 * on smaller machines.
1410 steal_thresh = min(fls(mp_ncpus) - 1, 3);
1411 affinity = SCHED_AFFINITY_DEFAULT;
1413 if (sched_idlespinthresh < 0)
1414 sched_idlespinthresh = max(16, 2 * hz / realstathz);
1419 * This is the core of the interactivity algorithm. Determines a score based
1420 * on past behavior. It is the ratio of sleep time to run time scaled to
1421 * a [0, 100] integer. This is the voluntary sleep time of a process, which
1422 * differs from the cpu usage because it does not account for time spent
1423 * waiting on a run-queue. Would be prettier if we had floating point.
1426 sched_interact_score(struct thread *td)
1428 struct td_sched *ts;
1433 * The score is only needed if this is likely to be an interactive
1434 * task. Don't go through the expense of computing it if there's
1437 if (sched_interact <= SCHED_INTERACT_HALF &&
1438 ts->ts_runtime >= ts->ts_slptime)
1439 return (SCHED_INTERACT_HALF);
1441 if (ts->ts_runtime > ts->ts_slptime) {
1442 div = max(1, ts->ts_runtime / SCHED_INTERACT_HALF);
1443 return (SCHED_INTERACT_HALF +
1444 (SCHED_INTERACT_HALF - (ts->ts_slptime / div)));
1446 if (ts->ts_slptime > ts->ts_runtime) {
1447 div = max(1, ts->ts_slptime / SCHED_INTERACT_HALF);
1448 return (ts->ts_runtime / div);
1450 /* runtime == slptime */
1452 return (SCHED_INTERACT_HALF);
1455 * This can happen if slptime and runtime are 0.
1462 * Scale the scheduling priority according to the "interactivity" of this
1466 sched_priority(struct thread *td)
1471 if (PRI_BASE(td->td_pri_class) != PRI_TIMESHARE)
1474 * If the score is interactive we place the thread in the realtime
1475 * queue with a priority that is less than kernel and interrupt
1476 * priorities. These threads are not subject to nice restrictions.
1478 * Scores greater than this are placed on the normal timeshare queue
1479 * where the priority is partially decided by the most recent cpu
1480 * utilization and the rest is decided by nice value.
1482 * The nice value of the process has a linear effect on the calculated
1483 * score. Negative nice values make it easier for a thread to be
1484 * considered interactive.
1486 score = imax(0, sched_interact_score(td) + td->td_proc->p_nice);
1487 if (score < sched_interact) {
1488 pri = PRI_MIN_INTERACT;
1489 pri += ((PRI_MAX_INTERACT - PRI_MIN_INTERACT + 1) /
1490 sched_interact) * score;
1491 KASSERT(pri >= PRI_MIN_INTERACT && pri <= PRI_MAX_INTERACT,
1492 ("sched_priority: invalid interactive priority %d score %d",
1495 pri = SCHED_PRI_MIN;
1496 if (td->td_sched->ts_ticks)
1497 pri += min(SCHED_PRI_TICKS(td->td_sched),
1499 pri += SCHED_PRI_NICE(td->td_proc->p_nice);
1500 KASSERT(pri >= PRI_MIN_BATCH && pri <= PRI_MAX_BATCH,
1501 ("sched_priority: invalid priority %d: nice %d, "
1502 "ticks %d ftick %d ltick %d tick pri %d",
1503 pri, td->td_proc->p_nice, td->td_sched->ts_ticks,
1504 td->td_sched->ts_ftick, td->td_sched->ts_ltick,
1505 SCHED_PRI_TICKS(td->td_sched)));
1507 sched_user_prio(td, pri);
1513 * This routine enforces a maximum limit on the amount of scheduling history
1514 * kept. It is called after either the slptime or runtime is adjusted. This
1515 * function is ugly due to integer math.
1518 sched_interact_update(struct thread *td)
1520 struct td_sched *ts;
1524 sum = ts->ts_runtime + ts->ts_slptime;
1525 if (sum < SCHED_SLP_RUN_MAX)
1528 * This only happens from two places:
1529 * 1) We have added an unusual amount of run time from fork_exit.
1530 * 2) We have added an unusual amount of sleep time from sched_sleep().
1532 if (sum > SCHED_SLP_RUN_MAX * 2) {
1533 if (ts->ts_runtime > ts->ts_slptime) {
1534 ts->ts_runtime = SCHED_SLP_RUN_MAX;
1537 ts->ts_slptime = SCHED_SLP_RUN_MAX;
1543 * If we have exceeded by more than 1/5th then the algorithm below
1544 * will not bring us back into range. Dividing by two here forces
1545 * us into the range of [4/5 * SCHED_INTERACT_MAX, SCHED_INTERACT_MAX]
1547 if (sum > (SCHED_SLP_RUN_MAX / 5) * 6) {
1548 ts->ts_runtime /= 2;
1549 ts->ts_slptime /= 2;
1552 ts->ts_runtime = (ts->ts_runtime / 5) * 4;
1553 ts->ts_slptime = (ts->ts_slptime / 5) * 4;
1557 * Scale back the interactivity history when a child thread is created. The
1558 * history is inherited from the parent but the thread may behave totally
1559 * differently. For example, a shell spawning a compiler process. We want
1560 * to learn that the compiler is behaving badly very quickly.
1563 sched_interact_fork(struct thread *td)
1568 sum = td->td_sched->ts_runtime + td->td_sched->ts_slptime;
1569 if (sum > SCHED_SLP_RUN_FORK) {
1570 ratio = sum / SCHED_SLP_RUN_FORK;
1571 td->td_sched->ts_runtime /= ratio;
1572 td->td_sched->ts_slptime /= ratio;
1577 * Called from proc0_init() to setup the scheduler fields.
1584 * Set up the scheduler specific parts of proc0.
1586 proc0.p_sched = NULL; /* XXX */
1587 thread0.td_sched = &td_sched0;
1588 td_sched0.ts_ltick = ticks;
1589 td_sched0.ts_ftick = ticks;
1590 td_sched0.ts_slice = sched_slice;
1594 * This is only somewhat accurate since given many processes of the same
1595 * priority they will switch when their slices run out, which will be
1596 * at most sched_slice stathz ticks.
1599 sched_rr_interval(void)
1602 /* Convert sched_slice to hz */
1603 return (hz/(realstathz/sched_slice));
1607 * Update the percent cpu tracking information when it is requested or
1608 * the total history exceeds the maximum. We keep a sliding history of
1609 * tick counts that slowly decays. This is less precise than the 4BSD
1610 * mechanism since it happens with less regular and frequent events.
1613 sched_pctcpu_update(struct td_sched *ts, int run)
1617 if (t - ts->ts_ltick >= SCHED_TICK_TARG) {
1619 ts->ts_ftick = t - SCHED_TICK_TARG;
1620 } else if (t - ts->ts_ftick >= SCHED_TICK_MAX) {
1621 ts->ts_ticks = (ts->ts_ticks / (ts->ts_ltick - ts->ts_ftick)) *
1622 (ts->ts_ltick - (t - SCHED_TICK_TARG));
1623 ts->ts_ftick = t - SCHED_TICK_TARG;
1626 ts->ts_ticks += (t - ts->ts_ltick) << SCHED_TICK_SHIFT;
1631 * Adjust the priority of a thread. Move it to the appropriate run-queue
1632 * if necessary. This is the back-end for several priority related
1636 sched_thread_priority(struct thread *td, u_char prio)
1638 struct td_sched *ts;
1642 KTR_POINT3(KTR_SCHED, "thread", sched_tdname(td), "prio",
1643 "prio:%d", td->td_priority, "new prio:%d", prio,
1644 KTR_ATTR_LINKED, sched_tdname(curthread));
1645 SDT_PROBE3(sched, , , change_pri, td, td->td_proc, prio);
1646 if (td != curthread && prio > td->td_priority) {
1647 KTR_POINT3(KTR_SCHED, "thread", sched_tdname(curthread),
1648 "lend prio", "prio:%d", td->td_priority, "new prio:%d",
1649 prio, KTR_ATTR_LINKED, sched_tdname(td));
1650 SDT_PROBE4(sched, , , lend_pri, td, td->td_proc, prio,
1654 THREAD_LOCK_ASSERT(td, MA_OWNED);
1655 if (td->td_priority == prio)
1658 * If the priority has been elevated due to priority
1659 * propagation, we may have to move ourselves to a new
1660 * queue. This could be optimized to not re-add in some
1663 if (TD_ON_RUNQ(td) && prio < td->td_priority) {
1665 td->td_priority = prio;
1666 sched_add(td, SRQ_BORROWING);
1670 * If the thread is currently running we may have to adjust the lowpri
1671 * information so other cpus are aware of our current priority.
1673 if (TD_IS_RUNNING(td)) {
1674 tdq = TDQ_CPU(ts->ts_cpu);
1675 oldpri = td->td_priority;
1676 td->td_priority = prio;
1677 if (prio < tdq->tdq_lowpri)
1678 tdq->tdq_lowpri = prio;
1679 else if (tdq->tdq_lowpri == oldpri)
1680 tdq_setlowpri(tdq, td);
1683 td->td_priority = prio;
1687 * Update a thread's priority when it is lent another thread's
1691 sched_lend_prio(struct thread *td, u_char prio)
1694 td->td_flags |= TDF_BORROWING;
1695 sched_thread_priority(td, prio);
1699 * Restore a thread's priority when priority propagation is
1700 * over. The prio argument is the minimum priority the thread
1701 * needs to have to satisfy other possible priority lending
1702 * requests. If the thread's regular priority is less
1703 * important than prio, the thread will keep a priority boost
1707 sched_unlend_prio(struct thread *td, u_char prio)
1711 if (td->td_base_pri >= PRI_MIN_TIMESHARE &&
1712 td->td_base_pri <= PRI_MAX_TIMESHARE)
1713 base_pri = td->td_user_pri;
1715 base_pri = td->td_base_pri;
1716 if (prio >= base_pri) {
1717 td->td_flags &= ~TDF_BORROWING;
1718 sched_thread_priority(td, base_pri);
1720 sched_lend_prio(td, prio);
1724 * Standard entry for setting the priority to an absolute value.
1727 sched_prio(struct thread *td, u_char prio)
1731 /* First, update the base priority. */
1732 td->td_base_pri = prio;
1735 * If the thread is borrowing another thread's priority, don't
1736 * ever lower the priority.
1738 if (td->td_flags & TDF_BORROWING && td->td_priority < prio)
1741 /* Change the real priority. */
1742 oldprio = td->td_priority;
1743 sched_thread_priority(td, prio);
1746 * If the thread is on a turnstile, then let the turnstile update
1749 if (TD_ON_LOCK(td) && oldprio != prio)
1750 turnstile_adjust(td, oldprio);
1754 * Set the base user priority, does not effect current running priority.
1757 sched_user_prio(struct thread *td, u_char prio)
1760 td->td_base_user_pri = prio;
1761 if (td->td_lend_user_pri <= prio)
1763 td->td_user_pri = prio;
1767 sched_lend_user_prio(struct thread *td, u_char prio)
1770 THREAD_LOCK_ASSERT(td, MA_OWNED);
1771 td->td_lend_user_pri = prio;
1772 td->td_user_pri = min(prio, td->td_base_user_pri);
1773 if (td->td_priority > td->td_user_pri)
1774 sched_prio(td, td->td_user_pri);
1775 else if (td->td_priority != td->td_user_pri)
1776 td->td_flags |= TDF_NEEDRESCHED;
1780 * Handle migration from sched_switch(). This happens only for
1784 sched_switch_migrate(struct tdq *tdq, struct thread *td, int flags)
1788 tdn = TDQ_CPU(td->td_sched->ts_cpu);
1790 tdq_load_rem(tdq, td);
1792 * Do the lock dance required to avoid LOR. We grab an extra
1793 * spinlock nesting to prevent preemption while we're
1794 * not holding either run-queue lock.
1797 thread_lock_block(td); /* This releases the lock on tdq. */
1800 * Acquire both run-queue locks before placing the thread on the new
1801 * run-queue to avoid deadlocks created by placing a thread with a
1802 * blocked lock on the run-queue of a remote processor. The deadlock
1803 * occurs when a third processor attempts to lock the two queues in
1804 * question while the target processor is spinning with its own
1805 * run-queue lock held while waiting for the blocked lock to clear.
1807 tdq_lock_pair(tdn, tdq);
1808 tdq_add(tdn, td, flags);
1809 tdq_notify(tdn, td);
1813 return (TDQ_LOCKPTR(tdn));
1817 * Variadic version of thread_lock_unblock() that does not assume td_lock
1821 thread_unblock_switch(struct thread *td, struct mtx *mtx)
1823 atomic_store_rel_ptr((volatile uintptr_t *)&td->td_lock,
1828 * Switch threads. This function has to handle threads coming in while
1829 * blocked for some reason, running, or idle. It also must deal with
1830 * migrating a thread from one queue to another as running threads may
1831 * be assigned elsewhere via binding.
1834 sched_switch(struct thread *td, struct thread *newtd, int flags)
1837 struct td_sched *ts;
1842 THREAD_LOCK_ASSERT(td, MA_OWNED);
1843 KASSERT(newtd == NULL, ("sched_switch: Unsupported newtd argument"));
1845 cpuid = PCPU_GET(cpuid);
1846 tdq = TDQ_CPU(cpuid);
1849 sched_pctcpu_update(ts, 1);
1850 ts->ts_rltick = ticks;
1851 td->td_lastcpu = td->td_oncpu;
1852 td->td_oncpu = NOCPU;
1853 if (!(flags & SW_PREEMPT))
1854 td->td_flags &= ~TDF_NEEDRESCHED;
1855 td->td_owepreempt = 0;
1856 tdq->tdq_switchcnt++;
1858 * The lock pointer in an idle thread should never change. Reset it
1859 * to CAN_RUN as well.
1861 if (TD_IS_IDLETHREAD(td)) {
1862 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
1864 } else if (TD_IS_RUNNING(td)) {
1865 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
1866 srqflag = (flags & SW_PREEMPT) ?
1867 SRQ_OURSELF|SRQ_YIELDING|SRQ_PREEMPTED :
1868 SRQ_OURSELF|SRQ_YIELDING;
1870 if (THREAD_CAN_MIGRATE(td) && !THREAD_CAN_SCHED(td, ts->ts_cpu))
1871 ts->ts_cpu = sched_pickcpu(td, 0);
1873 if (ts->ts_cpu == cpuid)
1874 tdq_runq_add(tdq, td, srqflag);
1876 KASSERT(THREAD_CAN_MIGRATE(td) ||
1877 (ts->ts_flags & TSF_BOUND) != 0,
1878 ("Thread %p shouldn't migrate", td));
1879 mtx = sched_switch_migrate(tdq, td, srqflag);
1882 /* This thread must be going to sleep. */
1884 mtx = thread_lock_block(td);
1885 tdq_load_rem(tdq, td);
1888 * We enter here with the thread blocked and assigned to the
1889 * appropriate cpu run-queue or sleep-queue and with the current
1890 * thread-queue locked.
1892 TDQ_LOCK_ASSERT(tdq, MA_OWNED | MA_NOTRECURSED);
1893 newtd = choosethread();
1895 * Call the MD code to switch contexts if necessary.
1899 if (PMC_PROC_IS_USING_PMCS(td->td_proc))
1900 PMC_SWITCH_CONTEXT(td, PMC_FN_CSW_OUT);
1902 SDT_PROBE2(sched, , , off_cpu, td, td->td_proc);
1903 lock_profile_release_lock(&TDQ_LOCKPTR(tdq)->lock_object);
1904 TDQ_LOCKPTR(tdq)->mtx_lock = (uintptr_t)newtd;
1905 sched_pctcpu_update(newtd->td_sched, 0);
1907 #ifdef KDTRACE_HOOKS
1909 * If DTrace has set the active vtime enum to anything
1910 * other than INACTIVE (0), then it should have set the
1913 if (dtrace_vtime_active)
1914 (*dtrace_vtime_switch_func)(newtd);
1917 cpu_switch(td, newtd, mtx);
1919 * We may return from cpu_switch on a different cpu. However,
1920 * we always return with td_lock pointing to the current cpu's
1923 cpuid = PCPU_GET(cpuid);
1924 tdq = TDQ_CPU(cpuid);
1925 lock_profile_obtain_lock_success(
1926 &TDQ_LOCKPTR(tdq)->lock_object, 0, 0, __FILE__, __LINE__);
1928 SDT_PROBE0(sched, , , on_cpu);
1930 if (PMC_PROC_IS_USING_PMCS(td->td_proc))
1931 PMC_SWITCH_CONTEXT(td, PMC_FN_CSW_IN);
1934 thread_unblock_switch(td, mtx);
1935 SDT_PROBE0(sched, , , remain_cpu);
1938 * Assert that all went well and return.
1940 TDQ_LOCK_ASSERT(tdq, MA_OWNED|MA_NOTRECURSED);
1941 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
1942 td->td_oncpu = cpuid;
1946 * Adjust thread priorities as a result of a nice request.
1949 sched_nice(struct proc *p, int nice)
1953 PROC_LOCK_ASSERT(p, MA_OWNED);
1956 FOREACH_THREAD_IN_PROC(p, td) {
1959 sched_prio(td, td->td_base_user_pri);
1965 * Record the sleep time for the interactivity scorer.
1968 sched_sleep(struct thread *td, int prio)
1971 THREAD_LOCK_ASSERT(td, MA_OWNED);
1973 td->td_slptick = ticks;
1974 if (TD_IS_SUSPENDED(td) || prio >= PSOCK)
1975 td->td_flags |= TDF_CANSWAP;
1976 if (PRI_BASE(td->td_pri_class) != PRI_TIMESHARE)
1978 if (static_boost == 1 && prio)
1979 sched_prio(td, prio);
1980 else if (static_boost && td->td_priority > static_boost)
1981 sched_prio(td, static_boost);
1985 * Schedule a thread to resume execution and record how long it voluntarily
1986 * slept. We also update the pctcpu, interactivity, and priority.
1989 sched_wakeup(struct thread *td)
1991 struct td_sched *ts;
1994 THREAD_LOCK_ASSERT(td, MA_OWNED);
1996 td->td_flags &= ~TDF_CANSWAP;
1998 * If we slept for more than a tick update our interactivity and
2001 slptick = td->td_slptick;
2003 if (slptick && slptick != ticks) {
2004 ts->ts_slptime += (ticks - slptick) << SCHED_TICK_SHIFT;
2005 sched_interact_update(td);
2006 sched_pctcpu_update(ts, 0);
2008 /* Reset the slice value after we sleep. */
2009 ts->ts_slice = sched_slice;
2010 sched_add(td, SRQ_BORING);
2014 * Penalize the parent for creating a new child and initialize the child's
2018 sched_fork(struct thread *td, struct thread *child)
2020 THREAD_LOCK_ASSERT(td, MA_OWNED);
2021 sched_pctcpu_update(td->td_sched, 1);
2022 sched_fork_thread(td, child);
2024 * Penalize the parent and child for forking.
2026 sched_interact_fork(child);
2027 sched_priority(child);
2028 td->td_sched->ts_runtime += tickincr;
2029 sched_interact_update(td);
2034 * Fork a new thread, may be within the same process.
2037 sched_fork_thread(struct thread *td, struct thread *child)
2039 struct td_sched *ts;
2040 struct td_sched *ts2;
2042 THREAD_LOCK_ASSERT(td, MA_OWNED);
2047 ts2 = child->td_sched;
2048 child->td_lock = TDQ_LOCKPTR(TDQ_SELF());
2049 child->td_cpuset = cpuset_ref(td->td_cpuset);
2050 ts2->ts_cpu = ts->ts_cpu;
2053 * Grab our parents cpu estimation information.
2055 ts2->ts_ticks = ts->ts_ticks;
2056 ts2->ts_ltick = ts->ts_ltick;
2057 ts2->ts_ftick = ts->ts_ftick;
2059 * Do not inherit any borrowed priority from the parent.
2061 child->td_priority = child->td_base_pri;
2063 * And update interactivity score.
2065 ts2->ts_slptime = ts->ts_slptime;
2066 ts2->ts_runtime = ts->ts_runtime;
2067 ts2->ts_slice = 1; /* Attempt to quickly learn interactivity. */
2069 bzero(ts2->ts_name, sizeof(ts2->ts_name));
2074 * Adjust the priority class of a thread.
2077 sched_class(struct thread *td, int class)
2080 THREAD_LOCK_ASSERT(td, MA_OWNED);
2081 if (td->td_pri_class == class)
2083 td->td_pri_class = class;
2087 * Return some of the child's priority and interactivity to the parent.
2090 sched_exit(struct proc *p, struct thread *child)
2094 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(child), "proc exit",
2095 "prio:%d", child->td_priority);
2096 PROC_LOCK_ASSERT(p, MA_OWNED);
2097 td = FIRST_THREAD_IN_PROC(p);
2098 sched_exit_thread(td, child);
2102 * Penalize another thread for the time spent on this one. This helps to
2103 * worsen the priority and interactivity of processes which schedule batch
2104 * jobs such as make. This has little effect on the make process itself but
2105 * causes new processes spawned by it to receive worse scores immediately.
2108 sched_exit_thread(struct thread *td, struct thread *child)
2111 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(child), "thread exit",
2112 "prio:%d", child->td_priority);
2114 * Give the child's runtime to the parent without returning the
2115 * sleep time as a penalty to the parent. This causes shells that
2116 * launch expensive things to mark their children as expensive.
2119 td->td_sched->ts_runtime += child->td_sched->ts_runtime;
2120 sched_interact_update(td);
2126 sched_preempt(struct thread *td)
2130 SDT_PROBE2(sched, , , surrender, td, td->td_proc);
2134 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2135 tdq->tdq_ipipending = 0;
2136 if (td->td_priority > tdq->tdq_lowpri) {
2139 flags = SW_INVOL | SW_PREEMPT;
2140 if (td->td_critnest > 1)
2141 td->td_owepreempt = 1;
2142 else if (TD_IS_IDLETHREAD(td))
2143 mi_switch(flags | SWT_REMOTEWAKEIDLE, NULL);
2145 mi_switch(flags | SWT_REMOTEPREEMPT, NULL);
2151 * Fix priorities on return to user-space. Priorities may be elevated due
2152 * to static priorities in msleep() or similar.
2155 sched_userret(struct thread *td)
2158 * XXX we cheat slightly on the locking here to avoid locking in
2159 * the usual case. Setting td_priority here is essentially an
2160 * incomplete workaround for not setting it properly elsewhere.
2161 * Now that some interrupt handlers are threads, not setting it
2162 * properly elsewhere can clobber it in the window between setting
2163 * it here and returning to user mode, so don't waste time setting
2164 * it perfectly here.
2166 KASSERT((td->td_flags & TDF_BORROWING) == 0,
2167 ("thread with borrowed priority returning to userland"));
2168 if (td->td_priority != td->td_user_pri) {
2170 td->td_priority = td->td_user_pri;
2171 td->td_base_pri = td->td_user_pri;
2172 tdq_setlowpri(TDQ_SELF(), td);
2178 * Handle a stathz tick. This is really only relevant for timeshare
2182 sched_clock(struct thread *td)
2185 struct td_sched *ts;
2187 THREAD_LOCK_ASSERT(td, MA_OWNED);
2191 * We run the long term load balancer infrequently on the first cpu.
2193 if (balance_tdq == tdq) {
2194 if (balance_ticks && --balance_ticks == 0)
2199 * Save the old switch count so we have a record of the last ticks
2200 * activity. Initialize the new switch count based on our load.
2201 * If there is some activity seed it to reflect that.
2203 tdq->tdq_oldswitchcnt = tdq->tdq_switchcnt;
2204 tdq->tdq_switchcnt = tdq->tdq_load;
2206 * Advance the insert index once for each tick to ensure that all
2207 * threads get a chance to run.
2209 if (tdq->tdq_idx == tdq->tdq_ridx) {
2210 tdq->tdq_idx = (tdq->tdq_idx + 1) % RQ_NQS;
2211 if (TAILQ_EMPTY(&tdq->tdq_timeshare.rq_queues[tdq->tdq_ridx]))
2212 tdq->tdq_ridx = tdq->tdq_idx;
2215 sched_pctcpu_update(ts, 1);
2216 if (td->td_pri_class & PRI_FIFO_BIT)
2218 if (PRI_BASE(td->td_pri_class) == PRI_TIMESHARE) {
2220 * We used a tick; charge it to the thread so
2221 * that we can compute our interactivity.
2223 td->td_sched->ts_runtime += tickincr;
2224 sched_interact_update(td);
2228 * We used up one time slice.
2230 if (--ts->ts_slice > 0)
2233 * We're out of time, force a requeue at userret().
2235 ts->ts_slice = sched_slice;
2236 td->td_flags |= TDF_NEEDRESCHED;
2240 * Called once per hz tick.
2249 * Return whether the current CPU has runnable tasks. Used for in-kernel
2250 * cooperative idle threads.
2253 sched_runnable(void)
2261 if ((curthread->td_flags & TDF_IDLETD) != 0) {
2262 if (tdq->tdq_load > 0)
2265 if (tdq->tdq_load - 1 > 0)
2273 * Choose the highest priority thread to run. The thread is removed from
2274 * the run-queue while running however the load remains. For SMP we set
2275 * the tdq in the global idle bitmask if it idles here.
2284 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2285 td = tdq_choose(tdq);
2287 tdq_runq_rem(tdq, td);
2288 tdq->tdq_lowpri = td->td_priority;
2291 tdq->tdq_lowpri = PRI_MAX_IDLE;
2292 return (PCPU_GET(idlethread));
2296 * Set owepreempt if necessary. Preemption never happens directly in ULE,
2297 * we always request it once we exit a critical section.
2300 sched_setpreempt(struct thread *td)
2306 THREAD_LOCK_ASSERT(curthread, MA_OWNED);
2309 pri = td->td_priority;
2310 cpri = ctd->td_priority;
2312 ctd->td_flags |= TDF_NEEDRESCHED;
2313 if (panicstr != NULL || pri >= cpri || cold || TD_IS_INHIBITED(ctd))
2315 if (!sched_shouldpreempt(pri, cpri, 0))
2317 ctd->td_owepreempt = 1;
2321 * Add a thread to a thread queue. Select the appropriate runq and add the
2322 * thread to it. This is the internal function called when the tdq is
2326 tdq_add(struct tdq *tdq, struct thread *td, int flags)
2329 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2330 KASSERT((td->td_inhibitors == 0),
2331 ("sched_add: trying to run inhibited thread"));
2332 KASSERT((TD_CAN_RUN(td) || TD_IS_RUNNING(td)),
2333 ("sched_add: bad thread state"));
2334 KASSERT(td->td_flags & TDF_INMEM,
2335 ("sched_add: thread swapped out"));
2337 if (td->td_priority < tdq->tdq_lowpri)
2338 tdq->tdq_lowpri = td->td_priority;
2339 tdq_runq_add(tdq, td, flags);
2340 tdq_load_add(tdq, td);
2344 * Select the target thread queue and add a thread to it. Request
2345 * preemption or IPI a remote processor if required.
2348 sched_add(struct thread *td, int flags)
2355 KTR_STATE2(KTR_SCHED, "thread", sched_tdname(td), "runq add",
2356 "prio:%d", td->td_priority, KTR_ATTR_LINKED,
2357 sched_tdname(curthread));
2358 KTR_POINT1(KTR_SCHED, "thread", sched_tdname(curthread), "wokeup",
2359 KTR_ATTR_LINKED, sched_tdname(td));
2360 SDT_PROBE4(sched, , , enqueue, td, td->td_proc, NULL,
2361 flags & SRQ_PREEMPTED);
2362 THREAD_LOCK_ASSERT(td, MA_OWNED);
2364 * Recalculate the priority before we select the target cpu or
2367 if (PRI_BASE(td->td_pri_class) == PRI_TIMESHARE)
2371 * Pick the destination cpu and if it isn't ours transfer to the
2374 cpu = sched_pickcpu(td, flags);
2375 tdq = sched_setcpu(td, cpu, flags);
2376 tdq_add(tdq, td, flags);
2377 if (cpu != PCPU_GET(cpuid)) {
2378 tdq_notify(tdq, td);
2385 * Now that the thread is moving to the run-queue, set the lock
2386 * to the scheduler's lock.
2388 thread_lock_set(td, TDQ_LOCKPTR(tdq));
2389 tdq_add(tdq, td, flags);
2391 if (!(flags & SRQ_YIELDING))
2392 sched_setpreempt(td);
2396 * Remove a thread from a run-queue without running it. This is used
2397 * when we're stealing a thread from a remote queue. Otherwise all threads
2398 * exit by calling sched_exit_thread() and sched_throw() themselves.
2401 sched_rem(struct thread *td)
2405 KTR_STATE1(KTR_SCHED, "thread", sched_tdname(td), "runq rem",
2406 "prio:%d", td->td_priority);
2407 SDT_PROBE3(sched, , , dequeue, td, td->td_proc, NULL);
2408 tdq = TDQ_CPU(td->td_sched->ts_cpu);
2409 TDQ_LOCK_ASSERT(tdq, MA_OWNED);
2410 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2411 KASSERT(TD_ON_RUNQ(td),
2412 ("sched_rem: thread not on run queue"));
2413 tdq_runq_rem(tdq, td);
2414 tdq_load_rem(tdq, td);
2416 if (td->td_priority == tdq->tdq_lowpri)
2417 tdq_setlowpri(tdq, NULL);
2421 * Fetch cpu utilization information. Updates on demand.
2424 sched_pctcpu(struct thread *td)
2427 struct td_sched *ts;
2434 THREAD_LOCK_ASSERT(td, MA_OWNED);
2435 sched_pctcpu_update(ts, TD_IS_RUNNING(td));
2439 /* How many rtick per second ? */
2440 rtick = min(SCHED_TICK_HZ(ts) / SCHED_TICK_SECS, hz);
2441 pctcpu = (FSCALE * ((FSCALE * rtick)/hz)) >> FSHIFT;
2448 * Enforce affinity settings for a thread. Called after adjustments to
2452 sched_affinity(struct thread *td)
2455 struct td_sched *ts;
2457 THREAD_LOCK_ASSERT(td, MA_OWNED);
2459 if (THREAD_CAN_SCHED(td, ts->ts_cpu))
2461 if (TD_ON_RUNQ(td)) {
2463 sched_add(td, SRQ_BORING);
2466 if (!TD_IS_RUNNING(td))
2469 * Force a switch before returning to userspace. If the
2470 * target thread is not running locally send an ipi to force
2473 td->td_flags |= TDF_NEEDRESCHED;
2474 if (td != curthread)
2475 ipi_cpu(ts->ts_cpu, IPI_PREEMPT);
2480 * Bind a thread to a target cpu.
2483 sched_bind(struct thread *td, int cpu)
2485 struct td_sched *ts;
2487 THREAD_LOCK_ASSERT(td, MA_OWNED|MA_NOTRECURSED);
2488 KASSERT(td == curthread, ("sched_bind: can only bind curthread"));
2490 if (ts->ts_flags & TSF_BOUND)
2492 KASSERT(THREAD_CAN_MIGRATE(td), ("%p must be migratable", td));
2493 ts->ts_flags |= TSF_BOUND;
2495 if (PCPU_GET(cpuid) == cpu)
2498 /* When we return from mi_switch we'll be on the correct cpu. */
2499 mi_switch(SW_VOL, NULL);
2503 * Release a bound thread.
2506 sched_unbind(struct thread *td)
2508 struct td_sched *ts;
2510 THREAD_LOCK_ASSERT(td, MA_OWNED);
2511 KASSERT(td == curthread, ("sched_unbind: can only bind curthread"));
2513 if ((ts->ts_flags & TSF_BOUND) == 0)
2515 ts->ts_flags &= ~TSF_BOUND;
2520 sched_is_bound(struct thread *td)
2522 THREAD_LOCK_ASSERT(td, MA_OWNED);
2523 return (td->td_sched->ts_flags & TSF_BOUND);
2530 sched_relinquish(struct thread *td)
2533 mi_switch(SW_VOL | SWT_RELINQUISH, NULL);
2538 * Return the total system load.
2549 total += TDQ_CPU(i)->tdq_sysload;
2552 return (TDQ_SELF()->tdq_sysload);
2557 sched_sizeof_proc(void)
2559 return (sizeof(struct proc));
2563 sched_sizeof_thread(void)
2565 return (sizeof(struct thread) + sizeof(struct td_sched));
2569 #define TDQ_IDLESPIN(tdq) \
2570 ((tdq)->tdq_cg != NULL && ((tdq)->tdq_cg->cg_flags & CG_FLAG_THREAD) == 0)
2572 #define TDQ_IDLESPIN(tdq) 1
2576 * The actual idle process.
2579 sched_idletd(void *dummy)
2586 mtx_assert(&Giant, MA_NOTOWNED);
2591 if (tdq_idled(tdq) == 0)
2594 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2596 * If we're switching very frequently, spin while checking
2597 * for load rather than entering a low power state that
2598 * may require an IPI. However, don't do any busy
2599 * loops while on SMT machines as this simply steals
2600 * cycles from cores doing useful work.
2602 if (TDQ_IDLESPIN(tdq) && switchcnt > sched_idlespinthresh) {
2603 for (i = 0; i < sched_idlespins; i++) {
2609 switchcnt = tdq->tdq_switchcnt + tdq->tdq_oldswitchcnt;
2610 if (tdq->tdq_load == 0) {
2611 tdq->tdq_cpu_idle = 1;
2612 if (tdq->tdq_load == 0) {
2613 cpu_idle(switchcnt > sched_idlespinthresh * 4);
2614 tdq->tdq_switchcnt++;
2616 tdq->tdq_cpu_idle = 0;
2618 if (tdq->tdq_load) {
2620 mi_switch(SW_VOL | SWT_IDLE, NULL);
2627 * A CPU is entering for the first time or a thread is exiting.
2630 sched_throw(struct thread *td)
2632 struct thread *newtd;
2637 /* Correct spinlock nesting and acquire the correct lock. */
2640 PCPU_SET(switchtime, cpu_ticks());
2641 PCPU_SET(switchticks, ticks);
2643 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2644 tdq_load_rem(tdq, td);
2645 lock_profile_release_lock(&TDQ_LOCKPTR(tdq)->lock_object);
2647 KASSERT(curthread->td_md.md_spinlock_count == 1, ("invalid count"));
2648 newtd = choosethread();
2649 TDQ_LOCKPTR(tdq)->mtx_lock = (uintptr_t)newtd;
2650 cpu_throw(td, newtd); /* doesn't return */
2654 * This is called from fork_exit(). Just acquire the correct locks and
2655 * let fork do the rest of the work.
2658 sched_fork_exit(struct thread *td)
2660 struct td_sched *ts;
2665 * Finish setting up thread glue so that it begins execution in a
2666 * non-nested critical section with the scheduler lock held.
2668 cpuid = PCPU_GET(cpuid);
2669 tdq = TDQ_CPU(cpuid);
2671 if (TD_IS_IDLETHREAD(td))
2672 td->td_lock = TDQ_LOCKPTR(tdq);
2673 MPASS(td->td_lock == TDQ_LOCKPTR(tdq));
2674 td->td_oncpu = cpuid;
2675 TDQ_LOCK_ASSERT(tdq, MA_OWNED | MA_NOTRECURSED);
2676 lock_profile_obtain_lock_success(
2677 &TDQ_LOCKPTR(tdq)->lock_object, 0, 0, __FILE__, __LINE__);
2681 * Create on first use to catch odd startup conditons.
2684 sched_tdname(struct thread *td)
2687 struct td_sched *ts;
2690 if (ts->ts_name[0] == '\0')
2691 snprintf(ts->ts_name, sizeof(ts->ts_name),
2692 "%s tid %d", td->td_name, td->td_tid);
2693 return (ts->ts_name);
2695 return (td->td_name);
2701 sched_clear_tdname(struct thread *td)
2703 struct td_sched *ts;
2706 ts->ts_name[0] = '\0';
2713 * Build the CPU topology dump string. Is recursively called to collect
2714 * the topology tree.
2717 sysctl_kern_sched_topology_spec_internal(struct sbuf *sb, struct cpu_group *cg,
2720 char cpusetbuf[CPUSETBUFSIZ];
2723 sbuf_printf(sb, "%*s<group level=\"%d\" cache-level=\"%d\">\n", indent,
2724 "", 1 + indent / 2, cg->cg_level);
2725 sbuf_printf(sb, "%*s <cpu count=\"%d\" mask=\"%s\">", indent, "",
2726 cg->cg_count, cpusetobj_strprint(cpusetbuf, &cg->cg_mask));
2728 for (i = 0; i < MAXCPU; i++) {
2729 if (CPU_ISSET(i, &cg->cg_mask)) {
2731 sbuf_printf(sb, ", ");
2734 sbuf_printf(sb, "%d", i);
2737 sbuf_printf(sb, "</cpu>\n");
2739 if (cg->cg_flags != 0) {
2740 sbuf_printf(sb, "%*s <flags>", indent, "");
2741 if ((cg->cg_flags & CG_FLAG_HTT) != 0)
2742 sbuf_printf(sb, "<flag name=\"HTT\">HTT group</flag>");
2743 if ((cg->cg_flags & CG_FLAG_THREAD) != 0)
2744 sbuf_printf(sb, "<flag name=\"THREAD\">THREAD group</flag>");
2745 if ((cg->cg_flags & CG_FLAG_SMT) != 0)
2746 sbuf_printf(sb, "<flag name=\"SMT\">SMT group</flag>");
2747 sbuf_printf(sb, "</flags>\n");
2750 if (cg->cg_children > 0) {
2751 sbuf_printf(sb, "%*s <children>\n", indent, "");
2752 for (i = 0; i < cg->cg_children; i++)
2753 sysctl_kern_sched_topology_spec_internal(sb,
2754 &cg->cg_child[i], indent+2);
2755 sbuf_printf(sb, "%*s </children>\n", indent, "");
2757 sbuf_printf(sb, "%*s</group>\n", indent, "");
2762 * Sysctl handler for retrieving topology dump. It's a wrapper for
2763 * the recursive sysctl_kern_smp_topology_spec_internal().
2766 sysctl_kern_sched_topology_spec(SYSCTL_HANDLER_ARGS)
2771 KASSERT(cpu_top != NULL, ("cpu_top isn't initialized"));
2773 topo = sbuf_new(NULL, NULL, 500, SBUF_AUTOEXTEND);
2777 sbuf_printf(topo, "<groups>\n");
2778 err = sysctl_kern_sched_topology_spec_internal(topo, cpu_top, 1);
2779 sbuf_printf(topo, "</groups>\n");
2783 err = SYSCTL_OUT(req, sbuf_data(topo), sbuf_len(topo));
2791 SYSCTL_NODE(_kern, OID_AUTO, sched, CTLFLAG_RW, 0, "Scheduler");
2792 SYSCTL_STRING(_kern_sched, OID_AUTO, name, CTLFLAG_RD, "ULE", 0,
2794 SYSCTL_INT(_kern_sched, OID_AUTO, slice, CTLFLAG_RW, &sched_slice, 0,
2795 "Slice size for timeshare threads");
2796 SYSCTL_INT(_kern_sched, OID_AUTO, interact, CTLFLAG_RW, &sched_interact, 0,
2797 "Interactivity score threshold");
2798 SYSCTL_INT(_kern_sched, OID_AUTO, preempt_thresh, CTLFLAG_RW, &preempt_thresh,
2799 0,"Min priority for preemption, lower priorities have greater precedence");
2800 SYSCTL_INT(_kern_sched, OID_AUTO, static_boost, CTLFLAG_RW, &static_boost,
2801 0,"Controls whether static kernel priorities are assigned to sleeping threads.");
2802 SYSCTL_INT(_kern_sched, OID_AUTO, idlespins, CTLFLAG_RW, &sched_idlespins,
2803 0,"Number of times idle will spin waiting for new work.");
2804 SYSCTL_INT(_kern_sched, OID_AUTO, idlespinthresh, CTLFLAG_RW, &sched_idlespinthresh,
2805 0,"Threshold before we will permit idle spinning.");
2807 SYSCTL_INT(_kern_sched, OID_AUTO, affinity, CTLFLAG_RW, &affinity, 0,
2808 "Number of hz ticks to keep thread affinity for");
2809 SYSCTL_INT(_kern_sched, OID_AUTO, balance, CTLFLAG_RW, &rebalance, 0,
2810 "Enables the long-term load balancer");
2811 SYSCTL_INT(_kern_sched, OID_AUTO, balance_interval, CTLFLAG_RW,
2812 &balance_interval, 0,
2813 "Average frequency in stathz ticks to run the long-term balancer");
2814 SYSCTL_INT(_kern_sched, OID_AUTO, steal_idle, CTLFLAG_RW, &steal_idle, 0,
2815 "Attempts to steal work from other cores before idling");
2816 SYSCTL_INT(_kern_sched, OID_AUTO, steal_thresh, CTLFLAG_RW, &steal_thresh, 0,
2817 "Minimum load on remote cpu before we'll steal");
2819 /* Retrieve SMP topology */
2820 SYSCTL_PROC(_kern_sched, OID_AUTO, topology_spec, CTLTYPE_STRING |
2821 CTLFLAG_RD, NULL, 0, sysctl_kern_sched_topology_spec, "A",
2822 "XML dump of detected CPU topology");
2826 /* ps compat. All cpu percentages from ULE are weighted. */
2827 static int ccpu = 0;
2828 SYSCTL_INT(_kern, OID_AUTO, ccpu, CTLFLAG_RD, &ccpu, 0, "");