1 /* SPDX-License-Identifier: GPL-2.0 */
3 * Scheduler internal types and methods:
5 #include <linux/sched.h>
7 #include <linux/sched/autogroup.h>
8 #include <linux/sched/clock.h>
9 #include <linux/sched/coredump.h>
10 #include <linux/sched/cpufreq.h>
11 #include <linux/sched/cputime.h>
12 #include <linux/sched/deadline.h>
13 #include <linux/sched/debug.h>
14 #include <linux/sched/hotplug.h>
15 #include <linux/sched/idle.h>
16 #include <linux/sched/init.h>
17 #include <linux/sched/isolation.h>
18 #include <linux/sched/jobctl.h>
19 #include <linux/sched/loadavg.h>
20 #include <linux/sched/mm.h>
21 #include <linux/sched/nohz.h>
22 #include <linux/sched/numa_balancing.h>
23 #include <linux/sched/prio.h>
24 #include <linux/sched/rt.h>
25 #include <linux/sched/signal.h>
26 #include <linux/sched/smt.h>
27 #include <linux/sched/stat.h>
28 #include <linux/sched/sysctl.h>
29 #include <linux/sched/task.h>
30 #include <linux/sched/task_stack.h>
31 #include <linux/sched/topology.h>
32 #include <linux/sched/user.h>
33 #include <linux/sched/wake_q.h>
34 #include <linux/sched/xacct.h>
36 #include <uapi/linux/sched/types.h>
38 #include <linux/binfmts.h>
39 #include <linux/bitops.h>
40 #include <linux/compat.h>
41 #include <linux/context_tracking.h>
42 #include <linux/cpufreq.h>
43 #include <linux/cpuidle.h>
44 #include <linux/cpuset.h>
45 #include <linux/ctype.h>
46 #include <linux/debugfs.h>
47 #include <linux/delayacct.h>
48 #include <linux/energy_model.h>
49 #include <linux/init_task.h>
50 #include <linux/kprobes.h>
51 #include <linux/kthread.h>
52 #include <linux/membarrier.h>
53 #include <linux/migrate.h>
54 #include <linux/mmu_context.h>
55 #include <linux/nmi.h>
56 #include <linux/proc_fs.h>
57 #include <linux/prefetch.h>
58 #include <linux/profile.h>
59 #include <linux/psi.h>
60 #include <linux/ratelimit.h>
61 #include <linux/rcupdate_wait.h>
62 #include <linux/security.h>
63 #include <linux/stop_machine.h>
64 #include <linux/suspend.h>
65 #include <linux/swait.h>
66 #include <linux/syscalls.h>
67 #include <linux/task_work.h>
68 #include <linux/tsacct_kern.h>
72 #ifdef CONFIG_PARAVIRT
73 # include <asm/paravirt.h>
77 #include "cpudeadline.h"
79 #include <trace/events/sched.h>
81 #ifdef CONFIG_SCHED_DEBUG
82 # define SCHED_WARN_ON(x) WARN_ONCE(x, #x)
84 # define SCHED_WARN_ON(x) ({ (void)(x), 0; })
90 /* task_struct::on_rq states: */
91 #define TASK_ON_RQ_QUEUED 1
92 #define TASK_ON_RQ_MIGRATING 2
94 extern __read_mostly int scheduler_running;
96 extern unsigned long calc_load_update;
97 extern atomic_long_t calc_load_tasks;
99 extern void calc_global_load_tick(struct rq *this_rq);
100 extern long calc_load_fold_active(struct rq *this_rq, long adjust);
102 extern void call_trace_sched_update_nr_running(struct rq *rq, int count);
104 * Helpers for converting nanosecond timing to jiffy resolution
106 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
109 * Increase resolution of nice-level calculations for 64-bit architectures.
110 * The extra resolution improves shares distribution and load balancing of
111 * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup
112 * hierarchies, especially on larger systems. This is not a user-visible change
113 * and does not change the user-interface for setting shares/weights.
115 * We increase resolution only if we have enough bits to allow this increased
116 * resolution (i.e. 64-bit). The costs for increasing resolution when 32-bit
117 * are pretty high and the returns do not justify the increased costs.
119 * Really only required when CONFIG_FAIR_GROUP_SCHED=y is also set, but to
120 * increase coverage and consistency always enable it on 64-bit platforms.
123 # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT + SCHED_FIXEDPOINT_SHIFT)
124 # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT)
125 # define scale_load_down(w) \
127 unsigned long __w = (w); \
129 __w = max(2UL, __w >> SCHED_FIXEDPOINT_SHIFT); \
133 # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT)
134 # define scale_load(w) (w)
135 # define scale_load_down(w) (w)
139 * Task weight (visible to users) and its load (invisible to users) have
140 * independent resolution, but they should be well calibrated. We use
141 * scale_load() and scale_load_down(w) to convert between them. The
142 * following must be true:
144 * scale_load(sched_prio_to_weight[NICE_TO_PRIO(0)-MAX_RT_PRIO]) == NICE_0_LOAD
147 #define NICE_0_LOAD (1L << NICE_0_LOAD_SHIFT)
150 * Single value that decides SCHED_DEADLINE internal math precision.
151 * 10 -> just above 1us
152 * 9 -> just above 0.5us
157 * Single value that denotes runtime == period, ie unlimited time.
159 #define RUNTIME_INF ((u64)~0ULL)
161 static inline int idle_policy(int policy)
163 return policy == SCHED_IDLE;
165 static inline int fair_policy(int policy)
167 return policy == SCHED_NORMAL || policy == SCHED_BATCH;
170 static inline int rt_policy(int policy)
172 return policy == SCHED_FIFO || policy == SCHED_RR;
175 static inline int dl_policy(int policy)
177 return policy == SCHED_DEADLINE;
179 static inline bool valid_policy(int policy)
181 return idle_policy(policy) || fair_policy(policy) ||
182 rt_policy(policy) || dl_policy(policy);
185 static inline int task_has_idle_policy(struct task_struct *p)
187 return idle_policy(p->policy);
190 static inline int task_has_rt_policy(struct task_struct *p)
192 return rt_policy(p->policy);
195 static inline int task_has_dl_policy(struct task_struct *p)
197 return dl_policy(p->policy);
200 #define cap_scale(v, s) ((v)*(s) >> SCHED_CAPACITY_SHIFT)
202 static inline void update_avg(u64 *avg, u64 sample)
204 s64 diff = sample - *avg;
209 * Shifting a value by an exponent greater *or equal* to the size of said value
210 * is UB; cap at size-1.
212 #define shr_bound(val, shift) \
213 (val >> min_t(typeof(shift), shift, BITS_PER_TYPE(typeof(val)) - 1))
216 * !! For sched_setattr_nocheck() (kernel) only !!
218 * This is actually gross. :(
220 * It is used to make schedutil kworker(s) higher priority than SCHED_DEADLINE
221 * tasks, but still be able to sleep. We need this on platforms that cannot
222 * atomically change clock frequency. Remove once fast switching will be
223 * available on such platforms.
225 * SUGOV stands for SchedUtil GOVernor.
227 #define SCHED_FLAG_SUGOV 0x10000000
229 #define SCHED_DL_FLAGS (SCHED_FLAG_RECLAIM | SCHED_FLAG_DL_OVERRUN | SCHED_FLAG_SUGOV)
231 static inline bool dl_entity_is_special(struct sched_dl_entity *dl_se)
233 #ifdef CONFIG_CPU_FREQ_GOV_SCHEDUTIL
234 return unlikely(dl_se->flags & SCHED_FLAG_SUGOV);
241 * Tells if entity @a should preempt entity @b.
244 dl_entity_preempt(struct sched_dl_entity *a, struct sched_dl_entity *b)
246 return dl_entity_is_special(a) ||
247 dl_time_before(a->deadline, b->deadline);
251 * This is the priority-queue data structure of the RT scheduling class:
253 struct rt_prio_array {
254 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
255 struct list_head queue[MAX_RT_PRIO];
258 struct rt_bandwidth {
259 /* nests inside the rq lock: */
260 raw_spinlock_t rt_runtime_lock;
263 struct hrtimer rt_period_timer;
264 unsigned int rt_period_active;
267 void __dl_clear_params(struct task_struct *p);
269 struct dl_bandwidth {
270 raw_spinlock_t dl_runtime_lock;
275 static inline int dl_bandwidth_enabled(void)
277 return sysctl_sched_rt_runtime >= 0;
281 * To keep the bandwidth of -deadline tasks under control
282 * we need some place where:
283 * - store the maximum -deadline bandwidth of each cpu;
284 * - cache the fraction of bandwidth that is currently allocated in
287 * This is all done in the data structure below. It is similar to the
288 * one used for RT-throttling (rt_bandwidth), with the main difference
289 * that, since here we are only interested in admission control, we
290 * do not decrease any runtime while the group "executes", neither we
291 * need a timer to replenish it.
293 * With respect to SMP, bandwidth is given on a per root domain basis,
295 * - bw (< 100%) is the deadline bandwidth of each CPU;
296 * - total_bw is the currently allocated bandwidth in each root domain;
304 static inline void __dl_update(struct dl_bw *dl_b, s64 bw);
307 void __dl_sub(struct dl_bw *dl_b, u64 tsk_bw, int cpus)
309 dl_b->total_bw -= tsk_bw;
310 __dl_update(dl_b, (s32)tsk_bw / cpus);
314 void __dl_add(struct dl_bw *dl_b, u64 tsk_bw, int cpus)
316 dl_b->total_bw += tsk_bw;
317 __dl_update(dl_b, -((s32)tsk_bw / cpus));
320 static inline bool __dl_overflow(struct dl_bw *dl_b, unsigned long cap,
321 u64 old_bw, u64 new_bw)
323 return dl_b->bw != -1 &&
324 cap_scale(dl_b->bw, cap) < dl_b->total_bw - old_bw + new_bw;
328 * Verify the fitness of task @p to run on @cpu taking into account the
329 * CPU original capacity and the runtime/deadline ratio of the task.
331 * The function will return true if the CPU original capacity of the
332 * @cpu scaled by SCHED_CAPACITY_SCALE >= runtime/deadline ratio of the
333 * task and false otherwise.
335 static inline bool dl_task_fits_capacity(struct task_struct *p, int cpu)
337 unsigned long cap = arch_scale_cpu_capacity(cpu);
339 return cap_scale(p->dl.dl_deadline, cap) >= p->dl.dl_runtime;
342 extern void init_dl_bw(struct dl_bw *dl_b);
343 extern int sched_dl_global_validate(void);
344 extern void sched_dl_do_global(void);
345 extern int sched_dl_overflow(struct task_struct *p, int policy, const struct sched_attr *attr);
346 extern void __setparam_dl(struct task_struct *p, const struct sched_attr *attr);
347 extern void __getparam_dl(struct task_struct *p, struct sched_attr *attr);
348 extern bool __checkparam_dl(const struct sched_attr *attr);
349 extern bool dl_param_changed(struct task_struct *p, const struct sched_attr *attr);
350 extern int dl_task_can_attach(struct task_struct *p, const struct cpumask *cs_cpus_allowed);
351 extern int dl_cpuset_cpumask_can_shrink(const struct cpumask *cur, const struct cpumask *trial);
352 extern bool dl_cpu_busy(unsigned int cpu);
354 #ifdef CONFIG_CGROUP_SCHED
356 #include <linux/cgroup.h>
357 #include <linux/psi.h>
362 extern struct list_head task_groups;
364 struct cfs_bandwidth {
365 #ifdef CONFIG_CFS_BANDWIDTH
372 s64 hierarchical_quota;
377 struct hrtimer period_timer;
378 struct hrtimer slack_timer;
379 struct list_head throttled_cfs_rq;
390 /* Task group related information */
392 struct cgroup_subsys_state css;
394 #ifdef CONFIG_FAIR_GROUP_SCHED
395 /* schedulable entities of this group on each CPU */
396 struct sched_entity **se;
397 /* runqueue "owned" by this group on each CPU */
398 struct cfs_rq **cfs_rq;
399 unsigned long shares;
401 /* A positive value indicates that this is a SCHED_IDLE group. */
406 * load_avg can be heavily contended at clock tick time, so put
407 * it in its own cacheline separated from the fields above which
408 * will also be accessed at each tick.
410 atomic_long_t load_avg ____cacheline_aligned;
414 #ifdef CONFIG_RT_GROUP_SCHED
415 struct sched_rt_entity **rt_se;
416 struct rt_rq **rt_rq;
418 struct rt_bandwidth rt_bandwidth;
422 struct list_head list;
424 struct task_group *parent;
425 struct list_head siblings;
426 struct list_head children;
428 #ifdef CONFIG_SCHED_AUTOGROUP
429 struct autogroup *autogroup;
432 struct cfs_bandwidth cfs_bandwidth;
434 #ifdef CONFIG_UCLAMP_TASK_GROUP
435 /* The two decimal precision [%] value requested from user-space */
436 unsigned int uclamp_pct[UCLAMP_CNT];
437 /* Clamp values requested for a task group */
438 struct uclamp_se uclamp_req[UCLAMP_CNT];
439 /* Effective clamp values used for a task group */
440 struct uclamp_se uclamp[UCLAMP_CNT];
445 #ifdef CONFIG_FAIR_GROUP_SCHED
446 #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD
449 * A weight of 0 or 1 can cause arithmetics problems.
450 * A weight of a cfs_rq is the sum of weights of which entities
451 * are queued on this cfs_rq, so a weight of a entity should not be
452 * too large, so as the shares value of a task group.
453 * (The default weight is 1024 - so there's no practical
454 * limitation from this.)
456 #define MIN_SHARES (1UL << 1)
457 #define MAX_SHARES (1UL << 18)
460 typedef int (*tg_visitor)(struct task_group *, void *);
462 extern int walk_tg_tree_from(struct task_group *from,
463 tg_visitor down, tg_visitor up, void *data);
466 * Iterate the full tree, calling @down when first entering a node and @up when
467 * leaving it for the final time.
469 * Caller must hold rcu_lock or sufficient equivalent.
471 static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
473 return walk_tg_tree_from(&root_task_group, down, up, data);
476 extern int tg_nop(struct task_group *tg, void *data);
478 extern void free_fair_sched_group(struct task_group *tg);
479 extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent);
480 extern void online_fair_sched_group(struct task_group *tg);
481 extern void unregister_fair_sched_group(struct task_group *tg);
482 extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
483 struct sched_entity *se, int cpu,
484 struct sched_entity *parent);
485 extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b);
487 extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b);
488 extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b);
489 extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq);
491 extern void unregister_rt_sched_group(struct task_group *tg);
492 extern void free_rt_sched_group(struct task_group *tg);
493 extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent);
494 extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
495 struct sched_rt_entity *rt_se, int cpu,
496 struct sched_rt_entity *parent);
497 extern int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us);
498 extern int sched_group_set_rt_period(struct task_group *tg, u64 rt_period_us);
499 extern long sched_group_rt_runtime(struct task_group *tg);
500 extern long sched_group_rt_period(struct task_group *tg);
501 extern int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk);
503 extern struct task_group *sched_create_group(struct task_group *parent);
504 extern void sched_online_group(struct task_group *tg,
505 struct task_group *parent);
506 extern void sched_destroy_group(struct task_group *tg);
507 extern void sched_release_group(struct task_group *tg);
509 extern void sched_move_task(struct task_struct *tsk);
511 #ifdef CONFIG_FAIR_GROUP_SCHED
512 extern int sched_group_set_shares(struct task_group *tg, unsigned long shares);
514 extern int sched_group_set_idle(struct task_group *tg, long idle);
517 extern void set_task_rq_fair(struct sched_entity *se,
518 struct cfs_rq *prev, struct cfs_rq *next);
519 #else /* !CONFIG_SMP */
520 static inline void set_task_rq_fair(struct sched_entity *se,
521 struct cfs_rq *prev, struct cfs_rq *next) { }
522 #endif /* CONFIG_SMP */
523 #endif /* CONFIG_FAIR_GROUP_SCHED */
525 #else /* CONFIG_CGROUP_SCHED */
527 struct cfs_bandwidth { };
529 #endif /* CONFIG_CGROUP_SCHED */
531 /* CFS-related fields in a runqueue */
533 struct load_weight load;
534 unsigned int nr_running;
535 unsigned int h_nr_running; /* SCHED_{NORMAL,BATCH,IDLE} */
536 unsigned int idle_nr_running; /* SCHED_IDLE */
537 unsigned int idle_h_nr_running; /* SCHED_IDLE */
541 #ifdef CONFIG_SCHED_CORE
542 unsigned int forceidle_seq;
547 u64 min_vruntime_copy;
550 struct rb_root_cached tasks_timeline;
553 * 'curr' points to currently running entity on this cfs_rq.
554 * It is set to NULL otherwise (i.e when none are currently running).
556 struct sched_entity *curr;
557 struct sched_entity *next;
558 struct sched_entity *last;
559 struct sched_entity *skip;
561 #ifdef CONFIG_SCHED_DEBUG
562 unsigned int nr_spread_over;
569 struct sched_avg avg;
571 u64 load_last_update_time_copy;
574 raw_spinlock_t lock ____cacheline_aligned;
576 unsigned long load_avg;
577 unsigned long util_avg;
578 unsigned long runnable_avg;
581 #ifdef CONFIG_FAIR_GROUP_SCHED
582 unsigned long tg_load_avg_contrib;
584 long prop_runnable_sum;
587 * h_load = weight * f(tg)
589 * Where f(tg) is the recursive weight fraction assigned to
592 unsigned long h_load;
593 u64 last_h_load_update;
594 struct sched_entity *h_load_next;
595 #endif /* CONFIG_FAIR_GROUP_SCHED */
596 #endif /* CONFIG_SMP */
598 #ifdef CONFIG_FAIR_GROUP_SCHED
599 struct rq *rq; /* CPU runqueue to which this cfs_rq is attached */
602 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
603 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
604 * (like users, containers etc.)
606 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a CPU.
607 * This list is used during load balance.
610 struct list_head leaf_cfs_rq_list;
611 struct task_group *tg; /* group that "owns" this runqueue */
613 /* Locally cached copy of our task_group's idle value */
616 #ifdef CONFIG_CFS_BANDWIDTH
618 s64 runtime_remaining;
621 u64 throttled_clock_task;
622 u64 throttled_clock_task_time;
625 struct list_head throttled_list;
626 #endif /* CONFIG_CFS_BANDWIDTH */
627 #endif /* CONFIG_FAIR_GROUP_SCHED */
630 static inline int rt_bandwidth_enabled(void)
632 return sysctl_sched_rt_runtime >= 0;
635 /* RT IPI pull logic requires IRQ_WORK */
636 #if defined(CONFIG_IRQ_WORK) && defined(CONFIG_SMP)
637 # define HAVE_RT_PUSH_IPI
640 /* Real-Time classes' related field in a runqueue: */
642 struct rt_prio_array active;
643 unsigned int rt_nr_running;
644 unsigned int rr_nr_running;
645 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
647 int curr; /* highest queued rt task prio */
649 int next; /* next highest */
654 unsigned int rt_nr_migratory;
655 unsigned int rt_nr_total;
657 struct plist_head pushable_tasks;
659 #endif /* CONFIG_SMP */
665 /* Nests inside the rq lock: */
666 raw_spinlock_t rt_runtime_lock;
668 #ifdef CONFIG_RT_GROUP_SCHED
669 unsigned int rt_nr_boosted;
672 struct task_group *tg;
676 static inline bool rt_rq_is_runnable(struct rt_rq *rt_rq)
678 return rt_rq->rt_queued && rt_rq->rt_nr_running;
681 /* Deadline class' related fields in a runqueue */
683 /* runqueue is an rbtree, ordered by deadline */
684 struct rb_root_cached root;
686 unsigned int dl_nr_running;
690 * Deadline values of the currently executing and the
691 * earliest ready task on this rq. Caching these facilitates
692 * the decision whether or not a ready but not running task
693 * should migrate somewhere else.
700 unsigned int dl_nr_migratory;
704 * Tasks on this rq that can be pushed away. They are kept in
705 * an rb-tree, ordered by tasks' deadlines, with caching
706 * of the leftmost (earliest deadline) element.
708 struct rb_root_cached pushable_dl_tasks_root;
713 * "Active utilization" for this runqueue: increased when a
714 * task wakes up (becomes TASK_RUNNING) and decreased when a
720 * Utilization of the tasks "assigned" to this runqueue (including
721 * the tasks that are in runqueue and the tasks that executed on this
722 * CPU and blocked). Increased when a task moves to this runqueue, and
723 * decreased when the task moves away (migrates, changes scheduling
724 * policy, or terminates).
725 * This is needed to compute the "inactive utilization" for the
726 * runqueue (inactive utilization = this_bw - running_bw).
732 * Inverse of the fraction of CPU utilization that can be reclaimed
733 * by the GRUB algorithm.
738 #ifdef CONFIG_FAIR_GROUP_SCHED
739 /* An entity is a task if it doesn't "own" a runqueue */
740 #define entity_is_task(se) (!se->my_q)
742 static inline void se_update_runnable(struct sched_entity *se)
744 if (!entity_is_task(se))
745 se->runnable_weight = se->my_q->h_nr_running;
748 static inline long se_runnable(struct sched_entity *se)
750 if (entity_is_task(se))
753 return se->runnable_weight;
757 #define entity_is_task(se) 1
759 static inline void se_update_runnable(struct sched_entity *se) {}
761 static inline long se_runnable(struct sched_entity *se)
769 * XXX we want to get rid of these helpers and use the full load resolution.
771 static inline long se_weight(struct sched_entity *se)
773 return scale_load_down(se->load.weight);
777 static inline bool sched_asym_prefer(int a, int b)
779 return arch_asym_cpu_priority(a) > arch_asym_cpu_priority(b);
783 struct em_perf_domain *em_pd;
784 struct perf_domain *next;
788 /* Scheduling group status flags */
789 #define SG_OVERLOAD 0x1 /* More than one runnable task on a CPU. */
790 #define SG_OVERUTILIZED 0x2 /* One or more CPUs are over-utilized. */
793 * We add the notion of a root-domain which will be used to define per-domain
794 * variables. Each exclusive cpuset essentially defines an island domain by
795 * fully partitioning the member CPUs from any other cpuset. Whenever a new
796 * exclusive cpuset is created, we also create and attach a new root-domain
805 cpumask_var_t online;
808 * Indicate pullable load on at least one CPU, e.g:
809 * - More than one runnable task
810 * - Running task is misfit
814 /* Indicate one or more cpus over-utilized (tipping point) */
818 * The bit corresponding to a CPU gets set here if such CPU has more
819 * than one runnable -deadline task (as it is below for RT tasks).
821 cpumask_var_t dlo_mask;
827 * Indicate whether a root_domain's dl_bw has been checked or
828 * updated. It's monotonously increasing value.
830 * Also, some corner cases, like 'wrap around' is dangerous, but given
831 * that u64 is 'big enough'. So that shouldn't be a concern.
835 #ifdef HAVE_RT_PUSH_IPI
837 * For IPI pull requests, loop across the rto_mask.
839 struct irq_work rto_push_work;
840 raw_spinlock_t rto_lock;
841 /* These are only updated and read within rto_lock */
844 /* These atomics are updated outside of a lock */
845 atomic_t rto_loop_next;
846 atomic_t rto_loop_start;
849 * The "RT overload" flag: it gets set if a CPU has more than
850 * one runnable RT task.
852 cpumask_var_t rto_mask;
853 struct cpupri cpupri;
855 unsigned long max_cpu_capacity;
858 * NULL-terminated list of performance domains intersecting with the
859 * CPUs of the rd. Protected by RCU.
861 struct perf_domain __rcu *pd;
864 extern void init_defrootdomain(void);
865 extern int sched_init_domains(const struct cpumask *cpu_map);
866 extern void rq_attach_root(struct rq *rq, struct root_domain *rd);
867 extern void sched_get_rd(struct root_domain *rd);
868 extern void sched_put_rd(struct root_domain *rd);
870 #ifdef HAVE_RT_PUSH_IPI
871 extern void rto_push_irq_work_func(struct irq_work *work);
873 #endif /* CONFIG_SMP */
875 #ifdef CONFIG_UCLAMP_TASK
877 * struct uclamp_bucket - Utilization clamp bucket
878 * @value: utilization clamp value for tasks on this clamp bucket
879 * @tasks: number of RUNNABLE tasks on this clamp bucket
881 * Keep track of how many tasks are RUNNABLE for a given utilization
884 struct uclamp_bucket {
885 unsigned long value : bits_per(SCHED_CAPACITY_SCALE);
886 unsigned long tasks : BITS_PER_LONG - bits_per(SCHED_CAPACITY_SCALE);
890 * struct uclamp_rq - rq's utilization clamp
891 * @value: currently active clamp values for a rq
892 * @bucket: utilization clamp buckets affecting a rq
894 * Keep track of RUNNABLE tasks on a rq to aggregate their clamp values.
895 * A clamp value is affecting a rq when there is at least one task RUNNABLE
896 * (or actually running) with that value.
898 * There are up to UCLAMP_CNT possible different clamp values, currently there
899 * are only two: minimum utilization and maximum utilization.
901 * All utilization clamping values are MAX aggregated, since:
902 * - for util_min: we want to run the CPU at least at the max of the minimum
903 * utilization required by its currently RUNNABLE tasks.
904 * - for util_max: we want to allow the CPU to run up to the max of the
905 * maximum utilization allowed by its currently RUNNABLE tasks.
907 * Since on each system we expect only a limited number of different
908 * utilization clamp values (UCLAMP_BUCKETS), use a simple array to track
909 * the metrics required to compute all the per-rq utilization clamp values.
913 struct uclamp_bucket bucket[UCLAMP_BUCKETS];
916 DECLARE_STATIC_KEY_FALSE(sched_uclamp_used);
917 #endif /* CONFIG_UCLAMP_TASK */
920 * This is the main, per-CPU runqueue data structure.
922 * Locking rule: those places that want to lock multiple runqueues
923 * (such as the load balancing or the thread migration code), lock
924 * acquire operations must be ordered by ascending &runqueue.
928 raw_spinlock_t __lock;
931 * nr_running and cpu_load should be in the same cacheline because
932 * remote CPUs use both these fields when doing load calculation.
934 unsigned int nr_running;
935 #ifdef CONFIG_NUMA_BALANCING
936 unsigned int nr_numa_running;
937 unsigned int nr_preferred_running;
938 unsigned int numa_migrate_on;
940 #ifdef CONFIG_NO_HZ_COMMON
942 unsigned long last_blocked_load_update_tick;
943 unsigned int has_blocked_load;
944 call_single_data_t nohz_csd;
945 #endif /* CONFIG_SMP */
946 unsigned int nohz_tick_stopped;
948 #endif /* CONFIG_NO_HZ_COMMON */
951 unsigned int ttwu_pending;
955 #ifdef CONFIG_UCLAMP_TASK
956 /* Utilization clamp values based on CPU's RUNNABLE tasks */
957 struct uclamp_rq uclamp[UCLAMP_CNT] ____cacheline_aligned;
958 unsigned int uclamp_flags;
959 #define UCLAMP_FLAG_IDLE 0x01
966 #ifdef CONFIG_FAIR_GROUP_SCHED
967 /* list of leaf cfs_rq on this CPU: */
968 struct list_head leaf_cfs_rq_list;
969 struct list_head *tmp_alone_branch;
970 #endif /* CONFIG_FAIR_GROUP_SCHED */
973 * This is part of a global counter where only the total sum
974 * over all CPUs matters. A task can increase this counter on
975 * one CPU and if it got migrated afterwards it may decrease
976 * it on another CPU. Always updated under the runqueue lock:
978 unsigned int nr_uninterruptible;
980 struct task_struct __rcu *curr;
981 struct task_struct *idle;
982 struct task_struct *stop;
983 unsigned long next_balance;
984 struct mm_struct *prev_mm;
986 unsigned int clock_update_flags;
988 /* Ensure that all clocks are in the same cache line */
989 u64 clock_task ____cacheline_aligned;
991 unsigned long lost_idle_time;
995 #ifdef CONFIG_SCHED_DEBUG
996 u64 last_seen_need_resched_ns;
997 int ticks_without_resched;
1000 #ifdef CONFIG_MEMBARRIER
1001 int membarrier_state;
1005 struct root_domain *rd;
1006 struct sched_domain __rcu *sd;
1008 unsigned long cpu_capacity;
1009 unsigned long cpu_capacity_orig;
1011 struct callback_head *balance_callback;
1013 unsigned char nohz_idle_balance;
1014 unsigned char idle_balance;
1016 unsigned long misfit_task_load;
1018 /* For active balancing */
1021 struct cpu_stop_work active_balance_work;
1023 /* CPU of this runqueue: */
1027 struct list_head cfs_tasks;
1029 struct sched_avg avg_rt;
1030 struct sched_avg avg_dl;
1031 #ifdef CONFIG_HAVE_SCHED_AVG_IRQ
1032 struct sched_avg avg_irq;
1034 #ifdef CONFIG_SCHED_THERMAL_PRESSURE
1035 struct sched_avg avg_thermal;
1040 unsigned long wake_stamp;
1043 /* This is used to determine avg_idle's max value */
1044 u64 max_idle_balance_cost;
1046 #ifdef CONFIG_HOTPLUG_CPU
1047 struct rcuwait hotplug_wait;
1049 #endif /* CONFIG_SMP */
1051 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
1054 #ifdef CONFIG_PARAVIRT
1055 u64 prev_steal_time;
1057 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
1058 u64 prev_steal_time_rq;
1061 /* calc_load related fields */
1062 unsigned long calc_load_update;
1063 long calc_load_active;
1065 #ifdef CONFIG_SCHED_HRTICK
1067 call_single_data_t hrtick_csd;
1069 struct hrtimer hrtick_timer;
1070 ktime_t hrtick_time;
1073 #ifdef CONFIG_SCHEDSTATS
1075 struct sched_info rq_sched_info;
1076 unsigned long long rq_cpu_time;
1077 /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */
1079 /* sys_sched_yield() stats */
1080 unsigned int yld_count;
1082 /* schedule() stats */
1083 unsigned int sched_count;
1084 unsigned int sched_goidle;
1086 /* try_to_wake_up() stats */
1087 unsigned int ttwu_count;
1088 unsigned int ttwu_local;
1091 #ifdef CONFIG_CPU_IDLE
1092 /* Must be inspected within a rcu lock section */
1093 struct cpuidle_state *idle_state;
1097 unsigned int nr_pinned;
1099 unsigned int push_busy;
1100 struct cpu_stop_work push_work;
1102 #ifdef CONFIG_SCHED_CORE
1105 struct task_struct *core_pick;
1106 unsigned int core_enabled;
1107 unsigned int core_sched_seq;
1108 struct rb_root core_tree;
1110 /* shared state -- careful with sched_core_cpu_deactivate() */
1111 unsigned int core_task_seq;
1112 unsigned int core_pick_seq;
1113 unsigned long core_cookie;
1114 unsigned int core_forceidle_count;
1115 unsigned int core_forceidle_seq;
1116 unsigned int core_forceidle_occupation;
1117 u64 core_forceidle_start;
1121 #ifdef CONFIG_FAIR_GROUP_SCHED
1123 /* CPU runqueue to which this cfs_rq is attached */
1124 static inline struct rq *rq_of(struct cfs_rq *cfs_rq)
1131 static inline struct rq *rq_of(struct cfs_rq *cfs_rq)
1133 return container_of(cfs_rq, struct rq, cfs);
1137 static inline int cpu_of(struct rq *rq)
1146 #define MDF_PUSH 0x01
1148 static inline bool is_migration_disabled(struct task_struct *p)
1151 return p->migration_disabled;
1158 #ifdef CONFIG_SCHED_CORE
1159 static inline struct cpumask *sched_group_span(struct sched_group *sg);
1161 DECLARE_STATIC_KEY_FALSE(__sched_core_enabled);
1163 static inline bool sched_core_enabled(struct rq *rq)
1165 return static_branch_unlikely(&__sched_core_enabled) && rq->core_enabled;
1168 static inline bool sched_core_disabled(void)
1170 return !static_branch_unlikely(&__sched_core_enabled);
1174 * Be careful with this function; not for general use. The return value isn't
1175 * stable unless you actually hold a relevant rq->__lock.
1177 static inline raw_spinlock_t *rq_lockp(struct rq *rq)
1179 if (sched_core_enabled(rq))
1180 return &rq->core->__lock;
1185 static inline raw_spinlock_t *__rq_lockp(struct rq *rq)
1187 if (rq->core_enabled)
1188 return &rq->core->__lock;
1193 bool cfs_prio_less(struct task_struct *a, struct task_struct *b, bool fi);
1196 * Helpers to check if the CPU's core cookie matches with the task's cookie
1197 * when core scheduling is enabled.
1198 * A special case is that the task's cookie always matches with CPU's core
1199 * cookie if the CPU is in an idle core.
1201 static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p)
1203 /* Ignore cookie match if core scheduler is not enabled on the CPU. */
1204 if (!sched_core_enabled(rq))
1207 return rq->core->core_cookie == p->core_cookie;
1210 static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p)
1212 bool idle_core = true;
1215 /* Ignore cookie match if core scheduler is not enabled on the CPU. */
1216 if (!sched_core_enabled(rq))
1219 for_each_cpu(cpu, cpu_smt_mask(cpu_of(rq))) {
1220 if (!available_idle_cpu(cpu)) {
1227 * A CPU in an idle core is always the best choice for tasks with
1230 return idle_core || rq->core->core_cookie == p->core_cookie;
1233 static inline bool sched_group_cookie_match(struct rq *rq,
1234 struct task_struct *p,
1235 struct sched_group *group)
1239 /* Ignore cookie match if core scheduler is not enabled on the CPU. */
1240 if (!sched_core_enabled(rq))
1243 for_each_cpu_and(cpu, sched_group_span(group), p->cpus_ptr) {
1244 if (sched_core_cookie_match(rq, p))
1250 static inline bool sched_core_enqueued(struct task_struct *p)
1252 return !RB_EMPTY_NODE(&p->core_node);
1255 extern void sched_core_enqueue(struct rq *rq, struct task_struct *p);
1256 extern void sched_core_dequeue(struct rq *rq, struct task_struct *p, int flags);
1258 extern void sched_core_get(void);
1259 extern void sched_core_put(void);
1261 #else /* !CONFIG_SCHED_CORE */
1263 static inline bool sched_core_enabled(struct rq *rq)
1268 static inline bool sched_core_disabled(void)
1273 static inline raw_spinlock_t *rq_lockp(struct rq *rq)
1278 static inline raw_spinlock_t *__rq_lockp(struct rq *rq)
1283 static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p)
1288 static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p)
1293 static inline bool sched_group_cookie_match(struct rq *rq,
1294 struct task_struct *p,
1295 struct sched_group *group)
1299 #endif /* CONFIG_SCHED_CORE */
1301 static inline void lockdep_assert_rq_held(struct rq *rq)
1303 lockdep_assert_held(__rq_lockp(rq));
1306 extern void raw_spin_rq_lock_nested(struct rq *rq, int subclass);
1307 extern bool raw_spin_rq_trylock(struct rq *rq);
1308 extern void raw_spin_rq_unlock(struct rq *rq);
1310 static inline void raw_spin_rq_lock(struct rq *rq)
1312 raw_spin_rq_lock_nested(rq, 0);
1315 static inline void raw_spin_rq_lock_irq(struct rq *rq)
1317 local_irq_disable();
1318 raw_spin_rq_lock(rq);
1321 static inline void raw_spin_rq_unlock_irq(struct rq *rq)
1323 raw_spin_rq_unlock(rq);
1327 static inline unsigned long _raw_spin_rq_lock_irqsave(struct rq *rq)
1329 unsigned long flags;
1330 local_irq_save(flags);
1331 raw_spin_rq_lock(rq);
1335 static inline void raw_spin_rq_unlock_irqrestore(struct rq *rq, unsigned long flags)
1337 raw_spin_rq_unlock(rq);
1338 local_irq_restore(flags);
1341 #define raw_spin_rq_lock_irqsave(rq, flags) \
1343 flags = _raw_spin_rq_lock_irqsave(rq); \
1346 #ifdef CONFIG_SCHED_SMT
1347 extern void __update_idle_core(struct rq *rq);
1349 static inline void update_idle_core(struct rq *rq)
1351 if (static_branch_unlikely(&sched_smt_present))
1352 __update_idle_core(rq);
1356 static inline void update_idle_core(struct rq *rq) { }
1359 DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
1361 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
1362 #define this_rq() this_cpu_ptr(&runqueues)
1363 #define task_rq(p) cpu_rq(task_cpu(p))
1364 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
1365 #define raw_rq() raw_cpu_ptr(&runqueues)
1367 #ifdef CONFIG_FAIR_GROUP_SCHED
1368 static inline struct task_struct *task_of(struct sched_entity *se)
1370 SCHED_WARN_ON(!entity_is_task(se));
1371 return container_of(se, struct task_struct, se);
1374 static inline struct cfs_rq *task_cfs_rq(struct task_struct *p)
1376 return p->se.cfs_rq;
1379 /* runqueue on which this entity is (to be) queued */
1380 static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se)
1385 /* runqueue "owned" by this group */
1386 static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp)
1393 static inline struct task_struct *task_of(struct sched_entity *se)
1395 return container_of(se, struct task_struct, se);
1398 static inline struct cfs_rq *task_cfs_rq(struct task_struct *p)
1400 return &task_rq(p)->cfs;
1403 static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se)
1405 struct task_struct *p = task_of(se);
1406 struct rq *rq = task_rq(p);
1411 /* runqueue "owned" by this group */
1412 static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp)
1418 extern void update_rq_clock(struct rq *rq);
1421 * rq::clock_update_flags bits
1423 * %RQCF_REQ_SKIP - will request skipping of clock update on the next
1424 * call to __schedule(). This is an optimisation to avoid
1425 * neighbouring rq clock updates.
1427 * %RQCF_ACT_SKIP - is set from inside of __schedule() when skipping is
1428 * in effect and calls to update_rq_clock() are being ignored.
1430 * %RQCF_UPDATED - is a debug flag that indicates whether a call has been
1431 * made to update_rq_clock() since the last time rq::lock was pinned.
1433 * If inside of __schedule(), clock_update_flags will have been
1434 * shifted left (a left shift is a cheap operation for the fast path
1435 * to promote %RQCF_REQ_SKIP to %RQCF_ACT_SKIP), so you must use,
1437 * if (rq-clock_update_flags >= RQCF_UPDATED)
1439 * to check if %RQCF_UPDATED is set. It'll never be shifted more than
1440 * one position though, because the next rq_unpin_lock() will shift it
1443 #define RQCF_REQ_SKIP 0x01
1444 #define RQCF_ACT_SKIP 0x02
1445 #define RQCF_UPDATED 0x04
1447 static inline void assert_clock_updated(struct rq *rq)
1450 * The only reason for not seeing a clock update since the
1451 * last rq_pin_lock() is if we're currently skipping updates.
1453 SCHED_WARN_ON(rq->clock_update_flags < RQCF_ACT_SKIP);
1456 static inline u64 rq_clock(struct rq *rq)
1458 lockdep_assert_rq_held(rq);
1459 assert_clock_updated(rq);
1464 static inline u64 rq_clock_task(struct rq *rq)
1466 lockdep_assert_rq_held(rq);
1467 assert_clock_updated(rq);
1469 return rq->clock_task;
1473 * By default the decay is the default pelt decay period.
1474 * The decay shift can change the decay period in
1476 * Decay shift Decay period(ms)
1483 extern int sched_thermal_decay_shift;
1485 static inline u64 rq_clock_thermal(struct rq *rq)
1487 return rq_clock_task(rq) >> sched_thermal_decay_shift;
1490 static inline void rq_clock_skip_update(struct rq *rq)
1492 lockdep_assert_rq_held(rq);
1493 rq->clock_update_flags |= RQCF_REQ_SKIP;
1497 * See rt task throttling, which is the only time a skip
1498 * request is canceled.
1500 static inline void rq_clock_cancel_skipupdate(struct rq *rq)
1502 lockdep_assert_rq_held(rq);
1503 rq->clock_update_flags &= ~RQCF_REQ_SKIP;
1507 unsigned long flags;
1508 struct pin_cookie cookie;
1509 #ifdef CONFIG_SCHED_DEBUG
1511 * A copy of (rq::clock_update_flags & RQCF_UPDATED) for the
1512 * current pin context is stashed here in case it needs to be
1513 * restored in rq_repin_lock().
1515 unsigned int clock_update_flags;
1519 extern struct callback_head balance_push_callback;
1522 * Lockdep annotation that avoids accidental unlocks; it's like a
1523 * sticky/continuous lockdep_assert_held().
1525 * This avoids code that has access to 'struct rq *rq' (basically everything in
1526 * the scheduler) from accidentally unlocking the rq if they do not also have a
1527 * copy of the (on-stack) 'struct rq_flags rf'.
1529 * Also see Documentation/locking/lockdep-design.rst.
1531 static inline void rq_pin_lock(struct rq *rq, struct rq_flags *rf)
1533 rf->cookie = lockdep_pin_lock(__rq_lockp(rq));
1535 #ifdef CONFIG_SCHED_DEBUG
1536 rq->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP);
1537 rf->clock_update_flags = 0;
1539 SCHED_WARN_ON(rq->balance_callback && rq->balance_callback != &balance_push_callback);
1544 static inline void rq_unpin_lock(struct rq *rq, struct rq_flags *rf)
1546 #ifdef CONFIG_SCHED_DEBUG
1547 if (rq->clock_update_flags > RQCF_ACT_SKIP)
1548 rf->clock_update_flags = RQCF_UPDATED;
1551 lockdep_unpin_lock(__rq_lockp(rq), rf->cookie);
1554 static inline void rq_repin_lock(struct rq *rq, struct rq_flags *rf)
1556 lockdep_repin_lock(__rq_lockp(rq), rf->cookie);
1558 #ifdef CONFIG_SCHED_DEBUG
1560 * Restore the value we stashed in @rf for this pin context.
1562 rq->clock_update_flags |= rf->clock_update_flags;
1566 struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf)
1567 __acquires(rq->lock);
1569 struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf)
1570 __acquires(p->pi_lock)
1571 __acquires(rq->lock);
1573 static inline void __task_rq_unlock(struct rq *rq, struct rq_flags *rf)
1574 __releases(rq->lock)
1576 rq_unpin_lock(rq, rf);
1577 raw_spin_rq_unlock(rq);
1581 task_rq_unlock(struct rq *rq, struct task_struct *p, struct rq_flags *rf)
1582 __releases(rq->lock)
1583 __releases(p->pi_lock)
1585 rq_unpin_lock(rq, rf);
1586 raw_spin_rq_unlock(rq);
1587 raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags);
1591 rq_lock_irqsave(struct rq *rq, struct rq_flags *rf)
1592 __acquires(rq->lock)
1594 raw_spin_rq_lock_irqsave(rq, rf->flags);
1595 rq_pin_lock(rq, rf);
1599 rq_lock_irq(struct rq *rq, struct rq_flags *rf)
1600 __acquires(rq->lock)
1602 raw_spin_rq_lock_irq(rq);
1603 rq_pin_lock(rq, rf);
1607 rq_lock(struct rq *rq, struct rq_flags *rf)
1608 __acquires(rq->lock)
1610 raw_spin_rq_lock(rq);
1611 rq_pin_lock(rq, rf);
1615 rq_unlock_irqrestore(struct rq *rq, struct rq_flags *rf)
1616 __releases(rq->lock)
1618 rq_unpin_lock(rq, rf);
1619 raw_spin_rq_unlock_irqrestore(rq, rf->flags);
1623 rq_unlock_irq(struct rq *rq, struct rq_flags *rf)
1624 __releases(rq->lock)
1626 rq_unpin_lock(rq, rf);
1627 raw_spin_rq_unlock_irq(rq);
1631 rq_unlock(struct rq *rq, struct rq_flags *rf)
1632 __releases(rq->lock)
1634 rq_unpin_lock(rq, rf);
1635 raw_spin_rq_unlock(rq);
1638 static inline struct rq *
1639 this_rq_lock_irq(struct rq_flags *rf)
1640 __acquires(rq->lock)
1644 local_irq_disable();
1651 enum numa_topology_type {
1656 extern enum numa_topology_type sched_numa_topology_type;
1657 extern int sched_max_numa_distance;
1658 extern bool find_numa_distance(int distance);
1659 extern void sched_init_numa(void);
1660 extern void sched_domains_numa_masks_set(unsigned int cpu);
1661 extern void sched_domains_numa_masks_clear(unsigned int cpu);
1662 extern int sched_numa_find_closest(const struct cpumask *cpus, int cpu);
1664 static inline void sched_init_numa(void) { }
1665 static inline void sched_domains_numa_masks_set(unsigned int cpu) { }
1666 static inline void sched_domains_numa_masks_clear(unsigned int cpu) { }
1667 static inline int sched_numa_find_closest(const struct cpumask *cpus, int cpu)
1673 #ifdef CONFIG_NUMA_BALANCING
1674 /* The regions in numa_faults array from task_struct */
1675 enum numa_faults_stats {
1681 extern void sched_setnuma(struct task_struct *p, int node);
1682 extern int migrate_task_to(struct task_struct *p, int cpu);
1683 extern int migrate_swap(struct task_struct *p, struct task_struct *t,
1685 extern void init_numa_balancing(unsigned long clone_flags, struct task_struct *p);
1688 init_numa_balancing(unsigned long clone_flags, struct task_struct *p)
1691 #endif /* CONFIG_NUMA_BALANCING */
1696 queue_balance_callback(struct rq *rq,
1697 struct callback_head *head,
1698 void (*func)(struct rq *rq))
1700 lockdep_assert_rq_held(rq);
1702 if (unlikely(head->next || rq->balance_callback == &balance_push_callback))
1705 head->func = (void (*)(struct callback_head *))func;
1706 head->next = rq->balance_callback;
1707 rq->balance_callback = head;
1710 #define rcu_dereference_check_sched_domain(p) \
1711 rcu_dereference_check((p), \
1712 lockdep_is_held(&sched_domains_mutex))
1715 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
1716 * See destroy_sched_domains: call_rcu for details.
1718 * The domain tree of any CPU may only be accessed from within
1719 * preempt-disabled sections.
1721 #define for_each_domain(cpu, __sd) \
1722 for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \
1723 __sd; __sd = __sd->parent)
1726 * highest_flag_domain - Return highest sched_domain containing flag.
1727 * @cpu: The CPU whose highest level of sched domain is to
1729 * @flag: The flag to check for the highest sched_domain
1730 * for the given CPU.
1732 * Returns the highest sched_domain of a CPU which contains the given flag.
1734 static inline struct sched_domain *highest_flag_domain(int cpu, int flag)
1736 struct sched_domain *sd, *hsd = NULL;
1738 for_each_domain(cpu, sd) {
1739 if (!(sd->flags & flag))
1747 static inline struct sched_domain *lowest_flag_domain(int cpu, int flag)
1749 struct sched_domain *sd;
1751 for_each_domain(cpu, sd) {
1752 if (sd->flags & flag)
1759 DECLARE_PER_CPU(struct sched_domain __rcu *, sd_llc);
1760 DECLARE_PER_CPU(int, sd_llc_size);
1761 DECLARE_PER_CPU(int, sd_llc_id);
1762 DECLARE_PER_CPU(struct sched_domain_shared __rcu *, sd_llc_shared);
1763 DECLARE_PER_CPU(struct sched_domain __rcu *, sd_numa);
1764 DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_packing);
1765 DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_cpucapacity);
1766 extern struct static_key_false sched_asym_cpucapacity;
1768 struct sched_group_capacity {
1771 * CPU capacity of this group, SCHED_CAPACITY_SCALE being max capacity
1774 unsigned long capacity;
1775 unsigned long min_capacity; /* Min per-CPU capacity in group */
1776 unsigned long max_capacity; /* Max per-CPU capacity in group */
1777 unsigned long next_update;
1778 int imbalance; /* XXX unrelated to capacity but shared group state */
1780 #ifdef CONFIG_SCHED_DEBUG
1784 unsigned long cpumask[]; /* Balance mask */
1787 struct sched_group {
1788 struct sched_group *next; /* Must be a circular list */
1791 unsigned int group_weight;
1792 struct sched_group_capacity *sgc;
1793 int asym_prefer_cpu; /* CPU of highest priority in group */
1797 * The CPUs this group covers.
1799 * NOTE: this field is variable length. (Allocated dynamically
1800 * by attaching extra space to the end of the structure,
1801 * depending on how many CPUs the kernel has booted up with)
1803 unsigned long cpumask[];
1806 static inline struct cpumask *sched_group_span(struct sched_group *sg)
1808 return to_cpumask(sg->cpumask);
1812 * See build_balance_mask().
1814 static inline struct cpumask *group_balance_mask(struct sched_group *sg)
1816 return to_cpumask(sg->sgc->cpumask);
1820 * group_first_cpu - Returns the first CPU in the cpumask of a sched_group.
1821 * @group: The group whose first CPU is to be returned.
1823 static inline unsigned int group_first_cpu(struct sched_group *group)
1825 return cpumask_first(sched_group_span(group));
1828 extern int group_balance_cpu(struct sched_group *sg);
1830 #ifdef CONFIG_SCHED_DEBUG
1831 void update_sched_domain_debugfs(void);
1832 void dirty_sched_domain_sysctl(int cpu);
1834 static inline void update_sched_domain_debugfs(void)
1837 static inline void dirty_sched_domain_sysctl(int cpu)
1842 extern int sched_update_scaling(void);
1844 extern void flush_smp_call_function_from_idle(void);
1846 #else /* !CONFIG_SMP: */
1847 static inline void flush_smp_call_function_from_idle(void) { }
1851 #include "autogroup.h"
1853 #if defined(CONFIG_SCHED_CORE) && defined(CONFIG_SCHEDSTATS)
1855 extern void __sched_core_account_forceidle(struct rq *rq);
1857 static inline void sched_core_account_forceidle(struct rq *rq)
1859 if (schedstat_enabled())
1860 __sched_core_account_forceidle(rq);
1863 extern void __sched_core_tick(struct rq *rq);
1865 static inline void sched_core_tick(struct rq *rq)
1867 if (sched_core_enabled(rq) && schedstat_enabled())
1868 __sched_core_tick(rq);
1873 static inline void sched_core_account_forceidle(struct rq *rq) {}
1875 static inline void sched_core_tick(struct rq *rq) {}
1877 #endif /* CONFIG_SCHED_CORE && CONFIG_SCHEDSTATS */
1879 #ifdef CONFIG_CGROUP_SCHED
1882 * Return the group to which this tasks belongs.
1884 * We cannot use task_css() and friends because the cgroup subsystem
1885 * changes that value before the cgroup_subsys::attach() method is called,
1886 * therefore we cannot pin it and might observe the wrong value.
1888 * The same is true for autogroup's p->signal->autogroup->tg, the autogroup
1889 * core changes this before calling sched_move_task().
1891 * Instead we use a 'copy' which is updated from sched_move_task() while
1892 * holding both task_struct::pi_lock and rq::lock.
1894 static inline struct task_group *task_group(struct task_struct *p)
1896 return p->sched_task_group;
1899 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
1900 static inline void set_task_rq(struct task_struct *p, unsigned int cpu)
1902 #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED)
1903 struct task_group *tg = task_group(p);
1906 #ifdef CONFIG_FAIR_GROUP_SCHED
1907 set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]);
1908 p->se.cfs_rq = tg->cfs_rq[cpu];
1909 p->se.parent = tg->se[cpu];
1912 #ifdef CONFIG_RT_GROUP_SCHED
1913 p->rt.rt_rq = tg->rt_rq[cpu];
1914 p->rt.parent = tg->rt_se[cpu];
1918 #else /* CONFIG_CGROUP_SCHED */
1920 static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { }
1921 static inline struct task_group *task_group(struct task_struct *p)
1926 #endif /* CONFIG_CGROUP_SCHED */
1928 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1930 set_task_rq(p, cpu);
1933 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1934 * successfully executed on another CPU. We must ensure that updates of
1935 * per-task data have been completed by this moment.
1938 WRITE_ONCE(task_thread_info(p)->cpu, cpu);
1944 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
1946 #ifdef CONFIG_SCHED_DEBUG
1947 # include <linux/static_key.h>
1948 # define const_debug __read_mostly
1950 # define const_debug const
1953 #define SCHED_FEAT(name, enabled) \
1954 __SCHED_FEAT_##name ,
1957 #include "features.h"
1963 #ifdef CONFIG_SCHED_DEBUG
1966 * To support run-time toggling of sched features, all the translation units
1967 * (but core.c) reference the sysctl_sched_features defined in core.c.
1969 extern const_debug unsigned int sysctl_sched_features;
1971 #ifdef CONFIG_JUMP_LABEL
1972 #define SCHED_FEAT(name, enabled) \
1973 static __always_inline bool static_branch_##name(struct static_key *key) \
1975 return static_key_##enabled(key); \
1978 #include "features.h"
1981 extern struct static_key sched_feat_keys[__SCHED_FEAT_NR];
1982 #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x]))
1984 #else /* !CONFIG_JUMP_LABEL */
1986 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
1988 #endif /* CONFIG_JUMP_LABEL */
1990 #else /* !SCHED_DEBUG */
1993 * Each translation unit has its own copy of sysctl_sched_features to allow
1994 * constants propagation at compile time and compiler optimization based on
1997 #define SCHED_FEAT(name, enabled) \
1998 (1UL << __SCHED_FEAT_##name) * enabled |
1999 static const_debug __maybe_unused unsigned int sysctl_sched_features =
2000 #include "features.h"
2004 #define sched_feat(x) !!(sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
2006 #endif /* SCHED_DEBUG */
2008 extern struct static_key_false sched_numa_balancing;
2009 extern struct static_key_false sched_schedstats;
2011 static inline u64 global_rt_period(void)
2013 return (u64)sysctl_sched_rt_period * NSEC_PER_USEC;
2016 static inline u64 global_rt_runtime(void)
2018 if (sysctl_sched_rt_runtime < 0)
2021 return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC;
2024 static inline int task_current(struct rq *rq, struct task_struct *p)
2026 return rq->curr == p;
2029 static inline int task_running(struct rq *rq, struct task_struct *p)
2034 return task_current(rq, p);
2038 static inline int task_on_rq_queued(struct task_struct *p)
2040 return p->on_rq == TASK_ON_RQ_QUEUED;
2043 static inline int task_on_rq_migrating(struct task_struct *p)
2045 return READ_ONCE(p->on_rq) == TASK_ON_RQ_MIGRATING;
2048 /* Wake flags. The first three directly map to some SD flag value */
2049 #define WF_EXEC 0x02 /* Wakeup after exec; maps to SD_BALANCE_EXEC */
2050 #define WF_FORK 0x04 /* Wakeup after fork; maps to SD_BALANCE_FORK */
2051 #define WF_TTWU 0x08 /* Wakeup; maps to SD_BALANCE_WAKE */
2053 #define WF_SYNC 0x10 /* Waker goes to sleep after wakeup */
2054 #define WF_MIGRATED 0x20 /* Internal use, task got migrated */
2055 #define WF_ON_CPU 0x40 /* Wakee is on_cpu */
2058 static_assert(WF_EXEC == SD_BALANCE_EXEC);
2059 static_assert(WF_FORK == SD_BALANCE_FORK);
2060 static_assert(WF_TTWU == SD_BALANCE_WAKE);
2064 * To aid in avoiding the subversion of "niceness" due to uneven distribution
2065 * of tasks with abnormal "nice" values across CPUs the contribution that
2066 * each task makes to its run queue's load is weighted according to its
2067 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
2068 * scaled version of the new time slice allocation that they receive on time
2072 #define WEIGHT_IDLEPRIO 3
2073 #define WMULT_IDLEPRIO 1431655765
2075 extern const int sched_prio_to_weight[40];
2076 extern const u32 sched_prio_to_wmult[40];
2079 * {de,en}queue flags:
2081 * DEQUEUE_SLEEP - task is no longer runnable
2082 * ENQUEUE_WAKEUP - task just became runnable
2084 * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks
2085 * are in a known state which allows modification. Such pairs
2086 * should preserve as much state as possible.
2088 * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location
2091 * ENQUEUE_HEAD - place at front of runqueue (tail if not specified)
2092 * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline)
2093 * ENQUEUE_MIGRATED - the task was migrated during wakeup
2097 #define DEQUEUE_SLEEP 0x01
2098 #define DEQUEUE_SAVE 0x02 /* Matches ENQUEUE_RESTORE */
2099 #define DEQUEUE_MOVE 0x04 /* Matches ENQUEUE_MOVE */
2100 #define DEQUEUE_NOCLOCK 0x08 /* Matches ENQUEUE_NOCLOCK */
2102 #define ENQUEUE_WAKEUP 0x01
2103 #define ENQUEUE_RESTORE 0x02
2104 #define ENQUEUE_MOVE 0x04
2105 #define ENQUEUE_NOCLOCK 0x08
2107 #define ENQUEUE_HEAD 0x10
2108 #define ENQUEUE_REPLENISH 0x20
2110 #define ENQUEUE_MIGRATED 0x40
2112 #define ENQUEUE_MIGRATED 0x00
2115 #define RETRY_TASK ((void *)-1UL)
2117 struct sched_class {
2119 #ifdef CONFIG_UCLAMP_TASK
2123 void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags);
2124 void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags);
2125 void (*yield_task) (struct rq *rq);
2126 bool (*yield_to_task)(struct rq *rq, struct task_struct *p);
2128 void (*check_preempt_curr)(struct rq *rq, struct task_struct *p, int flags);
2130 struct task_struct *(*pick_next_task)(struct rq *rq);
2132 void (*put_prev_task)(struct rq *rq, struct task_struct *p);
2133 void (*set_next_task)(struct rq *rq, struct task_struct *p, bool first);
2136 int (*balance)(struct rq *rq, struct task_struct *prev, struct rq_flags *rf);
2137 int (*select_task_rq)(struct task_struct *p, int task_cpu, int flags);
2139 struct task_struct * (*pick_task)(struct rq *rq);
2141 void (*migrate_task_rq)(struct task_struct *p, int new_cpu);
2143 void (*task_woken)(struct rq *this_rq, struct task_struct *task);
2145 void (*set_cpus_allowed)(struct task_struct *p,
2146 const struct cpumask *newmask,
2149 void (*rq_online)(struct rq *rq);
2150 void (*rq_offline)(struct rq *rq);
2152 struct rq *(*find_lock_rq)(struct task_struct *p, struct rq *rq);
2155 void (*task_tick)(struct rq *rq, struct task_struct *p, int queued);
2156 void (*task_fork)(struct task_struct *p);
2157 void (*task_dead)(struct task_struct *p);
2160 * The switched_from() call is allowed to drop rq->lock, therefore we
2161 * cannot assume the switched_from/switched_to pair is serialized by
2162 * rq->lock. They are however serialized by p->pi_lock.
2164 void (*switched_from)(struct rq *this_rq, struct task_struct *task);
2165 void (*switched_to) (struct rq *this_rq, struct task_struct *task);
2166 void (*prio_changed) (struct rq *this_rq, struct task_struct *task,
2169 unsigned int (*get_rr_interval)(struct rq *rq,
2170 struct task_struct *task);
2172 void (*update_curr)(struct rq *rq);
2174 #define TASK_SET_GROUP 0
2175 #define TASK_MOVE_GROUP 1
2177 #ifdef CONFIG_FAIR_GROUP_SCHED
2178 void (*task_change_group)(struct task_struct *p, int type);
2182 static inline void put_prev_task(struct rq *rq, struct task_struct *prev)
2184 WARN_ON_ONCE(rq->curr != prev);
2185 prev->sched_class->put_prev_task(rq, prev);
2188 static inline void set_next_task(struct rq *rq, struct task_struct *next)
2190 next->sched_class->set_next_task(rq, next, false);
2195 * Helper to define a sched_class instance; each one is placed in a separate
2196 * section which is ordered by the linker script:
2198 * include/asm-generic/vmlinux.lds.h
2200 * Also enforce alignment on the instance, not the type, to guarantee layout.
2202 #define DEFINE_SCHED_CLASS(name) \
2203 const struct sched_class name##_sched_class \
2204 __aligned(__alignof__(struct sched_class)) \
2205 __section("__" #name "_sched_class")
2207 /* Defined in include/asm-generic/vmlinux.lds.h */
2208 extern struct sched_class __begin_sched_classes[];
2209 extern struct sched_class __end_sched_classes[];
2211 #define sched_class_highest (__end_sched_classes - 1)
2212 #define sched_class_lowest (__begin_sched_classes - 1)
2214 #define for_class_range(class, _from, _to) \
2215 for (class = (_from); class != (_to); class--)
2217 #define for_each_class(class) \
2218 for_class_range(class, sched_class_highest, sched_class_lowest)
2220 extern const struct sched_class stop_sched_class;
2221 extern const struct sched_class dl_sched_class;
2222 extern const struct sched_class rt_sched_class;
2223 extern const struct sched_class fair_sched_class;
2224 extern const struct sched_class idle_sched_class;
2226 static inline bool sched_stop_runnable(struct rq *rq)
2228 return rq->stop && task_on_rq_queued(rq->stop);
2231 static inline bool sched_dl_runnable(struct rq *rq)
2233 return rq->dl.dl_nr_running > 0;
2236 static inline bool sched_rt_runnable(struct rq *rq)
2238 return rq->rt.rt_queued > 0;
2241 static inline bool sched_fair_runnable(struct rq *rq)
2243 return rq->cfs.nr_running > 0;
2246 extern struct task_struct *pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf);
2247 extern struct task_struct *pick_next_task_idle(struct rq *rq);
2249 #define SCA_CHECK 0x01
2250 #define SCA_MIGRATE_DISABLE 0x02
2251 #define SCA_MIGRATE_ENABLE 0x04
2252 #define SCA_USER 0x08
2256 extern void update_group_capacity(struct sched_domain *sd, int cpu);
2258 extern void trigger_load_balance(struct rq *rq);
2260 extern void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask, u32 flags);
2262 static inline struct task_struct *get_push_task(struct rq *rq)
2264 struct task_struct *p = rq->curr;
2266 lockdep_assert_rq_held(rq);
2271 if (p->nr_cpus_allowed == 1)
2274 if (p->migration_disabled)
2277 rq->push_busy = true;
2278 return get_task_struct(p);
2281 extern int push_cpu_stop(void *arg);
2285 #ifdef CONFIG_CPU_IDLE
2286 static inline void idle_set_state(struct rq *rq,
2287 struct cpuidle_state *idle_state)
2289 rq->idle_state = idle_state;
2292 static inline struct cpuidle_state *idle_get_state(struct rq *rq)
2294 SCHED_WARN_ON(!rcu_read_lock_held());
2296 return rq->idle_state;
2299 static inline void idle_set_state(struct rq *rq,
2300 struct cpuidle_state *idle_state)
2304 static inline struct cpuidle_state *idle_get_state(struct rq *rq)
2310 extern void schedule_idle(void);
2312 extern void sysrq_sched_debug_show(void);
2313 extern void sched_init_granularity(void);
2314 extern void update_max_interval(void);
2316 extern void init_sched_dl_class(void);
2317 extern void init_sched_rt_class(void);
2318 extern void init_sched_fair_class(void);
2320 extern void reweight_task(struct task_struct *p, int prio);
2322 extern void resched_curr(struct rq *rq);
2323 extern void resched_cpu(int cpu);
2325 extern struct rt_bandwidth def_rt_bandwidth;
2326 extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime);
2328 extern struct dl_bandwidth def_dl_bandwidth;
2329 extern void init_dl_bandwidth(struct dl_bandwidth *dl_b, u64 period, u64 runtime);
2330 extern void init_dl_task_timer(struct sched_dl_entity *dl_se);
2331 extern void init_dl_inactive_task_timer(struct sched_dl_entity *dl_se);
2334 #define BW_UNIT (1 << BW_SHIFT)
2335 #define RATIO_SHIFT 8
2336 #define MAX_BW_BITS (64 - BW_SHIFT)
2337 #define MAX_BW ((1ULL << MAX_BW_BITS) - 1)
2338 unsigned long to_ratio(u64 period, u64 runtime);
2340 extern void init_entity_runnable_average(struct sched_entity *se);
2341 extern void post_init_entity_util_avg(struct task_struct *p);
2343 #ifdef CONFIG_NO_HZ_FULL
2344 extern bool sched_can_stop_tick(struct rq *rq);
2345 extern int __init sched_tick_offload_init(void);
2348 * Tick may be needed by tasks in the runqueue depending on their policy and
2349 * requirements. If tick is needed, lets send the target an IPI to kick it out of
2350 * nohz mode if necessary.
2352 static inline void sched_update_tick_dependency(struct rq *rq)
2354 int cpu = cpu_of(rq);
2356 if (!tick_nohz_full_cpu(cpu))
2359 if (sched_can_stop_tick(rq))
2360 tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED);
2362 tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED);
2365 static inline int sched_tick_offload_init(void) { return 0; }
2366 static inline void sched_update_tick_dependency(struct rq *rq) { }
2369 static inline void add_nr_running(struct rq *rq, unsigned count)
2371 unsigned prev_nr = rq->nr_running;
2373 rq->nr_running = prev_nr + count;
2374 if (trace_sched_update_nr_running_tp_enabled()) {
2375 call_trace_sched_update_nr_running(rq, count);
2379 if (prev_nr < 2 && rq->nr_running >= 2) {
2380 if (!READ_ONCE(rq->rd->overload))
2381 WRITE_ONCE(rq->rd->overload, 1);
2385 sched_update_tick_dependency(rq);
2388 static inline void sub_nr_running(struct rq *rq, unsigned count)
2390 rq->nr_running -= count;
2391 if (trace_sched_update_nr_running_tp_enabled()) {
2392 call_trace_sched_update_nr_running(rq, -count);
2395 /* Check if we still need preemption */
2396 sched_update_tick_dependency(rq);
2399 extern void activate_task(struct rq *rq, struct task_struct *p, int flags);
2400 extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags);
2402 extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags);
2404 extern const_debug unsigned int sysctl_sched_nr_migrate;
2405 extern const_debug unsigned int sysctl_sched_migration_cost;
2407 #ifdef CONFIG_SCHED_DEBUG
2408 extern unsigned int sysctl_sched_latency;
2409 extern unsigned int sysctl_sched_min_granularity;
2410 extern unsigned int sysctl_sched_idle_min_granularity;
2411 extern unsigned int sysctl_sched_wakeup_granularity;
2412 extern int sysctl_resched_latency_warn_ms;
2413 extern int sysctl_resched_latency_warn_once;
2415 extern unsigned int sysctl_sched_tunable_scaling;
2417 extern unsigned int sysctl_numa_balancing_scan_delay;
2418 extern unsigned int sysctl_numa_balancing_scan_period_min;
2419 extern unsigned int sysctl_numa_balancing_scan_period_max;
2420 extern unsigned int sysctl_numa_balancing_scan_size;
2423 #ifdef CONFIG_SCHED_HRTICK
2427 * - enabled by features
2428 * - hrtimer is actually high res
2430 static inline int hrtick_enabled(struct rq *rq)
2432 if (!cpu_active(cpu_of(rq)))
2434 return hrtimer_is_hres_active(&rq->hrtick_timer);
2437 static inline int hrtick_enabled_fair(struct rq *rq)
2439 if (!sched_feat(HRTICK))
2441 return hrtick_enabled(rq);
2444 static inline int hrtick_enabled_dl(struct rq *rq)
2446 if (!sched_feat(HRTICK_DL))
2448 return hrtick_enabled(rq);
2451 void hrtick_start(struct rq *rq, u64 delay);
2455 static inline int hrtick_enabled_fair(struct rq *rq)
2460 static inline int hrtick_enabled_dl(struct rq *rq)
2465 static inline int hrtick_enabled(struct rq *rq)
2470 #endif /* CONFIG_SCHED_HRTICK */
2472 #ifndef arch_scale_freq_tick
2473 static __always_inline
2474 void arch_scale_freq_tick(void)
2479 #ifndef arch_scale_freq_capacity
2481 * arch_scale_freq_capacity - get the frequency scale factor of a given CPU.
2482 * @cpu: the CPU in question.
2484 * Return: the frequency scale factor normalized against SCHED_CAPACITY_SCALE, i.e.
2487 * ------ * SCHED_CAPACITY_SCALE
2490 static __always_inline
2491 unsigned long arch_scale_freq_capacity(int cpu)
2493 return SCHED_CAPACITY_SCALE;
2500 static inline bool rq_order_less(struct rq *rq1, struct rq *rq2)
2502 #ifdef CONFIG_SCHED_CORE
2504 * In order to not have {0,2},{1,3} turn into into an AB-BA,
2505 * order by core-id first and cpu-id second.
2509 * double_rq_lock(0,3); will take core-0, core-1 lock
2510 * double_rq_lock(1,2); will take core-1, core-0 lock
2512 * when only cpu-id is considered.
2514 if (rq1->core->cpu < rq2->core->cpu)
2516 if (rq1->core->cpu > rq2->core->cpu)
2520 * __sched_core_flip() relies on SMT having cpu-id lock order.
2523 return rq1->cpu < rq2->cpu;
2526 extern void double_rq_lock(struct rq *rq1, struct rq *rq2);
2528 #ifdef CONFIG_PREEMPTION
2531 * fair double_lock_balance: Safely acquires both rq->locks in a fair
2532 * way at the expense of forcing extra atomic operations in all
2533 * invocations. This assures that the double_lock is acquired using the
2534 * same underlying policy as the spinlock_t on this architecture, which
2535 * reduces latency compared to the unfair variant below. However, it
2536 * also adds more overhead and therefore may reduce throughput.
2538 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
2539 __releases(this_rq->lock)
2540 __acquires(busiest->lock)
2541 __acquires(this_rq->lock)
2543 raw_spin_rq_unlock(this_rq);
2544 double_rq_lock(this_rq, busiest);
2551 * Unfair double_lock_balance: Optimizes throughput at the expense of
2552 * latency by eliminating extra atomic operations when the locks are
2553 * already in proper order on entry. This favors lower CPU-ids and will
2554 * grant the double lock to lower CPUs over higher ids under contention,
2555 * regardless of entry order into the function.
2557 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
2558 __releases(this_rq->lock)
2559 __acquires(busiest->lock)
2560 __acquires(this_rq->lock)
2562 if (__rq_lockp(this_rq) == __rq_lockp(busiest))
2565 if (likely(raw_spin_rq_trylock(busiest)))
2568 if (rq_order_less(this_rq, busiest)) {
2569 raw_spin_rq_lock_nested(busiest, SINGLE_DEPTH_NESTING);
2573 raw_spin_rq_unlock(this_rq);
2574 double_rq_lock(this_rq, busiest);
2579 #endif /* CONFIG_PREEMPTION */
2582 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
2584 static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest)
2586 lockdep_assert_irqs_disabled();
2588 return _double_lock_balance(this_rq, busiest);
2591 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
2592 __releases(busiest->lock)
2594 if (__rq_lockp(this_rq) != __rq_lockp(busiest))
2595 raw_spin_rq_unlock(busiest);
2596 lock_set_subclass(&__rq_lockp(this_rq)->dep_map, 0, _RET_IP_);
2599 static inline void double_lock(spinlock_t *l1, spinlock_t *l2)
2605 spin_lock_nested(l2, SINGLE_DEPTH_NESTING);
2608 static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2)
2614 spin_lock_nested(l2, SINGLE_DEPTH_NESTING);
2617 static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2)
2623 raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING);
2627 * double_rq_unlock - safely unlock two runqueues
2629 * Note this does not restore interrupts like task_rq_unlock,
2630 * you need to do so manually after calling.
2632 static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2)
2633 __releases(rq1->lock)
2634 __releases(rq2->lock)
2636 if (__rq_lockp(rq1) != __rq_lockp(rq2))
2637 raw_spin_rq_unlock(rq2);
2639 __release(rq2->lock);
2640 raw_spin_rq_unlock(rq1);
2643 extern void set_rq_online (struct rq *rq);
2644 extern void set_rq_offline(struct rq *rq);
2645 extern bool sched_smp_initialized;
2647 #else /* CONFIG_SMP */
2650 * double_rq_lock - safely lock two runqueues
2652 * Note this does not disable interrupts like task_rq_lock,
2653 * you need to do so manually before calling.
2655 static inline void double_rq_lock(struct rq *rq1, struct rq *rq2)
2656 __acquires(rq1->lock)
2657 __acquires(rq2->lock)
2659 BUG_ON(!irqs_disabled());
2661 raw_spin_rq_lock(rq1);
2662 __acquire(rq2->lock); /* Fake it out ;) */
2666 * double_rq_unlock - safely unlock two runqueues
2668 * Note this does not restore interrupts like task_rq_unlock,
2669 * you need to do so manually after calling.
2671 static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2)
2672 __releases(rq1->lock)
2673 __releases(rq2->lock)
2676 raw_spin_rq_unlock(rq1);
2677 __release(rq2->lock);
2682 extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq);
2683 extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq);
2685 #ifdef CONFIG_SCHED_DEBUG
2686 extern bool sched_debug_verbose;
2688 extern void print_cfs_stats(struct seq_file *m, int cpu);
2689 extern void print_rt_stats(struct seq_file *m, int cpu);
2690 extern void print_dl_stats(struct seq_file *m, int cpu);
2691 extern void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq);
2692 extern void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq);
2693 extern void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq);
2695 extern void resched_latency_warn(int cpu, u64 latency);
2696 #ifdef CONFIG_NUMA_BALANCING
2698 show_numa_stats(struct task_struct *p, struct seq_file *m);
2700 print_numa_stats(struct seq_file *m, int node, unsigned long tsf,
2701 unsigned long tpf, unsigned long gsf, unsigned long gpf);
2702 #endif /* CONFIG_NUMA_BALANCING */
2704 static inline void resched_latency_warn(int cpu, u64 latency) {}
2705 #endif /* CONFIG_SCHED_DEBUG */
2707 extern void init_cfs_rq(struct cfs_rq *cfs_rq);
2708 extern void init_rt_rq(struct rt_rq *rt_rq);
2709 extern void init_dl_rq(struct dl_rq *dl_rq);
2711 extern void cfs_bandwidth_usage_inc(void);
2712 extern void cfs_bandwidth_usage_dec(void);
2714 #ifdef CONFIG_NO_HZ_COMMON
2715 #define NOHZ_BALANCE_KICK_BIT 0
2716 #define NOHZ_STATS_KICK_BIT 1
2717 #define NOHZ_NEWILB_KICK_BIT 2
2718 #define NOHZ_NEXT_KICK_BIT 3
2720 /* Run rebalance_domains() */
2721 #define NOHZ_BALANCE_KICK BIT(NOHZ_BALANCE_KICK_BIT)
2722 /* Update blocked load */
2723 #define NOHZ_STATS_KICK BIT(NOHZ_STATS_KICK_BIT)
2724 /* Update blocked load when entering idle */
2725 #define NOHZ_NEWILB_KICK BIT(NOHZ_NEWILB_KICK_BIT)
2726 /* Update nohz.next_balance */
2727 #define NOHZ_NEXT_KICK BIT(NOHZ_NEXT_KICK_BIT)
2729 #define NOHZ_KICK_MASK (NOHZ_BALANCE_KICK | NOHZ_STATS_KICK | NOHZ_NEXT_KICK)
2731 #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags)
2733 extern void nohz_balance_exit_idle(struct rq *rq);
2735 static inline void nohz_balance_exit_idle(struct rq *rq) { }
2738 #if defined(CONFIG_SMP) && defined(CONFIG_NO_HZ_COMMON)
2739 extern void nohz_run_idle_balance(int cpu);
2741 static inline void nohz_run_idle_balance(int cpu) { }
2746 void __dl_update(struct dl_bw *dl_b, s64 bw)
2748 struct root_domain *rd = container_of(dl_b, struct root_domain, dl_bw);
2751 RCU_LOCKDEP_WARN(!rcu_read_lock_sched_held(),
2752 "sched RCU must be held");
2753 for_each_cpu_and(i, rd->span, cpu_active_mask) {
2754 struct rq *rq = cpu_rq(i);
2756 rq->dl.extra_bw += bw;
2761 void __dl_update(struct dl_bw *dl_b, s64 bw)
2763 struct dl_rq *dl = container_of(dl_b, struct dl_rq, dl_bw);
2770 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
2775 struct u64_stats_sync sync;
2778 DECLARE_PER_CPU(struct irqtime, cpu_irqtime);
2781 * Returns the irqtime minus the softirq time computed by ksoftirqd.
2782 * Otherwise ksoftirqd's sum_exec_runtime is subtracted its own runtime
2783 * and never move forward.
2785 static inline u64 irq_time_read(int cpu)
2787 struct irqtime *irqtime = &per_cpu(cpu_irqtime, cpu);
2792 seq = __u64_stats_fetch_begin(&irqtime->sync);
2793 total = irqtime->total;
2794 } while (__u64_stats_fetch_retry(&irqtime->sync, seq));
2798 #endif /* CONFIG_IRQ_TIME_ACCOUNTING */
2800 #ifdef CONFIG_CPU_FREQ
2801 DECLARE_PER_CPU(struct update_util_data __rcu *, cpufreq_update_util_data);
2804 * cpufreq_update_util - Take a note about CPU utilization changes.
2805 * @rq: Runqueue to carry out the update for.
2806 * @flags: Update reason flags.
2808 * This function is called by the scheduler on the CPU whose utilization is
2811 * It can only be called from RCU-sched read-side critical sections.
2813 * The way cpufreq is currently arranged requires it to evaluate the CPU
2814 * performance state (frequency/voltage) on a regular basis to prevent it from
2815 * being stuck in a completely inadequate performance level for too long.
2816 * That is not guaranteed to happen if the updates are only triggered from CFS
2817 * and DL, though, because they may not be coming in if only RT tasks are
2818 * active all the time (or there are RT tasks only).
2820 * As a workaround for that issue, this function is called periodically by the
2821 * RT sched class to trigger extra cpufreq updates to prevent it from stalling,
2822 * but that really is a band-aid. Going forward it should be replaced with
2823 * solutions targeted more specifically at RT tasks.
2825 static inline void cpufreq_update_util(struct rq *rq, unsigned int flags)
2827 struct update_util_data *data;
2829 data = rcu_dereference_sched(*per_cpu_ptr(&cpufreq_update_util_data,
2832 data->func(data, rq_clock(rq), flags);
2835 static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) {}
2836 #endif /* CONFIG_CPU_FREQ */
2838 #ifdef arch_scale_freq_capacity
2839 # ifndef arch_scale_freq_invariant
2840 # define arch_scale_freq_invariant() true
2843 # define arch_scale_freq_invariant() false
2847 static inline unsigned long capacity_orig_of(int cpu)
2849 return cpu_rq(cpu)->cpu_capacity_orig;
2853 * enum cpu_util_type - CPU utilization type
2854 * @FREQUENCY_UTIL: Utilization used to select frequency
2855 * @ENERGY_UTIL: Utilization used during energy calculation
2857 * The utilization signals of all scheduling classes (CFS/RT/DL) and IRQ time
2858 * need to be aggregated differently depending on the usage made of them. This
2859 * enum is used within effective_cpu_util() to differentiate the types of
2860 * utilization expected by the callers, and adjust the aggregation accordingly.
2862 enum cpu_util_type {
2867 unsigned long effective_cpu_util(int cpu, unsigned long util_cfs,
2868 unsigned long max, enum cpu_util_type type,
2869 struct task_struct *p);
2871 static inline unsigned long cpu_bw_dl(struct rq *rq)
2873 return (rq->dl.running_bw * SCHED_CAPACITY_SCALE) >> BW_SHIFT;
2876 static inline unsigned long cpu_util_dl(struct rq *rq)
2878 return READ_ONCE(rq->avg_dl.util_avg);
2882 * cpu_util_cfs() - Estimates the amount of CPU capacity used by CFS tasks.
2883 * @cpu: the CPU to get the utilization for.
2885 * The unit of the return value must be the same as the one of CPU capacity
2886 * so that CPU utilization can be compared with CPU capacity.
2888 * CPU utilization is the sum of running time of runnable tasks plus the
2889 * recent utilization of currently non-runnable tasks on that CPU.
2890 * It represents the amount of CPU capacity currently used by CFS tasks in
2891 * the range [0..max CPU capacity] with max CPU capacity being the CPU
2892 * capacity at f_max.
2894 * The estimated CPU utilization is defined as the maximum between CPU
2895 * utilization and sum of the estimated utilization of the currently
2896 * runnable tasks on that CPU. It preserves a utilization "snapshot" of
2897 * previously-executed tasks, which helps better deduce how busy a CPU will
2898 * be when a long-sleeping task wakes up. The contribution to CPU utilization
2899 * of such a task would be significantly decayed at this point of time.
2901 * CPU utilization can be higher than the current CPU capacity
2902 * (f_curr/f_max * max CPU capacity) or even the max CPU capacity because
2903 * of rounding errors as well as task migrations or wakeups of new tasks.
2904 * CPU utilization has to be capped to fit into the [0..max CPU capacity]
2905 * range. Otherwise a group of CPUs (CPU0 util = 121% + CPU1 util = 80%)
2906 * could be seen as over-utilized even though CPU1 has 20% of spare CPU
2907 * capacity. CPU utilization is allowed to overshoot current CPU capacity
2908 * though since this is useful for predicting the CPU capacity required
2909 * after task migrations (scheduler-driven DVFS).
2911 * Return: (Estimated) utilization for the specified CPU.
2913 static inline unsigned long cpu_util_cfs(int cpu)
2915 struct cfs_rq *cfs_rq;
2918 cfs_rq = &cpu_rq(cpu)->cfs;
2919 util = READ_ONCE(cfs_rq->avg.util_avg);
2921 if (sched_feat(UTIL_EST)) {
2922 util = max_t(unsigned long, util,
2923 READ_ONCE(cfs_rq->avg.util_est.enqueued));
2926 return min(util, capacity_orig_of(cpu));
2929 static inline unsigned long cpu_util_rt(struct rq *rq)
2931 return READ_ONCE(rq->avg_rt.util_avg);
2935 #ifdef CONFIG_UCLAMP_TASK
2936 unsigned long uclamp_eff_value(struct task_struct *p, enum uclamp_id clamp_id);
2939 * uclamp_rq_util_with - clamp @util with @rq and @p effective uclamp values.
2940 * @rq: The rq to clamp against. Must not be NULL.
2941 * @util: The util value to clamp.
2942 * @p: The task to clamp against. Can be NULL if you want to clamp
2945 * Clamps the passed @util to the max(@rq, @p) effective uclamp values.
2947 * If sched_uclamp_used static key is disabled, then just return the util
2948 * without any clamping since uclamp aggregation at the rq level in the fast
2949 * path is disabled, rendering this operation a NOP.
2951 * Use uclamp_eff_value() if you don't care about uclamp values at rq level. It
2952 * will return the correct effective uclamp value of the task even if the
2953 * static key is disabled.
2955 static __always_inline
2956 unsigned long uclamp_rq_util_with(struct rq *rq, unsigned long util,
2957 struct task_struct *p)
2959 unsigned long min_util = 0;
2960 unsigned long max_util = 0;
2962 if (!static_branch_likely(&sched_uclamp_used))
2966 min_util = uclamp_eff_value(p, UCLAMP_MIN);
2967 max_util = uclamp_eff_value(p, UCLAMP_MAX);
2970 * Ignore last runnable task's max clamp, as this task will
2971 * reset it. Similarly, no need to read the rq's min clamp.
2973 if (rq->uclamp_flags & UCLAMP_FLAG_IDLE)
2977 min_util = max_t(unsigned long, min_util, READ_ONCE(rq->uclamp[UCLAMP_MIN].value));
2978 max_util = max_t(unsigned long, max_util, READ_ONCE(rq->uclamp[UCLAMP_MAX].value));
2981 * Since CPU's {min,max}_util clamps are MAX aggregated considering
2982 * RUNNABLE tasks with _different_ clamps, we can end up with an
2983 * inversion. Fix it now when the clamps are applied.
2985 if (unlikely(min_util >= max_util))
2988 return clamp(util, min_util, max_util);
2991 /* Is the rq being capped/throttled by uclamp_max? */
2992 static inline bool uclamp_rq_is_capped(struct rq *rq)
2994 unsigned long rq_util;
2995 unsigned long max_util;
2997 if (!static_branch_likely(&sched_uclamp_used))
3000 rq_util = cpu_util_cfs(cpu_of(rq)) + cpu_util_rt(rq);
3001 max_util = READ_ONCE(rq->uclamp[UCLAMP_MAX].value);
3003 return max_util != SCHED_CAPACITY_SCALE && rq_util >= max_util;
3007 * When uclamp is compiled in, the aggregation at rq level is 'turned off'
3008 * by default in the fast path and only gets turned on once userspace performs
3009 * an operation that requires it.
3011 * Returns true if userspace opted-in to use uclamp and aggregation at rq level
3014 static inline bool uclamp_is_used(void)
3016 return static_branch_likely(&sched_uclamp_used);
3018 #else /* CONFIG_UCLAMP_TASK */
3020 unsigned long uclamp_rq_util_with(struct rq *rq, unsigned long util,
3021 struct task_struct *p)
3026 static inline bool uclamp_rq_is_capped(struct rq *rq) { return false; }
3028 static inline bool uclamp_is_used(void)
3032 #endif /* CONFIG_UCLAMP_TASK */
3034 #ifdef CONFIG_HAVE_SCHED_AVG_IRQ
3035 static inline unsigned long cpu_util_irq(struct rq *rq)
3037 return rq->avg_irq.util_avg;
3041 unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max)
3043 util *= (max - irq);
3050 static inline unsigned long cpu_util_irq(struct rq *rq)
3056 unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max)
3062 #if defined(CONFIG_ENERGY_MODEL) && defined(CONFIG_CPU_FREQ_GOV_SCHEDUTIL)
3064 #define perf_domain_span(pd) (to_cpumask(((pd)->em_pd->cpus)))
3066 DECLARE_STATIC_KEY_FALSE(sched_energy_present);
3068 static inline bool sched_energy_enabled(void)
3070 return static_branch_unlikely(&sched_energy_present);
3073 #else /* ! (CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL) */
3075 #define perf_domain_span(pd) NULL
3076 static inline bool sched_energy_enabled(void) { return false; }
3078 #endif /* CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL */
3080 #ifdef CONFIG_MEMBARRIER
3082 * The scheduler provides memory barriers required by membarrier between:
3083 * - prior user-space memory accesses and store to rq->membarrier_state,
3084 * - store to rq->membarrier_state and following user-space memory accesses.
3085 * In the same way it provides those guarantees around store to rq->curr.
3087 static inline void membarrier_switch_mm(struct rq *rq,
3088 struct mm_struct *prev_mm,
3089 struct mm_struct *next_mm)
3091 int membarrier_state;
3093 if (prev_mm == next_mm)
3096 membarrier_state = atomic_read(&next_mm->membarrier_state);
3097 if (READ_ONCE(rq->membarrier_state) == membarrier_state)
3100 WRITE_ONCE(rq->membarrier_state, membarrier_state);
3103 static inline void membarrier_switch_mm(struct rq *rq,
3104 struct mm_struct *prev_mm,
3105 struct mm_struct *next_mm)
3111 static inline bool is_per_cpu_kthread(struct task_struct *p)
3113 if (!(p->flags & PF_KTHREAD))
3116 if (p->nr_cpus_allowed != 1)
3123 extern void swake_up_all_locked(struct swait_queue_head *q);
3124 extern void __prepare_to_swait(struct swait_queue_head *q, struct swait_queue *wait);
3126 #ifdef CONFIG_PREEMPT_DYNAMIC
3127 extern int preempt_dynamic_mode;
3128 extern int sched_dynamic_mode(const char *str);
3129 extern void sched_dynamic_update(int mode);