1391e43daSPeter Zijlstra 2391e43daSPeter Zijlstra #include <linux/sched.h> 3cf4aebc2SClark Williams #include <linux/sched/sysctl.h> 48bd75c77SClark Williams #include <linux/sched/rt.h> 5aab03e05SDario Faggioli #include <linux/sched/deadline.h> 63866e845SSteven Rostedt (Red Hat) #include <linux/binfmts.h> 7391e43daSPeter Zijlstra #include <linux/mutex.h> 8391e43daSPeter Zijlstra #include <linux/spinlock.h> 9391e43daSPeter Zijlstra #include <linux/stop_machine.h> 10b6366f04SSteven Rostedt #include <linux/irq_work.h> 119f3660c2SFrederic Weisbecker #include <linux/tick.h> 12f809ca9aSMel Gorman #include <linux/slab.h> 13391e43daSPeter Zijlstra 14391e43daSPeter Zijlstra #include "cpupri.h" 156bfd6d72SJuri Lelli #include "cpudeadline.h" 1660fed789SLi Zefan #include "cpuacct.h" 17391e43daSPeter Zijlstra 1845ceebf7SPaul Gortmaker struct rq; 19442bf3aaSDaniel Lezcano struct cpuidle_state; 2045ceebf7SPaul Gortmaker 21da0c1e65SKirill Tkhai /* task_struct::on_rq states: */ 22da0c1e65SKirill Tkhai #define TASK_ON_RQ_QUEUED 1 23cca26e80SKirill Tkhai #define TASK_ON_RQ_MIGRATING 2 24da0c1e65SKirill Tkhai 25391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 26391e43daSPeter Zijlstra 2745ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 2845ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 2945ceebf7SPaul Gortmaker 303289bdb4SPeter Zijlstra extern void calc_global_load_tick(struct rq *this_rq); 3145ceebf7SPaul Gortmaker extern long calc_load_fold_active(struct rq *this_rq); 323289bdb4SPeter Zijlstra 333289bdb4SPeter Zijlstra #ifdef CONFIG_SMP 34cee1afceSFrederic Weisbecker extern void cpu_load_update_active(struct rq *this_rq); 353289bdb4SPeter Zijlstra #else 36cee1afceSFrederic Weisbecker static inline void cpu_load_update_active(struct rq *this_rq) { } 373289bdb4SPeter Zijlstra #endif 3845ceebf7SPaul Gortmaker 39391e43daSPeter Zijlstra /* 40391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 41391e43daSPeter Zijlstra */ 42391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 43391e43daSPeter Zijlstra 44cc1f4b1fSLi Zefan /* 45cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 46cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 47cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 48cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 49cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 50cc1f4b1fSLi Zefan * 51cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 52cc1f4b1fSLi Zefan * resolution (i.e. BITS_PER_LONG > 32). The costs for increasing resolution 53cc1f4b1fSLi Zefan * when BITS_PER_LONG <= 32 are pretty high and the returns do not justify the 54cc1f4b1fSLi Zefan * increased costs. 55cc1f4b1fSLi Zefan */ 56cc1f4b1fSLi Zefan #if 0 /* BITS_PER_LONG > 32 -- currently broken: it increases power usage under light load */ 57cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 10 58cc1f4b1fSLi Zefan # define scale_load(w) ((w) << SCHED_LOAD_RESOLUTION) 59cc1f4b1fSLi Zefan # define scale_load_down(w) ((w) >> SCHED_LOAD_RESOLUTION) 60cc1f4b1fSLi Zefan #else 61cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 0 62cc1f4b1fSLi Zefan # define scale_load(w) (w) 63cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 64cc1f4b1fSLi Zefan #endif 65cc1f4b1fSLi Zefan 66cc1f4b1fSLi Zefan #define SCHED_LOAD_SHIFT (10 + SCHED_LOAD_RESOLUTION) 67cc1f4b1fSLi Zefan #define SCHED_LOAD_SCALE (1L << SCHED_LOAD_SHIFT) 68cc1f4b1fSLi Zefan 69391e43daSPeter Zijlstra #define NICE_0_LOAD SCHED_LOAD_SCALE 70391e43daSPeter Zijlstra #define NICE_0_SHIFT SCHED_LOAD_SHIFT 71391e43daSPeter Zijlstra 72391e43daSPeter Zijlstra /* 73332ac17eSDario Faggioli * Single value that decides SCHED_DEADLINE internal math precision. 74332ac17eSDario Faggioli * 10 -> just above 1us 75332ac17eSDario Faggioli * 9 -> just above 0.5us 76332ac17eSDario Faggioli */ 77332ac17eSDario Faggioli #define DL_SCALE (10) 78332ac17eSDario Faggioli 79332ac17eSDario Faggioli /* 80391e43daSPeter Zijlstra * These are the 'tuning knobs' of the scheduler: 81391e43daSPeter Zijlstra */ 82391e43daSPeter Zijlstra 83391e43daSPeter Zijlstra /* 84391e43daSPeter Zijlstra * single value that denotes runtime == period, ie unlimited time. 85391e43daSPeter Zijlstra */ 86391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 87391e43daSPeter Zijlstra 8820f9cd2aSHenrik Austad static inline int idle_policy(int policy) 8920f9cd2aSHenrik Austad { 9020f9cd2aSHenrik Austad return policy == SCHED_IDLE; 9120f9cd2aSHenrik Austad } 92d50dde5aSDario Faggioli static inline int fair_policy(int policy) 93d50dde5aSDario Faggioli { 94d50dde5aSDario Faggioli return policy == SCHED_NORMAL || policy == SCHED_BATCH; 95d50dde5aSDario Faggioli } 96d50dde5aSDario Faggioli 97391e43daSPeter Zijlstra static inline int rt_policy(int policy) 98391e43daSPeter Zijlstra { 99d50dde5aSDario Faggioli return policy == SCHED_FIFO || policy == SCHED_RR; 100391e43daSPeter Zijlstra } 101391e43daSPeter Zijlstra 102aab03e05SDario Faggioli static inline int dl_policy(int policy) 103aab03e05SDario Faggioli { 104aab03e05SDario Faggioli return policy == SCHED_DEADLINE; 105aab03e05SDario Faggioli } 10620f9cd2aSHenrik Austad static inline bool valid_policy(int policy) 10720f9cd2aSHenrik Austad { 10820f9cd2aSHenrik Austad return idle_policy(policy) || fair_policy(policy) || 10920f9cd2aSHenrik Austad rt_policy(policy) || dl_policy(policy); 11020f9cd2aSHenrik Austad } 111aab03e05SDario Faggioli 112391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 113391e43daSPeter Zijlstra { 114391e43daSPeter Zijlstra return rt_policy(p->policy); 115391e43daSPeter Zijlstra } 116391e43daSPeter Zijlstra 117aab03e05SDario Faggioli static inline int task_has_dl_policy(struct task_struct *p) 118aab03e05SDario Faggioli { 119aab03e05SDario Faggioli return dl_policy(p->policy); 120aab03e05SDario Faggioli } 121aab03e05SDario Faggioli 1222d3d891dSDario Faggioli /* 1232d3d891dSDario Faggioli * Tells if entity @a should preempt entity @b. 1242d3d891dSDario Faggioli */ 125332ac17eSDario Faggioli static inline bool 126332ac17eSDario Faggioli dl_entity_preempt(struct sched_dl_entity *a, struct sched_dl_entity *b) 1272d3d891dSDario Faggioli { 1282d3d891dSDario Faggioli return dl_time_before(a->deadline, b->deadline); 1292d3d891dSDario Faggioli } 1302d3d891dSDario Faggioli 131391e43daSPeter Zijlstra /* 132391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 133391e43daSPeter Zijlstra */ 134391e43daSPeter Zijlstra struct rt_prio_array { 135391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 136391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 137391e43daSPeter Zijlstra }; 138391e43daSPeter Zijlstra 139391e43daSPeter Zijlstra struct rt_bandwidth { 140391e43daSPeter Zijlstra /* nests inside the rq lock: */ 141391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 142391e43daSPeter Zijlstra ktime_t rt_period; 143391e43daSPeter Zijlstra u64 rt_runtime; 144391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 1454cfafd30SPeter Zijlstra unsigned int rt_period_active; 146391e43daSPeter Zijlstra }; 147a5e7be3bSJuri Lelli 148a5e7be3bSJuri Lelli void __dl_clear_params(struct task_struct *p); 149a5e7be3bSJuri Lelli 150332ac17eSDario Faggioli /* 151332ac17eSDario Faggioli * To keep the bandwidth of -deadline tasks and groups under control 152332ac17eSDario Faggioli * we need some place where: 153332ac17eSDario Faggioli * - store the maximum -deadline bandwidth of the system (the group); 154332ac17eSDario Faggioli * - cache the fraction of that bandwidth that is currently allocated. 155332ac17eSDario Faggioli * 156332ac17eSDario Faggioli * This is all done in the data structure below. It is similar to the 157332ac17eSDario Faggioli * one used for RT-throttling (rt_bandwidth), with the main difference 158332ac17eSDario Faggioli * that, since here we are only interested in admission control, we 159332ac17eSDario Faggioli * do not decrease any runtime while the group "executes", neither we 160332ac17eSDario Faggioli * need a timer to replenish it. 161332ac17eSDario Faggioli * 162332ac17eSDario Faggioli * With respect to SMP, the bandwidth is given on a per-CPU basis, 163332ac17eSDario Faggioli * meaning that: 164332ac17eSDario Faggioli * - dl_bw (< 100%) is the bandwidth of the system (group) on each CPU; 165332ac17eSDario Faggioli * - dl_total_bw array contains, in the i-eth element, the currently 166332ac17eSDario Faggioli * allocated bandwidth on the i-eth CPU. 167332ac17eSDario Faggioli * Moreover, groups consume bandwidth on each CPU, while tasks only 168332ac17eSDario Faggioli * consume bandwidth on the CPU they're running on. 169332ac17eSDario Faggioli * Finally, dl_total_bw_cpu is used to cache the index of dl_total_bw 170332ac17eSDario Faggioli * that will be shown the next time the proc or cgroup controls will 171332ac17eSDario Faggioli * be red. It on its turn can be changed by writing on its own 172332ac17eSDario Faggioli * control. 173332ac17eSDario Faggioli */ 174332ac17eSDario Faggioli struct dl_bandwidth { 175332ac17eSDario Faggioli raw_spinlock_t dl_runtime_lock; 176332ac17eSDario Faggioli u64 dl_runtime; 177332ac17eSDario Faggioli u64 dl_period; 178332ac17eSDario Faggioli }; 179332ac17eSDario Faggioli 180332ac17eSDario Faggioli static inline int dl_bandwidth_enabled(void) 181332ac17eSDario Faggioli { 1821724813dSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 183332ac17eSDario Faggioli } 184332ac17eSDario Faggioli 185332ac17eSDario Faggioli extern struct dl_bw *dl_bw_of(int i); 186332ac17eSDario Faggioli 187332ac17eSDario Faggioli struct dl_bw { 188332ac17eSDario Faggioli raw_spinlock_t lock; 189332ac17eSDario Faggioli u64 bw, total_bw; 190332ac17eSDario Faggioli }; 191332ac17eSDario Faggioli 1927f51412aSJuri Lelli static inline 1937f51412aSJuri Lelli void __dl_clear(struct dl_bw *dl_b, u64 tsk_bw) 1947f51412aSJuri Lelli { 1957f51412aSJuri Lelli dl_b->total_bw -= tsk_bw; 1967f51412aSJuri Lelli } 1977f51412aSJuri Lelli 1987f51412aSJuri Lelli static inline 1997f51412aSJuri Lelli void __dl_add(struct dl_bw *dl_b, u64 tsk_bw) 2007f51412aSJuri Lelli { 2017f51412aSJuri Lelli dl_b->total_bw += tsk_bw; 2027f51412aSJuri Lelli } 2037f51412aSJuri Lelli 2047f51412aSJuri Lelli static inline 2057f51412aSJuri Lelli bool __dl_overflow(struct dl_bw *dl_b, int cpus, u64 old_bw, u64 new_bw) 2067f51412aSJuri Lelli { 2077f51412aSJuri Lelli return dl_b->bw != -1 && 2087f51412aSJuri Lelli dl_b->bw * cpus < dl_b->total_bw - old_bw + new_bw; 2097f51412aSJuri Lelli } 2107f51412aSJuri Lelli 211391e43daSPeter Zijlstra extern struct mutex sched_domains_mutex; 212391e43daSPeter Zijlstra 213391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 214391e43daSPeter Zijlstra 215391e43daSPeter Zijlstra #include <linux/cgroup.h> 216391e43daSPeter Zijlstra 217391e43daSPeter Zijlstra struct cfs_rq; 218391e43daSPeter Zijlstra struct rt_rq; 219391e43daSPeter Zijlstra 22035cf4e50SMike Galbraith extern struct list_head task_groups; 221391e43daSPeter Zijlstra 222391e43daSPeter Zijlstra struct cfs_bandwidth { 223391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 224391e43daSPeter Zijlstra raw_spinlock_t lock; 225391e43daSPeter Zijlstra ktime_t period; 226391e43daSPeter Zijlstra u64 quota, runtime; 2279c58c79aSZhihui Zhang s64 hierarchical_quota; 228391e43daSPeter Zijlstra u64 runtime_expires; 229391e43daSPeter Zijlstra 2304cfafd30SPeter Zijlstra int idle, period_active; 231391e43daSPeter Zijlstra struct hrtimer period_timer, slack_timer; 232391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 233391e43daSPeter Zijlstra 234391e43daSPeter Zijlstra /* statistics */ 235391e43daSPeter Zijlstra int nr_periods, nr_throttled; 236391e43daSPeter Zijlstra u64 throttled_time; 237391e43daSPeter Zijlstra #endif 238391e43daSPeter Zijlstra }; 239391e43daSPeter Zijlstra 240391e43daSPeter Zijlstra /* task group related information */ 241391e43daSPeter Zijlstra struct task_group { 242391e43daSPeter Zijlstra struct cgroup_subsys_state css; 243391e43daSPeter Zijlstra 244391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 245391e43daSPeter Zijlstra /* schedulable entities of this group on each cpu */ 246391e43daSPeter Zijlstra struct sched_entity **se; 247391e43daSPeter Zijlstra /* runqueue "owned" by this group on each cpu */ 248391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 249391e43daSPeter Zijlstra unsigned long shares; 250391e43daSPeter Zijlstra 251fa6bddebSAlex Shi #ifdef CONFIG_SMP 252b0367629SWaiman Long /* 253b0367629SWaiman Long * load_avg can be heavily contended at clock tick time, so put 254b0367629SWaiman Long * it in its own cacheline separated from the fields above which 255b0367629SWaiman Long * will also be accessed at each tick. 256b0367629SWaiman Long */ 257b0367629SWaiman Long atomic_long_t load_avg ____cacheline_aligned; 258391e43daSPeter Zijlstra #endif 259fa6bddebSAlex Shi #endif 260391e43daSPeter Zijlstra 261391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 262391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 263391e43daSPeter Zijlstra struct rt_rq **rt_rq; 264391e43daSPeter Zijlstra 265391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 266391e43daSPeter Zijlstra #endif 267391e43daSPeter Zijlstra 268391e43daSPeter Zijlstra struct rcu_head rcu; 269391e43daSPeter Zijlstra struct list_head list; 270391e43daSPeter Zijlstra 271391e43daSPeter Zijlstra struct task_group *parent; 272391e43daSPeter Zijlstra struct list_head siblings; 273391e43daSPeter Zijlstra struct list_head children; 274391e43daSPeter Zijlstra 275391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 276391e43daSPeter Zijlstra struct autogroup *autogroup; 277391e43daSPeter Zijlstra #endif 278391e43daSPeter Zijlstra 279391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 280391e43daSPeter Zijlstra }; 281391e43daSPeter Zijlstra 282391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 283391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 284391e43daSPeter Zijlstra 285391e43daSPeter Zijlstra /* 286391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 287391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 288391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 289391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 290391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 291391e43daSPeter Zijlstra * limitation from this.) 292391e43daSPeter Zijlstra */ 293391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 294391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 295391e43daSPeter Zijlstra #endif 296391e43daSPeter Zijlstra 297391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 298391e43daSPeter Zijlstra 299391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 300391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 301391e43daSPeter Zijlstra 302391e43daSPeter Zijlstra /* 303391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 304391e43daSPeter Zijlstra * leaving it for the final time. 305391e43daSPeter Zijlstra * 306391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 307391e43daSPeter Zijlstra */ 308391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 309391e43daSPeter Zijlstra { 310391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 311391e43daSPeter Zijlstra } 312391e43daSPeter Zijlstra 313391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 314391e43daSPeter Zijlstra 315391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 316391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 3176fe1f348SPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg); 318391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 319391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 320391e43daSPeter Zijlstra struct sched_entity *parent); 321391e43daSPeter Zijlstra extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 322391e43daSPeter Zijlstra 323391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 32477a4d1a1SPeter Zijlstra extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 325391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 326391e43daSPeter Zijlstra 327391e43daSPeter Zijlstra extern void free_rt_sched_group(struct task_group *tg); 328391e43daSPeter Zijlstra extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 329391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 330391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 331391e43daSPeter Zijlstra struct sched_rt_entity *parent); 332391e43daSPeter Zijlstra 33325cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 33425cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 33525cc7da7SLi Zefan struct task_group *parent); 33625cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 33725cc7da7SLi Zefan extern void sched_offline_group(struct task_group *tg); 33825cc7da7SLi Zefan 33925cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 34025cc7da7SLi Zefan 34125cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 34225cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 343ad936d86SByungchul Park 344ad936d86SByungchul Park #ifdef CONFIG_SMP 345ad936d86SByungchul Park extern void set_task_rq_fair(struct sched_entity *se, 346ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next); 347ad936d86SByungchul Park #else /* !CONFIG_SMP */ 348ad936d86SByungchul Park static inline void set_task_rq_fair(struct sched_entity *se, 349ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next) { } 350ad936d86SByungchul Park #endif /* CONFIG_SMP */ 351ad936d86SByungchul Park #endif /* CONFIG_FAIR_GROUP_SCHED */ 35225cc7da7SLi Zefan 353391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 354391e43daSPeter Zijlstra 355391e43daSPeter Zijlstra struct cfs_bandwidth { }; 356391e43daSPeter Zijlstra 357391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 358391e43daSPeter Zijlstra 359391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 360391e43daSPeter Zijlstra struct cfs_rq { 361391e43daSPeter Zijlstra struct load_weight load; 362c82513e5SPeter Zijlstra unsigned int nr_running, h_nr_running; 363391e43daSPeter Zijlstra 364391e43daSPeter Zijlstra u64 exec_clock; 365391e43daSPeter Zijlstra u64 min_vruntime; 366391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 367391e43daSPeter Zijlstra u64 min_vruntime_copy; 368391e43daSPeter Zijlstra #endif 369391e43daSPeter Zijlstra 370391e43daSPeter Zijlstra struct rb_root tasks_timeline; 371391e43daSPeter Zijlstra struct rb_node *rb_leftmost; 372391e43daSPeter Zijlstra 373391e43daSPeter Zijlstra /* 374391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 375391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 376391e43daSPeter Zijlstra */ 377391e43daSPeter Zijlstra struct sched_entity *curr, *next, *last, *skip; 378391e43daSPeter Zijlstra 379391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 380391e43daSPeter Zijlstra unsigned int nr_spread_over; 381391e43daSPeter Zijlstra #endif 382391e43daSPeter Zijlstra 3832dac754eSPaul Turner #ifdef CONFIG_SMP 3842dac754eSPaul Turner /* 3859d89c257SYuyang Du * CFS load tracking 3862dac754eSPaul Turner */ 3879d89c257SYuyang Du struct sched_avg avg; 38813962234SYuyang Du u64 runnable_load_sum; 38913962234SYuyang Du unsigned long runnable_load_avg; 3909d89c257SYuyang Du #ifdef CONFIG_FAIR_GROUP_SCHED 3919d89c257SYuyang Du unsigned long tg_load_avg_contrib; 3929d89c257SYuyang Du #endif 3939d89c257SYuyang Du atomic_long_t removed_load_avg, removed_util_avg; 3949d89c257SYuyang Du #ifndef CONFIG_64BIT 3959d89c257SYuyang Du u64 load_last_update_time_copy; 3969d89c257SYuyang Du #endif 397141965c7SAlex Shi 398c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 39982958366SPaul Turner /* 40082958366SPaul Turner * h_load = weight * f(tg) 40182958366SPaul Turner * 40282958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 40382958366SPaul Turner * this group. 40482958366SPaul Turner */ 40582958366SPaul Turner unsigned long h_load; 40668520796SVladimir Davydov u64 last_h_load_update; 40768520796SVladimir Davydov struct sched_entity *h_load_next; 40868520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 40982958366SPaul Turner #endif /* CONFIG_SMP */ 41082958366SPaul Turner 411391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 412391e43daSPeter Zijlstra struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ 413391e43daSPeter Zijlstra 414391e43daSPeter Zijlstra /* 415391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 416391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 417391e43daSPeter Zijlstra * (like users, containers etc.) 418391e43daSPeter Zijlstra * 419391e43daSPeter Zijlstra * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This 420391e43daSPeter Zijlstra * list is used during load balance. 421391e43daSPeter Zijlstra */ 422391e43daSPeter Zijlstra int on_list; 423391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 424391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 425391e43daSPeter Zijlstra 426391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 427391e43daSPeter Zijlstra int runtime_enabled; 428391e43daSPeter Zijlstra u64 runtime_expires; 429391e43daSPeter Zijlstra s64 runtime_remaining; 430391e43daSPeter Zijlstra 431f1b17280SPaul Turner u64 throttled_clock, throttled_clock_task; 432f1b17280SPaul Turner u64 throttled_clock_task_time; 433391e43daSPeter Zijlstra int throttled, throttle_count; 434391e43daSPeter Zijlstra struct list_head throttled_list; 435391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 436391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 437391e43daSPeter Zijlstra }; 438391e43daSPeter Zijlstra 439391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 440391e43daSPeter Zijlstra { 441391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 442391e43daSPeter Zijlstra } 443391e43daSPeter Zijlstra 444b6366f04SSteven Rostedt /* RT IPI pull logic requires IRQ_WORK */ 445b6366f04SSteven Rostedt #ifdef CONFIG_IRQ_WORK 446b6366f04SSteven Rostedt # define HAVE_RT_PUSH_IPI 447b6366f04SSteven Rostedt #endif 448b6366f04SSteven Rostedt 449391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 450391e43daSPeter Zijlstra struct rt_rq { 451391e43daSPeter Zijlstra struct rt_prio_array active; 452c82513e5SPeter Zijlstra unsigned int rt_nr_running; 45301d36d0aSFrederic Weisbecker unsigned int rr_nr_running; 454391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 455391e43daSPeter Zijlstra struct { 456391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 457391e43daSPeter Zijlstra #ifdef CONFIG_SMP 458391e43daSPeter Zijlstra int next; /* next highest */ 459391e43daSPeter Zijlstra #endif 460391e43daSPeter Zijlstra } highest_prio; 461391e43daSPeter Zijlstra #endif 462391e43daSPeter Zijlstra #ifdef CONFIG_SMP 463391e43daSPeter Zijlstra unsigned long rt_nr_migratory; 464391e43daSPeter Zijlstra unsigned long rt_nr_total; 465391e43daSPeter Zijlstra int overloaded; 466391e43daSPeter Zijlstra struct plist_head pushable_tasks; 467b6366f04SSteven Rostedt #ifdef HAVE_RT_PUSH_IPI 468b6366f04SSteven Rostedt int push_flags; 469b6366f04SSteven Rostedt int push_cpu; 470b6366f04SSteven Rostedt struct irq_work push_work; 471b6366f04SSteven Rostedt raw_spinlock_t push_lock; 472391e43daSPeter Zijlstra #endif 473b6366f04SSteven Rostedt #endif /* CONFIG_SMP */ 474f4ebcbc0SKirill Tkhai int rt_queued; 475f4ebcbc0SKirill Tkhai 476391e43daSPeter Zijlstra int rt_throttled; 477391e43daSPeter Zijlstra u64 rt_time; 478391e43daSPeter Zijlstra u64 rt_runtime; 479391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 480391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 481391e43daSPeter Zijlstra 482391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 483391e43daSPeter Zijlstra unsigned long rt_nr_boosted; 484391e43daSPeter Zijlstra 485391e43daSPeter Zijlstra struct rq *rq; 486391e43daSPeter Zijlstra struct task_group *tg; 487391e43daSPeter Zijlstra #endif 488391e43daSPeter Zijlstra }; 489391e43daSPeter Zijlstra 490aab03e05SDario Faggioli /* Deadline class' related fields in a runqueue */ 491aab03e05SDario Faggioli struct dl_rq { 492aab03e05SDario Faggioli /* runqueue is an rbtree, ordered by deadline */ 493aab03e05SDario Faggioli struct rb_root rb_root; 494aab03e05SDario Faggioli struct rb_node *rb_leftmost; 495aab03e05SDario Faggioli 496aab03e05SDario Faggioli unsigned long dl_nr_running; 4971baca4ceSJuri Lelli 4981baca4ceSJuri Lelli #ifdef CONFIG_SMP 4991baca4ceSJuri Lelli /* 5001baca4ceSJuri Lelli * Deadline values of the currently executing and the 5011baca4ceSJuri Lelli * earliest ready task on this rq. Caching these facilitates 5021baca4ceSJuri Lelli * the decision wether or not a ready but not running task 5031baca4ceSJuri Lelli * should migrate somewhere else. 5041baca4ceSJuri Lelli */ 5051baca4ceSJuri Lelli struct { 5061baca4ceSJuri Lelli u64 curr; 5071baca4ceSJuri Lelli u64 next; 5081baca4ceSJuri Lelli } earliest_dl; 5091baca4ceSJuri Lelli 5101baca4ceSJuri Lelli unsigned long dl_nr_migratory; 5111baca4ceSJuri Lelli int overloaded; 5121baca4ceSJuri Lelli 5131baca4ceSJuri Lelli /* 5141baca4ceSJuri Lelli * Tasks on this rq that can be pushed away. They are kept in 5151baca4ceSJuri Lelli * an rb-tree, ordered by tasks' deadlines, with caching 5161baca4ceSJuri Lelli * of the leftmost (earliest deadline) element. 5171baca4ceSJuri Lelli */ 5181baca4ceSJuri Lelli struct rb_root pushable_dl_tasks_root; 5191baca4ceSJuri Lelli struct rb_node *pushable_dl_tasks_leftmost; 520332ac17eSDario Faggioli #else 521332ac17eSDario Faggioli struct dl_bw dl_bw; 5221baca4ceSJuri Lelli #endif 523aab03e05SDario Faggioli }; 524aab03e05SDario Faggioli 525391e43daSPeter Zijlstra #ifdef CONFIG_SMP 526391e43daSPeter Zijlstra 527391e43daSPeter Zijlstra /* 528391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 529391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 530391e43daSPeter Zijlstra * fully partitioning the member cpus from any other cpuset. Whenever a new 531391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 532391e43daSPeter Zijlstra * object. 533391e43daSPeter Zijlstra * 534391e43daSPeter Zijlstra */ 535391e43daSPeter Zijlstra struct root_domain { 536391e43daSPeter Zijlstra atomic_t refcount; 537391e43daSPeter Zijlstra atomic_t rto_count; 538391e43daSPeter Zijlstra struct rcu_head rcu; 539391e43daSPeter Zijlstra cpumask_var_t span; 540391e43daSPeter Zijlstra cpumask_var_t online; 541391e43daSPeter Zijlstra 5424486edd1STim Chen /* Indicate more than one runnable task for any CPU */ 5434486edd1STim Chen bool overload; 5444486edd1STim Chen 545391e43daSPeter Zijlstra /* 5461baca4ceSJuri Lelli * The bit corresponding to a CPU gets set here if such CPU has more 5471baca4ceSJuri Lelli * than one runnable -deadline task (as it is below for RT tasks). 5481baca4ceSJuri Lelli */ 5491baca4ceSJuri Lelli cpumask_var_t dlo_mask; 5501baca4ceSJuri Lelli atomic_t dlo_count; 551332ac17eSDario Faggioli struct dl_bw dl_bw; 5526bfd6d72SJuri Lelli struct cpudl cpudl; 5531baca4ceSJuri Lelli 5541baca4ceSJuri Lelli /* 555391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 556391e43daSPeter Zijlstra * one runnable RT task. 557391e43daSPeter Zijlstra */ 558391e43daSPeter Zijlstra cpumask_var_t rto_mask; 559391e43daSPeter Zijlstra struct cpupri cpupri; 560391e43daSPeter Zijlstra }; 561391e43daSPeter Zijlstra 562391e43daSPeter Zijlstra extern struct root_domain def_root_domain; 563391e43daSPeter Zijlstra 564391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 565391e43daSPeter Zijlstra 566391e43daSPeter Zijlstra /* 567391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 568391e43daSPeter Zijlstra * 569391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 570391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 571391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 572391e43daSPeter Zijlstra */ 573391e43daSPeter Zijlstra struct rq { 574391e43daSPeter Zijlstra /* runqueue lock: */ 575391e43daSPeter Zijlstra raw_spinlock_t lock; 576391e43daSPeter Zijlstra 577391e43daSPeter Zijlstra /* 578391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 579391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 580391e43daSPeter Zijlstra */ 581c82513e5SPeter Zijlstra unsigned int nr_running; 5820ec8aa00SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 5830ec8aa00SPeter Zijlstra unsigned int nr_numa_running; 5840ec8aa00SPeter Zijlstra unsigned int nr_preferred_running; 5850ec8aa00SPeter Zijlstra #endif 586391e43daSPeter Zijlstra #define CPU_LOAD_IDX_MAX 5 587391e43daSPeter Zijlstra unsigned long cpu_load[CPU_LOAD_IDX_MAX]; 5883451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 5899fd81dd5SFrederic Weisbecker #ifdef CONFIG_SMP 5909fd81dd5SFrederic Weisbecker unsigned long last_load_update_tick; 5919fd81dd5SFrederic Weisbecker #endif /* CONFIG_SMP */ 592391e43daSPeter Zijlstra u64 nohz_stamp; 5931c792db7SSuresh Siddha unsigned long nohz_flags; 5949fd81dd5SFrederic Weisbecker #endif /* CONFIG_NO_HZ_COMMON */ 595265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 596265f22a9SFrederic Weisbecker unsigned long last_sched_tick; 597265f22a9SFrederic Weisbecker #endif 598391e43daSPeter Zijlstra /* capture load from *all* tasks on this cpu: */ 599391e43daSPeter Zijlstra struct load_weight load; 600391e43daSPeter Zijlstra unsigned long nr_load_updates; 601391e43daSPeter Zijlstra u64 nr_switches; 602391e43daSPeter Zijlstra 603391e43daSPeter Zijlstra struct cfs_rq cfs; 604391e43daSPeter Zijlstra struct rt_rq rt; 605aab03e05SDario Faggioli struct dl_rq dl; 606391e43daSPeter Zijlstra 607391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 608391e43daSPeter Zijlstra /* list of leaf cfs_rq on this cpu: */ 609391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 610a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 611a35b6466SPeter Zijlstra 612391e43daSPeter Zijlstra /* 613391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 614391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 615391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 616391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 617391e43daSPeter Zijlstra */ 618391e43daSPeter Zijlstra unsigned long nr_uninterruptible; 619391e43daSPeter Zijlstra 620391e43daSPeter Zijlstra struct task_struct *curr, *idle, *stop; 621391e43daSPeter Zijlstra unsigned long next_balance; 622391e43daSPeter Zijlstra struct mm_struct *prev_mm; 623391e43daSPeter Zijlstra 6249edfbfedSPeter Zijlstra unsigned int clock_skip_update; 625391e43daSPeter Zijlstra u64 clock; 626391e43daSPeter Zijlstra u64 clock_task; 627391e43daSPeter Zijlstra 628391e43daSPeter Zijlstra atomic_t nr_iowait; 629391e43daSPeter Zijlstra 630391e43daSPeter Zijlstra #ifdef CONFIG_SMP 631391e43daSPeter Zijlstra struct root_domain *rd; 632391e43daSPeter Zijlstra struct sched_domain *sd; 633391e43daSPeter Zijlstra 634ced549faSNicolas Pitre unsigned long cpu_capacity; 635ca6d75e6SVincent Guittot unsigned long cpu_capacity_orig; 636391e43daSPeter Zijlstra 637e3fca9e7SPeter Zijlstra struct callback_head *balance_callback; 638e3fca9e7SPeter Zijlstra 639391e43daSPeter Zijlstra unsigned char idle_balance; 640391e43daSPeter Zijlstra /* For active balancing */ 641391e43daSPeter Zijlstra int active_balance; 642391e43daSPeter Zijlstra int push_cpu; 643391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 644391e43daSPeter Zijlstra /* cpu of this runqueue: */ 645391e43daSPeter Zijlstra int cpu; 646391e43daSPeter Zijlstra int online; 647391e43daSPeter Zijlstra 648367456c7SPeter Zijlstra struct list_head cfs_tasks; 649367456c7SPeter Zijlstra 650391e43daSPeter Zijlstra u64 rt_avg; 651391e43daSPeter Zijlstra u64 age_stamp; 652391e43daSPeter Zijlstra u64 idle_stamp; 653391e43daSPeter Zijlstra u64 avg_idle; 6549bd721c5SJason Low 6559bd721c5SJason Low /* This is used to determine avg_idle's max value */ 6569bd721c5SJason Low u64 max_idle_balance_cost; 657391e43daSPeter Zijlstra #endif 658391e43daSPeter Zijlstra 659391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 660391e43daSPeter Zijlstra u64 prev_irq_time; 661391e43daSPeter Zijlstra #endif 662391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 663391e43daSPeter Zijlstra u64 prev_steal_time; 664391e43daSPeter Zijlstra #endif 665391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 666391e43daSPeter Zijlstra u64 prev_steal_time_rq; 667391e43daSPeter Zijlstra #endif 668391e43daSPeter Zijlstra 669391e43daSPeter Zijlstra /* calc_load related fields */ 670391e43daSPeter Zijlstra unsigned long calc_load_update; 671391e43daSPeter Zijlstra long calc_load_active; 672391e43daSPeter Zijlstra 673391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 674391e43daSPeter Zijlstra #ifdef CONFIG_SMP 675391e43daSPeter Zijlstra int hrtick_csd_pending; 676391e43daSPeter Zijlstra struct call_single_data hrtick_csd; 677391e43daSPeter Zijlstra #endif 678391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 679391e43daSPeter Zijlstra #endif 680391e43daSPeter Zijlstra 681391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 682391e43daSPeter Zijlstra /* latency stats */ 683391e43daSPeter Zijlstra struct sched_info rq_sched_info; 684391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 685391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 686391e43daSPeter Zijlstra 687391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 688391e43daSPeter Zijlstra unsigned int yld_count; 689391e43daSPeter Zijlstra 690391e43daSPeter Zijlstra /* schedule() stats */ 691391e43daSPeter Zijlstra unsigned int sched_count; 692391e43daSPeter Zijlstra unsigned int sched_goidle; 693391e43daSPeter Zijlstra 694391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 695391e43daSPeter Zijlstra unsigned int ttwu_count; 696391e43daSPeter Zijlstra unsigned int ttwu_local; 697391e43daSPeter Zijlstra #endif 698391e43daSPeter Zijlstra 699391e43daSPeter Zijlstra #ifdef CONFIG_SMP 700391e43daSPeter Zijlstra struct llist_head wake_list; 701391e43daSPeter Zijlstra #endif 702442bf3aaSDaniel Lezcano 703442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 704442bf3aaSDaniel Lezcano /* Must be inspected within a rcu lock section */ 705442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state; 706442bf3aaSDaniel Lezcano #endif 707391e43daSPeter Zijlstra }; 708391e43daSPeter Zijlstra 709391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 710391e43daSPeter Zijlstra { 711391e43daSPeter Zijlstra #ifdef CONFIG_SMP 712391e43daSPeter Zijlstra return rq->cpu; 713391e43daSPeter Zijlstra #else 714391e43daSPeter Zijlstra return 0; 715391e43daSPeter Zijlstra #endif 716391e43daSPeter Zijlstra } 717391e43daSPeter Zijlstra 7188b06c55bSPranith Kumar DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); 719391e43daSPeter Zijlstra 720518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 7214a32fea9SChristoph Lameter #define this_rq() this_cpu_ptr(&runqueues) 722518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 723518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 7244a32fea9SChristoph Lameter #define raw_rq() raw_cpu_ptr(&runqueues) 725518cd623SPeter Zijlstra 726cebde6d6SPeter Zijlstra static inline u64 __rq_clock_broken(struct rq *rq) 727cebde6d6SPeter Zijlstra { 728316c1608SJason Low return READ_ONCE(rq->clock); 729cebde6d6SPeter Zijlstra } 730cebde6d6SPeter Zijlstra 73178becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 73278becc27SFrederic Weisbecker { 733cebde6d6SPeter Zijlstra lockdep_assert_held(&rq->lock); 73478becc27SFrederic Weisbecker return rq->clock; 73578becc27SFrederic Weisbecker } 73678becc27SFrederic Weisbecker 73778becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 73878becc27SFrederic Weisbecker { 739cebde6d6SPeter Zijlstra lockdep_assert_held(&rq->lock); 74078becc27SFrederic Weisbecker return rq->clock_task; 74178becc27SFrederic Weisbecker } 74278becc27SFrederic Weisbecker 7439edfbfedSPeter Zijlstra #define RQCF_REQ_SKIP 0x01 7449edfbfedSPeter Zijlstra #define RQCF_ACT_SKIP 0x02 7459edfbfedSPeter Zijlstra 7469edfbfedSPeter Zijlstra static inline void rq_clock_skip_update(struct rq *rq, bool skip) 7479edfbfedSPeter Zijlstra { 7489edfbfedSPeter Zijlstra lockdep_assert_held(&rq->lock); 7499edfbfedSPeter Zijlstra if (skip) 7509edfbfedSPeter Zijlstra rq->clock_skip_update |= RQCF_REQ_SKIP; 7519edfbfedSPeter Zijlstra else 7529edfbfedSPeter Zijlstra rq->clock_skip_update &= ~RQCF_REQ_SKIP; 7539edfbfedSPeter Zijlstra } 7549edfbfedSPeter Zijlstra 7559942f79bSRik van Riel #ifdef CONFIG_NUMA 756e3fe70b1SRik van Riel enum numa_topology_type { 757e3fe70b1SRik van Riel NUMA_DIRECT, 758e3fe70b1SRik van Riel NUMA_GLUELESS_MESH, 759e3fe70b1SRik van Riel NUMA_BACKPLANE, 760e3fe70b1SRik van Riel }; 761e3fe70b1SRik van Riel extern enum numa_topology_type sched_numa_topology_type; 7629942f79bSRik van Riel extern int sched_max_numa_distance; 7639942f79bSRik van Riel extern bool find_numa_distance(int distance); 7649942f79bSRik van Riel #endif 7659942f79bSRik van Riel 766f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 76744dba3d5SIulia Manda /* The regions in numa_faults array from task_struct */ 76844dba3d5SIulia Manda enum numa_faults_stats { 76944dba3d5SIulia Manda NUMA_MEM = 0, 77044dba3d5SIulia Manda NUMA_CPU, 77144dba3d5SIulia Manda NUMA_MEMBUF, 77244dba3d5SIulia Manda NUMA_CPUBUF 77344dba3d5SIulia Manda }; 7740ec8aa00SPeter Zijlstra extern void sched_setnuma(struct task_struct *p, int node); 775e6628d5bSMel Gorman extern int migrate_task_to(struct task_struct *p, int cpu); 776ac66f547SPeter Zijlstra extern int migrate_swap(struct task_struct *, struct task_struct *); 777f809ca9aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 778f809ca9aSMel Gorman 779518cd623SPeter Zijlstra #ifdef CONFIG_SMP 780518cd623SPeter Zijlstra 781e3fca9e7SPeter Zijlstra static inline void 782e3fca9e7SPeter Zijlstra queue_balance_callback(struct rq *rq, 783e3fca9e7SPeter Zijlstra struct callback_head *head, 784e3fca9e7SPeter Zijlstra void (*func)(struct rq *rq)) 785e3fca9e7SPeter Zijlstra { 786e3fca9e7SPeter Zijlstra lockdep_assert_held(&rq->lock); 787e3fca9e7SPeter Zijlstra 788e3fca9e7SPeter Zijlstra if (unlikely(head->next)) 789e3fca9e7SPeter Zijlstra return; 790e3fca9e7SPeter Zijlstra 791e3fca9e7SPeter Zijlstra head->func = (void (*)(struct callback_head *))func; 792e3fca9e7SPeter Zijlstra head->next = rq->balance_callback; 793e3fca9e7SPeter Zijlstra rq->balance_callback = head; 794e3fca9e7SPeter Zijlstra } 795e3fca9e7SPeter Zijlstra 796e3baac47SPeter Zijlstra extern void sched_ttwu_pending(void); 797e3baac47SPeter Zijlstra 798391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 799391e43daSPeter Zijlstra rcu_dereference_check((p), \ 800391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 801391e43daSPeter Zijlstra 802391e43daSPeter Zijlstra /* 803391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 804391e43daSPeter Zijlstra * See detach_destroy_domains: synchronize_sched for details. 805391e43daSPeter Zijlstra * 806391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 807391e43daSPeter Zijlstra * preempt-disabled sections. 808391e43daSPeter Zijlstra */ 809391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 810518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 811518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 812391e43daSPeter Zijlstra 81377e81365SSuresh Siddha #define for_each_lower_domain(sd) for (; sd; sd = sd->child) 81477e81365SSuresh Siddha 815518cd623SPeter Zijlstra /** 816518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 817518cd623SPeter Zijlstra * @cpu: The cpu whose highest level of sched domain is to 818518cd623SPeter Zijlstra * be returned. 819518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 820518cd623SPeter Zijlstra * for the given cpu. 821518cd623SPeter Zijlstra * 822518cd623SPeter Zijlstra * Returns the highest sched_domain of a cpu which contains the given flag. 823518cd623SPeter Zijlstra */ 824518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 825518cd623SPeter Zijlstra { 826518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 827518cd623SPeter Zijlstra 828518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 829518cd623SPeter Zijlstra if (!(sd->flags & flag)) 830518cd623SPeter Zijlstra break; 831518cd623SPeter Zijlstra hsd = sd; 832518cd623SPeter Zijlstra } 833518cd623SPeter Zijlstra 834518cd623SPeter Zijlstra return hsd; 835518cd623SPeter Zijlstra } 836518cd623SPeter Zijlstra 837fb13c7eeSMel Gorman static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) 838fb13c7eeSMel Gorman { 839fb13c7eeSMel Gorman struct sched_domain *sd; 840fb13c7eeSMel Gorman 841fb13c7eeSMel Gorman for_each_domain(cpu, sd) { 842fb13c7eeSMel Gorman if (sd->flags & flag) 843fb13c7eeSMel Gorman break; 844fb13c7eeSMel Gorman } 845fb13c7eeSMel Gorman 846fb13c7eeSMel Gorman return sd; 847fb13c7eeSMel Gorman } 848fb13c7eeSMel Gorman 849518cd623SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain *, sd_llc); 8507d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 851518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 852fb13c7eeSMel Gorman DECLARE_PER_CPU(struct sched_domain *, sd_numa); 85337dc6b50SPreeti U Murthy DECLARE_PER_CPU(struct sched_domain *, sd_busy); 85437dc6b50SPreeti U Murthy DECLARE_PER_CPU(struct sched_domain *, sd_asym); 855518cd623SPeter Zijlstra 85663b2ca30SNicolas Pitre struct sched_group_capacity { 8575e6521eaSLi Zefan atomic_t ref; 8585e6521eaSLi Zefan /* 85963b2ca30SNicolas Pitre * CPU capacity of this group, SCHED_LOAD_SCALE being max capacity 86063b2ca30SNicolas Pitre * for a single CPU. 8615e6521eaSLi Zefan */ 862dc7ff76eSVincent Guittot unsigned int capacity; 8635e6521eaSLi Zefan unsigned long next_update; 86463b2ca30SNicolas Pitre int imbalance; /* XXX unrelated to capacity but shared group state */ 8655e6521eaSLi Zefan /* 8665e6521eaSLi Zefan * Number of busy cpus in this group. 8675e6521eaSLi Zefan */ 8685e6521eaSLi Zefan atomic_t nr_busy_cpus; 8695e6521eaSLi Zefan 8705e6521eaSLi Zefan unsigned long cpumask[0]; /* iteration mask */ 8715e6521eaSLi Zefan }; 8725e6521eaSLi Zefan 8735e6521eaSLi Zefan struct sched_group { 8745e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 8755e6521eaSLi Zefan atomic_t ref; 8765e6521eaSLi Zefan 8775e6521eaSLi Zefan unsigned int group_weight; 87863b2ca30SNicolas Pitre struct sched_group_capacity *sgc; 8795e6521eaSLi Zefan 8805e6521eaSLi Zefan /* 8815e6521eaSLi Zefan * The CPUs this group covers. 8825e6521eaSLi Zefan * 8835e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 8845e6521eaSLi Zefan * by attaching extra space to the end of the structure, 8855e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 8865e6521eaSLi Zefan */ 8875e6521eaSLi Zefan unsigned long cpumask[0]; 8885e6521eaSLi Zefan }; 8895e6521eaSLi Zefan 8905e6521eaSLi Zefan static inline struct cpumask *sched_group_cpus(struct sched_group *sg) 8915e6521eaSLi Zefan { 8925e6521eaSLi Zefan return to_cpumask(sg->cpumask); 8935e6521eaSLi Zefan } 8945e6521eaSLi Zefan 8955e6521eaSLi Zefan /* 8965e6521eaSLi Zefan * cpumask masking which cpus in the group are allowed to iterate up the domain 8975e6521eaSLi Zefan * tree. 8985e6521eaSLi Zefan */ 8995e6521eaSLi Zefan static inline struct cpumask *sched_group_mask(struct sched_group *sg) 9005e6521eaSLi Zefan { 90163b2ca30SNicolas Pitre return to_cpumask(sg->sgc->cpumask); 9025e6521eaSLi Zefan } 9035e6521eaSLi Zefan 9045e6521eaSLi Zefan /** 9055e6521eaSLi Zefan * group_first_cpu - Returns the first cpu in the cpumask of a sched_group. 9065e6521eaSLi Zefan * @group: The group whose first cpu is to be returned. 9075e6521eaSLi Zefan */ 9085e6521eaSLi Zefan static inline unsigned int group_first_cpu(struct sched_group *group) 9095e6521eaSLi Zefan { 9105e6521eaSLi Zefan return cpumask_first(sched_group_cpus(group)); 9115e6521eaSLi Zefan } 9125e6521eaSLi Zefan 913c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 914c1174876SPeter Zijlstra 9153866e845SSteven Rostedt (Red Hat) #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL) 9163866e845SSteven Rostedt (Red Hat) void register_sched_domain_sysctl(void); 9173866e845SSteven Rostedt (Red Hat) void unregister_sched_domain_sysctl(void); 9183866e845SSteven Rostedt (Red Hat) #else 9193866e845SSteven Rostedt (Red Hat) static inline void register_sched_domain_sysctl(void) 9203866e845SSteven Rostedt (Red Hat) { 9213866e845SSteven Rostedt (Red Hat) } 9223866e845SSteven Rostedt (Red Hat) static inline void unregister_sched_domain_sysctl(void) 9233866e845SSteven Rostedt (Red Hat) { 9243866e845SSteven Rostedt (Red Hat) } 9253866e845SSteven Rostedt (Red Hat) #endif 9263866e845SSteven Rostedt (Red Hat) 927e3baac47SPeter Zijlstra #else 928e3baac47SPeter Zijlstra 929e3baac47SPeter Zijlstra static inline void sched_ttwu_pending(void) { } 930e3baac47SPeter Zijlstra 931518cd623SPeter Zijlstra #endif /* CONFIG_SMP */ 932391e43daSPeter Zijlstra 933391e43daSPeter Zijlstra #include "stats.h" 934391e43daSPeter Zijlstra #include "auto_group.h" 935391e43daSPeter Zijlstra 936391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 937391e43daSPeter Zijlstra 938391e43daSPeter Zijlstra /* 939391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 940391e43daSPeter Zijlstra * 9418af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 9428af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 9438af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 9448323f26cSPeter Zijlstra * 9458323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 9468323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 9478323f26cSPeter Zijlstra * 9488323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 9498323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 950391e43daSPeter Zijlstra */ 951391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 952391e43daSPeter Zijlstra { 9538323f26cSPeter Zijlstra return p->sched_task_group; 954391e43daSPeter Zijlstra } 955391e43daSPeter Zijlstra 956391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 957391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 958391e43daSPeter Zijlstra { 959391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 960391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 961391e43daSPeter Zijlstra #endif 962391e43daSPeter Zijlstra 963391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 964ad936d86SByungchul Park set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]); 965391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 966391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 967391e43daSPeter Zijlstra #endif 968391e43daSPeter Zijlstra 969391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 970391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 971391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 972391e43daSPeter Zijlstra #endif 973391e43daSPeter Zijlstra } 974391e43daSPeter Zijlstra 975391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 976391e43daSPeter Zijlstra 977391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 978391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 979391e43daSPeter Zijlstra { 980391e43daSPeter Zijlstra return NULL; 981391e43daSPeter Zijlstra } 982391e43daSPeter Zijlstra 983391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 984391e43daSPeter Zijlstra 985391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 986391e43daSPeter Zijlstra { 987391e43daSPeter Zijlstra set_task_rq(p, cpu); 988391e43daSPeter Zijlstra #ifdef CONFIG_SMP 989391e43daSPeter Zijlstra /* 990391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 991391e43daSPeter Zijlstra * successfuly executed on another CPU. We must ensure that updates of 992391e43daSPeter Zijlstra * per-task data have been completed by this moment. 993391e43daSPeter Zijlstra */ 994391e43daSPeter Zijlstra smp_wmb(); 995391e43daSPeter Zijlstra task_thread_info(p)->cpu = cpu; 996ac66f547SPeter Zijlstra p->wake_cpu = cpu; 997391e43daSPeter Zijlstra #endif 998391e43daSPeter Zijlstra } 999391e43daSPeter Zijlstra 1000391e43daSPeter Zijlstra /* 1001391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 1002391e43daSPeter Zijlstra */ 1003391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 1004c5905afbSIngo Molnar # include <linux/static_key.h> 1005391e43daSPeter Zijlstra # define const_debug __read_mostly 1006391e43daSPeter Zijlstra #else 1007391e43daSPeter Zijlstra # define const_debug const 1008391e43daSPeter Zijlstra #endif 1009391e43daSPeter Zijlstra 1010391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_features; 1011391e43daSPeter Zijlstra 1012391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1013391e43daSPeter Zijlstra __SCHED_FEAT_##name , 1014391e43daSPeter Zijlstra 1015391e43daSPeter Zijlstra enum { 1016391e43daSPeter Zijlstra #include "features.h" 1017f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 1018391e43daSPeter Zijlstra }; 1019391e43daSPeter Zijlstra 1020391e43daSPeter Zijlstra #undef SCHED_FEAT 1021391e43daSPeter Zijlstra 1022f8b6d1ccSPeter Zijlstra #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) 1023f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1024c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 1025f8b6d1ccSPeter Zijlstra { \ 10266e76ea8aSJason Baron return static_key_##enabled(key); \ 1027f8b6d1ccSPeter Zijlstra } 1028f8b6d1ccSPeter Zijlstra 1029f8b6d1ccSPeter Zijlstra #include "features.h" 1030f8b6d1ccSPeter Zijlstra 1031f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 1032f8b6d1ccSPeter Zijlstra 1033c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 1034f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 1035f8b6d1ccSPeter Zijlstra #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ 1036391e43daSPeter Zijlstra #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 1037f8b6d1ccSPeter Zijlstra #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ 1038391e43daSPeter Zijlstra 10392a595721SSrikar Dronamraju extern struct static_key_false sched_numa_balancing; 1040cb251765SMel Gorman extern struct static_key_false sched_schedstats; 1041cbee9f88SPeter Zijlstra 1042391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 1043391e43daSPeter Zijlstra { 1044391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 1045391e43daSPeter Zijlstra } 1046391e43daSPeter Zijlstra 1047391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 1048391e43daSPeter Zijlstra { 1049391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 1050391e43daSPeter Zijlstra return RUNTIME_INF; 1051391e43daSPeter Zijlstra 1052391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 1053391e43daSPeter Zijlstra } 1054391e43daSPeter Zijlstra 1055391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 1056391e43daSPeter Zijlstra { 1057391e43daSPeter Zijlstra return rq->curr == p; 1058391e43daSPeter Zijlstra } 1059391e43daSPeter Zijlstra 1060391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 1061391e43daSPeter Zijlstra { 1062391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1063391e43daSPeter Zijlstra return p->on_cpu; 1064391e43daSPeter Zijlstra #else 1065391e43daSPeter Zijlstra return task_current(rq, p); 1066391e43daSPeter Zijlstra #endif 1067391e43daSPeter Zijlstra } 1068391e43daSPeter Zijlstra 1069da0c1e65SKirill Tkhai static inline int task_on_rq_queued(struct task_struct *p) 1070da0c1e65SKirill Tkhai { 1071da0c1e65SKirill Tkhai return p->on_rq == TASK_ON_RQ_QUEUED; 1072da0c1e65SKirill Tkhai } 1073391e43daSPeter Zijlstra 1074cca26e80SKirill Tkhai static inline int task_on_rq_migrating(struct task_struct *p) 1075cca26e80SKirill Tkhai { 1076cca26e80SKirill Tkhai return p->on_rq == TASK_ON_RQ_MIGRATING; 1077cca26e80SKirill Tkhai } 1078cca26e80SKirill Tkhai 1079391e43daSPeter Zijlstra #ifndef prepare_arch_switch 1080391e43daSPeter Zijlstra # define prepare_arch_switch(next) do { } while (0) 1081391e43daSPeter Zijlstra #endif 108201f23e16SCatalin Marinas #ifndef finish_arch_post_lock_switch 108301f23e16SCatalin Marinas # define finish_arch_post_lock_switch() do { } while (0) 108401f23e16SCatalin Marinas #endif 1085391e43daSPeter Zijlstra 1086391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 1087391e43daSPeter Zijlstra { 1088391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1089391e43daSPeter Zijlstra /* 1090391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 1091391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 1092391e43daSPeter Zijlstra * here. 1093391e43daSPeter Zijlstra */ 1094391e43daSPeter Zijlstra next->on_cpu = 1; 1095391e43daSPeter Zijlstra #endif 1096391e43daSPeter Zijlstra } 1097391e43daSPeter Zijlstra 1098391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 1099391e43daSPeter Zijlstra { 1100391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1101391e43daSPeter Zijlstra /* 1102391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 1103391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 1104391e43daSPeter Zijlstra * finished. 110595913d97SPeter Zijlstra * 1106b75a2253SPeter Zijlstra * In particular, the load of prev->state in finish_task_switch() must 1107b75a2253SPeter Zijlstra * happen before this. 1108b75a2253SPeter Zijlstra * 1109b3e0b1b6SPeter Zijlstra * Pairs with the smp_cond_acquire() in try_to_wake_up(). 1110391e43daSPeter Zijlstra */ 111195913d97SPeter Zijlstra smp_store_release(&prev->on_cpu, 0); 1112391e43daSPeter Zijlstra #endif 1113391e43daSPeter Zijlstra #ifdef CONFIG_DEBUG_SPINLOCK 1114391e43daSPeter Zijlstra /* this is a valid case when another task releases the spinlock */ 1115391e43daSPeter Zijlstra rq->lock.owner = current; 1116391e43daSPeter Zijlstra #endif 1117391e43daSPeter Zijlstra /* 1118391e43daSPeter Zijlstra * If we are tracking spinlock dependencies then we have to 1119391e43daSPeter Zijlstra * fix up the runqueue lock - which gets 'carried over' from 1120391e43daSPeter Zijlstra * prev into current: 1121391e43daSPeter Zijlstra */ 1122391e43daSPeter Zijlstra spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); 1123391e43daSPeter Zijlstra 1124391e43daSPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 1125391e43daSPeter Zijlstra } 1126391e43daSPeter Zijlstra 1127b13095f0SLi Zefan /* 1128b13095f0SLi Zefan * wake flags 1129b13095f0SLi Zefan */ 1130b13095f0SLi Zefan #define WF_SYNC 0x01 /* waker goes to sleep after wakeup */ 1131b13095f0SLi Zefan #define WF_FORK 0x02 /* child wakeup after fork */ 1132b13095f0SLi Zefan #define WF_MIGRATED 0x4 /* internal use, task got migrated */ 1133b13095f0SLi Zefan 1134391e43daSPeter Zijlstra /* 1135391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 1136391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 1137391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 1138391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 1139391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 1140391e43daSPeter Zijlstra * slice expiry etc. 1141391e43daSPeter Zijlstra */ 1142391e43daSPeter Zijlstra 1143391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 1144391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 1145391e43daSPeter Zijlstra 1146ed82b8a1SAndi Kleen extern const int sched_prio_to_weight[40]; 1147ed82b8a1SAndi Kleen extern const u32 sched_prio_to_wmult[40]; 1148391e43daSPeter Zijlstra 1149ff77e468SPeter Zijlstra /* 1150ff77e468SPeter Zijlstra * {de,en}queue flags: 1151ff77e468SPeter Zijlstra * 1152ff77e468SPeter Zijlstra * DEQUEUE_SLEEP - task is no longer runnable 1153ff77e468SPeter Zijlstra * ENQUEUE_WAKEUP - task just became runnable 1154ff77e468SPeter Zijlstra * 1155ff77e468SPeter Zijlstra * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks 1156ff77e468SPeter Zijlstra * are in a known state which allows modification. Such pairs 1157ff77e468SPeter Zijlstra * should preserve as much state as possible. 1158ff77e468SPeter Zijlstra * 1159ff77e468SPeter Zijlstra * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location 1160ff77e468SPeter Zijlstra * in the runqueue. 1161ff77e468SPeter Zijlstra * 1162ff77e468SPeter Zijlstra * ENQUEUE_HEAD - place at front of runqueue (tail if not specified) 1163ff77e468SPeter Zijlstra * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline) 1164ff77e468SPeter Zijlstra * ENQUEUE_WAKING - sched_class::task_waking was called 1165ff77e468SPeter Zijlstra * 1166ff77e468SPeter Zijlstra */ 1167ff77e468SPeter Zijlstra 1168ff77e468SPeter Zijlstra #define DEQUEUE_SLEEP 0x01 1169ff77e468SPeter Zijlstra #define DEQUEUE_SAVE 0x02 /* matches ENQUEUE_RESTORE */ 1170ff77e468SPeter Zijlstra #define DEQUEUE_MOVE 0x04 /* matches ENQUEUE_MOVE */ 1171ff77e468SPeter Zijlstra 11721de64443SPeter Zijlstra #define ENQUEUE_WAKEUP 0x01 1173ff77e468SPeter Zijlstra #define ENQUEUE_RESTORE 0x02 1174ff77e468SPeter Zijlstra #define ENQUEUE_MOVE 0x04 1175ff77e468SPeter Zijlstra 1176ff77e468SPeter Zijlstra #define ENQUEUE_HEAD 0x08 1177ff77e468SPeter Zijlstra #define ENQUEUE_REPLENISH 0x10 1178c82ba9faSLi Zefan #ifdef CONFIG_SMP 1179ff77e468SPeter Zijlstra #define ENQUEUE_WAKING 0x20 1180c82ba9faSLi Zefan #else 11811de64443SPeter Zijlstra #define ENQUEUE_WAKING 0x00 1182c82ba9faSLi Zefan #endif 1183c82ba9faSLi Zefan 118437e117c0SPeter Zijlstra #define RETRY_TASK ((void *)-1UL) 118537e117c0SPeter Zijlstra 1186c82ba9faSLi Zefan struct sched_class { 1187c82ba9faSLi Zefan const struct sched_class *next; 1188c82ba9faSLi Zefan 1189c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 1190c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 1191c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 1192c82ba9faSLi Zefan bool (*yield_to_task) (struct rq *rq, struct task_struct *p, bool preempt); 1193c82ba9faSLi Zefan 1194c82ba9faSLi Zefan void (*check_preempt_curr) (struct rq *rq, struct task_struct *p, int flags); 1195c82ba9faSLi Zefan 1196606dba2eSPeter Zijlstra /* 1197606dba2eSPeter Zijlstra * It is the responsibility of the pick_next_task() method that will 1198606dba2eSPeter Zijlstra * return the next task to call put_prev_task() on the @prev task or 1199606dba2eSPeter Zijlstra * something equivalent. 120037e117c0SPeter Zijlstra * 120137e117c0SPeter Zijlstra * May return RETRY_TASK when it finds a higher prio class has runnable 120237e117c0SPeter Zijlstra * tasks. 1203606dba2eSPeter Zijlstra */ 1204606dba2eSPeter Zijlstra struct task_struct * (*pick_next_task) (struct rq *rq, 1205606dba2eSPeter Zijlstra struct task_struct *prev); 1206c82ba9faSLi Zefan void (*put_prev_task) (struct rq *rq, struct task_struct *p); 1207c82ba9faSLi Zefan 1208c82ba9faSLi Zefan #ifdef CONFIG_SMP 1209ac66f547SPeter Zijlstra int (*select_task_rq)(struct task_struct *p, int task_cpu, int sd_flag, int flags); 12105a4fd036Sxiaofeng.yan void (*migrate_task_rq)(struct task_struct *p); 1211c82ba9faSLi Zefan 1212c82ba9faSLi Zefan void (*task_waking) (struct task_struct *task); 1213c82ba9faSLi Zefan void (*task_woken) (struct rq *this_rq, struct task_struct *task); 1214c82ba9faSLi Zefan 1215c82ba9faSLi Zefan void (*set_cpus_allowed)(struct task_struct *p, 1216c82ba9faSLi Zefan const struct cpumask *newmask); 1217c82ba9faSLi Zefan 1218c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 1219c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 1220c82ba9faSLi Zefan #endif 1221c82ba9faSLi Zefan 1222c82ba9faSLi Zefan void (*set_curr_task) (struct rq *rq); 1223c82ba9faSLi Zefan void (*task_tick) (struct rq *rq, struct task_struct *p, int queued); 1224c82ba9faSLi Zefan void (*task_fork) (struct task_struct *p); 1225e6c390f2SDario Faggioli void (*task_dead) (struct task_struct *p); 1226c82ba9faSLi Zefan 122767dfa1b7SKirill Tkhai /* 122867dfa1b7SKirill Tkhai * The switched_from() call is allowed to drop rq->lock, therefore we 122967dfa1b7SKirill Tkhai * cannot assume the switched_from/switched_to pair is serliazed by 123067dfa1b7SKirill Tkhai * rq->lock. They are however serialized by p->pi_lock. 123167dfa1b7SKirill Tkhai */ 1232c82ba9faSLi Zefan void (*switched_from) (struct rq *this_rq, struct task_struct *task); 1233c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 1234c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 1235c82ba9faSLi Zefan int oldprio); 1236c82ba9faSLi Zefan 1237c82ba9faSLi Zefan unsigned int (*get_rr_interval) (struct rq *rq, 1238c82ba9faSLi Zefan struct task_struct *task); 1239c82ba9faSLi Zefan 12406e998916SStanislaw Gruszka void (*update_curr) (struct rq *rq); 12416e998916SStanislaw Gruszka 1242c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 1243bc54da21SPeter Zijlstra void (*task_move_group) (struct task_struct *p); 1244c82ba9faSLi Zefan #endif 1245c82ba9faSLi Zefan }; 1246391e43daSPeter Zijlstra 12473f1d2a31SPeter Zijlstra static inline void put_prev_task(struct rq *rq, struct task_struct *prev) 12483f1d2a31SPeter Zijlstra { 12493f1d2a31SPeter Zijlstra prev->sched_class->put_prev_task(rq, prev); 12503f1d2a31SPeter Zijlstra } 12513f1d2a31SPeter Zijlstra 1252391e43daSPeter Zijlstra #define sched_class_highest (&stop_sched_class) 1253391e43daSPeter Zijlstra #define for_each_class(class) \ 1254391e43daSPeter Zijlstra for (class = sched_class_highest; class; class = class->next) 1255391e43daSPeter Zijlstra 1256391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 1257aab03e05SDario Faggioli extern const struct sched_class dl_sched_class; 1258391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 1259391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 1260391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 1261391e43daSPeter Zijlstra 1262391e43daSPeter Zijlstra 1263391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1264391e43daSPeter Zijlstra 126563b2ca30SNicolas Pitre extern void update_group_capacity(struct sched_domain *sd, int cpu); 1266b719203bSLi Zefan 12677caff66fSDaniel Lezcano extern void trigger_load_balance(struct rq *rq); 1268391e43daSPeter Zijlstra 1269c5b28038SPeter Zijlstra extern void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask); 1270c5b28038SPeter Zijlstra 1271391e43daSPeter Zijlstra #endif 1272391e43daSPeter Zijlstra 1273442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 1274442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 1275442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 1276442bf3aaSDaniel Lezcano { 1277442bf3aaSDaniel Lezcano rq->idle_state = idle_state; 1278442bf3aaSDaniel Lezcano } 1279442bf3aaSDaniel Lezcano 1280442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 1281442bf3aaSDaniel Lezcano { 1282442bf3aaSDaniel Lezcano WARN_ON(!rcu_read_lock_held()); 1283442bf3aaSDaniel Lezcano return rq->idle_state; 1284442bf3aaSDaniel Lezcano } 1285442bf3aaSDaniel Lezcano #else 1286442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 1287442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 1288442bf3aaSDaniel Lezcano { 1289442bf3aaSDaniel Lezcano } 1290442bf3aaSDaniel Lezcano 1291442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 1292442bf3aaSDaniel Lezcano { 1293442bf3aaSDaniel Lezcano return NULL; 1294442bf3aaSDaniel Lezcano } 1295442bf3aaSDaniel Lezcano #endif 1296442bf3aaSDaniel Lezcano 1297391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 1298391e43daSPeter Zijlstra extern void sched_init_granularity(void); 1299391e43daSPeter Zijlstra extern void update_max_interval(void); 13001baca4ceSJuri Lelli 13011baca4ceSJuri Lelli extern void init_sched_dl_class(void); 1302391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 1303391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 1304391e43daSPeter Zijlstra 13058875125eSKirill Tkhai extern void resched_curr(struct rq *rq); 1306391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 1307391e43daSPeter Zijlstra 1308391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 1309391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 1310391e43daSPeter Zijlstra 1311332ac17eSDario Faggioli extern struct dl_bandwidth def_dl_bandwidth; 1312332ac17eSDario Faggioli extern void init_dl_bandwidth(struct dl_bandwidth *dl_b, u64 period, u64 runtime); 1313aab03e05SDario Faggioli extern void init_dl_task_timer(struct sched_dl_entity *dl_se); 1314aab03e05SDario Faggioli 1315332ac17eSDario Faggioli unsigned long to_ratio(u64 period, u64 runtime); 1316332ac17eSDario Faggioli 1317540247fbSYuyang Du extern void init_entity_runnable_average(struct sched_entity *se); 13182b8c41daSYuyang Du extern void post_init_entity_util_avg(struct sched_entity *se); 1319a75cdaa9SAlex Shi 132076d92ac3SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 132176d92ac3SFrederic Weisbecker extern bool sched_can_stop_tick(struct rq *rq); 132276d92ac3SFrederic Weisbecker 132376d92ac3SFrederic Weisbecker /* 132476d92ac3SFrederic Weisbecker * Tick may be needed by tasks in the runqueue depending on their policy and 132576d92ac3SFrederic Weisbecker * requirements. If tick is needed, lets send the target an IPI to kick it out of 132676d92ac3SFrederic Weisbecker * nohz mode if necessary. 132776d92ac3SFrederic Weisbecker */ 132876d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) 132976d92ac3SFrederic Weisbecker { 133076d92ac3SFrederic Weisbecker int cpu; 133176d92ac3SFrederic Weisbecker 133276d92ac3SFrederic Weisbecker if (!tick_nohz_full_enabled()) 133376d92ac3SFrederic Weisbecker return; 133476d92ac3SFrederic Weisbecker 133576d92ac3SFrederic Weisbecker cpu = cpu_of(rq); 133676d92ac3SFrederic Weisbecker 133776d92ac3SFrederic Weisbecker if (!tick_nohz_full_cpu(cpu)) 133876d92ac3SFrederic Weisbecker return; 133976d92ac3SFrederic Weisbecker 134076d92ac3SFrederic Weisbecker if (sched_can_stop_tick(rq)) 134176d92ac3SFrederic Weisbecker tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED); 134276d92ac3SFrederic Weisbecker else 134376d92ac3SFrederic Weisbecker tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED); 134476d92ac3SFrederic Weisbecker } 134576d92ac3SFrederic Weisbecker #else 134676d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) { } 134776d92ac3SFrederic Weisbecker #endif 134876d92ac3SFrederic Weisbecker 134972465447SKirill Tkhai static inline void add_nr_running(struct rq *rq, unsigned count) 1350391e43daSPeter Zijlstra { 135172465447SKirill Tkhai unsigned prev_nr = rq->nr_running; 135272465447SKirill Tkhai 135372465447SKirill Tkhai rq->nr_running = prev_nr + count; 13549f3660c2SFrederic Weisbecker 135572465447SKirill Tkhai if (prev_nr < 2 && rq->nr_running >= 2) { 13564486edd1STim Chen #ifdef CONFIG_SMP 13574486edd1STim Chen if (!rq->rd->overload) 13584486edd1STim Chen rq->rd->overload = true; 13594486edd1STim Chen #endif 136076d92ac3SFrederic Weisbecker } 13614486edd1STim Chen 136276d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 13634486edd1STim Chen } 1364391e43daSPeter Zijlstra 136572465447SKirill Tkhai static inline void sub_nr_running(struct rq *rq, unsigned count) 1366391e43daSPeter Zijlstra { 136772465447SKirill Tkhai rq->nr_running -= count; 136876d92ac3SFrederic Weisbecker /* Check if we still need preemption */ 136976d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 1370391e43daSPeter Zijlstra } 1371391e43daSPeter Zijlstra 1372265f22a9SFrederic Weisbecker static inline void rq_last_tick_reset(struct rq *rq) 1373265f22a9SFrederic Weisbecker { 1374265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 1375265f22a9SFrederic Weisbecker rq->last_sched_tick = jiffies; 1376265f22a9SFrederic Weisbecker #endif 1377265f22a9SFrederic Weisbecker } 1378265f22a9SFrederic Weisbecker 1379391e43daSPeter Zijlstra extern void update_rq_clock(struct rq *rq); 1380391e43daSPeter Zijlstra 1381391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 1382391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 1383391e43daSPeter Zijlstra 1384391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 1385391e43daSPeter Zijlstra 1386391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_time_avg; 1387391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 1388391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 1389391e43daSPeter Zijlstra 1390391e43daSPeter Zijlstra static inline u64 sched_avg_period(void) 1391391e43daSPeter Zijlstra { 1392391e43daSPeter Zijlstra return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; 1393391e43daSPeter Zijlstra } 1394391e43daSPeter Zijlstra 1395391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1396391e43daSPeter Zijlstra 1397391e43daSPeter Zijlstra /* 1398391e43daSPeter Zijlstra * Use hrtick when: 1399391e43daSPeter Zijlstra * - enabled by features 1400391e43daSPeter Zijlstra * - hrtimer is actually high res 1401391e43daSPeter Zijlstra */ 1402391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 1403391e43daSPeter Zijlstra { 1404391e43daSPeter Zijlstra if (!sched_feat(HRTICK)) 1405391e43daSPeter Zijlstra return 0; 1406391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 1407391e43daSPeter Zijlstra return 0; 1408391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 1409391e43daSPeter Zijlstra } 1410391e43daSPeter Zijlstra 1411391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 1412391e43daSPeter Zijlstra 1413b39e66eaSMike Galbraith #else 1414b39e66eaSMike Galbraith 1415b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 1416b39e66eaSMike Galbraith { 1417b39e66eaSMike Galbraith return 0; 1418b39e66eaSMike Galbraith } 1419b39e66eaSMike Galbraith 1420391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 1421391e43daSPeter Zijlstra 1422391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1423391e43daSPeter Zijlstra extern void sched_avg_update(struct rq *rq); 1424dfbca41fSPeter Zijlstra 1425dfbca41fSPeter Zijlstra #ifndef arch_scale_freq_capacity 1426dfbca41fSPeter Zijlstra static __always_inline 1427dfbca41fSPeter Zijlstra unsigned long arch_scale_freq_capacity(struct sched_domain *sd, int cpu) 1428dfbca41fSPeter Zijlstra { 1429dfbca41fSPeter Zijlstra return SCHED_CAPACITY_SCALE; 1430dfbca41fSPeter Zijlstra } 1431dfbca41fSPeter Zijlstra #endif 1432b5b4860dSVincent Guittot 14338cd5601cSMorten Rasmussen #ifndef arch_scale_cpu_capacity 14348cd5601cSMorten Rasmussen static __always_inline 14358cd5601cSMorten Rasmussen unsigned long arch_scale_cpu_capacity(struct sched_domain *sd, int cpu) 14368cd5601cSMorten Rasmussen { 1437e3279a2eSDietmar Eggemann if (sd && (sd->flags & SD_SHARE_CPUCAPACITY) && (sd->span_weight > 1)) 14388cd5601cSMorten Rasmussen return sd->smt_gain / sd->span_weight; 14398cd5601cSMorten Rasmussen 14408cd5601cSMorten Rasmussen return SCHED_CAPACITY_SCALE; 14418cd5601cSMorten Rasmussen } 14428cd5601cSMorten Rasmussen #endif 14438cd5601cSMorten Rasmussen 1444391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) 1445391e43daSPeter Zijlstra { 1446b5b4860dSVincent Guittot rq->rt_avg += rt_delta * arch_scale_freq_capacity(NULL, cpu_of(rq)); 1447391e43daSPeter Zijlstra sched_avg_update(rq); 1448391e43daSPeter Zijlstra } 1449391e43daSPeter Zijlstra #else 1450391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) { } 1451391e43daSPeter Zijlstra static inline void sched_avg_update(struct rq *rq) { } 1452391e43daSPeter Zijlstra #endif 1453391e43daSPeter Zijlstra 14543960c8c0SPeter Zijlstra /* 14553960c8c0SPeter Zijlstra * __task_rq_lock - lock the rq @p resides on. 14563960c8c0SPeter Zijlstra */ 14573960c8c0SPeter Zijlstra static inline struct rq *__task_rq_lock(struct task_struct *p) 14583960c8c0SPeter Zijlstra __acquires(rq->lock) 14593960c8c0SPeter Zijlstra { 14603960c8c0SPeter Zijlstra struct rq *rq; 14613960c8c0SPeter Zijlstra 14623960c8c0SPeter Zijlstra lockdep_assert_held(&p->pi_lock); 14633960c8c0SPeter Zijlstra 14643960c8c0SPeter Zijlstra for (;;) { 14653960c8c0SPeter Zijlstra rq = task_rq(p); 14663960c8c0SPeter Zijlstra raw_spin_lock(&rq->lock); 1467cbce1a68SPeter Zijlstra if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) { 1468cbce1a68SPeter Zijlstra lockdep_pin_lock(&rq->lock); 14693960c8c0SPeter Zijlstra return rq; 1470cbce1a68SPeter Zijlstra } 14713960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 14723960c8c0SPeter Zijlstra 14733960c8c0SPeter Zijlstra while (unlikely(task_on_rq_migrating(p))) 14743960c8c0SPeter Zijlstra cpu_relax(); 14753960c8c0SPeter Zijlstra } 14763960c8c0SPeter Zijlstra } 14773960c8c0SPeter Zijlstra 14783960c8c0SPeter Zijlstra /* 14793960c8c0SPeter Zijlstra * task_rq_lock - lock p->pi_lock and lock the rq @p resides on. 14803960c8c0SPeter Zijlstra */ 14813960c8c0SPeter Zijlstra static inline struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags) 14823960c8c0SPeter Zijlstra __acquires(p->pi_lock) 14833960c8c0SPeter Zijlstra __acquires(rq->lock) 14843960c8c0SPeter Zijlstra { 14853960c8c0SPeter Zijlstra struct rq *rq; 14863960c8c0SPeter Zijlstra 14873960c8c0SPeter Zijlstra for (;;) { 14883960c8c0SPeter Zijlstra raw_spin_lock_irqsave(&p->pi_lock, *flags); 14893960c8c0SPeter Zijlstra rq = task_rq(p); 14903960c8c0SPeter Zijlstra raw_spin_lock(&rq->lock); 14913960c8c0SPeter Zijlstra /* 14923960c8c0SPeter Zijlstra * move_queued_task() task_rq_lock() 14933960c8c0SPeter Zijlstra * 14943960c8c0SPeter Zijlstra * ACQUIRE (rq->lock) 14953960c8c0SPeter Zijlstra * [S] ->on_rq = MIGRATING [L] rq = task_rq() 14963960c8c0SPeter Zijlstra * WMB (__set_task_cpu()) ACQUIRE (rq->lock); 14973960c8c0SPeter Zijlstra * [S] ->cpu = new_cpu [L] task_rq() 14983960c8c0SPeter Zijlstra * [L] ->on_rq 14993960c8c0SPeter Zijlstra * RELEASE (rq->lock) 15003960c8c0SPeter Zijlstra * 15013960c8c0SPeter Zijlstra * If we observe the old cpu in task_rq_lock, the acquire of 15023960c8c0SPeter Zijlstra * the old rq->lock will fully serialize against the stores. 15033960c8c0SPeter Zijlstra * 15043960c8c0SPeter Zijlstra * If we observe the new cpu in task_rq_lock, the acquire will 15053960c8c0SPeter Zijlstra * pair with the WMB to ensure we must then also see migrating. 15063960c8c0SPeter Zijlstra */ 1507cbce1a68SPeter Zijlstra if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) { 1508cbce1a68SPeter Zijlstra lockdep_pin_lock(&rq->lock); 15093960c8c0SPeter Zijlstra return rq; 1510cbce1a68SPeter Zijlstra } 15113960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 15123960c8c0SPeter Zijlstra raw_spin_unlock_irqrestore(&p->pi_lock, *flags); 15133960c8c0SPeter Zijlstra 15143960c8c0SPeter Zijlstra while (unlikely(task_on_rq_migrating(p))) 15153960c8c0SPeter Zijlstra cpu_relax(); 15163960c8c0SPeter Zijlstra } 15173960c8c0SPeter Zijlstra } 15183960c8c0SPeter Zijlstra 15193960c8c0SPeter Zijlstra static inline void __task_rq_unlock(struct rq *rq) 15203960c8c0SPeter Zijlstra __releases(rq->lock) 15213960c8c0SPeter Zijlstra { 1522cbce1a68SPeter Zijlstra lockdep_unpin_lock(&rq->lock); 15233960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 15243960c8c0SPeter Zijlstra } 15253960c8c0SPeter Zijlstra 15263960c8c0SPeter Zijlstra static inline void 15273960c8c0SPeter Zijlstra task_rq_unlock(struct rq *rq, struct task_struct *p, unsigned long *flags) 15283960c8c0SPeter Zijlstra __releases(rq->lock) 15293960c8c0SPeter Zijlstra __releases(p->pi_lock) 15303960c8c0SPeter Zijlstra { 1531cbce1a68SPeter Zijlstra lockdep_unpin_lock(&rq->lock); 15323960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 15333960c8c0SPeter Zijlstra raw_spin_unlock_irqrestore(&p->pi_lock, *flags); 15343960c8c0SPeter Zijlstra } 15353960c8c0SPeter Zijlstra 1536391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1537391e43daSPeter Zijlstra #ifdef CONFIG_PREEMPT 1538391e43daSPeter Zijlstra 1539391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); 1540391e43daSPeter Zijlstra 1541391e43daSPeter Zijlstra /* 1542391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 1543391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 1544391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 1545391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 1546391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 1547391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 1548391e43daSPeter Zijlstra */ 1549391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1550391e43daSPeter Zijlstra __releases(this_rq->lock) 1551391e43daSPeter Zijlstra __acquires(busiest->lock) 1552391e43daSPeter Zijlstra __acquires(this_rq->lock) 1553391e43daSPeter Zijlstra { 1554391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1555391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 1556391e43daSPeter Zijlstra 1557391e43daSPeter Zijlstra return 1; 1558391e43daSPeter Zijlstra } 1559391e43daSPeter Zijlstra 1560391e43daSPeter Zijlstra #else 1561391e43daSPeter Zijlstra /* 1562391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 1563391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 1564391e43daSPeter Zijlstra * already in proper order on entry. This favors lower cpu-ids and will 1565391e43daSPeter Zijlstra * grant the double lock to lower cpus over higher ids under contention, 1566391e43daSPeter Zijlstra * regardless of entry order into the function. 1567391e43daSPeter Zijlstra */ 1568391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1569391e43daSPeter Zijlstra __releases(this_rq->lock) 1570391e43daSPeter Zijlstra __acquires(busiest->lock) 1571391e43daSPeter Zijlstra __acquires(this_rq->lock) 1572391e43daSPeter Zijlstra { 1573391e43daSPeter Zijlstra int ret = 0; 1574391e43daSPeter Zijlstra 1575391e43daSPeter Zijlstra if (unlikely(!raw_spin_trylock(&busiest->lock))) { 1576391e43daSPeter Zijlstra if (busiest < this_rq) { 1577391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1578391e43daSPeter Zijlstra raw_spin_lock(&busiest->lock); 1579391e43daSPeter Zijlstra raw_spin_lock_nested(&this_rq->lock, 1580391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1581391e43daSPeter Zijlstra ret = 1; 1582391e43daSPeter Zijlstra } else 1583391e43daSPeter Zijlstra raw_spin_lock_nested(&busiest->lock, 1584391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1585391e43daSPeter Zijlstra } 1586391e43daSPeter Zijlstra return ret; 1587391e43daSPeter Zijlstra } 1588391e43daSPeter Zijlstra 1589391e43daSPeter Zijlstra #endif /* CONFIG_PREEMPT */ 1590391e43daSPeter Zijlstra 1591391e43daSPeter Zijlstra /* 1592391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 1593391e43daSPeter Zijlstra */ 1594391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 1595391e43daSPeter Zijlstra { 1596391e43daSPeter Zijlstra if (unlikely(!irqs_disabled())) { 1597391e43daSPeter Zijlstra /* printk() doesn't work good under rq->lock */ 1598391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1599391e43daSPeter Zijlstra BUG_ON(1); 1600391e43daSPeter Zijlstra } 1601391e43daSPeter Zijlstra 1602391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 1603391e43daSPeter Zijlstra } 1604391e43daSPeter Zijlstra 1605391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 1606391e43daSPeter Zijlstra __releases(busiest->lock) 1607391e43daSPeter Zijlstra { 1608391e43daSPeter Zijlstra raw_spin_unlock(&busiest->lock); 1609391e43daSPeter Zijlstra lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); 1610391e43daSPeter Zijlstra } 1611391e43daSPeter Zijlstra 161274602315SPeter Zijlstra static inline void double_lock(spinlock_t *l1, spinlock_t *l2) 161374602315SPeter Zijlstra { 161474602315SPeter Zijlstra if (l1 > l2) 161574602315SPeter Zijlstra swap(l1, l2); 161674602315SPeter Zijlstra 161774602315SPeter Zijlstra spin_lock(l1); 161874602315SPeter Zijlstra spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 161974602315SPeter Zijlstra } 162074602315SPeter Zijlstra 162160e69eedSMike Galbraith static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2) 162260e69eedSMike Galbraith { 162360e69eedSMike Galbraith if (l1 > l2) 162460e69eedSMike Galbraith swap(l1, l2); 162560e69eedSMike Galbraith 162660e69eedSMike Galbraith spin_lock_irq(l1); 162760e69eedSMike Galbraith spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 162860e69eedSMike Galbraith } 162960e69eedSMike Galbraith 163074602315SPeter Zijlstra static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) 163174602315SPeter Zijlstra { 163274602315SPeter Zijlstra if (l1 > l2) 163374602315SPeter Zijlstra swap(l1, l2); 163474602315SPeter Zijlstra 163574602315SPeter Zijlstra raw_spin_lock(l1); 163674602315SPeter Zijlstra raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 163774602315SPeter Zijlstra } 163874602315SPeter Zijlstra 1639391e43daSPeter Zijlstra /* 1640391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1641391e43daSPeter Zijlstra * 1642391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1643391e43daSPeter Zijlstra * you need to do so manually before calling. 1644391e43daSPeter Zijlstra */ 1645391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1646391e43daSPeter Zijlstra __acquires(rq1->lock) 1647391e43daSPeter Zijlstra __acquires(rq2->lock) 1648391e43daSPeter Zijlstra { 1649391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1650391e43daSPeter Zijlstra if (rq1 == rq2) { 1651391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1652391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1653391e43daSPeter Zijlstra } else { 1654391e43daSPeter Zijlstra if (rq1 < rq2) { 1655391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1656391e43daSPeter Zijlstra raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); 1657391e43daSPeter Zijlstra } else { 1658391e43daSPeter Zijlstra raw_spin_lock(&rq2->lock); 1659391e43daSPeter Zijlstra raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); 1660391e43daSPeter Zijlstra } 1661391e43daSPeter Zijlstra } 1662391e43daSPeter Zijlstra } 1663391e43daSPeter Zijlstra 1664391e43daSPeter Zijlstra /* 1665391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1666391e43daSPeter Zijlstra * 1667391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1668391e43daSPeter Zijlstra * you need to do so manually after calling. 1669391e43daSPeter Zijlstra */ 1670391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1671391e43daSPeter Zijlstra __releases(rq1->lock) 1672391e43daSPeter Zijlstra __releases(rq2->lock) 1673391e43daSPeter Zijlstra { 1674391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1675391e43daSPeter Zijlstra if (rq1 != rq2) 1676391e43daSPeter Zijlstra raw_spin_unlock(&rq2->lock); 1677391e43daSPeter Zijlstra else 1678391e43daSPeter Zijlstra __release(rq2->lock); 1679391e43daSPeter Zijlstra } 1680391e43daSPeter Zijlstra 1681391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1682391e43daSPeter Zijlstra 1683391e43daSPeter Zijlstra /* 1684391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1685391e43daSPeter Zijlstra * 1686391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1687391e43daSPeter Zijlstra * you need to do so manually before calling. 1688391e43daSPeter Zijlstra */ 1689391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1690391e43daSPeter Zijlstra __acquires(rq1->lock) 1691391e43daSPeter Zijlstra __acquires(rq2->lock) 1692391e43daSPeter Zijlstra { 1693391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1694391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1695391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1696391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1697391e43daSPeter Zijlstra } 1698391e43daSPeter Zijlstra 1699391e43daSPeter Zijlstra /* 1700391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1701391e43daSPeter Zijlstra * 1702391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1703391e43daSPeter Zijlstra * you need to do so manually after calling. 1704391e43daSPeter Zijlstra */ 1705391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1706391e43daSPeter Zijlstra __releases(rq1->lock) 1707391e43daSPeter Zijlstra __releases(rq2->lock) 1708391e43daSPeter Zijlstra { 1709391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1710391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1711391e43daSPeter Zijlstra __release(rq2->lock); 1712391e43daSPeter Zijlstra } 1713391e43daSPeter Zijlstra 1714391e43daSPeter Zijlstra #endif 1715391e43daSPeter Zijlstra 1716391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 1717391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 17186b55c965SSrikar Dronamraju 17196b55c965SSrikar Dronamraju #ifdef CONFIG_SCHED_DEBUG 1720391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 1721391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 1722acb32132SWanpeng Li extern void print_dl_stats(struct seq_file *m, int cpu); 17236b55c965SSrikar Dronamraju extern void 17246b55c965SSrikar Dronamraju print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq); 1725397f2378SSrikar Dronamraju 1726397f2378SSrikar Dronamraju #ifdef CONFIG_NUMA_BALANCING 1727397f2378SSrikar Dronamraju extern void 1728397f2378SSrikar Dronamraju show_numa_stats(struct task_struct *p, struct seq_file *m); 1729397f2378SSrikar Dronamraju extern void 1730397f2378SSrikar Dronamraju print_numa_stats(struct seq_file *m, int node, unsigned long tsf, 1731397f2378SSrikar Dronamraju unsigned long tpf, unsigned long gsf, unsigned long gpf); 1732397f2378SSrikar Dronamraju #endif /* CONFIG_NUMA_BALANCING */ 1733397f2378SSrikar Dronamraju #endif /* CONFIG_SCHED_DEBUG */ 1734391e43daSPeter Zijlstra 1735391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 173607c54f7aSAbel Vesa extern void init_rt_rq(struct rt_rq *rt_rq); 173707c54f7aSAbel Vesa extern void init_dl_rq(struct dl_rq *dl_rq); 1738391e43daSPeter Zijlstra 17391ee14e6cSBen Segall extern void cfs_bandwidth_usage_inc(void); 17401ee14e6cSBen Segall extern void cfs_bandwidth_usage_dec(void); 17411c792db7SSuresh Siddha 17423451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 17431c792db7SSuresh Siddha enum rq_nohz_flag_bits { 17441c792db7SSuresh Siddha NOHZ_TICK_STOPPED, 17451c792db7SSuresh Siddha NOHZ_BALANCE_KICK, 17461c792db7SSuresh Siddha }; 17471c792db7SSuresh Siddha 17481c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 17491c792db7SSuresh Siddha #endif 175073fbec60SFrederic Weisbecker 175173fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 175273fbec60SFrederic Weisbecker 175373fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_hardirq_time); 175473fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_softirq_time); 175573fbec60SFrederic Weisbecker 175673fbec60SFrederic Weisbecker #ifndef CONFIG_64BIT 175773fbec60SFrederic Weisbecker DECLARE_PER_CPU(seqcount_t, irq_time_seq); 175873fbec60SFrederic Weisbecker 175973fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 176073fbec60SFrederic Weisbecker { 176173fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 176273fbec60SFrederic Weisbecker smp_wmb(); 176373fbec60SFrederic Weisbecker } 176473fbec60SFrederic Weisbecker 176573fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 176673fbec60SFrederic Weisbecker { 176773fbec60SFrederic Weisbecker smp_wmb(); 176873fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 176973fbec60SFrederic Weisbecker } 177073fbec60SFrederic Weisbecker 177173fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 177273fbec60SFrederic Weisbecker { 177373fbec60SFrederic Weisbecker u64 irq_time; 177473fbec60SFrederic Weisbecker unsigned seq; 177573fbec60SFrederic Weisbecker 177673fbec60SFrederic Weisbecker do { 177773fbec60SFrederic Weisbecker seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu)); 177873fbec60SFrederic Weisbecker irq_time = per_cpu(cpu_softirq_time, cpu) + 177973fbec60SFrederic Weisbecker per_cpu(cpu_hardirq_time, cpu); 178073fbec60SFrederic Weisbecker } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq)); 178173fbec60SFrederic Weisbecker 178273fbec60SFrederic Weisbecker return irq_time; 178373fbec60SFrederic Weisbecker } 178473fbec60SFrederic Weisbecker #else /* CONFIG_64BIT */ 178573fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 178673fbec60SFrederic Weisbecker { 178773fbec60SFrederic Weisbecker } 178873fbec60SFrederic Weisbecker 178973fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 179073fbec60SFrederic Weisbecker { 179173fbec60SFrederic Weisbecker } 179273fbec60SFrederic Weisbecker 179373fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 179473fbec60SFrederic Weisbecker { 179573fbec60SFrederic Weisbecker return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu); 179673fbec60SFrederic Weisbecker } 179773fbec60SFrederic Weisbecker #endif /* CONFIG_64BIT */ 179873fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 1799adaf9fcdSRafael J. Wysocki 1800adaf9fcdSRafael J. Wysocki #ifdef CONFIG_CPU_FREQ 1801adaf9fcdSRafael J. Wysocki DECLARE_PER_CPU(struct update_util_data *, cpufreq_update_util_data); 1802adaf9fcdSRafael J. Wysocki 1803adaf9fcdSRafael J. Wysocki /** 1804adaf9fcdSRafael J. Wysocki * cpufreq_update_util - Take a note about CPU utilization changes. 1805adaf9fcdSRafael J. Wysocki * @time: Current time. 1806adaf9fcdSRafael J. Wysocki * @util: Current utilization. 1807adaf9fcdSRafael J. Wysocki * @max: Utilization ceiling. 1808adaf9fcdSRafael J. Wysocki * 1809adaf9fcdSRafael J. Wysocki * This function is called by the scheduler on every invocation of 1810adaf9fcdSRafael J. Wysocki * update_load_avg() on the CPU whose utilization is being updated. 1811adaf9fcdSRafael J. Wysocki * 1812adaf9fcdSRafael J. Wysocki * It can only be called from RCU-sched read-side critical sections. 1813adaf9fcdSRafael J. Wysocki */ 1814adaf9fcdSRafael J. Wysocki static inline void cpufreq_update_util(u64 time, unsigned long util, unsigned long max) 1815adaf9fcdSRafael J. Wysocki { 1816adaf9fcdSRafael J. Wysocki struct update_util_data *data; 1817adaf9fcdSRafael J. Wysocki 1818adaf9fcdSRafael J. Wysocki data = rcu_dereference_sched(*this_cpu_ptr(&cpufreq_update_util_data)); 1819adaf9fcdSRafael J. Wysocki if (data) 1820adaf9fcdSRafael J. Wysocki data->func(data, time, util, max); 1821adaf9fcdSRafael J. Wysocki } 1822adaf9fcdSRafael J. Wysocki 1823adaf9fcdSRafael J. Wysocki /** 1824adaf9fcdSRafael J. Wysocki * cpufreq_trigger_update - Trigger CPU performance state evaluation if needed. 1825adaf9fcdSRafael J. Wysocki * @time: Current time. 1826adaf9fcdSRafael J. Wysocki * 1827adaf9fcdSRafael J. Wysocki * The way cpufreq is currently arranged requires it to evaluate the CPU 1828adaf9fcdSRafael J. Wysocki * performance state (frequency/voltage) on a regular basis to prevent it from 1829adaf9fcdSRafael J. Wysocki * being stuck in a completely inadequate performance level for too long. 1830adaf9fcdSRafael J. Wysocki * That is not guaranteed to happen if the updates are only triggered from CFS, 1831adaf9fcdSRafael J. Wysocki * though, because they may not be coming in if RT or deadline tasks are active 1832adaf9fcdSRafael J. Wysocki * all the time (or there are RT and DL tasks only). 1833adaf9fcdSRafael J. Wysocki * 1834adaf9fcdSRafael J. Wysocki * As a workaround for that issue, this function is called by the RT and DL 1835adaf9fcdSRafael J. Wysocki * sched classes to trigger extra cpufreq updates to prevent it from stalling, 1836adaf9fcdSRafael J. Wysocki * but that really is a band-aid. Going forward it should be replaced with 1837adaf9fcdSRafael J. Wysocki * solutions targeted more specifically at RT and DL tasks. 1838adaf9fcdSRafael J. Wysocki */ 1839adaf9fcdSRafael J. Wysocki static inline void cpufreq_trigger_update(u64 time) 1840adaf9fcdSRafael J. Wysocki { 1841adaf9fcdSRafael J. Wysocki cpufreq_update_util(time, ULONG_MAX, 0); 1842adaf9fcdSRafael J. Wysocki } 1843adaf9fcdSRafael J. Wysocki #else 1844adaf9fcdSRafael J. Wysocki static inline void cpufreq_update_util(u64 time, unsigned long util, unsigned long max) {} 1845adaf9fcdSRafael J. Wysocki static inline void cpufreq_trigger_update(u64 time) {} 1846adaf9fcdSRafael J. Wysocki #endif /* CONFIG_CPU_FREQ */ 1847be53f58fSLinus Torvalds 1848e9532e69SThomas Gleixner static inline void account_reset_rq(struct rq *rq) 1849e9532e69SThomas Gleixner { 1850e9532e69SThomas Gleixner #ifdef CONFIG_IRQ_TIME_ACCOUNTING 1851e9532e69SThomas Gleixner rq->prev_irq_time = 0; 1852e9532e69SThomas Gleixner #endif 1853e9532e69SThomas Gleixner #ifdef CONFIG_PARAVIRT 1854e9532e69SThomas Gleixner rq->prev_steal_time = 0; 1855e9532e69SThomas Gleixner #endif 1856e9532e69SThomas Gleixner #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 1857e9532e69SThomas Gleixner rq->prev_steal_time_rq = 0; 1858e9532e69SThomas Gleixner #endif 1859e9532e69SThomas Gleixner } 1860