1b2441318SGreg Kroah-Hartman /* SPDX-License-Identifier: GPL-2.0 */ 297fb7a0aSIngo Molnar /* 397fb7a0aSIngo Molnar * Scheduler internal types and methods: 497fb7a0aSIngo Molnar */ 595458477SIngo Molnar #ifndef _KERNEL_SCHED_SCHED_H 695458477SIngo Molnar #define _KERNEL_SCHED_SCHED_H 7325ea10cSIngo Molnar 8801c1419SIngo Molnar #include <linux/sched/affinity.h> 9dfc3401aSIngo Molnar #include <linux/sched/autogroup.h> 1055687da1SIngo Molnar #include <linux/sched/cpufreq.h> 11325ea10cSIngo Molnar #include <linux/sched/deadline.h> 124ff8f2caSIngo Molnar #include <linux/sched.h> 13325ea10cSIngo Molnar #include <linux/sched/loadavg.h> 14325ea10cSIngo Molnar #include <linux/sched/mm.h> 15801c1419SIngo Molnar #include <linux/sched/rseq_api.h> 16325ea10cSIngo Molnar #include <linux/sched/signal.h> 17321a874aSThomas Gleixner #include <linux/sched/smt.h> 18325ea10cSIngo Molnar #include <linux/sched/stat.h> 19325ea10cSIngo Molnar #include <linux/sched/sysctl.h> 204ff8f2caSIngo Molnar #include <linux/sched/task_flags.h> 2129930025SIngo Molnar #include <linux/sched/task.h> 22325ea10cSIngo Molnar #include <linux/sched/topology.h> 23ef8bd77fSIngo Molnar 244ff8f2caSIngo Molnar #include <linux/atomic.h> 254ff8f2caSIngo Molnar #include <linux/bitmap.h> 264ff8f2caSIngo Molnar #include <linux/bug.h> 274ff8f2caSIngo Molnar #include <linux/capability.h> 284ff8f2caSIngo Molnar #include <linux/cgroup_api.h> 294ff8f2caSIngo Molnar #include <linux/cgroup.h> 30e67198ccSFrederic Weisbecker #include <linux/context_tracking.h> 31325ea10cSIngo Molnar #include <linux/cpufreq.h> 324ff8f2caSIngo Molnar #include <linux/cpumask_api.h> 33325ea10cSIngo Molnar #include <linux/ctype.h> 344ff8f2caSIngo Molnar #include <linux/file.h> 354ff8f2caSIngo Molnar #include <linux/fs_api.h> 364ff8f2caSIngo Molnar #include <linux/hrtimer_api.h> 374ff8f2caSIngo Molnar #include <linux/interrupt.h> 384ff8f2caSIngo Molnar #include <linux/irq_work.h> 394ff8f2caSIngo Molnar #include <linux/jiffies.h> 404ff8f2caSIngo Molnar #include <linux/kref_api.h> 41325ea10cSIngo Molnar #include <linux/kthread.h> 424ff8f2caSIngo Molnar #include <linux/ktime_api.h> 434ff8f2caSIngo Molnar #include <linux/lockdep_api.h> 444ff8f2caSIngo Molnar #include <linux/lockdep.h> 454ff8f2caSIngo Molnar #include <linux/minmax.h> 464ff8f2caSIngo Molnar #include <linux/mm.h> 474ff8f2caSIngo Molnar #include <linux/module.h> 484ff8f2caSIngo Molnar #include <linux/mutex_api.h> 494ff8f2caSIngo Molnar #include <linux/plist.h> 504ff8f2caSIngo Molnar #include <linux/poll.h> 51325ea10cSIngo Molnar #include <linux/proc_fs.h> 52325ea10cSIngo Molnar #include <linux/profile.h> 53eb414681SJohannes Weiner #include <linux/psi.h> 544ff8f2caSIngo Molnar #include <linux/rcupdate.h> 554ff8f2caSIngo Molnar #include <linux/seq_file.h> 564ff8f2caSIngo Molnar #include <linux/seqlock.h> 574ff8f2caSIngo Molnar #include <linux/softirq.h> 584ff8f2caSIngo Molnar #include <linux/spinlock_api.h> 594ff8f2caSIngo Molnar #include <linux/static_key.h> 60391e43daSPeter Zijlstra #include <linux/stop_machine.h> 614ff8f2caSIngo Molnar #include <linux/syscalls_api.h> 62325ea10cSIngo Molnar #include <linux/syscalls.h> 634ff8f2caSIngo Molnar #include <linux/tick.h> 644ff8f2caSIngo Molnar #include <linux/topology.h> 654ff8f2caSIngo Molnar #include <linux/types.h> 664ff8f2caSIngo Molnar #include <linux/u64_stats_sync_api.h> 674ff8f2caSIngo Molnar #include <linux/uaccess.h> 684ff8f2caSIngo Molnar #include <linux/wait_api.h> 694ff8f2caSIngo Molnar #include <linux/wait_bit.h> 704ff8f2caSIngo Molnar #include <linux/workqueue_api.h> 71325ea10cSIngo Molnar 724ff8f2caSIngo Molnar #include <trace/events/power.h> 73b9e9c6caSIngo Molnar #include <trace/events/sched.h> 74b9e9c6caSIngo Molnar 754ff8f2caSIngo Molnar #include "../workqueue_internal.h" 764ff8f2caSIngo Molnar 777fce777cSIngo Molnar #ifdef CONFIG_PARAVIRT 787fce777cSIngo Molnar # include <asm/paravirt.h> 794ff8f2caSIngo Molnar # include <asm/paravirt_api_clock.h> 807fce777cSIngo Molnar #endif 817fce777cSIngo Molnar 82391e43daSPeter Zijlstra #include "cpupri.h" 836bfd6d72SJuri Lelli #include "cpudeadline.h" 84391e43daSPeter Zijlstra 859148a3a1SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 869148a3a1SPeter Zijlstra # define SCHED_WARN_ON(x) WARN_ONCE(x, #x) 879148a3a1SPeter Zijlstra #else 886d3aed3dSIngo Molnar # define SCHED_WARN_ON(x) ({ (void)(x), 0; }) 899148a3a1SPeter Zijlstra #endif 909148a3a1SPeter Zijlstra 9145ceebf7SPaul Gortmaker struct rq; 92442bf3aaSDaniel Lezcano struct cpuidle_state; 9345ceebf7SPaul Gortmaker 94da0c1e65SKirill Tkhai /* task_struct::on_rq states: */ 95da0c1e65SKirill Tkhai #define TASK_ON_RQ_QUEUED 1 96cca26e80SKirill Tkhai #define TASK_ON_RQ_MIGRATING 2 97da0c1e65SKirill Tkhai 98391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 99391e43daSPeter Zijlstra 10045ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 10145ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 10245ceebf7SPaul Gortmaker 1033289bdb4SPeter Zijlstra extern void calc_global_load_tick(struct rq *this_rq); 104d60585c5SThomas Gleixner extern long calc_load_fold_active(struct rq *this_rq, long adjust); 1053289bdb4SPeter Zijlstra 1069d246053SPhil Auld extern void call_trace_sched_update_nr_running(struct rq *rq, int count); 107d9ab0e63SZhen Ni 108089768dfSYajun Deng extern int sysctl_sched_rt_period; 109d9ab0e63SZhen Ni extern int sysctl_sched_rt_runtime; 110dafd7a9dSZhen Ni extern int sched_rr_timeslice; 111d9ab0e63SZhen Ni 112391e43daSPeter Zijlstra /* 113391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 114391e43daSPeter Zijlstra */ 115391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 116391e43daSPeter Zijlstra 117cc1f4b1fSLi Zefan /* 118cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 119cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 120cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 121cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 122cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 123cc1f4b1fSLi Zefan * 124cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 12597fb7a0aSIngo Molnar * resolution (i.e. 64-bit). The costs for increasing resolution when 32-bit 12697fb7a0aSIngo Molnar * are pretty high and the returns do not justify the increased costs. 1272159197dSPeter Zijlstra * 12897fb7a0aSIngo Molnar * Really only required when CONFIG_FAIR_GROUP_SCHED=y is also set, but to 12997fb7a0aSIngo Molnar * increase coverage and consistency always enable it on 64-bit platforms. 130cc1f4b1fSLi Zefan */ 1312159197dSPeter Zijlstra #ifdef CONFIG_64BIT 132172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT + SCHED_FIXEDPOINT_SHIFT) 1336ecdd749SYuyang Du # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT) 13426cf5222SMichael Wang # define scale_load_down(w) \ 13526cf5222SMichael Wang ({ \ 13626cf5222SMichael Wang unsigned long __w = (w); \ 13726cf5222SMichael Wang if (__w) \ 13826cf5222SMichael Wang __w = max(2UL, __w >> SCHED_FIXEDPOINT_SHIFT); \ 13926cf5222SMichael Wang __w; \ 14026cf5222SMichael Wang }) 141cc1f4b1fSLi Zefan #else 142172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT) 143cc1f4b1fSLi Zefan # define scale_load(w) (w) 144cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 145cc1f4b1fSLi Zefan #endif 146cc1f4b1fSLi Zefan 1476ecdd749SYuyang Du /* 148172895e6SYuyang Du * Task weight (visible to users) and its load (invisible to users) have 149172895e6SYuyang Du * independent resolution, but they should be well calibrated. We use 150172895e6SYuyang Du * scale_load() and scale_load_down(w) to convert between them. The 151172895e6SYuyang Du * following must be true: 152172895e6SYuyang Du * 1539d061ba6SDietmar Eggemann * scale_load(sched_prio_to_weight[NICE_TO_PRIO(0)-MAX_RT_PRIO]) == NICE_0_LOAD 154172895e6SYuyang Du * 1556ecdd749SYuyang Du */ 156172895e6SYuyang Du #define NICE_0_LOAD (1L << NICE_0_LOAD_SHIFT) 157391e43daSPeter Zijlstra 158391e43daSPeter Zijlstra /* 159332ac17eSDario Faggioli * Single value that decides SCHED_DEADLINE internal math precision. 160332ac17eSDario Faggioli * 10 -> just above 1us 161332ac17eSDario Faggioli * 9 -> just above 0.5us 162332ac17eSDario Faggioli */ 16397fb7a0aSIngo Molnar #define DL_SCALE 10 164332ac17eSDario Faggioli 165332ac17eSDario Faggioli /* 16697fb7a0aSIngo Molnar * Single value that denotes runtime == period, ie unlimited time. 167391e43daSPeter Zijlstra */ 168391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 169391e43daSPeter Zijlstra 17020f9cd2aSHenrik Austad static inline int idle_policy(int policy) 17120f9cd2aSHenrik Austad { 17220f9cd2aSHenrik Austad return policy == SCHED_IDLE; 17320f9cd2aSHenrik Austad } 174d50dde5aSDario Faggioli static inline int fair_policy(int policy) 175d50dde5aSDario Faggioli { 176d50dde5aSDario Faggioli return policy == SCHED_NORMAL || policy == SCHED_BATCH; 177d50dde5aSDario Faggioli } 178d50dde5aSDario Faggioli 179391e43daSPeter Zijlstra static inline int rt_policy(int policy) 180391e43daSPeter Zijlstra { 181d50dde5aSDario Faggioli return policy == SCHED_FIFO || policy == SCHED_RR; 182391e43daSPeter Zijlstra } 183391e43daSPeter Zijlstra 184aab03e05SDario Faggioli static inline int dl_policy(int policy) 185aab03e05SDario Faggioli { 186aab03e05SDario Faggioli return policy == SCHED_DEADLINE; 187aab03e05SDario Faggioli } 18820f9cd2aSHenrik Austad static inline bool valid_policy(int policy) 18920f9cd2aSHenrik Austad { 19020f9cd2aSHenrik Austad return idle_policy(policy) || fair_policy(policy) || 19120f9cd2aSHenrik Austad rt_policy(policy) || dl_policy(policy); 19220f9cd2aSHenrik Austad } 193aab03e05SDario Faggioli 1941da1843fSViresh Kumar static inline int task_has_idle_policy(struct task_struct *p) 1951da1843fSViresh Kumar { 1961da1843fSViresh Kumar return idle_policy(p->policy); 1971da1843fSViresh Kumar } 1981da1843fSViresh Kumar 199391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 200391e43daSPeter Zijlstra { 201391e43daSPeter Zijlstra return rt_policy(p->policy); 202391e43daSPeter Zijlstra } 203391e43daSPeter Zijlstra 204aab03e05SDario Faggioli static inline int task_has_dl_policy(struct task_struct *p) 205aab03e05SDario Faggioli { 206aab03e05SDario Faggioli return dl_policy(p->policy); 207aab03e05SDario Faggioli } 208aab03e05SDario Faggioli 20907881166SJuri Lelli #define cap_scale(v, s) ((v)*(s) >> SCHED_CAPACITY_SHIFT) 21007881166SJuri Lelli 211d76343c6SValentin Schneider static inline void update_avg(u64 *avg, u64 sample) 212d76343c6SValentin Schneider { 213d76343c6SValentin Schneider s64 diff = sample - *avg; 214d76343c6SValentin Schneider *avg += diff / 8; 215d76343c6SValentin Schneider } 216d76343c6SValentin Schneider 2172d3d891dSDario Faggioli /* 21839a2a6ebSValentin Schneider * Shifting a value by an exponent greater *or equal* to the size of said value 21939a2a6ebSValentin Schneider * is UB; cap at size-1. 22039a2a6ebSValentin Schneider */ 22139a2a6ebSValentin Schneider #define shr_bound(val, shift) \ 22239a2a6ebSValentin Schneider (val >> min_t(typeof(shift), shift, BITS_PER_TYPE(typeof(val)) - 1)) 22339a2a6ebSValentin Schneider 22439a2a6ebSValentin Schneider /* 225794a56ebSJuri Lelli * !! For sched_setattr_nocheck() (kernel) only !! 226794a56ebSJuri Lelli * 227794a56ebSJuri Lelli * This is actually gross. :( 228794a56ebSJuri Lelli * 229794a56ebSJuri Lelli * It is used to make schedutil kworker(s) higher priority than SCHED_DEADLINE 230794a56ebSJuri Lelli * tasks, but still be able to sleep. We need this on platforms that cannot 231794a56ebSJuri Lelli * atomically change clock frequency. Remove once fast switching will be 232794a56ebSJuri Lelli * available on such platforms. 233794a56ebSJuri Lelli * 234794a56ebSJuri Lelli * SUGOV stands for SchedUtil GOVernor. 235794a56ebSJuri Lelli */ 236794a56ebSJuri Lelli #define SCHED_FLAG_SUGOV 0x10000000 237794a56ebSJuri Lelli 238f9509153SQuentin Perret #define SCHED_DL_FLAGS (SCHED_FLAG_RECLAIM | SCHED_FLAG_DL_OVERRUN | SCHED_FLAG_SUGOV) 239f9509153SQuentin Perret 240904cbab7SMatthew Wilcox (Oracle) static inline bool dl_entity_is_special(const struct sched_dl_entity *dl_se) 241794a56ebSJuri Lelli { 242794a56ebSJuri Lelli #ifdef CONFIG_CPU_FREQ_GOV_SCHEDUTIL 243794a56ebSJuri Lelli return unlikely(dl_se->flags & SCHED_FLAG_SUGOV); 244794a56ebSJuri Lelli #else 245794a56ebSJuri Lelli return false; 246794a56ebSJuri Lelli #endif 247794a56ebSJuri Lelli } 248794a56ebSJuri Lelli 249794a56ebSJuri Lelli /* 2502d3d891dSDario Faggioli * Tells if entity @a should preempt entity @b. 2512d3d891dSDario Faggioli */ 252904cbab7SMatthew Wilcox (Oracle) static inline bool dl_entity_preempt(const struct sched_dl_entity *a, 253904cbab7SMatthew Wilcox (Oracle) const struct sched_dl_entity *b) 2542d3d891dSDario Faggioli { 255794a56ebSJuri Lelli return dl_entity_is_special(a) || 256794a56ebSJuri Lelli dl_time_before(a->deadline, b->deadline); 2572d3d891dSDario Faggioli } 2582d3d891dSDario Faggioli 259391e43daSPeter Zijlstra /* 260391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 261391e43daSPeter Zijlstra */ 262391e43daSPeter Zijlstra struct rt_prio_array { 263391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 264391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 265391e43daSPeter Zijlstra }; 266391e43daSPeter Zijlstra 267391e43daSPeter Zijlstra struct rt_bandwidth { 268391e43daSPeter Zijlstra /* nests inside the rq lock: */ 269391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 270391e43daSPeter Zijlstra ktime_t rt_period; 271391e43daSPeter Zijlstra u64 rt_runtime; 272391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 2734cfafd30SPeter Zijlstra unsigned int rt_period_active; 274391e43daSPeter Zijlstra }; 275a5e7be3bSJuri Lelli 276a5e7be3bSJuri Lelli void __dl_clear_params(struct task_struct *p); 277a5e7be3bSJuri Lelli 278332ac17eSDario Faggioli static inline int dl_bandwidth_enabled(void) 279332ac17eSDario Faggioli { 2801724813dSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 281332ac17eSDario Faggioli } 282332ac17eSDario Faggioli 283a57415f5SPeng Liu /* 284a57415f5SPeng Liu * To keep the bandwidth of -deadline tasks under control 285a57415f5SPeng Liu * we need some place where: 286a57415f5SPeng Liu * - store the maximum -deadline bandwidth of each cpu; 287a57415f5SPeng Liu * - cache the fraction of bandwidth that is currently allocated in 288a57415f5SPeng Liu * each root domain; 289a57415f5SPeng Liu * 290a57415f5SPeng Liu * This is all done in the data structure below. It is similar to the 291a57415f5SPeng Liu * one used for RT-throttling (rt_bandwidth), with the main difference 292a57415f5SPeng Liu * that, since here we are only interested in admission control, we 293a57415f5SPeng Liu * do not decrease any runtime while the group "executes", neither we 294a57415f5SPeng Liu * need a timer to replenish it. 295a57415f5SPeng Liu * 296a57415f5SPeng Liu * With respect to SMP, bandwidth is given on a per root domain basis, 297a57415f5SPeng Liu * meaning that: 298a57415f5SPeng Liu * - bw (< 100%) is the deadline bandwidth of each CPU; 299a57415f5SPeng Liu * - total_bw is the currently allocated bandwidth in each root domain; 300a57415f5SPeng Liu */ 301332ac17eSDario Faggioli struct dl_bw { 302332ac17eSDario Faggioli raw_spinlock_t lock; 30397fb7a0aSIngo Molnar u64 bw; 30497fb7a0aSIngo Molnar u64 total_bw; 305332ac17eSDario Faggioli }; 306332ac17eSDario Faggioli 307f2cb1360SIngo Molnar extern void init_dl_bw(struct dl_bw *dl_b); 30806a76fe0SNicolas Pitre extern int sched_dl_global_validate(void); 30906a76fe0SNicolas Pitre extern void sched_dl_do_global(void); 31097fb7a0aSIngo Molnar extern int sched_dl_overflow(struct task_struct *p, int policy, const struct sched_attr *attr); 31106a76fe0SNicolas Pitre extern void __setparam_dl(struct task_struct *p, const struct sched_attr *attr); 31206a76fe0SNicolas Pitre extern void __getparam_dl(struct task_struct *p, struct sched_attr *attr); 31306a76fe0SNicolas Pitre extern bool __checkparam_dl(const struct sched_attr *attr); 31406a76fe0SNicolas Pitre extern bool dl_param_changed(struct task_struct *p, const struct sched_attr *attr); 31597fb7a0aSIngo Molnar extern int dl_cpuset_cpumask_can_shrink(const struct cpumask *cur, const struct cpumask *trial); 31685989106SDietmar Eggemann extern int dl_bw_check_overflow(int cpu); 317391e43daSPeter Zijlstra 318391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 319391e43daSPeter Zijlstra 320391e43daSPeter Zijlstra struct cfs_rq; 321391e43daSPeter Zijlstra struct rt_rq; 322391e43daSPeter Zijlstra 32335cf4e50SMike Galbraith extern struct list_head task_groups; 324391e43daSPeter Zijlstra 325391e43daSPeter Zijlstra struct cfs_bandwidth { 326391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 327391e43daSPeter Zijlstra raw_spinlock_t lock; 328391e43daSPeter Zijlstra ktime_t period; 32997fb7a0aSIngo Molnar u64 quota; 33097fb7a0aSIngo Molnar u64 runtime; 331f4183717SHuaixin Chang u64 burst; 332bcb1704aSHuaixin Chang u64 runtime_snap; 3339c58c79aSZhihui Zhang s64 hierarchical_quota; 334391e43daSPeter Zijlstra 33566567fcbSbsegall@google.com u8 idle; 33666567fcbSbsegall@google.com u8 period_active; 33766567fcbSbsegall@google.com u8 slack_started; 33897fb7a0aSIngo Molnar struct hrtimer period_timer; 33997fb7a0aSIngo Molnar struct hrtimer slack_timer; 340391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 341391e43daSPeter Zijlstra 34297fb7a0aSIngo Molnar /* Statistics: */ 34397fb7a0aSIngo Molnar int nr_periods; 34497fb7a0aSIngo Molnar int nr_throttled; 345bcb1704aSHuaixin Chang int nr_burst; 346391e43daSPeter Zijlstra u64 throttled_time; 347bcb1704aSHuaixin Chang u64 burst_time; 348391e43daSPeter Zijlstra #endif 349391e43daSPeter Zijlstra }; 350391e43daSPeter Zijlstra 35197fb7a0aSIngo Molnar /* Task group related information */ 352391e43daSPeter Zijlstra struct task_group { 353391e43daSPeter Zijlstra struct cgroup_subsys_state css; 354391e43daSPeter Zijlstra 355391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 35697fb7a0aSIngo Molnar /* schedulable entities of this group on each CPU */ 357391e43daSPeter Zijlstra struct sched_entity **se; 35897fb7a0aSIngo Molnar /* runqueue "owned" by this group on each CPU */ 359391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 360391e43daSPeter Zijlstra unsigned long shares; 361391e43daSPeter Zijlstra 36230400039SJosh Don /* A positive value indicates that this is a SCHED_IDLE group. */ 36330400039SJosh Don int idle; 36430400039SJosh Don 365fa6bddebSAlex Shi #ifdef CONFIG_SMP 366b0367629SWaiman Long /* 367b0367629SWaiman Long * load_avg can be heavily contended at clock tick time, so put 368b0367629SWaiman Long * it in its own cacheline separated from the fields above which 369b0367629SWaiman Long * will also be accessed at each tick. 370b0367629SWaiman Long */ 371b0367629SWaiman Long atomic_long_t load_avg ____cacheline_aligned; 372391e43daSPeter Zijlstra #endif 373fa6bddebSAlex Shi #endif 374391e43daSPeter Zijlstra 375391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 376391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 377391e43daSPeter Zijlstra struct rt_rq **rt_rq; 378391e43daSPeter Zijlstra 379391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 380391e43daSPeter Zijlstra #endif 381391e43daSPeter Zijlstra 382391e43daSPeter Zijlstra struct rcu_head rcu; 383391e43daSPeter Zijlstra struct list_head list; 384391e43daSPeter Zijlstra 385391e43daSPeter Zijlstra struct task_group *parent; 386391e43daSPeter Zijlstra struct list_head siblings; 387391e43daSPeter Zijlstra struct list_head children; 388391e43daSPeter Zijlstra 389391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 390391e43daSPeter Zijlstra struct autogroup *autogroup; 391391e43daSPeter Zijlstra #endif 392391e43daSPeter Zijlstra 393391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 3942480c093SPatrick Bellasi 3952480c093SPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK_GROUP 3962480c093SPatrick Bellasi /* The two decimal precision [%] value requested from user-space */ 3972480c093SPatrick Bellasi unsigned int uclamp_pct[UCLAMP_CNT]; 3982480c093SPatrick Bellasi /* Clamp values requested for a task group */ 3992480c093SPatrick Bellasi struct uclamp_se uclamp_req[UCLAMP_CNT]; 4000b60ba2dSPatrick Bellasi /* Effective clamp values used for a task group */ 4010b60ba2dSPatrick Bellasi struct uclamp_se uclamp[UCLAMP_CNT]; 4022480c093SPatrick Bellasi #endif 4032480c093SPatrick Bellasi 404391e43daSPeter Zijlstra }; 405391e43daSPeter Zijlstra 406391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 407391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 408391e43daSPeter Zijlstra 409391e43daSPeter Zijlstra /* 410391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 411391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 412391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 413391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 414391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 415391e43daSPeter Zijlstra * limitation from this.) 416391e43daSPeter Zijlstra */ 417391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 418391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 419391e43daSPeter Zijlstra #endif 420391e43daSPeter Zijlstra 421391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 422391e43daSPeter Zijlstra 423391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 424391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 425391e43daSPeter Zijlstra 426391e43daSPeter Zijlstra /* 427391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 428391e43daSPeter Zijlstra * leaving it for the final time. 429391e43daSPeter Zijlstra * 430391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 431391e43daSPeter Zijlstra */ 432391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 433391e43daSPeter Zijlstra { 434391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 435391e43daSPeter Zijlstra } 436391e43daSPeter Zijlstra 437391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 438391e43daSPeter Zijlstra 439391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 440391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 4418663e24dSPeter Zijlstra extern void online_fair_sched_group(struct task_group *tg); 4426fe1f348SPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg); 443391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 444391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 445391e43daSPeter Zijlstra struct sched_entity *parent); 446c98c1827SPhil Auld extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b, struct cfs_bandwidth *parent); 447391e43daSPeter Zijlstra 448391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 44977a4d1a1SPeter Zijlstra extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 450391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 45188c56cfeSPhil Auld extern bool cfs_task_bw_constrained(struct task_struct *p); 452391e43daSPeter Zijlstra 453391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 454391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 455391e43daSPeter Zijlstra struct sched_rt_entity *parent); 4568887cd99SNicolas Pitre extern int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us); 4578887cd99SNicolas Pitre extern int sched_group_set_rt_period(struct task_group *tg, u64 rt_period_us); 4588887cd99SNicolas Pitre extern long sched_group_rt_runtime(struct task_group *tg); 4598887cd99SNicolas Pitre extern long sched_group_rt_period(struct task_group *tg); 4608887cd99SNicolas Pitre extern int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk); 461391e43daSPeter Zijlstra 46225cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 46325cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 46425cc7da7SLi Zefan struct task_group *parent); 46525cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 466b027789eSMathias Krause extern void sched_release_group(struct task_group *tg); 46725cc7da7SLi Zefan 46825cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 46925cc7da7SLi Zefan 47025cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 47125cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 472ad936d86SByungchul Park 47330400039SJosh Don extern int sched_group_set_idle(struct task_group *tg, long idle); 47430400039SJosh Don 475ad936d86SByungchul Park #ifdef CONFIG_SMP 476ad936d86SByungchul Park extern void set_task_rq_fair(struct sched_entity *se, 477ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next); 478ad936d86SByungchul Park #else /* !CONFIG_SMP */ 479ad936d86SByungchul Park static inline void set_task_rq_fair(struct sched_entity *se, 480ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next) { } 481ad936d86SByungchul Park #endif /* CONFIG_SMP */ 482ad936d86SByungchul Park #endif /* CONFIG_FAIR_GROUP_SCHED */ 48325cc7da7SLi Zefan 484391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 485391e43daSPeter Zijlstra 486391e43daSPeter Zijlstra struct cfs_bandwidth { }; 48788c56cfeSPhil Auld static inline bool cfs_task_bw_constrained(struct task_struct *p) { return false; } 488391e43daSPeter Zijlstra 489391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 490391e43daSPeter Zijlstra 49187514b2cSBen Dooks extern void unregister_rt_sched_group(struct task_group *tg); 49287514b2cSBen Dooks extern void free_rt_sched_group(struct task_group *tg); 49387514b2cSBen Dooks extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 49487514b2cSBen Dooks 495d05b4305SVincent Donnefort /* 496d05b4305SVincent Donnefort * u64_u32_load/u64_u32_store 497d05b4305SVincent Donnefort * 498d05b4305SVincent Donnefort * Use a copy of a u64 value to protect against data race. This is only 499d05b4305SVincent Donnefort * applicable for 32-bits architectures. 500d05b4305SVincent Donnefort */ 501d05b4305SVincent Donnefort #ifdef CONFIG_64BIT 502d05b4305SVincent Donnefort # define u64_u32_load_copy(var, copy) var 503d05b4305SVincent Donnefort # define u64_u32_store_copy(var, copy, val) (var = val) 504d05b4305SVincent Donnefort #else 505d05b4305SVincent Donnefort # define u64_u32_load_copy(var, copy) \ 506d05b4305SVincent Donnefort ({ \ 507d05b4305SVincent Donnefort u64 __val, __val_copy; \ 508d05b4305SVincent Donnefort do { \ 509d05b4305SVincent Donnefort __val_copy = copy; \ 510d05b4305SVincent Donnefort /* \ 511d05b4305SVincent Donnefort * paired with u64_u32_store_copy(), ordering access \ 512d05b4305SVincent Donnefort * to var and copy. \ 513d05b4305SVincent Donnefort */ \ 514d05b4305SVincent Donnefort smp_rmb(); \ 515d05b4305SVincent Donnefort __val = var; \ 516d05b4305SVincent Donnefort } while (__val != __val_copy); \ 517d05b4305SVincent Donnefort __val; \ 518d05b4305SVincent Donnefort }) 519d05b4305SVincent Donnefort # define u64_u32_store_copy(var, copy, val) \ 520d05b4305SVincent Donnefort do { \ 521d05b4305SVincent Donnefort typeof(val) __val = (val); \ 522d05b4305SVincent Donnefort var = __val; \ 523d05b4305SVincent Donnefort /* \ 524d05b4305SVincent Donnefort * paired with u64_u32_load_copy(), ordering access to var and \ 525d05b4305SVincent Donnefort * copy. \ 526d05b4305SVincent Donnefort */ \ 527d05b4305SVincent Donnefort smp_wmb(); \ 528d05b4305SVincent Donnefort copy = __val; \ 529d05b4305SVincent Donnefort } while (0) 530d05b4305SVincent Donnefort #endif 531d05b4305SVincent Donnefort # define u64_u32_load(var) u64_u32_load_copy(var, var##_copy) 532d05b4305SVincent Donnefort # define u64_u32_store(var, val) u64_u32_store_copy(var, var##_copy, val) 533d05b4305SVincent Donnefort 534391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 535391e43daSPeter Zijlstra struct cfs_rq { 536391e43daSPeter Zijlstra struct load_weight load; 53797fb7a0aSIngo Molnar unsigned int nr_running; 53843e9f7f2SViresh Kumar unsigned int h_nr_running; /* SCHED_{NORMAL,BATCH,IDLE} */ 539a480addeSJosh Don unsigned int idle_nr_running; /* SCHED_IDLE */ 54043e9f7f2SViresh Kumar unsigned int idle_h_nr_running; /* SCHED_IDLE */ 541391e43daSPeter Zijlstra 542af4cf404SPeter Zijlstra s64 avg_vruntime; 543af4cf404SPeter Zijlstra u64 avg_load; 544af4cf404SPeter Zijlstra 545391e43daSPeter Zijlstra u64 exec_clock; 546391e43daSPeter Zijlstra u64 min_vruntime; 547c6047c2eSJoel Fernandes (Google) #ifdef CONFIG_SCHED_CORE 548c6047c2eSJoel Fernandes (Google) unsigned int forceidle_seq; 549c6047c2eSJoel Fernandes (Google) u64 min_vruntime_fi; 550c6047c2eSJoel Fernandes (Google) #endif 551c6047c2eSJoel Fernandes (Google) 552391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 553391e43daSPeter Zijlstra u64 min_vruntime_copy; 554391e43daSPeter Zijlstra #endif 555391e43daSPeter Zijlstra 556bfb06889SDavidlohr Bueso struct rb_root_cached tasks_timeline; 557391e43daSPeter Zijlstra 558391e43daSPeter Zijlstra /* 559391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 560391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 561391e43daSPeter Zijlstra */ 56297fb7a0aSIngo Molnar struct sched_entity *curr; 56397fb7a0aSIngo Molnar struct sched_entity *next; 564391e43daSPeter Zijlstra 565391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 566391e43daSPeter Zijlstra unsigned int nr_spread_over; 567391e43daSPeter Zijlstra #endif 568391e43daSPeter Zijlstra 5692dac754eSPaul Turner #ifdef CONFIG_SMP 5702dac754eSPaul Turner /* 5719d89c257SYuyang Du * CFS load tracking 5722dac754eSPaul Turner */ 5739d89c257SYuyang Du struct sched_avg avg; 5742a2f5d4eSPeter Zijlstra #ifndef CONFIG_64BIT 575d05b4305SVincent Donnefort u64 last_update_time_copy; 5762a2f5d4eSPeter Zijlstra #endif 5772a2f5d4eSPeter Zijlstra struct { 5782a2f5d4eSPeter Zijlstra raw_spinlock_t lock ____cacheline_aligned; 5792a2f5d4eSPeter Zijlstra int nr; 5802a2f5d4eSPeter Zijlstra unsigned long load_avg; 5812a2f5d4eSPeter Zijlstra unsigned long util_avg; 5829f683953SVincent Guittot unsigned long runnable_avg; 5832a2f5d4eSPeter Zijlstra } removed; 584141965c7SAlex Shi 585c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 5861528c661SAaron Lu u64 last_update_tg_load_avg; 5870e2d2aaaSPeter Zijlstra unsigned long tg_load_avg_contrib; 5880e2d2aaaSPeter Zijlstra long propagate; 5890e2d2aaaSPeter Zijlstra long prop_runnable_sum; 5900e2d2aaaSPeter Zijlstra 59182958366SPaul Turner /* 59282958366SPaul Turner * h_load = weight * f(tg) 59382958366SPaul Turner * 59482958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 59582958366SPaul Turner * this group. 59682958366SPaul Turner */ 59782958366SPaul Turner unsigned long h_load; 59868520796SVladimir Davydov u64 last_h_load_update; 59968520796SVladimir Davydov struct sched_entity *h_load_next; 60068520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 60182958366SPaul Turner #endif /* CONFIG_SMP */ 60282958366SPaul Turner 603391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 60497fb7a0aSIngo Molnar struct rq *rq; /* CPU runqueue to which this cfs_rq is attached */ 605391e43daSPeter Zijlstra 606391e43daSPeter Zijlstra /* 607391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 608391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 609391e43daSPeter Zijlstra * (like users, containers etc.) 610391e43daSPeter Zijlstra * 61197fb7a0aSIngo Molnar * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a CPU. 61297fb7a0aSIngo Molnar * This list is used during load balance. 613391e43daSPeter Zijlstra */ 614391e43daSPeter Zijlstra int on_list; 615391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 616391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 617391e43daSPeter Zijlstra 61830400039SJosh Don /* Locally cached copy of our task_group's idle value */ 61930400039SJosh Don int idle; 62030400039SJosh Don 621391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 622391e43daSPeter Zijlstra int runtime_enabled; 623391e43daSPeter Zijlstra s64 runtime_remaining; 624391e43daSPeter Zijlstra 625e2f3e35fSVincent Donnefort u64 throttled_pelt_idle; 626e2f3e35fSVincent Donnefort #ifndef CONFIG_64BIT 627e2f3e35fSVincent Donnefort u64 throttled_pelt_idle_copy; 628e2f3e35fSVincent Donnefort #endif 62997fb7a0aSIngo Molnar u64 throttled_clock; 63064eaf507SChengming Zhou u64 throttled_clock_pelt; 63164eaf507SChengming Zhou u64 throttled_clock_pelt_time; 632677ea015SJosh Don u64 throttled_clock_self; 633677ea015SJosh Don u64 throttled_clock_self_time; 63497fb7a0aSIngo Molnar int throttled; 63597fb7a0aSIngo Molnar int throttle_count; 636391e43daSPeter Zijlstra struct list_head throttled_list; 6378ad075c2SJosh Don struct list_head throttled_csd_list; 638391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 639391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 640391e43daSPeter Zijlstra }; 641391e43daSPeter Zijlstra 642391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 643391e43daSPeter Zijlstra { 644391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 645391e43daSPeter Zijlstra } 646391e43daSPeter Zijlstra 647b6366f04SSteven Rostedt /* RT IPI pull logic requires IRQ_WORK */ 6484bdced5cSSteven Rostedt (Red Hat) #if defined(CONFIG_IRQ_WORK) && defined(CONFIG_SMP) 649b6366f04SSteven Rostedt # define HAVE_RT_PUSH_IPI 650b6366f04SSteven Rostedt #endif 651b6366f04SSteven Rostedt 652391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 653391e43daSPeter Zijlstra struct rt_rq { 654391e43daSPeter Zijlstra struct rt_prio_array active; 655c82513e5SPeter Zijlstra unsigned int rt_nr_running; 65601d36d0aSFrederic Weisbecker unsigned int rr_nr_running; 657391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 658391e43daSPeter Zijlstra struct { 659391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 660391e43daSPeter Zijlstra #ifdef CONFIG_SMP 661391e43daSPeter Zijlstra int next; /* next highest */ 662391e43daSPeter Zijlstra #endif 663391e43daSPeter Zijlstra } highest_prio; 664391e43daSPeter Zijlstra #endif 665391e43daSPeter Zijlstra #ifdef CONFIG_SMP 666391e43daSPeter Zijlstra int overloaded; 667391e43daSPeter Zijlstra struct plist_head pushable_tasks; 668371bf427SVincent Guittot 669b6366f04SSteven Rostedt #endif /* CONFIG_SMP */ 670f4ebcbc0SKirill Tkhai int rt_queued; 671f4ebcbc0SKirill Tkhai 672391e43daSPeter Zijlstra int rt_throttled; 673391e43daSPeter Zijlstra u64 rt_time; 674391e43daSPeter Zijlstra u64 rt_runtime; 675391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 676391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 677391e43daSPeter Zijlstra 678391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 679e6fe3f42SAlexey Dobriyan unsigned int rt_nr_boosted; 680391e43daSPeter Zijlstra 681391e43daSPeter Zijlstra struct rq *rq; 682391e43daSPeter Zijlstra struct task_group *tg; 683391e43daSPeter Zijlstra #endif 684391e43daSPeter Zijlstra }; 685391e43daSPeter Zijlstra 686296b2ffeSVincent Guittot static inline bool rt_rq_is_runnable(struct rt_rq *rt_rq) 687296b2ffeSVincent Guittot { 688296b2ffeSVincent Guittot return rt_rq->rt_queued && rt_rq->rt_nr_running; 689296b2ffeSVincent Guittot } 690296b2ffeSVincent Guittot 691aab03e05SDario Faggioli /* Deadline class' related fields in a runqueue */ 692aab03e05SDario Faggioli struct dl_rq { 693aab03e05SDario Faggioli /* runqueue is an rbtree, ordered by deadline */ 6942161573eSDavidlohr Bueso struct rb_root_cached root; 695aab03e05SDario Faggioli 696e6fe3f42SAlexey Dobriyan unsigned int dl_nr_running; 6971baca4ceSJuri Lelli 6981baca4ceSJuri Lelli #ifdef CONFIG_SMP 6991baca4ceSJuri Lelli /* 7001baca4ceSJuri Lelli * Deadline values of the currently executing and the 7011baca4ceSJuri Lelli * earliest ready task on this rq. Caching these facilitates 702dfcb245eSIngo Molnar * the decision whether or not a ready but not running task 7031baca4ceSJuri Lelli * should migrate somewhere else. 7041baca4ceSJuri Lelli */ 7051baca4ceSJuri Lelli struct { 7061baca4ceSJuri Lelli u64 curr; 7071baca4ceSJuri Lelli u64 next; 7081baca4ceSJuri Lelli } earliest_dl; 7091baca4ceSJuri Lelli 7101baca4ceSJuri Lelli int overloaded; 7111baca4ceSJuri Lelli 7121baca4ceSJuri Lelli /* 7131baca4ceSJuri Lelli * Tasks on this rq that can be pushed away. They are kept in 7141baca4ceSJuri Lelli * an rb-tree, ordered by tasks' deadlines, with caching 7151baca4ceSJuri Lelli * of the leftmost (earliest deadline) element. 7161baca4ceSJuri Lelli */ 7172161573eSDavidlohr Bueso struct rb_root_cached pushable_dl_tasks_root; 718332ac17eSDario Faggioli #else 719332ac17eSDario Faggioli struct dl_bw dl_bw; 7201baca4ceSJuri Lelli #endif 721e36d8677SLuca Abeni /* 722e36d8677SLuca Abeni * "Active utilization" for this runqueue: increased when a 723e36d8677SLuca Abeni * task wakes up (becomes TASK_RUNNING) and decreased when a 724e36d8677SLuca Abeni * task blocks 725e36d8677SLuca Abeni */ 726e36d8677SLuca Abeni u64 running_bw; 7274da3abceSLuca Abeni 7284da3abceSLuca Abeni /* 7298fd27231SLuca Abeni * Utilization of the tasks "assigned" to this runqueue (including 7308fd27231SLuca Abeni * the tasks that are in runqueue and the tasks that executed on this 7318fd27231SLuca Abeni * CPU and blocked). Increased when a task moves to this runqueue, and 7328fd27231SLuca Abeni * decreased when the task moves away (migrates, changes scheduling 7338fd27231SLuca Abeni * policy, or terminates). 7348fd27231SLuca Abeni * This is needed to compute the "inactive utilization" for the 7358fd27231SLuca Abeni * runqueue (inactive utilization = this_bw - running_bw). 7368fd27231SLuca Abeni */ 7378fd27231SLuca Abeni u64 this_bw; 738daec5798SLuca Abeni u64 extra_bw; 7398fd27231SLuca Abeni 7408fd27231SLuca Abeni /* 7416a9d623aSVineeth Pillai * Maximum available bandwidth for reclaiming by SCHED_FLAG_RECLAIM 7426a9d623aSVineeth Pillai * tasks of this rq. Used in calculation of reclaimable bandwidth(GRUB). 7436a9d623aSVineeth Pillai */ 7446a9d623aSVineeth Pillai u64 max_bw; 7456a9d623aSVineeth Pillai 7466a9d623aSVineeth Pillai /* 7474da3abceSLuca Abeni * Inverse of the fraction of CPU utilization that can be reclaimed 7484da3abceSLuca Abeni * by the GRUB algorithm. 7494da3abceSLuca Abeni */ 7504da3abceSLuca Abeni u64 bw_ratio; 751aab03e05SDario Faggioli }; 752aab03e05SDario Faggioli 753c0796298SVincent Guittot #ifdef CONFIG_FAIR_GROUP_SCHED 754c0796298SVincent Guittot /* An entity is a task if it doesn't "own" a runqueue */ 755c0796298SVincent Guittot #define entity_is_task(se) (!se->my_q) 7560dacee1bSVincent Guittot 7579f683953SVincent Guittot static inline void se_update_runnable(struct sched_entity *se) 7589f683953SVincent Guittot { 7599f683953SVincent Guittot if (!entity_is_task(se)) 7609f683953SVincent Guittot se->runnable_weight = se->my_q->h_nr_running; 7619f683953SVincent Guittot } 7629f683953SVincent Guittot 7639f683953SVincent Guittot static inline long se_runnable(struct sched_entity *se) 7649f683953SVincent Guittot { 7659f683953SVincent Guittot if (entity_is_task(se)) 7669f683953SVincent Guittot return !!se->on_rq; 7679f683953SVincent Guittot else 7689f683953SVincent Guittot return se->runnable_weight; 7699f683953SVincent Guittot } 7709f683953SVincent Guittot 771c0796298SVincent Guittot #else 772c0796298SVincent Guittot #define entity_is_task(se) 1 7730dacee1bSVincent Guittot 7749f683953SVincent Guittot static inline void se_update_runnable(struct sched_entity *se) {} 7759f683953SVincent Guittot 7769f683953SVincent Guittot static inline long se_runnable(struct sched_entity *se) 7779f683953SVincent Guittot { 7789f683953SVincent Guittot return !!se->on_rq; 7799f683953SVincent Guittot } 780c0796298SVincent Guittot #endif 781c0796298SVincent Guittot 782391e43daSPeter Zijlstra #ifdef CONFIG_SMP 783c0796298SVincent Guittot /* 784c0796298SVincent Guittot * XXX we want to get rid of these helpers and use the full load resolution. 785c0796298SVincent Guittot */ 786c0796298SVincent Guittot static inline long se_weight(struct sched_entity *se) 787c0796298SVincent Guittot { 788c0796298SVincent Guittot return scale_load_down(se->load.weight); 789c0796298SVincent Guittot } 790c0796298SVincent Guittot 791391e43daSPeter Zijlstra 792afe06efdSTim Chen static inline bool sched_asym_prefer(int a, int b) 793afe06efdSTim Chen { 794afe06efdSTim Chen return arch_asym_cpu_priority(a) > arch_asym_cpu_priority(b); 795afe06efdSTim Chen } 796afe06efdSTim Chen 7976aa140faSQuentin Perret struct perf_domain { 7986aa140faSQuentin Perret struct em_perf_domain *em_pd; 7996aa140faSQuentin Perret struct perf_domain *next; 8006aa140faSQuentin Perret struct rcu_head rcu; 8016aa140faSQuentin Perret }; 8026aa140faSQuentin Perret 803630246a0SQuentin Perret /* Scheduling group status flags */ 804630246a0SQuentin Perret #define SG_OVERLOAD 0x1 /* More than one runnable task on a CPU. */ 8052802bf3cSMorten Rasmussen #define SG_OVERUTILIZED 0x2 /* One or more CPUs are over-utilized. */ 806630246a0SQuentin Perret 807391e43daSPeter Zijlstra /* 808391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 809391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 81097fb7a0aSIngo Molnar * fully partitioning the member CPUs from any other cpuset. Whenever a new 811391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 812391e43daSPeter Zijlstra * object. 813391e43daSPeter Zijlstra * 814391e43daSPeter Zijlstra */ 815391e43daSPeter Zijlstra struct root_domain { 816391e43daSPeter Zijlstra atomic_t refcount; 817391e43daSPeter Zijlstra atomic_t rto_count; 818391e43daSPeter Zijlstra struct rcu_head rcu; 819391e43daSPeter Zijlstra cpumask_var_t span; 820391e43daSPeter Zijlstra cpumask_var_t online; 821391e43daSPeter Zijlstra 822757ffdd7SValentin Schneider /* 823757ffdd7SValentin Schneider * Indicate pullable load on at least one CPU, e.g: 824757ffdd7SValentin Schneider * - More than one runnable task 825757ffdd7SValentin Schneider * - Running task is misfit 826757ffdd7SValentin Schneider */ 827575638d1SValentin Schneider int overload; 8284486edd1STim Chen 8292802bf3cSMorten Rasmussen /* Indicate one or more cpus over-utilized (tipping point) */ 8302802bf3cSMorten Rasmussen int overutilized; 8312802bf3cSMorten Rasmussen 832391e43daSPeter Zijlstra /* 8331baca4ceSJuri Lelli * The bit corresponding to a CPU gets set here if such CPU has more 8341baca4ceSJuri Lelli * than one runnable -deadline task (as it is below for RT tasks). 8351baca4ceSJuri Lelli */ 8361baca4ceSJuri Lelli cpumask_var_t dlo_mask; 8371baca4ceSJuri Lelli atomic_t dlo_count; 838332ac17eSDario Faggioli struct dl_bw dl_bw; 8396bfd6d72SJuri Lelli struct cpudl cpudl; 8401baca4ceSJuri Lelli 84126762423SPeng Liu /* 84226762423SPeng Liu * Indicate whether a root_domain's dl_bw has been checked or 84326762423SPeng Liu * updated. It's monotonously increasing value. 84426762423SPeng Liu * 84526762423SPeng Liu * Also, some corner cases, like 'wrap around' is dangerous, but given 84626762423SPeng Liu * that u64 is 'big enough'. So that shouldn't be a concern. 84726762423SPeng Liu */ 84826762423SPeng Liu u64 visit_gen; 84926762423SPeng Liu 8504bdced5cSSteven Rostedt (Red Hat) #ifdef HAVE_RT_PUSH_IPI 8514bdced5cSSteven Rostedt (Red Hat) /* 8524bdced5cSSteven Rostedt (Red Hat) * For IPI pull requests, loop across the rto_mask. 8534bdced5cSSteven Rostedt (Red Hat) */ 8544bdced5cSSteven Rostedt (Red Hat) struct irq_work rto_push_work; 8554bdced5cSSteven Rostedt (Red Hat) raw_spinlock_t rto_lock; 8564bdced5cSSteven Rostedt (Red Hat) /* These are only updated and read within rto_lock */ 8574bdced5cSSteven Rostedt (Red Hat) int rto_loop; 8584bdced5cSSteven Rostedt (Red Hat) int rto_cpu; 8594bdced5cSSteven Rostedt (Red Hat) /* These atomics are updated outside of a lock */ 8604bdced5cSSteven Rostedt (Red Hat) atomic_t rto_loop_next; 8614bdced5cSSteven Rostedt (Red Hat) atomic_t rto_loop_start; 8624bdced5cSSteven Rostedt (Red Hat) #endif 8631baca4ceSJuri Lelli /* 864391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 865391e43daSPeter Zijlstra * one runnable RT task. 866391e43daSPeter Zijlstra */ 867391e43daSPeter Zijlstra cpumask_var_t rto_mask; 868391e43daSPeter Zijlstra struct cpupri cpupri; 869cd92bfd3SDietmar Eggemann 870cd92bfd3SDietmar Eggemann unsigned long max_cpu_capacity; 8716aa140faSQuentin Perret 8726aa140faSQuentin Perret /* 8736aa140faSQuentin Perret * NULL-terminated list of performance domains intersecting with the 8746aa140faSQuentin Perret * CPUs of the rd. Protected by RCU. 8756aa140faSQuentin Perret */ 8767ba7319fSJoel Fernandes (Google) struct perf_domain __rcu *pd; 877391e43daSPeter Zijlstra }; 878391e43daSPeter Zijlstra 879f2cb1360SIngo Molnar extern void init_defrootdomain(void); 8808d5dc512SPeter Zijlstra extern int sched_init_domains(const struct cpumask *cpu_map); 881f2cb1360SIngo Molnar extern void rq_attach_root(struct rq *rq, struct root_domain *rd); 882364f5665SSteven Rostedt (VMware) extern void sched_get_rd(struct root_domain *rd); 883364f5665SSteven Rostedt (VMware) extern void sched_put_rd(struct root_domain *rd); 884391e43daSPeter Zijlstra 8854bdced5cSSteven Rostedt (Red Hat) #ifdef HAVE_RT_PUSH_IPI 8864bdced5cSSteven Rostedt (Red Hat) extern void rto_push_irq_work_func(struct irq_work *work); 8874bdced5cSSteven Rostedt (Red Hat) #endif 888391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 889391e43daSPeter Zijlstra 89069842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 89169842cbaSPatrick Bellasi /* 89269842cbaSPatrick Bellasi * struct uclamp_bucket - Utilization clamp bucket 89369842cbaSPatrick Bellasi * @value: utilization clamp value for tasks on this clamp bucket 89469842cbaSPatrick Bellasi * @tasks: number of RUNNABLE tasks on this clamp bucket 89569842cbaSPatrick Bellasi * 89669842cbaSPatrick Bellasi * Keep track of how many tasks are RUNNABLE for a given utilization 89769842cbaSPatrick Bellasi * clamp value. 89869842cbaSPatrick Bellasi */ 89969842cbaSPatrick Bellasi struct uclamp_bucket { 90069842cbaSPatrick Bellasi unsigned long value : bits_per(SCHED_CAPACITY_SCALE); 90169842cbaSPatrick Bellasi unsigned long tasks : BITS_PER_LONG - bits_per(SCHED_CAPACITY_SCALE); 90269842cbaSPatrick Bellasi }; 90369842cbaSPatrick Bellasi 90469842cbaSPatrick Bellasi /* 90569842cbaSPatrick Bellasi * struct uclamp_rq - rq's utilization clamp 90669842cbaSPatrick Bellasi * @value: currently active clamp values for a rq 90769842cbaSPatrick Bellasi * @bucket: utilization clamp buckets affecting a rq 90869842cbaSPatrick Bellasi * 90969842cbaSPatrick Bellasi * Keep track of RUNNABLE tasks on a rq to aggregate their clamp values. 91069842cbaSPatrick Bellasi * A clamp value is affecting a rq when there is at least one task RUNNABLE 91169842cbaSPatrick Bellasi * (or actually running) with that value. 91269842cbaSPatrick Bellasi * 91369842cbaSPatrick Bellasi * There are up to UCLAMP_CNT possible different clamp values, currently there 91469842cbaSPatrick Bellasi * are only two: minimum utilization and maximum utilization. 91569842cbaSPatrick Bellasi * 91669842cbaSPatrick Bellasi * All utilization clamping values are MAX aggregated, since: 91769842cbaSPatrick Bellasi * - for util_min: we want to run the CPU at least at the max of the minimum 91869842cbaSPatrick Bellasi * utilization required by its currently RUNNABLE tasks. 91969842cbaSPatrick Bellasi * - for util_max: we want to allow the CPU to run up to the max of the 92069842cbaSPatrick Bellasi * maximum utilization allowed by its currently RUNNABLE tasks. 92169842cbaSPatrick Bellasi * 92269842cbaSPatrick Bellasi * Since on each system we expect only a limited number of different 92369842cbaSPatrick Bellasi * utilization clamp values (UCLAMP_BUCKETS), use a simple array to track 92469842cbaSPatrick Bellasi * the metrics required to compute all the per-rq utilization clamp values. 92569842cbaSPatrick Bellasi */ 92669842cbaSPatrick Bellasi struct uclamp_rq { 92769842cbaSPatrick Bellasi unsigned int value; 92869842cbaSPatrick Bellasi struct uclamp_bucket bucket[UCLAMP_BUCKETS]; 92969842cbaSPatrick Bellasi }; 93046609ce2SQais Yousef 93146609ce2SQais Yousef DECLARE_STATIC_KEY_FALSE(sched_uclamp_used); 93269842cbaSPatrick Bellasi #endif /* CONFIG_UCLAMP_TASK */ 93369842cbaSPatrick Bellasi 9348e5bad7dSKees Cook struct rq; 9358e5bad7dSKees Cook struct balance_callback { 9368e5bad7dSKees Cook struct balance_callback *next; 9378e5bad7dSKees Cook void (*func)(struct rq *rq); 9388e5bad7dSKees Cook }; 9398e5bad7dSKees Cook 940391e43daSPeter Zijlstra /* 941391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 942391e43daSPeter Zijlstra * 943391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 944391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 945391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 946391e43daSPeter Zijlstra */ 947391e43daSPeter Zijlstra struct rq { 948391e43daSPeter Zijlstra /* runqueue lock: */ 9495cb9eaa3SPeter Zijlstra raw_spinlock_t __lock; 950391e43daSPeter Zijlstra 951c82513e5SPeter Zijlstra unsigned int nr_running; 9520ec8aa00SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 9530ec8aa00SPeter Zijlstra unsigned int nr_numa_running; 9540ec8aa00SPeter Zijlstra unsigned int nr_preferred_running; 955a4739ecaSSrikar Dronamraju unsigned int numa_migrate_on; 9560ec8aa00SPeter Zijlstra #endif 9573451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 9589fd81dd5SFrederic Weisbecker #ifdef CONFIG_SMP 959e022e0d3SPeter Zijlstra unsigned long last_blocked_load_update_tick; 960f643ea22SVincent Guittot unsigned int has_blocked_load; 96190b5363aSPeter Zijlstra (Intel) call_single_data_t nohz_csd; 9629fd81dd5SFrederic Weisbecker #endif /* CONFIG_SMP */ 96300357f5eSPeter Zijlstra unsigned int nohz_tick_stopped; 964a22e47a4SPeter Zijlstra atomic_t nohz_flags; 9659fd81dd5SFrederic Weisbecker #endif /* CONFIG_NO_HZ_COMMON */ 966dcdedb24SFrederic Weisbecker 967126c2092SPeter Zijlstra #ifdef CONFIG_SMP 968126c2092SPeter Zijlstra unsigned int ttwu_pending; 969126c2092SPeter Zijlstra #endif 970391e43daSPeter Zijlstra u64 nr_switches; 971391e43daSPeter Zijlstra 97269842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 97369842cbaSPatrick Bellasi /* Utilization clamp values based on CPU's RUNNABLE tasks */ 97469842cbaSPatrick Bellasi struct uclamp_rq uclamp[UCLAMP_CNT] ____cacheline_aligned; 975e496187dSPatrick Bellasi unsigned int uclamp_flags; 976e496187dSPatrick Bellasi #define UCLAMP_FLAG_IDLE 0x01 97769842cbaSPatrick Bellasi #endif 97869842cbaSPatrick Bellasi 979391e43daSPeter Zijlstra struct cfs_rq cfs; 980391e43daSPeter Zijlstra struct rt_rq rt; 981aab03e05SDario Faggioli struct dl_rq dl; 982391e43daSPeter Zijlstra 983391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 98497fb7a0aSIngo Molnar /* list of leaf cfs_rq on this CPU: */ 985391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 9869c2791f9SVincent Guittot struct list_head *tmp_alone_branch; 987a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 988a35b6466SPeter Zijlstra 989391e43daSPeter Zijlstra /* 990391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 991391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 992391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 993391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 994391e43daSPeter Zijlstra */ 995e6fe3f42SAlexey Dobriyan unsigned int nr_uninterruptible; 996391e43daSPeter Zijlstra 9974104a562SMadhuparna Bhowmik struct task_struct __rcu *curr; 99897fb7a0aSIngo Molnar struct task_struct *idle; 99997fb7a0aSIngo Molnar struct task_struct *stop; 1000391e43daSPeter Zijlstra unsigned long next_balance; 1001391e43daSPeter Zijlstra struct mm_struct *prev_mm; 1002391e43daSPeter Zijlstra 1003cb42c9a3SMatt Fleming unsigned int clock_update_flags; 1004391e43daSPeter Zijlstra u64 clock; 100523127296SVincent Guittot /* Ensure that all clocks are in the same cache line */ 100623127296SVincent Guittot u64 clock_task ____cacheline_aligned; 100723127296SVincent Guittot u64 clock_pelt; 100823127296SVincent Guittot unsigned long lost_idle_time; 1009e2f3e35fSVincent Donnefort u64 clock_pelt_idle; 1010e2f3e35fSVincent Donnefort u64 clock_idle; 1011e2f3e35fSVincent Donnefort #ifndef CONFIG_64BIT 1012e2f3e35fSVincent Donnefort u64 clock_pelt_idle_copy; 1013e2f3e35fSVincent Donnefort u64 clock_idle_copy; 1014e2f3e35fSVincent Donnefort #endif 1015391e43daSPeter Zijlstra 1016391e43daSPeter Zijlstra atomic_t nr_iowait; 1017391e43daSPeter Zijlstra 1018c006fac5SPaul Turner #ifdef CONFIG_SCHED_DEBUG 1019c006fac5SPaul Turner u64 last_seen_need_resched_ns; 1020c006fac5SPaul Turner int ticks_without_resched; 1021c006fac5SPaul Turner #endif 1022c006fac5SPaul Turner 1023227a4aadSMathieu Desnoyers #ifdef CONFIG_MEMBARRIER 1024227a4aadSMathieu Desnoyers int membarrier_state; 1025227a4aadSMathieu Desnoyers #endif 1026227a4aadSMathieu Desnoyers 1027391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1028391e43daSPeter Zijlstra struct root_domain *rd; 1029994aeb7aSJoel Fernandes (Google) struct sched_domain __rcu *sd; 1030391e43daSPeter Zijlstra 1031ced549faSNicolas Pitre unsigned long cpu_capacity; 1032391e43daSPeter Zijlstra 10338e5bad7dSKees Cook struct balance_callback *balance_callback; 1034e3fca9e7SPeter Zijlstra 103519a1f5ecSPeter Zijlstra unsigned char nohz_idle_balance; 1036391e43daSPeter Zijlstra unsigned char idle_balance; 103797fb7a0aSIngo Molnar 10383b1baa64SMorten Rasmussen unsigned long misfit_task_load; 10393b1baa64SMorten Rasmussen 1040391e43daSPeter Zijlstra /* For active balancing */ 1041391e43daSPeter Zijlstra int active_balance; 1042391e43daSPeter Zijlstra int push_cpu; 1043391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 104497fb7a0aSIngo Molnar 104597fb7a0aSIngo Molnar /* CPU of this runqueue: */ 1046391e43daSPeter Zijlstra int cpu; 1047391e43daSPeter Zijlstra int online; 1048391e43daSPeter Zijlstra 1049367456c7SPeter Zijlstra struct list_head cfs_tasks; 1050367456c7SPeter Zijlstra 1051371bf427SVincent Guittot struct sched_avg avg_rt; 10523727e0e1SVincent Guittot struct sched_avg avg_dl; 105311d4afd4SVincent Guittot #ifdef CONFIG_HAVE_SCHED_AVG_IRQ 105491c27493SVincent Guittot struct sched_avg avg_irq; 105591c27493SVincent Guittot #endif 105676504793SThara Gopinath #ifdef CONFIG_SCHED_THERMAL_PRESSURE 105776504793SThara Gopinath struct sched_avg avg_thermal; 105876504793SThara Gopinath #endif 1059391e43daSPeter Zijlstra u64 idle_stamp; 1060391e43daSPeter Zijlstra u64 avg_idle; 10619bd721c5SJason Low 10629bd721c5SJason Low /* This is used to determine avg_idle's max value */ 10639bd721c5SJason Low u64 max_idle_balance_cost; 1064f2469a1fSThomas Gleixner 1065f2469a1fSThomas Gleixner #ifdef CONFIG_HOTPLUG_CPU 1066f2469a1fSThomas Gleixner struct rcuwait hotplug_wait; 1067f2469a1fSThomas Gleixner #endif 106890b5363aSPeter Zijlstra (Intel) #endif /* CONFIG_SMP */ 1069391e43daSPeter Zijlstra 1070391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 1071391e43daSPeter Zijlstra u64 prev_irq_time; 1072391e43daSPeter Zijlstra #endif 1073391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 1074391e43daSPeter Zijlstra u64 prev_steal_time; 1075391e43daSPeter Zijlstra #endif 1076391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 1077391e43daSPeter Zijlstra u64 prev_steal_time_rq; 1078391e43daSPeter Zijlstra #endif 1079391e43daSPeter Zijlstra 1080391e43daSPeter Zijlstra /* calc_load related fields */ 1081391e43daSPeter Zijlstra unsigned long calc_load_update; 1082391e43daSPeter Zijlstra long calc_load_active; 1083391e43daSPeter Zijlstra 1084391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1085391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1086966a9671SYing Huang call_single_data_t hrtick_csd; 1087391e43daSPeter Zijlstra #endif 1088391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 1089156ec6f4SJuri Lelli ktime_t hrtick_time; 1090391e43daSPeter Zijlstra #endif 1091391e43daSPeter Zijlstra 1092391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 1093391e43daSPeter Zijlstra /* latency stats */ 1094391e43daSPeter Zijlstra struct sched_info rq_sched_info; 1095391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 1096391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 1097391e43daSPeter Zijlstra 1098391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 1099391e43daSPeter Zijlstra unsigned int yld_count; 1100391e43daSPeter Zijlstra 1101391e43daSPeter Zijlstra /* schedule() stats */ 1102391e43daSPeter Zijlstra unsigned int sched_count; 1103391e43daSPeter Zijlstra unsigned int sched_goidle; 1104391e43daSPeter Zijlstra 1105391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 1106391e43daSPeter Zijlstra unsigned int ttwu_count; 1107391e43daSPeter Zijlstra unsigned int ttwu_local; 1108391e43daSPeter Zijlstra #endif 1109391e43daSPeter Zijlstra 1110442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 1111442bf3aaSDaniel Lezcano /* Must be inspected within a rcu lock section */ 1112442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state; 1113442bf3aaSDaniel Lezcano #endif 11143015ef4bSThomas Gleixner 111574d862b6SThomas Gleixner #ifdef CONFIG_SMP 11163015ef4bSThomas Gleixner unsigned int nr_pinned; 11173015ef4bSThomas Gleixner #endif 1118a7c81556SPeter Zijlstra unsigned int push_busy; 1119a7c81556SPeter Zijlstra struct cpu_stop_work push_work; 11209edeaea1SPeter Zijlstra 11219edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 11229edeaea1SPeter Zijlstra /* per rq */ 11239edeaea1SPeter Zijlstra struct rq *core; 1124539f6512SPeter Zijlstra struct task_struct *core_pick; 11259edeaea1SPeter Zijlstra unsigned int core_enabled; 1126539f6512SPeter Zijlstra unsigned int core_sched_seq; 11278a311c74SPeter Zijlstra struct rb_root core_tree; 11288a311c74SPeter Zijlstra 11293c474b32SPeter Zijlstra /* shared state -- careful with sched_core_cpu_deactivate() */ 11308a311c74SPeter Zijlstra unsigned int core_task_seq; 1131539f6512SPeter Zijlstra unsigned int core_pick_seq; 1132539f6512SPeter Zijlstra unsigned long core_cookie; 11334feee7d1SJosh Don unsigned int core_forceidle_count; 1134c6047c2eSJoel Fernandes (Google) unsigned int core_forceidle_seq; 11354feee7d1SJosh Don unsigned int core_forceidle_occupation; 11364feee7d1SJosh Don u64 core_forceidle_start; 11379edeaea1SPeter Zijlstra #endif 1138da019032SWaiman Long 1139da019032SWaiman Long /* Scratch cpumask to be temporarily used under rq_lock */ 1140da019032SWaiman Long cpumask_var_t scratch_mask; 11418ad075c2SJosh Don 11428ad075c2SJosh Don #if defined(CONFIG_CFS_BANDWIDTH) && defined(CONFIG_SMP) 11438ad075c2SJosh Don call_single_data_t cfsb_csd; 11448ad075c2SJosh Don struct list_head cfsb_csd_list; 11458ad075c2SJosh Don #endif 1146391e43daSPeter Zijlstra }; 1147391e43daSPeter Zijlstra 114862478d99SVincent Guittot #ifdef CONFIG_FAIR_GROUP_SCHED 114962478d99SVincent Guittot 115062478d99SVincent Guittot /* CPU runqueue to which this cfs_rq is attached */ 115162478d99SVincent Guittot static inline struct rq *rq_of(struct cfs_rq *cfs_rq) 115262478d99SVincent Guittot { 115362478d99SVincent Guittot return cfs_rq->rq; 115462478d99SVincent Guittot } 115562478d99SVincent Guittot 115662478d99SVincent Guittot #else 115762478d99SVincent Guittot 115862478d99SVincent Guittot static inline struct rq *rq_of(struct cfs_rq *cfs_rq) 115962478d99SVincent Guittot { 116062478d99SVincent Guittot return container_of(cfs_rq, struct rq, cfs); 116162478d99SVincent Guittot } 116262478d99SVincent Guittot #endif 116362478d99SVincent Guittot 1164391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 1165391e43daSPeter Zijlstra { 1166391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1167391e43daSPeter Zijlstra return rq->cpu; 1168391e43daSPeter Zijlstra #else 1169391e43daSPeter Zijlstra return 0; 1170391e43daSPeter Zijlstra #endif 1171391e43daSPeter Zijlstra } 1172391e43daSPeter Zijlstra 1173a7c81556SPeter Zijlstra #define MDF_PUSH 0x01 1174a7c81556SPeter Zijlstra 1175a7c81556SPeter Zijlstra static inline bool is_migration_disabled(struct task_struct *p) 1176a7c81556SPeter Zijlstra { 117774d862b6SThomas Gleixner #ifdef CONFIG_SMP 1178a7c81556SPeter Zijlstra return p->migration_disabled; 1179a7c81556SPeter Zijlstra #else 1180a7c81556SPeter Zijlstra return false; 1181a7c81556SPeter Zijlstra #endif 1182a7c81556SPeter Zijlstra } 11831b568f0aSPeter Zijlstra 1184e705968dSLin Shengwang DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); 1185e705968dSLin Shengwang 1186e705968dSLin Shengwang #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 1187e705968dSLin Shengwang #define this_rq() this_cpu_ptr(&runqueues) 1188e705968dSLin Shengwang #define task_rq(p) cpu_rq(task_cpu(p)) 1189e705968dSLin Shengwang #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 1190e705968dSLin Shengwang #define raw_rq() raw_cpu_ptr(&runqueues) 1191e705968dSLin Shengwang 119297886d9dSAubrey Li struct sched_group; 11939edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 119497886d9dSAubrey Li static inline struct cpumask *sched_group_span(struct sched_group *sg); 11959edeaea1SPeter Zijlstra 11969edeaea1SPeter Zijlstra DECLARE_STATIC_KEY_FALSE(__sched_core_enabled); 11979edeaea1SPeter Zijlstra 11989edeaea1SPeter Zijlstra static inline bool sched_core_enabled(struct rq *rq) 11999edeaea1SPeter Zijlstra { 12009edeaea1SPeter Zijlstra return static_branch_unlikely(&__sched_core_enabled) && rq->core_enabled; 12019edeaea1SPeter Zijlstra } 12029edeaea1SPeter Zijlstra 12039edeaea1SPeter Zijlstra static inline bool sched_core_disabled(void) 12049edeaea1SPeter Zijlstra { 12059edeaea1SPeter Zijlstra return !static_branch_unlikely(&__sched_core_enabled); 12069edeaea1SPeter Zijlstra } 12079edeaea1SPeter Zijlstra 12089ef7e7e3SPeter Zijlstra /* 12099ef7e7e3SPeter Zijlstra * Be careful with this function; not for general use. The return value isn't 12109ef7e7e3SPeter Zijlstra * stable unless you actually hold a relevant rq->__lock. 12119ef7e7e3SPeter Zijlstra */ 12129edeaea1SPeter Zijlstra static inline raw_spinlock_t *rq_lockp(struct rq *rq) 12139edeaea1SPeter Zijlstra { 12149edeaea1SPeter Zijlstra if (sched_core_enabled(rq)) 12159edeaea1SPeter Zijlstra return &rq->core->__lock; 12169edeaea1SPeter Zijlstra 12179edeaea1SPeter Zijlstra return &rq->__lock; 12189edeaea1SPeter Zijlstra } 12199edeaea1SPeter Zijlstra 12209ef7e7e3SPeter Zijlstra static inline raw_spinlock_t *__rq_lockp(struct rq *rq) 12219ef7e7e3SPeter Zijlstra { 12229ef7e7e3SPeter Zijlstra if (rq->core_enabled) 12239ef7e7e3SPeter Zijlstra return &rq->core->__lock; 12249ef7e7e3SPeter Zijlstra 12259ef7e7e3SPeter Zijlstra return &rq->__lock; 12269ef7e7e3SPeter Zijlstra } 12279ef7e7e3SPeter Zijlstra 1228904cbab7SMatthew Wilcox (Oracle) bool cfs_prio_less(const struct task_struct *a, const struct task_struct *b, 1229904cbab7SMatthew Wilcox (Oracle) bool fi); 123022dc02f8SPeter Zijlstra void task_vruntime_update(struct rq *rq, struct task_struct *p, bool in_fi); 1231c6047c2eSJoel Fernandes (Google) 123297886d9dSAubrey Li /* 123397886d9dSAubrey Li * Helpers to check if the CPU's core cookie matches with the task's cookie 123497886d9dSAubrey Li * when core scheduling is enabled. 123597886d9dSAubrey Li * A special case is that the task's cookie always matches with CPU's core 123697886d9dSAubrey Li * cookie if the CPU is in an idle core. 123797886d9dSAubrey Li */ 123897886d9dSAubrey Li static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p) 123997886d9dSAubrey Li { 124097886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 124197886d9dSAubrey Li if (!sched_core_enabled(rq)) 124297886d9dSAubrey Li return true; 124397886d9dSAubrey Li 124497886d9dSAubrey Li return rq->core->core_cookie == p->core_cookie; 124597886d9dSAubrey Li } 124697886d9dSAubrey Li 124797886d9dSAubrey Li static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p) 124897886d9dSAubrey Li { 124997886d9dSAubrey Li bool idle_core = true; 125097886d9dSAubrey Li int cpu; 125197886d9dSAubrey Li 125297886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 125397886d9dSAubrey Li if (!sched_core_enabled(rq)) 125497886d9dSAubrey Li return true; 125597886d9dSAubrey Li 125697886d9dSAubrey Li for_each_cpu(cpu, cpu_smt_mask(cpu_of(rq))) { 125797886d9dSAubrey Li if (!available_idle_cpu(cpu)) { 125897886d9dSAubrey Li idle_core = false; 125997886d9dSAubrey Li break; 126097886d9dSAubrey Li } 126197886d9dSAubrey Li } 126297886d9dSAubrey Li 126397886d9dSAubrey Li /* 126497886d9dSAubrey Li * A CPU in an idle core is always the best choice for tasks with 126597886d9dSAubrey Li * cookies. 126697886d9dSAubrey Li */ 126797886d9dSAubrey Li return idle_core || rq->core->core_cookie == p->core_cookie; 126897886d9dSAubrey Li } 126997886d9dSAubrey Li 127097886d9dSAubrey Li static inline bool sched_group_cookie_match(struct rq *rq, 127197886d9dSAubrey Li struct task_struct *p, 127297886d9dSAubrey Li struct sched_group *group) 127397886d9dSAubrey Li { 127497886d9dSAubrey Li int cpu; 127597886d9dSAubrey Li 127697886d9dSAubrey Li /* Ignore cookie match if core scheduler is not enabled on the CPU. */ 127797886d9dSAubrey Li if (!sched_core_enabled(rq)) 127897886d9dSAubrey Li return true; 127997886d9dSAubrey Li 128097886d9dSAubrey Li for_each_cpu_and(cpu, sched_group_span(group), p->cpus_ptr) { 1281e705968dSLin Shengwang if (sched_core_cookie_match(cpu_rq(cpu), p)) 128297886d9dSAubrey Li return true; 128397886d9dSAubrey Li } 128497886d9dSAubrey Li return false; 128597886d9dSAubrey Li } 128697886d9dSAubrey Li 12876e33cad0SPeter Zijlstra static inline bool sched_core_enqueued(struct task_struct *p) 12886e33cad0SPeter Zijlstra { 12896e33cad0SPeter Zijlstra return !RB_EMPTY_NODE(&p->core_node); 12906e33cad0SPeter Zijlstra } 12916e33cad0SPeter Zijlstra 12926e33cad0SPeter Zijlstra extern void sched_core_enqueue(struct rq *rq, struct task_struct *p); 12934feee7d1SJosh Don extern void sched_core_dequeue(struct rq *rq, struct task_struct *p, int flags); 12946e33cad0SPeter Zijlstra 12956e33cad0SPeter Zijlstra extern void sched_core_get(void); 12966e33cad0SPeter Zijlstra extern void sched_core_put(void); 12976e33cad0SPeter Zijlstra 12989edeaea1SPeter Zijlstra #else /* !CONFIG_SCHED_CORE */ 12999edeaea1SPeter Zijlstra 13009edeaea1SPeter Zijlstra static inline bool sched_core_enabled(struct rq *rq) 13019edeaea1SPeter Zijlstra { 13029edeaea1SPeter Zijlstra return false; 13039edeaea1SPeter Zijlstra } 13049edeaea1SPeter Zijlstra 1305d66f1b06SPeter Zijlstra static inline bool sched_core_disabled(void) 1306d66f1b06SPeter Zijlstra { 1307d66f1b06SPeter Zijlstra return true; 1308d66f1b06SPeter Zijlstra } 1309d66f1b06SPeter Zijlstra 131039d371b7SPeter Zijlstra static inline raw_spinlock_t *rq_lockp(struct rq *rq) 131139d371b7SPeter Zijlstra { 13125cb9eaa3SPeter Zijlstra return &rq->__lock; 131339d371b7SPeter Zijlstra } 131439d371b7SPeter Zijlstra 13159ef7e7e3SPeter Zijlstra static inline raw_spinlock_t *__rq_lockp(struct rq *rq) 13169ef7e7e3SPeter Zijlstra { 13179ef7e7e3SPeter Zijlstra return &rq->__lock; 13189ef7e7e3SPeter Zijlstra } 13199ef7e7e3SPeter Zijlstra 132097886d9dSAubrey Li static inline bool sched_cpu_cookie_match(struct rq *rq, struct task_struct *p) 132197886d9dSAubrey Li { 132297886d9dSAubrey Li return true; 132397886d9dSAubrey Li } 132497886d9dSAubrey Li 132597886d9dSAubrey Li static inline bool sched_core_cookie_match(struct rq *rq, struct task_struct *p) 132697886d9dSAubrey Li { 132797886d9dSAubrey Li return true; 132897886d9dSAubrey Li } 132997886d9dSAubrey Li 133097886d9dSAubrey Li static inline bool sched_group_cookie_match(struct rq *rq, 133197886d9dSAubrey Li struct task_struct *p, 133297886d9dSAubrey Li struct sched_group *group) 133397886d9dSAubrey Li { 133497886d9dSAubrey Li return true; 133597886d9dSAubrey Li } 13369edeaea1SPeter Zijlstra #endif /* CONFIG_SCHED_CORE */ 13379edeaea1SPeter Zijlstra 133839d371b7SPeter Zijlstra static inline void lockdep_assert_rq_held(struct rq *rq) 133939d371b7SPeter Zijlstra { 13409ef7e7e3SPeter Zijlstra lockdep_assert_held(__rq_lockp(rq)); 134139d371b7SPeter Zijlstra } 134239d371b7SPeter Zijlstra 134339d371b7SPeter Zijlstra extern void raw_spin_rq_lock_nested(struct rq *rq, int subclass); 134439d371b7SPeter Zijlstra extern bool raw_spin_rq_trylock(struct rq *rq); 134539d371b7SPeter Zijlstra extern void raw_spin_rq_unlock(struct rq *rq); 134639d371b7SPeter Zijlstra 134739d371b7SPeter Zijlstra static inline void raw_spin_rq_lock(struct rq *rq) 134839d371b7SPeter Zijlstra { 134939d371b7SPeter Zijlstra raw_spin_rq_lock_nested(rq, 0); 135039d371b7SPeter Zijlstra } 135139d371b7SPeter Zijlstra 135239d371b7SPeter Zijlstra static inline void raw_spin_rq_lock_irq(struct rq *rq) 135339d371b7SPeter Zijlstra { 135439d371b7SPeter Zijlstra local_irq_disable(); 135539d371b7SPeter Zijlstra raw_spin_rq_lock(rq); 135639d371b7SPeter Zijlstra } 135739d371b7SPeter Zijlstra 135839d371b7SPeter Zijlstra static inline void raw_spin_rq_unlock_irq(struct rq *rq) 135939d371b7SPeter Zijlstra { 136039d371b7SPeter Zijlstra raw_spin_rq_unlock(rq); 136139d371b7SPeter Zijlstra local_irq_enable(); 136239d371b7SPeter Zijlstra } 136339d371b7SPeter Zijlstra 136439d371b7SPeter Zijlstra static inline unsigned long _raw_spin_rq_lock_irqsave(struct rq *rq) 136539d371b7SPeter Zijlstra { 136639d371b7SPeter Zijlstra unsigned long flags; 136739d371b7SPeter Zijlstra local_irq_save(flags); 136839d371b7SPeter Zijlstra raw_spin_rq_lock(rq); 136939d371b7SPeter Zijlstra return flags; 137039d371b7SPeter Zijlstra } 137139d371b7SPeter Zijlstra 137239d371b7SPeter Zijlstra static inline void raw_spin_rq_unlock_irqrestore(struct rq *rq, unsigned long flags) 137339d371b7SPeter Zijlstra { 137439d371b7SPeter Zijlstra raw_spin_rq_unlock(rq); 137539d371b7SPeter Zijlstra local_irq_restore(flags); 137639d371b7SPeter Zijlstra } 137739d371b7SPeter Zijlstra 137839d371b7SPeter Zijlstra #define raw_spin_rq_lock_irqsave(rq, flags) \ 137939d371b7SPeter Zijlstra do { \ 138039d371b7SPeter Zijlstra flags = _raw_spin_rq_lock_irqsave(rq); \ 138139d371b7SPeter Zijlstra } while (0) 138239d371b7SPeter Zijlstra 13831b568f0aSPeter Zijlstra #ifdef CONFIG_SCHED_SMT 13841b568f0aSPeter Zijlstra extern void __update_idle_core(struct rq *rq); 13851b568f0aSPeter Zijlstra 13861b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) 13871b568f0aSPeter Zijlstra { 13881b568f0aSPeter Zijlstra if (static_branch_unlikely(&sched_smt_present)) 13891b568f0aSPeter Zijlstra __update_idle_core(rq); 13901b568f0aSPeter Zijlstra } 13911b568f0aSPeter Zijlstra 13921b568f0aSPeter Zijlstra #else 13931b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) { } 13941b568f0aSPeter Zijlstra #endif 13951b568f0aSPeter Zijlstra 13968a311c74SPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 13978a311c74SPeter Zijlstra static inline struct task_struct *task_of(struct sched_entity *se) 13988a311c74SPeter Zijlstra { 13998a311c74SPeter Zijlstra SCHED_WARN_ON(!entity_is_task(se)); 14008a311c74SPeter Zijlstra return container_of(se, struct task_struct, se); 14018a311c74SPeter Zijlstra } 14028a311c74SPeter Zijlstra 14038a311c74SPeter Zijlstra static inline struct cfs_rq *task_cfs_rq(struct task_struct *p) 14048a311c74SPeter Zijlstra { 14058a311c74SPeter Zijlstra return p->se.cfs_rq; 14068a311c74SPeter Zijlstra } 14078a311c74SPeter Zijlstra 14088a311c74SPeter Zijlstra /* runqueue on which this entity is (to be) queued */ 1409904cbab7SMatthew Wilcox (Oracle) static inline struct cfs_rq *cfs_rq_of(const struct sched_entity *se) 14108a311c74SPeter Zijlstra { 14118a311c74SPeter Zijlstra return se->cfs_rq; 14128a311c74SPeter Zijlstra } 14138a311c74SPeter Zijlstra 14148a311c74SPeter Zijlstra /* runqueue "owned" by this group */ 14158a311c74SPeter Zijlstra static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) 14168a311c74SPeter Zijlstra { 14178a311c74SPeter Zijlstra return grp->my_q; 14188a311c74SPeter Zijlstra } 14198a311c74SPeter Zijlstra 14208a311c74SPeter Zijlstra #else 14218a311c74SPeter Zijlstra 1422904cbab7SMatthew Wilcox (Oracle) #define task_of(_se) container_of(_se, struct task_struct, se) 14238a311c74SPeter Zijlstra 1424904cbab7SMatthew Wilcox (Oracle) static inline struct cfs_rq *task_cfs_rq(const struct task_struct *p) 14258a311c74SPeter Zijlstra { 14268a311c74SPeter Zijlstra return &task_rq(p)->cfs; 14278a311c74SPeter Zijlstra } 14288a311c74SPeter Zijlstra 1429904cbab7SMatthew Wilcox (Oracle) static inline struct cfs_rq *cfs_rq_of(const struct sched_entity *se) 14308a311c74SPeter Zijlstra { 1431904cbab7SMatthew Wilcox (Oracle) const struct task_struct *p = task_of(se); 14328a311c74SPeter Zijlstra struct rq *rq = task_rq(p); 14338a311c74SPeter Zijlstra 14348a311c74SPeter Zijlstra return &rq->cfs; 14358a311c74SPeter Zijlstra } 14368a311c74SPeter Zijlstra 14378a311c74SPeter Zijlstra /* runqueue "owned" by this group */ 14388a311c74SPeter Zijlstra static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp) 14398a311c74SPeter Zijlstra { 14408a311c74SPeter Zijlstra return NULL; 14418a311c74SPeter Zijlstra } 14428a311c74SPeter Zijlstra #endif 14438a311c74SPeter Zijlstra 14441f351d7fSJohannes Weiner extern void update_rq_clock(struct rq *rq); 14451f351d7fSJohannes Weiner 1446cb42c9a3SMatt Fleming /* 1447cb42c9a3SMatt Fleming * rq::clock_update_flags bits 1448cb42c9a3SMatt Fleming * 1449cb42c9a3SMatt Fleming * %RQCF_REQ_SKIP - will request skipping of clock update on the next 1450cb42c9a3SMatt Fleming * call to __schedule(). This is an optimisation to avoid 1451cb42c9a3SMatt Fleming * neighbouring rq clock updates. 1452cb42c9a3SMatt Fleming * 1453cb42c9a3SMatt Fleming * %RQCF_ACT_SKIP - is set from inside of __schedule() when skipping is 1454cb42c9a3SMatt Fleming * in effect and calls to update_rq_clock() are being ignored. 1455cb42c9a3SMatt Fleming * 1456cb42c9a3SMatt Fleming * %RQCF_UPDATED - is a debug flag that indicates whether a call has been 1457cb42c9a3SMatt Fleming * made to update_rq_clock() since the last time rq::lock was pinned. 1458cb42c9a3SMatt Fleming * 1459cb42c9a3SMatt Fleming * If inside of __schedule(), clock_update_flags will have been 1460cb42c9a3SMatt Fleming * shifted left (a left shift is a cheap operation for the fast path 1461cb42c9a3SMatt Fleming * to promote %RQCF_REQ_SKIP to %RQCF_ACT_SKIP), so you must use, 1462cb42c9a3SMatt Fleming * 1463cb42c9a3SMatt Fleming * if (rq-clock_update_flags >= RQCF_UPDATED) 1464cb42c9a3SMatt Fleming * 14653b03706fSIngo Molnar * to check if %RQCF_UPDATED is set. It'll never be shifted more than 1466cb42c9a3SMatt Fleming * one position though, because the next rq_unpin_lock() will shift it 1467cb42c9a3SMatt Fleming * back. 1468cb42c9a3SMatt Fleming */ 1469cb42c9a3SMatt Fleming #define RQCF_REQ_SKIP 0x01 1470cb42c9a3SMatt Fleming #define RQCF_ACT_SKIP 0x02 1471cb42c9a3SMatt Fleming #define RQCF_UPDATED 0x04 1472cb42c9a3SMatt Fleming 1473cb42c9a3SMatt Fleming static inline void assert_clock_updated(struct rq *rq) 1474cb42c9a3SMatt Fleming { 1475cb42c9a3SMatt Fleming /* 1476cb42c9a3SMatt Fleming * The only reason for not seeing a clock update since the 1477cb42c9a3SMatt Fleming * last rq_pin_lock() is if we're currently skipping updates. 1478cb42c9a3SMatt Fleming */ 1479cb42c9a3SMatt Fleming SCHED_WARN_ON(rq->clock_update_flags < RQCF_ACT_SKIP); 1480cb42c9a3SMatt Fleming } 1481cb42c9a3SMatt Fleming 148278becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 148378becc27SFrederic Weisbecker { 14845cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1485cb42c9a3SMatt Fleming assert_clock_updated(rq); 1486cb42c9a3SMatt Fleming 148778becc27SFrederic Weisbecker return rq->clock; 148878becc27SFrederic Weisbecker } 148978becc27SFrederic Weisbecker 149078becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 149178becc27SFrederic Weisbecker { 14925cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1493cb42c9a3SMatt Fleming assert_clock_updated(rq); 1494cb42c9a3SMatt Fleming 149578becc27SFrederic Weisbecker return rq->clock_task; 149678becc27SFrederic Weisbecker } 149778becc27SFrederic Weisbecker 149805289b90SThara Gopinath /** 149905289b90SThara Gopinath * By default the decay is the default pelt decay period. 150005289b90SThara Gopinath * The decay shift can change the decay period in 150105289b90SThara Gopinath * multiples of 32. 150205289b90SThara Gopinath * Decay shift Decay period(ms) 150305289b90SThara Gopinath * 0 32 150405289b90SThara Gopinath * 1 64 150505289b90SThara Gopinath * 2 128 150605289b90SThara Gopinath * 3 256 150705289b90SThara Gopinath * 4 512 150805289b90SThara Gopinath */ 150905289b90SThara Gopinath extern int sched_thermal_decay_shift; 151005289b90SThara Gopinath 151105289b90SThara Gopinath static inline u64 rq_clock_thermal(struct rq *rq) 151205289b90SThara Gopinath { 151305289b90SThara Gopinath return rq_clock_task(rq) >> sched_thermal_decay_shift; 151405289b90SThara Gopinath } 151505289b90SThara Gopinath 1516adcc8da8SDavidlohr Bueso static inline void rq_clock_skip_update(struct rq *rq) 15179edfbfedSPeter Zijlstra { 15185cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1519cb42c9a3SMatt Fleming rq->clock_update_flags |= RQCF_REQ_SKIP; 1520adcc8da8SDavidlohr Bueso } 1521adcc8da8SDavidlohr Bueso 1522adcc8da8SDavidlohr Bueso /* 1523595058b6SDavidlohr Bueso * See rt task throttling, which is the only time a skip 15243b03706fSIngo Molnar * request is canceled. 1525adcc8da8SDavidlohr Bueso */ 1526adcc8da8SDavidlohr Bueso static inline void rq_clock_cancel_skipupdate(struct rq *rq) 1527adcc8da8SDavidlohr Bueso { 15285cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1529cb42c9a3SMatt Fleming rq->clock_update_flags &= ~RQCF_REQ_SKIP; 15309edfbfedSPeter Zijlstra } 15319edfbfedSPeter Zijlstra 1532ebb83d84SHao Jia /* 1533ebb83d84SHao Jia * During cpu offlining and rq wide unthrottling, we can trigger 1534ebb83d84SHao Jia * an update_rq_clock() for several cfs and rt runqueues (Typically 1535ebb83d84SHao Jia * when using list_for_each_entry_*) 1536ebb83d84SHao Jia * rq_clock_start_loop_update() can be called after updating the clock 1537ebb83d84SHao Jia * once and before iterating over the list to prevent multiple update. 1538ebb83d84SHao Jia * After the iterative traversal, we need to call rq_clock_stop_loop_update() 1539ebb83d84SHao Jia * to clear RQCF_ACT_SKIP of rq->clock_update_flags. 1540ebb83d84SHao Jia */ 1541ebb83d84SHao Jia static inline void rq_clock_start_loop_update(struct rq *rq) 1542ebb83d84SHao Jia { 1543ebb83d84SHao Jia lockdep_assert_rq_held(rq); 1544ebb83d84SHao Jia SCHED_WARN_ON(rq->clock_update_flags & RQCF_ACT_SKIP); 1545ebb83d84SHao Jia rq->clock_update_flags |= RQCF_ACT_SKIP; 1546ebb83d84SHao Jia } 1547ebb83d84SHao Jia 1548ebb83d84SHao Jia static inline void rq_clock_stop_loop_update(struct rq *rq) 1549ebb83d84SHao Jia { 1550ebb83d84SHao Jia lockdep_assert_rq_held(rq); 1551ebb83d84SHao Jia rq->clock_update_flags &= ~RQCF_ACT_SKIP; 1552ebb83d84SHao Jia } 1553ebb83d84SHao Jia 1554d8ac8971SMatt Fleming struct rq_flags { 1555d8ac8971SMatt Fleming unsigned long flags; 1556d8ac8971SMatt Fleming struct pin_cookie cookie; 1557cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1558cb42c9a3SMatt Fleming /* 1559cb42c9a3SMatt Fleming * A copy of (rq::clock_update_flags & RQCF_UPDATED) for the 1560cb42c9a3SMatt Fleming * current pin context is stashed here in case it needs to be 1561cb42c9a3SMatt Fleming * restored in rq_repin_lock(). 1562cb42c9a3SMatt Fleming */ 1563cb42c9a3SMatt Fleming unsigned int clock_update_flags; 1564cb42c9a3SMatt Fleming #endif 1565d8ac8971SMatt Fleming }; 1566d8ac8971SMatt Fleming 15678e5bad7dSKees Cook extern struct balance_callback balance_push_callback; 1568ae792702SPeter Zijlstra 156958877d34SPeter Zijlstra /* 157058877d34SPeter Zijlstra * Lockdep annotation that avoids accidental unlocks; it's like a 157158877d34SPeter Zijlstra * sticky/continuous lockdep_assert_held(). 157258877d34SPeter Zijlstra * 157358877d34SPeter Zijlstra * This avoids code that has access to 'struct rq *rq' (basically everything in 157458877d34SPeter Zijlstra * the scheduler) from accidentally unlocking the rq if they do not also have a 157558877d34SPeter Zijlstra * copy of the (on-stack) 'struct rq_flags rf'. 157658877d34SPeter Zijlstra * 157758877d34SPeter Zijlstra * Also see Documentation/locking/lockdep-design.rst. 157858877d34SPeter Zijlstra */ 1579d8ac8971SMatt Fleming static inline void rq_pin_lock(struct rq *rq, struct rq_flags *rf) 1580d8ac8971SMatt Fleming { 15819ef7e7e3SPeter Zijlstra rf->cookie = lockdep_pin_lock(__rq_lockp(rq)); 1582cb42c9a3SMatt Fleming 1583cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1584cb42c9a3SMatt Fleming rq->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 1585cb42c9a3SMatt Fleming rf->clock_update_flags = 0; 1586565790d2SPeter Zijlstra #ifdef CONFIG_SMP 1587ae792702SPeter Zijlstra SCHED_WARN_ON(rq->balance_callback && rq->balance_callback != &balance_push_callback); 1588ae792702SPeter Zijlstra #endif 1589565790d2SPeter Zijlstra #endif 1590d8ac8971SMatt Fleming } 1591d8ac8971SMatt Fleming 1592d8ac8971SMatt Fleming static inline void rq_unpin_lock(struct rq *rq, struct rq_flags *rf) 1593d8ac8971SMatt Fleming { 1594cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1595cb42c9a3SMatt Fleming if (rq->clock_update_flags > RQCF_ACT_SKIP) 1596cb42c9a3SMatt Fleming rf->clock_update_flags = RQCF_UPDATED; 1597cb42c9a3SMatt Fleming #endif 1598cb42c9a3SMatt Fleming 15999ef7e7e3SPeter Zijlstra lockdep_unpin_lock(__rq_lockp(rq), rf->cookie); 1600d8ac8971SMatt Fleming } 1601d8ac8971SMatt Fleming 1602d8ac8971SMatt Fleming static inline void rq_repin_lock(struct rq *rq, struct rq_flags *rf) 1603d8ac8971SMatt Fleming { 16049ef7e7e3SPeter Zijlstra lockdep_repin_lock(__rq_lockp(rq), rf->cookie); 1605cb42c9a3SMatt Fleming 1606cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 1607cb42c9a3SMatt Fleming /* 1608cb42c9a3SMatt Fleming * Restore the value we stashed in @rf for this pin context. 1609cb42c9a3SMatt Fleming */ 1610cb42c9a3SMatt Fleming rq->clock_update_flags |= rf->clock_update_flags; 1611cb42c9a3SMatt Fleming #endif 1612d8ac8971SMatt Fleming } 1613d8ac8971SMatt Fleming 16141f351d7fSJohannes Weiner struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf) 16151f351d7fSJohannes Weiner __acquires(rq->lock); 16161f351d7fSJohannes Weiner 16171f351d7fSJohannes Weiner struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf) 16181f351d7fSJohannes Weiner __acquires(p->pi_lock) 16191f351d7fSJohannes Weiner __acquires(rq->lock); 16201f351d7fSJohannes Weiner 16211f351d7fSJohannes Weiner static inline void __task_rq_unlock(struct rq *rq, struct rq_flags *rf) 16221f351d7fSJohannes Weiner __releases(rq->lock) 16231f351d7fSJohannes Weiner { 16241f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16255cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 16261f351d7fSJohannes Weiner } 16271f351d7fSJohannes Weiner 16281f351d7fSJohannes Weiner static inline void 16291f351d7fSJohannes Weiner task_rq_unlock(struct rq *rq, struct task_struct *p, struct rq_flags *rf) 16301f351d7fSJohannes Weiner __releases(rq->lock) 16311f351d7fSJohannes Weiner __releases(p->pi_lock) 16321f351d7fSJohannes Weiner { 16331f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16345cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 16351f351d7fSJohannes Weiner raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags); 16361f351d7fSJohannes Weiner } 16371f351d7fSJohannes Weiner 163894b548a1SPeter Zijlstra DEFINE_LOCK_GUARD_1(task_rq_lock, struct task_struct, 163994b548a1SPeter Zijlstra _T->rq = task_rq_lock(_T->lock, &_T->rf), 164094b548a1SPeter Zijlstra task_rq_unlock(_T->rq, _T->lock, &_T->rf), 164194b548a1SPeter Zijlstra struct rq *rq; struct rq_flags rf) 164294b548a1SPeter Zijlstra 16431f351d7fSJohannes Weiner static inline void 16441f351d7fSJohannes Weiner rq_lock_irqsave(struct rq *rq, struct rq_flags *rf) 16451f351d7fSJohannes Weiner __acquires(rq->lock) 16461f351d7fSJohannes Weiner { 16475cb9eaa3SPeter Zijlstra raw_spin_rq_lock_irqsave(rq, rf->flags); 16481f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 16491f351d7fSJohannes Weiner } 16501f351d7fSJohannes Weiner 16511f351d7fSJohannes Weiner static inline void 16521f351d7fSJohannes Weiner rq_lock_irq(struct rq *rq, struct rq_flags *rf) 16531f351d7fSJohannes Weiner __acquires(rq->lock) 16541f351d7fSJohannes Weiner { 16555cb9eaa3SPeter Zijlstra raw_spin_rq_lock_irq(rq); 16561f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 16571f351d7fSJohannes Weiner } 16581f351d7fSJohannes Weiner 16591f351d7fSJohannes Weiner static inline void 16601f351d7fSJohannes Weiner rq_lock(struct rq *rq, struct rq_flags *rf) 16611f351d7fSJohannes Weiner __acquires(rq->lock) 16621f351d7fSJohannes Weiner { 16635cb9eaa3SPeter Zijlstra raw_spin_rq_lock(rq); 16641f351d7fSJohannes Weiner rq_pin_lock(rq, rf); 16651f351d7fSJohannes Weiner } 16661f351d7fSJohannes Weiner 16671f351d7fSJohannes Weiner static inline void 16681f351d7fSJohannes Weiner rq_unlock_irqrestore(struct rq *rq, struct rq_flags *rf) 16691f351d7fSJohannes Weiner __releases(rq->lock) 16701f351d7fSJohannes Weiner { 16711f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16725cb9eaa3SPeter Zijlstra raw_spin_rq_unlock_irqrestore(rq, rf->flags); 16731f351d7fSJohannes Weiner } 16741f351d7fSJohannes Weiner 16751f351d7fSJohannes Weiner static inline void 16761f351d7fSJohannes Weiner rq_unlock_irq(struct rq *rq, struct rq_flags *rf) 16771f351d7fSJohannes Weiner __releases(rq->lock) 16781f351d7fSJohannes Weiner { 16791f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16805cb9eaa3SPeter Zijlstra raw_spin_rq_unlock_irq(rq); 16811f351d7fSJohannes Weiner } 16821f351d7fSJohannes Weiner 16831f351d7fSJohannes Weiner static inline void 16841f351d7fSJohannes Weiner rq_unlock(struct rq *rq, struct rq_flags *rf) 16851f351d7fSJohannes Weiner __releases(rq->lock) 16861f351d7fSJohannes Weiner { 16871f351d7fSJohannes Weiner rq_unpin_lock(rq, rf); 16885cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq); 16891f351d7fSJohannes Weiner } 16901f351d7fSJohannes Weiner 16914eb054f9SPeter Zijlstra DEFINE_LOCK_GUARD_1(rq_lock, struct rq, 16924eb054f9SPeter Zijlstra rq_lock(_T->lock, &_T->rf), 16934eb054f9SPeter Zijlstra rq_unlock(_T->lock, &_T->rf), 16944eb054f9SPeter Zijlstra struct rq_flags rf) 16954eb054f9SPeter Zijlstra 16964eb054f9SPeter Zijlstra DEFINE_LOCK_GUARD_1(rq_lock_irq, struct rq, 16974eb054f9SPeter Zijlstra rq_lock_irq(_T->lock, &_T->rf), 16984eb054f9SPeter Zijlstra rq_unlock_irq(_T->lock, &_T->rf), 16994eb054f9SPeter Zijlstra struct rq_flags rf) 17004eb054f9SPeter Zijlstra 17014eb054f9SPeter Zijlstra DEFINE_LOCK_GUARD_1(rq_lock_irqsave, struct rq, 17024eb054f9SPeter Zijlstra rq_lock_irqsave(_T->lock, &_T->rf), 17034eb054f9SPeter Zijlstra rq_unlock_irqrestore(_T->lock, &_T->rf), 17044eb054f9SPeter Zijlstra struct rq_flags rf) 17054eb054f9SPeter Zijlstra 1706246b3b33SJohannes Weiner static inline struct rq * 1707246b3b33SJohannes Weiner this_rq_lock_irq(struct rq_flags *rf) 1708246b3b33SJohannes Weiner __acquires(rq->lock) 1709246b3b33SJohannes Weiner { 1710246b3b33SJohannes Weiner struct rq *rq; 1711246b3b33SJohannes Weiner 1712246b3b33SJohannes Weiner local_irq_disable(); 1713246b3b33SJohannes Weiner rq = this_rq(); 1714246b3b33SJohannes Weiner rq_lock(rq, rf); 1715246b3b33SJohannes Weiner return rq; 1716246b3b33SJohannes Weiner } 1717246b3b33SJohannes Weiner 17189942f79bSRik van Riel #ifdef CONFIG_NUMA 1719e3fe70b1SRik van Riel enum numa_topology_type { 1720e3fe70b1SRik van Riel NUMA_DIRECT, 1721e3fe70b1SRik van Riel NUMA_GLUELESS_MESH, 1722e3fe70b1SRik van Riel NUMA_BACKPLANE, 1723e3fe70b1SRik van Riel }; 1724e3fe70b1SRik van Riel extern enum numa_topology_type sched_numa_topology_type; 17259942f79bSRik van Riel extern int sched_max_numa_distance; 17269942f79bSRik van Riel extern bool find_numa_distance(int distance); 17270fb3978bSHuang Ying extern void sched_init_numa(int offline_node); 17280fb3978bSHuang Ying extern void sched_update_numa(int cpu, bool online); 1729f2cb1360SIngo Molnar extern void sched_domains_numa_masks_set(unsigned int cpu); 1730f2cb1360SIngo Molnar extern void sched_domains_numa_masks_clear(unsigned int cpu); 1731e0e8d491SWanpeng Li extern int sched_numa_find_closest(const struct cpumask *cpus, int cpu); 1732f2cb1360SIngo Molnar #else 17330fb3978bSHuang Ying static inline void sched_init_numa(int offline_node) { } 17340fb3978bSHuang Ying static inline void sched_update_numa(int cpu, bool online) { } 1735f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_set(unsigned int cpu) { } 1736f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_clear(unsigned int cpu) { } 1737e0e8d491SWanpeng Li static inline int sched_numa_find_closest(const struct cpumask *cpus, int cpu) 1738e0e8d491SWanpeng Li { 1739e0e8d491SWanpeng Li return nr_cpu_ids; 1740e0e8d491SWanpeng Li } 1741f2cb1360SIngo Molnar #endif 1742f2cb1360SIngo Molnar 1743f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 174444dba3d5SIulia Manda /* The regions in numa_faults array from task_struct */ 174544dba3d5SIulia Manda enum numa_faults_stats { 174644dba3d5SIulia Manda NUMA_MEM = 0, 174744dba3d5SIulia Manda NUMA_CPU, 174844dba3d5SIulia Manda NUMA_MEMBUF, 174944dba3d5SIulia Manda NUMA_CPUBUF 175044dba3d5SIulia Manda }; 17510ec8aa00SPeter Zijlstra extern void sched_setnuma(struct task_struct *p, int node); 1752e6628d5bSMel Gorman extern int migrate_task_to(struct task_struct *p, int cpu); 17530ad4e3dfSSrikar Dronamraju extern int migrate_swap(struct task_struct *p, struct task_struct *t, 17540ad4e3dfSSrikar Dronamraju int cpu, int scpu); 175513784475SMel Gorman extern void init_numa_balancing(unsigned long clone_flags, struct task_struct *p); 175613784475SMel Gorman #else 175713784475SMel Gorman static inline void 175813784475SMel Gorman init_numa_balancing(unsigned long clone_flags, struct task_struct *p) 175913784475SMel Gorman { 176013784475SMel Gorman } 1761f809ca9aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 1762f809ca9aSMel Gorman 1763518cd623SPeter Zijlstra #ifdef CONFIG_SMP 1764518cd623SPeter Zijlstra 1765e3fca9e7SPeter Zijlstra static inline void 1766e3fca9e7SPeter Zijlstra queue_balance_callback(struct rq *rq, 17678e5bad7dSKees Cook struct balance_callback *head, 1768e3fca9e7SPeter Zijlstra void (*func)(struct rq *rq)) 1769e3fca9e7SPeter Zijlstra { 17705cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 1771e3fca9e7SPeter Zijlstra 177204193d59SPeter Zijlstra /* 177304193d59SPeter Zijlstra * Don't (re)queue an already queued item; nor queue anything when 177404193d59SPeter Zijlstra * balance_push() is active, see the comment with 177504193d59SPeter Zijlstra * balance_push_callback. 177604193d59SPeter Zijlstra */ 1777ae792702SPeter Zijlstra if (unlikely(head->next || rq->balance_callback == &balance_push_callback)) 1778e3fca9e7SPeter Zijlstra return; 1779e3fca9e7SPeter Zijlstra 17808e5bad7dSKees Cook head->func = func; 1781e3fca9e7SPeter Zijlstra head->next = rq->balance_callback; 1782e3fca9e7SPeter Zijlstra rq->balance_callback = head; 1783e3fca9e7SPeter Zijlstra } 1784e3fca9e7SPeter Zijlstra 1785391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 1786391e43daSPeter Zijlstra rcu_dereference_check((p), \ 1787391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 1788391e43daSPeter Zijlstra 1789391e43daSPeter Zijlstra /* 1790391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 1791337e9b07SPaul E. McKenney * See destroy_sched_domains: call_rcu for details. 1792391e43daSPeter Zijlstra * 1793391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 1794391e43daSPeter Zijlstra * preempt-disabled sections. 1795391e43daSPeter Zijlstra */ 1796391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 1797518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 1798518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 1799391e43daSPeter Zijlstra 180040b4d3dcSRicardo Neri /* A mask of all the SD flags that have the SDF_SHARED_CHILD metaflag */ 180140b4d3dcSRicardo Neri #define SD_FLAG(name, mflags) (name * !!((mflags) & SDF_SHARED_CHILD)) | 180240b4d3dcSRicardo Neri static const unsigned int SD_SHARED_CHILD_MASK = 180340b4d3dcSRicardo Neri #include <linux/sched/sd_flags.h> 180440b4d3dcSRicardo Neri 0; 180540b4d3dcSRicardo Neri #undef SD_FLAG 180640b4d3dcSRicardo Neri 1807518cd623SPeter Zijlstra /** 1808518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 180997fb7a0aSIngo Molnar * @cpu: The CPU whose highest level of sched domain is to 1810518cd623SPeter Zijlstra * be returned. 1811518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 181297fb7a0aSIngo Molnar * for the given CPU. 1813518cd623SPeter Zijlstra * 181440b4d3dcSRicardo Neri * Returns the highest sched_domain of a CPU which contains @flag. If @flag has 181540b4d3dcSRicardo Neri * the SDF_SHARED_CHILD metaflag, all the children domains also have @flag. 1816518cd623SPeter Zijlstra */ 1817518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 1818518cd623SPeter Zijlstra { 1819518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 1820518cd623SPeter Zijlstra 1821518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 182240b4d3dcSRicardo Neri if (sd->flags & flag) { 1823518cd623SPeter Zijlstra hsd = sd; 182440b4d3dcSRicardo Neri continue; 182540b4d3dcSRicardo Neri } 182640b4d3dcSRicardo Neri 182740b4d3dcSRicardo Neri /* 182840b4d3dcSRicardo Neri * Stop the search if @flag is known to be shared at lower 182940b4d3dcSRicardo Neri * levels. It will not be found further up. 183040b4d3dcSRicardo Neri */ 183140b4d3dcSRicardo Neri if (flag & SD_SHARED_CHILD_MASK) 183240b4d3dcSRicardo Neri break; 1833518cd623SPeter Zijlstra } 1834518cd623SPeter Zijlstra 1835518cd623SPeter Zijlstra return hsd; 1836518cd623SPeter Zijlstra } 1837518cd623SPeter Zijlstra 1838fb13c7eeSMel Gorman static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) 1839fb13c7eeSMel Gorman { 1840fb13c7eeSMel Gorman struct sched_domain *sd; 1841fb13c7eeSMel Gorman 1842fb13c7eeSMel Gorman for_each_domain(cpu, sd) { 1843fb13c7eeSMel Gorman if (sd->flags & flag) 1844fb13c7eeSMel Gorman break; 1845fb13c7eeSMel Gorman } 1846fb13c7eeSMel Gorman 1847fb13c7eeSMel Gorman return sd; 1848fb13c7eeSMel Gorman } 1849fb13c7eeSMel Gorman 1850994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_llc); 18517d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 1852518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 1853b95303e0SBarry Song DECLARE_PER_CPU(int, sd_share_id); 1854994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain_shared __rcu *, sd_llc_shared); 1855994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_numa); 1856994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_packing); 1857994aeb7aSJoel Fernandes (Google) DECLARE_PER_CPU(struct sched_domain __rcu *, sd_asym_cpucapacity); 1858df054e84SMorten Rasmussen extern struct static_key_false sched_asym_cpucapacity; 18598881e163SBarry Song extern struct static_key_false sched_cluster_active; 1860518cd623SPeter Zijlstra 1861740cf8a7SDietmar Eggemann static __always_inline bool sched_asym_cpucap_active(void) 1862740cf8a7SDietmar Eggemann { 1863740cf8a7SDietmar Eggemann return static_branch_unlikely(&sched_asym_cpucapacity); 1864740cf8a7SDietmar Eggemann } 1865740cf8a7SDietmar Eggemann 186663b2ca30SNicolas Pitre struct sched_group_capacity { 18675e6521eaSLi Zefan atomic_t ref; 18685e6521eaSLi Zefan /* 1869172895e6SYuyang Du * CPU capacity of this group, SCHED_CAPACITY_SCALE being max capacity 187063b2ca30SNicolas Pitre * for a single CPU. 18715e6521eaSLi Zefan */ 1872bf475ce0SMorten Rasmussen unsigned long capacity; 1873bf475ce0SMorten Rasmussen unsigned long min_capacity; /* Min per-CPU capacity in group */ 1874e3d6d0cbSMorten Rasmussen unsigned long max_capacity; /* Max per-CPU capacity in group */ 18755e6521eaSLi Zefan unsigned long next_update; 187663b2ca30SNicolas Pitre int imbalance; /* XXX unrelated to capacity but shared group state */ 18775e6521eaSLi Zefan 1878005f874dSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 1879005f874dSPeter Zijlstra int id; 1880005f874dSPeter Zijlstra #endif 1881005f874dSPeter Zijlstra 1882eba9f082Szhuguangqing unsigned long cpumask[]; /* Balance mask */ 18835e6521eaSLi Zefan }; 18845e6521eaSLi Zefan 18855e6521eaSLi Zefan struct sched_group { 18865e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 18875e6521eaSLi Zefan atomic_t ref; 18885e6521eaSLi Zefan 18895e6521eaSLi Zefan unsigned int group_weight; 1890d24cb0d9STim C Chen unsigned int cores; 189163b2ca30SNicolas Pitre struct sched_group_capacity *sgc; 189297fb7a0aSIngo Molnar int asym_prefer_cpu; /* CPU of highest priority in group */ 189316d364baSRicardo Neri int flags; 18945e6521eaSLi Zefan 18955e6521eaSLi Zefan /* 18965e6521eaSLi Zefan * The CPUs this group covers. 18975e6521eaSLi Zefan * 18985e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 18995e6521eaSLi Zefan * by attaching extra space to the end of the structure, 19005e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 19015e6521eaSLi Zefan */ 190204f5c362SGustavo A. R. Silva unsigned long cpumask[]; 19035e6521eaSLi Zefan }; 19045e6521eaSLi Zefan 1905ae4df9d6SPeter Zijlstra static inline struct cpumask *sched_group_span(struct sched_group *sg) 19065e6521eaSLi Zefan { 19075e6521eaSLi Zefan return to_cpumask(sg->cpumask); 19085e6521eaSLi Zefan } 19095e6521eaSLi Zefan 19105e6521eaSLi Zefan /* 1911e5c14b1fSPeter Zijlstra * See build_balance_mask(). 19125e6521eaSLi Zefan */ 1913e5c14b1fSPeter Zijlstra static inline struct cpumask *group_balance_mask(struct sched_group *sg) 19145e6521eaSLi Zefan { 191563b2ca30SNicolas Pitre return to_cpumask(sg->sgc->cpumask); 19165e6521eaSLi Zefan } 19175e6521eaSLi Zefan 1918c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 1919c1174876SPeter Zijlstra 19203b87f136SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 19213b87f136SPeter Zijlstra void update_sched_domain_debugfs(void); 1922bbdacdfeSPeter Zijlstra void dirty_sched_domain_sysctl(int cpu); 19233866e845SSteven Rostedt (Red Hat) #else 19243b87f136SPeter Zijlstra static inline void update_sched_domain_debugfs(void) 19253866e845SSteven Rostedt (Red Hat) { 19263866e845SSteven Rostedt (Red Hat) } 1927bbdacdfeSPeter Zijlstra static inline void dirty_sched_domain_sysctl(int cpu) 1928bbdacdfeSPeter Zijlstra { 1929bbdacdfeSPeter Zijlstra } 19303866e845SSteven Rostedt (Red Hat) #endif 19313866e845SSteven Rostedt (Red Hat) 19328a99b683SPeter Zijlstra extern int sched_update_scaling(void); 19338f9ea86fSWaiman Long 19348f9ea86fSWaiman Long static inline const struct cpumask *task_user_cpus(struct task_struct *p) 19358f9ea86fSWaiman Long { 19368f9ea86fSWaiman Long if (!p->user_cpus_ptr) 19378f9ea86fSWaiman Long return cpu_possible_mask; /* &init_task.cpus_mask */ 19388f9ea86fSWaiman Long return p->user_cpus_ptr; 19398f9ea86fSWaiman Long } 1940d664e399SThomas Gleixner #endif /* CONFIG_SMP */ 1941391e43daSPeter Zijlstra 1942391e43daSPeter Zijlstra #include "stats.h" 1943391e43daSPeter Zijlstra 19444feee7d1SJosh Don #if defined(CONFIG_SCHED_CORE) && defined(CONFIG_SCHEDSTATS) 19454feee7d1SJosh Don 19464feee7d1SJosh Don extern void __sched_core_account_forceidle(struct rq *rq); 19474feee7d1SJosh Don 19484feee7d1SJosh Don static inline void sched_core_account_forceidle(struct rq *rq) 19494feee7d1SJosh Don { 19504feee7d1SJosh Don if (schedstat_enabled()) 19514feee7d1SJosh Don __sched_core_account_forceidle(rq); 19524feee7d1SJosh Don } 19534feee7d1SJosh Don 19544feee7d1SJosh Don extern void __sched_core_tick(struct rq *rq); 19554feee7d1SJosh Don 19564feee7d1SJosh Don static inline void sched_core_tick(struct rq *rq) 19574feee7d1SJosh Don { 19584feee7d1SJosh Don if (sched_core_enabled(rq) && schedstat_enabled()) 19594feee7d1SJosh Don __sched_core_tick(rq); 19604feee7d1SJosh Don } 19614feee7d1SJosh Don 19624feee7d1SJosh Don #else 19634feee7d1SJosh Don 19644feee7d1SJosh Don static inline void sched_core_account_forceidle(struct rq *rq) {} 19654feee7d1SJosh Don 19664feee7d1SJosh Don static inline void sched_core_tick(struct rq *rq) {} 19674feee7d1SJosh Don 19684feee7d1SJosh Don #endif /* CONFIG_SCHED_CORE && CONFIG_SCHEDSTATS */ 19694feee7d1SJosh Don 1970391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 1971391e43daSPeter Zijlstra 1972391e43daSPeter Zijlstra /* 1973391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 1974391e43daSPeter Zijlstra * 19758af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 19768af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 19778af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 19788323f26cSPeter Zijlstra * 19798323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 19808323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 19818323f26cSPeter Zijlstra * 19828323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 19838323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 1984391e43daSPeter Zijlstra */ 1985391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 1986391e43daSPeter Zijlstra { 19878323f26cSPeter Zijlstra return p->sched_task_group; 1988391e43daSPeter Zijlstra } 1989391e43daSPeter Zijlstra 1990391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 1991391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 1992391e43daSPeter Zijlstra { 1993391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 1994391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 1995391e43daSPeter Zijlstra #endif 1996391e43daSPeter Zijlstra 1997391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 1998ad936d86SByungchul Park set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]); 1999391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 2000391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 200178b6b157SChengming Zhou p->se.depth = tg->se[cpu] ? tg->se[cpu]->depth + 1 : 0; 2002391e43daSPeter Zijlstra #endif 2003391e43daSPeter Zijlstra 2004391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 2005391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 2006391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 2007391e43daSPeter Zijlstra #endif 2008391e43daSPeter Zijlstra } 2009391e43daSPeter Zijlstra 2010391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 2011391e43daSPeter Zijlstra 2012391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 2013391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 2014391e43daSPeter Zijlstra { 2015391e43daSPeter Zijlstra return NULL; 2016391e43daSPeter Zijlstra } 2017391e43daSPeter Zijlstra 2018391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 2019391e43daSPeter Zijlstra 2020391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 2021391e43daSPeter Zijlstra { 2022391e43daSPeter Zijlstra set_task_rq(p, cpu); 2023391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2024391e43daSPeter Zijlstra /* 2025391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 2026dfcb245eSIngo Molnar * successfully executed on another CPU. We must ensure that updates of 2027391e43daSPeter Zijlstra * per-task data have been completed by this moment. 2028391e43daSPeter Zijlstra */ 2029391e43daSPeter Zijlstra smp_wmb(); 2030c546951dSAndrea Parri WRITE_ONCE(task_thread_info(p)->cpu, cpu); 2031ac66f547SPeter Zijlstra p->wake_cpu = cpu; 2032391e43daSPeter Zijlstra #endif 2033391e43daSPeter Zijlstra } 2034391e43daSPeter Zijlstra 2035391e43daSPeter Zijlstra /* 2036391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 2037391e43daSPeter Zijlstra */ 2038391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 2039391e43daSPeter Zijlstra # define const_debug __read_mostly 2040391e43daSPeter Zijlstra #else 2041391e43daSPeter Zijlstra # define const_debug const 2042391e43daSPeter Zijlstra #endif 2043391e43daSPeter Zijlstra 2044391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 2045391e43daSPeter Zijlstra __SCHED_FEAT_##name , 2046391e43daSPeter Zijlstra 2047391e43daSPeter Zijlstra enum { 2048391e43daSPeter Zijlstra #include "features.h" 2049f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 2050391e43daSPeter Zijlstra }; 2051391e43daSPeter Zijlstra 2052391e43daSPeter Zijlstra #undef SCHED_FEAT 2053391e43daSPeter Zijlstra 2054a73f863aSJuri Lelli #ifdef CONFIG_SCHED_DEBUG 2055765cc3a4SPatrick Bellasi 2056765cc3a4SPatrick Bellasi /* 2057765cc3a4SPatrick Bellasi * To support run-time toggling of sched features, all the translation units 2058765cc3a4SPatrick Bellasi * (but core.c) reference the sysctl_sched_features defined in core.c. 2059765cc3a4SPatrick Bellasi */ 2060765cc3a4SPatrick Bellasi extern const_debug unsigned int sysctl_sched_features; 2061765cc3a4SPatrick Bellasi 2062a73f863aSJuri Lelli #ifdef CONFIG_JUMP_LABEL 2063f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 2064c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 2065f8b6d1ccSPeter Zijlstra { \ 20666e76ea8aSJason Baron return static_key_##enabled(key); \ 2067f8b6d1ccSPeter Zijlstra } 2068f8b6d1ccSPeter Zijlstra 2069f8b6d1ccSPeter Zijlstra #include "features.h" 2070f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 2071f8b6d1ccSPeter Zijlstra 2072c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 2073f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 2074765cc3a4SPatrick Bellasi 2075a73f863aSJuri Lelli #else /* !CONFIG_JUMP_LABEL */ 2076a73f863aSJuri Lelli 2077a73f863aSJuri Lelli #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 2078a73f863aSJuri Lelli 2079a73f863aSJuri Lelli #endif /* CONFIG_JUMP_LABEL */ 2080a73f863aSJuri Lelli 2081a73f863aSJuri Lelli #else /* !SCHED_DEBUG */ 2082765cc3a4SPatrick Bellasi 2083765cc3a4SPatrick Bellasi /* 2084765cc3a4SPatrick Bellasi * Each translation unit has its own copy of sysctl_sched_features to allow 2085765cc3a4SPatrick Bellasi * constants propagation at compile time and compiler optimization based on 2086765cc3a4SPatrick Bellasi * features default. 2087765cc3a4SPatrick Bellasi */ 2088765cc3a4SPatrick Bellasi #define SCHED_FEAT(name, enabled) \ 2089765cc3a4SPatrick Bellasi (1UL << __SCHED_FEAT_##name) * enabled | 2090765cc3a4SPatrick Bellasi static const_debug __maybe_unused unsigned int sysctl_sched_features = 2091765cc3a4SPatrick Bellasi #include "features.h" 2092765cc3a4SPatrick Bellasi 0; 2093765cc3a4SPatrick Bellasi #undef SCHED_FEAT 2094765cc3a4SPatrick Bellasi 20957e6f4c5dSPeter Zijlstra #define sched_feat(x) !!(sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 2096765cc3a4SPatrick Bellasi 2097a73f863aSJuri Lelli #endif /* SCHED_DEBUG */ 2098391e43daSPeter Zijlstra 20992a595721SSrikar Dronamraju extern struct static_key_false sched_numa_balancing; 2100cb251765SMel Gorman extern struct static_key_false sched_schedstats; 2101cbee9f88SPeter Zijlstra 2102391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 2103391e43daSPeter Zijlstra { 2104391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 2105391e43daSPeter Zijlstra } 2106391e43daSPeter Zijlstra 2107391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 2108391e43daSPeter Zijlstra { 2109391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 2110391e43daSPeter Zijlstra return RUNTIME_INF; 2111391e43daSPeter Zijlstra 2112391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 2113391e43daSPeter Zijlstra } 2114391e43daSPeter Zijlstra 2115391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 2116391e43daSPeter Zijlstra { 2117391e43daSPeter Zijlstra return rq->curr == p; 2118391e43daSPeter Zijlstra } 2119391e43daSPeter Zijlstra 21200b9d46fcSPeter Zijlstra static inline int task_on_cpu(struct rq *rq, struct task_struct *p) 2121391e43daSPeter Zijlstra { 2122391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2123391e43daSPeter Zijlstra return p->on_cpu; 2124391e43daSPeter Zijlstra #else 2125391e43daSPeter Zijlstra return task_current(rq, p); 2126391e43daSPeter Zijlstra #endif 2127391e43daSPeter Zijlstra } 2128391e43daSPeter Zijlstra 2129da0c1e65SKirill Tkhai static inline int task_on_rq_queued(struct task_struct *p) 2130da0c1e65SKirill Tkhai { 2131da0c1e65SKirill Tkhai return p->on_rq == TASK_ON_RQ_QUEUED; 2132da0c1e65SKirill Tkhai } 2133391e43daSPeter Zijlstra 2134cca26e80SKirill Tkhai static inline int task_on_rq_migrating(struct task_struct *p) 2135cca26e80SKirill Tkhai { 2136c546951dSAndrea Parri return READ_ONCE(p->on_rq) == TASK_ON_RQ_MIGRATING; 2137cca26e80SKirill Tkhai } 2138cca26e80SKirill Tkhai 213917770579SValentin Schneider /* Wake flags. The first three directly map to some SD flag value */ 214017770579SValentin Schneider #define WF_EXEC 0x02 /* Wakeup after exec; maps to SD_BALANCE_EXEC */ 214117770579SValentin Schneider #define WF_FORK 0x04 /* Wakeup after fork; maps to SD_BALANCE_FORK */ 214217770579SValentin Schneider #define WF_TTWU 0x08 /* Wakeup; maps to SD_BALANCE_WAKE */ 214317770579SValentin Schneider 214417770579SValentin Schneider #define WF_SYNC 0x10 /* Waker goes to sleep after wakeup */ 214517770579SValentin Schneider #define WF_MIGRATED 0x20 /* Internal use, task got migrated */ 2146ab83f455SPeter Oskolkov #define WF_CURRENT_CPU 0x40 /* Prefer to move the wakee to the current CPU. */ 214717770579SValentin Schneider 214817770579SValentin Schneider #ifdef CONFIG_SMP 214917770579SValentin Schneider static_assert(WF_EXEC == SD_BALANCE_EXEC); 215017770579SValentin Schneider static_assert(WF_FORK == SD_BALANCE_FORK); 215117770579SValentin Schneider static_assert(WF_TTWU == SD_BALANCE_WAKE); 215217770579SValentin Schneider #endif 2153b13095f0SLi Zefan 2154391e43daSPeter Zijlstra /* 2155391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 2156391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 2157391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 2158391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 2159391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 2160391e43daSPeter Zijlstra * slice expiry etc. 2161391e43daSPeter Zijlstra */ 2162391e43daSPeter Zijlstra 2163391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 2164391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 2165391e43daSPeter Zijlstra 2166ed82b8a1SAndi Kleen extern const int sched_prio_to_weight[40]; 2167ed82b8a1SAndi Kleen extern const u32 sched_prio_to_wmult[40]; 2168391e43daSPeter Zijlstra 2169ff77e468SPeter Zijlstra /* 2170ff77e468SPeter Zijlstra * {de,en}queue flags: 2171ff77e468SPeter Zijlstra * 2172ff77e468SPeter Zijlstra * DEQUEUE_SLEEP - task is no longer runnable 2173ff77e468SPeter Zijlstra * ENQUEUE_WAKEUP - task just became runnable 2174ff77e468SPeter Zijlstra * 2175ff77e468SPeter Zijlstra * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks 2176ff77e468SPeter Zijlstra * are in a known state which allows modification. Such pairs 2177ff77e468SPeter Zijlstra * should preserve as much state as possible. 2178ff77e468SPeter Zijlstra * 2179ff77e468SPeter Zijlstra * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location 2180ff77e468SPeter Zijlstra * in the runqueue. 2181ff77e468SPeter Zijlstra * 2182ff77e468SPeter Zijlstra * ENQUEUE_HEAD - place at front of runqueue (tail if not specified) 2183ff77e468SPeter Zijlstra * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline) 218459efa0baSPeter Zijlstra * ENQUEUE_MIGRATED - the task was migrated during wakeup 2185ff77e468SPeter Zijlstra * 2186ff77e468SPeter Zijlstra */ 2187ff77e468SPeter Zijlstra 2188ff77e468SPeter Zijlstra #define DEQUEUE_SLEEP 0x01 218997fb7a0aSIngo Molnar #define DEQUEUE_SAVE 0x02 /* Matches ENQUEUE_RESTORE */ 219097fb7a0aSIngo Molnar #define DEQUEUE_MOVE 0x04 /* Matches ENQUEUE_MOVE */ 219197fb7a0aSIngo Molnar #define DEQUEUE_NOCLOCK 0x08 /* Matches ENQUEUE_NOCLOCK */ 2192ff77e468SPeter Zijlstra 21931de64443SPeter Zijlstra #define ENQUEUE_WAKEUP 0x01 2194ff77e468SPeter Zijlstra #define ENQUEUE_RESTORE 0x02 2195ff77e468SPeter Zijlstra #define ENQUEUE_MOVE 0x04 21960a67d1eeSPeter Zijlstra #define ENQUEUE_NOCLOCK 0x08 2197ff77e468SPeter Zijlstra 21980a67d1eeSPeter Zijlstra #define ENQUEUE_HEAD 0x10 21990a67d1eeSPeter Zijlstra #define ENQUEUE_REPLENISH 0x20 2200c82ba9faSLi Zefan #ifdef CONFIG_SMP 22010a67d1eeSPeter Zijlstra #define ENQUEUE_MIGRATED 0x40 2202c82ba9faSLi Zefan #else 220359efa0baSPeter Zijlstra #define ENQUEUE_MIGRATED 0x00 2204c82ba9faSLi Zefan #endif 2205d07f09a1SPeter Zijlstra #define ENQUEUE_INITIAL 0x80 2206c82ba9faSLi Zefan 220737e117c0SPeter Zijlstra #define RETRY_TASK ((void *)-1UL) 220837e117c0SPeter Zijlstra 2209713a2e21SWaiman Long struct affinity_context { 2210713a2e21SWaiman Long const struct cpumask *new_mask; 22118f9ea86fSWaiman Long struct cpumask *user_mask; 2212713a2e21SWaiman Long unsigned int flags; 2213713a2e21SWaiman Long }; 2214713a2e21SWaiman Long 2215*5d69eca5SPeter Zijlstra extern s64 update_curr_common(struct rq *rq); 2216*5d69eca5SPeter Zijlstra 2217c82ba9faSLi Zefan struct sched_class { 2218c82ba9faSLi Zefan 221969842cbaSPatrick Bellasi #ifdef CONFIG_UCLAMP_TASK 222069842cbaSPatrick Bellasi int uclamp_enabled; 222169842cbaSPatrick Bellasi #endif 222269842cbaSPatrick Bellasi 2223c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 2224c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 2225c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 22260900acf2SDietmar Eggemann bool (*yield_to_task)(struct rq *rq, struct task_struct *p); 2227c82ba9faSLi Zefan 2228e23edc86SIngo Molnar void (*wakeup_preempt)(struct rq *rq, struct task_struct *p, int flags); 2229c82ba9faSLi Zefan 223098c2f700SPeter Zijlstra struct task_struct *(*pick_next_task)(struct rq *rq); 223198c2f700SPeter Zijlstra 22326e2df058SPeter Zijlstra void (*put_prev_task)(struct rq *rq, struct task_struct *p); 2233a0e813f2SPeter Zijlstra void (*set_next_task)(struct rq *rq, struct task_struct *p, bool first); 2234c82ba9faSLi Zefan 2235c82ba9faSLi Zefan #ifdef CONFIG_SMP 22366e2df058SPeter Zijlstra int (*balance)(struct rq *rq, struct task_struct *prev, struct rq_flags *rf); 22373aef1551SValentin Schneider int (*select_task_rq)(struct task_struct *p, int task_cpu, int flags); 223821f56ffeSPeter Zijlstra 223921f56ffeSPeter Zijlstra struct task_struct * (*pick_task)(struct rq *rq); 224021f56ffeSPeter Zijlstra 22411327237aSSrikar Dronamraju void (*migrate_task_rq)(struct task_struct *p, int new_cpu); 2242c82ba9faSLi Zefan 2243c82ba9faSLi Zefan void (*task_woken)(struct rq *this_rq, struct task_struct *task); 2244c82ba9faSLi Zefan 2245713a2e21SWaiman Long void (*set_cpus_allowed)(struct task_struct *p, struct affinity_context *ctx); 2246c82ba9faSLi Zefan 2247c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 2248c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 2249a7c81556SPeter Zijlstra 2250a7c81556SPeter Zijlstra struct rq *(*find_lock_rq)(struct task_struct *p, struct rq *rq); 2251c82ba9faSLi Zefan #endif 2252c82ba9faSLi Zefan 2253c82ba9faSLi Zefan void (*task_tick)(struct rq *rq, struct task_struct *p, int queued); 2254c82ba9faSLi Zefan void (*task_fork)(struct task_struct *p); 2255e6c390f2SDario Faggioli void (*task_dead)(struct task_struct *p); 2256c82ba9faSLi Zefan 225767dfa1b7SKirill Tkhai /* 225867dfa1b7SKirill Tkhai * The switched_from() call is allowed to drop rq->lock, therefore we 22593b03706fSIngo Molnar * cannot assume the switched_from/switched_to pair is serialized by 226067dfa1b7SKirill Tkhai * rq->lock. They are however serialized by p->pi_lock. 226167dfa1b7SKirill Tkhai */ 2262c82ba9faSLi Zefan void (*switched_from)(struct rq *this_rq, struct task_struct *task); 2263c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 2264c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 2265c82ba9faSLi Zefan int oldprio); 2266c82ba9faSLi Zefan 2267c82ba9faSLi Zefan unsigned int (*get_rr_interval)(struct rq *rq, 2268c82ba9faSLi Zefan struct task_struct *task); 2269c82ba9faSLi Zefan 22706e998916SStanislaw Gruszka void (*update_curr)(struct rq *rq); 22716e998916SStanislaw Gruszka 2272c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 227339c42611SChengming Zhou void (*task_change_group)(struct task_struct *p); 2274c82ba9faSLi Zefan #endif 2275530bfad1SHao Jia 2276530bfad1SHao Jia #ifdef CONFIG_SCHED_CORE 2277530bfad1SHao Jia int (*task_is_throttled)(struct task_struct *p, int cpu); 2278530bfad1SHao Jia #endif 227943c31ac0SPeter Zijlstra }; 2280391e43daSPeter Zijlstra 22813f1d2a31SPeter Zijlstra static inline void put_prev_task(struct rq *rq, struct task_struct *prev) 22823f1d2a31SPeter Zijlstra { 228310e7071bSPeter Zijlstra WARN_ON_ONCE(rq->curr != prev); 22846e2df058SPeter Zijlstra prev->sched_class->put_prev_task(rq, prev); 22853f1d2a31SPeter Zijlstra } 22863f1d2a31SPeter Zijlstra 228703b7fad1SPeter Zijlstra static inline void set_next_task(struct rq *rq, struct task_struct *next) 2288b2bf6c31SPeter Zijlstra { 2289a0e813f2SPeter Zijlstra next->sched_class->set_next_task(rq, next, false); 2290b2bf6c31SPeter Zijlstra } 2291b2bf6c31SPeter Zijlstra 229243c31ac0SPeter Zijlstra 229343c31ac0SPeter Zijlstra /* 229443c31ac0SPeter Zijlstra * Helper to define a sched_class instance; each one is placed in a separate 229543c31ac0SPeter Zijlstra * section which is ordered by the linker script: 229643c31ac0SPeter Zijlstra * 229743c31ac0SPeter Zijlstra * include/asm-generic/vmlinux.lds.h 229843c31ac0SPeter Zijlstra * 2299546a3feeSPeter Zijlstra * *CAREFUL* they are laid out in *REVERSE* order!!! 2300546a3feeSPeter Zijlstra * 230143c31ac0SPeter Zijlstra * Also enforce alignment on the instance, not the type, to guarantee layout. 230243c31ac0SPeter Zijlstra */ 230343c31ac0SPeter Zijlstra #define DEFINE_SCHED_CLASS(name) \ 230443c31ac0SPeter Zijlstra const struct sched_class name##_sched_class \ 230543c31ac0SPeter Zijlstra __aligned(__alignof__(struct sched_class)) \ 230643c31ac0SPeter Zijlstra __section("__" #name "_sched_class") 230743c31ac0SPeter Zijlstra 2308c3a340f7SSteven Rostedt (VMware) /* Defined in include/asm-generic/vmlinux.lds.h */ 2309546a3feeSPeter Zijlstra extern struct sched_class __sched_class_highest[]; 2310546a3feeSPeter Zijlstra extern struct sched_class __sched_class_lowest[]; 23116e2df058SPeter Zijlstra 23126e2df058SPeter Zijlstra #define for_class_range(class, _from, _to) \ 2313546a3feeSPeter Zijlstra for (class = (_from); class < (_to); class++) 23146e2df058SPeter Zijlstra 2315391e43daSPeter Zijlstra #define for_each_class(class) \ 2316546a3feeSPeter Zijlstra for_class_range(class, __sched_class_highest, __sched_class_lowest) 2317546a3feeSPeter Zijlstra 2318546a3feeSPeter Zijlstra #define sched_class_above(_a, _b) ((_a) < (_b)) 2319391e43daSPeter Zijlstra 2320391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 2321aab03e05SDario Faggioli extern const struct sched_class dl_sched_class; 2322391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 2323391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 2324391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 2325391e43daSPeter Zijlstra 23266e2df058SPeter Zijlstra static inline bool sched_stop_runnable(struct rq *rq) 23276e2df058SPeter Zijlstra { 23286e2df058SPeter Zijlstra return rq->stop && task_on_rq_queued(rq->stop); 23296e2df058SPeter Zijlstra } 23306e2df058SPeter Zijlstra 23316e2df058SPeter Zijlstra static inline bool sched_dl_runnable(struct rq *rq) 23326e2df058SPeter Zijlstra { 23336e2df058SPeter Zijlstra return rq->dl.dl_nr_running > 0; 23346e2df058SPeter Zijlstra } 23356e2df058SPeter Zijlstra 23366e2df058SPeter Zijlstra static inline bool sched_rt_runnable(struct rq *rq) 23376e2df058SPeter Zijlstra { 23386e2df058SPeter Zijlstra return rq->rt.rt_queued > 0; 23396e2df058SPeter Zijlstra } 23406e2df058SPeter Zijlstra 23416e2df058SPeter Zijlstra static inline bool sched_fair_runnable(struct rq *rq) 23426e2df058SPeter Zijlstra { 23436e2df058SPeter Zijlstra return rq->cfs.nr_running > 0; 23446e2df058SPeter Zijlstra } 2345391e43daSPeter Zijlstra 23465d7d6056SPeter Zijlstra extern struct task_struct *pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf); 234798c2f700SPeter Zijlstra extern struct task_struct *pick_next_task_idle(struct rq *rq); 23485d7d6056SPeter Zijlstra 2349af449901SPeter Zijlstra #define SCA_CHECK 0x01 2350af449901SPeter Zijlstra #define SCA_MIGRATE_DISABLE 0x02 2351af449901SPeter Zijlstra #define SCA_MIGRATE_ENABLE 0x04 235207ec77a1SWill Deacon #define SCA_USER 0x08 2353af449901SPeter Zijlstra 2354391e43daSPeter Zijlstra #ifdef CONFIG_SMP 2355391e43daSPeter Zijlstra 235663b2ca30SNicolas Pitre extern void update_group_capacity(struct sched_domain *sd, int cpu); 2357b719203bSLi Zefan 23587caff66fSDaniel Lezcano extern void trigger_load_balance(struct rq *rq); 2359391e43daSPeter Zijlstra 2360713a2e21SWaiman Long extern void set_cpus_allowed_common(struct task_struct *p, struct affinity_context *ctx); 2361c5b28038SPeter Zijlstra 2362a7c81556SPeter Zijlstra static inline struct task_struct *get_push_task(struct rq *rq) 2363a7c81556SPeter Zijlstra { 2364a7c81556SPeter Zijlstra struct task_struct *p = rq->curr; 2365a7c81556SPeter Zijlstra 23665cb9eaa3SPeter Zijlstra lockdep_assert_rq_held(rq); 2367a7c81556SPeter Zijlstra 2368a7c81556SPeter Zijlstra if (rq->push_busy) 2369a7c81556SPeter Zijlstra return NULL; 2370a7c81556SPeter Zijlstra 2371a7c81556SPeter Zijlstra if (p->nr_cpus_allowed == 1) 2372a7c81556SPeter Zijlstra return NULL; 2373a7c81556SPeter Zijlstra 2374e681dcbaSSebastian Andrzej Siewior if (p->migration_disabled) 2375e681dcbaSSebastian Andrzej Siewior return NULL; 2376e681dcbaSSebastian Andrzej Siewior 2377a7c81556SPeter Zijlstra rq->push_busy = true; 2378a7c81556SPeter Zijlstra return get_task_struct(p); 2379a7c81556SPeter Zijlstra } 2380a7c81556SPeter Zijlstra 2381a7c81556SPeter Zijlstra extern int push_cpu_stop(void *arg); 2382dc877341SPeter Zijlstra 2383391e43daSPeter Zijlstra #endif 2384391e43daSPeter Zijlstra 2385442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 2386442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 2387442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 2388442bf3aaSDaniel Lezcano { 2389442bf3aaSDaniel Lezcano rq->idle_state = idle_state; 2390442bf3aaSDaniel Lezcano } 2391442bf3aaSDaniel Lezcano 2392442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 2393442bf3aaSDaniel Lezcano { 23949148a3a1SPeter Zijlstra SCHED_WARN_ON(!rcu_read_lock_held()); 239597fb7a0aSIngo Molnar 2396442bf3aaSDaniel Lezcano return rq->idle_state; 2397442bf3aaSDaniel Lezcano } 2398442bf3aaSDaniel Lezcano #else 2399442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 2400442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 2401442bf3aaSDaniel Lezcano { 2402442bf3aaSDaniel Lezcano } 2403442bf3aaSDaniel Lezcano 2404442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 2405442bf3aaSDaniel Lezcano { 2406442bf3aaSDaniel Lezcano return NULL; 2407442bf3aaSDaniel Lezcano } 2408442bf3aaSDaniel Lezcano #endif 2409442bf3aaSDaniel Lezcano 24108663effbSSteven Rostedt (VMware) extern void schedule_idle(void); 241122dc02f8SPeter Zijlstra asmlinkage void schedule_user(void); 24128663effbSSteven Rostedt (VMware) 2413391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 2414391e43daSPeter Zijlstra extern void sched_init_granularity(void); 2415391e43daSPeter Zijlstra extern void update_max_interval(void); 24161baca4ceSJuri Lelli 24171baca4ceSJuri Lelli extern void init_sched_dl_class(void); 2418391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 2419391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 2420391e43daSPeter Zijlstra 24219059393eSVincent Guittot extern void reweight_task(struct task_struct *p, int prio); 24229059393eSVincent Guittot 24238875125eSKirill Tkhai extern void resched_curr(struct rq *rq); 2424391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 2425391e43daSPeter Zijlstra 2426391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 2427391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 2428d664e399SThomas Gleixner extern bool sched_rt_bandwidth_account(struct rt_rq *rt_rq); 2429391e43daSPeter Zijlstra 2430aab03e05SDario Faggioli extern void init_dl_task_timer(struct sched_dl_entity *dl_se); 2431209a0cbdSLuca Abeni extern void init_dl_inactive_task_timer(struct sched_dl_entity *dl_se); 2432aab03e05SDario Faggioli 2433c52f14d3SLuca Abeni #define BW_SHIFT 20 2434c52f14d3SLuca Abeni #define BW_UNIT (1 << BW_SHIFT) 24354da3abceSLuca Abeni #define RATIO_SHIFT 8 2436d505b8afSHuaixin Chang #define MAX_BW_BITS (64 - BW_SHIFT) 2437d505b8afSHuaixin Chang #define MAX_BW ((1ULL << MAX_BW_BITS) - 1) 2438332ac17eSDario Faggioli unsigned long to_ratio(u64 period, u64 runtime); 2439332ac17eSDario Faggioli 2440540247fbSYuyang Du extern void init_entity_runnable_average(struct sched_entity *se); 2441d0fe0b9cSDietmar Eggemann extern void post_init_entity_util_avg(struct task_struct *p); 2442a75cdaa9SAlex Shi 244376d92ac3SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 244476d92ac3SFrederic Weisbecker extern bool sched_can_stop_tick(struct rq *rq); 2445d84b3131SFrederic Weisbecker extern int __init sched_tick_offload_init(void); 244676d92ac3SFrederic Weisbecker 244776d92ac3SFrederic Weisbecker /* 244876d92ac3SFrederic Weisbecker * Tick may be needed by tasks in the runqueue depending on their policy and 244976d92ac3SFrederic Weisbecker * requirements. If tick is needed, lets send the target an IPI to kick it out of 245076d92ac3SFrederic Weisbecker * nohz mode if necessary. 245176d92ac3SFrederic Weisbecker */ 245276d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) 245376d92ac3SFrederic Weisbecker { 245421a6ee14SMiaohe Lin int cpu = cpu_of(rq); 245576d92ac3SFrederic Weisbecker 245676d92ac3SFrederic Weisbecker if (!tick_nohz_full_cpu(cpu)) 245776d92ac3SFrederic Weisbecker return; 245876d92ac3SFrederic Weisbecker 245976d92ac3SFrederic Weisbecker if (sched_can_stop_tick(rq)) 246076d92ac3SFrederic Weisbecker tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED); 246176d92ac3SFrederic Weisbecker else 246276d92ac3SFrederic Weisbecker tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED); 246376d92ac3SFrederic Weisbecker } 246476d92ac3SFrederic Weisbecker #else 2465d84b3131SFrederic Weisbecker static inline int sched_tick_offload_init(void) { return 0; } 246676d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) { } 246776d92ac3SFrederic Weisbecker #endif 246876d92ac3SFrederic Weisbecker 246972465447SKirill Tkhai static inline void add_nr_running(struct rq *rq, unsigned count) 2470391e43daSPeter Zijlstra { 247172465447SKirill Tkhai unsigned prev_nr = rq->nr_running; 247272465447SKirill Tkhai 247372465447SKirill Tkhai rq->nr_running = prev_nr + count; 24749d246053SPhil Auld if (trace_sched_update_nr_running_tp_enabled()) { 24759d246053SPhil Auld call_trace_sched_update_nr_running(rq, count); 24769d246053SPhil Auld } 24779f3660c2SFrederic Weisbecker 24784486edd1STim Chen #ifdef CONFIG_SMP 24793e184501SViresh Kumar if (prev_nr < 2 && rq->nr_running >= 2) { 2480e90c8fe1SValentin Schneider if (!READ_ONCE(rq->rd->overload)) 2481e90c8fe1SValentin Schneider WRITE_ONCE(rq->rd->overload, 1); 248276d92ac3SFrederic Weisbecker } 24833e184501SViresh Kumar #endif 24844486edd1STim Chen 248576d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 24864486edd1STim Chen } 2487391e43daSPeter Zijlstra 248872465447SKirill Tkhai static inline void sub_nr_running(struct rq *rq, unsigned count) 2489391e43daSPeter Zijlstra { 249072465447SKirill Tkhai rq->nr_running -= count; 24919d246053SPhil Auld if (trace_sched_update_nr_running_tp_enabled()) { 2492a1bd0685SPhil Auld call_trace_sched_update_nr_running(rq, -count); 24939d246053SPhil Auld } 24949d246053SPhil Auld 249576d92ac3SFrederic Weisbecker /* Check if we still need preemption */ 249676d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 2497391e43daSPeter Zijlstra } 2498391e43daSPeter Zijlstra 2499391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 2500391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 2501391e43daSPeter Zijlstra 2502e23edc86SIngo Molnar extern void wakeup_preempt(struct rq *rq, struct task_struct *p, int flags); 2503391e43daSPeter Zijlstra 2504c59862f8SVincent Guittot #ifdef CONFIG_PREEMPT_RT 2505c59862f8SVincent Guittot #define SCHED_NR_MIGRATE_BREAK 8 2506c59862f8SVincent Guittot #else 2507c59862f8SVincent Guittot #define SCHED_NR_MIGRATE_BREAK 32 2508c59862f8SVincent Guittot #endif 2509c59862f8SVincent Guittot 2510391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 2511391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 2512391e43daSPeter Zijlstra 2513e4ec3318SPeter Zijlstra extern unsigned int sysctl_sched_base_slice; 2514147f3efaSPeter Zijlstra 251518765447SHailong Liu #ifdef CONFIG_SCHED_DEBUG 251618765447SHailong Liu extern int sysctl_resched_latency_warn_ms; 251718765447SHailong Liu extern int sysctl_resched_latency_warn_once; 251818765447SHailong Liu 251918765447SHailong Liu extern unsigned int sysctl_sched_tunable_scaling; 252018765447SHailong Liu 252118765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_delay; 252218765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_period_min; 252318765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_period_max; 252418765447SHailong Liu extern unsigned int sysctl_numa_balancing_scan_size; 252533024536SHuang Ying extern unsigned int sysctl_numa_balancing_hot_threshold; 252618765447SHailong Liu #endif 252718765447SHailong Liu 2528391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 2529391e43daSPeter Zijlstra 2530391e43daSPeter Zijlstra /* 2531391e43daSPeter Zijlstra * Use hrtick when: 2532391e43daSPeter Zijlstra * - enabled by features 2533391e43daSPeter Zijlstra * - hrtimer is actually high res 2534391e43daSPeter Zijlstra */ 2535391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 2536391e43daSPeter Zijlstra { 2537391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 2538391e43daSPeter Zijlstra return 0; 2539391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 2540391e43daSPeter Zijlstra } 2541391e43daSPeter Zijlstra 2542e0ee463cSJuri Lelli static inline int hrtick_enabled_fair(struct rq *rq) 2543e0ee463cSJuri Lelli { 2544e0ee463cSJuri Lelli if (!sched_feat(HRTICK)) 2545e0ee463cSJuri Lelli return 0; 2546e0ee463cSJuri Lelli return hrtick_enabled(rq); 2547e0ee463cSJuri Lelli } 2548e0ee463cSJuri Lelli 2549e0ee463cSJuri Lelli static inline int hrtick_enabled_dl(struct rq *rq) 2550e0ee463cSJuri Lelli { 2551e0ee463cSJuri Lelli if (!sched_feat(HRTICK_DL)) 2552e0ee463cSJuri Lelli return 0; 2553e0ee463cSJuri Lelli return hrtick_enabled(rq); 2554e0ee463cSJuri Lelli } 2555e0ee463cSJuri Lelli 2556391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 2557391e43daSPeter Zijlstra 2558b39e66eaSMike Galbraith #else 2559b39e66eaSMike Galbraith 2560e0ee463cSJuri Lelli static inline int hrtick_enabled_fair(struct rq *rq) 2561e0ee463cSJuri Lelli { 2562e0ee463cSJuri Lelli return 0; 2563e0ee463cSJuri Lelli } 2564e0ee463cSJuri Lelli 2565e0ee463cSJuri Lelli static inline int hrtick_enabled_dl(struct rq *rq) 2566e0ee463cSJuri Lelli { 2567e0ee463cSJuri Lelli return 0; 2568e0ee463cSJuri Lelli } 2569e0ee463cSJuri Lelli 2570b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 2571b39e66eaSMike Galbraith { 2572b39e66eaSMike Galbraith return 0; 2573b39e66eaSMike Galbraith } 2574b39e66eaSMike Galbraith 2575391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 2576391e43daSPeter Zijlstra 25771567c3e3SGiovanni Gherdovich #ifndef arch_scale_freq_tick 25781567c3e3SGiovanni Gherdovich static __always_inline 25791567c3e3SGiovanni Gherdovich void arch_scale_freq_tick(void) 25801567c3e3SGiovanni Gherdovich { 25811567c3e3SGiovanni Gherdovich } 25821567c3e3SGiovanni Gherdovich #endif 25831567c3e3SGiovanni Gherdovich 2584dfbca41fSPeter Zijlstra #ifndef arch_scale_freq_capacity 2585f4470cdfSValentin Schneider /** 2586f4470cdfSValentin Schneider * arch_scale_freq_capacity - get the frequency scale factor of a given CPU. 2587f4470cdfSValentin Schneider * @cpu: the CPU in question. 2588f4470cdfSValentin Schneider * 2589f4470cdfSValentin Schneider * Return: the frequency scale factor normalized against SCHED_CAPACITY_SCALE, i.e. 2590f4470cdfSValentin Schneider * 2591f4470cdfSValentin Schneider * f_curr 2592f4470cdfSValentin Schneider * ------ * SCHED_CAPACITY_SCALE 2593f4470cdfSValentin Schneider * f_max 2594f4470cdfSValentin Schneider */ 2595dfbca41fSPeter Zijlstra static __always_inline 25967673c8a4SJuri Lelli unsigned long arch_scale_freq_capacity(int cpu) 2597dfbca41fSPeter Zijlstra { 2598dfbca41fSPeter Zijlstra return SCHED_CAPACITY_SCALE; 2599dfbca41fSPeter Zijlstra } 2600dfbca41fSPeter Zijlstra #endif 2601b5b4860dSVincent Guittot 26022679a837SHao Jia #ifdef CONFIG_SCHED_DEBUG 26032679a837SHao Jia /* 26042679a837SHao Jia * In double_lock_balance()/double_rq_lock(), we use raw_spin_rq_lock() to 26052679a837SHao Jia * acquire rq lock instead of rq_lock(). So at the end of these two functions 26062679a837SHao Jia * we need to call double_rq_clock_clear_update() to clear RQCF_UPDATED of 26072679a837SHao Jia * rq->clock_update_flags to avoid the WARN_DOUBLE_CLOCK warning. 26082679a837SHao Jia */ 26092679a837SHao Jia static inline void double_rq_clock_clear_update(struct rq *rq1, struct rq *rq2) 26102679a837SHao Jia { 26112679a837SHao Jia rq1->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 26122679a837SHao Jia /* rq1 == rq2 for !CONFIG_SMP, so just clear RQCF_UPDATED once. */ 26132679a837SHao Jia #ifdef CONFIG_SMP 26142679a837SHao Jia rq2->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 26152679a837SHao Jia #endif 26162679a837SHao Jia } 26172679a837SHao Jia #else 26182679a837SHao Jia static inline void double_rq_clock_clear_update(struct rq *rq1, struct rq *rq2) {} 26192679a837SHao Jia #endif 2620391e43daSPeter Zijlstra 26215bb76f1dSPeter Zijlstra #define DEFINE_LOCK_GUARD_2(name, type, _lock, _unlock, ...) \ 26225bb76f1dSPeter Zijlstra __DEFINE_UNLOCK_GUARD(name, type, _unlock, type *lock2; __VA_ARGS__) \ 26235bb76f1dSPeter Zijlstra static inline class_##name##_t class_##name##_constructor(type *lock, type *lock2) \ 26245bb76f1dSPeter Zijlstra { class_##name##_t _t = { .lock = lock, .lock2 = lock2 }, *_T = &_t; \ 26255bb76f1dSPeter Zijlstra _lock; return _t; } 26265bb76f1dSPeter Zijlstra 2627d66f1b06SPeter Zijlstra #ifdef CONFIG_SMP 2628d66f1b06SPeter Zijlstra 2629d66f1b06SPeter Zijlstra static inline bool rq_order_less(struct rq *rq1, struct rq *rq2) 2630d66f1b06SPeter Zijlstra { 26319edeaea1SPeter Zijlstra #ifdef CONFIG_SCHED_CORE 26329edeaea1SPeter Zijlstra /* 26339edeaea1SPeter Zijlstra * In order to not have {0,2},{1,3} turn into into an AB-BA, 26349edeaea1SPeter Zijlstra * order by core-id first and cpu-id second. 26359edeaea1SPeter Zijlstra * 26369edeaea1SPeter Zijlstra * Notably: 26379edeaea1SPeter Zijlstra * 26389edeaea1SPeter Zijlstra * double_rq_lock(0,3); will take core-0, core-1 lock 26399edeaea1SPeter Zijlstra * double_rq_lock(1,2); will take core-1, core-0 lock 26409edeaea1SPeter Zijlstra * 26419edeaea1SPeter Zijlstra * when only cpu-id is considered. 26429edeaea1SPeter Zijlstra */ 26439edeaea1SPeter Zijlstra if (rq1->core->cpu < rq2->core->cpu) 26449edeaea1SPeter Zijlstra return true; 26459edeaea1SPeter Zijlstra if (rq1->core->cpu > rq2->core->cpu) 26469edeaea1SPeter Zijlstra return false; 26479edeaea1SPeter Zijlstra 26489edeaea1SPeter Zijlstra /* 26499edeaea1SPeter Zijlstra * __sched_core_flip() relies on SMT having cpu-id lock order. 26509edeaea1SPeter Zijlstra */ 26519edeaea1SPeter Zijlstra #endif 2652d66f1b06SPeter Zijlstra return rq1->cpu < rq2->cpu; 2653d66f1b06SPeter Zijlstra } 2654d66f1b06SPeter Zijlstra 2655d66f1b06SPeter Zijlstra extern void double_rq_lock(struct rq *rq1, struct rq *rq2); 2656d66f1b06SPeter Zijlstra 2657d66f1b06SPeter Zijlstra #ifdef CONFIG_PREEMPTION 2658391e43daSPeter Zijlstra 2659391e43daSPeter Zijlstra /* 2660391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 2661391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 2662391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 2663391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 2664391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 2665391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 2666391e43daSPeter Zijlstra */ 2667391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 2668391e43daSPeter Zijlstra __releases(this_rq->lock) 2669391e43daSPeter Zijlstra __acquires(busiest->lock) 2670391e43daSPeter Zijlstra __acquires(this_rq->lock) 2671391e43daSPeter Zijlstra { 26725cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(this_rq); 2673391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 2674391e43daSPeter Zijlstra 2675391e43daSPeter Zijlstra return 1; 2676391e43daSPeter Zijlstra } 2677391e43daSPeter Zijlstra 2678391e43daSPeter Zijlstra #else 2679391e43daSPeter Zijlstra /* 2680391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 2681391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 268297fb7a0aSIngo Molnar * already in proper order on entry. This favors lower CPU-ids and will 268397fb7a0aSIngo Molnar * grant the double lock to lower CPUs over higher ids under contention, 2684391e43daSPeter Zijlstra * regardless of entry order into the function. 2685391e43daSPeter Zijlstra */ 2686391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 2687391e43daSPeter Zijlstra __releases(this_rq->lock) 2688391e43daSPeter Zijlstra __acquires(busiest->lock) 2689391e43daSPeter Zijlstra __acquires(this_rq->lock) 2690391e43daSPeter Zijlstra { 26912679a837SHao Jia if (__rq_lockp(this_rq) == __rq_lockp(busiest) || 26922679a837SHao Jia likely(raw_spin_rq_trylock(busiest))) { 26932679a837SHao Jia double_rq_clock_clear_update(this_rq, busiest); 26945cb9eaa3SPeter Zijlstra return 0; 26952679a837SHao Jia } 26965cb9eaa3SPeter Zijlstra 2697d66f1b06SPeter Zijlstra if (rq_order_less(this_rq, busiest)) { 26985cb9eaa3SPeter Zijlstra raw_spin_rq_lock_nested(busiest, SINGLE_DEPTH_NESTING); 26992679a837SHao Jia double_rq_clock_clear_update(this_rq, busiest); 27005cb9eaa3SPeter Zijlstra return 0; 2701391e43daSPeter Zijlstra } 27025cb9eaa3SPeter Zijlstra 27035cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(this_rq); 2704d66f1b06SPeter Zijlstra double_rq_lock(this_rq, busiest); 27055cb9eaa3SPeter Zijlstra 27065cb9eaa3SPeter Zijlstra return 1; 2707391e43daSPeter Zijlstra } 2708391e43daSPeter Zijlstra 2709c1a280b6SThomas Gleixner #endif /* CONFIG_PREEMPTION */ 2710391e43daSPeter Zijlstra 2711391e43daSPeter Zijlstra /* 2712391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 2713391e43daSPeter Zijlstra */ 2714391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 2715391e43daSPeter Zijlstra { 27165cb9eaa3SPeter Zijlstra lockdep_assert_irqs_disabled(); 2717391e43daSPeter Zijlstra 2718391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 2719391e43daSPeter Zijlstra } 2720391e43daSPeter Zijlstra 2721391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 2722391e43daSPeter Zijlstra __releases(busiest->lock) 2723391e43daSPeter Zijlstra { 27249ef7e7e3SPeter Zijlstra if (__rq_lockp(this_rq) != __rq_lockp(busiest)) 27255cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(busiest); 27269ef7e7e3SPeter Zijlstra lock_set_subclass(&__rq_lockp(this_rq)->dep_map, 0, _RET_IP_); 2727391e43daSPeter Zijlstra } 2728391e43daSPeter Zijlstra 272974602315SPeter Zijlstra static inline void double_lock(spinlock_t *l1, spinlock_t *l2) 273074602315SPeter Zijlstra { 273174602315SPeter Zijlstra if (l1 > l2) 273274602315SPeter Zijlstra swap(l1, l2); 273374602315SPeter Zijlstra 273474602315SPeter Zijlstra spin_lock(l1); 273574602315SPeter Zijlstra spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 273674602315SPeter Zijlstra } 273774602315SPeter Zijlstra 273860e69eedSMike Galbraith static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2) 273960e69eedSMike Galbraith { 274060e69eedSMike Galbraith if (l1 > l2) 274160e69eedSMike Galbraith swap(l1, l2); 274260e69eedSMike Galbraith 274360e69eedSMike Galbraith spin_lock_irq(l1); 274460e69eedSMike Galbraith spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 274560e69eedSMike Galbraith } 274660e69eedSMike Galbraith 274774602315SPeter Zijlstra static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) 274874602315SPeter Zijlstra { 274974602315SPeter Zijlstra if (l1 > l2) 275074602315SPeter Zijlstra swap(l1, l2); 275174602315SPeter Zijlstra 275274602315SPeter Zijlstra raw_spin_lock(l1); 275374602315SPeter Zijlstra raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 275474602315SPeter Zijlstra } 275574602315SPeter Zijlstra 27565bb76f1dSPeter Zijlstra static inline void double_raw_unlock(raw_spinlock_t *l1, raw_spinlock_t *l2) 27575bb76f1dSPeter Zijlstra { 27585bb76f1dSPeter Zijlstra raw_spin_unlock(l1); 27595bb76f1dSPeter Zijlstra raw_spin_unlock(l2); 27605bb76f1dSPeter Zijlstra } 27615bb76f1dSPeter Zijlstra 27625bb76f1dSPeter Zijlstra DEFINE_LOCK_GUARD_2(double_raw_spinlock, raw_spinlock_t, 27635bb76f1dSPeter Zijlstra double_raw_lock(_T->lock, _T->lock2), 27645bb76f1dSPeter Zijlstra double_raw_unlock(_T->lock, _T->lock2)) 27655bb76f1dSPeter Zijlstra 2766391e43daSPeter Zijlstra /* 2767391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 2768391e43daSPeter Zijlstra * 2769391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 2770391e43daSPeter Zijlstra * you need to do so manually after calling. 2771391e43daSPeter Zijlstra */ 2772391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 2773391e43daSPeter Zijlstra __releases(rq1->lock) 2774391e43daSPeter Zijlstra __releases(rq2->lock) 2775391e43daSPeter Zijlstra { 27769ef7e7e3SPeter Zijlstra if (__rq_lockp(rq1) != __rq_lockp(rq2)) 27775cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq2); 2778391e43daSPeter Zijlstra else 2779391e43daSPeter Zijlstra __release(rq2->lock); 2780d66f1b06SPeter Zijlstra raw_spin_rq_unlock(rq1); 2781391e43daSPeter Zijlstra } 2782391e43daSPeter Zijlstra 2783f2cb1360SIngo Molnar extern void set_rq_online (struct rq *rq); 2784f2cb1360SIngo Molnar extern void set_rq_offline(struct rq *rq); 2785f2cb1360SIngo Molnar extern bool sched_smp_initialized; 2786f2cb1360SIngo Molnar 2787391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 2788391e43daSPeter Zijlstra 2789391e43daSPeter Zijlstra /* 2790391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 2791391e43daSPeter Zijlstra * 2792391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 2793391e43daSPeter Zijlstra * you need to do so manually before calling. 2794391e43daSPeter Zijlstra */ 2795391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 2796391e43daSPeter Zijlstra __acquires(rq1->lock) 2797391e43daSPeter Zijlstra __acquires(rq2->lock) 2798391e43daSPeter Zijlstra { 279909348d75SIngo Molnar WARN_ON_ONCE(!irqs_disabled()); 280009348d75SIngo Molnar WARN_ON_ONCE(rq1 != rq2); 28015cb9eaa3SPeter Zijlstra raw_spin_rq_lock(rq1); 2802391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 28032679a837SHao Jia double_rq_clock_clear_update(rq1, rq2); 2804391e43daSPeter Zijlstra } 2805391e43daSPeter Zijlstra 2806391e43daSPeter Zijlstra /* 2807391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 2808391e43daSPeter Zijlstra * 2809391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 2810391e43daSPeter Zijlstra * you need to do so manually after calling. 2811391e43daSPeter Zijlstra */ 2812391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 2813391e43daSPeter Zijlstra __releases(rq1->lock) 2814391e43daSPeter Zijlstra __releases(rq2->lock) 2815391e43daSPeter Zijlstra { 281609348d75SIngo Molnar WARN_ON_ONCE(rq1 != rq2); 28175cb9eaa3SPeter Zijlstra raw_spin_rq_unlock(rq1); 2818391e43daSPeter Zijlstra __release(rq2->lock); 2819391e43daSPeter Zijlstra } 2820391e43daSPeter Zijlstra 2821391e43daSPeter Zijlstra #endif 2822391e43daSPeter Zijlstra 28235bb76f1dSPeter Zijlstra DEFINE_LOCK_GUARD_2(double_rq_lock, struct rq, 28245bb76f1dSPeter Zijlstra double_rq_lock(_T->lock, _T->lock2), 28255bb76f1dSPeter Zijlstra double_rq_unlock(_T->lock, _T->lock2)) 28265bb76f1dSPeter Zijlstra 28272227a957SAbel Wu extern struct sched_entity *__pick_root_entity(struct cfs_rq *cfs_rq); 2828391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 2829391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 28306b55c965SSrikar Dronamraju 28316b55c965SSrikar Dronamraju #ifdef CONFIG_SCHED_DEBUG 28329406415fSPeter Zijlstra extern bool sched_debug_verbose; 28339469eb01SPeter Zijlstra 2834391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 2835391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 2836acb32132SWanpeng Li extern void print_dl_stats(struct seq_file *m, int cpu); 2837f6a34630SMathieu Malaterre extern void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq); 2838f6a34630SMathieu Malaterre extern void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq); 2839f6a34630SMathieu Malaterre extern void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq); 2840c006fac5SPaul Turner 2841c006fac5SPaul Turner extern void resched_latency_warn(int cpu, u64 latency); 2842397f2378SSrikar Dronamraju #ifdef CONFIG_NUMA_BALANCING 2843397f2378SSrikar Dronamraju extern void 2844397f2378SSrikar Dronamraju show_numa_stats(struct task_struct *p, struct seq_file *m); 2845397f2378SSrikar Dronamraju extern void 2846397f2378SSrikar Dronamraju print_numa_stats(struct seq_file *m, int node, unsigned long tsf, 2847397f2378SSrikar Dronamraju unsigned long tpf, unsigned long gsf, unsigned long gpf); 2848397f2378SSrikar Dronamraju #endif /* CONFIG_NUMA_BALANCING */ 2849c006fac5SPaul Turner #else 2850c006fac5SPaul Turner static inline void resched_latency_warn(int cpu, u64 latency) {} 2851397f2378SSrikar Dronamraju #endif /* CONFIG_SCHED_DEBUG */ 2852391e43daSPeter Zijlstra 2853391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 285407c54f7aSAbel Vesa extern void init_rt_rq(struct rt_rq *rt_rq); 285507c54f7aSAbel Vesa extern void init_dl_rq(struct dl_rq *dl_rq); 2856391e43daSPeter Zijlstra 28571ee14e6cSBen Segall extern void cfs_bandwidth_usage_inc(void); 28581ee14e6cSBen Segall extern void cfs_bandwidth_usage_dec(void); 28591c792db7SSuresh Siddha 28603451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 286100357f5eSPeter Zijlstra #define NOHZ_BALANCE_KICK_BIT 0 286200357f5eSPeter Zijlstra #define NOHZ_STATS_KICK_BIT 1 2863c6f88654SVincent Guittot #define NOHZ_NEWILB_KICK_BIT 2 2864efd984c4SValentin Schneider #define NOHZ_NEXT_KICK_BIT 3 2865a22e47a4SPeter Zijlstra 2866efd984c4SValentin Schneider /* Run rebalance_domains() */ 2867a22e47a4SPeter Zijlstra #define NOHZ_BALANCE_KICK BIT(NOHZ_BALANCE_KICK_BIT) 2868efd984c4SValentin Schneider /* Update blocked load */ 2869b7031a02SPeter Zijlstra #define NOHZ_STATS_KICK BIT(NOHZ_STATS_KICK_BIT) 2870efd984c4SValentin Schneider /* Update blocked load when entering idle */ 2871c6f88654SVincent Guittot #define NOHZ_NEWILB_KICK BIT(NOHZ_NEWILB_KICK_BIT) 2872efd984c4SValentin Schneider /* Update nohz.next_balance */ 2873efd984c4SValentin Schneider #define NOHZ_NEXT_KICK BIT(NOHZ_NEXT_KICK_BIT) 2874b7031a02SPeter Zijlstra 2875efd984c4SValentin Schneider #define NOHZ_KICK_MASK (NOHZ_BALANCE_KICK | NOHZ_STATS_KICK | NOHZ_NEXT_KICK) 28761c792db7SSuresh Siddha 28771c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 287820a5c8ccSThomas Gleixner 287900357f5eSPeter Zijlstra extern void nohz_balance_exit_idle(struct rq *rq); 288020a5c8ccSThomas Gleixner #else 288100357f5eSPeter Zijlstra static inline void nohz_balance_exit_idle(struct rq *rq) { } 28821c792db7SSuresh Siddha #endif 288373fbec60SFrederic Weisbecker 2884c6f88654SVincent Guittot #if defined(CONFIG_SMP) && defined(CONFIG_NO_HZ_COMMON) 2885c6f88654SVincent Guittot extern void nohz_run_idle_balance(int cpu); 2886c6f88654SVincent Guittot #else 2887c6f88654SVincent Guittot static inline void nohz_run_idle_balance(int cpu) { } 2888c6f88654SVincent Guittot #endif 2889daec5798SLuca Abeni 289073fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 289119d23dbfSFrederic Weisbecker struct irqtime { 289225e2d8c1SFrederic Weisbecker u64 total; 2893a499a5a1SFrederic Weisbecker u64 tick_delta; 289419d23dbfSFrederic Weisbecker u64 irq_start_time; 289519d23dbfSFrederic Weisbecker struct u64_stats_sync sync; 289619d23dbfSFrederic Weisbecker }; 289773fbec60SFrederic Weisbecker 289819d23dbfSFrederic Weisbecker DECLARE_PER_CPU(struct irqtime, cpu_irqtime); 289973fbec60SFrederic Weisbecker 290025e2d8c1SFrederic Weisbecker /* 290125e2d8c1SFrederic Weisbecker * Returns the irqtime minus the softirq time computed by ksoftirqd. 29023b03706fSIngo Molnar * Otherwise ksoftirqd's sum_exec_runtime is subtracted its own runtime 290325e2d8c1SFrederic Weisbecker * and never move forward. 290425e2d8c1SFrederic Weisbecker */ 290573fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 290673fbec60SFrederic Weisbecker { 290719d23dbfSFrederic Weisbecker struct irqtime *irqtime = &per_cpu(cpu_irqtime, cpu); 290819d23dbfSFrederic Weisbecker unsigned int seq; 290919d23dbfSFrederic Weisbecker u64 total; 291073fbec60SFrederic Weisbecker 291173fbec60SFrederic Weisbecker do { 291219d23dbfSFrederic Weisbecker seq = __u64_stats_fetch_begin(&irqtime->sync); 291325e2d8c1SFrederic Weisbecker total = irqtime->total; 291419d23dbfSFrederic Weisbecker } while (__u64_stats_fetch_retry(&irqtime->sync, seq)); 291573fbec60SFrederic Weisbecker 291619d23dbfSFrederic Weisbecker return total; 291773fbec60SFrederic Weisbecker } 291873fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 2919adaf9fcdSRafael J. Wysocki 2920adaf9fcdSRafael J. Wysocki #ifdef CONFIG_CPU_FREQ 2921b10abd0aSJoel Fernandes (Google) DECLARE_PER_CPU(struct update_util_data __rcu *, cpufreq_update_util_data); 2922adaf9fcdSRafael J. Wysocki 2923adaf9fcdSRafael J. Wysocki /** 2924adaf9fcdSRafael J. Wysocki * cpufreq_update_util - Take a note about CPU utilization changes. 292512bde33dSRafael J. Wysocki * @rq: Runqueue to carry out the update for. 292658919e83SRafael J. Wysocki * @flags: Update reason flags. 2927adaf9fcdSRafael J. Wysocki * 292858919e83SRafael J. Wysocki * This function is called by the scheduler on the CPU whose utilization is 292958919e83SRafael J. Wysocki * being updated. 2930adaf9fcdSRafael J. Wysocki * 2931adaf9fcdSRafael J. Wysocki * It can only be called from RCU-sched read-side critical sections. 2932adaf9fcdSRafael J. Wysocki * 2933adaf9fcdSRafael J. Wysocki * The way cpufreq is currently arranged requires it to evaluate the CPU 2934adaf9fcdSRafael J. Wysocki * performance state (frequency/voltage) on a regular basis to prevent it from 2935adaf9fcdSRafael J. Wysocki * being stuck in a completely inadequate performance level for too long. 2936e0367b12SJuri Lelli * That is not guaranteed to happen if the updates are only triggered from CFS 2937e0367b12SJuri Lelli * and DL, though, because they may not be coming in if only RT tasks are 2938e0367b12SJuri Lelli * active all the time (or there are RT tasks only). 2939adaf9fcdSRafael J. Wysocki * 2940e0367b12SJuri Lelli * As a workaround for that issue, this function is called periodically by the 2941e0367b12SJuri Lelli * RT sched class to trigger extra cpufreq updates to prevent it from stalling, 2942adaf9fcdSRafael J. Wysocki * but that really is a band-aid. Going forward it should be replaced with 2943e0367b12SJuri Lelli * solutions targeted more specifically at RT tasks. 2944adaf9fcdSRafael J. Wysocki */ 294512bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) 2946adaf9fcdSRafael J. Wysocki { 294758919e83SRafael J. Wysocki struct update_util_data *data; 294858919e83SRafael J. Wysocki 2949674e7541SViresh Kumar data = rcu_dereference_sched(*per_cpu_ptr(&cpufreq_update_util_data, 2950674e7541SViresh Kumar cpu_of(rq))); 295158919e83SRafael J. Wysocki if (data) 295212bde33dSRafael J. Wysocki data->func(data, rq_clock(rq), flags); 295312bde33dSRafael J. Wysocki } 2954adaf9fcdSRafael J. Wysocki #else 295512bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) {} 2956adaf9fcdSRafael J. Wysocki #endif /* CONFIG_CPU_FREQ */ 2957be53f58fSLinus Torvalds 29589bdcb44eSRafael J. Wysocki #ifdef arch_scale_freq_capacity 29599bdcb44eSRafael J. Wysocki # ifndef arch_scale_freq_invariant 296097fb7a0aSIngo Molnar # define arch_scale_freq_invariant() true 29619bdcb44eSRafael J. Wysocki # endif 296297fb7a0aSIngo Molnar #else 296397fb7a0aSIngo Molnar # define arch_scale_freq_invariant() false 29649bdcb44eSRafael J. Wysocki #endif 2965d4edd662SJuri Lelli 296610a35e68SVincent Guittot #ifdef CONFIG_SMP 2967938e5e4bSQuentin Perret /** 2968a5418be9SViresh Kumar * enum cpu_util_type - CPU utilization type 2969938e5e4bSQuentin Perret * @FREQUENCY_UTIL: Utilization used to select frequency 2970938e5e4bSQuentin Perret * @ENERGY_UTIL: Utilization used during energy calculation 2971938e5e4bSQuentin Perret * 2972938e5e4bSQuentin Perret * The utilization signals of all scheduling classes (CFS/RT/DL) and IRQ time 2973938e5e4bSQuentin Perret * need to be aggregated differently depending on the usage made of them. This 2974a5418be9SViresh Kumar * enum is used within effective_cpu_util() to differentiate the types of 2975938e5e4bSQuentin Perret * utilization expected by the callers, and adjust the aggregation accordingly. 2976938e5e4bSQuentin Perret */ 2977a5418be9SViresh Kumar enum cpu_util_type { 2978938e5e4bSQuentin Perret FREQUENCY_UTIL, 2979938e5e4bSQuentin Perret ENERGY_UTIL, 2980938e5e4bSQuentin Perret }; 2981938e5e4bSQuentin Perret 2982a5418be9SViresh Kumar unsigned long effective_cpu_util(int cpu, unsigned long util_cfs, 2983bb447999SDietmar Eggemann enum cpu_util_type type, 2984af24bde8SPatrick Bellasi struct task_struct *p); 2985938e5e4bSQuentin Perret 2986b3f53daaSDietmar Eggemann /* 2987b3f53daaSDietmar Eggemann * Verify the fitness of task @p to run on @cpu taking into account the 2988b3f53daaSDietmar Eggemann * CPU original capacity and the runtime/deadline ratio of the task. 2989b3f53daaSDietmar Eggemann * 2990b3f53daaSDietmar Eggemann * The function will return true if the original capacity of @cpu is 2991b3f53daaSDietmar Eggemann * greater than or equal to task's deadline density right shifted by 2992b3f53daaSDietmar Eggemann * (BW_SHIFT - SCHED_CAPACITY_SHIFT) and false otherwise. 2993b3f53daaSDietmar Eggemann */ 2994b3f53daaSDietmar Eggemann static inline bool dl_task_fits_capacity(struct task_struct *p, int cpu) 2995b3f53daaSDietmar Eggemann { 2996b3f53daaSDietmar Eggemann unsigned long cap = arch_scale_cpu_capacity(cpu); 2997b3f53daaSDietmar Eggemann 2998b3f53daaSDietmar Eggemann return cap >= p->dl.dl_density >> (BW_SHIFT - SCHED_CAPACITY_SHIFT); 2999b3f53daaSDietmar Eggemann } 3000b3f53daaSDietmar Eggemann 30018cc90515SVincent Guittot static inline unsigned long cpu_bw_dl(struct rq *rq) 3002d4edd662SJuri Lelli { 3003d4edd662SJuri Lelli return (rq->dl.running_bw * SCHED_CAPACITY_SCALE) >> BW_SHIFT; 3004d4edd662SJuri Lelli } 3005d4edd662SJuri Lelli 30068cc90515SVincent Guittot static inline unsigned long cpu_util_dl(struct rq *rq) 30078cc90515SVincent Guittot { 30088cc90515SVincent Guittot return READ_ONCE(rq->avg_dl.util_avg); 30098cc90515SVincent Guittot } 30108cc90515SVincent Guittot 301182762d2aSDietmar Eggemann 30123eb6d6ecSDietmar Eggemann extern unsigned long cpu_util_cfs(int cpu); 30137d0583cfSDietmar Eggemann extern unsigned long cpu_util_cfs_boost(int cpu); 3014371bf427SVincent Guittot 3015371bf427SVincent Guittot static inline unsigned long cpu_util_rt(struct rq *rq) 3016371bf427SVincent Guittot { 3017dfa444dcSVincent Guittot return READ_ONCE(rq->avg_rt.util_avg); 3018371bf427SVincent Guittot } 30197d6a905fSViresh Kumar #endif 30209033ea11SVincent Guittot 30217a17e1dbSQais Yousef #ifdef CONFIG_UCLAMP_TASK 30227a17e1dbSQais Yousef unsigned long uclamp_eff_value(struct task_struct *p, enum uclamp_id clamp_id); 30237a17e1dbSQais Yousef 302424422603SQais Yousef static inline unsigned long uclamp_rq_get(struct rq *rq, 302524422603SQais Yousef enum uclamp_id clamp_id) 302624422603SQais Yousef { 302724422603SQais Yousef return READ_ONCE(rq->uclamp[clamp_id].value); 302824422603SQais Yousef } 302924422603SQais Yousef 303024422603SQais Yousef static inline void uclamp_rq_set(struct rq *rq, enum uclamp_id clamp_id, 303124422603SQais Yousef unsigned int value) 303224422603SQais Yousef { 303324422603SQais Yousef WRITE_ONCE(rq->uclamp[clamp_id].value, value); 303424422603SQais Yousef } 303524422603SQais Yousef 303624422603SQais Yousef static inline bool uclamp_rq_is_idle(struct rq *rq) 303724422603SQais Yousef { 303824422603SQais Yousef return rq->uclamp_flags & UCLAMP_FLAG_IDLE; 303924422603SQais Yousef } 304024422603SQais Yousef 30417a17e1dbSQais Yousef /** 30427a17e1dbSQais Yousef * uclamp_rq_util_with - clamp @util with @rq and @p effective uclamp values. 30437a17e1dbSQais Yousef * @rq: The rq to clamp against. Must not be NULL. 30447a17e1dbSQais Yousef * @util: The util value to clamp. 30457a17e1dbSQais Yousef * @p: The task to clamp against. Can be NULL if you want to clamp 30467a17e1dbSQais Yousef * against @rq only. 30477a17e1dbSQais Yousef * 30487a17e1dbSQais Yousef * Clamps the passed @util to the max(@rq, @p) effective uclamp values. 30497a17e1dbSQais Yousef * 30507a17e1dbSQais Yousef * If sched_uclamp_used static key is disabled, then just return the util 30517a17e1dbSQais Yousef * without any clamping since uclamp aggregation at the rq level in the fast 30527a17e1dbSQais Yousef * path is disabled, rendering this operation a NOP. 30537a17e1dbSQais Yousef * 30547a17e1dbSQais Yousef * Use uclamp_eff_value() if you don't care about uclamp values at rq level. It 30557a17e1dbSQais Yousef * will return the correct effective uclamp value of the task even if the 30567a17e1dbSQais Yousef * static key is disabled. 30577a17e1dbSQais Yousef */ 30587a17e1dbSQais Yousef static __always_inline 30597a17e1dbSQais Yousef unsigned long uclamp_rq_util_with(struct rq *rq, unsigned long util, 30607a17e1dbSQais Yousef struct task_struct *p) 30617a17e1dbSQais Yousef { 30627a17e1dbSQais Yousef unsigned long min_util = 0; 30637a17e1dbSQais Yousef unsigned long max_util = 0; 30647a17e1dbSQais Yousef 30657a17e1dbSQais Yousef if (!static_branch_likely(&sched_uclamp_used)) 30667a17e1dbSQais Yousef return util; 30677a17e1dbSQais Yousef 30687a17e1dbSQais Yousef if (p) { 30697a17e1dbSQais Yousef min_util = uclamp_eff_value(p, UCLAMP_MIN); 30707a17e1dbSQais Yousef max_util = uclamp_eff_value(p, UCLAMP_MAX); 30717a17e1dbSQais Yousef 30727a17e1dbSQais Yousef /* 30737a17e1dbSQais Yousef * Ignore last runnable task's max clamp, as this task will 30747a17e1dbSQais Yousef * reset it. Similarly, no need to read the rq's min clamp. 30757a17e1dbSQais Yousef */ 307624422603SQais Yousef if (uclamp_rq_is_idle(rq)) 30777a17e1dbSQais Yousef goto out; 30787a17e1dbSQais Yousef } 30797a17e1dbSQais Yousef 308024422603SQais Yousef min_util = max_t(unsigned long, min_util, uclamp_rq_get(rq, UCLAMP_MIN)); 308124422603SQais Yousef max_util = max_t(unsigned long, max_util, uclamp_rq_get(rq, UCLAMP_MAX)); 30827a17e1dbSQais Yousef out: 30837a17e1dbSQais Yousef /* 30847a17e1dbSQais Yousef * Since CPU's {min,max}_util clamps are MAX aggregated considering 30857a17e1dbSQais Yousef * RUNNABLE tasks with _different_ clamps, we can end up with an 30867a17e1dbSQais Yousef * inversion. Fix it now when the clamps are applied. 30877a17e1dbSQais Yousef */ 30887a17e1dbSQais Yousef if (unlikely(min_util >= max_util)) 30897a17e1dbSQais Yousef return min_util; 30907a17e1dbSQais Yousef 30917a17e1dbSQais Yousef return clamp(util, min_util, max_util); 30927a17e1dbSQais Yousef } 30937a17e1dbSQais Yousef 30947a17e1dbSQais Yousef /* Is the rq being capped/throttled by uclamp_max? */ 30957a17e1dbSQais Yousef static inline bool uclamp_rq_is_capped(struct rq *rq) 30967a17e1dbSQais Yousef { 30977a17e1dbSQais Yousef unsigned long rq_util; 30987a17e1dbSQais Yousef unsigned long max_util; 30997a17e1dbSQais Yousef 31007a17e1dbSQais Yousef if (!static_branch_likely(&sched_uclamp_used)) 31017a17e1dbSQais Yousef return false; 31027a17e1dbSQais Yousef 31037a17e1dbSQais Yousef rq_util = cpu_util_cfs(cpu_of(rq)) + cpu_util_rt(rq); 31047a17e1dbSQais Yousef max_util = READ_ONCE(rq->uclamp[UCLAMP_MAX].value); 31057a17e1dbSQais Yousef 31067a17e1dbSQais Yousef return max_util != SCHED_CAPACITY_SCALE && rq_util >= max_util; 31077a17e1dbSQais Yousef } 31087a17e1dbSQais Yousef 31097a17e1dbSQais Yousef /* 31107a17e1dbSQais Yousef * When uclamp is compiled in, the aggregation at rq level is 'turned off' 31117a17e1dbSQais Yousef * by default in the fast path and only gets turned on once userspace performs 31127a17e1dbSQais Yousef * an operation that requires it. 31137a17e1dbSQais Yousef * 31147a17e1dbSQais Yousef * Returns true if userspace opted-in to use uclamp and aggregation at rq level 31157a17e1dbSQais Yousef * hence is active. 31167a17e1dbSQais Yousef */ 31177a17e1dbSQais Yousef static inline bool uclamp_is_used(void) 31187a17e1dbSQais Yousef { 31197a17e1dbSQais Yousef return static_branch_likely(&sched_uclamp_used); 31207a17e1dbSQais Yousef } 31217a17e1dbSQais Yousef #else /* CONFIG_UCLAMP_TASK */ 3122b48e16a6SQais Yousef static inline unsigned long uclamp_eff_value(struct task_struct *p, 3123b48e16a6SQais Yousef enum uclamp_id clamp_id) 3124b48e16a6SQais Yousef { 3125b48e16a6SQais Yousef if (clamp_id == UCLAMP_MIN) 3126b48e16a6SQais Yousef return 0; 3127b48e16a6SQais Yousef 3128b48e16a6SQais Yousef return SCHED_CAPACITY_SCALE; 3129b48e16a6SQais Yousef } 3130b48e16a6SQais Yousef 31317a17e1dbSQais Yousef static inline 31327a17e1dbSQais Yousef unsigned long uclamp_rq_util_with(struct rq *rq, unsigned long util, 31337a17e1dbSQais Yousef struct task_struct *p) 31347a17e1dbSQais Yousef { 31357a17e1dbSQais Yousef return util; 31367a17e1dbSQais Yousef } 31377a17e1dbSQais Yousef 31387a17e1dbSQais Yousef static inline bool uclamp_rq_is_capped(struct rq *rq) { return false; } 31397a17e1dbSQais Yousef 31407a17e1dbSQais Yousef static inline bool uclamp_is_used(void) 31417a17e1dbSQais Yousef { 31427a17e1dbSQais Yousef return false; 31437a17e1dbSQais Yousef } 314424422603SQais Yousef 314524422603SQais Yousef static inline unsigned long uclamp_rq_get(struct rq *rq, 314624422603SQais Yousef enum uclamp_id clamp_id) 314724422603SQais Yousef { 314824422603SQais Yousef if (clamp_id == UCLAMP_MIN) 314924422603SQais Yousef return 0; 315024422603SQais Yousef 315124422603SQais Yousef return SCHED_CAPACITY_SCALE; 315224422603SQais Yousef } 315324422603SQais Yousef 315424422603SQais Yousef static inline void uclamp_rq_set(struct rq *rq, enum uclamp_id clamp_id, 315524422603SQais Yousef unsigned int value) 315624422603SQais Yousef { 315724422603SQais Yousef } 315824422603SQais Yousef 315924422603SQais Yousef static inline bool uclamp_rq_is_idle(struct rq *rq) 316024422603SQais Yousef { 316124422603SQais Yousef return false; 316224422603SQais Yousef } 31637a17e1dbSQais Yousef #endif /* CONFIG_UCLAMP_TASK */ 31647a17e1dbSQais Yousef 316511d4afd4SVincent Guittot #ifdef CONFIG_HAVE_SCHED_AVG_IRQ 31669033ea11SVincent Guittot static inline unsigned long cpu_util_irq(struct rq *rq) 31679033ea11SVincent Guittot { 31689033ea11SVincent Guittot return rq->avg_irq.util_avg; 31699033ea11SVincent Guittot } 31702e62c474SVincent Guittot 31712e62c474SVincent Guittot static inline 31722e62c474SVincent Guittot unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) 31732e62c474SVincent Guittot { 31742e62c474SVincent Guittot util *= (max - irq); 31752e62c474SVincent Guittot util /= max; 31762e62c474SVincent Guittot 31772e62c474SVincent Guittot return util; 31782e62c474SVincent Guittot 31792e62c474SVincent Guittot } 31809033ea11SVincent Guittot #else 31819033ea11SVincent Guittot static inline unsigned long cpu_util_irq(struct rq *rq) 31829033ea11SVincent Guittot { 31839033ea11SVincent Guittot return 0; 31849033ea11SVincent Guittot } 31859033ea11SVincent Guittot 31862e62c474SVincent Guittot static inline 31872e62c474SVincent Guittot unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) 31882e62c474SVincent Guittot { 31892e62c474SVincent Guittot return util; 31902e62c474SVincent Guittot } 3191794a56ebSJuri Lelli #endif 31926aa140faSQuentin Perret 3193531b5c9fSQuentin Perret #if defined(CONFIG_ENERGY_MODEL) && defined(CONFIG_CPU_FREQ_GOV_SCHEDUTIL) 31941f74de87SQuentin Perret 3195f8a696f2SPeter Zijlstra #define perf_domain_span(pd) (to_cpumask(((pd)->em_pd->cpus))) 3196f8a696f2SPeter Zijlstra 3197f8a696f2SPeter Zijlstra DECLARE_STATIC_KEY_FALSE(sched_energy_present); 3198f8a696f2SPeter Zijlstra 3199f8a696f2SPeter Zijlstra static inline bool sched_energy_enabled(void) 3200f8a696f2SPeter Zijlstra { 3201f8a696f2SPeter Zijlstra return static_branch_unlikely(&sched_energy_present); 3202f8a696f2SPeter Zijlstra } 3203f8a696f2SPeter Zijlstra 3204f2273f4eSIngo Molnar extern struct cpufreq_governor schedutil_gov; 3205f2273f4eSIngo Molnar 3206f8a696f2SPeter Zijlstra #else /* ! (CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL) */ 3207f8a696f2SPeter Zijlstra 3208f8a696f2SPeter Zijlstra #define perf_domain_span(pd) NULL 3209f8a696f2SPeter Zijlstra static inline bool sched_energy_enabled(void) { return false; } 3210f8a696f2SPeter Zijlstra 3211f8a696f2SPeter Zijlstra #endif /* CONFIG_ENERGY_MODEL && CONFIG_CPU_FREQ_GOV_SCHEDUTIL */ 3212227a4aadSMathieu Desnoyers 3213227a4aadSMathieu Desnoyers #ifdef CONFIG_MEMBARRIER 3214227a4aadSMathieu Desnoyers /* 3215227a4aadSMathieu Desnoyers * The scheduler provides memory barriers required by membarrier between: 3216227a4aadSMathieu Desnoyers * - prior user-space memory accesses and store to rq->membarrier_state, 3217227a4aadSMathieu Desnoyers * - store to rq->membarrier_state and following user-space memory accesses. 3218227a4aadSMathieu Desnoyers * In the same way it provides those guarantees around store to rq->curr. 3219227a4aadSMathieu Desnoyers */ 3220227a4aadSMathieu Desnoyers static inline void membarrier_switch_mm(struct rq *rq, 3221227a4aadSMathieu Desnoyers struct mm_struct *prev_mm, 3222227a4aadSMathieu Desnoyers struct mm_struct *next_mm) 3223227a4aadSMathieu Desnoyers { 3224227a4aadSMathieu Desnoyers int membarrier_state; 3225227a4aadSMathieu Desnoyers 3226227a4aadSMathieu Desnoyers if (prev_mm == next_mm) 3227227a4aadSMathieu Desnoyers return; 3228227a4aadSMathieu Desnoyers 3229227a4aadSMathieu Desnoyers membarrier_state = atomic_read(&next_mm->membarrier_state); 3230227a4aadSMathieu Desnoyers if (READ_ONCE(rq->membarrier_state) == membarrier_state) 3231227a4aadSMathieu Desnoyers return; 3232227a4aadSMathieu Desnoyers 3233227a4aadSMathieu Desnoyers WRITE_ONCE(rq->membarrier_state, membarrier_state); 3234227a4aadSMathieu Desnoyers } 3235227a4aadSMathieu Desnoyers #else 3236227a4aadSMathieu Desnoyers static inline void membarrier_switch_mm(struct rq *rq, 3237227a4aadSMathieu Desnoyers struct mm_struct *prev_mm, 3238227a4aadSMathieu Desnoyers struct mm_struct *next_mm) 3239227a4aadSMathieu Desnoyers { 3240227a4aadSMathieu Desnoyers } 3241227a4aadSMathieu Desnoyers #endif 324252262ee5SMel Gorman 324352262ee5SMel Gorman #ifdef CONFIG_SMP 324452262ee5SMel Gorman static inline bool is_per_cpu_kthread(struct task_struct *p) 324552262ee5SMel Gorman { 324652262ee5SMel Gorman if (!(p->flags & PF_KTHREAD)) 324752262ee5SMel Gorman return false; 324852262ee5SMel Gorman 324952262ee5SMel Gorman if (p->nr_cpus_allowed != 1) 325052262ee5SMel Gorman return false; 325152262ee5SMel Gorman 325252262ee5SMel Gorman return true; 325352262ee5SMel Gorman } 325452262ee5SMel Gorman #endif 3255b3212fe2SThomas Gleixner 32561011dcceSPeter Zijlstra extern void swake_up_all_locked(struct swait_queue_head *q); 32571011dcceSPeter Zijlstra extern void __prepare_to_swait(struct swait_queue_head *q, struct swait_queue *wait); 32581011dcceSPeter Zijlstra 3259ab83f455SPeter Oskolkov extern int try_to_wake_up(struct task_struct *tsk, unsigned int state, int wake_flags); 3260ab83f455SPeter Oskolkov 32611011dcceSPeter Zijlstra #ifdef CONFIG_PREEMPT_DYNAMIC 32621011dcceSPeter Zijlstra extern int preempt_dynamic_mode; 32631011dcceSPeter Zijlstra extern int sched_dynamic_mode(const char *str); 32641011dcceSPeter Zijlstra extern void sched_dynamic_update(int mode); 32651011dcceSPeter Zijlstra #endif 32661011dcceSPeter Zijlstra 3267af7f588dSMathieu Desnoyers #ifdef CONFIG_SCHED_MM_CID 3268223baf9dSMathieu Desnoyers 3269223baf9dSMathieu Desnoyers #define SCHED_MM_CID_PERIOD_NS (100ULL * 1000000) /* 100ms */ 3270223baf9dSMathieu Desnoyers #define MM_CID_SCAN_DELAY 100 /* 100ms */ 3271223baf9dSMathieu Desnoyers 3272223baf9dSMathieu Desnoyers extern raw_spinlock_t cid_lock; 3273223baf9dSMathieu Desnoyers extern int use_cid_lock; 3274223baf9dSMathieu Desnoyers 3275223baf9dSMathieu Desnoyers extern void sched_mm_cid_migrate_from(struct task_struct *t); 3276223baf9dSMathieu Desnoyers extern void sched_mm_cid_migrate_to(struct rq *dst_rq, struct task_struct *t); 3277223baf9dSMathieu Desnoyers extern void task_tick_mm_cid(struct rq *rq, struct task_struct *curr); 3278223baf9dSMathieu Desnoyers extern void init_sched_mm_cid(struct task_struct *t); 3279223baf9dSMathieu Desnoyers 3280223baf9dSMathieu Desnoyers static inline void __mm_cid_put(struct mm_struct *mm, int cid) 3281223baf9dSMathieu Desnoyers { 3282223baf9dSMathieu Desnoyers if (cid < 0) 3283223baf9dSMathieu Desnoyers return; 3284223baf9dSMathieu Desnoyers cpumask_clear_cpu(cid, mm_cidmask(mm)); 3285223baf9dSMathieu Desnoyers } 3286223baf9dSMathieu Desnoyers 3287223baf9dSMathieu Desnoyers /* 3288223baf9dSMathieu Desnoyers * The per-mm/cpu cid can have the MM_CID_LAZY_PUT flag set or transition to 3289223baf9dSMathieu Desnoyers * the MM_CID_UNSET state without holding the rq lock, but the rq lock needs to 3290223baf9dSMathieu Desnoyers * be held to transition to other states. 3291223baf9dSMathieu Desnoyers * 3292223baf9dSMathieu Desnoyers * State transitions synchronized with cmpxchg or try_cmpxchg need to be 3293223baf9dSMathieu Desnoyers * consistent across cpus, which prevents use of this_cpu_cmpxchg. 3294223baf9dSMathieu Desnoyers */ 3295223baf9dSMathieu Desnoyers static inline void mm_cid_put_lazy(struct task_struct *t) 3296223baf9dSMathieu Desnoyers { 3297223baf9dSMathieu Desnoyers struct mm_struct *mm = t->mm; 3298223baf9dSMathieu Desnoyers struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; 3299223baf9dSMathieu Desnoyers int cid; 3300223baf9dSMathieu Desnoyers 3301223baf9dSMathieu Desnoyers lockdep_assert_irqs_disabled(); 3302223baf9dSMathieu Desnoyers cid = __this_cpu_read(pcpu_cid->cid); 3303223baf9dSMathieu Desnoyers if (!mm_cid_is_lazy_put(cid) || 3304223baf9dSMathieu Desnoyers !try_cmpxchg(&this_cpu_ptr(pcpu_cid)->cid, &cid, MM_CID_UNSET)) 3305223baf9dSMathieu Desnoyers return; 3306223baf9dSMathieu Desnoyers __mm_cid_put(mm, mm_cid_clear_lazy_put(cid)); 3307223baf9dSMathieu Desnoyers } 3308223baf9dSMathieu Desnoyers 3309223baf9dSMathieu Desnoyers static inline int mm_cid_pcpu_unset(struct mm_struct *mm) 3310223baf9dSMathieu Desnoyers { 3311223baf9dSMathieu Desnoyers struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; 3312223baf9dSMathieu Desnoyers int cid, res; 3313223baf9dSMathieu Desnoyers 3314223baf9dSMathieu Desnoyers lockdep_assert_irqs_disabled(); 3315223baf9dSMathieu Desnoyers cid = __this_cpu_read(pcpu_cid->cid); 3316223baf9dSMathieu Desnoyers for (;;) { 3317223baf9dSMathieu Desnoyers if (mm_cid_is_unset(cid)) 3318223baf9dSMathieu Desnoyers return MM_CID_UNSET; 3319223baf9dSMathieu Desnoyers /* 3320223baf9dSMathieu Desnoyers * Attempt transition from valid or lazy-put to unset. 3321223baf9dSMathieu Desnoyers */ 3322223baf9dSMathieu Desnoyers res = cmpxchg(&this_cpu_ptr(pcpu_cid)->cid, cid, MM_CID_UNSET); 3323223baf9dSMathieu Desnoyers if (res == cid) 3324223baf9dSMathieu Desnoyers break; 3325223baf9dSMathieu Desnoyers cid = res; 3326223baf9dSMathieu Desnoyers } 3327223baf9dSMathieu Desnoyers return cid; 3328223baf9dSMathieu Desnoyers } 3329223baf9dSMathieu Desnoyers 3330223baf9dSMathieu Desnoyers static inline void mm_cid_put(struct mm_struct *mm) 3331223baf9dSMathieu Desnoyers { 3332223baf9dSMathieu Desnoyers int cid; 3333223baf9dSMathieu Desnoyers 3334223baf9dSMathieu Desnoyers lockdep_assert_irqs_disabled(); 3335223baf9dSMathieu Desnoyers cid = mm_cid_pcpu_unset(mm); 3336223baf9dSMathieu Desnoyers if (cid == MM_CID_UNSET) 3337223baf9dSMathieu Desnoyers return; 3338223baf9dSMathieu Desnoyers __mm_cid_put(mm, mm_cid_clear_lazy_put(cid)); 3339223baf9dSMathieu Desnoyers } 3340223baf9dSMathieu Desnoyers 3341223baf9dSMathieu Desnoyers static inline int __mm_cid_try_get(struct mm_struct *mm) 3342af7f588dSMathieu Desnoyers { 3343af7f588dSMathieu Desnoyers struct cpumask *cpumask; 3344af7f588dSMathieu Desnoyers int cid; 3345af7f588dSMathieu Desnoyers 3346af7f588dSMathieu Desnoyers cpumask = mm_cidmask(mm); 3347223baf9dSMathieu Desnoyers /* 3348223baf9dSMathieu Desnoyers * Retry finding first zero bit if the mask is temporarily 3349223baf9dSMathieu Desnoyers * filled. This only happens during concurrent remote-clear 3350223baf9dSMathieu Desnoyers * which owns a cid without holding a rq lock. 3351223baf9dSMathieu Desnoyers */ 3352223baf9dSMathieu Desnoyers for (;;) { 3353af7f588dSMathieu Desnoyers cid = cpumask_first_zero(cpumask); 3354223baf9dSMathieu Desnoyers if (cid < nr_cpu_ids) 3355223baf9dSMathieu Desnoyers break; 3356223baf9dSMathieu Desnoyers cpu_relax(); 3357223baf9dSMathieu Desnoyers } 3358223baf9dSMathieu Desnoyers if (cpumask_test_and_set_cpu(cid, cpumask)) 3359af7f588dSMathieu Desnoyers return -1; 3360af7f588dSMathieu Desnoyers return cid; 3361af7f588dSMathieu Desnoyers } 3362af7f588dSMathieu Desnoyers 3363af7f588dSMathieu Desnoyers /* 3364223baf9dSMathieu Desnoyers * Save a snapshot of the current runqueue time of this cpu 3365223baf9dSMathieu Desnoyers * with the per-cpu cid value, allowing to estimate how recently it was used. 3366af7f588dSMathieu Desnoyers */ 3367223baf9dSMathieu Desnoyers static inline void mm_cid_snapshot_time(struct rq *rq, struct mm_struct *mm) 3368223baf9dSMathieu Desnoyers { 3369223baf9dSMathieu Desnoyers struct mm_cid *pcpu_cid = per_cpu_ptr(mm->pcpu_cid, cpu_of(rq)); 3370223baf9dSMathieu Desnoyers 3371223baf9dSMathieu Desnoyers lockdep_assert_rq_held(rq); 3372223baf9dSMathieu Desnoyers WRITE_ONCE(pcpu_cid->time, rq->clock); 3373af7f588dSMathieu Desnoyers } 3374223baf9dSMathieu Desnoyers 3375223baf9dSMathieu Desnoyers static inline int __mm_cid_get(struct rq *rq, struct mm_struct *mm) 3376223baf9dSMathieu Desnoyers { 3377223baf9dSMathieu Desnoyers int cid; 3378223baf9dSMathieu Desnoyers 3379223baf9dSMathieu Desnoyers /* 3380223baf9dSMathieu Desnoyers * All allocations (even those using the cid_lock) are lock-free. If 3381223baf9dSMathieu Desnoyers * use_cid_lock is set, hold the cid_lock to perform cid allocation to 3382223baf9dSMathieu Desnoyers * guarantee forward progress. 3383223baf9dSMathieu Desnoyers */ 3384223baf9dSMathieu Desnoyers if (!READ_ONCE(use_cid_lock)) { 3385223baf9dSMathieu Desnoyers cid = __mm_cid_try_get(mm); 3386223baf9dSMathieu Desnoyers if (cid >= 0) 3387223baf9dSMathieu Desnoyers goto end; 3388223baf9dSMathieu Desnoyers raw_spin_lock(&cid_lock); 3389223baf9dSMathieu Desnoyers } else { 3390223baf9dSMathieu Desnoyers raw_spin_lock(&cid_lock); 3391223baf9dSMathieu Desnoyers cid = __mm_cid_try_get(mm); 3392223baf9dSMathieu Desnoyers if (cid >= 0) 3393223baf9dSMathieu Desnoyers goto unlock; 3394223baf9dSMathieu Desnoyers } 3395223baf9dSMathieu Desnoyers 3396223baf9dSMathieu Desnoyers /* 3397223baf9dSMathieu Desnoyers * cid concurrently allocated. Retry while forcing following 3398223baf9dSMathieu Desnoyers * allocations to use the cid_lock to ensure forward progress. 3399223baf9dSMathieu Desnoyers */ 3400223baf9dSMathieu Desnoyers WRITE_ONCE(use_cid_lock, 1); 3401223baf9dSMathieu Desnoyers /* 3402223baf9dSMathieu Desnoyers * Set use_cid_lock before allocation. Only care about program order 3403223baf9dSMathieu Desnoyers * because this is only required for forward progress. 3404223baf9dSMathieu Desnoyers */ 3405223baf9dSMathieu Desnoyers barrier(); 3406223baf9dSMathieu Desnoyers /* 3407223baf9dSMathieu Desnoyers * Retry until it succeeds. It is guaranteed to eventually succeed once 3408223baf9dSMathieu Desnoyers * all newcoming allocations observe the use_cid_lock flag set. 3409223baf9dSMathieu Desnoyers */ 3410223baf9dSMathieu Desnoyers do { 3411223baf9dSMathieu Desnoyers cid = __mm_cid_try_get(mm); 3412223baf9dSMathieu Desnoyers cpu_relax(); 3413223baf9dSMathieu Desnoyers } while (cid < 0); 3414223baf9dSMathieu Desnoyers /* 3415223baf9dSMathieu Desnoyers * Allocate before clearing use_cid_lock. Only care about 3416223baf9dSMathieu Desnoyers * program order because this is for forward progress. 3417223baf9dSMathieu Desnoyers */ 3418223baf9dSMathieu Desnoyers barrier(); 3419223baf9dSMathieu Desnoyers WRITE_ONCE(use_cid_lock, 0); 3420223baf9dSMathieu Desnoyers unlock: 3421223baf9dSMathieu Desnoyers raw_spin_unlock(&cid_lock); 3422223baf9dSMathieu Desnoyers end: 3423223baf9dSMathieu Desnoyers mm_cid_snapshot_time(rq, mm); 3424223baf9dSMathieu Desnoyers return cid; 3425223baf9dSMathieu Desnoyers } 3426223baf9dSMathieu Desnoyers 3427223baf9dSMathieu Desnoyers static inline int mm_cid_get(struct rq *rq, struct mm_struct *mm) 3428223baf9dSMathieu Desnoyers { 3429223baf9dSMathieu Desnoyers struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; 3430223baf9dSMathieu Desnoyers struct cpumask *cpumask; 3431223baf9dSMathieu Desnoyers int cid; 3432223baf9dSMathieu Desnoyers 3433223baf9dSMathieu Desnoyers lockdep_assert_rq_held(rq); 3434223baf9dSMathieu Desnoyers cpumask = mm_cidmask(mm); 3435223baf9dSMathieu Desnoyers cid = __this_cpu_read(pcpu_cid->cid); 3436223baf9dSMathieu Desnoyers if (mm_cid_is_valid(cid)) { 3437223baf9dSMathieu Desnoyers mm_cid_snapshot_time(rq, mm); 3438223baf9dSMathieu Desnoyers return cid; 3439223baf9dSMathieu Desnoyers } 3440223baf9dSMathieu Desnoyers if (mm_cid_is_lazy_put(cid)) { 3441223baf9dSMathieu Desnoyers if (try_cmpxchg(&this_cpu_ptr(pcpu_cid)->cid, &cid, MM_CID_UNSET)) 3442223baf9dSMathieu Desnoyers __mm_cid_put(mm, mm_cid_clear_lazy_put(cid)); 3443223baf9dSMathieu Desnoyers } 3444223baf9dSMathieu Desnoyers cid = __mm_cid_get(rq, mm); 3445223baf9dSMathieu Desnoyers __this_cpu_write(pcpu_cid->cid, cid); 3446223baf9dSMathieu Desnoyers return cid; 3447223baf9dSMathieu Desnoyers } 3448223baf9dSMathieu Desnoyers 3449223baf9dSMathieu Desnoyers static inline void switch_mm_cid(struct rq *rq, 3450223baf9dSMathieu Desnoyers struct task_struct *prev, 3451223baf9dSMathieu Desnoyers struct task_struct *next) 3452223baf9dSMathieu Desnoyers { 3453223baf9dSMathieu Desnoyers /* 3454223baf9dSMathieu Desnoyers * Provide a memory barrier between rq->curr store and load of 3455223baf9dSMathieu Desnoyers * {prev,next}->mm->pcpu_cid[cpu] on rq->curr->mm transition. 3456223baf9dSMathieu Desnoyers * 3457223baf9dSMathieu Desnoyers * Should be adapted if context_switch() is modified. 3458223baf9dSMathieu Desnoyers */ 3459223baf9dSMathieu Desnoyers if (!next->mm) { // to kernel 3460223baf9dSMathieu Desnoyers /* 3461223baf9dSMathieu Desnoyers * user -> kernel transition does not guarantee a barrier, but 3462223baf9dSMathieu Desnoyers * we can use the fact that it performs an atomic operation in 3463223baf9dSMathieu Desnoyers * mmgrab(). 3464223baf9dSMathieu Desnoyers */ 3465223baf9dSMathieu Desnoyers if (prev->mm) // from user 3466223baf9dSMathieu Desnoyers smp_mb__after_mmgrab(); 3467223baf9dSMathieu Desnoyers /* 3468223baf9dSMathieu Desnoyers * kernel -> kernel transition does not change rq->curr->mm 3469223baf9dSMathieu Desnoyers * state. It stays NULL. 3470223baf9dSMathieu Desnoyers */ 3471223baf9dSMathieu Desnoyers } else { // to user 3472223baf9dSMathieu Desnoyers /* 3473223baf9dSMathieu Desnoyers * kernel -> user transition does not provide a barrier 3474223baf9dSMathieu Desnoyers * between rq->curr store and load of {prev,next}->mm->pcpu_cid[cpu]. 3475223baf9dSMathieu Desnoyers * Provide it here. 3476223baf9dSMathieu Desnoyers */ 3477223baf9dSMathieu Desnoyers if (!prev->mm) // from kernel 3478223baf9dSMathieu Desnoyers smp_mb(); 3479223baf9dSMathieu Desnoyers /* 3480223baf9dSMathieu Desnoyers * user -> user transition guarantees a memory barrier through 3481223baf9dSMathieu Desnoyers * switch_mm() when current->mm changes. If current->mm is 3482223baf9dSMathieu Desnoyers * unchanged, no barrier is needed. 3483223baf9dSMathieu Desnoyers */ 3484223baf9dSMathieu Desnoyers } 3485223baf9dSMathieu Desnoyers if (prev->mm_cid_active) { 3486223baf9dSMathieu Desnoyers mm_cid_snapshot_time(rq, prev->mm); 3487223baf9dSMathieu Desnoyers mm_cid_put_lazy(prev); 3488af7f588dSMathieu Desnoyers prev->mm_cid = -1; 3489af7f588dSMathieu Desnoyers } 3490af7f588dSMathieu Desnoyers if (next->mm_cid_active) 3491223baf9dSMathieu Desnoyers next->last_mm_cid = next->mm_cid = mm_cid_get(rq, next->mm); 3492af7f588dSMathieu Desnoyers } 3493af7f588dSMathieu Desnoyers 3494af7f588dSMathieu Desnoyers #else 3495223baf9dSMathieu Desnoyers static inline void switch_mm_cid(struct rq *rq, struct task_struct *prev, struct task_struct *next) { } 3496223baf9dSMathieu Desnoyers static inline void sched_mm_cid_migrate_from(struct task_struct *t) { } 3497223baf9dSMathieu Desnoyers static inline void sched_mm_cid_migrate_to(struct rq *dst_rq, struct task_struct *t) { } 3498223baf9dSMathieu Desnoyers static inline void task_tick_mm_cid(struct rq *rq, struct task_struct *curr) { } 3499223baf9dSMathieu Desnoyers static inline void init_sched_mm_cid(struct task_struct *t) { } 3500af7f588dSMathieu Desnoyers #endif 3501af7f588dSMathieu Desnoyers 3502af4cf404SPeter Zijlstra extern u64 avg_vruntime(struct cfs_rq *cfs_rq); 3503147f3efaSPeter Zijlstra extern int entity_eligible(struct cfs_rq *cfs_rq, struct sched_entity *se); 3504af4cf404SPeter Zijlstra 350595458477SIngo Molnar #endif /* _KERNEL_SCHED_SCHED_H */ 3506