1b2441318SGreg Kroah-Hartman /* SPDX-License-Identifier: GPL-2.0 */ 297fb7a0aSIngo Molnar /* 397fb7a0aSIngo Molnar * Scheduler internal types and methods: 497fb7a0aSIngo Molnar */ 595458477SIngo Molnar #ifndef _KERNEL_SCHED_SCHED_H 695458477SIngo Molnar #define _KERNEL_SCHED_SCHED_H 7325ea10cSIngo Molnar 8801c1419SIngo Molnar #include <linux/sched/affinity.h> 9dfc3401aSIngo Molnar #include <linux/sched/autogroup.h> 1055687da1SIngo Molnar #include <linux/sched/cpufreq.h> 11325ea10cSIngo Molnar #include <linux/sched/deadline.h> 124ff8f2caSIngo Molnar #include <linux/sched.h> 13325ea10cSIngo Molnar #include <linux/sched/loadavg.h> 14325ea10cSIngo Molnar #include <linux/sched/mm.h> 15801c1419SIngo Molnar #include <linux/sched/rseq_api.h> 16325ea10cSIngo Molnar #include <linux/sched/signal.h> 17321a874aSThomas Gleixner #include <linux/sched/smt.h> 18325ea10cSIngo Molnar #include <linux/sched/stat.h> 19325ea10cSIngo Molnar #include <linux/sched/sysctl.h> 204ff8f2caSIngo Molnar #include <linux/sched/task_flags.h> 2129930025SIngo Molnar #include <linux/sched/task.h> 22325ea10cSIngo Molnar #include <linux/sched/topology.h> 23ef8bd77fSIngo Molnar 244ff8f2caSIngo Molnar #include <linux/atomic.h> 254ff8f2caSIngo Molnar #include <linux/bitmap.h> 264ff8f2caSIngo Molnar #include <linux/bug.h> 274ff8f2caSIngo Molnar #include <linux/capability.h> 284ff8f2caSIngo Molnar #include <linux/cgroup_api.h> 294ff8f2caSIngo Molnar #include <linux/cgroup.h> 30e67198ccSFrederic Weisbecker #include <linux/context_tracking.h> 31325ea10cSIngo Molnar #include <linux/cpufreq.h> 324ff8f2caSIngo Molnar #include <linux/cpumask_api.h> 33325ea10cSIngo Molnar #include <linux/ctype.h> 344ff8f2caSIngo Molnar #include <linux/file.h> 354ff8f2caSIngo Molnar #include <linux/fs_api.h> 364ff8f2caSIngo Molnar #include <linux/hrtimer_api.h> 374ff8f2caSIngo Molnar #include <linux/interrupt.h> 384ff8f2caSIngo Molnar #include <linux/irq_work.h> 394ff8f2caSIngo Molnar #include <linux/jiffies.h> 404ff8f2caSIngo Molnar #include <linux/kref_api.h> 41325ea10cSIngo Molnar #include <linux/kthread.h> 424ff8f2caSIngo Molnar #include <linux/ktime_api.h> 434ff8f2caSIngo Molnar #include <linux/lockdep_api.h> 444ff8f2caSIngo Molnar #include <linux/lockdep.h> 454ff8f2caSIngo Molnar #include <linux/minmax.h> 464ff8f2caSIngo Molnar #include <linux/mm.h> 474ff8f2caSIngo Molnar #include <linux/module.h> 484ff8f2caSIngo Molnar #include <linux/mutex_api.h> 494ff8f2caSIngo Molnar #include <linux/plist.h> 504ff8f2caSIngo Molnar #include <linux/poll.h> 51325ea10cSIngo Molnar #include <linux/proc_fs.h> 52325ea10cSIngo Molnar #include <linux/profile.h> 53eb414681SJohannes Weiner #include <linux/psi.h> 544ff8f2caSIngo Molnar #include <linux/rcupdate.h> 554ff8f2caSIngo Molnar #include <linux/seq_file.h> 564ff8f2caSIngo Molnar #include <linux/seqlock.h> 574ff8f2caSIngo Molnar #include <linux/softirq.h> 584ff8f2caSIngo Molnar #include <linux/spinlock_api.h> 594ff8f2caSIngo Molnar #include <linux/static_key.h> 60391e43daSPeter Zijlstra #include <linux/stop_machine.h> 614ff8f2caSIngo Molnar #include <linux/syscalls_api.h> 62325ea10cSIngo Molnar #include <linux/syscalls.h> 634ff8f2caSIngo Molnar #include <linux/tick.h> 644ff8f2caSIngo Molnar #include <linux/topology.h> 654ff8f2caSIngo Molnar #include <linux/types.h> 664ff8f2caSIngo Molnar #include <linux/u64_stats_sync_api.h> 674ff8f2caSIngo Molnar #include <linux/uaccess.h> 684ff8f2caSIngo Molnar #include <linux/wait_api.h> 694ff8f2caSIngo Molnar #include <linux/wait_bit.h> 704ff8f2caSIngo Molnar #include <linux/workqueue_api.h> 71e8901061SPeter Zijlstra #include <linux/delayacct.h> 72325ea10cSIngo Molnar 734ff8f2caSIngo Molnar #include <trace/events/power.h> 74b9e9c6caSIngo Molnar #include <trace/events/sched.h> 75b9e9c6caSIngo Molnar 764ff8f2caSIngo Molnar #include "../workqueue_internal.h" 774ff8f2caSIngo Molnar 783cd72719SIngo Molnar struct rq; 793cd72719SIngo Molnar struct cfs_rq; 803cd72719SIngo Molnar struct rt_rq; 813cd72719SIngo Molnar struct sched_group; 823cd72719SIngo Molnar struct cpuidle_state; 833cd72719SIngo Molnar 847fce777cSIngo Molnar #ifdef CONFIG_PARAVIRT 857fce777cSIngo Molnar # include <asm/paravirt.h> 864ff8f2caSIngo Molnar # include <asm/paravirt_api_clock.h> 877fce777cSIngo Molnar #endif 887fce777cSIngo Molnar 89fe90f396SMathieu Desnoyers #include <asm/barrier.h> 90fe90f396SMathieu Desnoyers 91391e43daSPeter Zijlstra #include "cpupri.h" 926bfd6d72SJuri Lelli #include "cpudeadline.h" 93391e43daSPeter Zijlstra 949148a3a1SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 959148a3a1SPeter Zijlstra # define SCHED_WARN_ON(x) WARN_ONCE(x, #x) 969148a3a1SPeter Zijlstra #else 976d3aed3dSIngo Molnar # define SCHED_WARN_ON(x) ({ (void)(x), 0; }) 989148a3a1SPeter Zijlstra #endif 999148a3a1SPeter Zijlstra 100da0c1e65SKirill Tkhai /* task_struct::on_rq states: */ 101da0c1e65SKirill Tkhai #define TASK_ON_RQ_QUEUED 1 102cca26e80SKirill Tkhai #define TASK_ON_RQ_MIGRATING 2 103da0c1e65SKirill Tkhai 104391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 105391e43daSPeter Zijlstra 10645ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 10745ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 10845ceebf7SPaul Gortmaker 1093289bdb4SPeter Zijlstra extern void calc_global_load_tick(struct rq *this_rq); 110d60585c5SThomas Gleixner extern long calc_load_fold_active(struct rq *this_rq, long adjust); 1113289bdb4SPeter Zijlstra 1129d246053SPhil Auld extern void call_trace_sched_update_nr_running(struct rq *rq, int count); 113d9ab0e63SZhen Ni 114089768dfSYajun Deng extern int sysctl_sched_rt_period; 115d9ab0e63SZhen Ni extern int sysctl_sched_rt_runtime; 116dafd7a9dSZhen Ni extern int sched_rr_timeslice; 117d9ab0e63SZhen Ni 118391e43daSPeter Zijlstra /* 11977222b0dSQais Yousef * Asymmetric CPU capacity bits 12077222b0dSQais Yousef */ 12177222b0dSQais Yousef struct asym_cap_data { 12277222b0dSQais Yousef struct list_head link; 12377222b0dSQais Yousef struct rcu_head rcu; 12477222b0dSQais Yousef unsigned long capacity; 12577222b0dSQais Yousef unsigned long cpus[]; 12677222b0dSQais Yousef }; 12777222b0dSQais Yousef 12877222b0dSQais Yousef extern struct list_head asym_cap_list; 12977222b0dSQais Yousef 13077222b0dSQais Yousef #define cpu_capacity_span(asym_data) to_cpumask((asym_data)->cpus) 13177222b0dSQais Yousef 13277222b0dSQais Yousef /* 133391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 134391e43daSPeter Zijlstra */ 135127f6bf1SIngo Molnar #define NS_TO_JIFFIES(time) ((unsigned long)(time) / (NSEC_PER_SEC/HZ)) 136391e43daSPeter Zijlstra 137cc1f4b1fSLi Zefan /* 138cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 139cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 140402de7fcSIngo Molnar * low-weight task groups (eg. nice +19 on an autogroup), deeper task-group 141cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 142cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 143cc1f4b1fSLi Zefan * 144cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 14597fb7a0aSIngo Molnar * resolution (i.e. 64-bit). The costs for increasing resolution when 32-bit 14697fb7a0aSIngo Molnar * are pretty high and the returns do not justify the increased costs. 1472159197dSPeter Zijlstra * 14897fb7a0aSIngo Molnar * Really only required when CONFIG_FAIR_GROUP_SCHED=y is also set, but to 14997fb7a0aSIngo Molnar * increase coverage and consistency always enable it on 64-bit platforms. 150cc1f4b1fSLi Zefan */ 1512159197dSPeter Zijlstra #ifdef CONFIG_64BIT 152172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT + SCHED_FIXEDPOINT_SHIFT) 1536ecdd749SYuyang Du # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT) 15426cf5222SMichael Wang # define scale_load_down(w) \ 15526cf5222SMichael Wang ({ \ 15626cf5222SMichael Wang unsigned long __w = (w); \ 157127f6bf1SIngo Molnar \ 15826cf5222SMichael Wang if (__w) \ 15926cf5222SMichael Wang __w = max(2UL, __w >> SCHED_FIXEDPOINT_SHIFT); \ 16026cf5222SMichael Wang __w; \ 16126cf5222SMichael Wang }) 162cc1f4b1fSLi Zefan #else 163172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT) 164cc1f4b1fSLi Zefan # define scale_load(w) (w) 165cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 166cc1f4b1fSLi Zefan #endif 167cc1f4b1fSLi Zefan 1686ecdd749SYuyang Du /* 169172895e6SYuyang Du * Task weight (visible to users) and its load (invisible to users) have 170172895e6SYuyang Du * independent resolution, but they should be well calibrated. We use 171172895e6SYuyang Du * scale_load() and scale_load_down(w) to convert between them. The 172172895e6SYuyang Du * following must be true: 173172895e6SYuyang Du * 1749d061ba6SDietmar Eggemann * scale_load(sched_prio_to_weight[NICE_TO_PRIO(0)-MAX_RT_PRIO]) == NICE_0_LOAD 175172895e6SYuyang Du * 1766ecdd749SYuyang Du */ 177172895e6SYuyang Du #define NICE_0_LOAD (1L << NICE_0_LOAD_SHIFT) 178391e43daSPeter Zijlstra 179391e43daSPeter Zijlstra /* 180332ac17eSDario Faggioli * Single value that decides SCHED_DEADLINE internal math precision. 181332ac17eSDario Faggioli * 10 -> just above 1us 182332ac17eSDario Faggioli * 9 -> just above 0.5us 183332ac17eSDario Faggioli */ 18497fb7a0aSIngo Molnar #define DL_SCALE 10 185332ac17eSDario Faggioli 186332ac17eSDario Faggioli /* 18797fb7a0aSIngo Molnar * Single value that denotes runtime == period, ie unlimited time. 188391e43daSPeter Zijlstra */ 189391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 190391e43daSPeter Zijlstra 19120f9cd2aSHenrik Austad static inline int idle_policy(int policy) 19220f9cd2aSHenrik Austad { 19320f9cd2aSHenrik Austad return policy == SCHED_IDLE; 19420f9cd2aSHenrik Austad } 195127f6bf1SIngo Molnar 1962c8d046dSTejun Heo static inline int normal_policy(int policy) 1972c8d046dSTejun Heo { 198f0e1a064STejun Heo #ifdef CONFIG_SCHED_CLASS_EXT 199f0e1a064STejun Heo if (policy == SCHED_EXT) 200f0e1a064STejun Heo return true; 201f0e1a064STejun Heo #endif 2022c8d046dSTejun Heo return policy == SCHED_NORMAL; 2032c8d046dSTejun Heo } 2042c8d046dSTejun Heo 205d50dde5aSDario Faggioli static inline int fair_policy(int policy) 206d50dde5aSDario Faggioli { 2072c8d046dSTejun Heo return normal_policy(policy) || policy == SCHED_BATCH; 208d50dde5aSDario Faggioli } 209d50dde5aSDario Faggioli 210391e43daSPeter Zijlstra static inline int rt_policy(int policy) 211391e43daSPeter Zijlstra { 212d50dde5aSDario Faggioli return policy == SCHED_FIFO || policy == SCHED_RR; 213391e43daSPeter Zijlstra } 214391e43daSPeter Zijlstra 215aab03e05SDario Faggioli static inline int dl_policy(int policy) 216aab03e05SDario Faggioli { 217aab03e05SDario Faggioli return policy == SCHED_DEADLINE; 218aab03e05SDario Faggioli } 219127f6bf1SIngo Molnar 22020f9cd2aSHenrik Austad static inline bool valid_policy(int policy) 22120f9cd2aSHenrik Austad { 22220f9cd2aSHenrik Austad return idle_policy(policy) || fair_policy(policy) || 22320f9cd2aSHenrik Austad rt_policy(policy) || dl_policy(policy); 22420f9cd2aSHenrik Austad } 225aab03e05SDario Faggioli 2261da1843fSViresh Kumar static inline int task_has_idle_policy(struct task_struct *p) 2271da1843fSViresh Kumar { 2281da1843fSViresh Kumar return idle_policy(p->policy); 2291da1843fSViresh Kumar } 2301da1843fSViresh Kumar 231391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 232391e43daSPeter Zijlstra { 233391e43daSPeter Zijlstra return rt_policy(p->policy); 234391e43daSPeter Zijlstra } 235391e43daSPeter Zijlstra 236aab03e05SDario Faggioli static inline int task_has_dl_policy(struct task_struct *p) 237aab03e05SDario Faggioli { 238aab03e05SDario Faggioli return dl_policy(p->policy); 239aab03e05SDario Faggioli } 240aab03e05SDario Faggioli 24107881166SJuri Lelli #define cap_scale(v, s) ((v)*(s) >> SCHED_CAPACITY_SHIFT) 24207881166SJuri Lelli 243d76343c6SValentin Schneider static inline void update_avg(u64 *avg, u64 sample) 244d76343c6SValentin Schneider { 245d76343c6SValentin Schneider s64 diff = sample - *avg; 246127f6bf1SIngo Molnar 247d76343c6SValentin Schneider *avg += diff / 8; 248d76343c6SValentin Schneider } 249d76343c6SValentin Schneider 2502d3d891dSDario Faggioli /* 25139a2a6ebSValentin Schneider * Shifting a value by an exponent greater *or equal* to the size of said value 25239a2a6ebSValentin Schneider * is UB; cap at size-1. 25339a2a6ebSValentin Schneider */ 25439a2a6ebSValentin Schneider #define shr_bound(val, shift) \ 25539a2a6ebSValentin Schneider (val >> min_t(typeof(shift), shift, BITS_PER_TYPE(typeof(val)) - 1)) 25639a2a6ebSValentin Schneider 25739a2a6ebSValentin Schneider /* 2584f9c7ca8STejun Heo * cgroup weight knobs should use the common MIN, DFL and MAX values which are 2594f9c7ca8STejun Heo * 1, 100 and 10000 respectively. While it loses a bit of range on both ends, it 2604f9c7ca8STejun Heo * maps pretty well onto the shares value used by scheduler and the round-trip 2614f9c7ca8STejun Heo * conversions preserve the original value over the entire range. 2624f9c7ca8STejun Heo */ 2634f9c7ca8STejun Heo static inline unsigned long sched_weight_from_cgroup(unsigned long cgrp_weight) 2644f9c7ca8STejun Heo { 2654f9c7ca8STejun Heo return DIV_ROUND_CLOSEST_ULL(cgrp_weight * 1024, CGROUP_WEIGHT_DFL); 2664f9c7ca8STejun Heo } 2674f9c7ca8STejun Heo 2684f9c7ca8STejun Heo static inline unsigned long sched_weight_to_cgroup(unsigned long weight) 2694f9c7ca8STejun Heo { 2704f9c7ca8STejun Heo return clamp_t(unsigned long, 2714f9c7ca8STejun Heo DIV_ROUND_CLOSEST_ULL(weight * CGROUP_WEIGHT_DFL, 1024), 2724f9c7ca8STejun Heo CGROUP_WEIGHT_MIN, CGROUP_WEIGHT_MAX); 2734f9c7ca8STejun Heo } 2744f9c7ca8STejun Heo 2754f9c7ca8STejun Heo /* 276794a56ebSJuri Lelli * !! For sched_setattr_nocheck() (kernel) only !! 277794a56ebSJuri Lelli * 278794a56ebSJuri Lelli * This is actually gross. :( 279794a56ebSJuri Lelli * 280794a56ebSJuri Lelli * It is used to make schedutil kworker(s) higher priority than SCHED_DEADLINE 281794a56ebSJuri Lelli * tasks, but still be able to sleep. We need this on platforms that cannot 282794a56ebSJuri Lelli * atomically change clock frequency. Remove once fast switching will be 283794a56ebSJuri Lelli * available on such platforms. 284794a56ebSJuri Lelli * 285794a56ebSJuri Lelli * SUGOV stands for SchedUtil GOVernor. 286794a56ebSJuri Lelli */ 287794a56ebSJuri Lelli #define SCHED_FLAG_SUGOV 0x10000000 288794a56ebSJuri Lelli 289f9509153SQuentin Perret #define SCHED_DL_FLAGS (SCHED_FLAG_RECLAIM | SCHED_FLAG_DL_OVERRUN | SCHED_FLAG_SUGOV) 290f9509153SQuentin Perret 291904cbab7SMatthew Wilcox (Oracle) static inline bool dl_entity_is_special(const struct sched_dl_entity *dl_se) 292794a56ebSJuri Lelli { 293794a56ebSJuri Lelli #ifdef CONFIG_CPU_FREQ_GOV_SCHEDUTIL 294794a56ebSJuri Lelli return unlikely(dl_se->flags & SCHED_FLAG_SUGOV); 295794a56ebSJuri Lelli #else 296794a56ebSJuri Lelli return false; 297794a56ebSJuri Lelli #endif 298794a56ebSJuri Lelli } 299794a56ebSJuri Lelli 300794a56ebSJuri Lelli /* 3012d3d891dSDario Faggioli * Tells if entity @a should preempt entity @b. 3022d3d891dSDario Faggioli */ 303904cbab7SMatthew Wilcox (Oracle) static inline bool dl_entity_preempt(const struct sched_dl_entity *a, 304904cbab7SMatthew Wilcox (Oracle) const struct sched_dl_entity *b) 3052d3d891dSDario Faggioli { 306794a56ebSJuri Lelli return dl_entity_is_special(a) || 307794a56ebSJuri Lelli dl_time_before(a->deadline, b->deadline); 3082d3d891dSDario Faggioli } 3092d3d891dSDario Faggioli 310391e43daSPeter Zijlstra /* 311391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 312391e43daSPeter Zijlstra */ 313391e43daSPeter Zijlstra struct rt_prio_array { 314391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 315391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 316391e43daSPeter Zijlstra }; 317391e43daSPeter Zijlstra 318391e43daSPeter Zijlstra struct rt_bandwidth { 319391e43daSPeter Zijlstra /* nests inside the rq lock: */ 320391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 321391e43daSPeter Zijlstra ktime_t rt_period; 322391e43daSPeter Zijlstra u64 rt_runtime; 323391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 3244cfafd30SPeter Zijlstra unsigned int rt_period_active; 325391e43daSPeter Zijlstra }; 326a5e7be3bSJuri Lelli 327332ac17eSDario Faggioli static inline int dl_bandwidth_enabled(void) 328332ac17eSDario Faggioli { 3291724813dSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 330332ac17eSDario Faggioli } 331332ac17eSDario Faggioli 332a57415f5SPeng Liu /* 333a57415f5SPeng Liu * To keep the bandwidth of -deadline tasks under control 334a57415f5SPeng Liu * we need some place where: 335a57415f5SPeng Liu * - store the maximum -deadline bandwidth of each cpu; 336a57415f5SPeng Liu * - cache the fraction of bandwidth that is currently allocated in 337a57415f5SPeng Liu * each root domain; 338a57415f5SPeng Liu * 339a57415f5SPeng Liu * This is all done in the data structure below. It is similar to the 340a57415f5SPeng Liu * one used for RT-throttling (rt_bandwidth), with the main difference 341a57415f5SPeng Liu * that, since here we are only interested in admission control, we 342a57415f5SPeng Liu * do not decrease any runtime while the group "executes", neither we 343a57415f5SPeng Liu * need a timer to replenish it. 344a57415f5SPeng Liu * 345a57415f5SPeng Liu * With respect to SMP, bandwidth is given on a per root domain basis, 346a57415f5SPeng Liu * meaning that: 347a57415f5SPeng Liu * - bw (< 100%) is the deadline bandwidth of each CPU; 348a57415f5SPeng Liu * - total_bw is the currently allocated bandwidth in each root domain; 349a57415f5SPeng Liu */ 350332ac17eSDario Faggioli struct dl_bw { 351332ac17eSDario Faggioli raw_spinlock_t lock; 35297fb7a0aSIngo Molnar u64 bw; 35397fb7a0aSIngo Molnar u64 total_bw; 354332ac17eSDario Faggioli }; 355332ac17eSDario Faggioli 356f2cb1360SIngo Molnar extern void init_dl_bw(struct dl_bw *dl_b); 35706a76fe0SNicolas Pitre extern int sched_dl_global_validate(void); 35806a76fe0SNicolas Pitre extern void sched_dl_do_global(void); 35997fb7a0aSIngo Molnar extern int sched_dl_overflow(struct task_struct *p, int policy, const struct sched_attr *attr); 36006a76fe0SNicolas Pitre extern void __setparam_dl(struct task_struct *p, const struct sched_attr *attr); 36106a76fe0SNicolas Pitre extern void __getparam_dl(struct task_struct *p, struct sched_attr *attr); 36206a76fe0SNicolas Pitre extern bool __checkparam_dl(const struct sched_attr *attr); 36306a76fe0SNicolas Pitre extern bool dl_param_changed(struct task_struct *p, const struct sched_attr *attr); 36497fb7a0aSIngo Molnar extern int dl_cpuset_cpumask_can_shrink(const struct cpumask *cur, const struct cpumask *trial); 36585989106SDietmar Eggemann extern int dl_bw_check_overflow(int cpu); 366a110a81cSDaniel Bristot de Oliveira extern s64 dl_scaled_delta_exec(struct rq *rq, struct sched_dl_entity *dl_se, s64 delta_exec); 36763ba8422SPeter Zijlstra /* 36863ba8422SPeter Zijlstra * SCHED_DEADLINE supports servers (nested scheduling) with the following 36963ba8422SPeter Zijlstra * interface: 37063ba8422SPeter Zijlstra * 37163ba8422SPeter Zijlstra * dl_se::rq -- runqueue we belong to. 37263ba8422SPeter Zijlstra * 37363ba8422SPeter Zijlstra * dl_se::server_has_tasks() -- used on bandwidth enforcement; we 'stop' the 37463ba8422SPeter Zijlstra * server when it runs out of tasks to run. 37563ba8422SPeter Zijlstra * 37663ba8422SPeter Zijlstra * dl_se::server_pick() -- nested pick_next_task(); we yield the period if this 37763ba8422SPeter Zijlstra * returns NULL. 37863ba8422SPeter Zijlstra * 37963ba8422SPeter Zijlstra * dl_server_update() -- called from update_curr_common(), propagates runtime 38063ba8422SPeter Zijlstra * to the server. 38163ba8422SPeter Zijlstra * 38263ba8422SPeter Zijlstra * dl_server_start() 38363ba8422SPeter Zijlstra * dl_server_stop() -- start/stop the server when it has (no) tasks. 38463ba8422SPeter Zijlstra * 38563ba8422SPeter Zijlstra * dl_server_init() -- initializes the server. 38663ba8422SPeter Zijlstra */ 38763ba8422SPeter Zijlstra extern void dl_server_update(struct sched_dl_entity *dl_se, s64 delta_exec); 38863ba8422SPeter Zijlstra extern void dl_server_start(struct sched_dl_entity *dl_se); 38963ba8422SPeter Zijlstra extern void dl_server_stop(struct sched_dl_entity *dl_se); 39063ba8422SPeter Zijlstra extern void dl_server_init(struct sched_dl_entity *dl_se, struct rq *rq, 39163ba8422SPeter Zijlstra dl_server_has_tasks_f has_tasks, 392c8a85394SJoel Fernandes (Google) dl_server_pick_f pick_task); 39363ba8422SPeter Zijlstra 394a110a81cSDaniel Bristot de Oliveira extern void dl_server_update_idle_time(struct rq *rq, 395a110a81cSDaniel Bristot de Oliveira struct task_struct *p); 396557a6bfcSPeter Zijlstra extern void fair_server_init(struct rq *rq); 397d741f297SDaniel Bristot de Oliveira extern void __dl_server_attach_root(struct sched_dl_entity *dl_se, struct rq *rq); 398d741f297SDaniel Bristot de Oliveira extern int dl_server_apply_params(struct sched_dl_entity *dl_se, 399d741f297SDaniel Bristot de Oliveira u64 runtime, u64 period, bool init); 40097fb7a0aSIngo Molnar 401bcb1704aSHuaixin Chang #ifdef CONFIG_CGROUP_SCHED 402391e43daSPeter Zijlstra 403391e43daSPeter Zijlstra extern struct list_head task_groups; 404391e43daSPeter Zijlstra 405391e43daSPeter Zijlstra struct cfs_bandwidth { 406391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 407391e43daSPeter Zijlstra raw_spinlock_t lock; 408391e43daSPeter Zijlstra ktime_t period; 409391e43daSPeter Zijlstra u64 quota; 410391e43daSPeter Zijlstra u64 runtime; 411391e43daSPeter Zijlstra u64 burst; 412391e43daSPeter Zijlstra u64 runtime_snap; 413391e43daSPeter Zijlstra s64 hierarchical_quota; 414391e43daSPeter Zijlstra 415391e43daSPeter Zijlstra u8 idle; 416391e43daSPeter Zijlstra u8 period_active; 417391e43daSPeter Zijlstra u8 slack_started; 418391e43daSPeter Zijlstra struct hrtimer period_timer; 419391e43daSPeter Zijlstra struct hrtimer slack_timer; 420391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 421391e43daSPeter Zijlstra 422391e43daSPeter Zijlstra /* Statistics: */ 423391e43daSPeter Zijlstra int nr_periods; 424391e43daSPeter Zijlstra int nr_throttled; 425391e43daSPeter Zijlstra int nr_burst; 426391e43daSPeter Zijlstra u64 throttled_time; 427bcb1704aSHuaixin Chang u64 burst_time; 428391e43daSPeter Zijlstra #endif 429391e43daSPeter Zijlstra }; 430391e43daSPeter Zijlstra 43197fb7a0aSIngo Molnar /* Task group related information */ 432391e43daSPeter Zijlstra struct task_group { 433391e43daSPeter Zijlstra struct cgroup_subsys_state css; 434391e43daSPeter Zijlstra 435*7ebd84d6SYu Liao #ifdef CONFIG_GROUP_SCHED_WEIGHT 436*7ebd84d6SYu Liao /* A positive value indicates that this is a SCHED_IDLE group. */ 437*7ebd84d6SYu Liao int idle; 438*7ebd84d6SYu Liao #endif 439*7ebd84d6SYu Liao 440391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 44197fb7a0aSIngo Molnar /* schedulable entities of this group on each CPU */ 442391e43daSPeter Zijlstra struct sched_entity **se; 44397fb7a0aSIngo Molnar /* runqueue "owned" by this group on each CPU */ 444391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 445391e43daSPeter Zijlstra unsigned long shares; 446fa6bddebSAlex Shi #ifdef CONFIG_SMP 447b0367629SWaiman Long /* 448b0367629SWaiman Long * load_avg can be heavily contended at clock tick time, so put 449402de7fcSIngo Molnar * it in its own cache-line separated from the fields above which 450b0367629SWaiman Long * will also be accessed at each tick. 451b0367629SWaiman Long */ 452b0367629SWaiman Long atomic_long_t load_avg ____cacheline_aligned; 453391e43daSPeter Zijlstra #endif 454fa6bddebSAlex Shi #endif 455391e43daSPeter Zijlstra 456391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 457391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 458391e43daSPeter Zijlstra struct rt_rq **rt_rq; 459391e43daSPeter Zijlstra 460391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 461391e43daSPeter Zijlstra #endif 462391e43daSPeter Zijlstra 46381951366STejun Heo #ifdef CONFIG_EXT_GROUP_SCHED 46481951366STejun Heo u32 scx_flags; /* SCX_TG_* */ 46581951366STejun Heo u32 scx_weight; 46681951366STejun Heo #endif 46781951366STejun Heo 468391e43daSPeter Zijlstra struct rcu_head rcu; 469391e43daSPeter Zijlstra struct list_head list; 470391e43daSPeter Zijlstra 471391e43daSPeter Zijlstra struct task_group *parent; 472391e43daSPeter Zijlstra struct list_head siblings; 473391e43daSPeter Zijlstra struct list_head children; 474391e43daSPeter Zijlstra 475391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 476391e43daSPeter Zijlstra struct autogroup *autogroup; 477391e43daSPeter Zijlstra #endif 478391e43daSPeter Zijlstra 479391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 4802480c093SPatrick Bellasi 4812480c093SPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK_GROUP 4822480c093SPatrick Bellasi /* The two decimal precision [%] value requested from user-space */ 4832480c093SPatrick Bellasi unsigned int uclamp_pct[UCLAMP_CNT]; 4842480c093SPatrick Bellasi /* Clamp values requested for a task group */ 4852480c093SPatrick Bellasi struct uclamp_se uclamp_req[UCLAMP_CNT]; 4860b60ba2dSPatrick Bellasi /* Effective clamp values used for a task group */ 4870b60ba2dSPatrick Bellasi struct uclamp_se uclamp[UCLAMP_CNT]; 4882480c093SPatrick Bellasi #endif 4892480c093SPatrick Bellasi 490391e43daSPeter Zijlstra }; 491391e43daSPeter Zijlstra 492e179e80cSTejun Heo #ifdef CONFIG_GROUP_SCHED_WEIGHT 493391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 494391e43daSPeter Zijlstra 495391e43daSPeter Zijlstra /* 496391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 497391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 498391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 499391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 500391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 501391e43daSPeter Zijlstra * limitation from this.) 502391e43daSPeter Zijlstra */ 503391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 504391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 505391e43daSPeter Zijlstra #endif 506391e43daSPeter Zijlstra 507391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 508391e43daSPeter Zijlstra 509391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 510391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 511391e43daSPeter Zijlstra 512391e43daSPeter Zijlstra /* 513391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 514391e43daSPeter Zijlstra * leaving it for the final time. 515391e43daSPeter Zijlstra * 516391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 517391e43daSPeter Zijlstra */ 518391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 519391e43daSPeter Zijlstra { 520391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 521391e43daSPeter Zijlstra } 522391e43daSPeter Zijlstra 523859dc4ecSTejun Heo static inline struct task_group *css_tg(struct cgroup_subsys_state *css) 524859dc4ecSTejun Heo { 525859dc4ecSTejun Heo return css ? container_of(css, struct task_group, css) : NULL; 526859dc4ecSTejun Heo } 527859dc4ecSTejun Heo 528391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 529391e43daSPeter Zijlstra 530b1c3efe0SArnd Bergmann #ifdef CONFIG_FAIR_GROUP_SCHED 531391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 532391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 5338663e24dSPeter Zijlstra extern void online_fair_sched_group(struct task_group *tg); 5346fe1f348SPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg); 535b1c3efe0SArnd Bergmann #else 536b1c3efe0SArnd Bergmann static inline void free_fair_sched_group(struct task_group *tg) { } 537b1c3efe0SArnd Bergmann static inline int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent) 538b1c3efe0SArnd Bergmann { 539b1c3efe0SArnd Bergmann return 1; 540b1c3efe0SArnd Bergmann } 541b1c3efe0SArnd Bergmann static inline void online_fair_sched_group(struct task_group *tg) { } 542b1c3efe0SArnd Bergmann static inline void unregister_fair_sched_group(struct task_group *tg) { } 543b1c3efe0SArnd Bergmann #endif 544b1c3efe0SArnd Bergmann 545391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 546391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 547391e43daSPeter Zijlstra struct sched_entity *parent); 548c98c1827SPhil Auld extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b, struct cfs_bandwidth *parent); 549391e43daSPeter Zijlstra 550391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 55177a4d1a1SPeter Zijlstra extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 552391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 55388c56cfeSPhil Auld extern bool cfs_task_bw_constrained(struct task_struct *p); 554391e43daSPeter Zijlstra 555391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 556391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 557391e43daSPeter Zijlstra struct sched_rt_entity *parent); 5588887cd99SNicolas Pitre extern int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us); 5598887cd99SNicolas Pitre extern int sched_group_set_rt_period(struct task_group *tg, u64 rt_period_us); 5608887cd99SNicolas Pitre extern long sched_group_rt_runtime(struct task_group *tg); 5618887cd99SNicolas Pitre extern long sched_group_rt_period(struct task_group *tg); 5628887cd99SNicolas Pitre extern int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk); 563391e43daSPeter Zijlstra 56425cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 56525cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 56625cc7da7SLi Zefan struct task_group *parent); 56725cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 568b027789eSMathias Krause extern void sched_release_group(struct task_group *tg); 56925cc7da7SLi Zefan 57025cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 57125cc7da7SLi Zefan 57225cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 57325cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 574ad936d86SByungchul Park 57530400039SJosh Don extern int sched_group_set_idle(struct task_group *tg, long idle); 57630400039SJosh Don 577ad936d86SByungchul Park #ifdef CONFIG_SMP 578ad936d86SByungchul Park extern void set_task_rq_fair(struct sched_entity *se, 579ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next); 580ad936d86SByungchul Park #else /* !CONFIG_SMP */ 581ad936d86SByungchul Park static inline void set_task_rq_fair(struct sched_entity *se, 582ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next) { } 583ad936d86SByungchul Park #endif /* CONFIG_SMP */ 584e179e80cSTejun Heo #else /* !CONFIG_FAIR_GROUP_SCHED */ 585e179e80cSTejun Heo static inline int sched_group_set_shares(struct task_group *tg, unsigned long shares) { return 0; } 586bdeb868cSYu Liao static inline int sched_group_set_idle(struct task_group *tg, long idle) { return 0; } 587ad936d86SByungchul Park #endif /* CONFIG_FAIR_GROUP_SCHED */ 58825cc7da7SLi Zefan 589391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 590391e43daSPeter Zijlstra 591391e43daSPeter Zijlstra struct cfs_bandwidth { }; 592127f6bf1SIngo Molnar 59388c56cfeSPhil Auld static inline bool cfs_task_bw_constrained(struct task_struct *p) { return false; } 594391e43daSPeter Zijlstra 595391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 596391e43daSPeter Zijlstra 59787514b2cSBen Dooks extern void unregister_rt_sched_group(struct task_group *tg); 59887514b2cSBen Dooks extern void free_rt_sched_group(struct task_group *tg); 59987514b2cSBen Dooks extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 60087514b2cSBen Dooks 601d05b4305SVincent Donnefort /* 602d05b4305SVincent Donnefort * u64_u32_load/u64_u32_store 603d05b4305SVincent Donnefort * 604d05b4305SVincent Donnefort * Use a copy of a u64 value to protect against data race. This is only 605d05b4305SVincent Donnefort * applicable for 32-bits architectures. 606d05b4305SVincent Donnefort */ 607d05b4305SVincent Donnefort #ifdef CONFIG_64BIT 608d05b4305SVincent Donnefort # define u64_u32_load_copy(var, copy) var 609d05b4305SVincent Donnefort # define u64_u32_store_copy(var, copy, val) (var = val) 610d05b4305SVincent Donnefort #else 611d05b4305SVincent Donnefort # define u64_u32_load_copy(var, copy) \ 612d05b4305SVincent Donnefort ({ \ 613d05b4305SVincent Donnefort u64 __val, __val_copy; \ 614d05b4305SVincent Donnefort do { \ 615d05b4305SVincent Donnefort __val_copy = copy; \ 616d05b4305SVincent Donnefort /* \ 617d05b4305SVincent Donnefort * paired with u64_u32_store_copy(), ordering access \ 618d05b4305SVincent Donnefort * to var and copy. \ 619d05b4305SVincent Donnefort */ \ 620d05b4305SVincent Donnefort smp_rmb(); \ 621d05b4305SVincent Donnefort __val = var; \ 622d05b4305SVincent Donnefort } while (__val != __val_copy); \ 623d05b4305SVincent Donnefort __val; \ 624d05b4305SVincent Donnefort }) 625d05b4305SVincent Donnefort # define u64_u32_store_copy(var, copy, val) \ 626d05b4305SVincent Donnefort do { \ 627d05b4305SVincent Donnefort typeof(val) __val = (val); \ 628d05b4305SVincent Donnefort var = __val; \ 629d05b4305SVincent Donnefort /* \ 630d05b4305SVincent Donnefort * paired with u64_u32_load_copy(), ordering access to var and \ 631d05b4305SVincent Donnefort * copy. \ 632d05b4305SVincent Donnefort */ \ 633d05b4305SVincent Donnefort smp_wmb(); \ 634d05b4305SVincent Donnefort copy = __val; \ 635d05b4305SVincent Donnefort } while (0) 636d05b4305SVincent Donnefort #endif 637d05b4305SVincent Donnefort # define u64_u32_load(var) u64_u32_load_copy(var, var##_copy) 638d05b4305SVincent Donnefort # define u64_u32_store(var, val) u64_u32_store_copy(var, var##_copy, val) 639d05b4305SVincent Donnefort 640fc283116STejun Heo struct balance_callback { 641fc283116STejun Heo struct balance_callback *next; 642fc283116STejun Heo void (*func)(struct rq *rq); 643fc283116STejun Heo }; 644fc283116STejun Heo 645391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 646391e43daSPeter Zijlstra struct cfs_rq { 647391e43daSPeter Zijlstra struct load_weight load; 64897fb7a0aSIngo Molnar unsigned int nr_running; 64943e9f7f2SViresh Kumar unsigned int h_nr_running; /* SCHED_{NORMAL,BATCH,IDLE} */ 650a480addeSJosh Don unsigned int idle_nr_running; /* SCHED_IDLE */ 65143e9f7f2SViresh Kumar unsigned int idle_h_nr_running; /* SCHED_IDLE */ 652391e43daSPeter Zijlstra 653af4cf404SPeter Zijlstra s64 avg_vruntime; 654af4cf404SPeter Zijlstra u64 avg_load; 655af4cf404SPeter Zijlstra 656391e43daSPeter Zijlstra u64 min_vruntime; 657c6047c2eSJoel Fernandes (Google) #ifdef CONFIG_SCHED_CORE 658c6047c2eSJoel Fernandes (Google) unsigned int forceidle_seq; 659c6047c2eSJoel Fernandes (Google) u64 min_vruntime_fi; 660c6047c2eSJoel Fernandes (Google) #endif 661c6047c2eSJoel Fernandes (Google) 662bfb06889SDavidlohr Bueso struct rb_root_cached tasks_timeline; 663391e43daSPeter Zijlstra 664391e43daSPeter Zijlstra /* 665391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 666391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 667391e43daSPeter Zijlstra */ 66897fb7a0aSIngo Molnar struct sched_entity *curr; 66997fb7a0aSIngo Molnar struct sched_entity *next; 670391e43daSPeter Zijlstra 6712dac754eSPaul Turner #ifdef CONFIG_SMP 6722dac754eSPaul Turner /* 6739d89c257SYuyang Du * CFS load tracking 6742dac754eSPaul Turner */ 6759d89c257SYuyang Du struct sched_avg avg; 6762a2f5d4eSPeter Zijlstra #ifndef CONFIG_64BIT 677d05b4305SVincent Donnefort u64 last_update_time_copy; 6782a2f5d4eSPeter Zijlstra #endif 6792a2f5d4eSPeter Zijlstra struct { 6802a2f5d4eSPeter Zijlstra raw_spinlock_t lock ____cacheline_aligned; 6812a2f5d4eSPeter Zijlstra int nr; 6822a2f5d4eSPeter Zijlstra unsigned long load_avg; 6832a2f5d4eSPeter Zijlstra unsigned long util_avg; 6849f683953SVincent Guittot unsigned long runnable_avg; 6852a2f5d4eSPeter Zijlstra } removed; 686141965c7SAlex Shi 687c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 6881528c661SAaron Lu u64 last_update_tg_load_avg; 6890e2d2aaaSPeter Zijlstra unsigned long tg_load_avg_contrib; 6900e2d2aaaSPeter Zijlstra long propagate; 6910e2d2aaaSPeter Zijlstra long prop_runnable_sum; 6920e2d2aaaSPeter Zijlstra 69382958366SPaul Turner /* 69482958366SPaul Turner * h_load = weight * f(tg) 69582958366SPaul Turner * 69682958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 69782958366SPaul Turner * this group. 69882958366SPaul Turner */ 69982958366SPaul Turner unsigned long h_load; 70068520796SVladimir Davydov u64 last_h_load_update; 70168520796SVladimir Davydov struct sched_entity *h_load_next; 70268520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 70382958366SPaul Turner #endif /* CONFIG_SMP */ 70482958366SPaul Turner 705391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 70697fb7a0aSIngo Molnar struct rq *rq; /* CPU runqueue to which this cfs_rq is attached */ 707391e43daSPeter Zijlstra 708391e43daSPeter Zijlstra /* 709391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 710391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 711391e43daSPeter Zijlstra * (like users, containers etc.) 712391e43daSPeter Zijlstra * 71397fb7a0aSIngo Molnar * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a CPU. 71497fb7a0aSIngo Molnar * This list is used during load balance. 715391e43daSPeter Zijlstra */ 716391e43daSPeter Zijlstra int on_list; 717391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 718391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 719391e43daSPeter Zijlstra 72030400039SJosh Don /* Locally cached copy of our task_group's idle value */ 72130400039SJosh Don int idle; 72230400039SJosh Don 723391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 724391e43daSPeter Zijlstra int runtime_enabled; 725391e43daSPeter Zijlstra s64 runtime_remaining; 726391e43daSPeter Zijlstra 727e2f3e35fSVincent Donnefort u64 throttled_pelt_idle; 728e2f3e35fSVincent Donnefort #ifndef CONFIG_64BIT 729e2f3e35fSVincent Donnefort u64 throttled_pelt_idle_copy; 730e2f3e35fSVincent Donnefort #endif 73197fb7a0aSIngo Molnar u64 throttled_clock; 73264eaf507SChengming Zhou u64 throttled_clock_pelt; 73364eaf507SChengming Zhou u64 throttled_clock_pelt_time; 734677ea015SJosh Don u64 throttled_clock_self; 735677ea015SJosh Don u64 throttled_clock_self_time; 73697fb7a0aSIngo Molnar int throttled; 73797fb7a0aSIngo Molnar int throttle_count; 738391e43daSPeter Zijlstra struct list_head throttled_list; 7398ad075c2SJosh Don struct list_head throttled_csd_list; 740391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 741391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 742391e43daSPeter Zijlstra }; 743391e43daSPeter Zijlstra 744f0e1a064STejun Heo #ifdef CONFIG_SCHED_CLASS_EXT 74581aae789STejun Heo /* scx_rq->flags, protected by the rq lock */ 74681aae789STejun Heo enum scx_rq_flags { 74760c27fb5STejun Heo /* 74860c27fb5STejun Heo * A hotplugged CPU starts scheduling before rq_online_scx(). Track 74960c27fb5STejun Heo * ops.cpu_on/offline() state so that ops.enqueue/dispatch() are called 75060c27fb5STejun Heo * only while the BPF scheduler considers the CPU to be online. 75160c27fb5STejun Heo */ 75260c27fb5STejun Heo SCX_RQ_ONLINE = 1 << 0, 753f47a8189STejun Heo SCX_RQ_CAN_STOP_TICK = 1 << 1, 7548b1451f2STejun Heo SCX_RQ_BAL_KEEP = 1 << 2, /* balance decided to keep current */ 755750a40d8STejun Heo SCX_RQ_BYPASSING = 1 << 3, 756f47a8189STejun Heo 757f47a8189STejun Heo SCX_RQ_IN_WAKEUP = 1 << 16, 758f47a8189STejun Heo SCX_RQ_IN_BALANCE = 1 << 17, 75981aae789STejun Heo }; 76081aae789STejun Heo 761f0e1a064STejun Heo struct scx_rq { 762f0e1a064STejun Heo struct scx_dispatch_q local_dsq; 763f0e1a064STejun Heo struct list_head runnable_list; /* runnable tasks on this rq */ 7645b26f7b9STejun Heo struct list_head ddsp_deferred_locals; /* deferred ddsps from enq */ 765f0e1a064STejun Heo unsigned long ops_qseq; 766f0e1a064STejun Heo u64 extra_enq_flags; /* see move_task_to_local_dsq() */ 767f0e1a064STejun Heo u32 nr_running; 76881aae789STejun Heo u32 flags; 769d86adb4fSTejun Heo u32 cpuperf_target; /* [0, SCHED_CAPACITY_SCALE] */ 770245254f7SDavid Vernet bool cpu_released; 77181aae789STejun Heo cpumask_var_t cpus_to_kick; 77281aae789STejun Heo cpumask_var_t cpus_to_kick_if_idle; 77381aae789STejun Heo cpumask_var_t cpus_to_preempt; 77490e55164SDavid Vernet cpumask_var_t cpus_to_wait; 77590e55164SDavid Vernet unsigned long pnt_seq; 7765b26f7b9STejun Heo struct balance_callback deferred_bal_cb; 7775b26f7b9STejun Heo struct irq_work deferred_irq_work; 77881aae789STejun Heo struct irq_work kick_cpus_irq_work; 779f0e1a064STejun Heo }; 780f0e1a064STejun Heo #endif /* CONFIG_SCHED_CLASS_EXT */ 781f0e1a064STejun Heo 782391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 783391e43daSPeter Zijlstra { 784391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 785391e43daSPeter Zijlstra } 786391e43daSPeter Zijlstra 787b6366f04SSteven Rostedt /* RT IPI pull logic requires IRQ_WORK */ 7884bdced5cSSteven Rostedt (Red Hat) #if defined(CONFIG_IRQ_WORK) && defined(CONFIG_SMP) 789b6366f04SSteven Rostedt # define HAVE_RT_PUSH_IPI 790b6366f04SSteven Rostedt #endif 791b6366f04SSteven Rostedt 792391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 793391e43daSPeter Zijlstra struct rt_rq { 794391e43daSPeter Zijlstra struct rt_prio_array active; 795c82513e5SPeter Zijlstra unsigned int rt_nr_running; 79601d36d0aSFrederic Weisbecker unsigned int rr_nr_running; 797391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 798391e43daSPeter Zijlstra struct { 799391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 800391e43daSPeter Zijlstra #ifdef CONFIG_SMP 801391e43daSPeter Zijlstra int next; /* next highest */ 802391e43daSPeter Zijlstra #endif 803391e43daSPeter Zijlstra } highest_prio; 804391e43daSPeter Zijlstra #endif 805391e43daSPeter Zijlstra #ifdef CONFIG_SMP 8064475cd8bSIngo Molnar bool overloaded; 807391e43daSPeter Zijlstra struct plist_head pushable_tasks; 808371bf427SVincent Guittot 809b6366f04SSteven Rostedt #endif /* CONFIG_SMP */ 810f4ebcbc0SKirill Tkhai int rt_queued; 811f4ebcbc0SKirill Tkhai 8125f6bd380SPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 813391e43daSPeter Zijlstra int rt_throttled; 814391e43daSPeter Zijlstra u64 rt_time; 815391e43daSPeter Zijlstra u64 rt_runtime; 816391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 817391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 818391e43daSPeter Zijlstra 819e6fe3f42SAlexey Dobriyan unsigned int rt_nr_boosted; 820391e43daSPeter Zijlstra 821391e43daSPeter Zijlstra struct rq *rq; 822391e43daSPeter Zijlstra struct task_group *tg; 823391e43daSPeter Zijlstra #endif 824391e43daSPeter Zijlstra }; 825391e43daSPeter Zijlstra 826296b2ffeSVincent Guittot static inline bool rt_rq_is_runnable(struct rt_rq *rt_rq) 827296b2ffeSVincent Guittot { 828296b2ffeSVincent Guittot return rt_rq->rt_queued && rt_rq->rt_nr_running; 829296b2ffeSVincent Guittot } 830296b2ffeSVincent Guittot 831aab03e05SDario Faggioli /* Deadline class' related fields in a runqueue */ 832aab03e05SDario Faggioli struct dl_rq { 833aab03e05SDario Faggioli /* runqueue is an rbtree, ordered by deadline */ 8342161573eSDavidlohr Bueso struct rb_root_cached root; 835aab03e05SDario Faggioli 836e6fe3f42SAlexey Dobriyan unsigned int dl_nr_running; 8371baca4ceSJuri Lelli 8381baca4ceSJuri Lelli #ifdef CONFIG_SMP 8391baca4ceSJuri Lelli /* 8401baca4ceSJuri Lelli * Deadline values of the currently executing and the 8411baca4ceSJuri Lelli * earliest ready task on this rq. Caching these facilitates 842dfcb245eSIngo Molnar * the decision whether or not a ready but not running task 8431baca4ceSJuri Lelli * should migrate somewhere else. 8441baca4ceSJuri Lelli */ 8451baca4ceSJuri Lelli struct { 8461baca4ceSJuri Lelli u64 curr; 8471baca4ceSJuri Lelli u64 next; 8481baca4ceSJuri Lelli } earliest_dl; 8491baca4ceSJuri Lelli 8504475cd8bSIngo Molnar bool overloaded; 8511baca4ceSJuri Lelli 8521baca4ceSJuri Lelli /* 8531baca4ceSJuri Lelli * Tasks on this rq that can be pushed away. They are kept in 8541baca4ceSJuri Lelli * an rb-tree, ordered by tasks' deadlines, with caching 8551baca4ceSJuri Lelli * of the leftmost (earliest deadline) element. 8561baca4ceSJuri Lelli */ 8572161573eSDavidlohr Bueso struct rb_root_cached pushable_dl_tasks_root; 858332ac17eSDario Faggioli #else 859332ac17eSDario Faggioli struct dl_bw dl_bw; 8601baca4ceSJuri Lelli #endif 861e36d8677SLuca Abeni /* 862e36d8677SLuca Abeni * "Active utilization" for this runqueue: increased when a 863e36d8677SLuca Abeni * task wakes up (becomes TASK_RUNNING) and decreased when a 864e36d8677SLuca Abeni * task blocks 865e36d8677SLuca Abeni */ 866e36d8677SLuca Abeni u64 running_bw; 8674da3abceSLuca Abeni 8684da3abceSLuca Abeni /* 8698fd27231SLuca Abeni * Utilization of the tasks "assigned" to this runqueue (including 8708fd27231SLuca Abeni * the tasks that are in runqueue and the tasks that executed on this 8718fd27231SLuca Abeni * CPU and blocked). Increased when a task moves to this runqueue, and 8728fd27231SLuca Abeni * decreased when the task moves away (migrates, changes scheduling 8738fd27231SLuca Abeni * policy, or terminates). 8748fd27231SLuca Abeni * This is needed to compute the "inactive utilization" for the 8758fd27231SLuca Abeni * runqueue (inactive utilization = this_bw - running_bw). 8768fd27231SLuca Abeni */ 8778fd27231SLuca Abeni u64 this_bw; 878daec5798SLuca Abeni u64 extra_bw; 8798fd27231SLuca Abeni 8808fd27231SLuca Abeni /* 8816a9d623aSVineeth Pillai * Maximum available bandwidth for reclaiming by SCHED_FLAG_RECLAIM 8826a9d623aSVineeth Pillai * tasks of this rq. Used in calculation of reclaimable bandwidth(GRUB). 8836a9d623aSVineeth Pillai */ 8846a9d623aSVineeth Pillai u64 max_bw; 8856a9d623aSVineeth Pillai 8866a9d623aSVineeth Pillai /* 8874da3abceSLuca Abeni * Inverse of the fraction of CPU utilization that can be reclaimed 8884da3abceSLuca Abeni * by the GRUB algorithm. 8894da3abceSLuca Abeni */ 8904da3abceSLuca Abeni u64 bw_ratio; 891aab03e05SDario Faggioli }; 892aab03e05SDario Faggioli 893c0796298SVincent Guittot #ifdef CONFIG_FAIR_GROUP_SCHED 894127f6bf1SIngo Molnar 895c0796298SVincent Guittot /* An entity is a task if it doesn't "own" a runqueue */ 896c0796298SVincent Guittot #define entity_is_task(se) (!se->my_q) 8970dacee1bSVincent Guittot 8989f683953SVincent Guittot static inline void se_update_runnable(struct sched_entity *se) 8999f683953SVincent Guittot { 9009f683953SVincent Guittot if (!entity_is_task(se)) 9019f683953SVincent Guittot se->runnable_weight = se->my_q->h_nr_running; 9029f683953SVincent Guittot } 9039f683953SVincent Guittot 9049f683953SVincent Guittot static inline long se_runnable(struct sched_entity *se) 9059f683953SVincent Guittot { 906fc1892beSPeter Zijlstra if (se->sched_delayed) 907fc1892beSPeter Zijlstra return false; 908fc1892beSPeter Zijlstra 9099f683953SVincent Guittot if (entity_is_task(se)) 9109f683953SVincent Guittot return !!se->on_rq; 9119f683953SVincent Guittot else 9129f683953SVincent Guittot return se->runnable_weight; 9139f683953SVincent Guittot } 9149f683953SVincent Guittot 915127f6bf1SIngo Molnar #else /* !CONFIG_FAIR_GROUP_SCHED: */ 916127f6bf1SIngo Molnar 917c0796298SVincent Guittot #define entity_is_task(se) 1 9180dacee1bSVincent Guittot 9199f683953SVincent Guittot static inline void se_update_runnable(struct sched_entity *se) { } 9209f683953SVincent Guittot 9219f683953SVincent Guittot static inline long se_runnable(struct sched_entity *se) 9229f683953SVincent Guittot { 923fc1892beSPeter Zijlstra if (se->sched_delayed) 924fc1892beSPeter Zijlstra return false; 925fc1892beSPeter Zijlstra 9269f683953SVincent Guittot return !!se->on_rq; 9279f683953SVincent Guittot } 928127f6bf1SIngo Molnar 929127f6bf1SIngo Molnar #endif /* !CONFIG_FAIR_GROUP_SCHED */ 930c0796298SVincent Guittot 931391e43daSPeter Zijlstra #ifdef CONFIG_SMP 932c0796298SVincent Guittot /* 933c0796298SVincent Guittot * XXX we want to get rid of these helpers and use the full load resolution. 934c0796298SVincent Guittot */ 935c0796298SVincent Guittot static inline long se_weight(struct sched_entity *se) 936c0796298SVincent Guittot { 937c0796298SVincent Guittot return scale_load_down(se->load.weight); 938c0796298SVincent Guittot } 939c0796298SVincent Guittot 940391e43daSPeter Zijlstra 941afe06efdSTim Chen static inline bool sched_asym_prefer(int a, int b) 942afe06efdSTim Chen { 943afe06efdSTim Chen return arch_asym_cpu_priority(a) > arch_asym_cpu_priority(b); 944afe06efdSTim Chen } 945afe06efdSTim Chen 9466aa140faSQuentin Perret struct perf_domain { 9476aa140faSQuentin Perret struct em_perf_domain *em_pd; 9486aa140faSQuentin Perret struct perf_domain *next; 9496aa140faSQuentin Perret struct rcu_head rcu; 9506aa140faSQuentin Perret }; 9516aa140faSQuentin Perret 952391e43daSPeter Zijlstra /* 953391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 954391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 95597fb7a0aSIngo Molnar * fully partitioning the member CPUs from any other cpuset. Whenever a new 956391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 957391e43daSPeter Zijlstra * object. 958391e43daSPeter Zijlstra * 959391e43daSPeter Zijlstra */ 960391e43daSPeter Zijlstra struct root_domain { 961391e43daSPeter Zijlstra atomic_t refcount; 962391e43daSPeter Zijlstra atomic_t rto_count; 963391e43daSPeter Zijlstra struct rcu_head rcu; 964391e43daSPeter Zijlstra cpumask_var_t span; 965391e43daSPeter Zijlstra cpumask_var_t online; 966391e43daSPeter Zijlstra 967757ffdd7SValentin Schneider /* 968757ffdd7SValentin Schneider * Indicate pullable load on at least one CPU, e.g: 969757ffdd7SValentin Schneider * - More than one runnable task 970757ffdd7SValentin Schneider * - Running task is misfit 971757ffdd7SValentin Schneider */ 9724475cd8bSIngo Molnar bool overloaded; 9734486edd1STim Chen 974402de7fcSIngo Molnar /* Indicate one or more CPUs over-utilized (tipping point) */ 9754475cd8bSIngo Molnar bool overutilized; 9762802bf3cSMorten Rasmussen 977391e43daSPeter Zijlstra /* 9781baca4ceSJuri Lelli * The bit corresponding to a CPU gets set here if such CPU has more 9791baca4ceSJuri Lelli * than one runnable -deadline task (as it is below for RT tasks). 9801baca4ceSJuri Lelli */ 9811baca4ceSJuri Lelli cpumask_var_t dlo_mask; 9821baca4ceSJuri Lelli atomic_t dlo_count; 983332ac17eSDario Faggioli struct dl_bw dl_bw; 9846bfd6d72SJuri Lelli struct cpudl cpudl; 9851baca4ceSJuri Lelli 98626762423SPeng Liu /* 98726762423SPeng Liu * Indicate whether a root_domain's dl_bw has been checked or 98826762423SPeng Liu * updated. It's monotonously increasing value. 98926762423SPeng Liu * 99026762423SPeng Liu * Also, some corner cases, like 'wrap around' is dangerous, but given 99126762423SPeng Liu * that u64 is 'big enough'. So that shouldn't be a concern. 99226762423SPeng Liu */ 99326762423SPeng Liu u64 visit_gen; 99426762423SPeng Liu 9954bdced5cSSteven Rostedt (Red Hat) #ifdef HAVE_RT_PUSH_IPI 9964bdced5cSSteven Rostedt (Red Hat) /* 9974bdced5cSSteven Rostedt (Red Hat) * For IPI pull requests, loop across the rto_mask. 9984bdced5cSSteven Rostedt (Red Hat) */ 9994bdced5cSSteven Rostedt (Red Hat) struct irq_work rto_push_work; 10004bdced5cSSteven Rostedt (Red Hat) raw_spinlock_t rto_lock; 10014bdced5cSSteven Rostedt (Red Hat) /* These are only updated and read within rto_lock */ 10024bdced5cSSteven Rostedt (Red Hat) int rto_loop; 10034bdced5cSSteven Rostedt (Red Hat) int rto_cpu; 10044bdced5cSSteven Rostedt (Red Hat) /* These atomics are updated outside of a lock */ 10054bdced5cSSteven Rostedt (Red Hat) atomic_t rto_loop_next; 10064bdced5cSSteven Rostedt (Red Hat) atomic_t rto_loop_start; 10074bdced5cSSteven Rostedt (Red Hat) #endif 10081baca4ceSJuri Lelli /* 1009391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 1010391e43daSPeter Zijlstra * one runnable RT task. 1011391e43daSPeter Zijlstra */ 1012391e43daSPeter Zijlstra cpumask_var_t rto_mask; 1013391e43daSPeter Zijlstra struct cpupri cpupri; 1014cd92bfd3SDietmar Eggemann 10156aa140faSQuentin Perret /* 10166aa140faSQuentin Perret * NULL-terminated list of performance domains intersecting with the 10176aa140faSQuentin Perret * CPUs of the rd. Protected by RCU. 10186aa140faSQuentin Perret */ 10197ba7319fSJoel Fernandes (Google) struct perf_domain __rcu *pd; 1020391e43daSPeter Zijlstra }; 1021391e43daSPeter Zijlstra 1022f2cb1360SIngo Molnar extern void init_defrootdomain(void); 10238d5dc512SPeter Zijlstra extern int sched_init_domains(const struct cpumask *cpu_map); 1024f2cb1360SIngo Molnar extern void rq_attach_root(struct rq *rq, struct root_domain *rd); 1025364f5665SSteven Rostedt (VMware) extern void sched_get_rd(struct root_domain *rd); 1026364f5665SSteven Rostedt (VMware) extern void sched_put_rd(struct root_domain *rd); 1027391e43daSPeter Zijlstra 102876cc4f91SIngo Molnar static inline int get_rd_overloaded(struct root_domain *rd) 1029caac6291SShrikanth Hegde { 1030dfb83ef7SIngo Molnar return READ_ONCE(rd->overloaded); 1031caac6291SShrikanth Hegde } 1032caac6291SShrikanth Hegde 103376cc4f91SIngo Molnar static inline void set_rd_overloaded(struct root_domain *rd, int status) 1034caac6291SShrikanth Hegde { 103576cc4f91SIngo Molnar if (get_rd_overloaded(rd) != status) 1036dfb83ef7SIngo Molnar WRITE_ONCE(rd->overloaded, status); 1037caac6291SShrikanth Hegde } 1038caac6291SShrikanth Hegde 10394bdced5cSSteven Rostedt (Red Hat) #ifdef HAVE_RT_PUSH_IPI 10404bdced5cSSteven Rostedt (Red Hat) extern void rto_push_irq_work_func(struct irq_work *work); 10414bdced5cSSteven Rostedt (Red Hat) #endif 1042391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 1043391e43daSPeter Zijlstra 104469842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 104569842cbaSPatrick Bellasi /* 104669842cbaSPatrick Bellasi * struct uclamp_bucket - Utilization clamp bucket 104769842cbaSPatrick Bellasi * @value: utilization clamp value for tasks on this clamp bucket 104869842cbaSPatrick Bellasi * @tasks: number of RUNNABLE tasks on this clamp bucket 104969842cbaSPatrick Bellasi * 105069842cbaSPatrick Bellasi * Keep track of how many tasks are RUNNABLE for a given utilization 105169842cbaSPatrick Bellasi * clamp value. 105269842cbaSPatrick Bellasi */ 105369842cbaSPatrick Bellasi struct uclamp_bucket { 105469842cbaSPatrick Bellasi unsigned long value : bits_per(SCHED_CAPACITY_SCALE); 105569842cbaSPatrick Bellasi unsigned long tasks : BITS_PER_LONG - bits_per(SCHED_CAPACITY_SCALE); 105669842cbaSPatrick Bellasi }; 105769842cbaSPatrick Bellasi 105869842cbaSPatrick Bellasi /* 105969842cbaSPatrick Bellasi * struct uclamp_rq - rq's utilization clamp 106069842cbaSPatrick Bellasi * @value: currently active clamp values for a rq 106169842cbaSPatrick Bellasi * @bucket: utilization clamp buckets affecting a rq 106269842cbaSPatrick Bellasi * 106369842cbaSPatrick Bellasi * Keep track of RUNNABLE tasks on a rq to aggregate their clamp values. 106469842cbaSPatrick Bellasi * A clamp value is affecting a rq when there is at least one task RUNNABLE 106569842cbaSPatrick Bellasi * (or actually running) with that value. 106669842cbaSPatrick Bellasi * 106769842cbaSPatrick Bellasi * There are up to UCLAMP_CNT possible different clamp values, currently there 106869842cbaSPatrick Bellasi * are only two: minimum utilization and maximum utilization. 106969842cbaSPatrick Bellasi * 107069842cbaSPatrick Bellasi * All utilization clamping values are MAX aggregated, since: 107169842cbaSPatrick Bellasi * - for util_min: we want to run the CPU at least at the max of the minimum 107269842cbaSPatrick Bellasi * utilization required by its currently RUNNABLE tasks. 107369842cbaSPatrick Bellasi * - for util_max: we want to allow the CPU to run up to the max of the 107469842cbaSPatrick Bellasi * maximum utilization allowed by its currently RUNNABLE tasks. 107569842cbaSPatrick Bellasi * 107669842cbaSPatrick Bellasi * Since on each system we expect only a limited number of different 107769842cbaSPatrick Bellasi * utilization clamp values (UCLAMP_BUCKETS), use a simple array to track 107869842cbaSPatrick Bellasi * the metrics required to compute all the per-rq utilization clamp values. 107969842cbaSPatrick Bellasi */ 108069842cbaSPatrick Bellasi struct uclamp_rq { 108169842cbaSPatrick Bellasi unsigned int value; 108269842cbaSPatrick Bellasi struct uclamp_bucket bucket[UCLAMP_BUCKETS]; 108369842cbaSPatrick Bellasi }; 108446609ce2SQais Yousef 108546609ce2SQais Yousef DECLARE_STATIC_KEY_FALSE(sched_uclamp_used); 108669842cbaSPatrick Bellasi #endif /* CONFIG_UCLAMP_TASK */ 108769842cbaSPatrick Bellasi 1088391e43daSPeter Zijlstra /* 1089391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 1090391e43daSPeter Zijlstra * 1091391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 1092391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 1093391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 1094391e43daSPeter Zijlstra */ 1095391e43daSPeter Zijlstra struct rq { 1096391e43daSPeter Zijlstra /* runqueue lock: */ 10975cb9eaa3SPeter Zijlstra raw_spinlock_t __lock; 1098391e43daSPeter Zijlstra 1099c82513e5SPeter Zijlstra unsigned int nr_running; 11000ec8aa00SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 11010ec8aa00SPeter Zijlstra unsigned int nr_numa_running; 11020ec8aa00SPeter Zijlstra unsigned int nr_preferred_running; 1103a4739ecaSSrikar Dronamraju unsigned int numa_migrate_on; 11040ec8aa00SPeter Zijlstra #endif 11053451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 11069fd81dd5SFrederic Weisbecker #ifdef CONFIG_SMP 1107e022e0d3SPeter Zijlstra unsigned long last_blocked_load_update_tick; 1108f643ea22SVincent Guittot unsigned int has_blocked_load; 110990b5363aSPeter Zijlstra (Intel) call_single_data_t nohz_csd; 11109fd81dd5SFrederic Weisbecker #endif /* CONFIG_SMP */ 111100357f5eSPeter Zijlstra unsigned int nohz_tick_stopped; 1112a22e47a4SPeter Zijlstra atomic_t nohz_flags; 11139fd81dd5SFrederic Weisbecker #endif /* CONFIG_NO_HZ_COMMON */ 1114dcdedb24SFrederic Weisbecker 1115126c2092SPeter Zijlstra #ifdef CONFIG_SMP 1116126c2092SPeter Zijlstra unsigned int ttwu_pending; 1117126c2092SPeter Zijlstra #endif 1118391e43daSPeter Zijlstra u64 nr_switches; 1119391e43daSPeter Zijlstra 112069842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 112169842cbaSPatrick Bellasi /* Utilization clamp values based on CPU's RUNNABLE tasks */ 112269842cbaSPatrick Bellasi struct uclamp_rq uclamp[UCLAMP_CNT] ____cacheline_aligned; 1123e496187dSPatrick Bellasi unsigned int uclamp_flags; 1124e496187dSPatrick Bellasi #define UCLAMP_FLAG_IDLE 0x01 112569842cbaSPatrick Bellasi #endif 112669842cbaSPatrick Bellasi 1127391e43daSPeter Zijlstra struct cfs_rq cfs; 1128391e43daSPeter Zijlstra struct rt_rq rt; 1129aab03e05SDario Faggioli struct dl_rq dl; 1130f0e1a064STejun Heo #ifdef CONFIG_SCHED_CLASS_EXT 1131f0e1a064STejun Heo struct scx_rq scx; 1132f0e1a064STejun Heo #endif 1133391e43daSPeter Zijlstra 1134557a6bfcSPeter Zijlstra struct sched_dl_entity fair_server; 1135557a6bfcSPeter Zijlstra 1136391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 113797fb7a0aSIngo Molnar /* list of leaf cfs_rq on this CPU: */ 1138391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 11399c2791f9SVincent Guittot struct list_head *tmp_alone_branch; 1140a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 1141a35b6466SPeter Zijlstra 1142391e43daSPeter Zijlstra /* 1143391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 1144391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 1145391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 1146391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 1147391e43daSPeter Zijlstra */ 1148e6fe3f42SAlexey Dobriyan unsigned int nr_uninterruptible; 1149391e43daSPeter Zijlstra 11504104a562SMadhuparna Bhowmik struct task_struct __rcu *curr; 1151bd9bbc96SPeter Zijlstra struct sched_dl_entity *dl_server; 115297fb7a0aSIngo Molnar struct task_struct *idle; 115397fb7a0aSIngo Molnar struct task_struct *stop; 1154391e43daSPeter Zijlstra unsigned long next_balance; 1155391e43daSPeter Zijlstra struct mm_struct *prev_mm; 1156391e43daSPeter Zijlstra 1157cb42c9a3SMatt Fleming unsigned int clock_update_flags; 1158391e43daSPeter Zijlstra u64 clock; 115923127296SVincent Guittot /* Ensure that all clocks are in the same cache line */ 116023127296SVincent Guittot u64 clock_task ____cacheline_aligned; 116123127296SVincent Guittot u64 clock_pelt; 116223127296SVincent Guittot unsigned long lost_idle_time; 1163e2f3e35fSVincent Donnefort u64 clock_pelt_idle; 1164e2f3e35fSVincent Donnefort u64 clock_idle; 1165e2f3e35fSVincent Donnefort #ifndef CONFIG_64BIT 1166e2f3e35fSVincent Donnefort u64 clock_pelt_idle_copy; 1167e2f3e35fSVincent Donnefort u64 clock_idle_copy; 1168e2f3e35fSVincent Donnefort #endif 1169391e43daSPeter Zijlstra 1170391e43daSPeter Zijlstra atomic_t nr_iowait; 1171391e43daSPeter Zijlstra 1172c006fac5SPaul Turner #ifdef CONFIG_SCHED_DEBUG 1173c006fac5SPaul Turner u64 last_seen_need_resched_ns; 1174c006fac5SPaul Turner int ticks_without_resched; 1175c006fac5SPaul Turner #endif 1176c006fac5SPaul Turner 1177227a4aadSMathieu Desnoyers #ifdef CONFIG_MEMBARRIER 1178227a4aadSMathieu Desnoyers int membarrier_state; 1179227a4aadSMathieu Desnoyers #endif 1180227a4aadSMathieu Desnoyers 1181391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1182391e43daSPeter Zijlstra struct root_domain *rd; 1183994aeb7aSJoel Fernandes (Google) struct sched_domain __rcu *sd; 1184391e43daSPeter Zijlstra 1185ced549faSNicolas Pitre unsigned long cpu_capacity; 1186391e43daSPeter Zijlstra 11878e5bad7dSKees Cook struct balance_callback *balance_callback; 1188e3fca9e7SPeter Zijlstra 118919a1f5ecSPeter Zijlstra unsigned char nohz_idle_balance; 1190391e43daSPeter Zijlstra unsigned char idle_balance; 119197fb7a0aSIngo Molnar 11923b1baa64SMorten Rasmussen unsigned long misfit_task_load; 11933b1baa64SMorten Rasmussen 1194391e43daSPeter Zijlstra /* For active balancing */ 1195391e43daSPeter Zijlstra int active_balance; 1196391e43daSPeter Zijlstra int push_cpu; 1197391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 119897fb7a0aSIngo Molnar 119997fb7a0aSIngo Molnar /* CPU of this runqueue: */ 1200391e43daSPeter Zijlstra int cpu; 1201391e43daSPeter Zijlstra int online; 1202391e43daSPeter Zijlstra 1203367456c7SPeter Zijlstra struct list_head cfs_tasks; 1204367456c7SPeter Zijlstra 1205371bf427SVincent Guittot struct sched_avg avg_rt; 12063727e0e1SVincent Guittot struct sched_avg avg_dl; 120711d4afd4SVincent Guittot #ifdef CONFIG_HAVE_SCHED_AVG_IRQ 120891c27493SVincent Guittot struct sched_avg avg_irq; 120991c27493SVincent Guittot #endif 1210d4dbc991SVincent Guittot #ifdef CONFIG_SCHED_HW_PRESSURE 1211d4dbc991SVincent Guittot struct sched_avg avg_hw; 121276504793SThara Gopinath #endif 1213391e43daSPeter Zijlstra u64 idle_stamp; 1214391e43daSPeter Zijlstra u64 avg_idle; 12159bd721c5SJason Low 12169bd721c5SJason Low /* This is used to determine avg_idle's max value */ 12179bd721c5SJason Low u64 max_idle_balance_cost; 1218f2469a1fSThomas Gleixner 1219f2469a1fSThomas Gleixner #ifdef CONFIG_HOTPLUG_CPU 1220f2469a1fSThomas Gleixner struct rcuwait hotplug_wait; 1221f2469a1fSThomas Gleixner #endif 122290b5363aSPeter Zijlstra (Intel) #endif /* CONFIG_SMP */ 1223391e43daSPeter Zijlstra 1224391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 1225391e43daSPeter Zijlstra u64 prev_irq_time; 1226ddae0ca2SJohn Stultz u64 psi_irq_time; 1227391e43daSPeter Zijlstra #endif 1228391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 1229391e43daSPeter Zijlstra u64 prev_steal_time; 1230391e43daSPeter Zijlstra #endif 1231391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 1232391e43daSPeter Zijlstra u64 prev_steal_time_rq; 1233391e43daSPeter Zijlstra #endif 1234391e43daSPeter Zijlstra 1235391e43daSPeter Zijlstra /* calc_load related fields */ 1236391e43daSPeter Zijlstra unsigned long calc_load_update; 1237391e43daSPeter Zijlstra long calc_load_active; 1238391e43daSPeter Zijlstra 1239391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1240391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1241966a9671SYing Huang call_single_data_t hrtick_csd; 1242391e43daSPeter Zijlstra #endif 1243391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 1244156ec6f4SJuri Lelli ktime_t hrtick_time; 1245391e43daSPeter Zijlstra #endif 1246391e43daSPeter Zijlstra 1247391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 1248391e43daSPeter Zijlstra /* latency stats */ 1249391e43daSPeter Zijlstra struct sched_info rq_sched_info; 1250391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 1251391e43daSPeter Zijlstra 1252391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 1253391e43daSPeter Zijlstra unsigned int yld_count; 1254391e43daSPeter Zijlstra 1255391e43daSPeter Zijlstra /* schedule() stats */ 1256391e43daSPeter Zijlstra unsigned int sched_count; 1257391e43daSPeter Zijlstra unsigned int sched_goidle; 1258391e43daSPeter Zijlstra 1259391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 1260391e43daSPeter Zijlstra unsigned int ttwu_count; 1261391e43daSPeter Zijlstra unsigned int ttwu_local; 1262391e43daSPeter Zijlstra #endif 1263391e43daSPeter Zijlstra 1264442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 1265402de7fcSIngo Molnar /* Must be inspected within a RCU lock section */ 1266442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state; 1267442bf3aaSDaniel Lezcano #endif 12683015ef4bSThomas Gleixner 126974d862b6SThomas Gleixner #ifdef CONFIG_SMP 12703015ef4bSThomas Gleixner unsigned int nr_pinned; 12713015ef4bSThomas Gleixner #endif 1272a7c81556SPeter Zijlstra unsigned int push_busy; 1273a7c81556SPeter Zijlstra struct cpu_stop_work push_work; 12749edeaea1SPeter Zijlstra 12759edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 12769edeaea1SPeter Zijlstra /* per rq */ 12779edeaea1SPeter Zijlstra struct rq *core; 1278539f6512SPeter Zijlstra struct task_struct *core_pick; 1279bd9bbc96SPeter Zijlstra struct sched_dl_entity *core_dl_server; 12809edeaea1SPeter Zijlstra unsigned int core_enabled; 1281539f6512SPeter Zijlstra unsigned int core_sched_seq; 12828a311c74SPeter Zijlstra struct rb_root core_tree; 12838a311c74SPeter Zijlstra 12843c474b32SPeter Zijlstra /* shared state -- careful with sched_core_cpu_deactivate() */ 12858a311c74SPeter Zijlstra unsigned int core_task_seq; 1286539f6512SPeter Zijlstra unsigned int core_pick_seq; 1287539f6512SPeter Zijlstra unsigned long core_cookie; 12884feee7d1SJosh Don unsigned int core_forceidle_count; 1289c6047c2eSJoel Fernandes (Google) unsigned int core_forceidle_seq; 12904feee7d1SJosh Don unsigned int core_forceidle_occupation; 12914feee7d1SJosh Don u64 core_forceidle_start; 12929edeaea1SPeter Zijlstra #endif 1293da019032SWaiman Long 1294da019032SWaiman Long /* Scratch cpumask to be temporarily used under rq_lock */ 1295da019032SWaiman Long cpumask_var_t scratch_mask; 12968ad075c2SJosh Don 12978ad075c2SJosh Don #if defined(CONFIG_CFS_BANDWIDTH) && defined(CONFIG_SMP) 12988ad075c2SJosh Don call_single_data_t cfsb_csd; 12998ad075c2SJosh Don struct list_head cfsb_csd_list; 13008ad075c2SJosh Don #endif 1301391e43daSPeter Zijlstra }; 1302391e43daSPeter Zijlstra 130362478d99SVincent Guittot #ifdef CONFIG_FAIR_GROUP_SCHED 130462478d99SVincent Guittot 130562478d99SVincent Guittot /* CPU runqueue to which this cfs_rq is attached */ 130662478d99SVincent Guittot static inline struct rq *rq_of(struct cfs_rq *cfs_rq) 130762478d99SVincent Guittot { 130862478d99SVincent Guittot return cfs_rq->rq; 130962478d99SVincent Guittot } 131062478d99SVincent Guittot 131162478d99SVincent Guittot #else 131262478d99SVincent Guittot 131362478d99SVincent Guittot static inline struct rq *rq_of(struct cfs_rq *cfs_rq) 131462478d99SVincent Guittot { 131562478d99SVincent Guittot return container_of(cfs_rq, struct rq, cfs); 131662478d99SVincent Guittot } 131762478d99SVincent Guittot #endif 131862478d99SVincent Guittot 1319391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 1320391e43daSPeter Zijlstra { 1321391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1322391e43daSPeter Zijlstra return rq->cpu; 1323391e43daSPeter Zijlstra #else 1324391e43daSPeter Zijlstra return 0; 1325391e43daSPeter Zijlstra #endif 1326391e43daSPeter Zijlstra } 1327391e43daSPeter Zijlstra 1328a7c81556SPeter Zijlstra #define MDF_PUSH 0x01 1329a7c81556SPeter Zijlstra 1330a7c81556SPeter Zijlstra static inline bool is_migration_disabled(struct task_struct *p) 1331a7c81556SPeter Zijlstra { 133274d862b6SThomas Gleixner #ifdef CONFIG_SMP 1333a7c81556SPeter Zijlstra return p->migration_disabled; 1334a7c81556SPeter Zijlstra #else 1335a7c81556SPeter Zijlstra return false; 1336a7c81556SPeter Zijlstra #endif 1337a7c81556SPeter Zijlstra } 13381b568f0aSPeter Zijlstra 1339e705968dSLin Shengwang DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); 1340e705968dSLin Shengwang 1341e705968dSLin Shengwang #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 1342e705968dSLin Shengwang #define this_rq() this_cpu_ptr(&runqueues) 1343e705968dSLin Shengwang #define task_rq(p) cpu_rq(task_cpu(p)) 1344e705968dSLin Shengwang #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 1345e705968dSLin Shengwang #define raw_rq() raw_cpu_ptr(&runqueues) 1346e705968dSLin Shengwang 13479edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 134897886d9dSAubrey Li static inline struct cpumask *sched_group_span(struct sched_group *sg); 13499edeaea1SPeter Zijlstra 13509edeaea1SPeter Zijlstra DECLARE_STATIC_KEY_FALSE(__sched_core_enabled); 13519edeaea1SPeter Zijlstra 13529edeaea1SPeter Zijlstra static inline bool sched_core_enabled(struct rq *rq) 13539edeaea1SPeter Zijlstra { 13549edeaea1SPeter Zijlstra return static_branch_unlikely(&__sched_core_enabled) && rq->core_enabled; 13559edeaea1SPeter Zijlstra } 13569edeaea1SPeter Zijlstra 13579edeaea1SPeter Zijlstra static inline bool sched_core_disabled(void) 13589edeaea1SPeter Zijlstra { 13599edeaea1SPeter Zijlstra return !static_branch_unlikely(&__sched_core_enabled); 13609edeaea1SPeter Zijlstra } 13619edeaea1SPeter Zijlstra 13629ef7e7e3SPeter Zijlstra /* 13639ef7e7e3SPeter Zijlstra * Be careful with this function; not for general use. The return value isn't 13649ef7e7e3SPeter Zijlstra * stable unless you actually hold a relevant rq->__lock. 13659ef7e7e3SPeter Zijlstra */ 13669edeaea1SPeter Zijlstra static inline raw_spinlock_t *rq_lockp(struct rq *rq) 13679edeaea1SPeter Zijlstra { 13689edeaea1SPeter Zijlstra if (sched_core_enabled(rq)) 13699edeaea1SPeter Zijlstra return &rq->core->__lock; 13709edeaea1SPeter Zijlstra 13719edeaea1SPeter Zijlstra return &rq->__lock; 13729edeaea1SPeter Zijlstra } 13739edeaea1SPeter Zijlstra 13749ef7e7e3SPeter Zijlstra static inline raw_spinlock_t *__rq_lockp(struct rq *rq) 13759ef7e7e3SPeter Zijlstra { 13769ef7e7e3SPeter Zijlstra if (rq->core_enabled) 13779ef7e7e3SPeter Zijlstra return &rq->core->__lock; 13789ef7e7e3SPeter Zijlstra 13799ef7e7e3SPeter Zijlstra return &rq->__lock; 13809ef7e7e3SPeter Zijlstra } 13819ef7e7e3SPeter Zijlstra 1382127f6bf1SIngo Molnar extern bool 1383127f6bf1SIngo Molnar cfs_prio_less(const struct task_struct *a, const struct task_struct *b, bool fi); 1384127f6bf1SIngo Molnar 1385127f6bf1SIngo Molnar extern void task_vruntime_update(struct rq *rq, struct task_struct *p, bool in_fi); 1386c6047c2eSJoel Fernandes (Google) 138797886d9dSAubrey Li /* 138897886d9dSAubrey Li * Helpers to check if the CPU's core cookie matches with the task's cookie 138997886d9dSAubrey Li * when core scheduling is enabled. 139097886d9dSAubrey Li * A special case is that the task's cookie always matches with CPU's core 139197886d9dSAubrey Li * cookie if the CPU is in an idle core. 139297886d9dSAubrey Li */ 139397886d9dSAubrey Li static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p) 139497886d9dSAubrey Li { 139597886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 139697886d9dSAubrey Li if (!sched_core_enabled(rq)) 139797886d9dSAubrey Li return true; 139897886d9dSAubrey Li 139997886d9dSAubrey Li return rq->core->core_cookie == p->core_cookie; 140097886d9dSAubrey Li } 140197886d9dSAubrey Li 140297886d9dSAubrey Li static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p) 140397886d9dSAubrey Li { 140497886d9dSAubrey Li bool idle_core = true; 140597886d9dSAubrey Li int cpu; 140697886d9dSAubrey Li 140797886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 140897886d9dSAubrey Li if (!sched_core_enabled(rq)) 140997886d9dSAubrey Li return true; 141097886d9dSAubrey Li 141197886d9dSAubrey Li for_each_cpu(cpu, cpu_smt_mask(cpu_of(rq))) { 141297886d9dSAubrey Li if (!available_idle_cpu(cpu)) { 141397886d9dSAubrey Li idle_core = false; 141497886d9dSAubrey Li break; 141597886d9dSAubrey Li } 141697886d9dSAubrey Li } 141797886d9dSAubrey Li 141897886d9dSAubrey Li /* 141997886d9dSAubrey Li * A CPU in an idle core is always the best choice for tasks with 142097886d9dSAubrey Li * cookies. 142197886d9dSAubrey Li */ 142297886d9dSAubrey Li return idle_core || rq->core->core_cookie == p->core_cookie; 142397886d9dSAubrey Li } 142497886d9dSAubrey Li 142597886d9dSAubrey Li static inline bool sched_group_cookie_match(struct rq *rq, 142697886d9dSAubrey Li struct task_struct *p, 142797886d9dSAubrey Li struct sched_group *group) 142897886d9dSAubrey Li { 142997886d9dSAubrey Li int cpu; 143097886d9dSAubrey Li 143197886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 143297886d9dSAubrey Li if (!sched_core_enabled(rq)) 143397886d9dSAubrey Li return true; 143497886d9dSAubrey Li 143597886d9dSAubrey Li for_each_cpu_and(cpu, sched_group_span(group), p->cpus_ptr) { 1436e705968dSLin Shengwang if (sched_core_cookie_match(cpu_rq(cpu), p)) 143797886d9dSAubrey Li return true; 143897886d9dSAubrey Li } 143997886d9dSAubrey Li return false; 144097886d9dSAubrey Li } 144197886d9dSAubrey Li 14426e33cad0SPeter Zijlstra static inline bool sched_core_enqueued(struct task_struct *p) 14436e33cad0SPeter Zijlstra { 14446e33cad0SPeter Zijlstra return !RB_EMPTY_NODE(&p->core_node); 14456e33cad0SPeter Zijlstra } 14466e33cad0SPeter Zijlstra 14476e33cad0SPeter Zijlstra extern void sched_core_enqueue(struct rq *rq, struct task_struct *p); 14484feee7d1SJosh Don extern void sched_core_dequeue(struct rq *rq, struct task_struct *p, int flags); 14496e33cad0SPeter Zijlstra 14506e33cad0SPeter Zijlstra extern void sched_core_get(void); 14516e33cad0SPeter Zijlstra extern void sched_core_put(void); 14526e33cad0SPeter Zijlstra 1453127f6bf1SIngo Molnar #else /* !CONFIG_SCHED_CORE: */ 14549edeaea1SPeter Zijlstra 14559edeaea1SPeter Zijlstra static inline bool sched_core_enabled(struct rq *rq) 14569edeaea1SPeter Zijlstra { 14579edeaea1SPeter Zijlstra return false; 14589edeaea1SPeter Zijlstra } 14599edeaea1SPeter Zijlstra 1460d66f1b06SPeter Zijlstra static inline bool sched_core_disabled(void) 1461d66f1b06SPeter Zijlstra { 1462d66f1b06SPeter Zijlstra return true; 1463d66f1b06SPeter Zijlstra } 1464d66f1b06SPeter Zijlstra 146539d371b7SPeter Zijlstra static inline raw_spinlock_t *rq_lockp(struct rq *rq) 146639d371b7SPeter Zijlstra { 14675cb9eaa3SPeter Zijlstra return &rq->__lock; 146839d371b7SPeter Zijlstra } 146939d371b7SPeter Zijlstra 14709ef7e7e3SPeter Zijlstra static inline raw_spinlock_t *__rq_lockp(struct rq *rq) 14719ef7e7e3SPeter Zijlstra { 14729ef7e7e3SPeter Zijlstra return &rq->__lock; 14739ef7e7e3SPeter Zijlstra } 14749ef7e7e3SPeter Zijlstra 147597886d9dSAubrey Li static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p) 147697886d9dSAubrey Li { 147797886d9dSAubrey Li return true; 147897886d9dSAubrey Li } 147997886d9dSAubrey Li 148097886d9dSAubrey Li static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p) 148197886d9dSAubrey Li { 148297886d9dSAubrey Li return true; 148397886d9dSAubrey Li } 148497886d9dSAubrey Li 148597886d9dSAubrey Li static inline bool sched_group_cookie_match(struct rq *rq, 148697886d9dSAubrey Li struct task_struct *p, 148797886d9dSAubrey Li struct sched_group *group) 148897886d9dSAubrey Li { 148997886d9dSAubrey Li return true; 149097886d9dSAubrey Li } 1491127f6bf1SIngo Molnar 1492127f6bf1SIngo Molnar #endif /* !CONFIG_SCHED_CORE */ 14939edeaea1SPeter Zijlstra 149439d371b7SPeter Zijlstra static inline void lockdep_assert_rq_held(struct rq *rq) 149539d371b7SPeter Zijlstra { 14969ef7e7e3SPeter Zijlstra lockdep_assert_held(__rq_lockp(rq)); 149739d371b7SPeter Zijlstra } 149839d371b7SPeter Zijlstra 149939d371b7SPeter Zijlstra extern void raw_spin_rq_lock_nested(struct rq *rq, int subclass); 150039d371b7SPeter Zijlstra extern bool raw_spin_rq_trylock(struct rq *rq); 150139d371b7SPeter Zijlstra extern void raw_spin_rq_unlock(struct rq *rq); 150239d371b7SPeter Zijlstra 150339d371b7SPeter Zijlstra static inline void raw_spin_rq_lock(struct rq *rq) 150439d371b7SPeter Zijlstra { 150539d371b7SPeter Zijlstra raw_spin_rq_lock_nested(rq, 0); 150639d371b7SPeter Zijlstra } 150739d371b7SPeter Zijlstra 150839d371b7SPeter Zijlstra static inline void raw_spin_rq_lock_irq(struct rq *rq) 150939d371b7SPeter Zijlstra { 151039d371b7SPeter Zijlstra local_irq_disable(); 151139d371b7SPeter Zijlstra raw_spin_rq_lock(rq); 151239d371b7SPeter Zijlstra } 151339d371b7SPeter Zijlstra 151439d371b7SPeter Zijlstra static inline void raw_spin_rq_unlock_irq(struct rq *rq) 151539d371b7SPeter Zijlstra { 151639d371b7SPeter Zijlstra raw_spin_rq_unlock(rq); 151739d371b7SPeter Zijlstra local_irq_enable(); 151839d371b7SPeter Zijlstra } 151939d371b7SPeter Zijlstra 152039d371b7SPeter Zijlstra static inline unsigned long _raw_spin_rq_lock_irqsave(struct rq *rq) 152139d371b7SPeter Zijlstra { 152239d371b7SPeter Zijlstra unsigned long flags; 1523127f6bf1SIngo Molnar 152439d371b7SPeter Zijlstra local_irq_save(flags); 152539d371b7SPeter Zijlstra raw_spin_rq_lock(rq); 1526127f6bf1SIngo Molnar 152739d371b7SPeter Zijlstra return flags; 152839d371b7SPeter Zijlstra } 152939d371b7SPeter Zijlstra 153039d371b7SPeter Zijlstra static inline void raw_spin_rq_unlock_irqrestore(struct rq *rq, unsigned long flags) 153139d371b7SPeter Zijlstra { 153239d371b7SPeter Zijlstra raw_spin_rq_unlock(rq); 153339d371b7SPeter Zijlstra local_irq_restore(flags); 153439d371b7SPeter Zijlstra } 153539d371b7SPeter Zijlstra 153639d371b7SPeter Zijlstra #define raw_spin_rq_lock_irqsave(rq, flags) \ 153739d371b7SPeter Zijlstra do { \ 153839d371b7SPeter Zijlstra flags = _raw_spin_rq_lock_irqsave(rq); \ 153939d371b7SPeter Zijlstra } while (0) 154039d371b7SPeter Zijlstra 15411b568f0aSPeter Zijlstra #ifdef CONFIG_SCHED_SMT 15421b568f0aSPeter Zijlstra extern void __update_idle_core(struct rq *rq); 15431b568f0aSPeter Zijlstra 15441b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) 15451b568f0aSPeter Zijlstra { 15461b568f0aSPeter Zijlstra if (static_branch_unlikely(&sched_smt_present)) 15471b568f0aSPeter Zijlstra __update_idle_core(rq); 15481b568f0aSPeter Zijlstra } 15491b568f0aSPeter Zijlstra 15501b568f0aSPeter Zijlstra #else 15511b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) { } 15521b568f0aSPeter Zijlstra #endif 15531b568f0aSPeter Zijlstra 15548a311c74SPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 1555127f6bf1SIngo Molnar 15568a311c74SPeter Zijlstra static inline struct task_struct *task_of(struct sched_entity *se) 15578a311c74SPeter Zijlstra { 15588a311c74SPeter Zijlstra SCHED_WARN_ON(!entity_is_task(se)); 15598a311c74SPeter Zijlstra return container_of(se, struct task_struct, se); 15608a311c74SPeter Zijlstra } 15618a311c74SPeter Zijlstra 15628a311c74SPeter Zijlstra static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) 15638a311c74SPeter Zijlstra { 15648a311c74SPeter Zijlstra return p->se.cfs_rq; 15658a311c74SPeter Zijlstra } 15668a311c74SPeter Zijlstra 15678a311c74SPeter Zijlstra /* runqueue on which this entity is (to be) queued */ 1568904cbab7SMatthew Wilcox (Oracle) static inline struct cfs_rq *cfs_rq_of(const struct sched_entity *se) 15698a311c74SPeter Zijlstra { 15708a311c74SPeter Zijlstra return se->cfs_rq; 15718a311c74SPeter Zijlstra } 15728a311c74SPeter Zijlstra 15738a311c74SPeter Zijlstra /* runqueue "owned" by this group */ 15748a311c74SPeter Zijlstra static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) 15758a311c74SPeter Zijlstra { 15768a311c74SPeter Zijlstra return grp->my_q; 15778a311c74SPeter Zijlstra } 15788a311c74SPeter Zijlstra 1579127f6bf1SIngo Molnar #else /* !CONFIG_FAIR_GROUP_SCHED: */ 15808a311c74SPeter Zijlstra 1581904cbab7SMatthew Wilcox (Oracle) #define task_of(_se) container_of(_se, struct task_struct, se) 15828a311c74SPeter Zijlstra 1583904cbab7SMatthew Wilcox (Oracle) static inline struct cfs_rq *task_cfs_rq(const struct task_struct *p) 15848a311c74SPeter Zijlstra { 15858a311c74SPeter Zijlstra return &task_rq(p)->cfs; 15868a311c74SPeter Zijlstra } 15878a311c74SPeter Zijlstra 1588904cbab7SMatthew Wilcox (Oracle) static inline struct cfs_rq *cfs_rq_of(const struct sched_entity *se) 15898a311c74SPeter Zijlstra { 1590904cbab7SMatthew Wilcox (Oracle) const struct task_struct *p = task_of(se); 15918a311c74SPeter Zijlstra struct rq *rq = task_rq(p); 15928a311c74SPeter Zijlstra 15938a311c74SPeter Zijlstra return &rq->cfs; 15948a311c74SPeter Zijlstra } 15958a311c74SPeter Zijlstra 15968a311c74SPeter Zijlstra /* runqueue "owned" by this group */ 15978a311c74SPeter Zijlstra static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) 15988a311c74SPeter Zijlstra { 15998a311c74SPeter Zijlstra return NULL; 16008a311c74SPeter Zijlstra } 1601127f6bf1SIngo Molnar 1602127f6bf1SIngo Molnar #endif /* !CONFIG_FAIR_GROUP_SCHED */ 16038a311c74SPeter Zijlstra 16041f351d7fSJohannes Weiner extern void update_rq_clock(struct rq *rq); 16051f351d7fSJohannes Weiner 1606cb42c9a3SMatt Fleming /* 1607cb42c9a3SMatt Fleming * rq::clock_update_flags bits 1608cb42c9a3SMatt Fleming * 1609cb42c9a3SMatt Fleming * %RQCF_REQ_SKIP - will request skipping of clock update on the next 1610cb42c9a3SMatt Fleming * call to __schedule(). This is an optimisation to avoid 1611cb42c9a3SMatt Fleming * neighbouring rq clock updates. 1612cb42c9a3SMatt Fleming * 1613cb42c9a3SMatt Fleming * %RQCF_ACT_SKIP - is set from inside of __schedule() when skipping is 1614cb42c9a3SMatt Fleming * in effect and calls to update_rq_clock() are being ignored. 1615cb42c9a3SMatt Fleming * 1616cb42c9a3SMatt Fleming * %RQCF_UPDATED - is a debug flag that indicates whether a call has been 1617cb42c9a3SMatt Fleming * made to update_rq_clock() since the last time rq::lock was pinned. 1618cb42c9a3SMatt Fleming * 1619cb42c9a3SMatt Fleming * If inside of __schedule(), clock_update_flags will have been 1620cb42c9a3SMatt Fleming * shifted left (a left shift is a cheap operation for the fast path 1621cb42c9a3SMatt Fleming * to promote %RQCF_REQ_SKIP to %RQCF_ACT_SKIP), so you must use, 1622cb42c9a3SMatt Fleming * 1623cb42c9a3SMatt Fleming * if (rq-clock_update_flags >= RQCF_UPDATED) 1624cb42c9a3SMatt Fleming * 16253b03706fSIngo Molnar * to check if %RQCF_UPDATED is set. It'll never be shifted more than 1626cb42c9a3SMatt Fleming * one position though, because the next rq_unpin_lock() will shift it 1627cb42c9a3SMatt Fleming * back. 1628cb42c9a3SMatt Fleming */ 1629cb42c9a3SMatt Fleming #define RQCF_REQ_SKIP 0x01 1630cb42c9a3SMatt Fleming #define RQCF_ACT_SKIP 0x02 1631cb42c9a3SMatt Fleming #define RQCF_UPDATED 0x04 1632cb42c9a3SMatt Fleming 1633cb42c9a3SMatt Fleming static inline void assert_clock_updated(struct rq *rq) 1634cb42c9a3SMatt Fleming { 1635cb42c9a3SMatt Fleming /* 1636cb42c9a3SMatt Fleming * The only reason for not seeing a clock update since the 1637cb42c9a3SMatt Fleming * last rq_pin_lock() is if we're currently skipping updates. 1638cb42c9a3SMatt Fleming */ 1639cb42c9a3SMatt Fleming SCHED_WARN_ON(rq->clock_update_flags < RQCF_ACT_SKIP); 1640cb42c9a3SMatt Fleming } 1641cb42c9a3SMatt Fleming 164278becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 164378becc27SFrederic Weisbecker { 16445cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1645cb42c9a3SMatt Fleming assert_clock_updated(rq); 1646cb42c9a3SMatt Fleming 164778becc27SFrederic Weisbecker return rq->clock; 164878becc27SFrederic Weisbecker } 164978becc27SFrederic Weisbecker 165078becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 165178becc27SFrederic Weisbecker { 16525cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1653cb42c9a3SMatt Fleming assert_clock_updated(rq); 1654cb42c9a3SMatt Fleming 165578becc27SFrederic Weisbecker return rq->clock_task; 165678becc27SFrederic Weisbecker } 165778becc27SFrederic Weisbecker 1658adcc8da8SDavidlohr Bueso static inline void rq_clock_skip_update(struct rq *rq) 16599edfbfedSPeter Zijlstra { 16605cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1661cb42c9a3SMatt Fleming rq->clock_update_flags |= RQCF_REQ_SKIP; 1662adcc8da8SDavidlohr Bueso } 1663adcc8da8SDavidlohr Bueso 1664adcc8da8SDavidlohr Bueso /* 1665595058b6SDavidlohr Bueso * See rt task throttling, which is the only time a skip 16663b03706fSIngo Molnar * request is canceled. 1667adcc8da8SDavidlohr Bueso */ 1668adcc8da8SDavidlohr Bueso static inline void rq_clock_cancel_skipupdate(struct rq *rq) 1669adcc8da8SDavidlohr Bueso { 16705cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1671cb42c9a3SMatt Fleming rq->clock_update_flags &= ~RQCF_REQ_SKIP; 16729edfbfedSPeter Zijlstra } 16739edfbfedSPeter Zijlstra 1674ebb83d84SHao Jia /* 1675ebb83d84SHao Jia * During cpu offlining and rq wide unthrottling, we can trigger 1676ebb83d84SHao Jia * an update_rq_clock() for several cfs and rt runqueues (Typically 1677ebb83d84SHao Jia * when using list_for_each_entry_*) 1678ebb83d84SHao Jia * rq_clock_start_loop_update() can be called after updating the clock 1679ebb83d84SHao Jia * once and before iterating over the list to prevent multiple update. 1680ebb83d84SHao Jia * After the iterative traversal, we need to call rq_clock_stop_loop_update() 1681ebb83d84SHao Jia * to clear RQCF_ACT_SKIP of rq->clock_update_flags. 1682ebb83d84SHao Jia */ 1683ebb83d84SHao Jia static inline void rq_clock_start_loop_update(struct rq *rq) 1684ebb83d84SHao Jia { 1685ebb83d84SHao Jia lockdep_assert_rq_held(rq); 1686ebb83d84SHao Jia SCHED_WARN_ON(rq->clock_update_flags & RQCF_ACT_SKIP); 1687ebb83d84SHao Jia rq->clock_update_flags |= RQCF_ACT_SKIP; 1688ebb83d84SHao Jia } 1689ebb83d84SHao Jia 1690ebb83d84SHao Jia static inline void rq_clock_stop_loop_update(struct rq *rq) 1691ebb83d84SHao Jia { 1692ebb83d84SHao Jia lockdep_assert_rq_held(rq); 1693ebb83d84SHao Jia rq->clock_update_flags &= ~RQCF_ACT_SKIP; 1694ebb83d84SHao Jia } 1695ebb83d84SHao Jia 1696d8ac8971SMatt Fleming struct rq_flags { 1697d8ac8971SMatt Fleming unsigned long flags; 1698d8ac8971SMatt Fleming struct pin_cookie cookie; 1699cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1700cb42c9a3SMatt Fleming /* 1701cb42c9a3SMatt Fleming * A copy of (rq::clock_update_flags & RQCF_UPDATED) for the 1702cb42c9a3SMatt Fleming * current pin context is stashed here in case it needs to be 1703cb42c9a3SMatt Fleming * restored in rq_repin_lock(). 1704cb42c9a3SMatt Fleming */ 1705cb42c9a3SMatt Fleming unsigned int clock_update_flags; 1706cb42c9a3SMatt Fleming #endif 1707d8ac8971SMatt Fleming }; 1708d8ac8971SMatt Fleming 17098e5bad7dSKees Cook extern struct balance_callback balance_push_callback; 1710ae792702SPeter Zijlstra 171158877d34SPeter Zijlstra /* 171258877d34SPeter Zijlstra * Lockdep annotation that avoids accidental unlocks; it's like a 171358877d34SPeter Zijlstra * sticky/continuous lockdep_assert_held(). 171458877d34SPeter Zijlstra * 171558877d34SPeter Zijlstra * This avoids code that has access to 'struct rq *rq' (basically everything in 171658877d34SPeter Zijlstra * the scheduler) from accidentally unlocking the rq if they do not also have a 171758877d34SPeter Zijlstra * copy of the (on-stack) 'struct rq_flags rf'. 171858877d34SPeter Zijlstra * 171958877d34SPeter Zijlstra * Also see Documentation/locking/lockdep-design.rst. 172058877d34SPeter Zijlstra */ 1721d8ac8971SMatt Fleming static inline void rq_pin_lock(struct rq *rq, struct rq_flags *rf) 1722d8ac8971SMatt Fleming { 17239ef7e7e3SPeter Zijlstra rf->cookie = lockdep_pin_lock(__rq_lockp(rq)); 1724cb42c9a3SMatt Fleming 1725cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1726cb42c9a3SMatt Fleming rq->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 1727cb42c9a3SMatt Fleming rf->clock_update_flags = 0; 1728565790d2SPeter Zijlstra # ifdef CONFIG_SMP 1729ae792702SPeter Zijlstra SCHED_WARN_ON(rq->balance_callback && rq->balance_callback != &balance_push_callback); 1730ae792702SPeter Zijlstra # endif 1731565790d2SPeter Zijlstra #endif 1732d8ac8971SMatt Fleming } 1733d8ac8971SMatt Fleming 1734d8ac8971SMatt Fleming static inline void rq_unpin_lock(struct rq *rq, struct rq_flags *rf) 1735d8ac8971SMatt Fleming { 1736cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1737cb42c9a3SMatt Fleming if (rq->clock_update_flags > RQCF_ACT_SKIP) 1738cb42c9a3SMatt Fleming rf->clock_update_flags = RQCF_UPDATED; 1739cb42c9a3SMatt Fleming #endif 1740cb42c9a3SMatt Fleming 17419ef7e7e3SPeter Zijlstra lockdep_unpin_lock(__rq_lockp(rq), rf->cookie); 1742d8ac8971SMatt Fleming } 1743d8ac8971SMatt Fleming 1744d8ac8971SMatt Fleming static inline void rq_repin_lock(struct rq *rq, struct rq_flags *rf) 1745d8ac8971SMatt Fleming { 17469ef7e7e3SPeter Zijlstra lockdep_repin_lock(__rq_lockp(rq), rf->cookie); 1747cb42c9a3SMatt Fleming 1748cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1749cb42c9a3SMatt Fleming /* 1750cb42c9a3SMatt Fleming * Restore the value we stashed in @rf for this pin context. 1751cb42c9a3SMatt Fleming */ 1752cb42c9a3SMatt Fleming rq->clock_update_flags |= rf->clock_update_flags; 1753cb42c9a3SMatt Fleming #endif 1754d8ac8971SMatt Fleming } 1755d8ac8971SMatt Fleming 1756127f6bf1SIngo Molnar extern 17571f351d7fSJohannes Weiner struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf) 17581f351d7fSJohannes Weiner __acquires(rq->lock); 17591f351d7fSJohannes Weiner 1760127f6bf1SIngo Molnar extern 17611f351d7fSJohannes Weiner struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf) 17621f351d7fSJohannes Weiner __acquires(p->pi_lock) 17631f351d7fSJohannes Weiner __acquires(rq->lock); 17641f351d7fSJohannes Weiner 17651f351d7fSJohannes Weiner static inline void __task_rq_unlock(struct rq *rq, struct rq_flags *rf) 17661f351d7fSJohannes Weiner __releases(rq->lock) 17671f351d7fSJohannes Weiner { 17681f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 17695cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 17701f351d7fSJohannes Weiner } 17711f351d7fSJohannes Weiner 17721f351d7fSJohannes Weiner static inline void 17731f351d7fSJohannes Weiner task_rq_unlock(struct rq *rq, struct task_struct *p, struct rq_flags *rf) 17741f351d7fSJohannes Weiner __releases(rq->lock) 17751f351d7fSJohannes Weiner __releases(p->pi_lock) 17761f351d7fSJohannes Weiner { 17771f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 17785cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 17791f351d7fSJohannes Weiner raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags); 17801f351d7fSJohannes Weiner } 17811f351d7fSJohannes Weiner 178294b548a1SPeter Zijlstra DEFINE_LOCK_GUARD_1(task_rq_lock, struct task_struct, 178394b548a1SPeter Zijlstra _T->rq = task_rq_lock(_T->lock, &_T->rf), 178494b548a1SPeter Zijlstra task_rq_unlock(_T->rq, _T->lock, &_T->rf), 178594b548a1SPeter Zijlstra struct rq *rq; struct rq_flags rf) 178694b548a1SPeter Zijlstra 1787127f6bf1SIngo Molnar static inline void rq_lock_irqsave(struct rq *rq, struct rq_flags *rf) 17881f351d7fSJohannes Weiner __acquires(rq->lock) 17891f351d7fSJohannes Weiner { 17905cb9eaa3SPeter Zijlstra raw_spin_rq_lock_irqsave(rq, rf->flags); 17911f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 17921f351d7fSJohannes Weiner } 17931f351d7fSJohannes Weiner 1794127f6bf1SIngo Molnar static inline void rq_lock_irq(struct rq *rq, struct rq_flags *rf) 17951f351d7fSJohannes Weiner __acquires(rq->lock) 17961f351d7fSJohannes Weiner { 17975cb9eaa3SPeter Zijlstra raw_spin_rq_lock_irq(rq); 17981f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 17991f351d7fSJohannes Weiner } 18001f351d7fSJohannes Weiner 1801127f6bf1SIngo Molnar static inline void rq_lock(struct rq *rq, struct rq_flags *rf) 18021f351d7fSJohannes Weiner __acquires(rq->lock) 18031f351d7fSJohannes Weiner { 18045cb9eaa3SPeter Zijlstra raw_spin_rq_lock(rq); 18051f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 18061f351d7fSJohannes Weiner } 18071f351d7fSJohannes Weiner 1808127f6bf1SIngo Molnar static inline void rq_unlock_irqrestore(struct rq *rq, struct rq_flags *rf) 18091f351d7fSJohannes Weiner __releases(rq->lock) 18101f351d7fSJohannes Weiner { 18111f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 18125cb9eaa3SPeter Zijlstra raw_spin_rq_unlock_irqrestore(rq, rf->flags); 18131f351d7fSJohannes Weiner } 18141f351d7fSJohannes Weiner 1815127f6bf1SIngo Molnar static inline void rq_unlock_irq(struct rq *rq, struct rq_flags *rf) 18161f351d7fSJohannes Weiner __releases(rq->lock) 18171f351d7fSJohannes Weiner { 18181f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 18195cb9eaa3SPeter Zijlstra raw_spin_rq_unlock_irq(rq); 18201f351d7fSJohannes Weiner } 18211f351d7fSJohannes Weiner 1822127f6bf1SIngo Molnar static inline void rq_unlock(struct rq *rq, struct rq_flags *rf) 18231f351d7fSJohannes Weiner __releases(rq->lock) 18241f351d7fSJohannes Weiner { 18251f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 18265cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 18271f351d7fSJohannes Weiner } 18281f351d7fSJohannes Weiner 18294eb054f9SPeter Zijlstra DEFINE_LOCK_GUARD_1(rq_lock, struct rq, 18304eb054f9SPeter Zijlstra rq_lock(_T->lock, &_T->rf), 18314eb054f9SPeter Zijlstra rq_unlock(_T->lock, &_T->rf), 18324eb054f9SPeter Zijlstra struct rq_flags rf) 18334eb054f9SPeter Zijlstra 18344eb054f9SPeter Zijlstra DEFINE_LOCK_GUARD_1(rq_lock_irq, struct rq, 18354eb054f9SPeter Zijlstra rq_lock_irq(_T->lock, &_T->rf), 18364eb054f9SPeter Zijlstra rq_unlock_irq(_T->lock, &_T->rf), 18374eb054f9SPeter Zijlstra struct rq_flags rf) 18384eb054f9SPeter Zijlstra 18394eb054f9SPeter Zijlstra DEFINE_LOCK_GUARD_1(rq_lock_irqsave, struct rq, 18404eb054f9SPeter Zijlstra rq_lock_irqsave(_T->lock, &_T->rf), 18414eb054f9SPeter Zijlstra rq_unlock_irqrestore(_T->lock, &_T->rf), 18424eb054f9SPeter Zijlstra struct rq_flags rf) 18434eb054f9SPeter Zijlstra 1844127f6bf1SIngo Molnar static inline struct rq *this_rq_lock_irq(struct rq_flags *rf) 1845246b3b33SJohannes Weiner __acquires(rq->lock) 1846246b3b33SJohannes Weiner { 1847246b3b33SJohannes Weiner struct rq *rq; 1848246b3b33SJohannes Weiner 1849246b3b33SJohannes Weiner local_irq_disable(); 1850246b3b33SJohannes Weiner rq = this_rq(); 1851246b3b33SJohannes Weiner rq_lock(rq, rf); 1852127f6bf1SIngo Molnar 1853246b3b33SJohannes Weiner return rq; 1854246b3b33SJohannes Weiner } 1855246b3b33SJohannes Weiner 18569942f79bSRik van Riel #ifdef CONFIG_NUMA 1857127f6bf1SIngo Molnar 1858e3fe70b1SRik van Riel enum numa_topology_type { 1859e3fe70b1SRik van Riel NUMA_DIRECT, 1860e3fe70b1SRik van Riel NUMA_GLUELESS_MESH, 1861e3fe70b1SRik van Riel NUMA_BACKPLANE, 1862e3fe70b1SRik van Riel }; 1863127f6bf1SIngo Molnar 1864e3fe70b1SRik van Riel extern enum numa_topology_type sched_numa_topology_type; 18659942f79bSRik van Riel extern int sched_max_numa_distance; 18669942f79bSRik van Riel extern bool find_numa_distance(int distance); 18670fb3978bSHuang Ying extern void sched_init_numa(int offline_node); 18680fb3978bSHuang Ying extern void sched_update_numa(int cpu, bool online); 1869f2cb1360SIngo Molnar extern void sched_domains_numa_masks_set(unsigned int cpu); 1870f2cb1360SIngo Molnar extern void sched_domains_numa_masks_clear(unsigned int cpu); 1871e0e8d491SWanpeng Li extern int sched_numa_find_closest(const struct cpumask *cpus, int cpu); 1872127f6bf1SIngo Molnar 1873127f6bf1SIngo Molnar #else /* !CONFIG_NUMA: */ 1874127f6bf1SIngo Molnar 18750fb3978bSHuang Ying static inline void sched_init_numa(int offline_node) { } 18760fb3978bSHuang Ying static inline void sched_update_numa(int cpu, bool online) { } 1877f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_set(unsigned int cpu) { } 1878f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_clear(unsigned int cpu) { } 1879127f6bf1SIngo Molnar 1880e0e8d491SWanpeng Li static inline int sched_numa_find_closest(const struct cpumask *cpus, int cpu) 1881e0e8d491SWanpeng Li { 1882e0e8d491SWanpeng Li return nr_cpu_ids; 1883e0e8d491SWanpeng Li } 1884127f6bf1SIngo Molnar 1885127f6bf1SIngo Molnar #endif /* !CONFIG_NUMA */ 1886f2cb1360SIngo Molnar 1887f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 1888127f6bf1SIngo Molnar 188944dba3d5SIulia Manda /* The regions in numa_faults array from task_struct */ 189044dba3d5SIulia Manda enum numa_faults_stats { 189144dba3d5SIulia Manda NUMA_MEM = 0, 189244dba3d5SIulia Manda NUMA_CPU, 189344dba3d5SIulia Manda NUMA_MEMBUF, 189444dba3d5SIulia Manda NUMA_CPUBUF 189544dba3d5SIulia Manda }; 1896127f6bf1SIngo Molnar 18970ec8aa00SPeter Zijlstra extern void sched_setnuma(struct task_struct *p, int node); 1898e6628d5bSMel Gorman extern int migrate_task_to(struct task_struct *p, int cpu); 18990ad4e3dfSSrikar Dronamraju extern int migrate_swap(struct task_struct *p, struct task_struct *t, 19000ad4e3dfSSrikar Dronamraju int cpu, int scpu); 190113784475SMel Gorman extern void init_numa_balancing(unsigned long clone_flags, struct task_struct *p); 1902127f6bf1SIngo Molnar 1903127f6bf1SIngo Molnar #else /* !CONFIG_NUMA_BALANCING: */ 1904127f6bf1SIngo Molnar 190513784475SMel Gorman static inline void 190613784475SMel Gorman init_numa_balancing(unsigned long clone_flags, struct task_struct *p) 190713784475SMel Gorman { 190813784475SMel Gorman } 1909127f6bf1SIngo Molnar 1910127f6bf1SIngo Molnar #endif /* !CONFIG_NUMA_BALANCING */ 1911f809ca9aSMel Gorman 1912518cd623SPeter Zijlstra #ifdef CONFIG_SMP 1913518cd623SPeter Zijlstra 1914e3fca9e7SPeter Zijlstra static inline void 1915e3fca9e7SPeter Zijlstra queue_balance_callback(struct rq *rq, 19168e5bad7dSKees Cook struct balance_callback *head, 1917e3fca9e7SPeter Zijlstra void (*func)(struct rq *rq)) 1918e3fca9e7SPeter Zijlstra { 19195cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1920e3fca9e7SPeter Zijlstra 192104193d59SPeter Zijlstra /* 192204193d59SPeter Zijlstra * Don't (re)queue an already queued item; nor queue anything when 192304193d59SPeter Zijlstra * balance_push() is active, see the comment with 192404193d59SPeter Zijlstra * balance_push_callback. 192504193d59SPeter Zijlstra */ 1926ae792702SPeter Zijlstra if (unlikely(head->next || rq->balance_callback == &balance_push_callback)) 1927e3fca9e7SPeter Zijlstra return; 1928e3fca9e7SPeter Zijlstra 19298e5bad7dSKees Cook head->func = func; 1930e3fca9e7SPeter Zijlstra head->next = rq->balance_callback; 1931e3fca9e7SPeter Zijlstra rq->balance_callback = head; 1932e3fca9e7SPeter Zijlstra } 1933e3fca9e7SPeter Zijlstra 1934391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 1935127f6bf1SIngo Molnar rcu_dereference_check((p), lockdep_is_held(&sched_domains_mutex)) 1936391e43daSPeter Zijlstra 1937391e43daSPeter Zijlstra /* 1938391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 1939337e9b07SPaul E. McKenney * See destroy_sched_domains: call_rcu for details. 1940391e43daSPeter Zijlstra * 1941391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 1942391e43daSPeter Zijlstra * preempt-disabled sections. 1943391e43daSPeter Zijlstra */ 1944391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 1945518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 1946518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 1947391e43daSPeter Zijlstra 194840b4d3dcSRicardo Neri /* A mask of all the SD flags that have the SDF_SHARED_CHILD metaflag */ 194940b4d3dcSRicardo Neri #define SD_FLAG(name, mflags) (name * !!((mflags) & SDF_SHARED_CHILD)) | 195040b4d3dcSRicardo Neri static const unsigned int SD_SHARED_CHILD_MASK = 195140b4d3dcSRicardo Neri #include <linux/sched/sd_flags.h> 195240b4d3dcSRicardo Neri 0; 195340b4d3dcSRicardo Neri #undef SD_FLAG 195440b4d3dcSRicardo Neri 1955518cd623SPeter Zijlstra /** 1956518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 195797fb7a0aSIngo Molnar * @cpu: The CPU whose highest level of sched domain is to 1958518cd623SPeter Zijlstra * be returned. 1959518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 196097fb7a0aSIngo Molnar * for the given CPU. 1961518cd623SPeter Zijlstra * 196240b4d3dcSRicardo Neri * Returns the highest sched_domain of a CPU which contains @flag. If @flag has 196340b4d3dcSRicardo Neri * the SDF_SHARED_CHILD metaflag, all the children domains also have @flag. 1964518cd623SPeter Zijlstra */ 1965518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 1966518cd623SPeter Zijlstra { 1967518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 1968518cd623SPeter Zijlstra 1969518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 197040b4d3dcSRicardo Neri if (sd->flags & flag) { 1971518cd623SPeter Zijlstra hsd = sd; 197240b4d3dcSRicardo Neri continue; 197340b4d3dcSRicardo Neri } 197440b4d3dcSRicardo Neri 197540b4d3dcSRicardo Neri /* 197640b4d3dcSRicardo Neri * Stop the search if @flag is known to be shared at lower 197740b4d3dcSRicardo Neri * levels. It will not be found further up. 197840b4d3dcSRicardo Neri */ 197940b4d3dcSRicardo Neri if (flag & SD_SHARED_CHILD_MASK) 198040b4d3dcSRicardo Neri break; 1981518cd623SPeter Zijlstra } 1982518cd623SPeter Zijlstra 1983518cd623SPeter Zijlstra return hsd; 1984518cd623SPeter Zijlstra } 1985518cd623SPeter Zijlstra 1986fb13c7eeSMel Gorman static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) 1987fb13c7eeSMel Gorman { 1988fb13c7eeSMel Gorman struct sched_domain *sd; 1989fb13c7eeSMel Gorman 1990fb13c7eeSMel Gorman for_each_domain(cpu, sd) { 1991fb13c7eeSMel Gorman if (sd->flags & flag) 1992fb13c7eeSMel Gorman break; 1993fb13c7eeSMel Gorman } 1994fb13c7eeSMel Gorman 1995fb13c7eeSMel Gorman return sd; 1996fb13c7eeSMel Gorman } 1997fb13c7eeSMel Gorman 1998994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_llc); 19997d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 2000518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 2001b95303e0SBarry Song DECLARE_PER_CPU(int, sd_share_id); 2002994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain_shared __rcu *, sd_llc_shared); 2003994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_numa); 2004994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_packing); 2005994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_cpucapacity); 2006127f6bf1SIngo Molnar 2007df054e84SMorten Rasmussen extern struct static_key_false sched_asym_cpucapacity; 20088881e163SBarry Song extern struct static_key_false sched_cluster_active; 2009518cd623SPeter Zijlstra 2010740cf8a7SDietmar Eggemann static __always_inline bool sched_asym_cpucap_active(void) 2011740cf8a7SDietmar Eggemann { 2012740cf8a7SDietmar Eggemann return static_branch_unlikely(&sched_asym_cpucapacity); 2013740cf8a7SDietmar Eggemann } 2014740cf8a7SDietmar Eggemann 201563b2ca30SNicolas Pitre struct sched_group_capacity { 20165e6521eaSLi Zefan atomic_t ref; 20175e6521eaSLi Zefan /* 2018172895e6SYuyang Du * CPU capacity of this group, SCHED_CAPACITY_SCALE being max capacity 201963b2ca30SNicolas Pitre * for a single CPU. 20205e6521eaSLi Zefan */ 2021bf475ce0SMorten Rasmussen unsigned long capacity; 2022bf475ce0SMorten Rasmussen unsigned long min_capacity; /* Min per-CPU capacity in group */ 2023e3d6d0cbSMorten Rasmussen unsigned long max_capacity; /* Max per-CPU capacity in group */ 20245e6521eaSLi Zefan unsigned long next_update; 202563b2ca30SNicolas Pitre int imbalance; /* XXX unrelated to capacity but shared group state */ 20265e6521eaSLi Zefan 2027005f874dSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 2028005f874dSPeter Zijlstra int id; 2029005f874dSPeter Zijlstra #endif 2030005f874dSPeter Zijlstra 2031eba9f082Szhuguangqing unsigned long cpumask[]; /* Balance mask */ 20325e6521eaSLi Zefan }; 20335e6521eaSLi Zefan 20345e6521eaSLi Zefan struct sched_group { 20355e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 20365e6521eaSLi Zefan atomic_t ref; 20375e6521eaSLi Zefan 20385e6521eaSLi Zefan unsigned int group_weight; 2039d24cb0d9STim C Chen unsigned int cores; 204063b2ca30SNicolas Pitre struct sched_group_capacity *sgc; 204197fb7a0aSIngo Molnar int asym_prefer_cpu; /* CPU of highest priority in group */ 204216d364baSRicardo Neri int flags; 20435e6521eaSLi Zefan 20445e6521eaSLi Zefan /* 20455e6521eaSLi Zefan * The CPUs this group covers. 20465e6521eaSLi Zefan * 20475e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 20485e6521eaSLi Zefan * by attaching extra space to the end of the structure, 20495e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 20505e6521eaSLi Zefan */ 205104f5c362SGustavo A. R. Silva unsigned long cpumask[]; 20525e6521eaSLi Zefan }; 20535e6521eaSLi Zefan 2054ae4df9d6SPeter Zijlstra static inline struct cpumask *sched_group_span(struct sched_group *sg) 20555e6521eaSLi Zefan { 20565e6521eaSLi Zefan return to_cpumask(sg->cpumask); 20575e6521eaSLi Zefan } 20585e6521eaSLi Zefan 20595e6521eaSLi Zefan /* 2060e5c14b1fSPeter Zijlstra * See build_balance_mask(). 20615e6521eaSLi Zefan */ 2062e5c14b1fSPeter Zijlstra static inline struct cpumask *group_balance_mask(struct sched_group *sg) 20635e6521eaSLi Zefan { 206463b2ca30SNicolas Pitre return to_cpumask(sg->sgc->cpumask); 20655e6521eaSLi Zefan } 20665e6521eaSLi Zefan 2067c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 2068c1174876SPeter Zijlstra 20693b87f136SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 2070127f6bf1SIngo Molnar extern void update_sched_domain_debugfs(void); 2071127f6bf1SIngo Molnar extern void dirty_sched_domain_sysctl(int cpu); 20723866e845SSteven Rostedt (Red Hat) #else 2073127f6bf1SIngo Molnar static inline void update_sched_domain_debugfs(void) { } 2074127f6bf1SIngo Molnar static inline void dirty_sched_domain_sysctl(int cpu) { } 20753866e845SSteven Rostedt (Red Hat) #endif 20763866e845SSteven Rostedt (Red Hat) 20778a99b683SPeter Zijlstra extern int sched_update_scaling(void); 20788f9ea86fSWaiman Long 20798f9ea86fSWaiman Long static inline const struct cpumask *task_user_cpus(struct task_struct *p) 20808f9ea86fSWaiman Long { 20818f9ea86fSWaiman Long if (!p->user_cpus_ptr) 20828f9ea86fSWaiman Long return cpu_possible_mask; /* &init_task.cpus_mask */ 20838f9ea86fSWaiman Long return p->user_cpus_ptr; 20848f9ea86fSWaiman Long } 2085127f6bf1SIngo Molnar 2086d664e399SThomas Gleixner #endif /* CONFIG_SMP */ 2087391e43daSPeter Zijlstra 2088391e43daSPeter Zijlstra #include "stats.h" 2089391e43daSPeter Zijlstra 20904feee7d1SJosh Don #if defined(CONFIG_SCHED_CORE) && defined(CONFIG_SCHEDSTATS) 20914feee7d1SJosh Don 20924feee7d1SJosh Don extern void __sched_core_account_forceidle(struct rq *rq); 20934feee7d1SJosh Don 20944feee7d1SJosh Don static inline void sched_core_account_forceidle(struct rq *rq) 20954feee7d1SJosh Don { 20964feee7d1SJosh Don if (schedstat_enabled()) 20974feee7d1SJosh Don __sched_core_account_forceidle(rq); 20984feee7d1SJosh Don } 20994feee7d1SJosh Don 21004feee7d1SJosh Don extern void __sched_core_tick(struct rq *rq); 21014feee7d1SJosh Don 21024feee7d1SJosh Don static inline void sched_core_tick(struct rq *rq) 21034feee7d1SJosh Don { 21044feee7d1SJosh Don if (sched_core_enabled(rq) && schedstat_enabled()) 21054feee7d1SJosh Don __sched_core_tick(rq); 21064feee7d1SJosh Don } 21074feee7d1SJosh Don 2108127f6bf1SIngo Molnar #else /* !(CONFIG_SCHED_CORE && CONFIG_SCHEDSTATS): */ 21094feee7d1SJosh Don 21104feee7d1SJosh Don static inline void sched_core_account_forceidle(struct rq *rq) { } 21114feee7d1SJosh Don 21124feee7d1SJosh Don static inline void sched_core_tick(struct rq *rq) { } 21134feee7d1SJosh Don 2114127f6bf1SIngo Molnar #endif /* !(CONFIG_SCHED_CORE && CONFIG_SCHEDSTATS) */ 21154feee7d1SJosh Don 2116391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 2117391e43daSPeter Zijlstra 2118391e43daSPeter Zijlstra /* 2119391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 2120391e43daSPeter Zijlstra * 21218af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 21228af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 21238af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 21248323f26cSPeter Zijlstra * 21258323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 21268323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 21278323f26cSPeter Zijlstra * 21288323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 21298323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 2130391e43daSPeter Zijlstra */ 2131391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 2132391e43daSPeter Zijlstra { 21338323f26cSPeter Zijlstra return p->sched_task_group; 2134391e43daSPeter Zijlstra } 2135391e43daSPeter Zijlstra 2136391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 2137391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 2138391e43daSPeter Zijlstra { 2139391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 2140391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 2141391e43daSPeter Zijlstra #endif 2142391e43daSPeter Zijlstra 2143391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 2144ad936d86SByungchul Park set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]); 2145391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 2146391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 214778b6b157SChengming Zhou p->se.depth = tg->se[cpu] ? tg->se[cpu]->depth + 1 : 0; 2148391e43daSPeter Zijlstra #endif 2149391e43daSPeter Zijlstra 2150391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 2151391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 2152391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 2153391e43daSPeter Zijlstra #endif 2154391e43daSPeter Zijlstra } 2155391e43daSPeter Zijlstra 2156127f6bf1SIngo Molnar #else /* !CONFIG_CGROUP_SCHED: */ 2157391e43daSPeter Zijlstra 2158391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 2159127f6bf1SIngo Molnar 2160391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 2161391e43daSPeter Zijlstra { 2162391e43daSPeter Zijlstra return NULL; 2163391e43daSPeter Zijlstra } 2164391e43daSPeter Zijlstra 2165127f6bf1SIngo Molnar #endif /* !CONFIG_CGROUP_SCHED */ 2166391e43daSPeter Zijlstra 2167391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 2168391e43daSPeter Zijlstra { 2169391e43daSPeter Zijlstra set_task_rq(p, cpu); 2170391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2171391e43daSPeter Zijlstra /* 2172391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 2173dfcb245eSIngo Molnar * successfully executed on another CPU. We must ensure that updates of 2174391e43daSPeter Zijlstra * per-task data have been completed by this moment. 2175391e43daSPeter Zijlstra */ 2176391e43daSPeter Zijlstra smp_wmb(); 2177c546951dSAndrea Parri WRITE_ONCE(task_thread_info(p)->cpu, cpu); 2178ac66f547SPeter Zijlstra p->wake_cpu = cpu; 2179391e43daSPeter Zijlstra #endif 2180391e43daSPeter Zijlstra } 2181391e43daSPeter Zijlstra 2182391e43daSPeter Zijlstra /* 2183391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 2184391e43daSPeter Zijlstra */ 2185391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 2186391e43daSPeter Zijlstra # define const_debug __read_mostly 2187391e43daSPeter Zijlstra #else 2188391e43daSPeter Zijlstra # define const_debug const 2189391e43daSPeter Zijlstra #endif 2190391e43daSPeter Zijlstra 2191391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 2192391e43daSPeter Zijlstra __SCHED_FEAT_##name , 2193391e43daSPeter Zijlstra 2194391e43daSPeter Zijlstra enum { 2195391e43daSPeter Zijlstra #include "features.h" 2196f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 2197391e43daSPeter Zijlstra }; 2198391e43daSPeter Zijlstra 2199391e43daSPeter Zijlstra #undef SCHED_FEAT 2200391e43daSPeter Zijlstra 2201a73f863aSJuri Lelli #ifdef CONFIG_SCHED_DEBUG 2202765cc3a4SPatrick Bellasi 2203765cc3a4SPatrick Bellasi /* 2204765cc3a4SPatrick Bellasi * To support run-time toggling of sched features, all the translation units 2205765cc3a4SPatrick Bellasi * (but core.c) reference the sysctl_sched_features defined in core.c. 2206765cc3a4SPatrick Bellasi */ 2207765cc3a4SPatrick Bellasi extern const_debug unsigned int sysctl_sched_features; 2208765cc3a4SPatrick Bellasi 2209a73f863aSJuri Lelli #ifdef CONFIG_JUMP_LABEL 2210127f6bf1SIngo Molnar 2211f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 2212c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 2213f8b6d1ccSPeter Zijlstra { \ 22146e76ea8aSJason Baron return static_key_##enabled(key); \ 2215f8b6d1ccSPeter Zijlstra } 2216f8b6d1ccSPeter Zijlstra 2217f8b6d1ccSPeter Zijlstra #include "features.h" 2218f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 2219f8b6d1ccSPeter Zijlstra 2220c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 2221f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 2222765cc3a4SPatrick Bellasi 2223127f6bf1SIngo Molnar #else /* !CONFIG_JUMP_LABEL: */ 2224a73f863aSJuri Lelli 2225a73f863aSJuri Lelli #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 2226a73f863aSJuri Lelli 2227127f6bf1SIngo Molnar #endif /* !CONFIG_JUMP_LABEL */ 2228a73f863aSJuri Lelli 2229127f6bf1SIngo Molnar #else /* !SCHED_DEBUG: */ 2230765cc3a4SPatrick Bellasi 2231765cc3a4SPatrick Bellasi /* 2232765cc3a4SPatrick Bellasi * Each translation unit has its own copy of sysctl_sched_features to allow 2233765cc3a4SPatrick Bellasi * constants propagation at compile time and compiler optimization based on 2234765cc3a4SPatrick Bellasi * features default. 2235765cc3a4SPatrick Bellasi */ 2236765cc3a4SPatrick Bellasi #define SCHED_FEAT(name, enabled) \ 2237765cc3a4SPatrick Bellasi (1UL << __SCHED_FEAT_##name) * enabled | 2238765cc3a4SPatrick Bellasi static const_debug __maybe_unused unsigned int sysctl_sched_features = 2239765cc3a4SPatrick Bellasi #include "features.h" 2240765cc3a4SPatrick Bellasi 0; 2241765cc3a4SPatrick Bellasi #undef SCHED_FEAT 2242765cc3a4SPatrick Bellasi 22437e6f4c5dSPeter Zijlstra #define sched_feat(x) !!(sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 2244765cc3a4SPatrick Bellasi 2245127f6bf1SIngo Molnar #endif /* !SCHED_DEBUG */ 2246391e43daSPeter Zijlstra 22472a595721SSrikar Dronamraju extern struct static_key_false sched_numa_balancing; 2248cb251765SMel Gorman extern struct static_key_false sched_schedstats; 2249cbee9f88SPeter Zijlstra 2250391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 2251391e43daSPeter Zijlstra { 2252391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 2253391e43daSPeter Zijlstra } 2254391e43daSPeter Zijlstra 2255391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 2256391e43daSPeter Zijlstra { 2257391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 2258391e43daSPeter Zijlstra return RUNTIME_INF; 2259391e43daSPeter Zijlstra 2260391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 2261391e43daSPeter Zijlstra } 2262391e43daSPeter Zijlstra 2263391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 2264391e43daSPeter Zijlstra { 2265391e43daSPeter Zijlstra return rq->curr == p; 2266391e43daSPeter Zijlstra } 2267391e43daSPeter Zijlstra 22680b9d46fcSPeter Zijlstra static inline int task_on_cpu(struct rq *rq, struct task_struct *p) 2269391e43daSPeter Zijlstra { 2270391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2271391e43daSPeter Zijlstra return p->on_cpu; 2272391e43daSPeter Zijlstra #else 2273391e43daSPeter Zijlstra return task_current(rq, p); 2274391e43daSPeter Zijlstra #endif 2275391e43daSPeter Zijlstra } 2276391e43daSPeter Zijlstra 2277da0c1e65SKirill Tkhai static inline int task_on_rq_queued(struct task_struct *p) 2278da0c1e65SKirill Tkhai { 2279da0c1e65SKirill Tkhai return p->on_rq == TASK_ON_RQ_QUEUED; 2280da0c1e65SKirill Tkhai } 2281391e43daSPeter Zijlstra 2282cca26e80SKirill Tkhai static inline int task_on_rq_migrating(struct task_struct *p) 2283cca26e80SKirill Tkhai { 2284c546951dSAndrea Parri return READ_ONCE(p->on_rq) == TASK_ON_RQ_MIGRATING; 2285cca26e80SKirill Tkhai } 2286cca26e80SKirill Tkhai 228717770579SValentin Schneider /* Wake flags. The first three directly map to some SD flag value */ 228817770579SValentin Schneider #define WF_EXEC 0x02 /* Wakeup after exec; maps to SD_BALANCE_EXEC */ 228917770579SValentin Schneider #define WF_FORK 0x04 /* Wakeup after fork; maps to SD_BALANCE_FORK */ 229017770579SValentin Schneider #define WF_TTWU 0x08 /* Wakeup; maps to SD_BALANCE_WAKE */ 229117770579SValentin Schneider 229217770579SValentin Schneider #define WF_SYNC 0x10 /* Waker goes to sleep after wakeup */ 229317770579SValentin Schneider #define WF_MIGRATED 0x20 /* Internal use, task got migrated */ 2294ab83f455SPeter Oskolkov #define WF_CURRENT_CPU 0x40 /* Prefer to move the wakee to the current CPU. */ 229517770579SValentin Schneider 229617770579SValentin Schneider #ifdef CONFIG_SMP 229717770579SValentin Schneider static_assert(WF_EXEC == SD_BALANCE_EXEC); 229817770579SValentin Schneider static_assert(WF_FORK == SD_BALANCE_FORK); 229917770579SValentin Schneider static_assert(WF_TTWU == SD_BALANCE_WAKE); 230017770579SValentin Schneider #endif 2301b13095f0SLi Zefan 2302391e43daSPeter Zijlstra /* 2303391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 2304391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 2305391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 2306391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 2307391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 2308391e43daSPeter Zijlstra * slice expiry etc. 2309391e43daSPeter Zijlstra */ 2310391e43daSPeter Zijlstra 2311391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 2312391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 2313391e43daSPeter Zijlstra 2314ed82b8a1SAndi Kleen extern const int sched_prio_to_weight[40]; 2315ed82b8a1SAndi Kleen extern const u32 sched_prio_to_wmult[40]; 2316391e43daSPeter Zijlstra 2317ff77e468SPeter Zijlstra /* 2318ff77e468SPeter Zijlstra * {de,en}queue flags: 2319ff77e468SPeter Zijlstra * 2320ff77e468SPeter Zijlstra * DEQUEUE_SLEEP - task is no longer runnable 2321ff77e468SPeter Zijlstra * ENQUEUE_WAKEUP - task just became runnable 2322ff77e468SPeter Zijlstra * 2323ff77e468SPeter Zijlstra * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks 2324ff77e468SPeter Zijlstra * are in a known state which allows modification. Such pairs 2325ff77e468SPeter Zijlstra * should preserve as much state as possible. 2326ff77e468SPeter Zijlstra * 2327ff77e468SPeter Zijlstra * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location 2328ff77e468SPeter Zijlstra * in the runqueue. 2329ff77e468SPeter Zijlstra * 23302f7a0f58SPeter Zijlstra * NOCLOCK - skip the update_rq_clock() (avoids double updates) 23312f7a0f58SPeter Zijlstra * 23322f7a0f58SPeter Zijlstra * MIGRATION - p->on_rq == TASK_ON_RQ_MIGRATING (used for DEADLINE) 23332f7a0f58SPeter Zijlstra * 2334ff77e468SPeter Zijlstra * ENQUEUE_HEAD - place at front of runqueue (tail if not specified) 2335ff77e468SPeter Zijlstra * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline) 233659efa0baSPeter Zijlstra * ENQUEUE_MIGRATED - the task was migrated during wakeup 2337ff77e468SPeter Zijlstra * 2338ff77e468SPeter Zijlstra */ 2339ff77e468SPeter Zijlstra 2340e1459a50SPeter Zijlstra #define DEQUEUE_SLEEP 0x01 /* Matches ENQUEUE_WAKEUP */ 234197fb7a0aSIngo Molnar #define DEQUEUE_SAVE 0x02 /* Matches ENQUEUE_RESTORE */ 234297fb7a0aSIngo Molnar #define DEQUEUE_MOVE 0x04 /* Matches ENQUEUE_MOVE */ 234397fb7a0aSIngo Molnar #define DEQUEUE_NOCLOCK 0x08 /* Matches ENQUEUE_NOCLOCK */ 2344e1459a50SPeter Zijlstra #define DEQUEUE_SPECIAL 0x10 23452f7a0f58SPeter Zijlstra #define DEQUEUE_MIGRATING 0x100 /* Matches ENQUEUE_MIGRATING */ 2346abc158c8SPeter Zijlstra #define DEQUEUE_DELAYED 0x200 /* Matches ENQUEUE_DELAYED */ 2347ff77e468SPeter Zijlstra 23481de64443SPeter Zijlstra #define ENQUEUE_WAKEUP 0x01 2349ff77e468SPeter Zijlstra #define ENQUEUE_RESTORE 0x02 2350ff77e468SPeter Zijlstra #define ENQUEUE_MOVE 0x04 23510a67d1eeSPeter Zijlstra #define ENQUEUE_NOCLOCK 0x08 2352ff77e468SPeter Zijlstra 23530a67d1eeSPeter Zijlstra #define ENQUEUE_HEAD 0x10 23540a67d1eeSPeter Zijlstra #define ENQUEUE_REPLENISH 0x20 2355c82ba9faSLi Zefan #ifdef CONFIG_SMP 23560a67d1eeSPeter Zijlstra #define ENQUEUE_MIGRATED 0x40 2357c82ba9faSLi Zefan #else 235859efa0baSPeter Zijlstra #define ENQUEUE_MIGRATED 0x00 2359c82ba9faSLi Zefan #endif 2360d07f09a1SPeter Zijlstra #define ENQUEUE_INITIAL 0x80 23612f7a0f58SPeter Zijlstra #define ENQUEUE_MIGRATING 0x100 2362abc158c8SPeter Zijlstra #define ENQUEUE_DELAYED 0x200 2363c82ba9faSLi Zefan 236437e117c0SPeter Zijlstra #define RETRY_TASK ((void *)-1UL) 236537e117c0SPeter Zijlstra 2366713a2e21SWaiman Long struct affinity_context { 2367713a2e21SWaiman Long const struct cpumask *new_mask; 23688f9ea86fSWaiman Long struct cpumask *user_mask; 2369713a2e21SWaiman Long unsigned int flags; 2370713a2e21SWaiman Long }; 2371713a2e21SWaiman Long 23725d69eca5SPeter Zijlstra extern s64 update_curr_common(struct rq *rq); 23735d69eca5SPeter Zijlstra 2374c82ba9faSLi Zefan struct sched_class { 2375c82ba9faSLi Zefan 237669842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 237769842cbaSPatrick Bellasi int uclamp_enabled; 237869842cbaSPatrick Bellasi #endif 237969842cbaSPatrick Bellasi 2380c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 2381863ccdbbSPeter Zijlstra bool (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 2382c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 23830900acf2SDietmar Eggemann bool (*yield_to_task)(struct rq *rq, struct task_struct *p); 2384c82ba9faSLi Zefan 2385e23edc86SIngo Molnar void (*wakeup_preempt)(struct rq *rq, struct task_struct *p, int flags); 2386c82ba9faSLi Zefan 2387a735d43cSTejun Heo int (*balance)(struct rq *rq, struct task_struct *prev, struct rq_flags *rf); 2388fd03c5b8SPeter Zijlstra struct task_struct *(*pick_task)(struct rq *rq); 2389fd03c5b8SPeter Zijlstra /* 2390fd03c5b8SPeter Zijlstra * Optional! When implemented pick_next_task() should be equivalent to: 2391fd03c5b8SPeter Zijlstra * 2392fd03c5b8SPeter Zijlstra * next = pick_task(); 2393fd03c5b8SPeter Zijlstra * if (next) { 2394fd03c5b8SPeter Zijlstra * put_prev_task(prev); 2395fd03c5b8SPeter Zijlstra * set_next_task_first(next); 2396fd03c5b8SPeter Zijlstra * } 2397fd03c5b8SPeter Zijlstra */ 2398fd03c5b8SPeter Zijlstra struct task_struct *(*pick_next_task)(struct rq *rq, struct task_struct *prev); 239998c2f700SPeter Zijlstra 2400b2d70222SPeter Zijlstra void (*put_prev_task)(struct rq *rq, struct task_struct *p, struct task_struct *next); 2401a0e813f2SPeter Zijlstra void (*set_next_task)(struct rq *rq, struct task_struct *p, bool first); 2402c82ba9faSLi Zefan 2403c82ba9faSLi Zefan #ifdef CONFIG_SMP 24043aef1551SValentin Schneider int (*select_task_rq)(struct task_struct *p, int task_cpu, int flags); 240521f56ffeSPeter Zijlstra 24061327237aSSrikar Dronamraju void (*migrate_task_rq)(struct task_struct *p, int new_cpu); 2407c82ba9faSLi Zefan 2408c82ba9faSLi Zefan void (*task_woken)(struct rq *this_rq, struct task_struct *task); 2409c82ba9faSLi Zefan 2410713a2e21SWaiman Long void (*set_cpus_allowed)(struct task_struct *p, struct affinity_context *ctx); 2411c82ba9faSLi Zefan 2412c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 2413c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 2414a7c81556SPeter Zijlstra 2415a7c81556SPeter Zijlstra struct rq *(*find_lock_rq)(struct task_struct *p, struct rq *rq); 2416c82ba9faSLi Zefan #endif 2417c82ba9faSLi Zefan 2418c82ba9faSLi Zefan void (*task_tick)(struct rq *rq, struct task_struct *p, int queued); 2419c82ba9faSLi Zefan void (*task_fork)(struct task_struct *p); 2420e6c390f2SDario Faggioli void (*task_dead)(struct task_struct *p); 2421c82ba9faSLi Zefan 242267dfa1b7SKirill Tkhai /* 242367dfa1b7SKirill Tkhai * The switched_from() call is allowed to drop rq->lock, therefore we 24243b03706fSIngo Molnar * cannot assume the switched_from/switched_to pair is serialized by 242567dfa1b7SKirill Tkhai * rq->lock. They are however serialized by p->pi_lock. 242667dfa1b7SKirill Tkhai */ 2427d8c7bc2eSTejun Heo void (*switching_to) (struct rq *this_rq, struct task_struct *task); 2428c82ba9faSLi Zefan void (*switched_from)(struct rq *this_rq, struct task_struct *task); 2429c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 2430e83edbf8STejun Heo void (*reweight_task)(struct rq *this_rq, struct task_struct *task, 24317b9f6c86STejun Heo const struct load_weight *lw); 2432c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 2433c82ba9faSLi Zefan int oldprio); 2434c82ba9faSLi Zefan 2435c82ba9faSLi Zefan unsigned int (*get_rr_interval)(struct rq *rq, 2436c82ba9faSLi Zefan struct task_struct *task); 2437c82ba9faSLi Zefan 24386e998916SStanislaw Gruszka void (*update_curr)(struct rq *rq); 24396e998916SStanislaw Gruszka 2440c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 244139c42611SChengming Zhou void (*task_change_group)(struct task_struct *p); 2442c82ba9faSLi Zefan #endif 2443530bfad1SHao Jia 2444530bfad1SHao Jia #ifdef CONFIG_SCHED_CORE 2445530bfad1SHao Jia int (*task_is_throttled)(struct task_struct *p, int cpu); 2446530bfad1SHao Jia #endif 244743c31ac0SPeter Zijlstra }; 2448391e43daSPeter Zijlstra 24493f1d2a31SPeter Zijlstra static inline void put_prev_task(struct rq *rq, struct task_struct *prev) 24503f1d2a31SPeter Zijlstra { 245110e7071bSPeter Zijlstra WARN_ON_ONCE(rq->curr != prev); 2452b2d70222SPeter Zijlstra prev->sched_class->put_prev_task(rq, prev, NULL); 24533f1d2a31SPeter Zijlstra } 24543f1d2a31SPeter Zijlstra 245503b7fad1SPeter Zijlstra static inline void set_next_task(struct rq *rq, struct task_struct *next) 2456b2bf6c31SPeter Zijlstra { 2457a0e813f2SPeter Zijlstra next->sched_class->set_next_task(rq, next, false); 2458b2bf6c31SPeter Zijlstra } 2459b2bf6c31SPeter Zijlstra 2460bd9bbc96SPeter Zijlstra static inline void 2461bd9bbc96SPeter Zijlstra __put_prev_set_next_dl_server(struct rq *rq, 2462bd9bbc96SPeter Zijlstra struct task_struct *prev, 2463bd9bbc96SPeter Zijlstra struct task_struct *next) 2464bd9bbc96SPeter Zijlstra { 2465bd9bbc96SPeter Zijlstra prev->dl_server = NULL; 2466bd9bbc96SPeter Zijlstra next->dl_server = rq->dl_server; 2467bd9bbc96SPeter Zijlstra rq->dl_server = NULL; 2468bd9bbc96SPeter Zijlstra } 2469bd9bbc96SPeter Zijlstra 2470436f3eedSPeter Zijlstra static inline void put_prev_set_next_task(struct rq *rq, 2471436f3eedSPeter Zijlstra struct task_struct *prev, 2472436f3eedSPeter Zijlstra struct task_struct *next) 24737d2180d9SPeter Zijlstra { 2474436f3eedSPeter Zijlstra WARN_ON_ONCE(rq->curr != prev); 2475436f3eedSPeter Zijlstra 2476bd9bbc96SPeter Zijlstra __put_prev_set_next_dl_server(rq, prev, next); 2477bd9bbc96SPeter Zijlstra 2478436f3eedSPeter Zijlstra if (next == prev) 2479436f3eedSPeter Zijlstra return; 2480436f3eedSPeter Zijlstra 2481b2d70222SPeter Zijlstra prev->sched_class->put_prev_task(rq, prev, next); 24827d2180d9SPeter Zijlstra next->sched_class->set_next_task(rq, next, true); 24837d2180d9SPeter Zijlstra } 248443c31ac0SPeter Zijlstra 248543c31ac0SPeter Zijlstra /* 248643c31ac0SPeter Zijlstra * Helper to define a sched_class instance; each one is placed in a separate 248743c31ac0SPeter Zijlstra * section which is ordered by the linker script: 248843c31ac0SPeter Zijlstra * 248943c31ac0SPeter Zijlstra * include/asm-generic/vmlinux.lds.h 249043c31ac0SPeter Zijlstra * 2491546a3feeSPeter Zijlstra * *CAREFUL* they are laid out in *REVERSE* order!!! 2492546a3feeSPeter Zijlstra * 249343c31ac0SPeter Zijlstra * Also enforce alignment on the instance, not the type, to guarantee layout. 249443c31ac0SPeter Zijlstra */ 249543c31ac0SPeter Zijlstra #define DEFINE_SCHED_CLASS(name) \ 249643c31ac0SPeter Zijlstra const struct sched_class name##_sched_class \ 249743c31ac0SPeter Zijlstra __aligned(__alignof__(struct sched_class)) \ 249843c31ac0SPeter Zijlstra __section("__" #name "_sched_class") 249943c31ac0SPeter Zijlstra 2500c3a340f7SSteven Rostedt (VMware) /* Defined in include/asm-generic/vmlinux.lds.h */ 2501546a3feeSPeter Zijlstra extern struct sched_class __sched_class_highest[]; 2502546a3feeSPeter Zijlstra extern struct sched_class __sched_class_lowest[]; 25036e2df058SPeter Zijlstra 2504e196c908STejun Heo extern const struct sched_class stop_sched_class; 2505e196c908STejun Heo extern const struct sched_class dl_sched_class; 2506e196c908STejun Heo extern const struct sched_class rt_sched_class; 2507e196c908STejun Heo extern const struct sched_class fair_sched_class; 2508e196c908STejun Heo extern const struct sched_class idle_sched_class; 2509e196c908STejun Heo 2510e196c908STejun Heo #ifdef CONFIG_SCHED_CLASS_EXT 2511e196c908STejun Heo extern const struct sched_class ext_sched_class; 2512e196c908STejun Heo 2513e196c908STejun Heo DECLARE_STATIC_KEY_FALSE(__scx_ops_enabled); /* SCX BPF scheduler loaded */ 2514e196c908STejun Heo DECLARE_STATIC_KEY_FALSE(__scx_switched_all); /* all fair class tasks on SCX */ 2515e196c908STejun Heo 2516e196c908STejun Heo #define scx_enabled() static_branch_unlikely(&__scx_ops_enabled) 2517e196c908STejun Heo #define scx_switched_all() static_branch_unlikely(&__scx_switched_all) 2518e196c908STejun Heo #else /* !CONFIG_SCHED_CLASS_EXT */ 2519e196c908STejun Heo #define scx_enabled() false 2520e196c908STejun Heo #define scx_switched_all() false 2521e196c908STejun Heo #endif /* !CONFIG_SCHED_CLASS_EXT */ 2522e196c908STejun Heo 2523e196c908STejun Heo /* 2524e196c908STejun Heo * Iterate only active classes. SCX can take over all fair tasks or be 2525e196c908STejun Heo * completely disabled. If the former, skip fair. If the latter, skip SCX. 2526e196c908STejun Heo */ 2527e196c908STejun Heo static inline const struct sched_class *next_active_class(const struct sched_class *class) 2528e196c908STejun Heo { 2529e196c908STejun Heo class++; 2530e196c908STejun Heo #ifdef CONFIG_SCHED_CLASS_EXT 2531e196c908STejun Heo if (scx_switched_all() && class == &fair_sched_class) 2532e196c908STejun Heo class++; 2533e196c908STejun Heo if (!scx_enabled() && class == &ext_sched_class) 2534e196c908STejun Heo class++; 2535e196c908STejun Heo #endif 2536e196c908STejun Heo return class; 2537e196c908STejun Heo } 2538e196c908STejun Heo 25396e2df058SPeter Zijlstra #define for_class_range(class, _from, _to) \ 2540546a3feeSPeter Zijlstra for (class = (_from); class < (_to); class++) 25416e2df058SPeter Zijlstra 2542391e43daSPeter Zijlstra #define for_each_class(class) \ 2543546a3feeSPeter Zijlstra for_class_range(class, __sched_class_highest, __sched_class_lowest) 2544546a3feeSPeter Zijlstra 2545e196c908STejun Heo #define for_active_class_range(class, _from, _to) \ 2546e196c908STejun Heo for (class = (_from); class != (_to); class = next_active_class(class)) 2547391e43daSPeter Zijlstra 2548e196c908STejun Heo #define for_each_active_class(class) \ 2549e196c908STejun Heo for_active_class_range(class, __sched_class_highest, __sched_class_lowest) 2550e196c908STejun Heo 2551e196c908STejun Heo #define sched_class_above(_a, _b) ((_a) < (_b)) 2552391e43daSPeter Zijlstra 25536e2df058SPeter Zijlstra static inline bool sched_stop_runnable(struct rq *rq) 25546e2df058SPeter Zijlstra { 25556e2df058SPeter Zijlstra return rq->stop && task_on_rq_queued(rq->stop); 25566e2df058SPeter Zijlstra } 25576e2df058SPeter Zijlstra 25586e2df058SPeter Zijlstra static inline bool sched_dl_runnable(struct rq *rq) 25596e2df058SPeter Zijlstra { 25606e2df058SPeter Zijlstra return rq->dl.dl_nr_running > 0; 25616e2df058SPeter Zijlstra } 25626e2df058SPeter Zijlstra 25636e2df058SPeter Zijlstra static inline bool sched_rt_runnable(struct rq *rq) 25646e2df058SPeter Zijlstra { 25656e2df058SPeter Zijlstra return rq->rt.rt_queued > 0; 25666e2df058SPeter Zijlstra } 25676e2df058SPeter Zijlstra 25686e2df058SPeter Zijlstra static inline bool sched_fair_runnable(struct rq *rq) 25696e2df058SPeter Zijlstra { 25706e2df058SPeter Zijlstra return rq->cfs.nr_running > 0; 25716e2df058SPeter Zijlstra } 2572391e43daSPeter Zijlstra 25735d7d6056SPeter Zijlstra extern struct task_struct *pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf); 2574fd03c5b8SPeter Zijlstra extern struct task_struct *pick_task_idle(struct rq *rq); 25755d7d6056SPeter Zijlstra 2576af449901SPeter Zijlstra #define SCA_CHECK 0x01 2577af449901SPeter Zijlstra #define SCA_MIGRATE_DISABLE 0x02 2578af449901SPeter Zijlstra #define SCA_MIGRATE_ENABLE 0x04 257907ec77a1SWill Deacon #define SCA_USER 0x08 2580af449901SPeter Zijlstra 2581391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2582391e43daSPeter Zijlstra 258363b2ca30SNicolas Pitre extern void update_group_capacity(struct sched_domain *sd, int cpu); 2584b719203bSLi Zefan 2585983be062SIngo Molnar extern void sched_balance_trigger(struct rq *rq); 2586391e43daSPeter Zijlstra 258704746ed8SIngo Molnar extern int __set_cpus_allowed_ptr(struct task_struct *p, struct affinity_context *ctx); 2588713a2e21SWaiman Long extern void set_cpus_allowed_common(struct task_struct *p, struct affinity_context *ctx); 2589c5b28038SPeter Zijlstra 25902c390ddaSTejun Heo static inline bool task_allowed_on_cpu(struct task_struct *p, int cpu) 25912c390ddaSTejun Heo { 25922c390ddaSTejun Heo /* When not in the task's cpumask, no point in looking further. */ 25932c390ddaSTejun Heo if (!cpumask_test_cpu(cpu, p->cpus_ptr)) 25942c390ddaSTejun Heo return false; 25952c390ddaSTejun Heo 25962c390ddaSTejun Heo /* Can @cpu run a user thread? */ 25972c390ddaSTejun Heo if (!(p->flags & PF_KTHREAD) && !task_cpu_possible(cpu, p)) 25982c390ddaSTejun Heo return false; 25992c390ddaSTejun Heo 26002c390ddaSTejun Heo return true; 26012c390ddaSTejun Heo } 26022c390ddaSTejun Heo 260304746ed8SIngo Molnar static inline cpumask_t *alloc_user_cpus_ptr(int node) 260404746ed8SIngo Molnar { 260504746ed8SIngo Molnar /* 260604746ed8SIngo Molnar * See do_set_cpus_allowed() above for the rcu_head usage. 260704746ed8SIngo Molnar */ 260804746ed8SIngo Molnar int size = max_t(int, cpumask_size(), sizeof(struct rcu_head)); 260904746ed8SIngo Molnar 261004746ed8SIngo Molnar return kmalloc_node(size, GFP_KERNEL, node); 261104746ed8SIngo Molnar } 261204746ed8SIngo Molnar 2613a7c81556SPeter Zijlstra static inline struct task_struct *get_push_task(struct rq *rq) 2614a7c81556SPeter Zijlstra { 2615a7c81556SPeter Zijlstra struct task_struct *p = rq->curr; 2616a7c81556SPeter Zijlstra 26175cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 2618a7c81556SPeter Zijlstra 2619a7c81556SPeter Zijlstra if (rq->push_busy) 2620a7c81556SPeter Zijlstra return NULL; 2621a7c81556SPeter Zijlstra 2622a7c81556SPeter Zijlstra if (p->nr_cpus_allowed == 1) 2623a7c81556SPeter Zijlstra return NULL; 2624a7c81556SPeter Zijlstra 2625e681dcbaSSebastian Andrzej Siewior if (p->migration_disabled) 2626e681dcbaSSebastian Andrzej Siewior return NULL; 2627e681dcbaSSebastian Andrzej Siewior 2628a7c81556SPeter Zijlstra rq->push_busy = true; 2629a7c81556SPeter Zijlstra return get_task_struct(p); 2630a7c81556SPeter Zijlstra } 2631a7c81556SPeter Zijlstra 2632a7c81556SPeter Zijlstra extern int push_cpu_stop(void *arg); 2633dc877341SPeter Zijlstra 263404746ed8SIngo Molnar #else /* !CONFIG_SMP: */ 263504746ed8SIngo Molnar 26362c390ddaSTejun Heo static inline bool task_allowed_on_cpu(struct task_struct *p, int cpu) 26372c390ddaSTejun Heo { 26382c390ddaSTejun Heo return true; 26392c390ddaSTejun Heo } 26402c390ddaSTejun Heo 264104746ed8SIngo Molnar static inline int __set_cpus_allowed_ptr(struct task_struct *p, 264204746ed8SIngo Molnar struct affinity_context *ctx) 264304746ed8SIngo Molnar { 264404746ed8SIngo Molnar return set_cpus_allowed_ptr(p, ctx->new_mask); 264504746ed8SIngo Molnar } 264604746ed8SIngo Molnar 264704746ed8SIngo Molnar static inline cpumask_t *alloc_user_cpus_ptr(int node) 264804746ed8SIngo Molnar { 264904746ed8SIngo Molnar return NULL; 265004746ed8SIngo Molnar } 265104746ed8SIngo Molnar 265204746ed8SIngo Molnar #endif /* !CONFIG_SMP */ 2653391e43daSPeter Zijlstra 2654442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 2655127f6bf1SIngo Molnar 2656442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 2657442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 2658442bf3aaSDaniel Lezcano { 2659442bf3aaSDaniel Lezcano rq->idle_state = idle_state; 2660442bf3aaSDaniel Lezcano } 2661442bf3aaSDaniel Lezcano 2662442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 2663442bf3aaSDaniel Lezcano { 26649148a3a1SPeter Zijlstra SCHED_WARN_ON(!rcu_read_lock_held()); 266597fb7a0aSIngo Molnar 2666442bf3aaSDaniel Lezcano return rq->idle_state; 2667442bf3aaSDaniel Lezcano } 2668127f6bf1SIngo Molnar 2669127f6bf1SIngo Molnar #else /* !CONFIG_CPU_IDLE: */ 2670127f6bf1SIngo Molnar 2671442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 2672442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 2673442bf3aaSDaniel Lezcano { 2674442bf3aaSDaniel Lezcano } 2675442bf3aaSDaniel Lezcano 2676442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 2677442bf3aaSDaniel Lezcano { 2678442bf3aaSDaniel Lezcano return NULL; 2679442bf3aaSDaniel Lezcano } 2680127f6bf1SIngo Molnar 2681127f6bf1SIngo Molnar #endif /* !CONFIG_CPU_IDLE */ 2682442bf3aaSDaniel Lezcano 26838663effbSSteven Rostedt (VMware) extern void schedule_idle(void); 268422dc02f8SPeter Zijlstra asmlinkage void schedule_user(void); 26858663effbSSteven Rostedt (VMware) 2686391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 2687391e43daSPeter Zijlstra extern void sched_init_granularity(void); 2688391e43daSPeter Zijlstra extern void update_max_interval(void); 26891baca4ceSJuri Lelli 26901baca4ceSJuri Lelli extern void init_sched_dl_class(void); 2691391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 2692391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 2693391e43daSPeter Zijlstra 26948875125eSKirill Tkhai extern void resched_curr(struct rq *rq); 2695391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 2696391e43daSPeter Zijlstra 2697391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 2698d664e399SThomas Gleixner extern bool sched_rt_bandwidth_account(struct rt_rq *rt_rq); 2699391e43daSPeter Zijlstra 27009e07d45cSPeter Zijlstra extern void init_dl_entity(struct sched_dl_entity *dl_se); 2701aab03e05SDario Faggioli 2702c52f14d3SLuca Abeni #define BW_SHIFT 20 2703c52f14d3SLuca Abeni #define BW_UNIT (1 << BW_SHIFT) 27044da3abceSLuca Abeni #define RATIO_SHIFT 8 2705d505b8afSHuaixin Chang #define MAX_BW_BITS (64 - BW_SHIFT) 2706d505b8afSHuaixin Chang #define MAX_BW ((1ULL << MAX_BW_BITS) - 1) 2707127f6bf1SIngo Molnar 2708127f6bf1SIngo Molnar extern unsigned long to_ratio(u64 period, u64 runtime); 2709332ac17eSDario Faggioli 2710540247fbSYuyang Du extern void init_entity_runnable_average(struct sched_entity *se); 2711d0fe0b9cSDietmar Eggemann extern void post_init_entity_util_avg(struct task_struct *p); 2712a75cdaa9SAlex Shi 271376d92ac3SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 271476d92ac3SFrederic Weisbecker extern bool sched_can_stop_tick(struct rq *rq); 2715d84b3131SFrederic Weisbecker extern int __init sched_tick_offload_init(void); 271676d92ac3SFrederic Weisbecker 271776d92ac3SFrederic Weisbecker /* 271876d92ac3SFrederic Weisbecker * Tick may be needed by tasks in the runqueue depending on their policy and 271976d92ac3SFrederic Weisbecker * requirements. If tick is needed, lets send the target an IPI to kick it out of 272076d92ac3SFrederic Weisbecker * nohz mode if necessary. 272176d92ac3SFrederic Weisbecker */ 272276d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) 272376d92ac3SFrederic Weisbecker { 272421a6ee14SMiaohe Lin int cpu = cpu_of(rq); 272576d92ac3SFrederic Weisbecker 272676d92ac3SFrederic Weisbecker if (!tick_nohz_full_cpu(cpu)) 272776d92ac3SFrederic Weisbecker return; 272876d92ac3SFrederic Weisbecker 272976d92ac3SFrederic Weisbecker if (sched_can_stop_tick(rq)) 273076d92ac3SFrederic Weisbecker tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED); 273176d92ac3SFrederic Weisbecker else 273276d92ac3SFrederic Weisbecker tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED); 273376d92ac3SFrederic Weisbecker } 2734127f6bf1SIngo Molnar #else /* !CONFIG_NO_HZ_FULL: */ 2735d84b3131SFrederic Weisbecker static inline int sched_tick_offload_init(void) { return 0; } 273676d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) { } 2737127f6bf1SIngo Molnar #endif /* !CONFIG_NO_HZ_FULL */ 273876d92ac3SFrederic Weisbecker 273972465447SKirill Tkhai static inline void add_nr_running(struct rq *rq, unsigned count) 2740391e43daSPeter Zijlstra { 274172465447SKirill Tkhai unsigned prev_nr = rq->nr_running; 274272465447SKirill Tkhai 274372465447SKirill Tkhai rq->nr_running = prev_nr + count; 27449d246053SPhil Auld if (trace_sched_update_nr_running_tp_enabled()) { 27459d246053SPhil Auld call_trace_sched_update_nr_running(rq, count); 27469d246053SPhil Auld } 27479f3660c2SFrederic Weisbecker 27484486edd1STim Chen #ifdef CONFIG_SMP 27494475cd8bSIngo Molnar if (prev_nr < 2 && rq->nr_running >= 2) 27504475cd8bSIngo Molnar set_rd_overloaded(rq->rd, 1); 27513e184501SViresh Kumar #endif 27524486edd1STim Chen 275376d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 27544486edd1STim Chen } 2755391e43daSPeter Zijlstra 275672465447SKirill Tkhai static inline void sub_nr_running(struct rq *rq, unsigned count) 2757391e43daSPeter Zijlstra { 275872465447SKirill Tkhai rq->nr_running -= count; 27599d246053SPhil Auld if (trace_sched_update_nr_running_tp_enabled()) { 2760a1bd0685SPhil Auld call_trace_sched_update_nr_running(rq, -count); 27619d246053SPhil Auld } 27629d246053SPhil Auld 276376d92ac3SFrederic Weisbecker /* Check if we still need preemption */ 276476d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 2765391e43daSPeter Zijlstra } 2766391e43daSPeter Zijlstra 2767e8901061SPeter Zijlstra static inline void __block_task(struct rq *rq, struct task_struct *p) 2768e8901061SPeter Zijlstra { 2769e8901061SPeter Zijlstra WRITE_ONCE(p->on_rq, 0); 2770e8901061SPeter Zijlstra ASSERT_EXCLUSIVE_WRITER(p->on_rq); 2771e8901061SPeter Zijlstra if (p->sched_contributes_to_load) 2772e8901061SPeter Zijlstra rq->nr_uninterruptible++; 2773e8901061SPeter Zijlstra 2774e8901061SPeter Zijlstra if (p->in_iowait) { 2775e8901061SPeter Zijlstra atomic_inc(&rq->nr_iowait); 2776e8901061SPeter Zijlstra delayacct_blkio_start(); 2777e8901061SPeter Zijlstra } 2778e8901061SPeter Zijlstra } 2779e8901061SPeter Zijlstra 2780391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 2781391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 2782391e43daSPeter Zijlstra 2783e23edc86SIngo Molnar extern void wakeup_preempt(struct rq *rq, struct task_struct *p, int flags); 2784391e43daSPeter Zijlstra 2785c59862f8SVincent Guittot #ifdef CONFIG_PREEMPT_RT 2786c59862f8SVincent Guittot # define SCHED_NR_MIGRATE_BREAK 8 2787c59862f8SVincent Guittot #else 2788c59862f8SVincent Guittot # define SCHED_NR_MIGRATE_BREAK 32 2789c59862f8SVincent Guittot #endif 2790c59862f8SVincent Guittot 2791391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 2792391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 2793391e43daSPeter Zijlstra 2794e4ec3318SPeter Zijlstra extern unsigned int sysctl_sched_base_slice; 2795147f3efaSPeter Zijlstra 279618765447SHailong Liu #ifdef CONFIG_SCHED_DEBUG 279718765447SHailong Liu extern int sysctl_resched_latency_warn_ms; 279818765447SHailong Liu extern int sysctl_resched_latency_warn_once; 279918765447SHailong Liu 280018765447SHailong Liu extern unsigned int sysctl_sched_tunable_scaling; 280118765447SHailong Liu 280218765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_delay; 280318765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_period_min; 280418765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_period_max; 280518765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_size; 280633024536SHuang Ying extern unsigned int sysctl_numa_balancing_hot_threshold; 280718765447SHailong Liu #endif 280818765447SHailong Liu 2809391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 2810391e43daSPeter Zijlstra 2811391e43daSPeter Zijlstra /* 2812391e43daSPeter Zijlstra * Use hrtick when: 2813391e43daSPeter Zijlstra * - enabled by features 2814391e43daSPeter Zijlstra * - hrtimer is actually high res 2815391e43daSPeter Zijlstra */ 2816391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 2817391e43daSPeter Zijlstra { 2818391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 2819391e43daSPeter Zijlstra return 0; 2820391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 2821391e43daSPeter Zijlstra } 2822391e43daSPeter Zijlstra 2823e0ee463cSJuri Lelli static inline int hrtick_enabled_fair(struct rq *rq) 2824e0ee463cSJuri Lelli { 2825e0ee463cSJuri Lelli if (!sched_feat(HRTICK)) 2826e0ee463cSJuri Lelli return 0; 2827e0ee463cSJuri Lelli return hrtick_enabled(rq); 2828e0ee463cSJuri Lelli } 2829e0ee463cSJuri Lelli 2830e0ee463cSJuri Lelli static inline int hrtick_enabled_dl(struct rq *rq) 2831e0ee463cSJuri Lelli { 2832e0ee463cSJuri Lelli if (!sched_feat(HRTICK_DL)) 2833e0ee463cSJuri Lelli return 0; 2834e0ee463cSJuri Lelli return hrtick_enabled(rq); 2835e0ee463cSJuri Lelli } 2836e0ee463cSJuri Lelli 2837127f6bf1SIngo Molnar extern void hrtick_start(struct rq *rq, u64 delay); 2838391e43daSPeter Zijlstra 2839127f6bf1SIngo Molnar #else /* !CONFIG_SCHED_HRTICK: */ 2840b39e66eaSMike Galbraith 2841e0ee463cSJuri Lelli static inline int hrtick_enabled_fair(struct rq *rq) 2842e0ee463cSJuri Lelli { 2843e0ee463cSJuri Lelli return 0; 2844e0ee463cSJuri Lelli } 2845e0ee463cSJuri Lelli 2846e0ee463cSJuri Lelli static inline int hrtick_enabled_dl(struct rq *rq) 2847e0ee463cSJuri Lelli { 2848e0ee463cSJuri Lelli return 0; 2849e0ee463cSJuri Lelli } 2850e0ee463cSJuri Lelli 2851b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 2852b39e66eaSMike Galbraith { 2853b39e66eaSMike Galbraith return 0; 2854b39e66eaSMike Galbraith } 2855b39e66eaSMike Galbraith 2856127f6bf1SIngo Molnar #endif /* !CONFIG_SCHED_HRTICK */ 2857391e43daSPeter Zijlstra 28581567c3e3SGiovanni Gherdovich #ifndef arch_scale_freq_tick 2859127f6bf1SIngo Molnar static __always_inline void arch_scale_freq_tick(void) { } 28601567c3e3SGiovanni Gherdovich #endif 28611567c3e3SGiovanni Gherdovich 2862dfbca41fSPeter Zijlstra #ifndef arch_scale_freq_capacity 2863f4470cdfSValentin Schneider /** 2864f4470cdfSValentin Schneider * arch_scale_freq_capacity - get the frequency scale factor of a given CPU. 2865f4470cdfSValentin Schneider * @cpu: the CPU in question. 2866f4470cdfSValentin Schneider * 2867f4470cdfSValentin Schneider * Return: the frequency scale factor normalized against SCHED_CAPACITY_SCALE, i.e. 2868f4470cdfSValentin Schneider * 2869f4470cdfSValentin Schneider * f_curr 2870f4470cdfSValentin Schneider * ------ * SCHED_CAPACITY_SCALE 2871f4470cdfSValentin Schneider * f_max 2872f4470cdfSValentin Schneider */ 2873dfbca41fSPeter Zijlstra static __always_inline 28747673c8a4SJuri Lelli unsigned long arch_scale_freq_capacity(int cpu) 2875dfbca41fSPeter Zijlstra { 2876dfbca41fSPeter Zijlstra return SCHED_CAPACITY_SCALE; 2877dfbca41fSPeter Zijlstra } 2878dfbca41fSPeter Zijlstra #endif 2879b5b4860dSVincent Guittot 28802679a837SHao Jia #ifdef CONFIG_SCHED_DEBUG 28812679a837SHao Jia /* 28822679a837SHao Jia * In double_lock_balance()/double_rq_lock(), we use raw_spin_rq_lock() to 28832679a837SHao Jia * acquire rq lock instead of rq_lock(). So at the end of these two functions 28842679a837SHao Jia * we need to call double_rq_clock_clear_update() to clear RQCF_UPDATED of 28852679a837SHao Jia * rq->clock_update_flags to avoid the WARN_DOUBLE_CLOCK warning. 28862679a837SHao Jia */ 28872679a837SHao Jia static inline void double_rq_clock_clear_update(struct rq *rq1, struct rq *rq2) 28882679a837SHao Jia { 28892679a837SHao Jia rq1->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 28902679a837SHao Jia /* rq1 == rq2 for !CONFIG_SMP, so just clear RQCF_UPDATED once. */ 28912679a837SHao Jia #ifdef CONFIG_SMP 28922679a837SHao Jia rq2->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 28932679a837SHao Jia #endif 28942679a837SHao Jia } 28952679a837SHao Jia #else 28962679a837SHao Jia static inline void double_rq_clock_clear_update(struct rq *rq1, struct rq *rq2) { } 28972679a837SHao Jia #endif 2898391e43daSPeter Zijlstra 28995bb76f1dSPeter Zijlstra #define DEFINE_LOCK_GUARD_2(name, type, _lock, _unlock, ...) \ 29005bb76f1dSPeter Zijlstra __DEFINE_UNLOCK_GUARD(name, type, _unlock, type *lock2; __VA_ARGS__) \ 29015bb76f1dSPeter Zijlstra static inline class_##name##_t class_##name##_constructor(type *lock, type *lock2) \ 29025bb76f1dSPeter Zijlstra { class_##name##_t _t = { .lock = lock, .lock2 = lock2 }, *_T = &_t; \ 29035bb76f1dSPeter Zijlstra _lock; return _t; } 29045bb76f1dSPeter Zijlstra 2905d66f1b06SPeter Zijlstra #ifdef CONFIG_SMP 2906d66f1b06SPeter Zijlstra 2907d66f1b06SPeter Zijlstra static inline bool rq_order_less(struct rq *rq1, struct rq *rq2) 2908d66f1b06SPeter Zijlstra { 29099edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 29109edeaea1SPeter Zijlstra /* 29119edeaea1SPeter Zijlstra * In order to not have {0,2},{1,3} turn into into an AB-BA, 29129edeaea1SPeter Zijlstra * order by core-id first and cpu-id second. 29139edeaea1SPeter Zijlstra * 29149edeaea1SPeter Zijlstra * Notably: 29159edeaea1SPeter Zijlstra * 29169edeaea1SPeter Zijlstra * double_rq_lock(0,3); will take core-0, core-1 lock 29179edeaea1SPeter Zijlstra * double_rq_lock(1,2); will take core-1, core-0 lock 29189edeaea1SPeter Zijlstra * 29199edeaea1SPeter Zijlstra * when only cpu-id is considered. 29209edeaea1SPeter Zijlstra */ 29219edeaea1SPeter Zijlstra if (rq1->core->cpu < rq2->core->cpu) 29229edeaea1SPeter Zijlstra return true; 29239edeaea1SPeter Zijlstra if (rq1->core->cpu > rq2->core->cpu) 29249edeaea1SPeter Zijlstra return false; 29259edeaea1SPeter Zijlstra 29269edeaea1SPeter Zijlstra /* 29279edeaea1SPeter Zijlstra * __sched_core_flip() relies on SMT having cpu-id lock order. 29289edeaea1SPeter Zijlstra */ 29299edeaea1SPeter Zijlstra #endif 2930d66f1b06SPeter Zijlstra return rq1->cpu < rq2->cpu; 2931d66f1b06SPeter Zijlstra } 2932d66f1b06SPeter Zijlstra 2933d66f1b06SPeter Zijlstra extern void double_rq_lock(struct rq *rq1, struct rq *rq2); 2934d66f1b06SPeter Zijlstra 2935d66f1b06SPeter Zijlstra #ifdef CONFIG_PREEMPTION 2936391e43daSPeter Zijlstra 2937391e43daSPeter Zijlstra /* 2938391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 2939391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 2940391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 2941391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 2942391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 2943391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 2944391e43daSPeter Zijlstra */ 2945391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 2946391e43daSPeter Zijlstra __releases(this_rq->lock) 2947391e43daSPeter Zijlstra __acquires(busiest->lock) 2948391e43daSPeter Zijlstra __acquires(this_rq->lock) 2949391e43daSPeter Zijlstra { 29505cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(this_rq); 2951391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 2952391e43daSPeter Zijlstra 2953391e43daSPeter Zijlstra return 1; 2954391e43daSPeter Zijlstra } 2955391e43daSPeter Zijlstra 2956127f6bf1SIngo Molnar #else /* !CONFIG_PREEMPTION: */ 2957391e43daSPeter Zijlstra /* 2958391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 2959391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 296097fb7a0aSIngo Molnar * already in proper order on entry. This favors lower CPU-ids and will 296197fb7a0aSIngo Molnar * grant the double lock to lower CPUs over higher ids under contention, 2962391e43daSPeter Zijlstra * regardless of entry order into the function. 2963391e43daSPeter Zijlstra */ 2964391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 2965391e43daSPeter Zijlstra __releases(this_rq->lock) 2966391e43daSPeter Zijlstra __acquires(busiest->lock) 2967391e43daSPeter Zijlstra __acquires(this_rq->lock) 2968391e43daSPeter Zijlstra { 29692679a837SHao Jia if (__rq_lockp(this_rq) == __rq_lockp(busiest) || 29702679a837SHao Jia likely(raw_spin_rq_trylock(busiest))) { 29712679a837SHao Jia double_rq_clock_clear_update(this_rq, busiest); 29725cb9eaa3SPeter Zijlstra return 0; 29732679a837SHao Jia } 29745cb9eaa3SPeter Zijlstra 2975d66f1b06SPeter Zijlstra if (rq_order_less(this_rq, busiest)) { 29765cb9eaa3SPeter Zijlstra raw_spin_rq_lock_nested(busiest, SINGLE_DEPTH_NESTING); 29772679a837SHao Jia double_rq_clock_clear_update(this_rq, busiest); 29785cb9eaa3SPeter Zijlstra return 0; 2979391e43daSPeter Zijlstra } 29805cb9eaa3SPeter Zijlstra 29815cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(this_rq); 2982d66f1b06SPeter Zijlstra double_rq_lock(this_rq, busiest); 29835cb9eaa3SPeter Zijlstra 29845cb9eaa3SPeter Zijlstra return 1; 2985391e43daSPeter Zijlstra } 2986391e43daSPeter Zijlstra 2987127f6bf1SIngo Molnar #endif /* !CONFIG_PREEMPTION */ 2988391e43daSPeter Zijlstra 2989391e43daSPeter Zijlstra /* 2990391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 2991391e43daSPeter Zijlstra */ 2992391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 2993391e43daSPeter Zijlstra { 29945cb9eaa3SPeter Zijlstra lockdep_assert_irqs_disabled(); 2995391e43daSPeter Zijlstra 2996391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 2997391e43daSPeter Zijlstra } 2998391e43daSPeter Zijlstra 2999391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 3000391e43daSPeter Zijlstra __releases(busiest->lock) 3001391e43daSPeter Zijlstra { 30029ef7e7e3SPeter Zijlstra if (__rq_lockp(this_rq) != __rq_lockp(busiest)) 30035cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(busiest); 30049ef7e7e3SPeter Zijlstra lock_set_subclass(&__rq_lockp(this_rq)->dep_map, 0, _RET_IP_); 3005391e43daSPeter Zijlstra } 3006391e43daSPeter Zijlstra 300774602315SPeter Zijlstra static inline void double_lock(spinlock_t *l1, spinlock_t *l2) 300874602315SPeter Zijlstra { 300974602315SPeter Zijlstra if (l1 > l2) 301074602315SPeter Zijlstra swap(l1, l2); 301174602315SPeter Zijlstra 301274602315SPeter Zijlstra spin_lock(l1); 301374602315SPeter Zijlstra spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 301474602315SPeter Zijlstra } 301574602315SPeter Zijlstra 301660e69eedSMike Galbraith static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2) 301760e69eedSMike Galbraith { 301860e69eedSMike Galbraith if (l1 > l2) 301960e69eedSMike Galbraith swap(l1, l2); 302060e69eedSMike Galbraith 302160e69eedSMike Galbraith spin_lock_irq(l1); 302260e69eedSMike Galbraith spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 302360e69eedSMike Galbraith } 302460e69eedSMike Galbraith 302574602315SPeter Zijlstra static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) 302674602315SPeter Zijlstra { 302774602315SPeter Zijlstra if (l1 > l2) 302874602315SPeter Zijlstra swap(l1, l2); 302974602315SPeter Zijlstra 303074602315SPeter Zijlstra raw_spin_lock(l1); 303174602315SPeter Zijlstra raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 303274602315SPeter Zijlstra } 303374602315SPeter Zijlstra 30345bb76f1dSPeter Zijlstra static inline void double_raw_unlock(raw_spinlock_t *l1, raw_spinlock_t *l2) 30355bb76f1dSPeter Zijlstra { 30365bb76f1dSPeter Zijlstra raw_spin_unlock(l1); 30375bb76f1dSPeter Zijlstra raw_spin_unlock(l2); 30385bb76f1dSPeter Zijlstra } 30395bb76f1dSPeter Zijlstra 30405bb76f1dSPeter Zijlstra DEFINE_LOCK_GUARD_2(double_raw_spinlock, raw_spinlock_t, 30415bb76f1dSPeter Zijlstra double_raw_lock(_T->lock, _T->lock2), 30425bb76f1dSPeter Zijlstra double_raw_unlock(_T->lock, _T->lock2)) 30435bb76f1dSPeter Zijlstra 3044391e43daSPeter Zijlstra /* 3045391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 3046391e43daSPeter Zijlstra * 3047391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 3048391e43daSPeter Zijlstra * you need to do so manually after calling. 3049391e43daSPeter Zijlstra */ 3050391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 3051391e43daSPeter Zijlstra __releases(rq1->lock) 3052391e43daSPeter Zijlstra __releases(rq2->lock) 3053391e43daSPeter Zijlstra { 30549ef7e7e3SPeter Zijlstra if (__rq_lockp(rq1) != __rq_lockp(rq2)) 30555cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq2); 3056391e43daSPeter Zijlstra else 3057391e43daSPeter Zijlstra __release(rq2->lock); 3058d66f1b06SPeter Zijlstra raw_spin_rq_unlock(rq1); 3059391e43daSPeter Zijlstra } 3060391e43daSPeter Zijlstra 3061f2cb1360SIngo Molnar extern void set_rq_online (struct rq *rq); 3062f2cb1360SIngo Molnar extern void set_rq_offline(struct rq *rq); 3063127f6bf1SIngo Molnar 3064f2cb1360SIngo Molnar extern bool sched_smp_initialized; 3065f2cb1360SIngo Molnar 3066127f6bf1SIngo Molnar #else /* !CONFIG_SMP: */ 3067391e43daSPeter Zijlstra 3068391e43daSPeter Zijlstra /* 3069391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 3070391e43daSPeter Zijlstra * 3071391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 3072391e43daSPeter Zijlstra * you need to do so manually before calling. 3073391e43daSPeter Zijlstra */ 3074391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 3075391e43daSPeter Zijlstra __acquires(rq1->lock) 3076391e43daSPeter Zijlstra __acquires(rq2->lock) 3077391e43daSPeter Zijlstra { 307809348d75SIngo Molnar WARN_ON_ONCE(!irqs_disabled()); 307909348d75SIngo Molnar WARN_ON_ONCE(rq1 != rq2); 30805cb9eaa3SPeter Zijlstra raw_spin_rq_lock(rq1); 3081391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 30822679a837SHao Jia double_rq_clock_clear_update(rq1, rq2); 3083391e43daSPeter Zijlstra } 3084391e43daSPeter Zijlstra 3085391e43daSPeter Zijlstra /* 3086391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 3087391e43daSPeter Zijlstra * 3088391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 3089391e43daSPeter Zijlstra * you need to do so manually after calling. 3090391e43daSPeter Zijlstra */ 3091391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 3092391e43daSPeter Zijlstra __releases(rq1->lock) 3093391e43daSPeter Zijlstra __releases(rq2->lock) 3094391e43daSPeter Zijlstra { 309509348d75SIngo Molnar WARN_ON_ONCE(rq1 != rq2); 30965cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq1); 3097391e43daSPeter Zijlstra __release(rq2->lock); 3098391e43daSPeter Zijlstra } 3099391e43daSPeter Zijlstra 3100127f6bf1SIngo Molnar #endif /* !CONFIG_SMP */ 3101391e43daSPeter Zijlstra 31025bb76f1dSPeter Zijlstra DEFINE_LOCK_GUARD_2(double_rq_lock, struct rq, 31035bb76f1dSPeter Zijlstra double_rq_lock(_T->lock, _T->lock2), 31045bb76f1dSPeter Zijlstra double_rq_unlock(_T->lock, _T->lock2)) 31055bb76f1dSPeter Zijlstra 31062227a957SAbel Wu extern struct sched_entity *__pick_root_entity(struct cfs_rq *cfs_rq); 3107391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 3108391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 31096b55c965SSrikar Dronamraju 31106b55c965SSrikar Dronamraju #ifdef CONFIG_SCHED_DEBUG 31119406415fSPeter Zijlstra extern bool sched_debug_verbose; 31129469eb01SPeter Zijlstra 3113391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 3114391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 3115acb32132SWanpeng Li extern void print_dl_stats(struct seq_file *m, int cpu); 3116f6a34630SMathieu Malaterre extern void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq); 3117f6a34630SMathieu Malaterre extern void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq); 3118f6a34630SMathieu Malaterre extern void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq); 3119c006fac5SPaul Turner 3120c006fac5SPaul Turner extern void resched_latency_warn(int cpu, u64 latency); 3121397f2378SSrikar Dronamraju # ifdef CONFIG_NUMA_BALANCING 3122127f6bf1SIngo Molnar extern void show_numa_stats(struct task_struct *p, struct seq_file *m); 3123397f2378SSrikar Dronamraju extern void 3124397f2378SSrikar Dronamraju print_numa_stats(struct seq_file *m, int node, unsigned long tsf, 3125397f2378SSrikar Dronamraju unsigned long tpf, unsigned long gsf, unsigned long gpf); 3126397f2378SSrikar Dronamraju # endif /* CONFIG_NUMA_BALANCING */ 3127127f6bf1SIngo Molnar #else /* !CONFIG_SCHED_DEBUG: */ 3128c006fac5SPaul Turner static inline void resched_latency_warn(int cpu, u64 latency) { } 3129127f6bf1SIngo Molnar #endif /* !CONFIG_SCHED_DEBUG */ 3130391e43daSPeter Zijlstra 3131391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 313207c54f7aSAbel Vesa extern void init_rt_rq(struct rt_rq *rt_rq); 313307c54f7aSAbel Vesa extern void init_dl_rq(struct dl_rq *dl_rq); 3134391e43daSPeter Zijlstra 31351ee14e6cSBen Segall extern void cfs_bandwidth_usage_inc(void); 31361ee14e6cSBen Segall extern void cfs_bandwidth_usage_dec(void); 31371c792db7SSuresh Siddha 31383451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 3139127f6bf1SIngo Molnar 314000357f5eSPeter Zijlstra #define NOHZ_BALANCE_KICK_BIT 0 314100357f5eSPeter Zijlstra #define NOHZ_STATS_KICK_BIT 1 3142c6f88654SVincent Guittot #define NOHZ_NEWILB_KICK_BIT 2 3143efd984c4SValentin Schneider #define NOHZ_NEXT_KICK_BIT 3 3144a22e47a4SPeter Zijlstra 314514ff4dbdSIngo Molnar /* Run sched_balance_domains() */ 3146a22e47a4SPeter Zijlstra #define NOHZ_BALANCE_KICK BIT(NOHZ_BALANCE_KICK_BIT) 3147efd984c4SValentin Schneider /* Update blocked load */ 3148b7031a02SPeter Zijlstra #define NOHZ_STATS_KICK BIT(NOHZ_STATS_KICK_BIT) 3149efd984c4SValentin Schneider /* Update blocked load when entering idle */ 3150c6f88654SVincent Guittot #define NOHZ_NEWILB_KICK BIT(NOHZ_NEWILB_KICK_BIT) 3151efd984c4SValentin Schneider /* Update nohz.next_balance */ 3152efd984c4SValentin Schneider #define NOHZ_NEXT_KICK BIT(NOHZ_NEXT_KICK_BIT) 3153b7031a02SPeter Zijlstra 3154efd984c4SValentin Schneider #define NOHZ_KICK_MASK (NOHZ_BALANCE_KICK | NOHZ_STATS_KICK | NOHZ_NEXT_KICK) 31551c792db7SSuresh Siddha 31561c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 315720a5c8ccSThomas Gleixner 315800357f5eSPeter Zijlstra extern void nohz_balance_exit_idle(struct rq *rq); 3159127f6bf1SIngo Molnar #else /* !CONFIG_NO_HZ_COMMON: */ 316000357f5eSPeter Zijlstra static inline void nohz_balance_exit_idle(struct rq *rq) { } 3161127f6bf1SIngo Molnar #endif /* !CONFIG_NO_HZ_COMMON */ 316273fbec60SFrederic Weisbecker 3163c6f88654SVincent Guittot #if defined(CONFIG_SMP) && defined(CONFIG_NO_HZ_COMMON) 3164c6f88654SVincent Guittot extern void nohz_run_idle_balance(int cpu); 3165c6f88654SVincent Guittot #else 3166c6f88654SVincent Guittot static inline void nohz_run_idle_balance(int cpu) { } 3167c6f88654SVincent Guittot #endif 3168daec5798SLuca Abeni 316973fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 3170127f6bf1SIngo Molnar 317119d23dbfSFrederic Weisbecker struct irqtime { 317225e2d8c1SFrederic Weisbecker u64 total; 3173a499a5a1SFrederic Weisbecker u64 tick_delta; 317419d23dbfSFrederic Weisbecker u64 irq_start_time; 317519d23dbfSFrederic Weisbecker struct u64_stats_sync sync; 317619d23dbfSFrederic Weisbecker }; 317773fbec60SFrederic Weisbecker 317819d23dbfSFrederic Weisbecker DECLARE_PER_CPU(struct irqtime, cpu_irqtime); 317973fbec60SFrederic Weisbecker 318025e2d8c1SFrederic Weisbecker /* 318125e2d8c1SFrederic Weisbecker * Returns the irqtime minus the softirq time computed by ksoftirqd. 31823b03706fSIngo Molnar * Otherwise ksoftirqd's sum_exec_runtime is subtracted its own runtime 318325e2d8c1SFrederic Weisbecker * and never move forward. 318425e2d8c1SFrederic Weisbecker */ 318573fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 318673fbec60SFrederic Weisbecker { 318719d23dbfSFrederic Weisbecker struct irqtime *irqtime = &per_cpu(cpu_irqtime, cpu); 318819d23dbfSFrederic Weisbecker unsigned int seq; 318919d23dbfSFrederic Weisbecker u64 total; 319073fbec60SFrederic Weisbecker 319173fbec60SFrederic Weisbecker do { 319219d23dbfSFrederic Weisbecker seq = __u64_stats_fetch_begin(&irqtime->sync); 319325e2d8c1SFrederic Weisbecker total = irqtime->total; 319419d23dbfSFrederic Weisbecker } while (__u64_stats_fetch_retry(&irqtime->sync, seq)); 319573fbec60SFrederic Weisbecker 319619d23dbfSFrederic Weisbecker return total; 319773fbec60SFrederic Weisbecker } 3198127f6bf1SIngo Molnar 319973fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 3200adaf9fcdSRafael J. Wysocki 3201adaf9fcdSRafael J. Wysocki #ifdef CONFIG_CPU_FREQ 3202127f6bf1SIngo Molnar 3203b10abd0aSJoel Fernandes (Google) DECLARE_PER_CPU(struct update_util_data __rcu *, cpufreq_update_util_data); 3204adaf9fcdSRafael J. Wysocki 3205adaf9fcdSRafael J. Wysocki /** 3206adaf9fcdSRafael J. Wysocki * cpufreq_update_util - Take a note about CPU utilization changes. 320712bde33dSRafael J. Wysocki * @rq: Runqueue to carry out the update for. 320858919e83SRafael J. Wysocki * @flags: Update reason flags. 3209adaf9fcdSRafael J. Wysocki * 321058919e83SRafael J. Wysocki * This function is called by the scheduler on the CPU whose utilization is 321158919e83SRafael J. Wysocki * being updated. 3212adaf9fcdSRafael J. Wysocki * 3213adaf9fcdSRafael J. Wysocki * It can only be called from RCU-sched read-side critical sections. 3214adaf9fcdSRafael J. Wysocki * 3215adaf9fcdSRafael J. Wysocki * The way cpufreq is currently arranged requires it to evaluate the CPU 3216adaf9fcdSRafael J. Wysocki * performance state (frequency/voltage) on a regular basis to prevent it from 3217adaf9fcdSRafael J. Wysocki * being stuck in a completely inadequate performance level for too long. 3218e0367b12SJuri Lelli * That is not guaranteed to happen if the updates are only triggered from CFS 3219e0367b12SJuri Lelli * and DL, though, because they may not be coming in if only RT tasks are 3220e0367b12SJuri Lelli * active all the time (or there are RT tasks only). 3221adaf9fcdSRafael J. Wysocki * 3222e0367b12SJuri Lelli * As a workaround for that issue, this function is called periodically by the 3223e0367b12SJuri Lelli * RT sched class to trigger extra cpufreq updates to prevent it from stalling, 3224adaf9fcdSRafael J. Wysocki * but that really is a band-aid. Going forward it should be replaced with 3225e0367b12SJuri Lelli * solutions targeted more specifically at RT tasks. 3226adaf9fcdSRafael J. Wysocki */ 322712bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) 3228adaf9fcdSRafael J. Wysocki { 322958919e83SRafael J. Wysocki struct update_util_data *data; 323058919e83SRafael J. Wysocki 3231674e7541SViresh Kumar data = rcu_dereference_sched(*per_cpu_ptr(&cpufreq_update_util_data, 3232674e7541SViresh Kumar cpu_of(rq))); 323358919e83SRafael J. Wysocki if (data) 323412bde33dSRafael J. Wysocki data->func(data, rq_clock(rq), flags); 323512bde33dSRafael J. Wysocki } 3236127f6bf1SIngo Molnar #else /* !CONFIG_CPU_FREQ: */ 323712bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) { } 3238127f6bf1SIngo Molnar #endif /* !CONFIG_CPU_FREQ */ 3239be53f58fSLinus Torvalds 32409bdcb44eSRafael J. Wysocki #ifdef arch_scale_freq_capacity 32419bdcb44eSRafael J. Wysocki # ifndef arch_scale_freq_invariant 324297fb7a0aSIngo Molnar # define arch_scale_freq_invariant() true 32439bdcb44eSRafael J. Wysocki # endif 324497fb7a0aSIngo Molnar #else 324597fb7a0aSIngo Molnar # define arch_scale_freq_invariant() false 32469bdcb44eSRafael J. Wysocki #endif 3247d4edd662SJuri Lelli 324810a35e68SVincent Guittot #ifdef CONFIG_SMP 3249127f6bf1SIngo Molnar 3250a5418be9SViresh Kumar unsigned long effective_cpu_util(int cpu, unsigned long util_cfs, 32519c0b4bb7SVincent Guittot unsigned long *min, 32529c0b4bb7SVincent Guittot unsigned long *max); 32539c0b4bb7SVincent Guittot 32549c0b4bb7SVincent Guittot unsigned long sugov_effective_cpu_perf(int cpu, unsigned long actual, 32559c0b4bb7SVincent Guittot unsigned long min, 32569c0b4bb7SVincent Guittot unsigned long max); 32579c0b4bb7SVincent Guittot 3258938e5e4bSQuentin Perret 3259b3f53daaSDietmar Eggemann /* 3260b3f53daaSDietmar Eggemann * Verify the fitness of task @p to run on @cpu taking into account the 3261b3f53daaSDietmar Eggemann * CPU original capacity and the runtime/deadline ratio of the task. 3262b3f53daaSDietmar Eggemann * 3263b3f53daaSDietmar Eggemann * The function will return true if the original capacity of @cpu is 3264b3f53daaSDietmar Eggemann * greater than or equal to task's deadline density right shifted by 3265b3f53daaSDietmar Eggemann * (BW_SHIFT - SCHED_CAPACITY_SHIFT) and false otherwise. 3266b3f53daaSDietmar Eggemann */ 3267b3f53daaSDietmar Eggemann static inline bool dl_task_fits_capacity(struct task_struct *p, int cpu) 3268b3f53daaSDietmar Eggemann { 3269b3f53daaSDietmar Eggemann unsigned long cap = arch_scale_cpu_capacity(cpu); 3270b3f53daaSDietmar Eggemann 3271b3f53daaSDietmar Eggemann return cap >= p->dl.dl_density >> (BW_SHIFT - SCHED_CAPACITY_SHIFT); 3272b3f53daaSDietmar Eggemann } 3273b3f53daaSDietmar Eggemann 32748cc90515SVincent Guittot static inline unsigned long cpu_bw_dl(struct rq *rq) 3275d4edd662SJuri Lelli { 3276d4edd662SJuri Lelli return (rq->dl.running_bw * SCHED_CAPACITY_SCALE) >> BW_SHIFT; 3277d4edd662SJuri Lelli } 3278d4edd662SJuri Lelli 32798cc90515SVincent Guittot static inline unsigned long cpu_util_dl(struct rq *rq) 32808cc90515SVincent Guittot { 32818cc90515SVincent Guittot return READ_ONCE(rq->avg_dl.util_avg); 32828cc90515SVincent Guittot } 32838cc90515SVincent Guittot 328482762d2aSDietmar Eggemann 32853eb6d6ecSDietmar Eggemann extern unsigned long cpu_util_cfs(int cpu); 32867d0583cfSDietmar Eggemann extern unsigned long cpu_util_cfs_boost(int cpu); 3287371bf427SVincent Guittot 3288371bf427SVincent Guittot static inline unsigned long cpu_util_rt(struct rq *rq) 3289371bf427SVincent Guittot { 3290dfa444dcSVincent Guittot return READ_ONCE(rq->avg_rt.util_avg); 3291371bf427SVincent Guittot } 3292127f6bf1SIngo Molnar 329396fd6c65STejun Heo #else /* !CONFIG_SMP */ 329496fd6c65STejun Heo static inline bool update_other_load_avgs(struct rq *rq) { return false; } 3295127f6bf1SIngo Molnar #endif /* CONFIG_SMP */ 32969033ea11SVincent Guittot 32977a17e1dbSQais Yousef #ifdef CONFIG_UCLAMP_TASK 3298127f6bf1SIngo Molnar 32997a17e1dbSQais Yousef unsigned long uclamp_eff_value(struct task_struct *p, enum uclamp_id clamp_id); 33007a17e1dbSQais Yousef 330124422603SQais Yousef static inline unsigned long uclamp_rq_get(struct rq *rq, 330224422603SQais Yousef enum uclamp_id clamp_id) 330324422603SQais Yousef { 330424422603SQais Yousef return READ_ONCE(rq->uclamp[clamp_id].value); 330524422603SQais Yousef } 330624422603SQais Yousef 330724422603SQais Yousef static inline void uclamp_rq_set(struct rq *rq, enum uclamp_id clamp_id, 330824422603SQais Yousef unsigned int value) 330924422603SQais Yousef { 331024422603SQais Yousef WRITE_ONCE(rq->uclamp[clamp_id].value, value); 331124422603SQais Yousef } 331224422603SQais Yousef 331324422603SQais Yousef static inline bool uclamp_rq_is_idle(struct rq *rq) 331424422603SQais Yousef { 331524422603SQais Yousef return rq->uclamp_flags & UCLAMP_FLAG_IDLE; 331624422603SQais Yousef } 331724422603SQais Yousef 33187a17e1dbSQais Yousef /* Is the rq being capped/throttled by uclamp_max? */ 33197a17e1dbSQais Yousef static inline bool uclamp_rq_is_capped(struct rq *rq) 33207a17e1dbSQais Yousef { 33217a17e1dbSQais Yousef unsigned long rq_util; 33227a17e1dbSQais Yousef unsigned long max_util; 33237a17e1dbSQais Yousef 33247a17e1dbSQais Yousef if (!static_branch_likely(&sched_uclamp_used)) 33257a17e1dbSQais Yousef return false; 33267a17e1dbSQais Yousef 33277a17e1dbSQais Yousef rq_util = cpu_util_cfs(cpu_of(rq)) + cpu_util_rt(rq); 33287a17e1dbSQais Yousef max_util = READ_ONCE(rq->uclamp[UCLAMP_MAX].value); 33297a17e1dbSQais Yousef 33307a17e1dbSQais Yousef return max_util != SCHED_CAPACITY_SCALE && rq_util >= max_util; 33317a17e1dbSQais Yousef } 33327a17e1dbSQais Yousef 33337a17e1dbSQais Yousef /* 33347a17e1dbSQais Yousef * When uclamp is compiled in, the aggregation at rq level is 'turned off' 33357a17e1dbSQais Yousef * by default in the fast path and only gets turned on once userspace performs 33367a17e1dbSQais Yousef * an operation that requires it. 33377a17e1dbSQais Yousef * 33387a17e1dbSQais Yousef * Returns true if userspace opted-in to use uclamp and aggregation at rq level 33397a17e1dbSQais Yousef * hence is active. 33407a17e1dbSQais Yousef */ 33417a17e1dbSQais Yousef static inline bool uclamp_is_used(void) 33427a17e1dbSQais Yousef { 33437a17e1dbSQais Yousef return static_branch_likely(&sched_uclamp_used); 33447a17e1dbSQais Yousef } 334504746ed8SIngo Molnar 334604746ed8SIngo Molnar #define for_each_clamp_id(clamp_id) \ 334704746ed8SIngo Molnar for ((clamp_id) = 0; (clamp_id) < UCLAMP_CNT; (clamp_id)++) 334804746ed8SIngo Molnar 334904746ed8SIngo Molnar extern unsigned int sysctl_sched_uclamp_util_min_rt_default; 335004746ed8SIngo Molnar 335104746ed8SIngo Molnar 335204746ed8SIngo Molnar static inline unsigned int uclamp_none(enum uclamp_id clamp_id) 335304746ed8SIngo Molnar { 335404746ed8SIngo Molnar if (clamp_id == UCLAMP_MIN) 335504746ed8SIngo Molnar return 0; 335604746ed8SIngo Molnar return SCHED_CAPACITY_SCALE; 335704746ed8SIngo Molnar } 335804746ed8SIngo Molnar 335904746ed8SIngo Molnar /* Integer rounded range for each bucket */ 336004746ed8SIngo Molnar #define UCLAMP_BUCKET_DELTA DIV_ROUND_CLOSEST(SCHED_CAPACITY_SCALE, UCLAMP_BUCKETS) 336104746ed8SIngo Molnar 336204746ed8SIngo Molnar static inline unsigned int uclamp_bucket_id(unsigned int clamp_value) 336304746ed8SIngo Molnar { 336404746ed8SIngo Molnar return min_t(unsigned int, clamp_value / UCLAMP_BUCKET_DELTA, UCLAMP_BUCKETS - 1); 336504746ed8SIngo Molnar } 336604746ed8SIngo Molnar 3367127f6bf1SIngo Molnar static inline void 3368127f6bf1SIngo Molnar uclamp_se_set(struct uclamp_se *uc_se, unsigned int value, bool user_defined) 336904746ed8SIngo Molnar { 337004746ed8SIngo Molnar uc_se->value = value; 337104746ed8SIngo Molnar uc_se->bucket_id = uclamp_bucket_id(value); 337204746ed8SIngo Molnar uc_se->user_defined = user_defined; 337304746ed8SIngo Molnar } 337404746ed8SIngo Molnar 3375127f6bf1SIngo Molnar #else /* !CONFIG_UCLAMP_TASK: */ 3376127f6bf1SIngo Molnar 3377127f6bf1SIngo Molnar static inline unsigned long 3378127f6bf1SIngo Molnar uclamp_eff_value(struct task_struct *p, enum uclamp_id clamp_id) 3379b48e16a6SQais Yousef { 3380b48e16a6SQais Yousef if (clamp_id == UCLAMP_MIN) 3381b48e16a6SQais Yousef return 0; 3382b48e16a6SQais Yousef 3383b48e16a6SQais Yousef return SCHED_CAPACITY_SCALE; 3384b48e16a6SQais Yousef } 3385b48e16a6SQais Yousef 33867a17e1dbSQais Yousef static inline bool uclamp_rq_is_capped(struct rq *rq) { return false; } 33877a17e1dbSQais Yousef 33887a17e1dbSQais Yousef static inline bool uclamp_is_used(void) 33897a17e1dbSQais Yousef { 33907a17e1dbSQais Yousef return false; 33917a17e1dbSQais Yousef } 339224422603SQais Yousef 3393127f6bf1SIngo Molnar static inline unsigned long 3394127f6bf1SIngo Molnar uclamp_rq_get(struct rq *rq, enum uclamp_id clamp_id) 339524422603SQais Yousef { 339624422603SQais Yousef if (clamp_id == UCLAMP_MIN) 339724422603SQais Yousef return 0; 339824422603SQais Yousef 339924422603SQais Yousef return SCHED_CAPACITY_SCALE; 340024422603SQais Yousef } 340124422603SQais Yousef 3402127f6bf1SIngo Molnar static inline void 3403127f6bf1SIngo Molnar uclamp_rq_set(struct rq *rq, enum uclamp_id clamp_id, unsigned int value) 340424422603SQais Yousef { 340524422603SQais Yousef } 340624422603SQais Yousef 340724422603SQais Yousef static inline bool uclamp_rq_is_idle(struct rq *rq) 340824422603SQais Yousef { 340924422603SQais Yousef return false; 341024422603SQais Yousef } 341104746ed8SIngo Molnar 3412127f6bf1SIngo Molnar #endif /* !CONFIG_UCLAMP_TASK */ 34137a17e1dbSQais Yousef 341411d4afd4SVincent Guittot #ifdef CONFIG_HAVE_SCHED_AVG_IRQ 3415127f6bf1SIngo Molnar 34169033ea11SVincent Guittot static inline unsigned long cpu_util_irq(struct rq *rq) 34179033ea11SVincent Guittot { 3418a6965b31SShrikanth Hegde return READ_ONCE(rq->avg_irq.util_avg); 34199033ea11SVincent Guittot } 34202e62c474SVincent Guittot 34212e62c474SVincent Guittot static inline 34222e62c474SVincent Guittot unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) 34232e62c474SVincent Guittot { 34242e62c474SVincent Guittot util *= (max - irq); 34252e62c474SVincent Guittot util /= max; 34262e62c474SVincent Guittot 34272e62c474SVincent Guittot return util; 34282e62c474SVincent Guittot 34292e62c474SVincent Guittot } 3430127f6bf1SIngo Molnar 3431127f6bf1SIngo Molnar #else /* !CONFIG_HAVE_SCHED_AVG_IRQ: */ 3432127f6bf1SIngo Molnar 34339033ea11SVincent Guittot static inline unsigned long cpu_util_irq(struct rq *rq) 34349033ea11SVincent Guittot { 34359033ea11SVincent Guittot return 0; 34369033ea11SVincent Guittot } 34379033ea11SVincent Guittot 34382e62c474SVincent Guittot static inline 34392e62c474SVincent Guittot unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) 34402e62c474SVincent Guittot { 34412e62c474SVincent Guittot return util; 34422e62c474SVincent Guittot } 3443127f6bf1SIngo Molnar 3444127f6bf1SIngo Molnar #endif /* !CONFIG_HAVE_SCHED_AVG_IRQ */ 34456aa140faSQuentin Perret 3446531b5c9fSQuentin Perret #if defined(CONFIG_ENERGY_MODEL) && defined(CONFIG_CPU_FREQ_GOV_SCHEDUTIL) 34471f74de87SQuentin Perret 3448f8a696f2SPeter Zijlstra #define perf_domain_span(pd) (to_cpumask(((pd)->em_pd->cpus))) 3449f8a696f2SPeter Zijlstra 3450f8a696f2SPeter Zijlstra DECLARE_STATIC_KEY_FALSE(sched_energy_present); 3451f8a696f2SPeter Zijlstra 3452f8a696f2SPeter Zijlstra static inline bool sched_energy_enabled(void) 3453f8a696f2SPeter Zijlstra { 3454f8a696f2SPeter Zijlstra return static_branch_unlikely(&sched_energy_present); 3455f8a696f2SPeter Zijlstra } 3456f8a696f2SPeter Zijlstra 3457f2273f4eSIngo Molnar extern struct cpufreq_governor schedutil_gov; 3458f2273f4eSIngo Molnar 3459f8a696f2SPeter Zijlstra #else /* ! (CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL) */ 3460f8a696f2SPeter Zijlstra 3461f8a696f2SPeter Zijlstra #define perf_domain_span(pd) NULL 3462127f6bf1SIngo Molnar 3463f8a696f2SPeter Zijlstra static inline bool sched_energy_enabled(void) { return false; } 3464f8a696f2SPeter Zijlstra 3465f8a696f2SPeter Zijlstra #endif /* CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL */ 3466227a4aadSMathieu Desnoyers 3467227a4aadSMathieu Desnoyers #ifdef CONFIG_MEMBARRIER 3468127f6bf1SIngo Molnar 3469227a4aadSMathieu Desnoyers /* 3470227a4aadSMathieu Desnoyers * The scheduler provides memory barriers required by membarrier between: 3471227a4aadSMathieu Desnoyers * - prior user-space memory accesses and store to rq->membarrier_state, 3472227a4aadSMathieu Desnoyers * - store to rq->membarrier_state and following user-space memory accesses. 3473227a4aadSMathieu Desnoyers * In the same way it provides those guarantees around store to rq->curr. 3474227a4aadSMathieu Desnoyers */ 3475227a4aadSMathieu Desnoyers static inline void membarrier_switch_mm(struct rq *rq, 3476227a4aadSMathieu Desnoyers struct mm_struct *prev_mm, 3477227a4aadSMathieu Desnoyers struct mm_struct *next_mm) 3478227a4aadSMathieu Desnoyers { 3479227a4aadSMathieu Desnoyers int membarrier_state; 3480227a4aadSMathieu Desnoyers 3481227a4aadSMathieu Desnoyers if (prev_mm == next_mm) 3482227a4aadSMathieu Desnoyers return; 3483227a4aadSMathieu Desnoyers 3484227a4aadSMathieu Desnoyers membarrier_state = atomic_read(&next_mm->membarrier_state); 3485227a4aadSMathieu Desnoyers if (READ_ONCE(rq->membarrier_state) == membarrier_state) 3486227a4aadSMathieu Desnoyers return; 3487227a4aadSMathieu Desnoyers 3488227a4aadSMathieu Desnoyers WRITE_ONCE(rq->membarrier_state, membarrier_state); 3489227a4aadSMathieu Desnoyers } 3490127f6bf1SIngo Molnar 3491127f6bf1SIngo Molnar #else /* !CONFIG_MEMBARRIER :*/ 3492127f6bf1SIngo Molnar 3493227a4aadSMathieu Desnoyers static inline void membarrier_switch_mm(struct rq *rq, 3494227a4aadSMathieu Desnoyers struct mm_struct *prev_mm, 3495227a4aadSMathieu Desnoyers struct mm_struct *next_mm) 3496227a4aadSMathieu Desnoyers { 3497227a4aadSMathieu Desnoyers } 3498127f6bf1SIngo Molnar 3499127f6bf1SIngo Molnar #endif /* !CONFIG_MEMBARRIER */ 350052262ee5SMel Gorman 350152262ee5SMel Gorman #ifdef CONFIG_SMP 350252262ee5SMel Gorman static inline bool is_per_cpu_kthread(struct task_struct *p) 350352262ee5SMel Gorman { 350452262ee5SMel Gorman if (!(p->flags & PF_KTHREAD)) 350552262ee5SMel Gorman return false; 350652262ee5SMel Gorman 350752262ee5SMel Gorman if (p->nr_cpus_allowed != 1) 350852262ee5SMel Gorman return false; 350952262ee5SMel Gorman 351052262ee5SMel Gorman return true; 351152262ee5SMel Gorman } 351252262ee5SMel Gorman #endif 3513b3212fe2SThomas Gleixner 35141011dcceSPeter Zijlstra extern void swake_up_all_locked(struct swait_queue_head *q); 35151011dcceSPeter Zijlstra extern void __prepare_to_swait(struct swait_queue_head *q, struct swait_queue *wait); 35161011dcceSPeter Zijlstra 3517ab83f455SPeter Oskolkov extern int try_to_wake_up(struct task_struct *tsk, unsigned int state, int wake_flags); 3518ab83f455SPeter Oskolkov 35191011dcceSPeter Zijlstra #ifdef CONFIG_PREEMPT_DYNAMIC 35201011dcceSPeter Zijlstra extern int preempt_dynamic_mode; 35211011dcceSPeter Zijlstra extern int sched_dynamic_mode(const char *str); 35221011dcceSPeter Zijlstra extern void sched_dynamic_update(int mode); 35231011dcceSPeter Zijlstra #endif 35241011dcceSPeter Zijlstra 3525af7f588dSMathieu Desnoyers #ifdef CONFIG_SCHED_MM_CID 3526223baf9dSMathieu Desnoyers 3527223baf9dSMathieu Desnoyers #define SCHED_MM_CID_PERIOD_NS (100ULL * 1000000) /* 100ms */ 3528223baf9dSMathieu Desnoyers #define MM_CID_SCAN_DELAY 100 /* 100ms */ 3529223baf9dSMathieu Desnoyers 3530223baf9dSMathieu Desnoyers extern raw_spinlock_t cid_lock; 3531223baf9dSMathieu Desnoyers extern int use_cid_lock; 3532223baf9dSMathieu Desnoyers 3533223baf9dSMathieu Desnoyers extern void sched_mm_cid_migrate_from(struct task_struct *t); 3534223baf9dSMathieu Desnoyers extern void sched_mm_cid_migrate_to(struct rq *dst_rq, struct task_struct *t); 3535223baf9dSMathieu Desnoyers extern void task_tick_mm_cid(struct rq *rq, struct task_struct *curr); 3536223baf9dSMathieu Desnoyers extern void init_sched_mm_cid(struct task_struct *t); 3537223baf9dSMathieu Desnoyers 3538223baf9dSMathieu Desnoyers static inline void __mm_cid_put(struct mm_struct *mm, int cid) 3539223baf9dSMathieu Desnoyers { 3540223baf9dSMathieu Desnoyers if (cid < 0) 3541223baf9dSMathieu Desnoyers return; 3542223baf9dSMathieu Desnoyers cpumask_clear_cpu(cid, mm_cidmask(mm)); 3543223baf9dSMathieu Desnoyers } 3544223baf9dSMathieu Desnoyers 3545223baf9dSMathieu Desnoyers /* 3546223baf9dSMathieu Desnoyers * The per-mm/cpu cid can have the MM_CID_LAZY_PUT flag set or transition to 3547223baf9dSMathieu Desnoyers * the MM_CID_UNSET state without holding the rq lock, but the rq lock needs to 3548223baf9dSMathieu Desnoyers * be held to transition to other states. 3549223baf9dSMathieu Desnoyers * 3550223baf9dSMathieu Desnoyers * State transitions synchronized with cmpxchg or try_cmpxchg need to be 3551402de7fcSIngo Molnar * consistent across CPUs, which prevents use of this_cpu_cmpxchg. 3552223baf9dSMathieu Desnoyers */ 3553223baf9dSMathieu Desnoyers static inline void mm_cid_put_lazy(struct task_struct *t) 3554223baf9dSMathieu Desnoyers { 3555223baf9dSMathieu Desnoyers struct mm_struct *mm = t->mm; 3556223baf9dSMathieu Desnoyers struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; 3557223baf9dSMathieu Desnoyers int cid; 3558223baf9dSMathieu Desnoyers 3559223baf9dSMathieu Desnoyers lockdep_assert_irqs_disabled(); 3560223baf9dSMathieu Desnoyers cid = __this_cpu_read(pcpu_cid->cid); 3561223baf9dSMathieu Desnoyers if (!mm_cid_is_lazy_put(cid) || 3562223baf9dSMathieu Desnoyers !try_cmpxchg(&this_cpu_ptr(pcpu_cid)->cid, &cid, MM_CID_UNSET)) 3563223baf9dSMathieu Desnoyers return; 3564223baf9dSMathieu Desnoyers __mm_cid_put(mm, mm_cid_clear_lazy_put(cid)); 3565223baf9dSMathieu Desnoyers } 3566223baf9dSMathieu Desnoyers 3567223baf9dSMathieu Desnoyers static inline int mm_cid_pcpu_unset(struct mm_struct *mm) 3568223baf9dSMathieu Desnoyers { 3569223baf9dSMathieu Desnoyers struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; 3570223baf9dSMathieu Desnoyers int cid, res; 3571223baf9dSMathieu Desnoyers 3572223baf9dSMathieu Desnoyers lockdep_assert_irqs_disabled(); 3573223baf9dSMathieu Desnoyers cid = __this_cpu_read(pcpu_cid->cid); 3574223baf9dSMathieu Desnoyers for (;;) { 3575223baf9dSMathieu Desnoyers if (mm_cid_is_unset(cid)) 3576223baf9dSMathieu Desnoyers return MM_CID_UNSET; 3577223baf9dSMathieu Desnoyers /* 3578223baf9dSMathieu Desnoyers * Attempt transition from valid or lazy-put to unset. 3579223baf9dSMathieu Desnoyers */ 3580223baf9dSMathieu Desnoyers res = cmpxchg(&this_cpu_ptr(pcpu_cid)->cid, cid, MM_CID_UNSET); 3581223baf9dSMathieu Desnoyers if (res == cid) 3582223baf9dSMathieu Desnoyers break; 3583223baf9dSMathieu Desnoyers cid = res; 3584223baf9dSMathieu Desnoyers } 3585223baf9dSMathieu Desnoyers return cid; 3586223baf9dSMathieu Desnoyers } 3587223baf9dSMathieu Desnoyers 3588223baf9dSMathieu Desnoyers static inline void mm_cid_put(struct mm_struct *mm) 3589223baf9dSMathieu Desnoyers { 3590223baf9dSMathieu Desnoyers int cid; 3591223baf9dSMathieu Desnoyers 3592223baf9dSMathieu Desnoyers lockdep_assert_irqs_disabled(); 3593223baf9dSMathieu Desnoyers cid = mm_cid_pcpu_unset(mm); 3594223baf9dSMathieu Desnoyers if (cid == MM_CID_UNSET) 3595223baf9dSMathieu Desnoyers return; 3596223baf9dSMathieu Desnoyers __mm_cid_put(mm, mm_cid_clear_lazy_put(cid)); 3597223baf9dSMathieu Desnoyers } 3598223baf9dSMathieu Desnoyers 3599223baf9dSMathieu Desnoyers static inline int __mm_cid_try_get(struct mm_struct *mm) 3600af7f588dSMathieu Desnoyers { 3601af7f588dSMathieu Desnoyers struct cpumask *cpumask; 3602af7f588dSMathieu Desnoyers int cid; 3603af7f588dSMathieu Desnoyers 3604af7f588dSMathieu Desnoyers cpumask = mm_cidmask(mm); 3605223baf9dSMathieu Desnoyers /* 3606223baf9dSMathieu Desnoyers * Retry finding first zero bit if the mask is temporarily 3607223baf9dSMathieu Desnoyers * filled. This only happens during concurrent remote-clear 3608223baf9dSMathieu Desnoyers * which owns a cid without holding a rq lock. 3609223baf9dSMathieu Desnoyers */ 3610223baf9dSMathieu Desnoyers for (;;) { 3611af7f588dSMathieu Desnoyers cid = cpumask_first_zero(cpumask); 3612223baf9dSMathieu Desnoyers if (cid < nr_cpu_ids) 3613223baf9dSMathieu Desnoyers break; 3614223baf9dSMathieu Desnoyers cpu_relax(); 3615223baf9dSMathieu Desnoyers } 3616223baf9dSMathieu Desnoyers if (cpumask_test_and_set_cpu(cid, cpumask)) 3617af7f588dSMathieu Desnoyers return -1; 3618127f6bf1SIngo Molnar 3619af7f588dSMathieu Desnoyers return cid; 3620af7f588dSMathieu Desnoyers } 3621af7f588dSMathieu Desnoyers 3622af7f588dSMathieu Desnoyers /* 3623223baf9dSMathieu Desnoyers * Save a snapshot of the current runqueue time of this cpu 3624223baf9dSMathieu Desnoyers * with the per-cpu cid value, allowing to estimate how recently it was used. 3625af7f588dSMathieu Desnoyers */ 3626223baf9dSMathieu Desnoyers static inline void mm_cid_snapshot_time(struct rq *rq, struct mm_struct *mm) 3627223baf9dSMathieu Desnoyers { 3628223baf9dSMathieu Desnoyers struct mm_cid *pcpu_cid = per_cpu_ptr(mm->pcpu_cid, cpu_of(rq)); 3629223baf9dSMathieu Desnoyers 3630223baf9dSMathieu Desnoyers lockdep_assert_rq_held(rq); 3631223baf9dSMathieu Desnoyers WRITE_ONCE(pcpu_cid->time, rq->clock); 3632af7f588dSMathieu Desnoyers } 3633223baf9dSMathieu Desnoyers 3634223baf9dSMathieu Desnoyers static inline int __mm_cid_get(struct rq *rq, struct mm_struct *mm) 3635223baf9dSMathieu Desnoyers { 3636223baf9dSMathieu Desnoyers int cid; 3637223baf9dSMathieu Desnoyers 3638223baf9dSMathieu Desnoyers /* 3639223baf9dSMathieu Desnoyers * All allocations (even those using the cid_lock) are lock-free. If 3640223baf9dSMathieu Desnoyers * use_cid_lock is set, hold the cid_lock to perform cid allocation to 3641223baf9dSMathieu Desnoyers * guarantee forward progress. 3642223baf9dSMathieu Desnoyers */ 3643223baf9dSMathieu Desnoyers if (!READ_ONCE(use_cid_lock)) { 3644223baf9dSMathieu Desnoyers cid = __mm_cid_try_get(mm); 3645223baf9dSMathieu Desnoyers if (cid >= 0) 3646223baf9dSMathieu Desnoyers goto end; 3647223baf9dSMathieu Desnoyers raw_spin_lock(&cid_lock); 3648223baf9dSMathieu Desnoyers } else { 3649223baf9dSMathieu Desnoyers raw_spin_lock(&cid_lock); 3650223baf9dSMathieu Desnoyers cid = __mm_cid_try_get(mm); 3651223baf9dSMathieu Desnoyers if (cid >= 0) 3652223baf9dSMathieu Desnoyers goto unlock; 3653223baf9dSMathieu Desnoyers } 3654223baf9dSMathieu Desnoyers 3655223baf9dSMathieu Desnoyers /* 3656223baf9dSMathieu Desnoyers * cid concurrently allocated. Retry while forcing following 3657223baf9dSMathieu Desnoyers * allocations to use the cid_lock to ensure forward progress. 3658223baf9dSMathieu Desnoyers */ 3659223baf9dSMathieu Desnoyers WRITE_ONCE(use_cid_lock, 1); 3660223baf9dSMathieu Desnoyers /* 3661223baf9dSMathieu Desnoyers * Set use_cid_lock before allocation. Only care about program order 3662223baf9dSMathieu Desnoyers * because this is only required for forward progress. 3663223baf9dSMathieu Desnoyers */ 3664223baf9dSMathieu Desnoyers barrier(); 3665223baf9dSMathieu Desnoyers /* 3666223baf9dSMathieu Desnoyers * Retry until it succeeds. It is guaranteed to eventually succeed once 3667223baf9dSMathieu Desnoyers * all newcoming allocations observe the use_cid_lock flag set. 3668223baf9dSMathieu Desnoyers */ 3669223baf9dSMathieu Desnoyers do { 3670223baf9dSMathieu Desnoyers cid = __mm_cid_try_get(mm); 3671223baf9dSMathieu Desnoyers cpu_relax(); 3672223baf9dSMathieu Desnoyers } while (cid < 0); 3673223baf9dSMathieu Desnoyers /* 3674223baf9dSMathieu Desnoyers * Allocate before clearing use_cid_lock. Only care about 3675223baf9dSMathieu Desnoyers * program order because this is for forward progress. 3676223baf9dSMathieu Desnoyers */ 3677223baf9dSMathieu Desnoyers barrier(); 3678223baf9dSMathieu Desnoyers WRITE_ONCE(use_cid_lock, 0); 3679223baf9dSMathieu Desnoyers unlock: 3680223baf9dSMathieu Desnoyers raw_spin_unlock(&cid_lock); 3681223baf9dSMathieu Desnoyers end: 3682223baf9dSMathieu Desnoyers mm_cid_snapshot_time(rq, mm); 3683127f6bf1SIngo Molnar 3684223baf9dSMathieu Desnoyers return cid; 3685223baf9dSMathieu Desnoyers } 3686223baf9dSMathieu Desnoyers 3687223baf9dSMathieu Desnoyers static inline int mm_cid_get(struct rq *rq, struct mm_struct *mm) 3688223baf9dSMathieu Desnoyers { 3689223baf9dSMathieu Desnoyers struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; 3690223baf9dSMathieu Desnoyers struct cpumask *cpumask; 3691223baf9dSMathieu Desnoyers int cid; 3692223baf9dSMathieu Desnoyers 3693223baf9dSMathieu Desnoyers lockdep_assert_rq_held(rq); 3694223baf9dSMathieu Desnoyers cpumask = mm_cidmask(mm); 3695223baf9dSMathieu Desnoyers cid = __this_cpu_read(pcpu_cid->cid); 3696223baf9dSMathieu Desnoyers if (mm_cid_is_valid(cid)) { 3697223baf9dSMathieu Desnoyers mm_cid_snapshot_time(rq, mm); 3698223baf9dSMathieu Desnoyers return cid; 3699223baf9dSMathieu Desnoyers } 3700223baf9dSMathieu Desnoyers if (mm_cid_is_lazy_put(cid)) { 3701223baf9dSMathieu Desnoyers if (try_cmpxchg(&this_cpu_ptr(pcpu_cid)->cid, &cid, MM_CID_UNSET)) 3702223baf9dSMathieu Desnoyers __mm_cid_put(mm, mm_cid_clear_lazy_put(cid)); 3703223baf9dSMathieu Desnoyers } 3704223baf9dSMathieu Desnoyers cid = __mm_cid_get(rq, mm); 3705223baf9dSMathieu Desnoyers __this_cpu_write(pcpu_cid->cid, cid); 3706127f6bf1SIngo Molnar 3707223baf9dSMathieu Desnoyers return cid; 3708223baf9dSMathieu Desnoyers } 3709223baf9dSMathieu Desnoyers 3710223baf9dSMathieu Desnoyers static inline void switch_mm_cid(struct rq *rq, 3711223baf9dSMathieu Desnoyers struct task_struct *prev, 3712223baf9dSMathieu Desnoyers struct task_struct *next) 3713223baf9dSMathieu Desnoyers { 3714223baf9dSMathieu Desnoyers /* 3715223baf9dSMathieu Desnoyers * Provide a memory barrier between rq->curr store and load of 3716223baf9dSMathieu Desnoyers * {prev,next}->mm->pcpu_cid[cpu] on rq->curr->mm transition. 3717223baf9dSMathieu Desnoyers * 3718223baf9dSMathieu Desnoyers * Should be adapted if context_switch() is modified. 3719223baf9dSMathieu Desnoyers */ 3720223baf9dSMathieu Desnoyers if (!next->mm) { // to kernel 3721223baf9dSMathieu Desnoyers /* 3722223baf9dSMathieu Desnoyers * user -> kernel transition does not guarantee a barrier, but 3723223baf9dSMathieu Desnoyers * we can use the fact that it performs an atomic operation in 3724223baf9dSMathieu Desnoyers * mmgrab(). 3725223baf9dSMathieu Desnoyers */ 3726223baf9dSMathieu Desnoyers if (prev->mm) // from user 3727223baf9dSMathieu Desnoyers smp_mb__after_mmgrab(); 3728223baf9dSMathieu Desnoyers /* 3729223baf9dSMathieu Desnoyers * kernel -> kernel transition does not change rq->curr->mm 3730223baf9dSMathieu Desnoyers * state. It stays NULL. 3731223baf9dSMathieu Desnoyers */ 3732223baf9dSMathieu Desnoyers } else { // to user 3733223baf9dSMathieu Desnoyers /* 3734223baf9dSMathieu Desnoyers * kernel -> user transition does not provide a barrier 3735223baf9dSMathieu Desnoyers * between rq->curr store and load of {prev,next}->mm->pcpu_cid[cpu]. 3736223baf9dSMathieu Desnoyers * Provide it here. 3737223baf9dSMathieu Desnoyers */ 3738fe90f396SMathieu Desnoyers if (!prev->mm) { // from kernel 3739223baf9dSMathieu Desnoyers smp_mb(); 3740fe90f396SMathieu Desnoyers } else { // from user 3741223baf9dSMathieu Desnoyers /* 3742fe90f396SMathieu Desnoyers * user->user transition relies on an implicit 3743fe90f396SMathieu Desnoyers * memory barrier in switch_mm() when 3744fe90f396SMathieu Desnoyers * current->mm changes. If the architecture 3745fe90f396SMathieu Desnoyers * switch_mm() does not have an implicit memory 3746fe90f396SMathieu Desnoyers * barrier, it is emitted here. If current->mm 3747fe90f396SMathieu Desnoyers * is unchanged, no barrier is needed. 3748223baf9dSMathieu Desnoyers */ 3749fe90f396SMathieu Desnoyers smp_mb__after_switch_mm(); 3750fe90f396SMathieu Desnoyers } 3751223baf9dSMathieu Desnoyers } 3752223baf9dSMathieu Desnoyers if (prev->mm_cid_active) { 3753223baf9dSMathieu Desnoyers mm_cid_snapshot_time(rq, prev->mm); 3754223baf9dSMathieu Desnoyers mm_cid_put_lazy(prev); 3755af7f588dSMathieu Desnoyers prev->mm_cid = -1; 3756af7f588dSMathieu Desnoyers } 3757af7f588dSMathieu Desnoyers if (next->mm_cid_active) 3758223baf9dSMathieu Desnoyers next->last_mm_cid = next->mm_cid = mm_cid_get(rq, next->mm); 3759af7f588dSMathieu Desnoyers } 3760af7f588dSMathieu Desnoyers 3761127f6bf1SIngo Molnar #else /* !CONFIG_SCHED_MM_CID: */ 3762223baf9dSMathieu Desnoyers static inline void switch_mm_cid(struct rq *rq, struct task_struct *prev, struct task_struct *next) { } 3763223baf9dSMathieu Desnoyers static inline void sched_mm_cid_migrate_from(struct task_struct *t) { } 3764223baf9dSMathieu Desnoyers static inline void sched_mm_cid_migrate_to(struct rq *dst_rq, struct task_struct *t) { } 3765223baf9dSMathieu Desnoyers static inline void task_tick_mm_cid(struct rq *rq, struct task_struct *curr) { } 3766223baf9dSMathieu Desnoyers static inline void init_sched_mm_cid(struct task_struct *t) { } 3767127f6bf1SIngo Molnar #endif /* !CONFIG_SCHED_MM_CID */ 3768af7f588dSMathieu Desnoyers 3769af4cf404SPeter Zijlstra extern u64 avg_vruntime(struct cfs_rq *cfs_rq); 3770147f3efaSPeter Zijlstra extern int entity_eligible(struct cfs_rq *cfs_rq, struct sched_entity *se); 3771af4cf404SPeter Zijlstra 377204746ed8SIngo Molnar #ifdef CONFIG_RT_MUTEXES 3773127f6bf1SIngo Molnar 377404746ed8SIngo Molnar static inline int __rt_effective_prio(struct task_struct *pi_task, int prio) 377504746ed8SIngo Molnar { 377604746ed8SIngo Molnar if (pi_task) 377704746ed8SIngo Molnar prio = min(prio, pi_task->prio); 377804746ed8SIngo Molnar 377904746ed8SIngo Molnar return prio; 378004746ed8SIngo Molnar } 378104746ed8SIngo Molnar 378204746ed8SIngo Molnar static inline int rt_effective_prio(struct task_struct *p, int prio) 378304746ed8SIngo Molnar { 378404746ed8SIngo Molnar struct task_struct *pi_task = rt_mutex_get_top_task(p); 378504746ed8SIngo Molnar 378604746ed8SIngo Molnar return __rt_effective_prio(pi_task, prio); 378704746ed8SIngo Molnar } 3788127f6bf1SIngo Molnar 3789127f6bf1SIngo Molnar #else /* !CONFIG_RT_MUTEXES: */ 3790127f6bf1SIngo Molnar 379104746ed8SIngo Molnar static inline int rt_effective_prio(struct task_struct *p, int prio) 379204746ed8SIngo Molnar { 379304746ed8SIngo Molnar return prio; 379404746ed8SIngo Molnar } 3795127f6bf1SIngo Molnar 3796127f6bf1SIngo Molnar #endif /* !CONFIG_RT_MUTEXES */ 379704746ed8SIngo Molnar 379804746ed8SIngo Molnar extern int __sched_setscheduler(struct task_struct *p, const struct sched_attr *attr, bool user, bool pi); 379904746ed8SIngo Molnar extern int __sched_setaffinity(struct task_struct *p, struct affinity_context *ctx); 380004746ed8SIngo Molnar extern void __setscheduler_prio(struct task_struct *p, int prio); 380104746ed8SIngo Molnar extern void set_load_weight(struct task_struct *p, bool update_load); 380204746ed8SIngo Molnar extern void enqueue_task(struct rq *rq, struct task_struct *p, int flags); 3803863ccdbbSPeter Zijlstra extern bool dequeue_task(struct rq *rq, struct task_struct *p, int flags); 380404746ed8SIngo Molnar 3805d8c7bc2eSTejun Heo extern void check_class_changing(struct rq *rq, struct task_struct *p, 3806d8c7bc2eSTejun Heo const struct sched_class *prev_class); 380704746ed8SIngo Molnar extern void check_class_changed(struct rq *rq, struct task_struct *p, 380804746ed8SIngo Molnar const struct sched_class *prev_class, 380904746ed8SIngo Molnar int oldprio); 381004746ed8SIngo Molnar 381104746ed8SIngo Molnar #ifdef CONFIG_SMP 381204746ed8SIngo Molnar extern struct balance_callback *splice_balance_callbacks(struct rq *rq); 381304746ed8SIngo Molnar extern void balance_callbacks(struct rq *rq, struct balance_callback *head); 381404746ed8SIngo Molnar #else 381504746ed8SIngo Molnar 381604746ed8SIngo Molnar static inline struct balance_callback *splice_balance_callbacks(struct rq *rq) 381704746ed8SIngo Molnar { 381804746ed8SIngo Molnar return NULL; 381904746ed8SIngo Molnar } 382004746ed8SIngo Molnar 382104746ed8SIngo Molnar static inline void balance_callbacks(struct rq *rq, struct balance_callback *head) 382204746ed8SIngo Molnar { 382304746ed8SIngo Molnar } 382404746ed8SIngo Molnar 382504746ed8SIngo Molnar #endif 382604746ed8SIngo Molnar 3827e196c908STejun Heo #ifdef CONFIG_SCHED_CLASS_EXT 3828e196c908STejun Heo /* 3829e196c908STejun Heo * Used by SCX in the enable/disable paths to move tasks between sched_classes 3830e196c908STejun Heo * and establish invariants. 3831e196c908STejun Heo */ 3832e196c908STejun Heo struct sched_enq_and_set_ctx { 3833e196c908STejun Heo struct task_struct *p; 3834e196c908STejun Heo int queue_flags; 3835e196c908STejun Heo bool queued; 3836e196c908STejun Heo bool running; 3837e196c908STejun Heo }; 3838e196c908STejun Heo 3839e196c908STejun Heo void sched_deq_and_put_task(struct task_struct *p, int queue_flags, 3840e196c908STejun Heo struct sched_enq_and_set_ctx *ctx); 3841e196c908STejun Heo void sched_enq_and_set_task(struct sched_enq_and_set_ctx *ctx); 3842e196c908STejun Heo 3843e196c908STejun Heo #endif /* CONFIG_SCHED_CLASS_EXT */ 3844e196c908STejun Heo 3845a7a9fc54STejun Heo #include "ext.h" 3846a7a9fc54STejun Heo 384795458477SIngo Molnar #endif /* _KERNEL_SCHED_SCHED_H */ 3848