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> 30325ea10cSIngo Molnar #include <linux/cpufreq.h> 314ff8f2caSIngo Molnar #include <linux/cpumask_api.h> 32325ea10cSIngo Molnar #include <linux/ctype.h> 334ff8f2caSIngo Molnar #include <linux/file.h> 344ff8f2caSIngo Molnar #include <linux/fs_api.h> 354ff8f2caSIngo Molnar #include <linux/hrtimer_api.h> 364ff8f2caSIngo Molnar #include <linux/interrupt.h> 374ff8f2caSIngo Molnar #include <linux/irq_work.h> 384ff8f2caSIngo Molnar #include <linux/jiffies.h> 394ff8f2caSIngo Molnar #include <linux/kref_api.h> 40325ea10cSIngo Molnar #include <linux/kthread.h> 414ff8f2caSIngo Molnar #include <linux/ktime_api.h> 424ff8f2caSIngo Molnar #include <linux/lockdep_api.h> 434ff8f2caSIngo Molnar #include <linux/lockdep.h> 444ff8f2caSIngo Molnar #include <linux/minmax.h> 454ff8f2caSIngo Molnar #include <linux/mm.h> 464ff8f2caSIngo Molnar #include <linux/module.h> 474ff8f2caSIngo Molnar #include <linux/mutex_api.h> 484ff8f2caSIngo Molnar #include <linux/plist.h> 494ff8f2caSIngo Molnar #include <linux/poll.h> 50325ea10cSIngo Molnar #include <linux/proc_fs.h> 51325ea10cSIngo Molnar #include <linux/profile.h> 52eb414681SJohannes Weiner #include <linux/psi.h> 534ff8f2caSIngo Molnar #include <linux/rcupdate.h> 544ff8f2caSIngo Molnar #include <linux/seq_file.h> 554ff8f2caSIngo Molnar #include <linux/seqlock.h> 564ff8f2caSIngo Molnar #include <linux/softirq.h> 574ff8f2caSIngo Molnar #include <linux/spinlock_api.h> 584ff8f2caSIngo Molnar #include <linux/static_key.h> 59391e43daSPeter Zijlstra #include <linux/stop_machine.h> 604ff8f2caSIngo Molnar #include <linux/syscalls_api.h> 61325ea10cSIngo Molnar #include <linux/syscalls.h> 624ff8f2caSIngo Molnar #include <linux/tick.h> 634ff8f2caSIngo Molnar #include <linux/topology.h> 644ff8f2caSIngo Molnar #include <linux/types.h> 654ff8f2caSIngo Molnar #include <linux/u64_stats_sync_api.h> 664ff8f2caSIngo Molnar #include <linux/uaccess.h> 674ff8f2caSIngo Molnar #include <linux/wait_api.h> 684ff8f2caSIngo Molnar #include <linux/wait_bit.h> 694ff8f2caSIngo Molnar #include <linux/workqueue_api.h> 70325ea10cSIngo Molnar 714ff8f2caSIngo Molnar #include <trace/events/power.h> 72b9e9c6caSIngo Molnar #include <trace/events/sched.h> 73b9e9c6caSIngo Molnar 744ff8f2caSIngo Molnar #include "../workqueue_internal.h" 754ff8f2caSIngo Molnar 76b9e9c6caSIngo Molnar #ifdef CONFIG_CGROUP_SCHED 77b9e9c6caSIngo Molnar #include <linux/cgroup.h> 78b9e9c6caSIngo Molnar #include <linux/psi.h> 79b9e9c6caSIngo Molnar #endif 80b9e9c6caSIngo Molnar 81b9e9c6caSIngo Molnar #ifdef CONFIG_SCHED_DEBUG 82b9e9c6caSIngo Molnar # include <linux/static_key.h> 83b9e9c6caSIngo Molnar #endif 84391e43daSPeter Zijlstra 857fce777cSIngo Molnar #ifdef CONFIG_PARAVIRT 867fce777cSIngo Molnar # include <asm/paravirt.h> 874ff8f2caSIngo Molnar # include <asm/paravirt_api_clock.h> 887fce777cSIngo Molnar #endif 897fce777cSIngo Molnar 90391e43daSPeter Zijlstra #include "cpupri.h" 916bfd6d72SJuri Lelli #include "cpudeadline.h" 92391e43daSPeter Zijlstra 939148a3a1SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 949148a3a1SPeter Zijlstra # define SCHED_WARN_ON(x) WARN_ONCE(x, #x) 959148a3a1SPeter Zijlstra #else 966d3aed3dSIngo Molnar # define SCHED_WARN_ON(x) ({ (void)(x), 0; }) 979148a3a1SPeter Zijlstra #endif 989148a3a1SPeter Zijlstra 9945ceebf7SPaul Gortmaker struct rq; 100442bf3aaSDaniel Lezcano struct cpuidle_state; 10145ceebf7SPaul Gortmaker 102da0c1e65SKirill Tkhai /* task_struct::on_rq states: */ 103da0c1e65SKirill Tkhai #define TASK_ON_RQ_QUEUED 1 104cca26e80SKirill Tkhai #define TASK_ON_RQ_MIGRATING 2 105da0c1e65SKirill Tkhai 106391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 107391e43daSPeter Zijlstra 10845ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 10945ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 11045ceebf7SPaul Gortmaker 1113289bdb4SPeter Zijlstra extern void calc_global_load_tick(struct rq *this_rq); 112d60585c5SThomas Gleixner extern long calc_load_fold_active(struct rq *this_rq, long adjust); 1133289bdb4SPeter Zijlstra 1149d246053SPhil Auld extern void call_trace_sched_update_nr_running(struct rq *rq, int count); 115391e43daSPeter Zijlstra /* 116391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 117391e43daSPeter Zijlstra */ 118391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 119391e43daSPeter Zijlstra 120cc1f4b1fSLi Zefan /* 121cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 122cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 123cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 124cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 125cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 126cc1f4b1fSLi Zefan * 127cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 12897fb7a0aSIngo Molnar * resolution (i.e. 64-bit). The costs for increasing resolution when 32-bit 12997fb7a0aSIngo Molnar * are pretty high and the returns do not justify the increased costs. 1302159197dSPeter Zijlstra * 13197fb7a0aSIngo Molnar * Really only required when CONFIG_FAIR_GROUP_SCHED=y is also set, but to 13297fb7a0aSIngo Molnar * increase coverage and consistency always enable it on 64-bit platforms. 133cc1f4b1fSLi Zefan */ 1342159197dSPeter Zijlstra #ifdef CONFIG_64BIT 135172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT + SCHED_FIXEDPOINT_SHIFT) 1366ecdd749SYuyang Du # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT) 13726cf5222SMichael Wang # define scale_load_down(w) \ 13826cf5222SMichael Wang ({ \ 13926cf5222SMichael Wang unsigned long __w = (w); \ 14026cf5222SMichael Wang if (__w) \ 14126cf5222SMichael Wang __w = max(2UL, __w >> SCHED_FIXEDPOINT_SHIFT); \ 14226cf5222SMichael Wang __w; \ 14326cf5222SMichael Wang }) 144cc1f4b1fSLi Zefan #else 145172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT) 146cc1f4b1fSLi Zefan # define scale_load(w) (w) 147cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 148cc1f4b1fSLi Zefan #endif 149cc1f4b1fSLi Zefan 1506ecdd749SYuyang Du /* 151172895e6SYuyang Du * Task weight (visible to users) and its load (invisible to users) have 152172895e6SYuyang Du * independent resolution, but they should be well calibrated. We use 153172895e6SYuyang Du * scale_load() and scale_load_down(w) to convert between them. The 154172895e6SYuyang Du * following must be true: 155172895e6SYuyang Du * 1569d061ba6SDietmar Eggemann * scale_load(sched_prio_to_weight[NICE_TO_PRIO(0)-MAX_RT_PRIO]) == NICE_0_LOAD 157172895e6SYuyang Du * 1586ecdd749SYuyang Du */ 159172895e6SYuyang Du #define NICE_0_LOAD (1L << NICE_0_LOAD_SHIFT) 160391e43daSPeter Zijlstra 161391e43daSPeter Zijlstra /* 162332ac17eSDario Faggioli * Single value that decides SCHED_DEADLINE internal math precision. 163332ac17eSDario Faggioli * 10 -> just above 1us 164332ac17eSDario Faggioli * 9 -> just above 0.5us 165332ac17eSDario Faggioli */ 16697fb7a0aSIngo Molnar #define DL_SCALE 10 167332ac17eSDario Faggioli 168332ac17eSDario Faggioli /* 16997fb7a0aSIngo Molnar * Single value that denotes runtime == period, ie unlimited time. 170391e43daSPeter Zijlstra */ 171391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 172391e43daSPeter Zijlstra 17320f9cd2aSHenrik Austad static inline int idle_policy(int policy) 17420f9cd2aSHenrik Austad { 17520f9cd2aSHenrik Austad return policy == SCHED_IDLE; 17620f9cd2aSHenrik Austad } 177d50dde5aSDario Faggioli static inline int fair_policy(int policy) 178d50dde5aSDario Faggioli { 179d50dde5aSDario Faggioli return policy == SCHED_NORMAL || policy == SCHED_BATCH; 180d50dde5aSDario Faggioli } 181d50dde5aSDario Faggioli 182391e43daSPeter Zijlstra static inline int rt_policy(int policy) 183391e43daSPeter Zijlstra { 184d50dde5aSDario Faggioli return policy == SCHED_FIFO || policy == SCHED_RR; 185391e43daSPeter Zijlstra } 186391e43daSPeter Zijlstra 187aab03e05SDario Faggioli static inline int dl_policy(int policy) 188aab03e05SDario Faggioli { 189aab03e05SDario Faggioli return policy == SCHED_DEADLINE; 190aab03e05SDario Faggioli } 19120f9cd2aSHenrik Austad static inline bool valid_policy(int policy) 19220f9cd2aSHenrik Austad { 19320f9cd2aSHenrik Austad return idle_policy(policy) || fair_policy(policy) || 19420f9cd2aSHenrik Austad rt_policy(policy) || dl_policy(policy); 19520f9cd2aSHenrik Austad } 196aab03e05SDario Faggioli 1971da1843fSViresh Kumar static inline int task_has_idle_policy(struct task_struct *p) 1981da1843fSViresh Kumar { 1991da1843fSViresh Kumar return idle_policy(p->policy); 2001da1843fSViresh Kumar } 2011da1843fSViresh Kumar 202391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 203391e43daSPeter Zijlstra { 204391e43daSPeter Zijlstra return rt_policy(p->policy); 205391e43daSPeter Zijlstra } 206391e43daSPeter Zijlstra 207aab03e05SDario Faggioli static inline int task_has_dl_policy(struct task_struct *p) 208aab03e05SDario Faggioli { 209aab03e05SDario Faggioli return dl_policy(p->policy); 210aab03e05SDario Faggioli } 211aab03e05SDario Faggioli 21207881166SJuri Lelli #define cap_scale(v, s) ((v)*(s) >> SCHED_CAPACITY_SHIFT) 21307881166SJuri Lelli 214d76343c6SValentin Schneider static inline void update_avg(u64 *avg, u64 sample) 215d76343c6SValentin Schneider { 216d76343c6SValentin Schneider s64 diff = sample - *avg; 217d76343c6SValentin Schneider *avg += diff / 8; 218d76343c6SValentin Schneider } 219d76343c6SValentin Schneider 2202d3d891dSDario Faggioli /* 22139a2a6ebSValentin Schneider * Shifting a value by an exponent greater *or equal* to the size of said value 22239a2a6ebSValentin Schneider * is UB; cap at size-1. 22339a2a6ebSValentin Schneider */ 22439a2a6ebSValentin Schneider #define shr_bound(val, shift) \ 22539a2a6ebSValentin Schneider (val >> min_t(typeof(shift), shift, BITS_PER_TYPE(typeof(val)) - 1)) 22639a2a6ebSValentin Schneider 22739a2a6ebSValentin Schneider /* 228794a56ebSJuri Lelli * !! For sched_setattr_nocheck() (kernel) only !! 229794a56ebSJuri Lelli * 230794a56ebSJuri Lelli * This is actually gross. :( 231794a56ebSJuri Lelli * 232794a56ebSJuri Lelli * It is used to make schedutil kworker(s) higher priority than SCHED_DEADLINE 233794a56ebSJuri Lelli * tasks, but still be able to sleep. We need this on platforms that cannot 234794a56ebSJuri Lelli * atomically change clock frequency. Remove once fast switching will be 235794a56ebSJuri Lelli * available on such platforms. 236794a56ebSJuri Lelli * 237794a56ebSJuri Lelli * SUGOV stands for SchedUtil GOVernor. 238794a56ebSJuri Lelli */ 239794a56ebSJuri Lelli #define SCHED_FLAG_SUGOV 0x10000000 240794a56ebSJuri Lelli 241f9509153SQuentin Perret #define SCHED_DL_FLAGS (SCHED_FLAG_RECLAIM | SCHED_FLAG_DL_OVERRUN | SCHED_FLAG_SUGOV) 242f9509153SQuentin Perret 243794a56ebSJuri Lelli static inline bool dl_entity_is_special(struct sched_dl_entity *dl_se) 244794a56ebSJuri Lelli { 245794a56ebSJuri Lelli #ifdef CONFIG_CPU_FREQ_GOV_SCHEDUTIL 246794a56ebSJuri Lelli return unlikely(dl_se->flags & SCHED_FLAG_SUGOV); 247794a56ebSJuri Lelli #else 248794a56ebSJuri Lelli return false; 249794a56ebSJuri Lelli #endif 250794a56ebSJuri Lelli } 251794a56ebSJuri Lelli 252794a56ebSJuri Lelli /* 2532d3d891dSDario Faggioli * Tells if entity @a should preempt entity @b. 2542d3d891dSDario Faggioli */ 255332ac17eSDario Faggioli static inline bool 256332ac17eSDario Faggioli dl_entity_preempt(struct sched_dl_entity *a, struct sched_dl_entity *b) 2572d3d891dSDario Faggioli { 258794a56ebSJuri Lelli return dl_entity_is_special(a) || 259794a56ebSJuri Lelli dl_time_before(a->deadline, b->deadline); 2602d3d891dSDario Faggioli } 2612d3d891dSDario Faggioli 262391e43daSPeter Zijlstra /* 263391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 264391e43daSPeter Zijlstra */ 265391e43daSPeter Zijlstra struct rt_prio_array { 266391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 267391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 268391e43daSPeter Zijlstra }; 269391e43daSPeter Zijlstra 270391e43daSPeter Zijlstra struct rt_bandwidth { 271391e43daSPeter Zijlstra /* nests inside the rq lock: */ 272391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 273391e43daSPeter Zijlstra ktime_t rt_period; 274391e43daSPeter Zijlstra u64 rt_runtime; 275391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 2764cfafd30SPeter Zijlstra unsigned int rt_period_active; 277391e43daSPeter Zijlstra }; 278a5e7be3bSJuri Lelli 279a5e7be3bSJuri Lelli void __dl_clear_params(struct task_struct *p); 280a5e7be3bSJuri Lelli 281332ac17eSDario Faggioli struct dl_bandwidth { 282332ac17eSDario Faggioli raw_spinlock_t dl_runtime_lock; 283332ac17eSDario Faggioli u64 dl_runtime; 284332ac17eSDario Faggioli u64 dl_period; 285332ac17eSDario Faggioli }; 286332ac17eSDario Faggioli 287332ac17eSDario Faggioli static inline int dl_bandwidth_enabled(void) 288332ac17eSDario Faggioli { 2891724813dSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 290332ac17eSDario Faggioli } 291332ac17eSDario Faggioli 292a57415f5SPeng Liu /* 293a57415f5SPeng Liu * To keep the bandwidth of -deadline tasks under control 294a57415f5SPeng Liu * we need some place where: 295a57415f5SPeng Liu * - store the maximum -deadline bandwidth of each cpu; 296a57415f5SPeng Liu * - cache the fraction of bandwidth that is currently allocated in 297a57415f5SPeng Liu * each root domain; 298a57415f5SPeng Liu * 299a57415f5SPeng Liu * This is all done in the data structure below. It is similar to the 300a57415f5SPeng Liu * one used for RT-throttling (rt_bandwidth), with the main difference 301a57415f5SPeng Liu * that, since here we are only interested in admission control, we 302a57415f5SPeng Liu * do not decrease any runtime while the group "executes", neither we 303a57415f5SPeng Liu * need a timer to replenish it. 304a57415f5SPeng Liu * 305a57415f5SPeng Liu * With respect to SMP, bandwidth is given on a per root domain basis, 306a57415f5SPeng Liu * meaning that: 307a57415f5SPeng Liu * - bw (< 100%) is the deadline bandwidth of each CPU; 308a57415f5SPeng Liu * - total_bw is the currently allocated bandwidth in each root domain; 309a57415f5SPeng Liu */ 310332ac17eSDario Faggioli struct dl_bw { 311332ac17eSDario Faggioli raw_spinlock_t lock; 31297fb7a0aSIngo Molnar u64 bw; 31397fb7a0aSIngo Molnar u64 total_bw; 314332ac17eSDario Faggioli }; 315332ac17eSDario Faggioli 316b4118988SLuca Abeni /* 317b4118988SLuca Abeni * Verify the fitness of task @p to run on @cpu taking into account the 318b4118988SLuca Abeni * CPU original capacity and the runtime/deadline ratio of the task. 319b4118988SLuca Abeni * 320b4118988SLuca Abeni * The function will return true if the CPU original capacity of the 321b4118988SLuca Abeni * @cpu scaled by SCHED_CAPACITY_SCALE >= runtime/deadline ratio of the 322b4118988SLuca Abeni * task and false otherwise. 323b4118988SLuca Abeni */ 324b4118988SLuca Abeni static inline bool dl_task_fits_capacity(struct task_struct *p, int cpu) 325b4118988SLuca Abeni { 326b4118988SLuca Abeni unsigned long cap = arch_scale_cpu_capacity(cpu); 327b4118988SLuca Abeni 328b4118988SLuca Abeni return cap_scale(p->dl.dl_deadline, cap) >= p->dl.dl_runtime; 329b4118988SLuca Abeni } 330b4118988SLuca Abeni 331f2cb1360SIngo Molnar extern void init_dl_bw(struct dl_bw *dl_b); 33206a76fe0SNicolas Pitre extern int sched_dl_global_validate(void); 33306a76fe0SNicolas Pitre extern void sched_dl_do_global(void); 33497fb7a0aSIngo Molnar extern int sched_dl_overflow(struct task_struct *p, int policy, const struct sched_attr *attr); 33506a76fe0SNicolas Pitre extern void __setparam_dl(struct task_struct *p, const struct sched_attr *attr); 33606a76fe0SNicolas Pitre extern void __getparam_dl(struct task_struct *p, struct sched_attr *attr); 33706a76fe0SNicolas Pitre extern bool __checkparam_dl(const struct sched_attr *attr); 33806a76fe0SNicolas Pitre extern bool dl_param_changed(struct task_struct *p, const struct sched_attr *attr); 33997fb7a0aSIngo Molnar extern int dl_cpuset_cpumask_can_shrink(const struct cpumask *cur, const struct cpumask *trial); 340772b6539SDietmar Eggemann extern int dl_cpu_busy(int cpu, struct task_struct *p); 341391e43daSPeter Zijlstra 342391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 343391e43daSPeter Zijlstra 344391e43daSPeter Zijlstra struct cfs_rq; 345391e43daSPeter Zijlstra struct rt_rq; 346391e43daSPeter Zijlstra 34735cf4e50SMike Galbraith extern struct list_head task_groups; 348391e43daSPeter Zijlstra 349391e43daSPeter Zijlstra struct cfs_bandwidth { 350391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 351391e43daSPeter Zijlstra raw_spinlock_t lock; 352391e43daSPeter Zijlstra ktime_t period; 35397fb7a0aSIngo Molnar u64 quota; 35497fb7a0aSIngo Molnar u64 runtime; 355f4183717SHuaixin Chang u64 burst; 356bcb1704aSHuaixin Chang u64 runtime_snap; 3579c58c79aSZhihui Zhang s64 hierarchical_quota; 358391e43daSPeter Zijlstra 35966567fcbSbsegall@google.com u8 idle; 36066567fcbSbsegall@google.com u8 period_active; 36166567fcbSbsegall@google.com u8 slack_started; 36297fb7a0aSIngo Molnar struct hrtimer period_timer; 36397fb7a0aSIngo Molnar struct hrtimer slack_timer; 364391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 365391e43daSPeter Zijlstra 36697fb7a0aSIngo Molnar /* Statistics: */ 36797fb7a0aSIngo Molnar int nr_periods; 36897fb7a0aSIngo Molnar int nr_throttled; 369bcb1704aSHuaixin Chang int nr_burst; 370391e43daSPeter Zijlstra u64 throttled_time; 371bcb1704aSHuaixin Chang u64 burst_time; 372391e43daSPeter Zijlstra #endif 373391e43daSPeter Zijlstra }; 374391e43daSPeter Zijlstra 37597fb7a0aSIngo Molnar /* Task group related information */ 376391e43daSPeter Zijlstra struct task_group { 377391e43daSPeter Zijlstra struct cgroup_subsys_state css; 378391e43daSPeter Zijlstra 379391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 38097fb7a0aSIngo Molnar /* schedulable entities of this group on each CPU */ 381391e43daSPeter Zijlstra struct sched_entity **se; 38297fb7a0aSIngo Molnar /* runqueue "owned" by this group on each CPU */ 383391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 384391e43daSPeter Zijlstra unsigned long shares; 385391e43daSPeter Zijlstra 38630400039SJosh Don /* A positive value indicates that this is a SCHED_IDLE group. */ 38730400039SJosh Don int idle; 38830400039SJosh Don 389fa6bddebSAlex Shi #ifdef CONFIG_SMP 390b0367629SWaiman Long /* 391b0367629SWaiman Long * load_avg can be heavily contended at clock tick time, so put 392b0367629SWaiman Long * it in its own cacheline separated from the fields above which 393b0367629SWaiman Long * will also be accessed at each tick. 394b0367629SWaiman Long */ 395b0367629SWaiman Long atomic_long_t load_avg ____cacheline_aligned; 396391e43daSPeter Zijlstra #endif 397fa6bddebSAlex Shi #endif 398391e43daSPeter Zijlstra 399391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 400391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 401391e43daSPeter Zijlstra struct rt_rq **rt_rq; 402391e43daSPeter Zijlstra 403391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 404391e43daSPeter Zijlstra #endif 405391e43daSPeter Zijlstra 406391e43daSPeter Zijlstra struct rcu_head rcu; 407391e43daSPeter Zijlstra struct list_head list; 408391e43daSPeter Zijlstra 409391e43daSPeter Zijlstra struct task_group *parent; 410391e43daSPeter Zijlstra struct list_head siblings; 411391e43daSPeter Zijlstra struct list_head children; 412391e43daSPeter Zijlstra 413391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 414391e43daSPeter Zijlstra struct autogroup *autogroup; 415391e43daSPeter Zijlstra #endif 416391e43daSPeter Zijlstra 417391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 4182480c093SPatrick Bellasi 4192480c093SPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK_GROUP 4202480c093SPatrick Bellasi /* The two decimal precision [%] value requested from user-space */ 4212480c093SPatrick Bellasi unsigned int uclamp_pct[UCLAMP_CNT]; 4222480c093SPatrick Bellasi /* Clamp values requested for a task group */ 4232480c093SPatrick Bellasi struct uclamp_se uclamp_req[UCLAMP_CNT]; 4240b60ba2dSPatrick Bellasi /* Effective clamp values used for a task group */ 4250b60ba2dSPatrick Bellasi struct uclamp_se uclamp[UCLAMP_CNT]; 4262480c093SPatrick Bellasi #endif 4272480c093SPatrick Bellasi 428391e43daSPeter Zijlstra }; 429391e43daSPeter Zijlstra 430391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 431391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 432391e43daSPeter Zijlstra 433391e43daSPeter Zijlstra /* 434391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 435391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 436391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 437391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 438391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 439391e43daSPeter Zijlstra * limitation from this.) 440391e43daSPeter Zijlstra */ 441391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 442391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 443391e43daSPeter Zijlstra #endif 444391e43daSPeter Zijlstra 445391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 446391e43daSPeter Zijlstra 447391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 448391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 449391e43daSPeter Zijlstra 450391e43daSPeter Zijlstra /* 451391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 452391e43daSPeter Zijlstra * leaving it for the final time. 453391e43daSPeter Zijlstra * 454391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 455391e43daSPeter Zijlstra */ 456391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 457391e43daSPeter Zijlstra { 458391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 459391e43daSPeter Zijlstra } 460391e43daSPeter Zijlstra 461391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 462391e43daSPeter Zijlstra 463391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 464391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 4658663e24dSPeter Zijlstra extern void online_fair_sched_group(struct task_group *tg); 4666fe1f348SPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg); 467391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 468391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 469391e43daSPeter Zijlstra struct sched_entity *parent); 470391e43daSPeter Zijlstra extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 471391e43daSPeter Zijlstra 472391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 47377a4d1a1SPeter Zijlstra extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 474391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 475391e43daSPeter Zijlstra 476b027789eSMathias Krause extern void unregister_rt_sched_group(struct task_group *tg); 477391e43daSPeter Zijlstra extern void free_rt_sched_group(struct task_group *tg); 478391e43daSPeter Zijlstra extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 479391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 480391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 481391e43daSPeter Zijlstra struct sched_rt_entity *parent); 4828887cd99SNicolas Pitre extern int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us); 4838887cd99SNicolas Pitre extern int sched_group_set_rt_period(struct task_group *tg, u64 rt_period_us); 4848887cd99SNicolas Pitre extern long sched_group_rt_runtime(struct task_group *tg); 4858887cd99SNicolas Pitre extern long sched_group_rt_period(struct task_group *tg); 4868887cd99SNicolas Pitre extern int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk); 487391e43daSPeter Zijlstra 48825cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 48925cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 49025cc7da7SLi Zefan struct task_group *parent); 49125cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 492b027789eSMathias Krause extern void sched_release_group(struct task_group *tg); 49325cc7da7SLi Zefan 49425cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 49525cc7da7SLi Zefan 49625cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 49725cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 498ad936d86SByungchul Park 49930400039SJosh Don extern int sched_group_set_idle(struct task_group *tg, long idle); 50030400039SJosh Don 501ad936d86SByungchul Park #ifdef CONFIG_SMP 502ad936d86SByungchul Park extern void set_task_rq_fair(struct sched_entity *se, 503ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next); 504ad936d86SByungchul Park #else /* !CONFIG_SMP */ 505ad936d86SByungchul Park static inline void set_task_rq_fair(struct sched_entity *se, 506ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next) { } 507ad936d86SByungchul Park #endif /* CONFIG_SMP */ 508ad936d86SByungchul Park #endif /* CONFIG_FAIR_GROUP_SCHED */ 50925cc7da7SLi Zefan 510391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 511391e43daSPeter Zijlstra 512391e43daSPeter Zijlstra struct cfs_bandwidth { }; 513391e43daSPeter Zijlstra 514391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 515391e43daSPeter Zijlstra 516391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 517391e43daSPeter Zijlstra struct cfs_rq { 518391e43daSPeter Zijlstra struct load_weight load; 51997fb7a0aSIngo Molnar unsigned int nr_running; 52043e9f7f2SViresh Kumar unsigned int h_nr_running; /* SCHED_{NORMAL,BATCH,IDLE} */ 521a480addeSJosh Don unsigned int idle_nr_running; /* SCHED_IDLE */ 52243e9f7f2SViresh Kumar unsigned int idle_h_nr_running; /* SCHED_IDLE */ 523391e43daSPeter Zijlstra 524391e43daSPeter Zijlstra u64 exec_clock; 525391e43daSPeter Zijlstra u64 min_vruntime; 526c6047c2eSJoel Fernandes (Google) #ifdef CONFIG_SCHED_CORE 527c6047c2eSJoel Fernandes (Google) unsigned int forceidle_seq; 528c6047c2eSJoel Fernandes (Google) u64 min_vruntime_fi; 529c6047c2eSJoel Fernandes (Google) #endif 530c6047c2eSJoel Fernandes (Google) 531391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 532391e43daSPeter Zijlstra u64 min_vruntime_copy; 533391e43daSPeter Zijlstra #endif 534391e43daSPeter Zijlstra 535bfb06889SDavidlohr Bueso struct rb_root_cached tasks_timeline; 536391e43daSPeter Zijlstra 537391e43daSPeter Zijlstra /* 538391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 539391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 540391e43daSPeter Zijlstra */ 54197fb7a0aSIngo Molnar struct sched_entity *curr; 54297fb7a0aSIngo Molnar struct sched_entity *next; 54397fb7a0aSIngo Molnar struct sched_entity *last; 54497fb7a0aSIngo Molnar struct sched_entity *skip; 545391e43daSPeter Zijlstra 546391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 547391e43daSPeter Zijlstra unsigned int nr_spread_over; 548391e43daSPeter Zijlstra #endif 549391e43daSPeter Zijlstra 5502dac754eSPaul Turner #ifdef CONFIG_SMP 5512dac754eSPaul Turner /* 5529d89c257SYuyang Du * CFS load tracking 5532dac754eSPaul Turner */ 5549d89c257SYuyang Du struct sched_avg avg; 5552a2f5d4eSPeter Zijlstra #ifndef CONFIG_64BIT 5562a2f5d4eSPeter Zijlstra u64 load_last_update_time_copy; 5572a2f5d4eSPeter Zijlstra #endif 5582a2f5d4eSPeter Zijlstra struct { 5592a2f5d4eSPeter Zijlstra raw_spinlock_t lock ____cacheline_aligned; 5602a2f5d4eSPeter Zijlstra int nr; 5612a2f5d4eSPeter Zijlstra unsigned long load_avg; 5622a2f5d4eSPeter Zijlstra unsigned long util_avg; 5639f683953SVincent Guittot unsigned long runnable_avg; 5642a2f5d4eSPeter Zijlstra } removed; 565141965c7SAlex Shi 566c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 5670e2d2aaaSPeter Zijlstra unsigned long tg_load_avg_contrib; 5680e2d2aaaSPeter Zijlstra long propagate; 5690e2d2aaaSPeter Zijlstra long prop_runnable_sum; 5700e2d2aaaSPeter Zijlstra 57182958366SPaul Turner /* 57282958366SPaul Turner * h_load = weight * f(tg) 57382958366SPaul Turner * 57482958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 57582958366SPaul Turner * this group. 57682958366SPaul Turner */ 57782958366SPaul Turner unsigned long h_load; 57868520796SVladimir Davydov u64 last_h_load_update; 57968520796SVladimir Davydov struct sched_entity *h_load_next; 58068520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 58182958366SPaul Turner #endif /* CONFIG_SMP */ 58282958366SPaul Turner 583391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 58497fb7a0aSIngo Molnar struct rq *rq; /* CPU runqueue to which this cfs_rq is attached */ 585391e43daSPeter Zijlstra 586391e43daSPeter Zijlstra /* 587391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 588391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 589391e43daSPeter Zijlstra * (like users, containers etc.) 590391e43daSPeter Zijlstra * 59197fb7a0aSIngo Molnar * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a CPU. 59297fb7a0aSIngo Molnar * This list is used during load balance. 593391e43daSPeter Zijlstra */ 594391e43daSPeter Zijlstra int on_list; 595391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 596391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 597391e43daSPeter Zijlstra 59830400039SJosh Don /* Locally cached copy of our task_group's idle value */ 59930400039SJosh Don int idle; 60030400039SJosh Don 601391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 602391e43daSPeter Zijlstra int runtime_enabled; 603391e43daSPeter Zijlstra s64 runtime_remaining; 604391e43daSPeter Zijlstra 60597fb7a0aSIngo Molnar u64 throttled_clock; 60664eaf507SChengming Zhou u64 throttled_clock_pelt; 60764eaf507SChengming Zhou u64 throttled_clock_pelt_time; 60897fb7a0aSIngo Molnar int throttled; 60997fb7a0aSIngo Molnar int throttle_count; 610391e43daSPeter Zijlstra struct list_head throttled_list; 611391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 612391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 613391e43daSPeter Zijlstra }; 614391e43daSPeter Zijlstra 615391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 616391e43daSPeter Zijlstra { 617391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 618391e43daSPeter Zijlstra } 619391e43daSPeter Zijlstra 620b6366f04SSteven Rostedt /* RT IPI pull logic requires IRQ_WORK */ 6214bdced5cSSteven Rostedt (Red Hat) #if defined(CONFIG_IRQ_WORK) && defined(CONFIG_SMP) 622b6366f04SSteven Rostedt # define HAVE_RT_PUSH_IPI 623b6366f04SSteven Rostedt #endif 624b6366f04SSteven Rostedt 625391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 626391e43daSPeter Zijlstra struct rt_rq { 627391e43daSPeter Zijlstra struct rt_prio_array active; 628c82513e5SPeter Zijlstra unsigned int rt_nr_running; 62901d36d0aSFrederic Weisbecker unsigned int rr_nr_running; 630391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 631391e43daSPeter Zijlstra struct { 632391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 633391e43daSPeter Zijlstra #ifdef CONFIG_SMP 634391e43daSPeter Zijlstra int next; /* next highest */ 635391e43daSPeter Zijlstra #endif 636391e43daSPeter Zijlstra } highest_prio; 637391e43daSPeter Zijlstra #endif 638391e43daSPeter Zijlstra #ifdef CONFIG_SMP 639e6fe3f42SAlexey Dobriyan unsigned int rt_nr_migratory; 640e6fe3f42SAlexey Dobriyan unsigned int rt_nr_total; 641391e43daSPeter Zijlstra int overloaded; 642391e43daSPeter Zijlstra struct plist_head pushable_tasks; 643371bf427SVincent Guittot 644b6366f04SSteven Rostedt #endif /* CONFIG_SMP */ 645f4ebcbc0SKirill Tkhai int rt_queued; 646f4ebcbc0SKirill Tkhai 647391e43daSPeter Zijlstra int rt_throttled; 648391e43daSPeter Zijlstra u64 rt_time; 649391e43daSPeter Zijlstra u64 rt_runtime; 650391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 651391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 652391e43daSPeter Zijlstra 653391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 654e6fe3f42SAlexey Dobriyan unsigned int rt_nr_boosted; 655391e43daSPeter Zijlstra 656391e43daSPeter Zijlstra struct rq *rq; 657391e43daSPeter Zijlstra struct task_group *tg; 658391e43daSPeter Zijlstra #endif 659391e43daSPeter Zijlstra }; 660391e43daSPeter Zijlstra 661296b2ffeSVincent Guittot static inline bool rt_rq_is_runnable(struct rt_rq *rt_rq) 662296b2ffeSVincent Guittot { 663296b2ffeSVincent Guittot return rt_rq->rt_queued && rt_rq->rt_nr_running; 664296b2ffeSVincent Guittot } 665296b2ffeSVincent Guittot 666aab03e05SDario Faggioli /* Deadline class' related fields in a runqueue */ 667aab03e05SDario Faggioli struct dl_rq { 668aab03e05SDario Faggioli /* runqueue is an rbtree, ordered by deadline */ 6692161573eSDavidlohr Bueso struct rb_root_cached root; 670aab03e05SDario Faggioli 671e6fe3f42SAlexey Dobriyan unsigned int dl_nr_running; 6721baca4ceSJuri Lelli 6731baca4ceSJuri Lelli #ifdef CONFIG_SMP 6741baca4ceSJuri Lelli /* 6751baca4ceSJuri Lelli * Deadline values of the currently executing and the 6761baca4ceSJuri Lelli * earliest ready task on this rq. Caching these facilitates 677dfcb245eSIngo Molnar * the decision whether or not a ready but not running task 6781baca4ceSJuri Lelli * should migrate somewhere else. 6791baca4ceSJuri Lelli */ 6801baca4ceSJuri Lelli struct { 6811baca4ceSJuri Lelli u64 curr; 6821baca4ceSJuri Lelli u64 next; 6831baca4ceSJuri Lelli } earliest_dl; 6841baca4ceSJuri Lelli 685e6fe3f42SAlexey Dobriyan unsigned int dl_nr_migratory; 6861baca4ceSJuri Lelli int overloaded; 6871baca4ceSJuri Lelli 6881baca4ceSJuri Lelli /* 6891baca4ceSJuri Lelli * Tasks on this rq that can be pushed away. They are kept in 6901baca4ceSJuri Lelli * an rb-tree, ordered by tasks' deadlines, with caching 6911baca4ceSJuri Lelli * of the leftmost (earliest deadline) element. 6921baca4ceSJuri Lelli */ 6932161573eSDavidlohr Bueso struct rb_root_cached pushable_dl_tasks_root; 694332ac17eSDario Faggioli #else 695332ac17eSDario Faggioli struct dl_bw dl_bw; 6961baca4ceSJuri Lelli #endif 697e36d8677SLuca Abeni /* 698e36d8677SLuca Abeni * "Active utilization" for this runqueue: increased when a 699e36d8677SLuca Abeni * task wakes up (becomes TASK_RUNNING) and decreased when a 700e36d8677SLuca Abeni * task blocks 701e36d8677SLuca Abeni */ 702e36d8677SLuca Abeni u64 running_bw; 7034da3abceSLuca Abeni 7044da3abceSLuca Abeni /* 7058fd27231SLuca Abeni * Utilization of the tasks "assigned" to this runqueue (including 7068fd27231SLuca Abeni * the tasks that are in runqueue and the tasks that executed on this 7078fd27231SLuca Abeni * CPU and blocked). Increased when a task moves to this runqueue, and 7088fd27231SLuca Abeni * decreased when the task moves away (migrates, changes scheduling 7098fd27231SLuca Abeni * policy, or terminates). 7108fd27231SLuca Abeni * This is needed to compute the "inactive utilization" for the 7118fd27231SLuca Abeni * runqueue (inactive utilization = this_bw - running_bw). 7128fd27231SLuca Abeni */ 7138fd27231SLuca Abeni u64 this_bw; 714daec5798SLuca Abeni u64 extra_bw; 7158fd27231SLuca Abeni 7168fd27231SLuca Abeni /* 7174da3abceSLuca Abeni * Inverse of the fraction of CPU utilization that can be reclaimed 7184da3abceSLuca Abeni * by the GRUB algorithm. 7194da3abceSLuca Abeni */ 7204da3abceSLuca Abeni u64 bw_ratio; 721aab03e05SDario Faggioli }; 722aab03e05SDario Faggioli 723c0796298SVincent Guittot #ifdef CONFIG_FAIR_GROUP_SCHED 724c0796298SVincent Guittot /* An entity is a task if it doesn't "own" a runqueue */ 725c0796298SVincent Guittot #define entity_is_task(se) (!se->my_q) 7260dacee1bSVincent Guittot 7279f683953SVincent Guittot static inline void se_update_runnable(struct sched_entity *se) 7289f683953SVincent Guittot { 7299f683953SVincent Guittot if (!entity_is_task(se)) 7309f683953SVincent Guittot se->runnable_weight = se->my_q->h_nr_running; 7319f683953SVincent Guittot } 7329f683953SVincent Guittot 7339f683953SVincent Guittot static inline long se_runnable(struct sched_entity *se) 7349f683953SVincent Guittot { 7359f683953SVincent Guittot if (entity_is_task(se)) 7369f683953SVincent Guittot return !!se->on_rq; 7379f683953SVincent Guittot else 7389f683953SVincent Guittot return se->runnable_weight; 7399f683953SVincent Guittot } 7409f683953SVincent Guittot 741c0796298SVincent Guittot #else 742c0796298SVincent Guittot #define entity_is_task(se) 1 7430dacee1bSVincent Guittot 7449f683953SVincent Guittot static inline void se_update_runnable(struct sched_entity *se) {} 7459f683953SVincent Guittot 7469f683953SVincent Guittot static inline long se_runnable(struct sched_entity *se) 7479f683953SVincent Guittot { 7489f683953SVincent Guittot return !!se->on_rq; 7499f683953SVincent Guittot } 750c0796298SVincent Guittot #endif 751c0796298SVincent Guittot 752391e43daSPeter Zijlstra #ifdef CONFIG_SMP 753c0796298SVincent Guittot /* 754c0796298SVincent Guittot * XXX we want to get rid of these helpers and use the full load resolution. 755c0796298SVincent Guittot */ 756c0796298SVincent Guittot static inline long se_weight(struct sched_entity *se) 757c0796298SVincent Guittot { 758c0796298SVincent Guittot return scale_load_down(se->load.weight); 759c0796298SVincent Guittot } 760c0796298SVincent Guittot 761391e43daSPeter Zijlstra 762afe06efdSTim Chen static inline bool sched_asym_prefer(int a, int b) 763afe06efdSTim Chen { 764afe06efdSTim Chen return arch_asym_cpu_priority(a) > arch_asym_cpu_priority(b); 765afe06efdSTim Chen } 766afe06efdSTim Chen 7676aa140faSQuentin Perret struct perf_domain { 7686aa140faSQuentin Perret struct em_perf_domain *em_pd; 7696aa140faSQuentin Perret struct perf_domain *next; 7706aa140faSQuentin Perret struct rcu_head rcu; 7716aa140faSQuentin Perret }; 7726aa140faSQuentin Perret 773630246a0SQuentin Perret /* Scheduling group status flags */ 774630246a0SQuentin Perret #define SG_OVERLOAD 0x1 /* More than one runnable task on a CPU. */ 7752802bf3cSMorten Rasmussen #define SG_OVERUTILIZED 0x2 /* One or more CPUs are over-utilized. */ 776630246a0SQuentin Perret 777391e43daSPeter Zijlstra /* 778391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 779391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 78097fb7a0aSIngo Molnar * fully partitioning the member CPUs from any other cpuset. Whenever a new 781391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 782391e43daSPeter Zijlstra * object. 783391e43daSPeter Zijlstra * 784391e43daSPeter Zijlstra */ 785391e43daSPeter Zijlstra struct root_domain { 786391e43daSPeter Zijlstra atomic_t refcount; 787391e43daSPeter Zijlstra atomic_t rto_count; 788391e43daSPeter Zijlstra struct rcu_head rcu; 789391e43daSPeter Zijlstra cpumask_var_t span; 790391e43daSPeter Zijlstra cpumask_var_t online; 791391e43daSPeter Zijlstra 792757ffdd7SValentin Schneider /* 793757ffdd7SValentin Schneider * Indicate pullable load on at least one CPU, e.g: 794757ffdd7SValentin Schneider * - More than one runnable task 795757ffdd7SValentin Schneider * - Running task is misfit 796757ffdd7SValentin Schneider */ 797575638d1SValentin Schneider int overload; 7984486edd1STim Chen 7992802bf3cSMorten Rasmussen /* Indicate one or more cpus over-utilized (tipping point) */ 8002802bf3cSMorten Rasmussen int overutilized; 8012802bf3cSMorten Rasmussen 802391e43daSPeter Zijlstra /* 8031baca4ceSJuri Lelli * The bit corresponding to a CPU gets set here if such CPU has more 8041baca4ceSJuri Lelli * than one runnable -deadline task (as it is below for RT tasks). 8051baca4ceSJuri Lelli */ 8061baca4ceSJuri Lelli cpumask_var_t dlo_mask; 8071baca4ceSJuri Lelli atomic_t dlo_count; 808332ac17eSDario Faggioli struct dl_bw dl_bw; 8096bfd6d72SJuri Lelli struct cpudl cpudl; 8101baca4ceSJuri Lelli 81126762423SPeng Liu /* 81226762423SPeng Liu * Indicate whether a root_domain's dl_bw has been checked or 81326762423SPeng Liu * updated. It's monotonously increasing value. 81426762423SPeng Liu * 81526762423SPeng Liu * Also, some corner cases, like 'wrap around' is dangerous, but given 81626762423SPeng Liu * that u64 is 'big enough'. So that shouldn't be a concern. 81726762423SPeng Liu */ 81826762423SPeng Liu u64 visit_gen; 81926762423SPeng Liu 8204bdced5cSSteven Rostedt (Red Hat) #ifdef HAVE_RT_PUSH_IPI 8214bdced5cSSteven Rostedt (Red Hat) /* 8224bdced5cSSteven Rostedt (Red Hat) * For IPI pull requests, loop across the rto_mask. 8234bdced5cSSteven Rostedt (Red Hat) */ 8244bdced5cSSteven Rostedt (Red Hat) struct irq_work rto_push_work; 8254bdced5cSSteven Rostedt (Red Hat) raw_spinlock_t rto_lock; 8264bdced5cSSteven Rostedt (Red Hat) /* These are only updated and read within rto_lock */ 8274bdced5cSSteven Rostedt (Red Hat) int rto_loop; 8284bdced5cSSteven Rostedt (Red Hat) int rto_cpu; 8294bdced5cSSteven Rostedt (Red Hat) /* These atomics are updated outside of a lock */ 8304bdced5cSSteven Rostedt (Red Hat) atomic_t rto_loop_next; 8314bdced5cSSteven Rostedt (Red Hat) atomic_t rto_loop_start; 8324bdced5cSSteven Rostedt (Red Hat) #endif 8331baca4ceSJuri Lelli /* 834391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 835391e43daSPeter Zijlstra * one runnable RT task. 836391e43daSPeter Zijlstra */ 837391e43daSPeter Zijlstra cpumask_var_t rto_mask; 838391e43daSPeter Zijlstra struct cpupri cpupri; 839cd92bfd3SDietmar Eggemann 840cd92bfd3SDietmar Eggemann unsigned long max_cpu_capacity; 8416aa140faSQuentin Perret 8426aa140faSQuentin Perret /* 8436aa140faSQuentin Perret * NULL-terminated list of performance domains intersecting with the 8446aa140faSQuentin Perret * CPUs of the rd. Protected by RCU. 8456aa140faSQuentin Perret */ 8467ba7319fSJoel Fernandes (Google) struct perf_domain __rcu *pd; 847391e43daSPeter Zijlstra }; 848391e43daSPeter Zijlstra 849f2cb1360SIngo Molnar extern void init_defrootdomain(void); 8508d5dc512SPeter Zijlstra extern int sched_init_domains(const struct cpumask *cpu_map); 851f2cb1360SIngo Molnar extern void rq_attach_root(struct rq *rq, struct root_domain *rd); 852364f5665SSteven Rostedt (VMware) extern void sched_get_rd(struct root_domain *rd); 853364f5665SSteven Rostedt (VMware) extern void sched_put_rd(struct root_domain *rd); 854391e43daSPeter Zijlstra 8554bdced5cSSteven Rostedt (Red Hat) #ifdef HAVE_RT_PUSH_IPI 8564bdced5cSSteven Rostedt (Red Hat) extern void rto_push_irq_work_func(struct irq_work *work); 8574bdced5cSSteven Rostedt (Red Hat) #endif 858391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 859391e43daSPeter Zijlstra 86069842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 86169842cbaSPatrick Bellasi /* 86269842cbaSPatrick Bellasi * struct uclamp_bucket - Utilization clamp bucket 86369842cbaSPatrick Bellasi * @value: utilization clamp value for tasks on this clamp bucket 86469842cbaSPatrick Bellasi * @tasks: number of RUNNABLE tasks on this clamp bucket 86569842cbaSPatrick Bellasi * 86669842cbaSPatrick Bellasi * Keep track of how many tasks are RUNNABLE for a given utilization 86769842cbaSPatrick Bellasi * clamp value. 86869842cbaSPatrick Bellasi */ 86969842cbaSPatrick Bellasi struct uclamp_bucket { 87069842cbaSPatrick Bellasi unsigned long value : bits_per(SCHED_CAPACITY_SCALE); 87169842cbaSPatrick Bellasi unsigned long tasks : BITS_PER_LONG - bits_per(SCHED_CAPACITY_SCALE); 87269842cbaSPatrick Bellasi }; 87369842cbaSPatrick Bellasi 87469842cbaSPatrick Bellasi /* 87569842cbaSPatrick Bellasi * struct uclamp_rq - rq's utilization clamp 87669842cbaSPatrick Bellasi * @value: currently active clamp values for a rq 87769842cbaSPatrick Bellasi * @bucket: utilization clamp buckets affecting a rq 87869842cbaSPatrick Bellasi * 87969842cbaSPatrick Bellasi * Keep track of RUNNABLE tasks on a rq to aggregate their clamp values. 88069842cbaSPatrick Bellasi * A clamp value is affecting a rq when there is at least one task RUNNABLE 88169842cbaSPatrick Bellasi * (or actually running) with that value. 88269842cbaSPatrick Bellasi * 88369842cbaSPatrick Bellasi * There are up to UCLAMP_CNT possible different clamp values, currently there 88469842cbaSPatrick Bellasi * are only two: minimum utilization and maximum utilization. 88569842cbaSPatrick Bellasi * 88669842cbaSPatrick Bellasi * All utilization clamping values are MAX aggregated, since: 88769842cbaSPatrick Bellasi * - for util_min: we want to run the CPU at least at the max of the minimum 88869842cbaSPatrick Bellasi * utilization required by its currently RUNNABLE tasks. 88969842cbaSPatrick Bellasi * - for util_max: we want to allow the CPU to run up to the max of the 89069842cbaSPatrick Bellasi * maximum utilization allowed by its currently RUNNABLE tasks. 89169842cbaSPatrick Bellasi * 89269842cbaSPatrick Bellasi * Since on each system we expect only a limited number of different 89369842cbaSPatrick Bellasi * utilization clamp values (UCLAMP_BUCKETS), use a simple array to track 89469842cbaSPatrick Bellasi * the metrics required to compute all the per-rq utilization clamp values. 89569842cbaSPatrick Bellasi */ 89669842cbaSPatrick Bellasi struct uclamp_rq { 89769842cbaSPatrick Bellasi unsigned int value; 89869842cbaSPatrick Bellasi struct uclamp_bucket bucket[UCLAMP_BUCKETS]; 89969842cbaSPatrick Bellasi }; 90046609ce2SQais Yousef 90146609ce2SQais Yousef DECLARE_STATIC_KEY_FALSE(sched_uclamp_used); 90269842cbaSPatrick Bellasi #endif /* CONFIG_UCLAMP_TASK */ 90369842cbaSPatrick Bellasi 904391e43daSPeter Zijlstra /* 905391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 906391e43daSPeter Zijlstra * 907391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 908391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 909391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 910391e43daSPeter Zijlstra */ 911391e43daSPeter Zijlstra struct rq { 912391e43daSPeter Zijlstra /* runqueue lock: */ 9135cb9eaa3SPeter Zijlstra raw_spinlock_t __lock; 914391e43daSPeter Zijlstra 915391e43daSPeter Zijlstra /* 916391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 917391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 918391e43daSPeter Zijlstra */ 919c82513e5SPeter Zijlstra unsigned int nr_running; 9200ec8aa00SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 9210ec8aa00SPeter Zijlstra unsigned int nr_numa_running; 9220ec8aa00SPeter Zijlstra unsigned int nr_preferred_running; 923a4739ecaSSrikar Dronamraju unsigned int numa_migrate_on; 9240ec8aa00SPeter Zijlstra #endif 9253451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 9269fd81dd5SFrederic Weisbecker #ifdef CONFIG_SMP 927e022e0d3SPeter Zijlstra unsigned long last_blocked_load_update_tick; 928f643ea22SVincent Guittot unsigned int has_blocked_load; 92990b5363aSPeter Zijlstra (Intel) call_single_data_t nohz_csd; 9309fd81dd5SFrederic Weisbecker #endif /* CONFIG_SMP */ 93100357f5eSPeter Zijlstra unsigned int nohz_tick_stopped; 932a22e47a4SPeter Zijlstra atomic_t nohz_flags; 9339fd81dd5SFrederic Weisbecker #endif /* CONFIG_NO_HZ_COMMON */ 934dcdedb24SFrederic Weisbecker 935126c2092SPeter Zijlstra #ifdef CONFIG_SMP 936126c2092SPeter Zijlstra unsigned int ttwu_pending; 937126c2092SPeter Zijlstra #endif 938391e43daSPeter Zijlstra u64 nr_switches; 939391e43daSPeter Zijlstra 94069842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 94169842cbaSPatrick Bellasi /* Utilization clamp values based on CPU's RUNNABLE tasks */ 94269842cbaSPatrick Bellasi struct uclamp_rq uclamp[UCLAMP_CNT] ____cacheline_aligned; 943e496187dSPatrick Bellasi unsigned int uclamp_flags; 944e496187dSPatrick Bellasi #define UCLAMP_FLAG_IDLE 0x01 94569842cbaSPatrick Bellasi #endif 94669842cbaSPatrick Bellasi 947391e43daSPeter Zijlstra struct cfs_rq cfs; 948391e43daSPeter Zijlstra struct rt_rq rt; 949aab03e05SDario Faggioli struct dl_rq dl; 950391e43daSPeter Zijlstra 951391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 95297fb7a0aSIngo Molnar /* list of leaf cfs_rq on this CPU: */ 953391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 9549c2791f9SVincent Guittot struct list_head *tmp_alone_branch; 955a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 956a35b6466SPeter Zijlstra 957391e43daSPeter Zijlstra /* 958391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 959391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 960391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 961391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 962391e43daSPeter Zijlstra */ 963e6fe3f42SAlexey Dobriyan unsigned int nr_uninterruptible; 964391e43daSPeter Zijlstra 9654104a562SMadhuparna Bhowmik struct task_struct __rcu *curr; 96697fb7a0aSIngo Molnar struct task_struct *idle; 96797fb7a0aSIngo Molnar struct task_struct *stop; 968391e43daSPeter Zijlstra unsigned long next_balance; 969391e43daSPeter Zijlstra struct mm_struct *prev_mm; 970391e43daSPeter Zijlstra 971cb42c9a3SMatt Fleming unsigned int clock_update_flags; 972391e43daSPeter Zijlstra u64 clock; 97323127296SVincent Guittot /* Ensure that all clocks are in the same cache line */ 97423127296SVincent Guittot u64 clock_task ____cacheline_aligned; 97523127296SVincent Guittot u64 clock_pelt; 97623127296SVincent Guittot unsigned long lost_idle_time; 977391e43daSPeter Zijlstra 978391e43daSPeter Zijlstra atomic_t nr_iowait; 979391e43daSPeter Zijlstra 980c006fac5SPaul Turner #ifdef CONFIG_SCHED_DEBUG 981c006fac5SPaul Turner u64 last_seen_need_resched_ns; 982c006fac5SPaul Turner int ticks_without_resched; 983c006fac5SPaul Turner #endif 984c006fac5SPaul Turner 985227a4aadSMathieu Desnoyers #ifdef CONFIG_MEMBARRIER 986227a4aadSMathieu Desnoyers int membarrier_state; 987227a4aadSMathieu Desnoyers #endif 988227a4aadSMathieu Desnoyers 989391e43daSPeter Zijlstra #ifdef CONFIG_SMP 990391e43daSPeter Zijlstra struct root_domain *rd; 991994aeb7aSJoel Fernandes (Google) struct sched_domain __rcu *sd; 992391e43daSPeter Zijlstra 993ced549faSNicolas Pitre unsigned long cpu_capacity; 994ca6d75e6SVincent Guittot unsigned long cpu_capacity_orig; 995391e43daSPeter Zijlstra 996e3fca9e7SPeter Zijlstra struct callback_head *balance_callback; 997e3fca9e7SPeter Zijlstra 99819a1f5ecSPeter Zijlstra unsigned char nohz_idle_balance; 999391e43daSPeter Zijlstra unsigned char idle_balance; 100097fb7a0aSIngo Molnar 10013b1baa64SMorten Rasmussen unsigned long misfit_task_load; 10023b1baa64SMorten Rasmussen 1003391e43daSPeter Zijlstra /* For active balancing */ 1004391e43daSPeter Zijlstra int active_balance; 1005391e43daSPeter Zijlstra int push_cpu; 1006391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 100797fb7a0aSIngo Molnar 100897fb7a0aSIngo Molnar /* CPU of this runqueue: */ 1009391e43daSPeter Zijlstra int cpu; 1010391e43daSPeter Zijlstra int online; 1011391e43daSPeter Zijlstra 1012367456c7SPeter Zijlstra struct list_head cfs_tasks; 1013367456c7SPeter Zijlstra 1014371bf427SVincent Guittot struct sched_avg avg_rt; 10153727e0e1SVincent Guittot struct sched_avg avg_dl; 101611d4afd4SVincent Guittot #ifdef CONFIG_HAVE_SCHED_AVG_IRQ 101791c27493SVincent Guittot struct sched_avg avg_irq; 101891c27493SVincent Guittot #endif 101976504793SThara Gopinath #ifdef CONFIG_SCHED_THERMAL_PRESSURE 102076504793SThara Gopinath struct sched_avg avg_thermal; 102176504793SThara Gopinath #endif 1022391e43daSPeter Zijlstra u64 idle_stamp; 1023391e43daSPeter Zijlstra u64 avg_idle; 10249bd721c5SJason Low 102594aafc3eSPeter Zijlstra unsigned long wake_stamp; 102694aafc3eSPeter Zijlstra u64 wake_avg_idle; 102794aafc3eSPeter Zijlstra 10289bd721c5SJason Low /* This is used to determine avg_idle's max value */ 10299bd721c5SJason Low u64 max_idle_balance_cost; 1030f2469a1fSThomas Gleixner 1031f2469a1fSThomas Gleixner #ifdef CONFIG_HOTPLUG_CPU 1032f2469a1fSThomas Gleixner struct rcuwait hotplug_wait; 1033f2469a1fSThomas Gleixner #endif 103490b5363aSPeter Zijlstra (Intel) #endif /* CONFIG_SMP */ 1035391e43daSPeter Zijlstra 1036391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 1037391e43daSPeter Zijlstra u64 prev_irq_time; 1038391e43daSPeter Zijlstra #endif 1039391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 1040391e43daSPeter Zijlstra u64 prev_steal_time; 1041391e43daSPeter Zijlstra #endif 1042391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 1043391e43daSPeter Zijlstra u64 prev_steal_time_rq; 1044391e43daSPeter Zijlstra #endif 1045391e43daSPeter Zijlstra 1046391e43daSPeter Zijlstra /* calc_load related fields */ 1047391e43daSPeter Zijlstra unsigned long calc_load_update; 1048391e43daSPeter Zijlstra long calc_load_active; 1049391e43daSPeter Zijlstra 1050391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1051391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1052966a9671SYing Huang call_single_data_t hrtick_csd; 1053391e43daSPeter Zijlstra #endif 1054391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 1055156ec6f4SJuri Lelli ktime_t hrtick_time; 1056391e43daSPeter Zijlstra #endif 1057391e43daSPeter Zijlstra 1058391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 1059391e43daSPeter Zijlstra /* latency stats */ 1060391e43daSPeter Zijlstra struct sched_info rq_sched_info; 1061391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 1062391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 1063391e43daSPeter Zijlstra 1064391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 1065391e43daSPeter Zijlstra unsigned int yld_count; 1066391e43daSPeter Zijlstra 1067391e43daSPeter Zijlstra /* schedule() stats */ 1068391e43daSPeter Zijlstra unsigned int sched_count; 1069391e43daSPeter Zijlstra unsigned int sched_goidle; 1070391e43daSPeter Zijlstra 1071391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 1072391e43daSPeter Zijlstra unsigned int ttwu_count; 1073391e43daSPeter Zijlstra unsigned int ttwu_local; 1074391e43daSPeter Zijlstra #endif 1075391e43daSPeter Zijlstra 1076442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 1077442bf3aaSDaniel Lezcano /* Must be inspected within a rcu lock section */ 1078442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state; 1079442bf3aaSDaniel Lezcano #endif 10803015ef4bSThomas Gleixner 108174d862b6SThomas Gleixner #ifdef CONFIG_SMP 10823015ef4bSThomas Gleixner unsigned int nr_pinned; 10833015ef4bSThomas Gleixner #endif 1084a7c81556SPeter Zijlstra unsigned int push_busy; 1085a7c81556SPeter Zijlstra struct cpu_stop_work push_work; 10869edeaea1SPeter Zijlstra 10879edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 10889edeaea1SPeter Zijlstra /* per rq */ 10899edeaea1SPeter Zijlstra struct rq *core; 1090539f6512SPeter Zijlstra struct task_struct *core_pick; 10919edeaea1SPeter Zijlstra unsigned int core_enabled; 1092539f6512SPeter Zijlstra unsigned int core_sched_seq; 10938a311c74SPeter Zijlstra struct rb_root core_tree; 10948a311c74SPeter Zijlstra 10953c474b32SPeter Zijlstra /* shared state -- careful with sched_core_cpu_deactivate() */ 10968a311c74SPeter Zijlstra unsigned int core_task_seq; 1097539f6512SPeter Zijlstra unsigned int core_pick_seq; 1098539f6512SPeter Zijlstra unsigned long core_cookie; 10994feee7d1SJosh Don unsigned int core_forceidle_count; 1100c6047c2eSJoel Fernandes (Google) unsigned int core_forceidle_seq; 11014feee7d1SJosh Don unsigned int core_forceidle_occupation; 11024feee7d1SJosh Don u64 core_forceidle_start; 11039edeaea1SPeter Zijlstra #endif 1104391e43daSPeter Zijlstra }; 1105391e43daSPeter Zijlstra 110662478d99SVincent Guittot #ifdef CONFIG_FAIR_GROUP_SCHED 110762478d99SVincent Guittot 110862478d99SVincent Guittot /* CPU runqueue to which this cfs_rq is attached */ 110962478d99SVincent Guittot static inline struct rq *rq_of(struct cfs_rq *cfs_rq) 111062478d99SVincent Guittot { 111162478d99SVincent Guittot return cfs_rq->rq; 111262478d99SVincent Guittot } 111362478d99SVincent Guittot 111462478d99SVincent Guittot #else 111562478d99SVincent Guittot 111662478d99SVincent Guittot static inline struct rq *rq_of(struct cfs_rq *cfs_rq) 111762478d99SVincent Guittot { 111862478d99SVincent Guittot return container_of(cfs_rq, struct rq, cfs); 111962478d99SVincent Guittot } 112062478d99SVincent Guittot #endif 112162478d99SVincent Guittot 1122391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 1123391e43daSPeter Zijlstra { 1124391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1125391e43daSPeter Zijlstra return rq->cpu; 1126391e43daSPeter Zijlstra #else 1127391e43daSPeter Zijlstra return 0; 1128391e43daSPeter Zijlstra #endif 1129391e43daSPeter Zijlstra } 1130391e43daSPeter Zijlstra 1131a7c81556SPeter Zijlstra #define MDF_PUSH 0x01 1132a7c81556SPeter Zijlstra 1133a7c81556SPeter Zijlstra static inline bool is_migration_disabled(struct task_struct *p) 1134a7c81556SPeter Zijlstra { 113574d862b6SThomas Gleixner #ifdef CONFIG_SMP 1136a7c81556SPeter Zijlstra return p->migration_disabled; 1137a7c81556SPeter Zijlstra #else 1138a7c81556SPeter Zijlstra return false; 1139a7c81556SPeter Zijlstra #endif 1140a7c81556SPeter Zijlstra } 11411b568f0aSPeter Zijlstra 114297886d9dSAubrey Li struct sched_group; 11439edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 114497886d9dSAubrey Li static inline struct cpumask *sched_group_span(struct sched_group *sg); 11459edeaea1SPeter Zijlstra 11469edeaea1SPeter Zijlstra DECLARE_STATIC_KEY_FALSE(__sched_core_enabled); 11479edeaea1SPeter Zijlstra 11489edeaea1SPeter Zijlstra static inline bool sched_core_enabled(struct rq *rq) 11499edeaea1SPeter Zijlstra { 11509edeaea1SPeter Zijlstra return static_branch_unlikely(&__sched_core_enabled) && rq->core_enabled; 11519edeaea1SPeter Zijlstra } 11529edeaea1SPeter Zijlstra 11539edeaea1SPeter Zijlstra static inline bool sched_core_disabled(void) 11549edeaea1SPeter Zijlstra { 11559edeaea1SPeter Zijlstra return !static_branch_unlikely(&__sched_core_enabled); 11569edeaea1SPeter Zijlstra } 11579edeaea1SPeter Zijlstra 11589ef7e7e3SPeter Zijlstra /* 11599ef7e7e3SPeter Zijlstra * Be careful with this function; not for general use. The return value isn't 11609ef7e7e3SPeter Zijlstra * stable unless you actually hold a relevant rq->__lock. 11619ef7e7e3SPeter Zijlstra */ 11629edeaea1SPeter Zijlstra static inline raw_spinlock_t *rq_lockp(struct rq *rq) 11639edeaea1SPeter Zijlstra { 11649edeaea1SPeter Zijlstra if (sched_core_enabled(rq)) 11659edeaea1SPeter Zijlstra return &rq->core->__lock; 11669edeaea1SPeter Zijlstra 11679edeaea1SPeter Zijlstra return &rq->__lock; 11689edeaea1SPeter Zijlstra } 11699edeaea1SPeter Zijlstra 11709ef7e7e3SPeter Zijlstra static inline raw_spinlock_t *__rq_lockp(struct rq *rq) 11719ef7e7e3SPeter Zijlstra { 11729ef7e7e3SPeter Zijlstra if (rq->core_enabled) 11739ef7e7e3SPeter Zijlstra return &rq->core->__lock; 11749ef7e7e3SPeter Zijlstra 11759ef7e7e3SPeter Zijlstra return &rq->__lock; 11769ef7e7e3SPeter Zijlstra } 11779ef7e7e3SPeter Zijlstra 1178c6047c2eSJoel Fernandes (Google) bool cfs_prio_less(struct task_struct *a, struct task_struct *b, bool fi); 1179c6047c2eSJoel Fernandes (Google) 118097886d9dSAubrey Li /* 118197886d9dSAubrey Li * Helpers to check if the CPU's core cookie matches with the task's cookie 118297886d9dSAubrey Li * when core scheduling is enabled. 118397886d9dSAubrey Li * A special case is that the task's cookie always matches with CPU's core 118497886d9dSAubrey Li * cookie if the CPU is in an idle core. 118597886d9dSAubrey Li */ 118697886d9dSAubrey Li static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p) 118797886d9dSAubrey Li { 118897886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 118997886d9dSAubrey Li if (!sched_core_enabled(rq)) 119097886d9dSAubrey Li return true; 119197886d9dSAubrey Li 119297886d9dSAubrey Li return rq->core->core_cookie == p->core_cookie; 119397886d9dSAubrey Li } 119497886d9dSAubrey Li 119597886d9dSAubrey Li static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p) 119697886d9dSAubrey Li { 119797886d9dSAubrey Li bool idle_core = true; 119897886d9dSAubrey Li int cpu; 119997886d9dSAubrey Li 120097886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 120197886d9dSAubrey Li if (!sched_core_enabled(rq)) 120297886d9dSAubrey Li return true; 120397886d9dSAubrey Li 120497886d9dSAubrey Li for_each_cpu(cpu, cpu_smt_mask(cpu_of(rq))) { 120597886d9dSAubrey Li if (!available_idle_cpu(cpu)) { 120697886d9dSAubrey Li idle_core = false; 120797886d9dSAubrey Li break; 120897886d9dSAubrey Li } 120997886d9dSAubrey Li } 121097886d9dSAubrey Li 121197886d9dSAubrey Li /* 121297886d9dSAubrey Li * A CPU in an idle core is always the best choice for tasks with 121397886d9dSAubrey Li * cookies. 121497886d9dSAubrey Li */ 121597886d9dSAubrey Li return idle_core || rq->core->core_cookie == p->core_cookie; 121697886d9dSAubrey Li } 121797886d9dSAubrey Li 121897886d9dSAubrey Li static inline bool sched_group_cookie_match(struct rq *rq, 121997886d9dSAubrey Li struct task_struct *p, 122097886d9dSAubrey Li struct sched_group *group) 122197886d9dSAubrey Li { 122297886d9dSAubrey Li int cpu; 122397886d9dSAubrey Li 122497886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 122597886d9dSAubrey Li if (!sched_core_enabled(rq)) 122697886d9dSAubrey Li return true; 122797886d9dSAubrey Li 122897886d9dSAubrey Li for_each_cpu_and(cpu, sched_group_span(group), p->cpus_ptr) { 122997886d9dSAubrey Li if (sched_core_cookie_match(rq, p)) 123097886d9dSAubrey Li return true; 123197886d9dSAubrey Li } 123297886d9dSAubrey Li return false; 123397886d9dSAubrey Li } 123497886d9dSAubrey Li 1235d2dfa17bSPeter Zijlstra extern void queue_core_balance(struct rq *rq); 1236d2dfa17bSPeter Zijlstra 12376e33cad0SPeter Zijlstra static inline bool sched_core_enqueued(struct task_struct *p) 12386e33cad0SPeter Zijlstra { 12396e33cad0SPeter Zijlstra return !RB_EMPTY_NODE(&p->core_node); 12406e33cad0SPeter Zijlstra } 12416e33cad0SPeter Zijlstra 12426e33cad0SPeter Zijlstra extern void sched_core_enqueue(struct rq *rq, struct task_struct *p); 12434feee7d1SJosh Don extern void sched_core_dequeue(struct rq *rq, struct task_struct *p, int flags); 12446e33cad0SPeter Zijlstra 12456e33cad0SPeter Zijlstra extern void sched_core_get(void); 12466e33cad0SPeter Zijlstra extern void sched_core_put(void); 12476e33cad0SPeter Zijlstra 12489edeaea1SPeter Zijlstra #else /* !CONFIG_SCHED_CORE */ 12499edeaea1SPeter Zijlstra 12509edeaea1SPeter Zijlstra static inline bool sched_core_enabled(struct rq *rq) 12519edeaea1SPeter Zijlstra { 12529edeaea1SPeter Zijlstra return false; 12539edeaea1SPeter Zijlstra } 12549edeaea1SPeter Zijlstra 1255d66f1b06SPeter Zijlstra static inline bool sched_core_disabled(void) 1256d66f1b06SPeter Zijlstra { 1257d66f1b06SPeter Zijlstra return true; 1258d66f1b06SPeter Zijlstra } 1259d66f1b06SPeter Zijlstra 126039d371b7SPeter Zijlstra static inline raw_spinlock_t *rq_lockp(struct rq *rq) 126139d371b7SPeter Zijlstra { 12625cb9eaa3SPeter Zijlstra return &rq->__lock; 126339d371b7SPeter Zijlstra } 126439d371b7SPeter Zijlstra 12659ef7e7e3SPeter Zijlstra static inline raw_spinlock_t *__rq_lockp(struct rq *rq) 12669ef7e7e3SPeter Zijlstra { 12679ef7e7e3SPeter Zijlstra return &rq->__lock; 12689ef7e7e3SPeter Zijlstra } 12699ef7e7e3SPeter Zijlstra 1270d2dfa17bSPeter Zijlstra static inline void queue_core_balance(struct rq *rq) 1271d2dfa17bSPeter Zijlstra { 1272d2dfa17bSPeter Zijlstra } 1273d2dfa17bSPeter Zijlstra 127497886d9dSAubrey Li static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p) 127597886d9dSAubrey Li { 127697886d9dSAubrey Li return true; 127797886d9dSAubrey Li } 127897886d9dSAubrey Li 127997886d9dSAubrey Li static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p) 128097886d9dSAubrey Li { 128197886d9dSAubrey Li return true; 128297886d9dSAubrey Li } 128397886d9dSAubrey Li 128497886d9dSAubrey Li static inline bool sched_group_cookie_match(struct rq *rq, 128597886d9dSAubrey Li struct task_struct *p, 128697886d9dSAubrey Li struct sched_group *group) 128797886d9dSAubrey Li { 128897886d9dSAubrey Li return true; 128997886d9dSAubrey Li } 12909edeaea1SPeter Zijlstra #endif /* CONFIG_SCHED_CORE */ 12919edeaea1SPeter Zijlstra 129239d371b7SPeter Zijlstra static inline void lockdep_assert_rq_held(struct rq *rq) 129339d371b7SPeter Zijlstra { 12949ef7e7e3SPeter Zijlstra lockdep_assert_held(__rq_lockp(rq)); 129539d371b7SPeter Zijlstra } 129639d371b7SPeter Zijlstra 129739d371b7SPeter Zijlstra extern void raw_spin_rq_lock_nested(struct rq *rq, int subclass); 129839d371b7SPeter Zijlstra extern bool raw_spin_rq_trylock(struct rq *rq); 129939d371b7SPeter Zijlstra extern void raw_spin_rq_unlock(struct rq *rq); 130039d371b7SPeter Zijlstra 130139d371b7SPeter Zijlstra static inline void raw_spin_rq_lock(struct rq *rq) 130239d371b7SPeter Zijlstra { 130339d371b7SPeter Zijlstra raw_spin_rq_lock_nested(rq, 0); 130439d371b7SPeter Zijlstra } 130539d371b7SPeter Zijlstra 130639d371b7SPeter Zijlstra static inline void raw_spin_rq_lock_irq(struct rq *rq) 130739d371b7SPeter Zijlstra { 130839d371b7SPeter Zijlstra local_irq_disable(); 130939d371b7SPeter Zijlstra raw_spin_rq_lock(rq); 131039d371b7SPeter Zijlstra } 131139d371b7SPeter Zijlstra 131239d371b7SPeter Zijlstra static inline void raw_spin_rq_unlock_irq(struct rq *rq) 131339d371b7SPeter Zijlstra { 131439d371b7SPeter Zijlstra raw_spin_rq_unlock(rq); 131539d371b7SPeter Zijlstra local_irq_enable(); 131639d371b7SPeter Zijlstra } 131739d371b7SPeter Zijlstra 131839d371b7SPeter Zijlstra static inline unsigned long _raw_spin_rq_lock_irqsave(struct rq *rq) 131939d371b7SPeter Zijlstra { 132039d371b7SPeter Zijlstra unsigned long flags; 132139d371b7SPeter Zijlstra local_irq_save(flags); 132239d371b7SPeter Zijlstra raw_spin_rq_lock(rq); 132339d371b7SPeter Zijlstra return flags; 132439d371b7SPeter Zijlstra } 132539d371b7SPeter Zijlstra 132639d371b7SPeter Zijlstra static inline void raw_spin_rq_unlock_irqrestore(struct rq *rq, unsigned long flags) 132739d371b7SPeter Zijlstra { 132839d371b7SPeter Zijlstra raw_spin_rq_unlock(rq); 132939d371b7SPeter Zijlstra local_irq_restore(flags); 133039d371b7SPeter Zijlstra } 133139d371b7SPeter Zijlstra 133239d371b7SPeter Zijlstra #define raw_spin_rq_lock_irqsave(rq, flags) \ 133339d371b7SPeter Zijlstra do { \ 133439d371b7SPeter Zijlstra flags = _raw_spin_rq_lock_irqsave(rq); \ 133539d371b7SPeter Zijlstra } while (0) 133639d371b7SPeter Zijlstra 13371b568f0aSPeter Zijlstra #ifdef CONFIG_SCHED_SMT 13381b568f0aSPeter Zijlstra extern void __update_idle_core(struct rq *rq); 13391b568f0aSPeter Zijlstra 13401b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) 13411b568f0aSPeter Zijlstra { 13421b568f0aSPeter Zijlstra if (static_branch_unlikely(&sched_smt_present)) 13431b568f0aSPeter Zijlstra __update_idle_core(rq); 13441b568f0aSPeter Zijlstra } 13451b568f0aSPeter Zijlstra 13461b568f0aSPeter Zijlstra #else 13471b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) { } 13481b568f0aSPeter Zijlstra #endif 13491b568f0aSPeter Zijlstra 13508b06c55bSPranith Kumar DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); 1351391e43daSPeter Zijlstra 1352518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 13534a32fea9SChristoph Lameter #define this_rq() this_cpu_ptr(&runqueues) 1354518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 1355518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 13564a32fea9SChristoph Lameter #define raw_rq() raw_cpu_ptr(&runqueues) 1357518cd623SPeter Zijlstra 13588a311c74SPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 13598a311c74SPeter Zijlstra static inline struct task_struct *task_of(struct sched_entity *se) 13608a311c74SPeter Zijlstra { 13618a311c74SPeter Zijlstra SCHED_WARN_ON(!entity_is_task(se)); 13628a311c74SPeter Zijlstra return container_of(se, struct task_struct, se); 13638a311c74SPeter Zijlstra } 13648a311c74SPeter Zijlstra 13658a311c74SPeter Zijlstra static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) 13668a311c74SPeter Zijlstra { 13678a311c74SPeter Zijlstra return p->se.cfs_rq; 13688a311c74SPeter Zijlstra } 13698a311c74SPeter Zijlstra 13708a311c74SPeter Zijlstra /* runqueue on which this entity is (to be) queued */ 13718a311c74SPeter Zijlstra static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) 13728a311c74SPeter Zijlstra { 13738a311c74SPeter Zijlstra return se->cfs_rq; 13748a311c74SPeter Zijlstra } 13758a311c74SPeter Zijlstra 13768a311c74SPeter Zijlstra /* runqueue "owned" by this group */ 13778a311c74SPeter Zijlstra static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) 13788a311c74SPeter Zijlstra { 13798a311c74SPeter Zijlstra return grp->my_q; 13808a311c74SPeter Zijlstra } 13818a311c74SPeter Zijlstra 13828a311c74SPeter Zijlstra #else 13838a311c74SPeter Zijlstra 13848a311c74SPeter Zijlstra static inline struct task_struct *task_of(struct sched_entity *se) 13858a311c74SPeter Zijlstra { 13868a311c74SPeter Zijlstra return container_of(se, struct task_struct, se); 13878a311c74SPeter Zijlstra } 13888a311c74SPeter Zijlstra 13898a311c74SPeter Zijlstra static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) 13908a311c74SPeter Zijlstra { 13918a311c74SPeter Zijlstra return &task_rq(p)->cfs; 13928a311c74SPeter Zijlstra } 13938a311c74SPeter Zijlstra 13948a311c74SPeter Zijlstra static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se) 13958a311c74SPeter Zijlstra { 13968a311c74SPeter Zijlstra struct task_struct *p = task_of(se); 13978a311c74SPeter Zijlstra struct rq *rq = task_rq(p); 13988a311c74SPeter Zijlstra 13998a311c74SPeter Zijlstra return &rq->cfs; 14008a311c74SPeter Zijlstra } 14018a311c74SPeter Zijlstra 14028a311c74SPeter Zijlstra /* runqueue "owned" by this group */ 14038a311c74SPeter Zijlstra static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) 14048a311c74SPeter Zijlstra { 14058a311c74SPeter Zijlstra return NULL; 14068a311c74SPeter Zijlstra } 14078a311c74SPeter Zijlstra #endif 14088a311c74SPeter Zijlstra 14091f351d7fSJohannes Weiner extern void update_rq_clock(struct rq *rq); 14101f351d7fSJohannes Weiner 1411cb42c9a3SMatt Fleming /* 1412cb42c9a3SMatt Fleming * rq::clock_update_flags bits 1413cb42c9a3SMatt Fleming * 1414cb42c9a3SMatt Fleming * %RQCF_REQ_SKIP - will request skipping of clock update on the next 1415cb42c9a3SMatt Fleming * call to __schedule(). This is an optimisation to avoid 1416cb42c9a3SMatt Fleming * neighbouring rq clock updates. 1417cb42c9a3SMatt Fleming * 1418cb42c9a3SMatt Fleming * %RQCF_ACT_SKIP - is set from inside of __schedule() when skipping is 1419cb42c9a3SMatt Fleming * in effect and calls to update_rq_clock() are being ignored. 1420cb42c9a3SMatt Fleming * 1421cb42c9a3SMatt Fleming * %RQCF_UPDATED - is a debug flag that indicates whether a call has been 1422cb42c9a3SMatt Fleming * made to update_rq_clock() since the last time rq::lock was pinned. 1423cb42c9a3SMatt Fleming * 1424cb42c9a3SMatt Fleming * If inside of __schedule(), clock_update_flags will have been 1425cb42c9a3SMatt Fleming * shifted left (a left shift is a cheap operation for the fast path 1426cb42c9a3SMatt Fleming * to promote %RQCF_REQ_SKIP to %RQCF_ACT_SKIP), so you must use, 1427cb42c9a3SMatt Fleming * 1428cb42c9a3SMatt Fleming * if (rq-clock_update_flags >= RQCF_UPDATED) 1429cb42c9a3SMatt Fleming * 14303b03706fSIngo Molnar * to check if %RQCF_UPDATED is set. It'll never be shifted more than 1431cb42c9a3SMatt Fleming * one position though, because the next rq_unpin_lock() will shift it 1432cb42c9a3SMatt Fleming * back. 1433cb42c9a3SMatt Fleming */ 1434cb42c9a3SMatt Fleming #define RQCF_REQ_SKIP 0x01 1435cb42c9a3SMatt Fleming #define RQCF_ACT_SKIP 0x02 1436cb42c9a3SMatt Fleming #define RQCF_UPDATED 0x04 1437cb42c9a3SMatt Fleming 1438cb42c9a3SMatt Fleming static inline void assert_clock_updated(struct rq *rq) 1439cb42c9a3SMatt Fleming { 1440cb42c9a3SMatt Fleming /* 1441cb42c9a3SMatt Fleming * The only reason for not seeing a clock update since the 1442cb42c9a3SMatt Fleming * last rq_pin_lock() is if we're currently skipping updates. 1443cb42c9a3SMatt Fleming */ 1444cb42c9a3SMatt Fleming SCHED_WARN_ON(rq->clock_update_flags < RQCF_ACT_SKIP); 1445cb42c9a3SMatt Fleming } 1446cb42c9a3SMatt Fleming 144778becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 144878becc27SFrederic Weisbecker { 14495cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1450cb42c9a3SMatt Fleming assert_clock_updated(rq); 1451cb42c9a3SMatt Fleming 145278becc27SFrederic Weisbecker return rq->clock; 145378becc27SFrederic Weisbecker } 145478becc27SFrederic Weisbecker 145578becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 145678becc27SFrederic Weisbecker { 14575cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1458cb42c9a3SMatt Fleming assert_clock_updated(rq); 1459cb42c9a3SMatt Fleming 146078becc27SFrederic Weisbecker return rq->clock_task; 146178becc27SFrederic Weisbecker } 146278becc27SFrederic Weisbecker 146305289b90SThara Gopinath /** 146405289b90SThara Gopinath * By default the decay is the default pelt decay period. 146505289b90SThara Gopinath * The decay shift can change the decay period in 146605289b90SThara Gopinath * multiples of 32. 146705289b90SThara Gopinath * Decay shift Decay period(ms) 146805289b90SThara Gopinath * 0 32 146905289b90SThara Gopinath * 1 64 147005289b90SThara Gopinath * 2 128 147105289b90SThara Gopinath * 3 256 147205289b90SThara Gopinath * 4 512 147305289b90SThara Gopinath */ 147405289b90SThara Gopinath extern int sched_thermal_decay_shift; 147505289b90SThara Gopinath 147605289b90SThara Gopinath static inline u64 rq_clock_thermal(struct rq *rq) 147705289b90SThara Gopinath { 147805289b90SThara Gopinath return rq_clock_task(rq) >> sched_thermal_decay_shift; 147905289b90SThara Gopinath } 148005289b90SThara Gopinath 1481adcc8da8SDavidlohr Bueso static inline void rq_clock_skip_update(struct rq *rq) 14829edfbfedSPeter Zijlstra { 14835cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1484cb42c9a3SMatt Fleming rq->clock_update_flags |= RQCF_REQ_SKIP; 1485adcc8da8SDavidlohr Bueso } 1486adcc8da8SDavidlohr Bueso 1487adcc8da8SDavidlohr Bueso /* 1488595058b6SDavidlohr Bueso * See rt task throttling, which is the only time a skip 14893b03706fSIngo Molnar * request is canceled. 1490adcc8da8SDavidlohr Bueso */ 1491adcc8da8SDavidlohr Bueso static inline void rq_clock_cancel_skipupdate(struct rq *rq) 1492adcc8da8SDavidlohr Bueso { 14935cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1494cb42c9a3SMatt Fleming rq->clock_update_flags &= ~RQCF_REQ_SKIP; 14959edfbfedSPeter Zijlstra } 14969edfbfedSPeter Zijlstra 1497d8ac8971SMatt Fleming struct rq_flags { 1498d8ac8971SMatt Fleming unsigned long flags; 1499d8ac8971SMatt Fleming struct pin_cookie cookie; 1500cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1501cb42c9a3SMatt Fleming /* 1502cb42c9a3SMatt Fleming * A copy of (rq::clock_update_flags & RQCF_UPDATED) for the 1503cb42c9a3SMatt Fleming * current pin context is stashed here in case it needs to be 1504cb42c9a3SMatt Fleming * restored in rq_repin_lock(). 1505cb42c9a3SMatt Fleming */ 1506cb42c9a3SMatt Fleming unsigned int clock_update_flags; 1507cb42c9a3SMatt Fleming #endif 1508d8ac8971SMatt Fleming }; 1509d8ac8971SMatt Fleming 1510ae792702SPeter Zijlstra extern struct callback_head balance_push_callback; 1511ae792702SPeter Zijlstra 151258877d34SPeter Zijlstra /* 151358877d34SPeter Zijlstra * Lockdep annotation that avoids accidental unlocks; it's like a 151458877d34SPeter Zijlstra * sticky/continuous lockdep_assert_held(). 151558877d34SPeter Zijlstra * 151658877d34SPeter Zijlstra * This avoids code that has access to 'struct rq *rq' (basically everything in 151758877d34SPeter Zijlstra * the scheduler) from accidentally unlocking the rq if they do not also have a 151858877d34SPeter Zijlstra * copy of the (on-stack) 'struct rq_flags rf'. 151958877d34SPeter Zijlstra * 152058877d34SPeter Zijlstra * Also see Documentation/locking/lockdep-design.rst. 152158877d34SPeter Zijlstra */ 1522d8ac8971SMatt Fleming static inline void rq_pin_lock(struct rq *rq, struct rq_flags *rf) 1523d8ac8971SMatt Fleming { 15249ef7e7e3SPeter Zijlstra rf->cookie = lockdep_pin_lock(__rq_lockp(rq)); 1525cb42c9a3SMatt Fleming 1526cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1527cb42c9a3SMatt Fleming rq->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 1528cb42c9a3SMatt Fleming rf->clock_update_flags = 0; 1529565790d2SPeter Zijlstra #ifdef CONFIG_SMP 1530ae792702SPeter Zijlstra SCHED_WARN_ON(rq->balance_callback && rq->balance_callback != &balance_push_callback); 1531ae792702SPeter Zijlstra #endif 1532565790d2SPeter Zijlstra #endif 1533d8ac8971SMatt Fleming } 1534d8ac8971SMatt Fleming 1535d8ac8971SMatt Fleming static inline void rq_unpin_lock(struct rq *rq, struct rq_flags *rf) 1536d8ac8971SMatt Fleming { 1537cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1538cb42c9a3SMatt Fleming if (rq->clock_update_flags > RQCF_ACT_SKIP) 1539cb42c9a3SMatt Fleming rf->clock_update_flags = RQCF_UPDATED; 1540cb42c9a3SMatt Fleming #endif 1541cb42c9a3SMatt Fleming 15429ef7e7e3SPeter Zijlstra lockdep_unpin_lock(__rq_lockp(rq), rf->cookie); 1543d8ac8971SMatt Fleming } 1544d8ac8971SMatt Fleming 1545d8ac8971SMatt Fleming static inline void rq_repin_lock(struct rq *rq, struct rq_flags *rf) 1546d8ac8971SMatt Fleming { 15479ef7e7e3SPeter Zijlstra lockdep_repin_lock(__rq_lockp(rq), rf->cookie); 1548cb42c9a3SMatt Fleming 1549cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1550cb42c9a3SMatt Fleming /* 1551cb42c9a3SMatt Fleming * Restore the value we stashed in @rf for this pin context. 1552cb42c9a3SMatt Fleming */ 1553cb42c9a3SMatt Fleming rq->clock_update_flags |= rf->clock_update_flags; 1554cb42c9a3SMatt Fleming #endif 1555d8ac8971SMatt Fleming } 1556d8ac8971SMatt Fleming 15571f351d7fSJohannes Weiner struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf) 15581f351d7fSJohannes Weiner __acquires(rq->lock); 15591f351d7fSJohannes Weiner 15601f351d7fSJohannes Weiner struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf) 15611f351d7fSJohannes Weiner __acquires(p->pi_lock) 15621f351d7fSJohannes Weiner __acquires(rq->lock); 15631f351d7fSJohannes Weiner 15641f351d7fSJohannes Weiner static inline void __task_rq_unlock(struct rq *rq, struct rq_flags *rf) 15651f351d7fSJohannes Weiner __releases(rq->lock) 15661f351d7fSJohannes Weiner { 15671f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 15685cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 15691f351d7fSJohannes Weiner } 15701f351d7fSJohannes Weiner 15711f351d7fSJohannes Weiner static inline void 15721f351d7fSJohannes Weiner task_rq_unlock(struct rq *rq, struct task_struct *p, struct rq_flags *rf) 15731f351d7fSJohannes Weiner __releases(rq->lock) 15741f351d7fSJohannes Weiner __releases(p->pi_lock) 15751f351d7fSJohannes Weiner { 15761f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 15775cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 15781f351d7fSJohannes Weiner raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags); 15791f351d7fSJohannes Weiner } 15801f351d7fSJohannes Weiner 15811f351d7fSJohannes Weiner static inline void 15821f351d7fSJohannes Weiner rq_lock_irqsave(struct rq *rq, struct rq_flags *rf) 15831f351d7fSJohannes Weiner __acquires(rq->lock) 15841f351d7fSJohannes Weiner { 15855cb9eaa3SPeter Zijlstra raw_spin_rq_lock_irqsave(rq, rf->flags); 15861f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 15871f351d7fSJohannes Weiner } 15881f351d7fSJohannes Weiner 15891f351d7fSJohannes Weiner static inline void 15901f351d7fSJohannes Weiner rq_lock_irq(struct rq *rq, struct rq_flags *rf) 15911f351d7fSJohannes Weiner __acquires(rq->lock) 15921f351d7fSJohannes Weiner { 15935cb9eaa3SPeter Zijlstra raw_spin_rq_lock_irq(rq); 15941f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 15951f351d7fSJohannes Weiner } 15961f351d7fSJohannes Weiner 15971f351d7fSJohannes Weiner static inline void 15981f351d7fSJohannes Weiner rq_lock(struct rq *rq, struct rq_flags *rf) 15991f351d7fSJohannes Weiner __acquires(rq->lock) 16001f351d7fSJohannes Weiner { 16015cb9eaa3SPeter Zijlstra raw_spin_rq_lock(rq); 16021f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 16031f351d7fSJohannes Weiner } 16041f351d7fSJohannes Weiner 16051f351d7fSJohannes Weiner static inline void 16061f351d7fSJohannes Weiner rq_unlock_irqrestore(struct rq *rq, struct rq_flags *rf) 16071f351d7fSJohannes Weiner __releases(rq->lock) 16081f351d7fSJohannes Weiner { 16091f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16105cb9eaa3SPeter Zijlstra raw_spin_rq_unlock_irqrestore(rq, rf->flags); 16111f351d7fSJohannes Weiner } 16121f351d7fSJohannes Weiner 16131f351d7fSJohannes Weiner static inline void 16141f351d7fSJohannes Weiner rq_unlock_irq(struct rq *rq, struct rq_flags *rf) 16151f351d7fSJohannes Weiner __releases(rq->lock) 16161f351d7fSJohannes Weiner { 16171f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16185cb9eaa3SPeter Zijlstra raw_spin_rq_unlock_irq(rq); 16191f351d7fSJohannes Weiner } 16201f351d7fSJohannes Weiner 16211f351d7fSJohannes Weiner static inline void 16221f351d7fSJohannes Weiner rq_unlock(struct rq *rq, struct rq_flags *rf) 16231f351d7fSJohannes Weiner __releases(rq->lock) 16241f351d7fSJohannes Weiner { 16251f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16265cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 16271f351d7fSJohannes Weiner } 16281f351d7fSJohannes Weiner 1629246b3b33SJohannes Weiner static inline struct rq * 1630246b3b33SJohannes Weiner this_rq_lock_irq(struct rq_flags *rf) 1631246b3b33SJohannes Weiner __acquires(rq->lock) 1632246b3b33SJohannes Weiner { 1633246b3b33SJohannes Weiner struct rq *rq; 1634246b3b33SJohannes Weiner 1635246b3b33SJohannes Weiner local_irq_disable(); 1636246b3b33SJohannes Weiner rq = this_rq(); 1637246b3b33SJohannes Weiner rq_lock(rq, rf); 1638246b3b33SJohannes Weiner return rq; 1639246b3b33SJohannes Weiner } 1640246b3b33SJohannes Weiner 16419942f79bSRik van Riel #ifdef CONFIG_NUMA 1642e3fe70b1SRik van Riel enum numa_topology_type { 1643e3fe70b1SRik van Riel NUMA_DIRECT, 1644e3fe70b1SRik van Riel NUMA_GLUELESS_MESH, 1645e3fe70b1SRik van Riel NUMA_BACKPLANE, 1646e3fe70b1SRik van Riel }; 1647e3fe70b1SRik van Riel extern enum numa_topology_type sched_numa_topology_type; 16489942f79bSRik van Riel extern int sched_max_numa_distance; 16499942f79bSRik van Riel extern bool find_numa_distance(int distance); 16500fb3978bSHuang Ying extern void sched_init_numa(int offline_node); 16510fb3978bSHuang Ying extern void sched_update_numa(int cpu, bool online); 1652f2cb1360SIngo Molnar extern void sched_domains_numa_masks_set(unsigned int cpu); 1653f2cb1360SIngo Molnar extern void sched_domains_numa_masks_clear(unsigned int cpu); 1654e0e8d491SWanpeng Li extern int sched_numa_find_closest(const struct cpumask *cpus, int cpu); 1655f2cb1360SIngo Molnar #else 16560fb3978bSHuang Ying static inline void sched_init_numa(int offline_node) { } 16570fb3978bSHuang Ying static inline void sched_update_numa(int cpu, bool online) { } 1658f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_set(unsigned int cpu) { } 1659f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_clear(unsigned int cpu) { } 1660e0e8d491SWanpeng Li static inline int sched_numa_find_closest(const struct cpumask *cpus, int cpu) 1661e0e8d491SWanpeng Li { 1662e0e8d491SWanpeng Li return nr_cpu_ids; 1663e0e8d491SWanpeng Li } 1664f2cb1360SIngo Molnar #endif 1665f2cb1360SIngo Molnar 1666f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 166744dba3d5SIulia Manda /* The regions in numa_faults array from task_struct */ 166844dba3d5SIulia Manda enum numa_faults_stats { 166944dba3d5SIulia Manda NUMA_MEM = 0, 167044dba3d5SIulia Manda NUMA_CPU, 167144dba3d5SIulia Manda NUMA_MEMBUF, 167244dba3d5SIulia Manda NUMA_CPUBUF 167344dba3d5SIulia Manda }; 16740ec8aa00SPeter Zijlstra extern void sched_setnuma(struct task_struct *p, int node); 1675e6628d5bSMel Gorman extern int migrate_task_to(struct task_struct *p, int cpu); 16760ad4e3dfSSrikar Dronamraju extern int migrate_swap(struct task_struct *p, struct task_struct *t, 16770ad4e3dfSSrikar Dronamraju int cpu, int scpu); 167813784475SMel Gorman extern void init_numa_balancing(unsigned long clone_flags, struct task_struct *p); 167913784475SMel Gorman #else 168013784475SMel Gorman static inline void 168113784475SMel Gorman init_numa_balancing(unsigned long clone_flags, struct task_struct *p) 168213784475SMel Gorman { 168313784475SMel Gorman } 1684f809ca9aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 1685f809ca9aSMel Gorman 1686518cd623SPeter Zijlstra #ifdef CONFIG_SMP 1687518cd623SPeter Zijlstra 1688e3fca9e7SPeter Zijlstra static inline void 1689e3fca9e7SPeter Zijlstra queue_balance_callback(struct rq *rq, 1690e3fca9e7SPeter Zijlstra struct callback_head *head, 1691e3fca9e7SPeter Zijlstra void (*func)(struct rq *rq)) 1692e3fca9e7SPeter Zijlstra { 16935cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1694e3fca9e7SPeter Zijlstra 1695ae792702SPeter Zijlstra if (unlikely(head->next || rq->balance_callback == &balance_push_callback)) 1696e3fca9e7SPeter Zijlstra return; 1697e3fca9e7SPeter Zijlstra 1698e3fca9e7SPeter Zijlstra head->func = (void (*)(struct callback_head *))func; 1699e3fca9e7SPeter Zijlstra head->next = rq->balance_callback; 1700e3fca9e7SPeter Zijlstra rq->balance_callback = head; 1701e3fca9e7SPeter Zijlstra } 1702e3fca9e7SPeter Zijlstra 1703391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 1704391e43daSPeter Zijlstra rcu_dereference_check((p), \ 1705391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 1706391e43daSPeter Zijlstra 1707391e43daSPeter Zijlstra /* 1708391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 1709337e9b07SPaul E. McKenney * See destroy_sched_domains: call_rcu for details. 1710391e43daSPeter Zijlstra * 1711391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 1712391e43daSPeter Zijlstra * preempt-disabled sections. 1713391e43daSPeter Zijlstra */ 1714391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 1715518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 1716518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 1717391e43daSPeter Zijlstra 1718518cd623SPeter Zijlstra /** 1719518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 172097fb7a0aSIngo Molnar * @cpu: The CPU whose highest level of sched domain is to 1721518cd623SPeter Zijlstra * be returned. 1722518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 172397fb7a0aSIngo Molnar * for the given CPU. 1724518cd623SPeter Zijlstra * 172597fb7a0aSIngo Molnar * Returns the highest sched_domain of a CPU which contains the given flag. 1726518cd623SPeter Zijlstra */ 1727518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 1728518cd623SPeter Zijlstra { 1729518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 1730518cd623SPeter Zijlstra 1731518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 1732518cd623SPeter Zijlstra if (!(sd->flags & flag)) 1733518cd623SPeter Zijlstra break; 1734518cd623SPeter Zijlstra hsd = sd; 1735518cd623SPeter Zijlstra } 1736518cd623SPeter Zijlstra 1737518cd623SPeter Zijlstra return hsd; 1738518cd623SPeter Zijlstra } 1739518cd623SPeter Zijlstra 1740fb13c7eeSMel Gorman static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) 1741fb13c7eeSMel Gorman { 1742fb13c7eeSMel Gorman struct sched_domain *sd; 1743fb13c7eeSMel Gorman 1744fb13c7eeSMel Gorman for_each_domain(cpu, sd) { 1745fb13c7eeSMel Gorman if (sd->flags & flag) 1746fb13c7eeSMel Gorman break; 1747fb13c7eeSMel Gorman } 1748fb13c7eeSMel Gorman 1749fb13c7eeSMel Gorman return sd; 1750fb13c7eeSMel Gorman } 1751fb13c7eeSMel Gorman 1752994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_llc); 17537d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 1754518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 1755994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain_shared __rcu *, sd_llc_shared); 1756994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_numa); 1757994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_packing); 1758994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_cpucapacity); 1759df054e84SMorten Rasmussen extern struct static_key_false sched_asym_cpucapacity; 1760518cd623SPeter Zijlstra 176163b2ca30SNicolas Pitre struct sched_group_capacity { 17625e6521eaSLi Zefan atomic_t ref; 17635e6521eaSLi Zefan /* 1764172895e6SYuyang Du * CPU capacity of this group, SCHED_CAPACITY_SCALE being max capacity 176563b2ca30SNicolas Pitre * for a single CPU. 17665e6521eaSLi Zefan */ 1767bf475ce0SMorten Rasmussen unsigned long capacity; 1768bf475ce0SMorten Rasmussen unsigned long min_capacity; /* Min per-CPU capacity in group */ 1769e3d6d0cbSMorten Rasmussen unsigned long max_capacity; /* Max per-CPU capacity in group */ 17705e6521eaSLi Zefan unsigned long next_update; 177163b2ca30SNicolas Pitre int imbalance; /* XXX unrelated to capacity but shared group state */ 17725e6521eaSLi Zefan 1773005f874dSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 1774005f874dSPeter Zijlstra int id; 1775005f874dSPeter Zijlstra #endif 1776005f874dSPeter Zijlstra 1777eba9f082Szhuguangqing unsigned long cpumask[]; /* Balance mask */ 17785e6521eaSLi Zefan }; 17795e6521eaSLi Zefan 17805e6521eaSLi Zefan struct sched_group { 17815e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 17825e6521eaSLi Zefan atomic_t ref; 17835e6521eaSLi Zefan 17845e6521eaSLi Zefan unsigned int group_weight; 178563b2ca30SNicolas Pitre struct sched_group_capacity *sgc; 178697fb7a0aSIngo Molnar int asym_prefer_cpu; /* CPU of highest priority in group */ 178716d364baSRicardo Neri int flags; 17885e6521eaSLi Zefan 17895e6521eaSLi Zefan /* 17905e6521eaSLi Zefan * The CPUs this group covers. 17915e6521eaSLi Zefan * 17925e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 17935e6521eaSLi Zefan * by attaching extra space to the end of the structure, 17945e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 17955e6521eaSLi Zefan */ 179604f5c362SGustavo A. R. Silva unsigned long cpumask[]; 17975e6521eaSLi Zefan }; 17985e6521eaSLi Zefan 1799ae4df9d6SPeter Zijlstra static inline struct cpumask *sched_group_span(struct sched_group *sg) 18005e6521eaSLi Zefan { 18015e6521eaSLi Zefan return to_cpumask(sg->cpumask); 18025e6521eaSLi Zefan } 18035e6521eaSLi Zefan 18045e6521eaSLi Zefan /* 1805e5c14b1fSPeter Zijlstra * See build_balance_mask(). 18065e6521eaSLi Zefan */ 1807e5c14b1fSPeter Zijlstra static inline struct cpumask *group_balance_mask(struct sched_group *sg) 18085e6521eaSLi Zefan { 180963b2ca30SNicolas Pitre return to_cpumask(sg->sgc->cpumask); 18105e6521eaSLi Zefan } 18115e6521eaSLi Zefan 18125e6521eaSLi Zefan /** 181397fb7a0aSIngo Molnar * group_first_cpu - Returns the first CPU in the cpumask of a sched_group. 181497fb7a0aSIngo Molnar * @group: The group whose first CPU is to be returned. 18155e6521eaSLi Zefan */ 18165e6521eaSLi Zefan static inline unsigned int group_first_cpu(struct sched_group *group) 18175e6521eaSLi Zefan { 1818ae4df9d6SPeter Zijlstra return cpumask_first(sched_group_span(group)); 18195e6521eaSLi Zefan } 18205e6521eaSLi Zefan 1821c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 1822c1174876SPeter Zijlstra 18233b87f136SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 18243b87f136SPeter Zijlstra void update_sched_domain_debugfs(void); 1825bbdacdfeSPeter Zijlstra void dirty_sched_domain_sysctl(int cpu); 18263866e845SSteven Rostedt (Red Hat) #else 18273b87f136SPeter Zijlstra static inline void update_sched_domain_debugfs(void) 18283866e845SSteven Rostedt (Red Hat) { 18293866e845SSteven Rostedt (Red Hat) } 1830bbdacdfeSPeter Zijlstra static inline void dirty_sched_domain_sysctl(int cpu) 1831bbdacdfeSPeter Zijlstra { 1832bbdacdfeSPeter Zijlstra } 18333866e845SSteven Rostedt (Red Hat) #endif 18343866e845SSteven Rostedt (Red Hat) 18358a99b683SPeter Zijlstra extern int sched_update_scaling(void); 1836*d664e399SThomas Gleixner #endif /* CONFIG_SMP */ 1837391e43daSPeter Zijlstra 1838391e43daSPeter Zijlstra #include "stats.h" 1839391e43daSPeter Zijlstra 18404feee7d1SJosh Don #if defined(CONFIG_SCHED_CORE) && defined(CONFIG_SCHEDSTATS) 18414feee7d1SJosh Don 18424feee7d1SJosh Don extern void __sched_core_account_forceidle(struct rq *rq); 18434feee7d1SJosh Don 18444feee7d1SJosh Don static inline void sched_core_account_forceidle(struct rq *rq) 18454feee7d1SJosh Don { 18464feee7d1SJosh Don if (schedstat_enabled()) 18474feee7d1SJosh Don __sched_core_account_forceidle(rq); 18484feee7d1SJosh Don } 18494feee7d1SJosh Don 18504feee7d1SJosh Don extern void __sched_core_tick(struct rq *rq); 18514feee7d1SJosh Don 18524feee7d1SJosh Don static inline void sched_core_tick(struct rq *rq) 18534feee7d1SJosh Don { 18544feee7d1SJosh Don if (sched_core_enabled(rq) && schedstat_enabled()) 18554feee7d1SJosh Don __sched_core_tick(rq); 18564feee7d1SJosh Don } 18574feee7d1SJosh Don 18584feee7d1SJosh Don #else 18594feee7d1SJosh Don 18604feee7d1SJosh Don static inline void sched_core_account_forceidle(struct rq *rq) {} 18614feee7d1SJosh Don 18624feee7d1SJosh Don static inline void sched_core_tick(struct rq *rq) {} 18634feee7d1SJosh Don 18644feee7d1SJosh Don #endif /* CONFIG_SCHED_CORE && CONFIG_SCHEDSTATS */ 18654feee7d1SJosh Don 1866391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 1867391e43daSPeter Zijlstra 1868391e43daSPeter Zijlstra /* 1869391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 1870391e43daSPeter Zijlstra * 18718af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 18728af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 18738af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 18748323f26cSPeter Zijlstra * 18758323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 18768323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 18778323f26cSPeter Zijlstra * 18788323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 18798323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 1880391e43daSPeter Zijlstra */ 1881391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 1882391e43daSPeter Zijlstra { 18838323f26cSPeter Zijlstra return p->sched_task_group; 1884391e43daSPeter Zijlstra } 1885391e43daSPeter Zijlstra 1886391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 1887391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 1888391e43daSPeter Zijlstra { 1889391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 1890391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 1891391e43daSPeter Zijlstra #endif 1892391e43daSPeter Zijlstra 1893391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 1894ad936d86SByungchul Park set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]); 1895391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 1896391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 1897391e43daSPeter Zijlstra #endif 1898391e43daSPeter Zijlstra 1899391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 1900391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 1901391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 1902391e43daSPeter Zijlstra #endif 1903391e43daSPeter Zijlstra } 1904391e43daSPeter Zijlstra 1905391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 1906391e43daSPeter Zijlstra 1907391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 1908391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 1909391e43daSPeter Zijlstra { 1910391e43daSPeter Zijlstra return NULL; 1911391e43daSPeter Zijlstra } 1912391e43daSPeter Zijlstra 1913391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 1914391e43daSPeter Zijlstra 1915391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 1916391e43daSPeter Zijlstra { 1917391e43daSPeter Zijlstra set_task_rq(p, cpu); 1918391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1919391e43daSPeter Zijlstra /* 1920391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 1921dfcb245eSIngo Molnar * successfully executed on another CPU. We must ensure that updates of 1922391e43daSPeter Zijlstra * per-task data have been completed by this moment. 1923391e43daSPeter Zijlstra */ 1924391e43daSPeter Zijlstra smp_wmb(); 1925c546951dSAndrea Parri WRITE_ONCE(task_thread_info(p)->cpu, cpu); 1926ac66f547SPeter Zijlstra p->wake_cpu = cpu; 1927391e43daSPeter Zijlstra #endif 1928391e43daSPeter Zijlstra } 1929391e43daSPeter Zijlstra 1930391e43daSPeter Zijlstra /* 1931391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 1932391e43daSPeter Zijlstra */ 1933391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 1934391e43daSPeter Zijlstra # define const_debug __read_mostly 1935391e43daSPeter Zijlstra #else 1936391e43daSPeter Zijlstra # define const_debug const 1937391e43daSPeter Zijlstra #endif 1938391e43daSPeter Zijlstra 1939391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1940391e43daSPeter Zijlstra __SCHED_FEAT_##name , 1941391e43daSPeter Zijlstra 1942391e43daSPeter Zijlstra enum { 1943391e43daSPeter Zijlstra #include "features.h" 1944f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 1945391e43daSPeter Zijlstra }; 1946391e43daSPeter Zijlstra 1947391e43daSPeter Zijlstra #undef SCHED_FEAT 1948391e43daSPeter Zijlstra 1949a73f863aSJuri Lelli #ifdef CONFIG_SCHED_DEBUG 1950765cc3a4SPatrick Bellasi 1951765cc3a4SPatrick Bellasi /* 1952765cc3a4SPatrick Bellasi * To support run-time toggling of sched features, all the translation units 1953765cc3a4SPatrick Bellasi * (but core.c) reference the sysctl_sched_features defined in core.c. 1954765cc3a4SPatrick Bellasi */ 1955765cc3a4SPatrick Bellasi extern const_debug unsigned int sysctl_sched_features; 1956765cc3a4SPatrick Bellasi 1957a73f863aSJuri Lelli #ifdef CONFIG_JUMP_LABEL 1958f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1959c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 1960f8b6d1ccSPeter Zijlstra { \ 19616e76ea8aSJason Baron return static_key_##enabled(key); \ 1962f8b6d1ccSPeter Zijlstra } 1963f8b6d1ccSPeter Zijlstra 1964f8b6d1ccSPeter Zijlstra #include "features.h" 1965f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 1966f8b6d1ccSPeter Zijlstra 1967c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 1968f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 1969765cc3a4SPatrick Bellasi 1970a73f863aSJuri Lelli #else /* !CONFIG_JUMP_LABEL */ 1971a73f863aSJuri Lelli 1972a73f863aSJuri Lelli #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 1973a73f863aSJuri Lelli 1974a73f863aSJuri Lelli #endif /* CONFIG_JUMP_LABEL */ 1975a73f863aSJuri Lelli 1976a73f863aSJuri Lelli #else /* !SCHED_DEBUG */ 1977765cc3a4SPatrick Bellasi 1978765cc3a4SPatrick Bellasi /* 1979765cc3a4SPatrick Bellasi * Each translation unit has its own copy of sysctl_sched_features to allow 1980765cc3a4SPatrick Bellasi * constants propagation at compile time and compiler optimization based on 1981765cc3a4SPatrick Bellasi * features default. 1982765cc3a4SPatrick Bellasi */ 1983765cc3a4SPatrick Bellasi #define SCHED_FEAT(name, enabled) \ 1984765cc3a4SPatrick Bellasi (1UL << __SCHED_FEAT_##name) * enabled | 1985765cc3a4SPatrick Bellasi static const_debug __maybe_unused unsigned int sysctl_sched_features = 1986765cc3a4SPatrick Bellasi #include "features.h" 1987765cc3a4SPatrick Bellasi 0; 1988765cc3a4SPatrick Bellasi #undef SCHED_FEAT 1989765cc3a4SPatrick Bellasi 19907e6f4c5dSPeter Zijlstra #define sched_feat(x) !!(sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 1991765cc3a4SPatrick Bellasi 1992a73f863aSJuri Lelli #endif /* SCHED_DEBUG */ 1993391e43daSPeter Zijlstra 19942a595721SSrikar Dronamraju extern struct static_key_false sched_numa_balancing; 1995cb251765SMel Gorman extern struct static_key_false sched_schedstats; 1996cbee9f88SPeter Zijlstra 1997391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 1998391e43daSPeter Zijlstra { 1999391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 2000391e43daSPeter Zijlstra } 2001391e43daSPeter Zijlstra 2002391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 2003391e43daSPeter Zijlstra { 2004391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 2005391e43daSPeter Zijlstra return RUNTIME_INF; 2006391e43daSPeter Zijlstra 2007391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 2008391e43daSPeter Zijlstra } 2009391e43daSPeter Zijlstra 2010391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 2011391e43daSPeter Zijlstra { 2012391e43daSPeter Zijlstra return rq->curr == p; 2013391e43daSPeter Zijlstra } 2014391e43daSPeter Zijlstra 2015391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 2016391e43daSPeter Zijlstra { 2017391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2018391e43daSPeter Zijlstra return p->on_cpu; 2019391e43daSPeter Zijlstra #else 2020391e43daSPeter Zijlstra return task_current(rq, p); 2021391e43daSPeter Zijlstra #endif 2022391e43daSPeter Zijlstra } 2023391e43daSPeter Zijlstra 2024da0c1e65SKirill Tkhai static inline int task_on_rq_queued(struct task_struct *p) 2025da0c1e65SKirill Tkhai { 2026da0c1e65SKirill Tkhai return p->on_rq == TASK_ON_RQ_QUEUED; 2027da0c1e65SKirill Tkhai } 2028391e43daSPeter Zijlstra 2029cca26e80SKirill Tkhai static inline int task_on_rq_migrating(struct task_struct *p) 2030cca26e80SKirill Tkhai { 2031c546951dSAndrea Parri return READ_ONCE(p->on_rq) == TASK_ON_RQ_MIGRATING; 2032cca26e80SKirill Tkhai } 2033cca26e80SKirill Tkhai 203417770579SValentin Schneider /* Wake flags. The first three directly map to some SD flag value */ 203517770579SValentin Schneider #define WF_EXEC 0x02 /* Wakeup after exec; maps to SD_BALANCE_EXEC */ 203617770579SValentin Schneider #define WF_FORK 0x04 /* Wakeup after fork; maps to SD_BALANCE_FORK */ 203717770579SValentin Schneider #define WF_TTWU 0x08 /* Wakeup; maps to SD_BALANCE_WAKE */ 203817770579SValentin Schneider 203917770579SValentin Schneider #define WF_SYNC 0x10 /* Waker goes to sleep after wakeup */ 204017770579SValentin Schneider #define WF_MIGRATED 0x20 /* Internal use, task got migrated */ 204117770579SValentin Schneider #define WF_ON_CPU 0x40 /* Wakee is on_cpu */ 204217770579SValentin Schneider 204317770579SValentin Schneider #ifdef CONFIG_SMP 204417770579SValentin Schneider static_assert(WF_EXEC == SD_BALANCE_EXEC); 204517770579SValentin Schneider static_assert(WF_FORK == SD_BALANCE_FORK); 204617770579SValentin Schneider static_assert(WF_TTWU == SD_BALANCE_WAKE); 204717770579SValentin Schneider #endif 2048b13095f0SLi Zefan 2049391e43daSPeter Zijlstra /* 2050391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 2051391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 2052391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 2053391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 2054391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 2055391e43daSPeter Zijlstra * slice expiry etc. 2056391e43daSPeter Zijlstra */ 2057391e43daSPeter Zijlstra 2058391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 2059391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 2060391e43daSPeter Zijlstra 2061ed82b8a1SAndi Kleen extern const int sched_prio_to_weight[40]; 2062ed82b8a1SAndi Kleen extern const u32 sched_prio_to_wmult[40]; 2063391e43daSPeter Zijlstra 2064ff77e468SPeter Zijlstra /* 2065ff77e468SPeter Zijlstra * {de,en}queue flags: 2066ff77e468SPeter Zijlstra * 2067ff77e468SPeter Zijlstra * DEQUEUE_SLEEP - task is no longer runnable 2068ff77e468SPeter Zijlstra * ENQUEUE_WAKEUP - task just became runnable 2069ff77e468SPeter Zijlstra * 2070ff77e468SPeter Zijlstra * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks 2071ff77e468SPeter Zijlstra * are in a known state which allows modification. Such pairs 2072ff77e468SPeter Zijlstra * should preserve as much state as possible. 2073ff77e468SPeter Zijlstra * 2074ff77e468SPeter Zijlstra * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location 2075ff77e468SPeter Zijlstra * in the runqueue. 2076ff77e468SPeter Zijlstra * 2077ff77e468SPeter Zijlstra * ENQUEUE_HEAD - place at front of runqueue (tail if not specified) 2078ff77e468SPeter Zijlstra * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline) 207959efa0baSPeter Zijlstra * ENQUEUE_MIGRATED - the task was migrated during wakeup 2080ff77e468SPeter Zijlstra * 2081ff77e468SPeter Zijlstra */ 2082ff77e468SPeter Zijlstra 2083ff77e468SPeter Zijlstra #define DEQUEUE_SLEEP 0x01 208497fb7a0aSIngo Molnar #define DEQUEUE_SAVE 0x02 /* Matches ENQUEUE_RESTORE */ 208597fb7a0aSIngo Molnar #define DEQUEUE_MOVE 0x04 /* Matches ENQUEUE_MOVE */ 208697fb7a0aSIngo Molnar #define DEQUEUE_NOCLOCK 0x08 /* Matches ENQUEUE_NOCLOCK */ 2087ff77e468SPeter Zijlstra 20881de64443SPeter Zijlstra #define ENQUEUE_WAKEUP 0x01 2089ff77e468SPeter Zijlstra #define ENQUEUE_RESTORE 0x02 2090ff77e468SPeter Zijlstra #define ENQUEUE_MOVE 0x04 20910a67d1eeSPeter Zijlstra #define ENQUEUE_NOCLOCK 0x08 2092ff77e468SPeter Zijlstra 20930a67d1eeSPeter Zijlstra #define ENQUEUE_HEAD 0x10 20940a67d1eeSPeter Zijlstra #define ENQUEUE_REPLENISH 0x20 2095c82ba9faSLi Zefan #ifdef CONFIG_SMP 20960a67d1eeSPeter Zijlstra #define ENQUEUE_MIGRATED 0x40 2097c82ba9faSLi Zefan #else 209859efa0baSPeter Zijlstra #define ENQUEUE_MIGRATED 0x00 2099c82ba9faSLi Zefan #endif 2100c82ba9faSLi Zefan 210137e117c0SPeter Zijlstra #define RETRY_TASK ((void *)-1UL) 210237e117c0SPeter Zijlstra 2103c82ba9faSLi Zefan struct sched_class { 2104c82ba9faSLi Zefan 210569842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 210669842cbaSPatrick Bellasi int uclamp_enabled; 210769842cbaSPatrick Bellasi #endif 210869842cbaSPatrick Bellasi 2109c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 2110c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 2111c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 21120900acf2SDietmar Eggemann bool (*yield_to_task)(struct rq *rq, struct task_struct *p); 2113c82ba9faSLi Zefan 2114c82ba9faSLi Zefan void (*check_preempt_curr)(struct rq *rq, struct task_struct *p, int flags); 2115c82ba9faSLi Zefan 211698c2f700SPeter Zijlstra struct task_struct *(*pick_next_task)(struct rq *rq); 211798c2f700SPeter Zijlstra 21186e2df058SPeter Zijlstra void (*put_prev_task)(struct rq *rq, struct task_struct *p); 2119a0e813f2SPeter Zijlstra void (*set_next_task)(struct rq *rq, struct task_struct *p, bool first); 2120c82ba9faSLi Zefan 2121c82ba9faSLi Zefan #ifdef CONFIG_SMP 21226e2df058SPeter Zijlstra int (*balance)(struct rq *rq, struct task_struct *prev, struct rq_flags *rf); 21233aef1551SValentin Schneider int (*select_task_rq)(struct task_struct *p, int task_cpu, int flags); 212421f56ffeSPeter Zijlstra 212521f56ffeSPeter Zijlstra struct task_struct * (*pick_task)(struct rq *rq); 212621f56ffeSPeter Zijlstra 21271327237aSSrikar Dronamraju void (*migrate_task_rq)(struct task_struct *p, int new_cpu); 2128c82ba9faSLi Zefan 2129c82ba9faSLi Zefan void (*task_woken)(struct rq *this_rq, struct task_struct *task); 2130c82ba9faSLi Zefan 2131c82ba9faSLi Zefan void (*set_cpus_allowed)(struct task_struct *p, 21329cfc3e18SPeter Zijlstra const struct cpumask *newmask, 21339cfc3e18SPeter Zijlstra u32 flags); 2134c82ba9faSLi Zefan 2135c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 2136c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 2137a7c81556SPeter Zijlstra 2138a7c81556SPeter Zijlstra struct rq *(*find_lock_rq)(struct task_struct *p, struct rq *rq); 2139c82ba9faSLi Zefan #endif 2140c82ba9faSLi Zefan 2141c82ba9faSLi Zefan void (*task_tick)(struct rq *rq, struct task_struct *p, int queued); 2142c82ba9faSLi Zefan void (*task_fork)(struct task_struct *p); 2143e6c390f2SDario Faggioli void (*task_dead)(struct task_struct *p); 2144c82ba9faSLi Zefan 214567dfa1b7SKirill Tkhai /* 214667dfa1b7SKirill Tkhai * The switched_from() call is allowed to drop rq->lock, therefore we 21473b03706fSIngo Molnar * cannot assume the switched_from/switched_to pair is serialized by 214867dfa1b7SKirill Tkhai * rq->lock. They are however serialized by p->pi_lock. 214967dfa1b7SKirill Tkhai */ 2150c82ba9faSLi Zefan void (*switched_from)(struct rq *this_rq, struct task_struct *task); 2151c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 2152c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 2153c82ba9faSLi Zefan int oldprio); 2154c82ba9faSLi Zefan 2155c82ba9faSLi Zefan unsigned int (*get_rr_interval)(struct rq *rq, 2156c82ba9faSLi Zefan struct task_struct *task); 2157c82ba9faSLi Zefan 21586e998916SStanislaw Gruszka void (*update_curr)(struct rq *rq); 21596e998916SStanislaw Gruszka 2160ea86cb4bSVincent Guittot #define TASK_SET_GROUP 0 2161ea86cb4bSVincent Guittot #define TASK_MOVE_GROUP 1 2162ea86cb4bSVincent Guittot 2163c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 2164ea86cb4bSVincent Guittot void (*task_change_group)(struct task_struct *p, int type); 2165c82ba9faSLi Zefan #endif 216643c31ac0SPeter Zijlstra }; 2167391e43daSPeter Zijlstra 21683f1d2a31SPeter Zijlstra static inline void put_prev_task(struct rq *rq, struct task_struct *prev) 21693f1d2a31SPeter Zijlstra { 217010e7071bSPeter Zijlstra WARN_ON_ONCE(rq->curr != prev); 21716e2df058SPeter Zijlstra prev->sched_class->put_prev_task(rq, prev); 21723f1d2a31SPeter Zijlstra } 21733f1d2a31SPeter Zijlstra 217403b7fad1SPeter Zijlstra static inline void set_next_task(struct rq *rq, struct task_struct *next) 2175b2bf6c31SPeter Zijlstra { 2176a0e813f2SPeter Zijlstra next->sched_class->set_next_task(rq, next, false); 2177b2bf6c31SPeter Zijlstra } 2178b2bf6c31SPeter Zijlstra 217943c31ac0SPeter Zijlstra 218043c31ac0SPeter Zijlstra /* 218143c31ac0SPeter Zijlstra * Helper to define a sched_class instance; each one is placed in a separate 218243c31ac0SPeter Zijlstra * section which is ordered by the linker script: 218343c31ac0SPeter Zijlstra * 218443c31ac0SPeter Zijlstra * include/asm-generic/vmlinux.lds.h 218543c31ac0SPeter Zijlstra * 218643c31ac0SPeter Zijlstra * Also enforce alignment on the instance, not the type, to guarantee layout. 218743c31ac0SPeter Zijlstra */ 218843c31ac0SPeter Zijlstra #define DEFINE_SCHED_CLASS(name) \ 218943c31ac0SPeter Zijlstra const struct sched_class name##_sched_class \ 219043c31ac0SPeter Zijlstra __aligned(__alignof__(struct sched_class)) \ 219143c31ac0SPeter Zijlstra __section("__" #name "_sched_class") 219243c31ac0SPeter Zijlstra 2193c3a340f7SSteven Rostedt (VMware) /* Defined in include/asm-generic/vmlinux.lds.h */ 2194c3a340f7SSteven Rostedt (VMware) extern struct sched_class __begin_sched_classes[]; 2195c3a340f7SSteven Rostedt (VMware) extern struct sched_class __end_sched_classes[]; 2196c3a340f7SSteven Rostedt (VMware) 2197c3a340f7SSteven Rostedt (VMware) #define sched_class_highest (__end_sched_classes - 1) 2198c3a340f7SSteven Rostedt (VMware) #define sched_class_lowest (__begin_sched_classes - 1) 21996e2df058SPeter Zijlstra 22006e2df058SPeter Zijlstra #define for_class_range(class, _from, _to) \ 2201c3a340f7SSteven Rostedt (VMware) for (class = (_from); class != (_to); class--) 22026e2df058SPeter Zijlstra 2203391e43daSPeter Zijlstra #define for_each_class(class) \ 2204c3a340f7SSteven Rostedt (VMware) for_class_range(class, sched_class_highest, sched_class_lowest) 2205391e43daSPeter Zijlstra 2206391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 2207aab03e05SDario Faggioli extern const struct sched_class dl_sched_class; 2208391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 2209391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 2210391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 2211391e43daSPeter Zijlstra 22126e2df058SPeter Zijlstra static inline bool sched_stop_runnable(struct rq *rq) 22136e2df058SPeter Zijlstra { 22146e2df058SPeter Zijlstra return rq->stop && task_on_rq_queued(rq->stop); 22156e2df058SPeter Zijlstra } 22166e2df058SPeter Zijlstra 22176e2df058SPeter Zijlstra static inline bool sched_dl_runnable(struct rq *rq) 22186e2df058SPeter Zijlstra { 22196e2df058SPeter Zijlstra return rq->dl.dl_nr_running > 0; 22206e2df058SPeter Zijlstra } 22216e2df058SPeter Zijlstra 22226e2df058SPeter Zijlstra static inline bool sched_rt_runnable(struct rq *rq) 22236e2df058SPeter Zijlstra { 22246e2df058SPeter Zijlstra return rq->rt.rt_queued > 0; 22256e2df058SPeter Zijlstra } 22266e2df058SPeter Zijlstra 22276e2df058SPeter Zijlstra static inline bool sched_fair_runnable(struct rq *rq) 22286e2df058SPeter Zijlstra { 22296e2df058SPeter Zijlstra return rq->cfs.nr_running > 0; 22306e2df058SPeter Zijlstra } 2231391e43daSPeter Zijlstra 22325d7d6056SPeter Zijlstra extern struct task_struct *pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf); 223398c2f700SPeter Zijlstra extern struct task_struct *pick_next_task_idle(struct rq *rq); 22345d7d6056SPeter Zijlstra 2235af449901SPeter Zijlstra #define SCA_CHECK 0x01 2236af449901SPeter Zijlstra #define SCA_MIGRATE_DISABLE 0x02 2237af449901SPeter Zijlstra #define SCA_MIGRATE_ENABLE 0x04 223807ec77a1SWill Deacon #define SCA_USER 0x08 2239af449901SPeter Zijlstra 2240391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2241391e43daSPeter Zijlstra 224263b2ca30SNicolas Pitre extern void update_group_capacity(struct sched_domain *sd, int cpu); 2243b719203bSLi Zefan 22447caff66fSDaniel Lezcano extern void trigger_load_balance(struct rq *rq); 2245391e43daSPeter Zijlstra 22469cfc3e18SPeter Zijlstra extern void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask, u32 flags); 2247c5b28038SPeter Zijlstra 2248a7c81556SPeter Zijlstra static inline struct task_struct *get_push_task(struct rq *rq) 2249a7c81556SPeter Zijlstra { 2250a7c81556SPeter Zijlstra struct task_struct *p = rq->curr; 2251a7c81556SPeter Zijlstra 22525cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 2253a7c81556SPeter Zijlstra 2254a7c81556SPeter Zijlstra if (rq->push_busy) 2255a7c81556SPeter Zijlstra return NULL; 2256a7c81556SPeter Zijlstra 2257a7c81556SPeter Zijlstra if (p->nr_cpus_allowed == 1) 2258a7c81556SPeter Zijlstra return NULL; 2259a7c81556SPeter Zijlstra 2260e681dcbaSSebastian Andrzej Siewior if (p->migration_disabled) 2261e681dcbaSSebastian Andrzej Siewior return NULL; 2262e681dcbaSSebastian Andrzej Siewior 2263a7c81556SPeter Zijlstra rq->push_busy = true; 2264a7c81556SPeter Zijlstra return get_task_struct(p); 2265a7c81556SPeter Zijlstra } 2266a7c81556SPeter Zijlstra 2267a7c81556SPeter Zijlstra extern int push_cpu_stop(void *arg); 2268dc877341SPeter Zijlstra 2269391e43daSPeter Zijlstra #endif 2270391e43daSPeter Zijlstra 2271442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 2272442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 2273442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 2274442bf3aaSDaniel Lezcano { 2275442bf3aaSDaniel Lezcano rq->idle_state = idle_state; 2276442bf3aaSDaniel Lezcano } 2277442bf3aaSDaniel Lezcano 2278442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 2279442bf3aaSDaniel Lezcano { 22809148a3a1SPeter Zijlstra SCHED_WARN_ON(!rcu_read_lock_held()); 228197fb7a0aSIngo Molnar 2282442bf3aaSDaniel Lezcano return rq->idle_state; 2283442bf3aaSDaniel Lezcano } 2284442bf3aaSDaniel Lezcano #else 2285442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 2286442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 2287442bf3aaSDaniel Lezcano { 2288442bf3aaSDaniel Lezcano } 2289442bf3aaSDaniel Lezcano 2290442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 2291442bf3aaSDaniel Lezcano { 2292442bf3aaSDaniel Lezcano return NULL; 2293442bf3aaSDaniel Lezcano } 2294442bf3aaSDaniel Lezcano #endif 2295442bf3aaSDaniel Lezcano 22968663effbSSteven Rostedt (VMware) extern void schedule_idle(void); 22978663effbSSteven Rostedt (VMware) 2298391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 2299391e43daSPeter Zijlstra extern void sched_init_granularity(void); 2300391e43daSPeter Zijlstra extern void update_max_interval(void); 23011baca4ceSJuri Lelli 23021baca4ceSJuri Lelli extern void init_sched_dl_class(void); 2303391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 2304391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 2305391e43daSPeter Zijlstra 23069059393eSVincent Guittot extern void reweight_task(struct task_struct *p, int prio); 23079059393eSVincent Guittot 23088875125eSKirill Tkhai extern void resched_curr(struct rq *rq); 2309391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 2310391e43daSPeter Zijlstra 2311391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 2312391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 2313*d664e399SThomas Gleixner extern bool sched_rt_bandwidth_account(struct rt_rq *rt_rq); 2314391e43daSPeter Zijlstra 2315332ac17eSDario Faggioli extern void init_dl_bandwidth(struct dl_bandwidth *dl_b, u64 period, u64 runtime); 2316aab03e05SDario Faggioli extern void init_dl_task_timer(struct sched_dl_entity *dl_se); 2317209a0cbdSLuca Abeni extern void init_dl_inactive_task_timer(struct sched_dl_entity *dl_se); 2318aab03e05SDario Faggioli 2319c52f14d3SLuca Abeni #define BW_SHIFT 20 2320c52f14d3SLuca Abeni #define BW_UNIT (1 << BW_SHIFT) 23214da3abceSLuca Abeni #define RATIO_SHIFT 8 2322d505b8afSHuaixin Chang #define MAX_BW_BITS (64 - BW_SHIFT) 2323d505b8afSHuaixin Chang #define MAX_BW ((1ULL << MAX_BW_BITS) - 1) 2324332ac17eSDario Faggioli unsigned long to_ratio(u64 period, u64 runtime); 2325332ac17eSDario Faggioli 2326540247fbSYuyang Du extern void init_entity_runnable_average(struct sched_entity *se); 2327d0fe0b9cSDietmar Eggemann extern void post_init_entity_util_avg(struct task_struct *p); 2328a75cdaa9SAlex Shi 232976d92ac3SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 233076d92ac3SFrederic Weisbecker extern bool sched_can_stop_tick(struct rq *rq); 2331d84b3131SFrederic Weisbecker extern int __init sched_tick_offload_init(void); 233276d92ac3SFrederic Weisbecker 233376d92ac3SFrederic Weisbecker /* 233476d92ac3SFrederic Weisbecker * Tick may be needed by tasks in the runqueue depending on their policy and 233576d92ac3SFrederic Weisbecker * requirements. If tick is needed, lets send the target an IPI to kick it out of 233676d92ac3SFrederic Weisbecker * nohz mode if necessary. 233776d92ac3SFrederic Weisbecker */ 233876d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) 233976d92ac3SFrederic Weisbecker { 234021a6ee14SMiaohe Lin int cpu = cpu_of(rq); 234176d92ac3SFrederic Weisbecker 234276d92ac3SFrederic Weisbecker if (!tick_nohz_full_cpu(cpu)) 234376d92ac3SFrederic Weisbecker return; 234476d92ac3SFrederic Weisbecker 234576d92ac3SFrederic Weisbecker if (sched_can_stop_tick(rq)) 234676d92ac3SFrederic Weisbecker tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED); 234776d92ac3SFrederic Weisbecker else 234876d92ac3SFrederic Weisbecker tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED); 234976d92ac3SFrederic Weisbecker } 235076d92ac3SFrederic Weisbecker #else 2351d84b3131SFrederic Weisbecker static inline int sched_tick_offload_init(void) { return 0; } 235276d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) { } 235376d92ac3SFrederic Weisbecker #endif 235476d92ac3SFrederic Weisbecker 235572465447SKirill Tkhai static inline void add_nr_running(struct rq *rq, unsigned count) 2356391e43daSPeter Zijlstra { 235772465447SKirill Tkhai unsigned prev_nr = rq->nr_running; 235872465447SKirill Tkhai 235972465447SKirill Tkhai rq->nr_running = prev_nr + count; 23609d246053SPhil Auld if (trace_sched_update_nr_running_tp_enabled()) { 23619d246053SPhil Auld call_trace_sched_update_nr_running(rq, count); 23629d246053SPhil Auld } 23639f3660c2SFrederic Weisbecker 23644486edd1STim Chen #ifdef CONFIG_SMP 23653e184501SViresh Kumar if (prev_nr < 2 && rq->nr_running >= 2) { 2366e90c8fe1SValentin Schneider if (!READ_ONCE(rq->rd->overload)) 2367e90c8fe1SValentin Schneider WRITE_ONCE(rq->rd->overload, 1); 236876d92ac3SFrederic Weisbecker } 23693e184501SViresh Kumar #endif 23704486edd1STim Chen 237176d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 23724486edd1STim Chen } 2373391e43daSPeter Zijlstra 237472465447SKirill Tkhai static inline void sub_nr_running(struct rq *rq, unsigned count) 2375391e43daSPeter Zijlstra { 237672465447SKirill Tkhai rq->nr_running -= count; 23779d246053SPhil Auld if (trace_sched_update_nr_running_tp_enabled()) { 2378a1bd0685SPhil Auld call_trace_sched_update_nr_running(rq, -count); 23799d246053SPhil Auld } 23809d246053SPhil Auld 238176d92ac3SFrederic Weisbecker /* Check if we still need preemption */ 238276d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 2383391e43daSPeter Zijlstra } 2384391e43daSPeter Zijlstra 2385391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 2386391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 2387391e43daSPeter Zijlstra 2388391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 2389391e43daSPeter Zijlstra 2390391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 2391391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 2392391e43daSPeter Zijlstra 239318765447SHailong Liu #ifdef CONFIG_SCHED_DEBUG 239418765447SHailong Liu extern unsigned int sysctl_sched_latency; 239518765447SHailong Liu extern unsigned int sysctl_sched_min_granularity; 239651ce83edSJosh Don extern unsigned int sysctl_sched_idle_min_granularity; 239718765447SHailong Liu extern unsigned int sysctl_sched_wakeup_granularity; 239818765447SHailong Liu extern int sysctl_resched_latency_warn_ms; 239918765447SHailong Liu extern int sysctl_resched_latency_warn_once; 240018765447SHailong Liu 240118765447SHailong Liu extern unsigned int sysctl_sched_tunable_scaling; 240218765447SHailong Liu 240318765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_delay; 240418765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_period_min; 240518765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_period_max; 240618765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_size; 240718765447SHailong Liu #endif 240818765447SHailong Liu 2409391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 2410391e43daSPeter Zijlstra 2411391e43daSPeter Zijlstra /* 2412391e43daSPeter Zijlstra * Use hrtick when: 2413391e43daSPeter Zijlstra * - enabled by features 2414391e43daSPeter Zijlstra * - hrtimer is actually high res 2415391e43daSPeter Zijlstra */ 2416391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 2417391e43daSPeter Zijlstra { 2418391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 2419391e43daSPeter Zijlstra return 0; 2420391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 2421391e43daSPeter Zijlstra } 2422391e43daSPeter Zijlstra 2423e0ee463cSJuri Lelli static inline int hrtick_enabled_fair(struct rq *rq) 2424e0ee463cSJuri Lelli { 2425e0ee463cSJuri Lelli if (!sched_feat(HRTICK)) 2426e0ee463cSJuri Lelli return 0; 2427e0ee463cSJuri Lelli return hrtick_enabled(rq); 2428e0ee463cSJuri Lelli } 2429e0ee463cSJuri Lelli 2430e0ee463cSJuri Lelli static inline int hrtick_enabled_dl(struct rq *rq) 2431e0ee463cSJuri Lelli { 2432e0ee463cSJuri Lelli if (!sched_feat(HRTICK_DL)) 2433e0ee463cSJuri Lelli return 0; 2434e0ee463cSJuri Lelli return hrtick_enabled(rq); 2435e0ee463cSJuri Lelli } 2436e0ee463cSJuri Lelli 2437391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 2438391e43daSPeter Zijlstra 2439b39e66eaSMike Galbraith #else 2440b39e66eaSMike Galbraith 2441e0ee463cSJuri Lelli static inline int hrtick_enabled_fair(struct rq *rq) 2442e0ee463cSJuri Lelli { 2443e0ee463cSJuri Lelli return 0; 2444e0ee463cSJuri Lelli } 2445e0ee463cSJuri Lelli 2446e0ee463cSJuri Lelli static inline int hrtick_enabled_dl(struct rq *rq) 2447e0ee463cSJuri Lelli { 2448e0ee463cSJuri Lelli return 0; 2449e0ee463cSJuri Lelli } 2450e0ee463cSJuri Lelli 2451b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 2452b39e66eaSMike Galbraith { 2453b39e66eaSMike Galbraith return 0; 2454b39e66eaSMike Galbraith } 2455b39e66eaSMike Galbraith 2456391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 2457391e43daSPeter Zijlstra 24581567c3e3SGiovanni Gherdovich #ifndef arch_scale_freq_tick 24591567c3e3SGiovanni Gherdovich static __always_inline 24601567c3e3SGiovanni Gherdovich void arch_scale_freq_tick(void) 24611567c3e3SGiovanni Gherdovich { 24621567c3e3SGiovanni Gherdovich } 24631567c3e3SGiovanni Gherdovich #endif 24641567c3e3SGiovanni Gherdovich 2465dfbca41fSPeter Zijlstra #ifndef arch_scale_freq_capacity 2466f4470cdfSValentin Schneider /** 2467f4470cdfSValentin Schneider * arch_scale_freq_capacity - get the frequency scale factor of a given CPU. 2468f4470cdfSValentin Schneider * @cpu: the CPU in question. 2469f4470cdfSValentin Schneider * 2470f4470cdfSValentin Schneider * Return: the frequency scale factor normalized against SCHED_CAPACITY_SCALE, i.e. 2471f4470cdfSValentin Schneider * 2472f4470cdfSValentin Schneider * f_curr 2473f4470cdfSValentin Schneider * ------ * SCHED_CAPACITY_SCALE 2474f4470cdfSValentin Schneider * f_max 2475f4470cdfSValentin Schneider */ 2476dfbca41fSPeter Zijlstra static __always_inline 24777673c8a4SJuri Lelli unsigned long arch_scale_freq_capacity(int cpu) 2478dfbca41fSPeter Zijlstra { 2479dfbca41fSPeter Zijlstra return SCHED_CAPACITY_SCALE; 2480dfbca41fSPeter Zijlstra } 2481dfbca41fSPeter Zijlstra #endif 2482b5b4860dSVincent Guittot 2483391e43daSPeter Zijlstra 2484d66f1b06SPeter Zijlstra #ifdef CONFIG_SMP 2485d66f1b06SPeter Zijlstra 2486d66f1b06SPeter Zijlstra static inline bool rq_order_less(struct rq *rq1, struct rq *rq2) 2487d66f1b06SPeter Zijlstra { 24889edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 24899edeaea1SPeter Zijlstra /* 24909edeaea1SPeter Zijlstra * In order to not have {0,2},{1,3} turn into into an AB-BA, 24919edeaea1SPeter Zijlstra * order by core-id first and cpu-id second. 24929edeaea1SPeter Zijlstra * 24939edeaea1SPeter Zijlstra * Notably: 24949edeaea1SPeter Zijlstra * 24959edeaea1SPeter Zijlstra * double_rq_lock(0,3); will take core-0, core-1 lock 24969edeaea1SPeter Zijlstra * double_rq_lock(1,2); will take core-1, core-0 lock 24979edeaea1SPeter Zijlstra * 24989edeaea1SPeter Zijlstra * when only cpu-id is considered. 24999edeaea1SPeter Zijlstra */ 25009edeaea1SPeter Zijlstra if (rq1->core->cpu < rq2->core->cpu) 25019edeaea1SPeter Zijlstra return true; 25029edeaea1SPeter Zijlstra if (rq1->core->cpu > rq2->core->cpu) 25039edeaea1SPeter Zijlstra return false; 25049edeaea1SPeter Zijlstra 25059edeaea1SPeter Zijlstra /* 25069edeaea1SPeter Zijlstra * __sched_core_flip() relies on SMT having cpu-id lock order. 25079edeaea1SPeter Zijlstra */ 25089edeaea1SPeter Zijlstra #endif 2509d66f1b06SPeter Zijlstra return rq1->cpu < rq2->cpu; 2510d66f1b06SPeter Zijlstra } 2511d66f1b06SPeter Zijlstra 2512d66f1b06SPeter Zijlstra extern void double_rq_lock(struct rq *rq1, struct rq *rq2); 2513d66f1b06SPeter Zijlstra 2514d66f1b06SPeter Zijlstra #ifdef CONFIG_PREEMPTION 2515391e43daSPeter Zijlstra 2516391e43daSPeter Zijlstra /* 2517391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 2518391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 2519391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 2520391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 2521391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 2522391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 2523391e43daSPeter Zijlstra */ 2524391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 2525391e43daSPeter Zijlstra __releases(this_rq->lock) 2526391e43daSPeter Zijlstra __acquires(busiest->lock) 2527391e43daSPeter Zijlstra __acquires(this_rq->lock) 2528391e43daSPeter Zijlstra { 25295cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(this_rq); 2530391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 2531391e43daSPeter Zijlstra 2532391e43daSPeter Zijlstra return 1; 2533391e43daSPeter Zijlstra } 2534391e43daSPeter Zijlstra 2535391e43daSPeter Zijlstra #else 2536391e43daSPeter Zijlstra /* 2537391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 2538391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 253997fb7a0aSIngo Molnar * already in proper order on entry. This favors lower CPU-ids and will 254097fb7a0aSIngo Molnar * grant the double lock to lower CPUs over higher ids under contention, 2541391e43daSPeter Zijlstra * regardless of entry order into the function. 2542391e43daSPeter Zijlstra */ 2543391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 2544391e43daSPeter Zijlstra __releases(this_rq->lock) 2545391e43daSPeter Zijlstra __acquires(busiest->lock) 2546391e43daSPeter Zijlstra __acquires(this_rq->lock) 2547391e43daSPeter Zijlstra { 25489ef7e7e3SPeter Zijlstra if (__rq_lockp(this_rq) == __rq_lockp(busiest)) 25495cb9eaa3SPeter Zijlstra return 0; 2550391e43daSPeter Zijlstra 25515cb9eaa3SPeter Zijlstra if (likely(raw_spin_rq_trylock(busiest))) 25525cb9eaa3SPeter Zijlstra return 0; 25535cb9eaa3SPeter Zijlstra 2554d66f1b06SPeter Zijlstra if (rq_order_less(this_rq, busiest)) { 25555cb9eaa3SPeter Zijlstra raw_spin_rq_lock_nested(busiest, SINGLE_DEPTH_NESTING); 25565cb9eaa3SPeter Zijlstra return 0; 2557391e43daSPeter Zijlstra } 25585cb9eaa3SPeter Zijlstra 25595cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(this_rq); 2560d66f1b06SPeter Zijlstra double_rq_lock(this_rq, busiest); 25615cb9eaa3SPeter Zijlstra 25625cb9eaa3SPeter Zijlstra return 1; 2563391e43daSPeter Zijlstra } 2564391e43daSPeter Zijlstra 2565c1a280b6SThomas Gleixner #endif /* CONFIG_PREEMPTION */ 2566391e43daSPeter Zijlstra 2567391e43daSPeter Zijlstra /* 2568391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 2569391e43daSPeter Zijlstra */ 2570391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 2571391e43daSPeter Zijlstra { 25725cb9eaa3SPeter Zijlstra lockdep_assert_irqs_disabled(); 2573391e43daSPeter Zijlstra 2574391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 2575391e43daSPeter Zijlstra } 2576391e43daSPeter Zijlstra 2577391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 2578391e43daSPeter Zijlstra __releases(busiest->lock) 2579391e43daSPeter Zijlstra { 25809ef7e7e3SPeter Zijlstra if (__rq_lockp(this_rq) != __rq_lockp(busiest)) 25815cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(busiest); 25829ef7e7e3SPeter Zijlstra lock_set_subclass(&__rq_lockp(this_rq)->dep_map, 0, _RET_IP_); 2583391e43daSPeter Zijlstra } 2584391e43daSPeter Zijlstra 258574602315SPeter Zijlstra static inline void double_lock(spinlock_t *l1, spinlock_t *l2) 258674602315SPeter Zijlstra { 258774602315SPeter Zijlstra if (l1 > l2) 258874602315SPeter Zijlstra swap(l1, l2); 258974602315SPeter Zijlstra 259074602315SPeter Zijlstra spin_lock(l1); 259174602315SPeter Zijlstra spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 259274602315SPeter Zijlstra } 259374602315SPeter Zijlstra 259460e69eedSMike Galbraith static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2) 259560e69eedSMike Galbraith { 259660e69eedSMike Galbraith if (l1 > l2) 259760e69eedSMike Galbraith swap(l1, l2); 259860e69eedSMike Galbraith 259960e69eedSMike Galbraith spin_lock_irq(l1); 260060e69eedSMike Galbraith spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 260160e69eedSMike Galbraith } 260260e69eedSMike Galbraith 260374602315SPeter Zijlstra static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) 260474602315SPeter Zijlstra { 260574602315SPeter Zijlstra if (l1 > l2) 260674602315SPeter Zijlstra swap(l1, l2); 260774602315SPeter Zijlstra 260874602315SPeter Zijlstra raw_spin_lock(l1); 260974602315SPeter Zijlstra raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 261074602315SPeter Zijlstra } 261174602315SPeter Zijlstra 2612391e43daSPeter Zijlstra /* 2613391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 2614391e43daSPeter Zijlstra * 2615391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 2616391e43daSPeter Zijlstra * you need to do so manually after calling. 2617391e43daSPeter Zijlstra */ 2618391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 2619391e43daSPeter Zijlstra __releases(rq1->lock) 2620391e43daSPeter Zijlstra __releases(rq2->lock) 2621391e43daSPeter Zijlstra { 26229ef7e7e3SPeter Zijlstra if (__rq_lockp(rq1) != __rq_lockp(rq2)) 26235cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq2); 2624391e43daSPeter Zijlstra else 2625391e43daSPeter Zijlstra __release(rq2->lock); 2626d66f1b06SPeter Zijlstra raw_spin_rq_unlock(rq1); 2627391e43daSPeter Zijlstra } 2628391e43daSPeter Zijlstra 2629f2cb1360SIngo Molnar extern void set_rq_online (struct rq *rq); 2630f2cb1360SIngo Molnar extern void set_rq_offline(struct rq *rq); 2631f2cb1360SIngo Molnar extern bool sched_smp_initialized; 2632f2cb1360SIngo Molnar 2633391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 2634391e43daSPeter Zijlstra 2635391e43daSPeter Zijlstra /* 2636391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 2637391e43daSPeter Zijlstra * 2638391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 2639391e43daSPeter Zijlstra * you need to do so manually before calling. 2640391e43daSPeter Zijlstra */ 2641391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 2642391e43daSPeter Zijlstra __acquires(rq1->lock) 2643391e43daSPeter Zijlstra __acquires(rq2->lock) 2644391e43daSPeter Zijlstra { 2645391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 2646391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 26475cb9eaa3SPeter Zijlstra raw_spin_rq_lock(rq1); 2648391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 2649391e43daSPeter Zijlstra } 2650391e43daSPeter Zijlstra 2651391e43daSPeter Zijlstra /* 2652391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 2653391e43daSPeter Zijlstra * 2654391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 2655391e43daSPeter Zijlstra * you need to do so manually after calling. 2656391e43daSPeter Zijlstra */ 2657391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 2658391e43daSPeter Zijlstra __releases(rq1->lock) 2659391e43daSPeter Zijlstra __releases(rq2->lock) 2660391e43daSPeter Zijlstra { 2661391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 26625cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq1); 2663391e43daSPeter Zijlstra __release(rq2->lock); 2664391e43daSPeter Zijlstra } 2665391e43daSPeter Zijlstra 2666391e43daSPeter Zijlstra #endif 2667391e43daSPeter Zijlstra 2668391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 2669391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 26706b55c965SSrikar Dronamraju 26716b55c965SSrikar Dronamraju #ifdef CONFIG_SCHED_DEBUG 26729406415fSPeter Zijlstra extern bool sched_debug_verbose; 26739469eb01SPeter Zijlstra 2674391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 2675391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 2676acb32132SWanpeng Li extern void print_dl_stats(struct seq_file *m, int cpu); 2677f6a34630SMathieu Malaterre extern void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq); 2678f6a34630SMathieu Malaterre extern void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq); 2679f6a34630SMathieu Malaterre extern void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq); 2680c006fac5SPaul Turner 2681c006fac5SPaul Turner extern void resched_latency_warn(int cpu, u64 latency); 2682397f2378SSrikar Dronamraju #ifdef CONFIG_NUMA_BALANCING 2683397f2378SSrikar Dronamraju extern void 2684397f2378SSrikar Dronamraju show_numa_stats(struct task_struct *p, struct seq_file *m); 2685397f2378SSrikar Dronamraju extern void 2686397f2378SSrikar Dronamraju print_numa_stats(struct seq_file *m, int node, unsigned long tsf, 2687397f2378SSrikar Dronamraju unsigned long tpf, unsigned long gsf, unsigned long gpf); 2688397f2378SSrikar Dronamraju #endif /* CONFIG_NUMA_BALANCING */ 2689c006fac5SPaul Turner #else 2690c006fac5SPaul Turner static inline void resched_latency_warn(int cpu, u64 latency) {} 2691397f2378SSrikar Dronamraju #endif /* CONFIG_SCHED_DEBUG */ 2692391e43daSPeter Zijlstra 2693391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 269407c54f7aSAbel Vesa extern void init_rt_rq(struct rt_rq *rt_rq); 269507c54f7aSAbel Vesa extern void init_dl_rq(struct dl_rq *dl_rq); 2696391e43daSPeter Zijlstra 26971ee14e6cSBen Segall extern void cfs_bandwidth_usage_inc(void); 26981ee14e6cSBen Segall extern void cfs_bandwidth_usage_dec(void); 26991c792db7SSuresh Siddha 27003451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 270100357f5eSPeter Zijlstra #define NOHZ_BALANCE_KICK_BIT 0 270200357f5eSPeter Zijlstra #define NOHZ_STATS_KICK_BIT 1 2703c6f88654SVincent Guittot #define NOHZ_NEWILB_KICK_BIT 2 2704efd984c4SValentin Schneider #define NOHZ_NEXT_KICK_BIT 3 2705a22e47a4SPeter Zijlstra 2706efd984c4SValentin Schneider /* Run rebalance_domains() */ 2707a22e47a4SPeter Zijlstra #define NOHZ_BALANCE_KICK BIT(NOHZ_BALANCE_KICK_BIT) 2708efd984c4SValentin Schneider /* Update blocked load */ 2709b7031a02SPeter Zijlstra #define NOHZ_STATS_KICK BIT(NOHZ_STATS_KICK_BIT) 2710efd984c4SValentin Schneider /* Update blocked load when entering idle */ 2711c6f88654SVincent Guittot #define NOHZ_NEWILB_KICK BIT(NOHZ_NEWILB_KICK_BIT) 2712efd984c4SValentin Schneider /* Update nohz.next_balance */ 2713efd984c4SValentin Schneider #define NOHZ_NEXT_KICK BIT(NOHZ_NEXT_KICK_BIT) 2714b7031a02SPeter Zijlstra 2715efd984c4SValentin Schneider #define NOHZ_KICK_MASK (NOHZ_BALANCE_KICK | NOHZ_STATS_KICK | NOHZ_NEXT_KICK) 27161c792db7SSuresh Siddha 27171c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 271820a5c8ccSThomas Gleixner 271900357f5eSPeter Zijlstra extern void nohz_balance_exit_idle(struct rq *rq); 272020a5c8ccSThomas Gleixner #else 272100357f5eSPeter Zijlstra static inline void nohz_balance_exit_idle(struct rq *rq) { } 27221c792db7SSuresh Siddha #endif 272373fbec60SFrederic Weisbecker 2724c6f88654SVincent Guittot #if defined(CONFIG_SMP) && defined(CONFIG_NO_HZ_COMMON) 2725c6f88654SVincent Guittot extern void nohz_run_idle_balance(int cpu); 2726c6f88654SVincent Guittot #else 2727c6f88654SVincent Guittot static inline void nohz_run_idle_balance(int cpu) { } 2728c6f88654SVincent Guittot #endif 2729daec5798SLuca Abeni 273073fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 273119d23dbfSFrederic Weisbecker struct irqtime { 273225e2d8c1SFrederic Weisbecker u64 total; 2733a499a5a1SFrederic Weisbecker u64 tick_delta; 273419d23dbfSFrederic Weisbecker u64 irq_start_time; 273519d23dbfSFrederic Weisbecker struct u64_stats_sync sync; 273619d23dbfSFrederic Weisbecker }; 273773fbec60SFrederic Weisbecker 273819d23dbfSFrederic Weisbecker DECLARE_PER_CPU(struct irqtime, cpu_irqtime); 273973fbec60SFrederic Weisbecker 274025e2d8c1SFrederic Weisbecker /* 274125e2d8c1SFrederic Weisbecker * Returns the irqtime minus the softirq time computed by ksoftirqd. 27423b03706fSIngo Molnar * Otherwise ksoftirqd's sum_exec_runtime is subtracted its own runtime 274325e2d8c1SFrederic Weisbecker * and never move forward. 274425e2d8c1SFrederic Weisbecker */ 274573fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 274673fbec60SFrederic Weisbecker { 274719d23dbfSFrederic Weisbecker struct irqtime *irqtime = &per_cpu(cpu_irqtime, cpu); 274819d23dbfSFrederic Weisbecker unsigned int seq; 274919d23dbfSFrederic Weisbecker u64 total; 275073fbec60SFrederic Weisbecker 275173fbec60SFrederic Weisbecker do { 275219d23dbfSFrederic Weisbecker seq = __u64_stats_fetch_begin(&irqtime->sync); 275325e2d8c1SFrederic Weisbecker total = irqtime->total; 275419d23dbfSFrederic Weisbecker } while (__u64_stats_fetch_retry(&irqtime->sync, seq)); 275573fbec60SFrederic Weisbecker 275619d23dbfSFrederic Weisbecker return total; 275773fbec60SFrederic Weisbecker } 275873fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 2759adaf9fcdSRafael J. Wysocki 2760adaf9fcdSRafael J. Wysocki #ifdef CONFIG_CPU_FREQ 2761b10abd0aSJoel Fernandes (Google) DECLARE_PER_CPU(struct update_util_data __rcu *, cpufreq_update_util_data); 2762adaf9fcdSRafael J. Wysocki 2763adaf9fcdSRafael J. Wysocki /** 2764adaf9fcdSRafael J. Wysocki * cpufreq_update_util - Take a note about CPU utilization changes. 276512bde33dSRafael J. Wysocki * @rq: Runqueue to carry out the update for. 276658919e83SRafael J. Wysocki * @flags: Update reason flags. 2767adaf9fcdSRafael J. Wysocki * 276858919e83SRafael J. Wysocki * This function is called by the scheduler on the CPU whose utilization is 276958919e83SRafael J. Wysocki * being updated. 2770adaf9fcdSRafael J. Wysocki * 2771adaf9fcdSRafael J. Wysocki * It can only be called from RCU-sched read-side critical sections. 2772adaf9fcdSRafael J. Wysocki * 2773adaf9fcdSRafael J. Wysocki * The way cpufreq is currently arranged requires it to evaluate the CPU 2774adaf9fcdSRafael J. Wysocki * performance state (frequency/voltage) on a regular basis to prevent it from 2775adaf9fcdSRafael J. Wysocki * being stuck in a completely inadequate performance level for too long. 2776e0367b12SJuri Lelli * That is not guaranteed to happen if the updates are only triggered from CFS 2777e0367b12SJuri Lelli * and DL, though, because they may not be coming in if only RT tasks are 2778e0367b12SJuri Lelli * active all the time (or there are RT tasks only). 2779adaf9fcdSRafael J. Wysocki * 2780e0367b12SJuri Lelli * As a workaround for that issue, this function is called periodically by the 2781e0367b12SJuri Lelli * RT sched class to trigger extra cpufreq updates to prevent it from stalling, 2782adaf9fcdSRafael J. Wysocki * but that really is a band-aid. Going forward it should be replaced with 2783e0367b12SJuri Lelli * solutions targeted more specifically at RT tasks. 2784adaf9fcdSRafael J. Wysocki */ 278512bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) 2786adaf9fcdSRafael J. Wysocki { 278758919e83SRafael J. Wysocki struct update_util_data *data; 278858919e83SRafael J. Wysocki 2789674e7541SViresh Kumar data = rcu_dereference_sched(*per_cpu_ptr(&cpufreq_update_util_data, 2790674e7541SViresh Kumar cpu_of(rq))); 279158919e83SRafael J. Wysocki if (data) 279212bde33dSRafael J. Wysocki data->func(data, rq_clock(rq), flags); 279312bde33dSRafael J. Wysocki } 2794adaf9fcdSRafael J. Wysocki #else 279512bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) {} 2796adaf9fcdSRafael J. Wysocki #endif /* CONFIG_CPU_FREQ */ 2797be53f58fSLinus Torvalds 27989bdcb44eSRafael J. Wysocki #ifdef arch_scale_freq_capacity 27999bdcb44eSRafael J. Wysocki # ifndef arch_scale_freq_invariant 280097fb7a0aSIngo Molnar # define arch_scale_freq_invariant() true 28019bdcb44eSRafael J. Wysocki # endif 280297fb7a0aSIngo Molnar #else 280397fb7a0aSIngo Molnar # define arch_scale_freq_invariant() false 28049bdcb44eSRafael J. Wysocki #endif 2805d4edd662SJuri Lelli 280610a35e68SVincent Guittot #ifdef CONFIG_SMP 280710a35e68SVincent Guittot static inline unsigned long capacity_orig_of(int cpu) 280810a35e68SVincent Guittot { 280910a35e68SVincent Guittot return cpu_rq(cpu)->cpu_capacity_orig; 281010a35e68SVincent Guittot } 281110a35e68SVincent Guittot 2812938e5e4bSQuentin Perret /** 2813a5418be9SViresh Kumar * enum cpu_util_type - CPU utilization type 2814938e5e4bSQuentin Perret * @FREQUENCY_UTIL: Utilization used to select frequency 2815938e5e4bSQuentin Perret * @ENERGY_UTIL: Utilization used during energy calculation 2816938e5e4bSQuentin Perret * 2817938e5e4bSQuentin Perret * The utilization signals of all scheduling classes (CFS/RT/DL) and IRQ time 2818938e5e4bSQuentin Perret * need to be aggregated differently depending on the usage made of them. This 2819a5418be9SViresh Kumar * enum is used within effective_cpu_util() to differentiate the types of 2820938e5e4bSQuentin Perret * utilization expected by the callers, and adjust the aggregation accordingly. 2821938e5e4bSQuentin Perret */ 2822a5418be9SViresh Kumar enum cpu_util_type { 2823938e5e4bSQuentin Perret FREQUENCY_UTIL, 2824938e5e4bSQuentin Perret ENERGY_UTIL, 2825938e5e4bSQuentin Perret }; 2826938e5e4bSQuentin Perret 2827a5418be9SViresh Kumar unsigned long effective_cpu_util(int cpu, unsigned long util_cfs, 2828a5418be9SViresh Kumar unsigned long max, enum cpu_util_type type, 2829af24bde8SPatrick Bellasi struct task_struct *p); 2830938e5e4bSQuentin Perret 28318cc90515SVincent Guittot static inline unsigned long cpu_bw_dl(struct rq *rq) 2832d4edd662SJuri Lelli { 2833d4edd662SJuri Lelli return (rq->dl.running_bw * SCHED_CAPACITY_SCALE) >> BW_SHIFT; 2834d4edd662SJuri Lelli } 2835d4edd662SJuri Lelli 28368cc90515SVincent Guittot static inline unsigned long cpu_util_dl(struct rq *rq) 28378cc90515SVincent Guittot { 28388cc90515SVincent Guittot return READ_ONCE(rq->avg_dl.util_avg); 28398cc90515SVincent Guittot } 28408cc90515SVincent Guittot 284182762d2aSDietmar Eggemann /** 284282762d2aSDietmar Eggemann * cpu_util_cfs() - Estimates the amount of CPU capacity used by CFS tasks. 284382762d2aSDietmar Eggemann * @cpu: the CPU to get the utilization for. 284482762d2aSDietmar Eggemann * 284582762d2aSDietmar Eggemann * The unit of the return value must be the same as the one of CPU capacity 284682762d2aSDietmar Eggemann * so that CPU utilization can be compared with CPU capacity. 284782762d2aSDietmar Eggemann * 284882762d2aSDietmar Eggemann * CPU utilization is the sum of running time of runnable tasks plus the 284982762d2aSDietmar Eggemann * recent utilization of currently non-runnable tasks on that CPU. 285082762d2aSDietmar Eggemann * It represents the amount of CPU capacity currently used by CFS tasks in 285182762d2aSDietmar Eggemann * the range [0..max CPU capacity] with max CPU capacity being the CPU 285282762d2aSDietmar Eggemann * capacity at f_max. 285382762d2aSDietmar Eggemann * 285482762d2aSDietmar Eggemann * The estimated CPU utilization is defined as the maximum between CPU 285582762d2aSDietmar Eggemann * utilization and sum of the estimated utilization of the currently 285682762d2aSDietmar Eggemann * runnable tasks on that CPU. It preserves a utilization "snapshot" of 285782762d2aSDietmar Eggemann * previously-executed tasks, which helps better deduce how busy a CPU will 285882762d2aSDietmar Eggemann * be when a long-sleeping task wakes up. The contribution to CPU utilization 285982762d2aSDietmar Eggemann * of such a task would be significantly decayed at this point of time. 286082762d2aSDietmar Eggemann * 286182762d2aSDietmar Eggemann * CPU utilization can be higher than the current CPU capacity 286282762d2aSDietmar Eggemann * (f_curr/f_max * max CPU capacity) or even the max CPU capacity because 286382762d2aSDietmar Eggemann * of rounding errors as well as task migrations or wakeups of new tasks. 286482762d2aSDietmar Eggemann * CPU utilization has to be capped to fit into the [0..max CPU capacity] 286582762d2aSDietmar Eggemann * range. Otherwise a group of CPUs (CPU0 util = 121% + CPU1 util = 80%) 286682762d2aSDietmar Eggemann * could be seen as over-utilized even though CPU1 has 20% of spare CPU 286782762d2aSDietmar Eggemann * capacity. CPU utilization is allowed to overshoot current CPU capacity 286882762d2aSDietmar Eggemann * though since this is useful for predicting the CPU capacity required 286982762d2aSDietmar Eggemann * after task migrations (scheduler-driven DVFS). 287082762d2aSDietmar Eggemann * 287182762d2aSDietmar Eggemann * Return: (Estimated) utilization for the specified CPU. 287282762d2aSDietmar Eggemann */ 287382762d2aSDietmar Eggemann static inline unsigned long cpu_util_cfs(int cpu) 2874d4edd662SJuri Lelli { 287582762d2aSDietmar Eggemann struct cfs_rq *cfs_rq; 287682762d2aSDietmar Eggemann unsigned long util; 287782762d2aSDietmar Eggemann 287882762d2aSDietmar Eggemann cfs_rq = &cpu_rq(cpu)->cfs; 287982762d2aSDietmar Eggemann util = READ_ONCE(cfs_rq->avg.util_avg); 2880a07630b8SPatrick Bellasi 2881a07630b8SPatrick Bellasi if (sched_feat(UTIL_EST)) { 2882a07630b8SPatrick Bellasi util = max_t(unsigned long, util, 288382762d2aSDietmar Eggemann READ_ONCE(cfs_rq->avg.util_est.enqueued)); 2884a07630b8SPatrick Bellasi } 2885a07630b8SPatrick Bellasi 288682762d2aSDietmar Eggemann return min(util, capacity_orig_of(cpu)); 2887d4edd662SJuri Lelli } 2888371bf427SVincent Guittot 2889371bf427SVincent Guittot static inline unsigned long cpu_util_rt(struct rq *rq) 2890371bf427SVincent Guittot { 2891dfa444dcSVincent Guittot return READ_ONCE(rq->avg_rt.util_avg); 2892371bf427SVincent Guittot } 28937d6a905fSViresh Kumar #endif 28949033ea11SVincent Guittot 28957a17e1dbSQais Yousef #ifdef CONFIG_UCLAMP_TASK 28967a17e1dbSQais Yousef unsigned long uclamp_eff_value(struct task_struct *p, enum uclamp_id clamp_id); 28977a17e1dbSQais Yousef 28987a17e1dbSQais Yousef /** 28997a17e1dbSQais Yousef * uclamp_rq_util_with - clamp @util with @rq and @p effective uclamp values. 29007a17e1dbSQais Yousef * @rq: The rq to clamp against. Must not be NULL. 29017a17e1dbSQais Yousef * @util: The util value to clamp. 29027a17e1dbSQais Yousef * @p: The task to clamp against. Can be NULL if you want to clamp 29037a17e1dbSQais Yousef * against @rq only. 29047a17e1dbSQais Yousef * 29057a17e1dbSQais Yousef * Clamps the passed @util to the max(@rq, @p) effective uclamp values. 29067a17e1dbSQais Yousef * 29077a17e1dbSQais Yousef * If sched_uclamp_used static key is disabled, then just return the util 29087a17e1dbSQais Yousef * without any clamping since uclamp aggregation at the rq level in the fast 29097a17e1dbSQais Yousef * path is disabled, rendering this operation a NOP. 29107a17e1dbSQais Yousef * 29117a17e1dbSQais Yousef * Use uclamp_eff_value() if you don't care about uclamp values at rq level. It 29127a17e1dbSQais Yousef * will return the correct effective uclamp value of the task even if the 29137a17e1dbSQais Yousef * static key is disabled. 29147a17e1dbSQais Yousef */ 29157a17e1dbSQais Yousef static __always_inline 29167a17e1dbSQais Yousef unsigned long uclamp_rq_util_with(struct rq *rq, unsigned long util, 29177a17e1dbSQais Yousef struct task_struct *p) 29187a17e1dbSQais Yousef { 29197a17e1dbSQais Yousef unsigned long min_util = 0; 29207a17e1dbSQais Yousef unsigned long max_util = 0; 29217a17e1dbSQais Yousef 29227a17e1dbSQais Yousef if (!static_branch_likely(&sched_uclamp_used)) 29237a17e1dbSQais Yousef return util; 29247a17e1dbSQais Yousef 29257a17e1dbSQais Yousef if (p) { 29267a17e1dbSQais Yousef min_util = uclamp_eff_value(p, UCLAMP_MIN); 29277a17e1dbSQais Yousef max_util = uclamp_eff_value(p, UCLAMP_MAX); 29287a17e1dbSQais Yousef 29297a17e1dbSQais Yousef /* 29307a17e1dbSQais Yousef * Ignore last runnable task's max clamp, as this task will 29317a17e1dbSQais Yousef * reset it. Similarly, no need to read the rq's min clamp. 29327a17e1dbSQais Yousef */ 29337a17e1dbSQais Yousef if (rq->uclamp_flags & UCLAMP_FLAG_IDLE) 29347a17e1dbSQais Yousef goto out; 29357a17e1dbSQais Yousef } 29367a17e1dbSQais Yousef 29377a17e1dbSQais Yousef min_util = max_t(unsigned long, min_util, READ_ONCE(rq->uclamp[UCLAMP_MIN].value)); 29387a17e1dbSQais Yousef max_util = max_t(unsigned long, max_util, READ_ONCE(rq->uclamp[UCLAMP_MAX].value)); 29397a17e1dbSQais Yousef out: 29407a17e1dbSQais Yousef /* 29417a17e1dbSQais Yousef * Since CPU's {min,max}_util clamps are MAX aggregated considering 29427a17e1dbSQais Yousef * RUNNABLE tasks with _different_ clamps, we can end up with an 29437a17e1dbSQais Yousef * inversion. Fix it now when the clamps are applied. 29447a17e1dbSQais Yousef */ 29457a17e1dbSQais Yousef if (unlikely(min_util >= max_util)) 29467a17e1dbSQais Yousef return min_util; 29477a17e1dbSQais Yousef 29487a17e1dbSQais Yousef return clamp(util, min_util, max_util); 29497a17e1dbSQais Yousef } 29507a17e1dbSQais Yousef 29517a17e1dbSQais Yousef /* Is the rq being capped/throttled by uclamp_max? */ 29527a17e1dbSQais Yousef static inline bool uclamp_rq_is_capped(struct rq *rq) 29537a17e1dbSQais Yousef { 29547a17e1dbSQais Yousef unsigned long rq_util; 29557a17e1dbSQais Yousef unsigned long max_util; 29567a17e1dbSQais Yousef 29577a17e1dbSQais Yousef if (!static_branch_likely(&sched_uclamp_used)) 29587a17e1dbSQais Yousef return false; 29597a17e1dbSQais Yousef 29607a17e1dbSQais Yousef rq_util = cpu_util_cfs(cpu_of(rq)) + cpu_util_rt(rq); 29617a17e1dbSQais Yousef max_util = READ_ONCE(rq->uclamp[UCLAMP_MAX].value); 29627a17e1dbSQais Yousef 29637a17e1dbSQais Yousef return max_util != SCHED_CAPACITY_SCALE && rq_util >= max_util; 29647a17e1dbSQais Yousef } 29657a17e1dbSQais Yousef 29667a17e1dbSQais Yousef /* 29677a17e1dbSQais Yousef * When uclamp is compiled in, the aggregation at rq level is 'turned off' 29687a17e1dbSQais Yousef * by default in the fast path and only gets turned on once userspace performs 29697a17e1dbSQais Yousef * an operation that requires it. 29707a17e1dbSQais Yousef * 29717a17e1dbSQais Yousef * Returns true if userspace opted-in to use uclamp and aggregation at rq level 29727a17e1dbSQais Yousef * hence is active. 29737a17e1dbSQais Yousef */ 29747a17e1dbSQais Yousef static inline bool uclamp_is_used(void) 29757a17e1dbSQais Yousef { 29767a17e1dbSQais Yousef return static_branch_likely(&sched_uclamp_used); 29777a17e1dbSQais Yousef } 29787a17e1dbSQais Yousef #else /* CONFIG_UCLAMP_TASK */ 29797a17e1dbSQais Yousef static inline 29807a17e1dbSQais Yousef unsigned long uclamp_rq_util_with(struct rq *rq, unsigned long util, 29817a17e1dbSQais Yousef struct task_struct *p) 29827a17e1dbSQais Yousef { 29837a17e1dbSQais Yousef return util; 29847a17e1dbSQais Yousef } 29857a17e1dbSQais Yousef 29867a17e1dbSQais Yousef static inline bool uclamp_rq_is_capped(struct rq *rq) { return false; } 29877a17e1dbSQais Yousef 29887a17e1dbSQais Yousef static inline bool uclamp_is_used(void) 29897a17e1dbSQais Yousef { 29907a17e1dbSQais Yousef return false; 29917a17e1dbSQais Yousef } 29927a17e1dbSQais Yousef #endif /* CONFIG_UCLAMP_TASK */ 29937a17e1dbSQais Yousef 299411d4afd4SVincent Guittot #ifdef CONFIG_HAVE_SCHED_AVG_IRQ 29959033ea11SVincent Guittot static inline unsigned long cpu_util_irq(struct rq *rq) 29969033ea11SVincent Guittot { 29979033ea11SVincent Guittot return rq->avg_irq.util_avg; 29989033ea11SVincent Guittot } 29992e62c474SVincent Guittot 30002e62c474SVincent Guittot static inline 30012e62c474SVincent Guittot unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) 30022e62c474SVincent Guittot { 30032e62c474SVincent Guittot util *= (max - irq); 30042e62c474SVincent Guittot util /= max; 30052e62c474SVincent Guittot 30062e62c474SVincent Guittot return util; 30072e62c474SVincent Guittot 30082e62c474SVincent Guittot } 30099033ea11SVincent Guittot #else 30109033ea11SVincent Guittot static inline unsigned long cpu_util_irq(struct rq *rq) 30119033ea11SVincent Guittot { 30129033ea11SVincent Guittot return 0; 30139033ea11SVincent Guittot } 30149033ea11SVincent Guittot 30152e62c474SVincent Guittot static inline 30162e62c474SVincent Guittot unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) 30172e62c474SVincent Guittot { 30182e62c474SVincent Guittot return util; 30192e62c474SVincent Guittot } 3020794a56ebSJuri Lelli #endif 30216aa140faSQuentin Perret 3022531b5c9fSQuentin Perret #if defined(CONFIG_ENERGY_MODEL) && defined(CONFIG_CPU_FREQ_GOV_SCHEDUTIL) 30231f74de87SQuentin Perret 3024f8a696f2SPeter Zijlstra #define perf_domain_span(pd) (to_cpumask(((pd)->em_pd->cpus))) 3025f8a696f2SPeter Zijlstra 3026f8a696f2SPeter Zijlstra DECLARE_STATIC_KEY_FALSE(sched_energy_present); 3027f8a696f2SPeter Zijlstra 3028f8a696f2SPeter Zijlstra static inline bool sched_energy_enabled(void) 3029f8a696f2SPeter Zijlstra { 3030f8a696f2SPeter Zijlstra return static_branch_unlikely(&sched_energy_present); 3031f8a696f2SPeter Zijlstra } 3032f8a696f2SPeter Zijlstra 3033f8a696f2SPeter Zijlstra #else /* ! (CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL) */ 3034f8a696f2SPeter Zijlstra 3035f8a696f2SPeter Zijlstra #define perf_domain_span(pd) NULL 3036f8a696f2SPeter Zijlstra static inline bool sched_energy_enabled(void) { return false; } 3037f8a696f2SPeter Zijlstra 3038f8a696f2SPeter Zijlstra #endif /* CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL */ 3039227a4aadSMathieu Desnoyers 3040227a4aadSMathieu Desnoyers #ifdef CONFIG_MEMBARRIER 3041227a4aadSMathieu Desnoyers /* 3042227a4aadSMathieu Desnoyers * The scheduler provides memory barriers required by membarrier between: 3043227a4aadSMathieu Desnoyers * - prior user-space memory accesses and store to rq->membarrier_state, 3044227a4aadSMathieu Desnoyers * - store to rq->membarrier_state and following user-space memory accesses. 3045227a4aadSMathieu Desnoyers * In the same way it provides those guarantees around store to rq->curr. 3046227a4aadSMathieu Desnoyers */ 3047227a4aadSMathieu Desnoyers static inline void membarrier_switch_mm(struct rq *rq, 3048227a4aadSMathieu Desnoyers struct mm_struct *prev_mm, 3049227a4aadSMathieu Desnoyers struct mm_struct *next_mm) 3050227a4aadSMathieu Desnoyers { 3051227a4aadSMathieu Desnoyers int membarrier_state; 3052227a4aadSMathieu Desnoyers 3053227a4aadSMathieu Desnoyers if (prev_mm == next_mm) 3054227a4aadSMathieu Desnoyers return; 3055227a4aadSMathieu Desnoyers 3056227a4aadSMathieu Desnoyers membarrier_state = atomic_read(&next_mm->membarrier_state); 3057227a4aadSMathieu Desnoyers if (READ_ONCE(rq->membarrier_state) == membarrier_state) 3058227a4aadSMathieu Desnoyers return; 3059227a4aadSMathieu Desnoyers 3060227a4aadSMathieu Desnoyers WRITE_ONCE(rq->membarrier_state, membarrier_state); 3061227a4aadSMathieu Desnoyers } 3062227a4aadSMathieu Desnoyers #else 3063227a4aadSMathieu Desnoyers static inline void membarrier_switch_mm(struct rq *rq, 3064227a4aadSMathieu Desnoyers struct mm_struct *prev_mm, 3065227a4aadSMathieu Desnoyers struct mm_struct *next_mm) 3066227a4aadSMathieu Desnoyers { 3067227a4aadSMathieu Desnoyers } 3068227a4aadSMathieu Desnoyers #endif 306952262ee5SMel Gorman 307052262ee5SMel Gorman #ifdef CONFIG_SMP 307152262ee5SMel Gorman static inline bool is_per_cpu_kthread(struct task_struct *p) 307252262ee5SMel Gorman { 307352262ee5SMel Gorman if (!(p->flags & PF_KTHREAD)) 307452262ee5SMel Gorman return false; 307552262ee5SMel Gorman 307652262ee5SMel Gorman if (p->nr_cpus_allowed != 1) 307752262ee5SMel Gorman return false; 307852262ee5SMel Gorman 307952262ee5SMel Gorman return true; 308052262ee5SMel Gorman } 308152262ee5SMel Gorman #endif 3082b3212fe2SThomas Gleixner 30831011dcceSPeter Zijlstra extern void swake_up_all_locked(struct swait_queue_head *q); 30841011dcceSPeter Zijlstra extern void __prepare_to_swait(struct swait_queue_head *q, struct swait_queue *wait); 30851011dcceSPeter Zijlstra 30861011dcceSPeter Zijlstra #ifdef CONFIG_PREEMPT_DYNAMIC 30871011dcceSPeter Zijlstra extern int preempt_dynamic_mode; 30881011dcceSPeter Zijlstra extern int sched_dynamic_mode(const char *str); 30891011dcceSPeter Zijlstra extern void sched_dynamic_update(int mode); 30901011dcceSPeter Zijlstra #endif 30911011dcceSPeter Zijlstra 309295458477SIngo Molnar #endif /* _KERNEL_SCHED_SCHED_H */ 3093