1391e43daSPeter Zijlstra 2391e43daSPeter Zijlstra #include <linux/sched.h> 3dfc3401aSIngo Molnar #include <linux/sched/autogroup.h> 4cf4aebc2SClark Williams #include <linux/sched/sysctl.h> 5105ab3d8SIngo Molnar #include <linux/sched/topology.h> 68bd75c77SClark Williams #include <linux/sched/rt.h> 7ef8bd77fSIngo Molnar #include <linux/sched/deadline.h> 8e6017571SIngo Molnar #include <linux/sched/clock.h> 984f001e1SIngo Molnar #include <linux/sched/wake_q.h> 103f07c014SIngo Molnar #include <linux/sched/signal.h> 116a3827d7SIngo Molnar #include <linux/sched/numa_balancing.h> 126e84f315SIngo Molnar #include <linux/sched/mm.h> 1355687da1SIngo Molnar #include <linux/sched/cpufreq.h> 1403441a34SIngo Molnar #include <linux/sched/stat.h> 15370c9135SIngo Molnar #include <linux/sched/nohz.h> 16b17b0153SIngo Molnar #include <linux/sched/debug.h> 17ef8bd77fSIngo Molnar #include <linux/sched/hotplug.h> 1829930025SIngo Molnar #include <linux/sched/task.h> 1968db0cf1SIngo Molnar #include <linux/sched/task_stack.h> 2032ef5517SIngo Molnar #include <linux/sched/cputime.h> 211777e463SIngo Molnar #include <linux/sched/init.h> 22ef8bd77fSIngo Molnar 2319d23dbfSFrederic Weisbecker #include <linux/u64_stats_sync.h> 24a499a5a1SFrederic Weisbecker #include <linux/kernel_stat.h> 253866e845SSteven Rostedt (Red Hat) #include <linux/binfmts.h> 26391e43daSPeter Zijlstra #include <linux/mutex.h> 27391e43daSPeter Zijlstra #include <linux/spinlock.h> 28391e43daSPeter Zijlstra #include <linux/stop_machine.h> 29b6366f04SSteven Rostedt #include <linux/irq_work.h> 309f3660c2SFrederic Weisbecker #include <linux/tick.h> 31f809ca9aSMel Gorman #include <linux/slab.h> 32391e43daSPeter Zijlstra 337fce777cSIngo Molnar #ifdef CONFIG_PARAVIRT 347fce777cSIngo Molnar #include <asm/paravirt.h> 357fce777cSIngo Molnar #endif 367fce777cSIngo Molnar 37391e43daSPeter Zijlstra #include "cpupri.h" 386bfd6d72SJuri Lelli #include "cpudeadline.h" 3960fed789SLi Zefan #include "cpuacct.h" 40391e43daSPeter Zijlstra 419148a3a1SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 429148a3a1SPeter Zijlstra #define SCHED_WARN_ON(x) WARN_ONCE(x, #x) 439148a3a1SPeter Zijlstra #else 449148a3a1SPeter Zijlstra #define SCHED_WARN_ON(x) ((void)(x)) 459148a3a1SPeter Zijlstra #endif 469148a3a1SPeter Zijlstra 4745ceebf7SPaul Gortmaker struct rq; 48442bf3aaSDaniel Lezcano struct cpuidle_state; 4945ceebf7SPaul Gortmaker 50da0c1e65SKirill Tkhai /* task_struct::on_rq states: */ 51da0c1e65SKirill Tkhai #define TASK_ON_RQ_QUEUED 1 52cca26e80SKirill Tkhai #define TASK_ON_RQ_MIGRATING 2 53da0c1e65SKirill Tkhai 54391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 55391e43daSPeter Zijlstra 5645ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 5745ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 5845ceebf7SPaul Gortmaker 593289bdb4SPeter Zijlstra extern void calc_global_load_tick(struct rq *this_rq); 60d60585c5SThomas Gleixner extern long calc_load_fold_active(struct rq *this_rq, long adjust); 613289bdb4SPeter Zijlstra 623289bdb4SPeter Zijlstra #ifdef CONFIG_SMP 63cee1afceSFrederic Weisbecker extern void cpu_load_update_active(struct rq *this_rq); 643289bdb4SPeter Zijlstra #else 65cee1afceSFrederic Weisbecker static inline void cpu_load_update_active(struct rq *this_rq) { } 663289bdb4SPeter Zijlstra #endif 6745ceebf7SPaul Gortmaker 68391e43daSPeter Zijlstra /* 69391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 70391e43daSPeter Zijlstra */ 71391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 72391e43daSPeter Zijlstra 73cc1f4b1fSLi Zefan /* 74cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 75cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 76cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 77cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 78cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 79cc1f4b1fSLi Zefan * 80cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 812159197dSPeter Zijlstra * resolution (i.e. 64bit). The costs for increasing resolution when 32bit are 822159197dSPeter Zijlstra * pretty high and the returns do not justify the increased costs. 832159197dSPeter Zijlstra * 842159197dSPeter Zijlstra * Really only required when CONFIG_FAIR_GROUP_SCHED is also set, but to 852159197dSPeter Zijlstra * increase coverage and consistency always enable it on 64bit platforms. 86cc1f4b1fSLi Zefan */ 872159197dSPeter Zijlstra #ifdef CONFIG_64BIT 88172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT + SCHED_FIXEDPOINT_SHIFT) 896ecdd749SYuyang Du # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT) 906ecdd749SYuyang Du # define scale_load_down(w) ((w) >> SCHED_FIXEDPOINT_SHIFT) 91cc1f4b1fSLi Zefan #else 92172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT) 93cc1f4b1fSLi Zefan # define scale_load(w) (w) 94cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 95cc1f4b1fSLi Zefan #endif 96cc1f4b1fSLi Zefan 976ecdd749SYuyang Du /* 98172895e6SYuyang Du * Task weight (visible to users) and its load (invisible to users) have 99172895e6SYuyang Du * independent resolution, but they should be well calibrated. We use 100172895e6SYuyang Du * scale_load() and scale_load_down(w) to convert between them. The 101172895e6SYuyang Du * following must be true: 102172895e6SYuyang Du * 103172895e6SYuyang Du * scale_load(sched_prio_to_weight[USER_PRIO(NICE_TO_PRIO(0))]) == NICE_0_LOAD 104172895e6SYuyang Du * 1056ecdd749SYuyang Du */ 106172895e6SYuyang Du #define NICE_0_LOAD (1L << NICE_0_LOAD_SHIFT) 107391e43daSPeter Zijlstra 108391e43daSPeter Zijlstra /* 109332ac17eSDario Faggioli * Single value that decides SCHED_DEADLINE internal math precision. 110332ac17eSDario Faggioli * 10 -> just above 1us 111332ac17eSDario Faggioli * 9 -> just above 0.5us 112332ac17eSDario Faggioli */ 113332ac17eSDario Faggioli #define DL_SCALE (10) 114332ac17eSDario Faggioli 115332ac17eSDario Faggioli /* 116391e43daSPeter Zijlstra * These are the 'tuning knobs' of the scheduler: 117391e43daSPeter Zijlstra */ 118391e43daSPeter Zijlstra 119391e43daSPeter Zijlstra /* 120391e43daSPeter Zijlstra * single value that denotes runtime == period, ie unlimited time. 121391e43daSPeter Zijlstra */ 122391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 123391e43daSPeter Zijlstra 12420f9cd2aSHenrik Austad static inline int idle_policy(int policy) 12520f9cd2aSHenrik Austad { 12620f9cd2aSHenrik Austad return policy == SCHED_IDLE; 12720f9cd2aSHenrik Austad } 128d50dde5aSDario Faggioli static inline int fair_policy(int policy) 129d50dde5aSDario Faggioli { 130d50dde5aSDario Faggioli return policy == SCHED_NORMAL || policy == SCHED_BATCH; 131d50dde5aSDario Faggioli } 132d50dde5aSDario Faggioli 133391e43daSPeter Zijlstra static inline int rt_policy(int policy) 134391e43daSPeter Zijlstra { 135d50dde5aSDario Faggioli return policy == SCHED_FIFO || policy == SCHED_RR; 136391e43daSPeter Zijlstra } 137391e43daSPeter Zijlstra 138aab03e05SDario Faggioli static inline int dl_policy(int policy) 139aab03e05SDario Faggioli { 140aab03e05SDario Faggioli return policy == SCHED_DEADLINE; 141aab03e05SDario Faggioli } 14220f9cd2aSHenrik Austad static inline bool valid_policy(int policy) 14320f9cd2aSHenrik Austad { 14420f9cd2aSHenrik Austad return idle_policy(policy) || fair_policy(policy) || 14520f9cd2aSHenrik Austad rt_policy(policy) || dl_policy(policy); 14620f9cd2aSHenrik Austad } 147aab03e05SDario Faggioli 148391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 149391e43daSPeter Zijlstra { 150391e43daSPeter Zijlstra return rt_policy(p->policy); 151391e43daSPeter Zijlstra } 152391e43daSPeter Zijlstra 153aab03e05SDario Faggioli static inline int task_has_dl_policy(struct task_struct *p) 154aab03e05SDario Faggioli { 155aab03e05SDario Faggioli return dl_policy(p->policy); 156aab03e05SDario Faggioli } 157aab03e05SDario Faggioli 1582d3d891dSDario Faggioli /* 1592d3d891dSDario Faggioli * Tells if entity @a should preempt entity @b. 1602d3d891dSDario Faggioli */ 161332ac17eSDario Faggioli static inline bool 162332ac17eSDario Faggioli dl_entity_preempt(struct sched_dl_entity *a, struct sched_dl_entity *b) 1632d3d891dSDario Faggioli { 1642d3d891dSDario Faggioli return dl_time_before(a->deadline, b->deadline); 1652d3d891dSDario Faggioli } 1662d3d891dSDario Faggioli 167391e43daSPeter Zijlstra /* 168391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 169391e43daSPeter Zijlstra */ 170391e43daSPeter Zijlstra struct rt_prio_array { 171391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 172391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 173391e43daSPeter Zijlstra }; 174391e43daSPeter Zijlstra 175391e43daSPeter Zijlstra struct rt_bandwidth { 176391e43daSPeter Zijlstra /* nests inside the rq lock: */ 177391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 178391e43daSPeter Zijlstra ktime_t rt_period; 179391e43daSPeter Zijlstra u64 rt_runtime; 180391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 1814cfafd30SPeter Zijlstra unsigned int rt_period_active; 182391e43daSPeter Zijlstra }; 183a5e7be3bSJuri Lelli 184a5e7be3bSJuri Lelli void __dl_clear_params(struct task_struct *p); 185a5e7be3bSJuri Lelli 186332ac17eSDario Faggioli /* 187332ac17eSDario Faggioli * To keep the bandwidth of -deadline tasks and groups under control 188332ac17eSDario Faggioli * we need some place where: 189332ac17eSDario Faggioli * - store the maximum -deadline bandwidth of the system (the group); 190332ac17eSDario Faggioli * - cache the fraction of that bandwidth that is currently allocated. 191332ac17eSDario Faggioli * 192332ac17eSDario Faggioli * This is all done in the data structure below. It is similar to the 193332ac17eSDario Faggioli * one used for RT-throttling (rt_bandwidth), with the main difference 194332ac17eSDario Faggioli * that, since here we are only interested in admission control, we 195332ac17eSDario Faggioli * do not decrease any runtime while the group "executes", neither we 196332ac17eSDario Faggioli * need a timer to replenish it. 197332ac17eSDario Faggioli * 198332ac17eSDario Faggioli * With respect to SMP, the bandwidth is given on a per-CPU basis, 199332ac17eSDario Faggioli * meaning that: 200332ac17eSDario Faggioli * - dl_bw (< 100%) is the bandwidth of the system (group) on each CPU; 201332ac17eSDario Faggioli * - dl_total_bw array contains, in the i-eth element, the currently 202332ac17eSDario Faggioli * allocated bandwidth on the i-eth CPU. 203332ac17eSDario Faggioli * Moreover, groups consume bandwidth on each CPU, while tasks only 204332ac17eSDario Faggioli * consume bandwidth on the CPU they're running on. 205332ac17eSDario Faggioli * Finally, dl_total_bw_cpu is used to cache the index of dl_total_bw 206332ac17eSDario Faggioli * that will be shown the next time the proc or cgroup controls will 207332ac17eSDario Faggioli * be red. It on its turn can be changed by writing on its own 208332ac17eSDario Faggioli * control. 209332ac17eSDario Faggioli */ 210332ac17eSDario Faggioli struct dl_bandwidth { 211332ac17eSDario Faggioli raw_spinlock_t dl_runtime_lock; 212332ac17eSDario Faggioli u64 dl_runtime; 213332ac17eSDario Faggioli u64 dl_period; 214332ac17eSDario Faggioli }; 215332ac17eSDario Faggioli 216332ac17eSDario Faggioli static inline int dl_bandwidth_enabled(void) 217332ac17eSDario Faggioli { 2181724813dSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 219332ac17eSDario Faggioli } 220332ac17eSDario Faggioli 221332ac17eSDario Faggioli extern struct dl_bw *dl_bw_of(int i); 222332ac17eSDario Faggioli 223332ac17eSDario Faggioli struct dl_bw { 224332ac17eSDario Faggioli raw_spinlock_t lock; 225332ac17eSDario Faggioli u64 bw, total_bw; 226332ac17eSDario Faggioli }; 227332ac17eSDario Faggioli 2287f51412aSJuri Lelli static inline 2297f51412aSJuri Lelli void __dl_clear(struct dl_bw *dl_b, u64 tsk_bw) 2307f51412aSJuri Lelli { 2317f51412aSJuri Lelli dl_b->total_bw -= tsk_bw; 2327f51412aSJuri Lelli } 2337f51412aSJuri Lelli 2347f51412aSJuri Lelli static inline 2357f51412aSJuri Lelli void __dl_add(struct dl_bw *dl_b, u64 tsk_bw) 2367f51412aSJuri Lelli { 2377f51412aSJuri Lelli dl_b->total_bw += tsk_bw; 2387f51412aSJuri Lelli } 2397f51412aSJuri Lelli 2407f51412aSJuri Lelli static inline 2417f51412aSJuri Lelli bool __dl_overflow(struct dl_bw *dl_b, int cpus, u64 old_bw, u64 new_bw) 2427f51412aSJuri Lelli { 2437f51412aSJuri Lelli return dl_b->bw != -1 && 2447f51412aSJuri Lelli dl_b->bw * cpus < dl_b->total_bw - old_bw + new_bw; 2457f51412aSJuri Lelli } 2467f51412aSJuri Lelli 247*209a0cbdSLuca Abeni void dl_change_utilization(struct task_struct *p, u64 new_bw); 248f2cb1360SIngo Molnar extern void init_dl_bw(struct dl_bw *dl_b); 249391e43daSPeter Zijlstra 250391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 251391e43daSPeter Zijlstra 252391e43daSPeter Zijlstra #include <linux/cgroup.h> 253391e43daSPeter Zijlstra 254391e43daSPeter Zijlstra struct cfs_rq; 255391e43daSPeter Zijlstra struct rt_rq; 256391e43daSPeter Zijlstra 25735cf4e50SMike Galbraith extern struct list_head task_groups; 258391e43daSPeter Zijlstra 259391e43daSPeter Zijlstra struct cfs_bandwidth { 260391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 261391e43daSPeter Zijlstra raw_spinlock_t lock; 262391e43daSPeter Zijlstra ktime_t period; 263391e43daSPeter Zijlstra u64 quota, runtime; 2649c58c79aSZhihui Zhang s64 hierarchical_quota; 265391e43daSPeter Zijlstra u64 runtime_expires; 266391e43daSPeter Zijlstra 2674cfafd30SPeter Zijlstra int idle, period_active; 268391e43daSPeter Zijlstra struct hrtimer period_timer, slack_timer; 269391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 270391e43daSPeter Zijlstra 271391e43daSPeter Zijlstra /* statistics */ 272391e43daSPeter Zijlstra int nr_periods, nr_throttled; 273391e43daSPeter Zijlstra u64 throttled_time; 274391e43daSPeter Zijlstra #endif 275391e43daSPeter Zijlstra }; 276391e43daSPeter Zijlstra 277391e43daSPeter Zijlstra /* task group related information */ 278391e43daSPeter Zijlstra struct task_group { 279391e43daSPeter Zijlstra struct cgroup_subsys_state css; 280391e43daSPeter Zijlstra 281391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 282391e43daSPeter Zijlstra /* schedulable entities of this group on each cpu */ 283391e43daSPeter Zijlstra struct sched_entity **se; 284391e43daSPeter Zijlstra /* runqueue "owned" by this group on each cpu */ 285391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 286391e43daSPeter Zijlstra unsigned long shares; 287391e43daSPeter Zijlstra 288fa6bddebSAlex Shi #ifdef CONFIG_SMP 289b0367629SWaiman Long /* 290b0367629SWaiman Long * load_avg can be heavily contended at clock tick time, so put 291b0367629SWaiman Long * it in its own cacheline separated from the fields above which 292b0367629SWaiman Long * will also be accessed at each tick. 293b0367629SWaiman Long */ 294b0367629SWaiman Long atomic_long_t load_avg ____cacheline_aligned; 295391e43daSPeter Zijlstra #endif 296fa6bddebSAlex Shi #endif 297391e43daSPeter Zijlstra 298391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 299391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 300391e43daSPeter Zijlstra struct rt_rq **rt_rq; 301391e43daSPeter Zijlstra 302391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 303391e43daSPeter Zijlstra #endif 304391e43daSPeter Zijlstra 305391e43daSPeter Zijlstra struct rcu_head rcu; 306391e43daSPeter Zijlstra struct list_head list; 307391e43daSPeter Zijlstra 308391e43daSPeter Zijlstra struct task_group *parent; 309391e43daSPeter Zijlstra struct list_head siblings; 310391e43daSPeter Zijlstra struct list_head children; 311391e43daSPeter Zijlstra 312391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 313391e43daSPeter Zijlstra struct autogroup *autogroup; 314391e43daSPeter Zijlstra #endif 315391e43daSPeter Zijlstra 316391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 317391e43daSPeter Zijlstra }; 318391e43daSPeter Zijlstra 319391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 320391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 321391e43daSPeter Zijlstra 322391e43daSPeter Zijlstra /* 323391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 324391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 325391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 326391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 327391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 328391e43daSPeter Zijlstra * limitation from this.) 329391e43daSPeter Zijlstra */ 330391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 331391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 332391e43daSPeter Zijlstra #endif 333391e43daSPeter Zijlstra 334391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 335391e43daSPeter Zijlstra 336391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 337391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 338391e43daSPeter Zijlstra 339391e43daSPeter Zijlstra /* 340391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 341391e43daSPeter Zijlstra * leaving it for the final time. 342391e43daSPeter Zijlstra * 343391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 344391e43daSPeter Zijlstra */ 345391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 346391e43daSPeter Zijlstra { 347391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 348391e43daSPeter Zijlstra } 349391e43daSPeter Zijlstra 350391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 351391e43daSPeter Zijlstra 352391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 353391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 3548663e24dSPeter Zijlstra extern void online_fair_sched_group(struct task_group *tg); 3556fe1f348SPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg); 356391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 357391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 358391e43daSPeter Zijlstra struct sched_entity *parent); 359391e43daSPeter Zijlstra extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 360391e43daSPeter Zijlstra 361391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 36277a4d1a1SPeter Zijlstra extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 363391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 364391e43daSPeter Zijlstra 365391e43daSPeter Zijlstra extern void free_rt_sched_group(struct task_group *tg); 366391e43daSPeter Zijlstra extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 367391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 368391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 369391e43daSPeter Zijlstra struct sched_rt_entity *parent); 370391e43daSPeter Zijlstra 37125cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 37225cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 37325cc7da7SLi Zefan struct task_group *parent); 37425cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 37525cc7da7SLi Zefan extern void sched_offline_group(struct task_group *tg); 37625cc7da7SLi Zefan 37725cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 37825cc7da7SLi Zefan 37925cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 38025cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 381ad936d86SByungchul Park 382ad936d86SByungchul Park #ifdef CONFIG_SMP 383ad936d86SByungchul Park extern void set_task_rq_fair(struct sched_entity *se, 384ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next); 385ad936d86SByungchul Park #else /* !CONFIG_SMP */ 386ad936d86SByungchul Park static inline void set_task_rq_fair(struct sched_entity *se, 387ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next) { } 388ad936d86SByungchul Park #endif /* CONFIG_SMP */ 389ad936d86SByungchul Park #endif /* CONFIG_FAIR_GROUP_SCHED */ 39025cc7da7SLi Zefan 391391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 392391e43daSPeter Zijlstra 393391e43daSPeter Zijlstra struct cfs_bandwidth { }; 394391e43daSPeter Zijlstra 395391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 396391e43daSPeter Zijlstra 397391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 398391e43daSPeter Zijlstra struct cfs_rq { 399391e43daSPeter Zijlstra struct load_weight load; 400c82513e5SPeter Zijlstra unsigned int nr_running, h_nr_running; 401391e43daSPeter Zijlstra 402391e43daSPeter Zijlstra u64 exec_clock; 403391e43daSPeter Zijlstra u64 min_vruntime; 404391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 405391e43daSPeter Zijlstra u64 min_vruntime_copy; 406391e43daSPeter Zijlstra #endif 407391e43daSPeter Zijlstra 408391e43daSPeter Zijlstra struct rb_root tasks_timeline; 409391e43daSPeter Zijlstra struct rb_node *rb_leftmost; 410391e43daSPeter Zijlstra 411391e43daSPeter Zijlstra /* 412391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 413391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 414391e43daSPeter Zijlstra */ 415391e43daSPeter Zijlstra struct sched_entity *curr, *next, *last, *skip; 416391e43daSPeter Zijlstra 417391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 418391e43daSPeter Zijlstra unsigned int nr_spread_over; 419391e43daSPeter Zijlstra #endif 420391e43daSPeter Zijlstra 4212dac754eSPaul Turner #ifdef CONFIG_SMP 4222dac754eSPaul Turner /* 4239d89c257SYuyang Du * CFS load tracking 4242dac754eSPaul Turner */ 4259d89c257SYuyang Du struct sched_avg avg; 42613962234SYuyang Du u64 runnable_load_sum; 42713962234SYuyang Du unsigned long runnable_load_avg; 4289d89c257SYuyang Du #ifdef CONFIG_FAIR_GROUP_SCHED 4299d89c257SYuyang Du unsigned long tg_load_avg_contrib; 43009a43aceSVincent Guittot unsigned long propagate_avg; 4319d89c257SYuyang Du #endif 4329d89c257SYuyang Du atomic_long_t removed_load_avg, removed_util_avg; 4339d89c257SYuyang Du #ifndef CONFIG_64BIT 4349d89c257SYuyang Du u64 load_last_update_time_copy; 4359d89c257SYuyang Du #endif 436141965c7SAlex Shi 437c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 43882958366SPaul Turner /* 43982958366SPaul Turner * h_load = weight * f(tg) 44082958366SPaul Turner * 44182958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 44282958366SPaul Turner * this group. 44382958366SPaul Turner */ 44482958366SPaul Turner unsigned long h_load; 44568520796SVladimir Davydov u64 last_h_load_update; 44668520796SVladimir Davydov struct sched_entity *h_load_next; 44768520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 44882958366SPaul Turner #endif /* CONFIG_SMP */ 44982958366SPaul Turner 450391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 451391e43daSPeter Zijlstra struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ 452391e43daSPeter Zijlstra 453391e43daSPeter Zijlstra /* 454391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 455391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 456391e43daSPeter Zijlstra * (like users, containers etc.) 457391e43daSPeter Zijlstra * 458391e43daSPeter Zijlstra * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This 459391e43daSPeter Zijlstra * list is used during load balance. 460391e43daSPeter Zijlstra */ 461391e43daSPeter Zijlstra int on_list; 462391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 463391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 464391e43daSPeter Zijlstra 465391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 466391e43daSPeter Zijlstra int runtime_enabled; 467391e43daSPeter Zijlstra u64 runtime_expires; 468391e43daSPeter Zijlstra s64 runtime_remaining; 469391e43daSPeter Zijlstra 470f1b17280SPaul Turner u64 throttled_clock, throttled_clock_task; 471f1b17280SPaul Turner u64 throttled_clock_task_time; 47255e16d30SPeter Zijlstra int throttled, throttle_count; 473391e43daSPeter Zijlstra struct list_head throttled_list; 474391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 475391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 476391e43daSPeter Zijlstra }; 477391e43daSPeter Zijlstra 478391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 479391e43daSPeter Zijlstra { 480391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 481391e43daSPeter Zijlstra } 482391e43daSPeter Zijlstra 483b6366f04SSteven Rostedt /* RT IPI pull logic requires IRQ_WORK */ 484b6366f04SSteven Rostedt #ifdef CONFIG_IRQ_WORK 485b6366f04SSteven Rostedt # define HAVE_RT_PUSH_IPI 486b6366f04SSteven Rostedt #endif 487b6366f04SSteven Rostedt 488391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 489391e43daSPeter Zijlstra struct rt_rq { 490391e43daSPeter Zijlstra struct rt_prio_array active; 491c82513e5SPeter Zijlstra unsigned int rt_nr_running; 49201d36d0aSFrederic Weisbecker unsigned int rr_nr_running; 493391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 494391e43daSPeter Zijlstra struct { 495391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 496391e43daSPeter Zijlstra #ifdef CONFIG_SMP 497391e43daSPeter Zijlstra int next; /* next highest */ 498391e43daSPeter Zijlstra #endif 499391e43daSPeter Zijlstra } highest_prio; 500391e43daSPeter Zijlstra #endif 501391e43daSPeter Zijlstra #ifdef CONFIG_SMP 502391e43daSPeter Zijlstra unsigned long rt_nr_migratory; 503391e43daSPeter Zijlstra unsigned long rt_nr_total; 504391e43daSPeter Zijlstra int overloaded; 505391e43daSPeter Zijlstra struct plist_head pushable_tasks; 506b6366f04SSteven Rostedt #ifdef HAVE_RT_PUSH_IPI 507b6366f04SSteven Rostedt int push_flags; 508b6366f04SSteven Rostedt int push_cpu; 509b6366f04SSteven Rostedt struct irq_work push_work; 510b6366f04SSteven Rostedt raw_spinlock_t push_lock; 511391e43daSPeter Zijlstra #endif 512b6366f04SSteven Rostedt #endif /* CONFIG_SMP */ 513f4ebcbc0SKirill Tkhai int rt_queued; 514f4ebcbc0SKirill Tkhai 515391e43daSPeter Zijlstra int rt_throttled; 516391e43daSPeter Zijlstra u64 rt_time; 517391e43daSPeter Zijlstra u64 rt_runtime; 518391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 519391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 520391e43daSPeter Zijlstra 521391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 522391e43daSPeter Zijlstra unsigned long rt_nr_boosted; 523391e43daSPeter Zijlstra 524391e43daSPeter Zijlstra struct rq *rq; 525391e43daSPeter Zijlstra struct task_group *tg; 526391e43daSPeter Zijlstra #endif 527391e43daSPeter Zijlstra }; 528391e43daSPeter Zijlstra 529aab03e05SDario Faggioli /* Deadline class' related fields in a runqueue */ 530aab03e05SDario Faggioli struct dl_rq { 531aab03e05SDario Faggioli /* runqueue is an rbtree, ordered by deadline */ 532aab03e05SDario Faggioli struct rb_root rb_root; 533aab03e05SDario Faggioli struct rb_node *rb_leftmost; 534aab03e05SDario Faggioli 535aab03e05SDario Faggioli unsigned long dl_nr_running; 5361baca4ceSJuri Lelli 5371baca4ceSJuri Lelli #ifdef CONFIG_SMP 5381baca4ceSJuri Lelli /* 5391baca4ceSJuri Lelli * Deadline values of the currently executing and the 5401baca4ceSJuri Lelli * earliest ready task on this rq. Caching these facilitates 5411baca4ceSJuri Lelli * the decision wether or not a ready but not running task 5421baca4ceSJuri Lelli * should migrate somewhere else. 5431baca4ceSJuri Lelli */ 5441baca4ceSJuri Lelli struct { 5451baca4ceSJuri Lelli u64 curr; 5461baca4ceSJuri Lelli u64 next; 5471baca4ceSJuri Lelli } earliest_dl; 5481baca4ceSJuri Lelli 5491baca4ceSJuri Lelli unsigned long dl_nr_migratory; 5501baca4ceSJuri Lelli int overloaded; 5511baca4ceSJuri Lelli 5521baca4ceSJuri Lelli /* 5531baca4ceSJuri Lelli * Tasks on this rq that can be pushed away. They are kept in 5541baca4ceSJuri Lelli * an rb-tree, ordered by tasks' deadlines, with caching 5551baca4ceSJuri Lelli * of the leftmost (earliest deadline) element. 5561baca4ceSJuri Lelli */ 5571baca4ceSJuri Lelli struct rb_root pushable_dl_tasks_root; 5581baca4ceSJuri Lelli struct rb_node *pushable_dl_tasks_leftmost; 559332ac17eSDario Faggioli #else 560332ac17eSDario Faggioli struct dl_bw dl_bw; 5611baca4ceSJuri Lelli #endif 562e36d8677SLuca Abeni /* 563e36d8677SLuca Abeni * "Active utilization" for this runqueue: increased when a 564e36d8677SLuca Abeni * task wakes up (becomes TASK_RUNNING) and decreased when a 565e36d8677SLuca Abeni * task blocks 566e36d8677SLuca Abeni */ 567e36d8677SLuca Abeni u64 running_bw; 568aab03e05SDario Faggioli }; 569aab03e05SDario Faggioli 570391e43daSPeter Zijlstra #ifdef CONFIG_SMP 571391e43daSPeter Zijlstra 572afe06efdSTim Chen static inline bool sched_asym_prefer(int a, int b) 573afe06efdSTim Chen { 574afe06efdSTim Chen return arch_asym_cpu_priority(a) > arch_asym_cpu_priority(b); 575afe06efdSTim Chen } 576afe06efdSTim Chen 577391e43daSPeter Zijlstra /* 578391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 579391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 580391e43daSPeter Zijlstra * fully partitioning the member cpus from any other cpuset. Whenever a new 581391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 582391e43daSPeter Zijlstra * object. 583391e43daSPeter Zijlstra * 584391e43daSPeter Zijlstra */ 585391e43daSPeter Zijlstra struct root_domain { 586391e43daSPeter Zijlstra atomic_t refcount; 587391e43daSPeter Zijlstra atomic_t rto_count; 588391e43daSPeter Zijlstra struct rcu_head rcu; 589391e43daSPeter Zijlstra cpumask_var_t span; 590391e43daSPeter Zijlstra cpumask_var_t online; 591391e43daSPeter Zijlstra 5924486edd1STim Chen /* Indicate more than one runnable task for any CPU */ 5934486edd1STim Chen bool overload; 5944486edd1STim Chen 595391e43daSPeter Zijlstra /* 5961baca4ceSJuri Lelli * The bit corresponding to a CPU gets set here if such CPU has more 5971baca4ceSJuri Lelli * than one runnable -deadline task (as it is below for RT tasks). 5981baca4ceSJuri Lelli */ 5991baca4ceSJuri Lelli cpumask_var_t dlo_mask; 6001baca4ceSJuri Lelli atomic_t dlo_count; 601332ac17eSDario Faggioli struct dl_bw dl_bw; 6026bfd6d72SJuri Lelli struct cpudl cpudl; 6031baca4ceSJuri Lelli 6041baca4ceSJuri Lelli /* 605391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 606391e43daSPeter Zijlstra * one runnable RT task. 607391e43daSPeter Zijlstra */ 608391e43daSPeter Zijlstra cpumask_var_t rto_mask; 609391e43daSPeter Zijlstra struct cpupri cpupri; 610cd92bfd3SDietmar Eggemann 611cd92bfd3SDietmar Eggemann unsigned long max_cpu_capacity; 612391e43daSPeter Zijlstra }; 613391e43daSPeter Zijlstra 614391e43daSPeter Zijlstra extern struct root_domain def_root_domain; 615f2cb1360SIngo Molnar extern struct mutex sched_domains_mutex; 616f2cb1360SIngo Molnar 617f2cb1360SIngo Molnar extern void init_defrootdomain(void); 6188d5dc512SPeter Zijlstra extern int sched_init_domains(const struct cpumask *cpu_map); 619f2cb1360SIngo Molnar extern void rq_attach_root(struct rq *rq, struct root_domain *rd); 620391e43daSPeter Zijlstra 621391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 622391e43daSPeter Zijlstra 623391e43daSPeter Zijlstra /* 624391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 625391e43daSPeter Zijlstra * 626391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 627391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 628391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 629391e43daSPeter Zijlstra */ 630391e43daSPeter Zijlstra struct rq { 631391e43daSPeter Zijlstra /* runqueue lock: */ 632391e43daSPeter Zijlstra raw_spinlock_t lock; 633391e43daSPeter Zijlstra 634391e43daSPeter Zijlstra /* 635391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 636391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 637391e43daSPeter Zijlstra */ 638c82513e5SPeter Zijlstra unsigned int nr_running; 6390ec8aa00SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 6400ec8aa00SPeter Zijlstra unsigned int nr_numa_running; 6410ec8aa00SPeter Zijlstra unsigned int nr_preferred_running; 6420ec8aa00SPeter Zijlstra #endif 643391e43daSPeter Zijlstra #define CPU_LOAD_IDX_MAX 5 644391e43daSPeter Zijlstra unsigned long cpu_load[CPU_LOAD_IDX_MAX]; 6453451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 6469fd81dd5SFrederic Weisbecker #ifdef CONFIG_SMP 6479fd81dd5SFrederic Weisbecker unsigned long last_load_update_tick; 6489fd81dd5SFrederic Weisbecker #endif /* CONFIG_SMP */ 6491c792db7SSuresh Siddha unsigned long nohz_flags; 6509fd81dd5SFrederic Weisbecker #endif /* CONFIG_NO_HZ_COMMON */ 651265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 652265f22a9SFrederic Weisbecker unsigned long last_sched_tick; 653265f22a9SFrederic Weisbecker #endif 654391e43daSPeter Zijlstra /* capture load from *all* tasks on this cpu: */ 655391e43daSPeter Zijlstra struct load_weight load; 656391e43daSPeter Zijlstra unsigned long nr_load_updates; 657391e43daSPeter Zijlstra u64 nr_switches; 658391e43daSPeter Zijlstra 659391e43daSPeter Zijlstra struct cfs_rq cfs; 660391e43daSPeter Zijlstra struct rt_rq rt; 661aab03e05SDario Faggioli struct dl_rq dl; 662391e43daSPeter Zijlstra 663391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 664391e43daSPeter Zijlstra /* list of leaf cfs_rq on this cpu: */ 665391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 6669c2791f9SVincent Guittot struct list_head *tmp_alone_branch; 667a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 668a35b6466SPeter Zijlstra 669391e43daSPeter Zijlstra /* 670391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 671391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 672391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 673391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 674391e43daSPeter Zijlstra */ 675391e43daSPeter Zijlstra unsigned long nr_uninterruptible; 676391e43daSPeter Zijlstra 677391e43daSPeter Zijlstra struct task_struct *curr, *idle, *stop; 678391e43daSPeter Zijlstra unsigned long next_balance; 679391e43daSPeter Zijlstra struct mm_struct *prev_mm; 680391e43daSPeter Zijlstra 681cb42c9a3SMatt Fleming unsigned int clock_update_flags; 682391e43daSPeter Zijlstra u64 clock; 683391e43daSPeter Zijlstra u64 clock_task; 684391e43daSPeter Zijlstra 685391e43daSPeter Zijlstra atomic_t nr_iowait; 686391e43daSPeter Zijlstra 687391e43daSPeter Zijlstra #ifdef CONFIG_SMP 688391e43daSPeter Zijlstra struct root_domain *rd; 689391e43daSPeter Zijlstra struct sched_domain *sd; 690391e43daSPeter Zijlstra 691ced549faSNicolas Pitre unsigned long cpu_capacity; 692ca6d75e6SVincent Guittot unsigned long cpu_capacity_orig; 693391e43daSPeter Zijlstra 694e3fca9e7SPeter Zijlstra struct callback_head *balance_callback; 695e3fca9e7SPeter Zijlstra 696391e43daSPeter Zijlstra unsigned char idle_balance; 697391e43daSPeter Zijlstra /* For active balancing */ 698391e43daSPeter Zijlstra int active_balance; 699391e43daSPeter Zijlstra int push_cpu; 700391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 701391e43daSPeter Zijlstra /* cpu of this runqueue: */ 702391e43daSPeter Zijlstra int cpu; 703391e43daSPeter Zijlstra int online; 704391e43daSPeter Zijlstra 705367456c7SPeter Zijlstra struct list_head cfs_tasks; 706367456c7SPeter Zijlstra 707391e43daSPeter Zijlstra u64 rt_avg; 708391e43daSPeter Zijlstra u64 age_stamp; 709391e43daSPeter Zijlstra u64 idle_stamp; 710391e43daSPeter Zijlstra u64 avg_idle; 7119bd721c5SJason Low 7129bd721c5SJason Low /* This is used to determine avg_idle's max value */ 7139bd721c5SJason Low u64 max_idle_balance_cost; 714391e43daSPeter Zijlstra #endif 715391e43daSPeter Zijlstra 716391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 717391e43daSPeter Zijlstra u64 prev_irq_time; 718391e43daSPeter Zijlstra #endif 719391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 720391e43daSPeter Zijlstra u64 prev_steal_time; 721391e43daSPeter Zijlstra #endif 722391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 723391e43daSPeter Zijlstra u64 prev_steal_time_rq; 724391e43daSPeter Zijlstra #endif 725391e43daSPeter Zijlstra 726391e43daSPeter Zijlstra /* calc_load related fields */ 727391e43daSPeter Zijlstra unsigned long calc_load_update; 728391e43daSPeter Zijlstra long calc_load_active; 729391e43daSPeter Zijlstra 730391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 731391e43daSPeter Zijlstra #ifdef CONFIG_SMP 732391e43daSPeter Zijlstra int hrtick_csd_pending; 733391e43daSPeter Zijlstra struct call_single_data hrtick_csd; 734391e43daSPeter Zijlstra #endif 735391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 736391e43daSPeter Zijlstra #endif 737391e43daSPeter Zijlstra 738391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 739391e43daSPeter Zijlstra /* latency stats */ 740391e43daSPeter Zijlstra struct sched_info rq_sched_info; 741391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 742391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 743391e43daSPeter Zijlstra 744391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 745391e43daSPeter Zijlstra unsigned int yld_count; 746391e43daSPeter Zijlstra 747391e43daSPeter Zijlstra /* schedule() stats */ 748391e43daSPeter Zijlstra unsigned int sched_count; 749391e43daSPeter Zijlstra unsigned int sched_goidle; 750391e43daSPeter Zijlstra 751391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 752391e43daSPeter Zijlstra unsigned int ttwu_count; 753391e43daSPeter Zijlstra unsigned int ttwu_local; 754391e43daSPeter Zijlstra #endif 755391e43daSPeter Zijlstra 756391e43daSPeter Zijlstra #ifdef CONFIG_SMP 757391e43daSPeter Zijlstra struct llist_head wake_list; 758391e43daSPeter Zijlstra #endif 759442bf3aaSDaniel Lezcano 760442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 761442bf3aaSDaniel Lezcano /* Must be inspected within a rcu lock section */ 762442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state; 763442bf3aaSDaniel Lezcano #endif 764391e43daSPeter Zijlstra }; 765391e43daSPeter Zijlstra 766391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 767391e43daSPeter Zijlstra { 768391e43daSPeter Zijlstra #ifdef CONFIG_SMP 769391e43daSPeter Zijlstra return rq->cpu; 770391e43daSPeter Zijlstra #else 771391e43daSPeter Zijlstra return 0; 772391e43daSPeter Zijlstra #endif 773391e43daSPeter Zijlstra } 774391e43daSPeter Zijlstra 7751b568f0aSPeter Zijlstra 7761b568f0aSPeter Zijlstra #ifdef CONFIG_SCHED_SMT 7771b568f0aSPeter Zijlstra 7781b568f0aSPeter Zijlstra extern struct static_key_false sched_smt_present; 7791b568f0aSPeter Zijlstra 7801b568f0aSPeter Zijlstra extern void __update_idle_core(struct rq *rq); 7811b568f0aSPeter Zijlstra 7821b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) 7831b568f0aSPeter Zijlstra { 7841b568f0aSPeter Zijlstra if (static_branch_unlikely(&sched_smt_present)) 7851b568f0aSPeter Zijlstra __update_idle_core(rq); 7861b568f0aSPeter Zijlstra } 7871b568f0aSPeter Zijlstra 7881b568f0aSPeter Zijlstra #else 7891b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) { } 7901b568f0aSPeter Zijlstra #endif 7911b568f0aSPeter Zijlstra 7928b06c55bSPranith Kumar DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); 793391e43daSPeter Zijlstra 794518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 7954a32fea9SChristoph Lameter #define this_rq() this_cpu_ptr(&runqueues) 796518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 797518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 7984a32fea9SChristoph Lameter #define raw_rq() raw_cpu_ptr(&runqueues) 799518cd623SPeter Zijlstra 800cebde6d6SPeter Zijlstra static inline u64 __rq_clock_broken(struct rq *rq) 801cebde6d6SPeter Zijlstra { 802316c1608SJason Low return READ_ONCE(rq->clock); 803cebde6d6SPeter Zijlstra } 804cebde6d6SPeter Zijlstra 805cb42c9a3SMatt Fleming /* 806cb42c9a3SMatt Fleming * rq::clock_update_flags bits 807cb42c9a3SMatt Fleming * 808cb42c9a3SMatt Fleming * %RQCF_REQ_SKIP - will request skipping of clock update on the next 809cb42c9a3SMatt Fleming * call to __schedule(). This is an optimisation to avoid 810cb42c9a3SMatt Fleming * neighbouring rq clock updates. 811cb42c9a3SMatt Fleming * 812cb42c9a3SMatt Fleming * %RQCF_ACT_SKIP - is set from inside of __schedule() when skipping is 813cb42c9a3SMatt Fleming * in effect and calls to update_rq_clock() are being ignored. 814cb42c9a3SMatt Fleming * 815cb42c9a3SMatt Fleming * %RQCF_UPDATED - is a debug flag that indicates whether a call has been 816cb42c9a3SMatt Fleming * made to update_rq_clock() since the last time rq::lock was pinned. 817cb42c9a3SMatt Fleming * 818cb42c9a3SMatt Fleming * If inside of __schedule(), clock_update_flags will have been 819cb42c9a3SMatt Fleming * shifted left (a left shift is a cheap operation for the fast path 820cb42c9a3SMatt Fleming * to promote %RQCF_REQ_SKIP to %RQCF_ACT_SKIP), so you must use, 821cb42c9a3SMatt Fleming * 822cb42c9a3SMatt Fleming * if (rq-clock_update_flags >= RQCF_UPDATED) 823cb42c9a3SMatt Fleming * 824cb42c9a3SMatt Fleming * to check if %RQCF_UPADTED is set. It'll never be shifted more than 825cb42c9a3SMatt Fleming * one position though, because the next rq_unpin_lock() will shift it 826cb42c9a3SMatt Fleming * back. 827cb42c9a3SMatt Fleming */ 828cb42c9a3SMatt Fleming #define RQCF_REQ_SKIP 0x01 829cb42c9a3SMatt Fleming #define RQCF_ACT_SKIP 0x02 830cb42c9a3SMatt Fleming #define RQCF_UPDATED 0x04 831cb42c9a3SMatt Fleming 832cb42c9a3SMatt Fleming static inline void assert_clock_updated(struct rq *rq) 833cb42c9a3SMatt Fleming { 834cb42c9a3SMatt Fleming /* 835cb42c9a3SMatt Fleming * The only reason for not seeing a clock update since the 836cb42c9a3SMatt Fleming * last rq_pin_lock() is if we're currently skipping updates. 837cb42c9a3SMatt Fleming */ 838cb42c9a3SMatt Fleming SCHED_WARN_ON(rq->clock_update_flags < RQCF_ACT_SKIP); 839cb42c9a3SMatt Fleming } 840cb42c9a3SMatt Fleming 84178becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 84278becc27SFrederic Weisbecker { 843cebde6d6SPeter Zijlstra lockdep_assert_held(&rq->lock); 844cb42c9a3SMatt Fleming assert_clock_updated(rq); 845cb42c9a3SMatt Fleming 84678becc27SFrederic Weisbecker return rq->clock; 84778becc27SFrederic Weisbecker } 84878becc27SFrederic Weisbecker 84978becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 85078becc27SFrederic Weisbecker { 851cebde6d6SPeter Zijlstra lockdep_assert_held(&rq->lock); 852cb42c9a3SMatt Fleming assert_clock_updated(rq); 853cb42c9a3SMatt Fleming 85478becc27SFrederic Weisbecker return rq->clock_task; 85578becc27SFrederic Weisbecker } 85678becc27SFrederic Weisbecker 8579edfbfedSPeter Zijlstra static inline void rq_clock_skip_update(struct rq *rq, bool skip) 8589edfbfedSPeter Zijlstra { 8599edfbfedSPeter Zijlstra lockdep_assert_held(&rq->lock); 8609edfbfedSPeter Zijlstra if (skip) 861cb42c9a3SMatt Fleming rq->clock_update_flags |= RQCF_REQ_SKIP; 8629edfbfedSPeter Zijlstra else 863cb42c9a3SMatt Fleming rq->clock_update_flags &= ~RQCF_REQ_SKIP; 8649edfbfedSPeter Zijlstra } 8659edfbfedSPeter Zijlstra 866d8ac8971SMatt Fleming struct rq_flags { 867d8ac8971SMatt Fleming unsigned long flags; 868d8ac8971SMatt Fleming struct pin_cookie cookie; 869cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 870cb42c9a3SMatt Fleming /* 871cb42c9a3SMatt Fleming * A copy of (rq::clock_update_flags & RQCF_UPDATED) for the 872cb42c9a3SMatt Fleming * current pin context is stashed here in case it needs to be 873cb42c9a3SMatt Fleming * restored in rq_repin_lock(). 874cb42c9a3SMatt Fleming */ 875cb42c9a3SMatt Fleming unsigned int clock_update_flags; 876cb42c9a3SMatt Fleming #endif 877d8ac8971SMatt Fleming }; 878d8ac8971SMatt Fleming 879d8ac8971SMatt Fleming static inline void rq_pin_lock(struct rq *rq, struct rq_flags *rf) 880d8ac8971SMatt Fleming { 881d8ac8971SMatt Fleming rf->cookie = lockdep_pin_lock(&rq->lock); 882cb42c9a3SMatt Fleming 883cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 884cb42c9a3SMatt Fleming rq->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 885cb42c9a3SMatt Fleming rf->clock_update_flags = 0; 886cb42c9a3SMatt Fleming #endif 887d8ac8971SMatt Fleming } 888d8ac8971SMatt Fleming 889d8ac8971SMatt Fleming static inline void rq_unpin_lock(struct rq *rq, struct rq_flags *rf) 890d8ac8971SMatt Fleming { 891cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 892cb42c9a3SMatt Fleming if (rq->clock_update_flags > RQCF_ACT_SKIP) 893cb42c9a3SMatt Fleming rf->clock_update_flags = RQCF_UPDATED; 894cb42c9a3SMatt Fleming #endif 895cb42c9a3SMatt Fleming 896d8ac8971SMatt Fleming lockdep_unpin_lock(&rq->lock, rf->cookie); 897d8ac8971SMatt Fleming } 898d8ac8971SMatt Fleming 899d8ac8971SMatt Fleming static inline void rq_repin_lock(struct rq *rq, struct rq_flags *rf) 900d8ac8971SMatt Fleming { 901d8ac8971SMatt Fleming lockdep_repin_lock(&rq->lock, rf->cookie); 902cb42c9a3SMatt Fleming 903cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 904cb42c9a3SMatt Fleming /* 905cb42c9a3SMatt Fleming * Restore the value we stashed in @rf for this pin context. 906cb42c9a3SMatt Fleming */ 907cb42c9a3SMatt Fleming rq->clock_update_flags |= rf->clock_update_flags; 908cb42c9a3SMatt Fleming #endif 909d8ac8971SMatt Fleming } 910d8ac8971SMatt Fleming 9119942f79bSRik van Riel #ifdef CONFIG_NUMA 912e3fe70b1SRik van Riel enum numa_topology_type { 913e3fe70b1SRik van Riel NUMA_DIRECT, 914e3fe70b1SRik van Riel NUMA_GLUELESS_MESH, 915e3fe70b1SRik van Riel NUMA_BACKPLANE, 916e3fe70b1SRik van Riel }; 917e3fe70b1SRik van Riel extern enum numa_topology_type sched_numa_topology_type; 9189942f79bSRik van Riel extern int sched_max_numa_distance; 9199942f79bSRik van Riel extern bool find_numa_distance(int distance); 9209942f79bSRik van Riel #endif 9219942f79bSRik van Riel 922f2cb1360SIngo Molnar #ifdef CONFIG_NUMA 923f2cb1360SIngo Molnar extern void sched_init_numa(void); 924f2cb1360SIngo Molnar extern void sched_domains_numa_masks_set(unsigned int cpu); 925f2cb1360SIngo Molnar extern void sched_domains_numa_masks_clear(unsigned int cpu); 926f2cb1360SIngo Molnar #else 927f2cb1360SIngo Molnar static inline void sched_init_numa(void) { } 928f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_set(unsigned int cpu) { } 929f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_clear(unsigned int cpu) { } 930f2cb1360SIngo Molnar #endif 931f2cb1360SIngo Molnar 932f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 93344dba3d5SIulia Manda /* The regions in numa_faults array from task_struct */ 93444dba3d5SIulia Manda enum numa_faults_stats { 93544dba3d5SIulia Manda NUMA_MEM = 0, 93644dba3d5SIulia Manda NUMA_CPU, 93744dba3d5SIulia Manda NUMA_MEMBUF, 93844dba3d5SIulia Manda NUMA_CPUBUF 93944dba3d5SIulia Manda }; 9400ec8aa00SPeter Zijlstra extern void sched_setnuma(struct task_struct *p, int node); 941e6628d5bSMel Gorman extern int migrate_task_to(struct task_struct *p, int cpu); 942ac66f547SPeter Zijlstra extern int migrate_swap(struct task_struct *, struct task_struct *); 943f809ca9aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 944f809ca9aSMel Gorman 945518cd623SPeter Zijlstra #ifdef CONFIG_SMP 946518cd623SPeter Zijlstra 947e3fca9e7SPeter Zijlstra static inline void 948e3fca9e7SPeter Zijlstra queue_balance_callback(struct rq *rq, 949e3fca9e7SPeter Zijlstra struct callback_head *head, 950e3fca9e7SPeter Zijlstra void (*func)(struct rq *rq)) 951e3fca9e7SPeter Zijlstra { 952e3fca9e7SPeter Zijlstra lockdep_assert_held(&rq->lock); 953e3fca9e7SPeter Zijlstra 954e3fca9e7SPeter Zijlstra if (unlikely(head->next)) 955e3fca9e7SPeter Zijlstra return; 956e3fca9e7SPeter Zijlstra 957e3fca9e7SPeter Zijlstra head->func = (void (*)(struct callback_head *))func; 958e3fca9e7SPeter Zijlstra head->next = rq->balance_callback; 959e3fca9e7SPeter Zijlstra rq->balance_callback = head; 960e3fca9e7SPeter Zijlstra } 961e3fca9e7SPeter Zijlstra 962e3baac47SPeter Zijlstra extern void sched_ttwu_pending(void); 963e3baac47SPeter Zijlstra 964391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 965391e43daSPeter Zijlstra rcu_dereference_check((p), \ 966391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 967391e43daSPeter Zijlstra 968391e43daSPeter Zijlstra /* 969391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 970391e43daSPeter Zijlstra * See detach_destroy_domains: synchronize_sched for details. 971391e43daSPeter Zijlstra * 972391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 973391e43daSPeter Zijlstra * preempt-disabled sections. 974391e43daSPeter Zijlstra */ 975391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 976518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 977518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 978391e43daSPeter Zijlstra 97977e81365SSuresh Siddha #define for_each_lower_domain(sd) for (; sd; sd = sd->child) 98077e81365SSuresh Siddha 981518cd623SPeter Zijlstra /** 982518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 983518cd623SPeter Zijlstra * @cpu: The cpu whose highest level of sched domain is to 984518cd623SPeter Zijlstra * be returned. 985518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 986518cd623SPeter Zijlstra * for the given cpu. 987518cd623SPeter Zijlstra * 988518cd623SPeter Zijlstra * Returns the highest sched_domain of a cpu which contains the given flag. 989518cd623SPeter Zijlstra */ 990518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 991518cd623SPeter Zijlstra { 992518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 993518cd623SPeter Zijlstra 994518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 995518cd623SPeter Zijlstra if (!(sd->flags & flag)) 996518cd623SPeter Zijlstra break; 997518cd623SPeter Zijlstra hsd = sd; 998518cd623SPeter Zijlstra } 999518cd623SPeter Zijlstra 1000518cd623SPeter Zijlstra return hsd; 1001518cd623SPeter Zijlstra } 1002518cd623SPeter Zijlstra 1003fb13c7eeSMel Gorman static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) 1004fb13c7eeSMel Gorman { 1005fb13c7eeSMel Gorman struct sched_domain *sd; 1006fb13c7eeSMel Gorman 1007fb13c7eeSMel Gorman for_each_domain(cpu, sd) { 1008fb13c7eeSMel Gorman if (sd->flags & flag) 1009fb13c7eeSMel Gorman break; 1010fb13c7eeSMel Gorman } 1011fb13c7eeSMel Gorman 1012fb13c7eeSMel Gorman return sd; 1013fb13c7eeSMel Gorman } 1014fb13c7eeSMel Gorman 1015518cd623SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain *, sd_llc); 10167d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 1017518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 10180e369d75SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain_shared *, sd_llc_shared); 1019fb13c7eeSMel Gorman DECLARE_PER_CPU(struct sched_domain *, sd_numa); 102037dc6b50SPreeti U Murthy DECLARE_PER_CPU(struct sched_domain *, sd_asym); 1021518cd623SPeter Zijlstra 102263b2ca30SNicolas Pitre struct sched_group_capacity { 10235e6521eaSLi Zefan atomic_t ref; 10245e6521eaSLi Zefan /* 1025172895e6SYuyang Du * CPU capacity of this group, SCHED_CAPACITY_SCALE being max capacity 102663b2ca30SNicolas Pitre * for a single CPU. 10275e6521eaSLi Zefan */ 1028bf475ce0SMorten Rasmussen unsigned long capacity; 1029bf475ce0SMorten Rasmussen unsigned long min_capacity; /* Min per-CPU capacity in group */ 10305e6521eaSLi Zefan unsigned long next_update; 103163b2ca30SNicolas Pitre int imbalance; /* XXX unrelated to capacity but shared group state */ 10325e6521eaSLi Zefan 1033005f874dSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 1034005f874dSPeter Zijlstra int id; 1035005f874dSPeter Zijlstra #endif 1036005f874dSPeter Zijlstra 1037e5c14b1fSPeter Zijlstra unsigned long cpumask[0]; /* balance mask */ 10385e6521eaSLi Zefan }; 10395e6521eaSLi Zefan 10405e6521eaSLi Zefan struct sched_group { 10415e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 10425e6521eaSLi Zefan atomic_t ref; 10435e6521eaSLi Zefan 10445e6521eaSLi Zefan unsigned int group_weight; 104563b2ca30SNicolas Pitre struct sched_group_capacity *sgc; 1046afe06efdSTim Chen int asym_prefer_cpu; /* cpu of highest priority in group */ 10475e6521eaSLi Zefan 10485e6521eaSLi Zefan /* 10495e6521eaSLi Zefan * The CPUs this group covers. 10505e6521eaSLi Zefan * 10515e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 10525e6521eaSLi Zefan * by attaching extra space to the end of the structure, 10535e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 10545e6521eaSLi Zefan */ 10555e6521eaSLi Zefan unsigned long cpumask[0]; 10565e6521eaSLi Zefan }; 10575e6521eaSLi Zefan 1058ae4df9d6SPeter Zijlstra static inline struct cpumask *sched_group_span(struct sched_group *sg) 10595e6521eaSLi Zefan { 10605e6521eaSLi Zefan return to_cpumask(sg->cpumask); 10615e6521eaSLi Zefan } 10625e6521eaSLi Zefan 10635e6521eaSLi Zefan /* 1064e5c14b1fSPeter Zijlstra * See build_balance_mask(). 10655e6521eaSLi Zefan */ 1066e5c14b1fSPeter Zijlstra static inline struct cpumask *group_balance_mask(struct sched_group *sg) 10675e6521eaSLi Zefan { 106863b2ca30SNicolas Pitre return to_cpumask(sg->sgc->cpumask); 10695e6521eaSLi Zefan } 10705e6521eaSLi Zefan 10715e6521eaSLi Zefan /** 10725e6521eaSLi Zefan * group_first_cpu - Returns the first cpu in the cpumask of a sched_group. 10735e6521eaSLi Zefan * @group: The group whose first cpu is to be returned. 10745e6521eaSLi Zefan */ 10755e6521eaSLi Zefan static inline unsigned int group_first_cpu(struct sched_group *group) 10765e6521eaSLi Zefan { 1077ae4df9d6SPeter Zijlstra return cpumask_first(sched_group_span(group)); 10785e6521eaSLi Zefan } 10795e6521eaSLi Zefan 1080c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 1081c1174876SPeter Zijlstra 10823866e845SSteven Rostedt (Red Hat) #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL) 10833866e845SSteven Rostedt (Red Hat) void register_sched_domain_sysctl(void); 10843866e845SSteven Rostedt (Red Hat) void unregister_sched_domain_sysctl(void); 10853866e845SSteven Rostedt (Red Hat) #else 10863866e845SSteven Rostedt (Red Hat) static inline void register_sched_domain_sysctl(void) 10873866e845SSteven Rostedt (Red Hat) { 10883866e845SSteven Rostedt (Red Hat) } 10893866e845SSteven Rostedt (Red Hat) static inline void unregister_sched_domain_sysctl(void) 10903866e845SSteven Rostedt (Red Hat) { 10913866e845SSteven Rostedt (Red Hat) } 10923866e845SSteven Rostedt (Red Hat) #endif 10933866e845SSteven Rostedt (Red Hat) 1094e3baac47SPeter Zijlstra #else 1095e3baac47SPeter Zijlstra 1096e3baac47SPeter Zijlstra static inline void sched_ttwu_pending(void) { } 1097e3baac47SPeter Zijlstra 1098518cd623SPeter Zijlstra #endif /* CONFIG_SMP */ 1099391e43daSPeter Zijlstra 1100391e43daSPeter Zijlstra #include "stats.h" 11011051408fSIngo Molnar #include "autogroup.h" 1102391e43daSPeter Zijlstra 1103391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 1104391e43daSPeter Zijlstra 1105391e43daSPeter Zijlstra /* 1106391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 1107391e43daSPeter Zijlstra * 11088af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 11098af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 11108af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 11118323f26cSPeter Zijlstra * 11128323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 11138323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 11148323f26cSPeter Zijlstra * 11158323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 11168323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 1117391e43daSPeter Zijlstra */ 1118391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 1119391e43daSPeter Zijlstra { 11208323f26cSPeter Zijlstra return p->sched_task_group; 1121391e43daSPeter Zijlstra } 1122391e43daSPeter Zijlstra 1123391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 1124391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 1125391e43daSPeter Zijlstra { 1126391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 1127391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 1128391e43daSPeter Zijlstra #endif 1129391e43daSPeter Zijlstra 1130391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 1131ad936d86SByungchul Park set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]); 1132391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 1133391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 1134391e43daSPeter Zijlstra #endif 1135391e43daSPeter Zijlstra 1136391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 1137391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 1138391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 1139391e43daSPeter Zijlstra #endif 1140391e43daSPeter Zijlstra } 1141391e43daSPeter Zijlstra 1142391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 1143391e43daSPeter Zijlstra 1144391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 1145391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 1146391e43daSPeter Zijlstra { 1147391e43daSPeter Zijlstra return NULL; 1148391e43daSPeter Zijlstra } 1149391e43daSPeter Zijlstra 1150391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 1151391e43daSPeter Zijlstra 1152391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 1153391e43daSPeter Zijlstra { 1154391e43daSPeter Zijlstra set_task_rq(p, cpu); 1155391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1156391e43daSPeter Zijlstra /* 1157391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 1158391e43daSPeter Zijlstra * successfuly executed on another CPU. We must ensure that updates of 1159391e43daSPeter Zijlstra * per-task data have been completed by this moment. 1160391e43daSPeter Zijlstra */ 1161391e43daSPeter Zijlstra smp_wmb(); 1162c65eacbeSAndy Lutomirski #ifdef CONFIG_THREAD_INFO_IN_TASK 1163c65eacbeSAndy Lutomirski p->cpu = cpu; 1164c65eacbeSAndy Lutomirski #else 1165391e43daSPeter Zijlstra task_thread_info(p)->cpu = cpu; 1166c65eacbeSAndy Lutomirski #endif 1167ac66f547SPeter Zijlstra p->wake_cpu = cpu; 1168391e43daSPeter Zijlstra #endif 1169391e43daSPeter Zijlstra } 1170391e43daSPeter Zijlstra 1171391e43daSPeter Zijlstra /* 1172391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 1173391e43daSPeter Zijlstra */ 1174391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 1175c5905afbSIngo Molnar # include <linux/static_key.h> 1176391e43daSPeter Zijlstra # define const_debug __read_mostly 1177391e43daSPeter Zijlstra #else 1178391e43daSPeter Zijlstra # define const_debug const 1179391e43daSPeter Zijlstra #endif 1180391e43daSPeter Zijlstra 1181391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_features; 1182391e43daSPeter Zijlstra 1183391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1184391e43daSPeter Zijlstra __SCHED_FEAT_##name , 1185391e43daSPeter Zijlstra 1186391e43daSPeter Zijlstra enum { 1187391e43daSPeter Zijlstra #include "features.h" 1188f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 1189391e43daSPeter Zijlstra }; 1190391e43daSPeter Zijlstra 1191391e43daSPeter Zijlstra #undef SCHED_FEAT 1192391e43daSPeter Zijlstra 1193f8b6d1ccSPeter Zijlstra #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) 1194f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1195c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 1196f8b6d1ccSPeter Zijlstra { \ 11976e76ea8aSJason Baron return static_key_##enabled(key); \ 1198f8b6d1ccSPeter Zijlstra } 1199f8b6d1ccSPeter Zijlstra 1200f8b6d1ccSPeter Zijlstra #include "features.h" 1201f8b6d1ccSPeter Zijlstra 1202f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 1203f8b6d1ccSPeter Zijlstra 1204c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 1205f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 1206f8b6d1ccSPeter Zijlstra #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ 1207391e43daSPeter Zijlstra #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 1208f8b6d1ccSPeter Zijlstra #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ 1209391e43daSPeter Zijlstra 12102a595721SSrikar Dronamraju extern struct static_key_false sched_numa_balancing; 1211cb251765SMel Gorman extern struct static_key_false sched_schedstats; 1212cbee9f88SPeter Zijlstra 1213391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 1214391e43daSPeter Zijlstra { 1215391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 1216391e43daSPeter Zijlstra } 1217391e43daSPeter Zijlstra 1218391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 1219391e43daSPeter Zijlstra { 1220391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 1221391e43daSPeter Zijlstra return RUNTIME_INF; 1222391e43daSPeter Zijlstra 1223391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 1224391e43daSPeter Zijlstra } 1225391e43daSPeter Zijlstra 1226391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 1227391e43daSPeter Zijlstra { 1228391e43daSPeter Zijlstra return rq->curr == p; 1229391e43daSPeter Zijlstra } 1230391e43daSPeter Zijlstra 1231391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 1232391e43daSPeter Zijlstra { 1233391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1234391e43daSPeter Zijlstra return p->on_cpu; 1235391e43daSPeter Zijlstra #else 1236391e43daSPeter Zijlstra return task_current(rq, p); 1237391e43daSPeter Zijlstra #endif 1238391e43daSPeter Zijlstra } 1239391e43daSPeter Zijlstra 1240da0c1e65SKirill Tkhai static inline int task_on_rq_queued(struct task_struct *p) 1241da0c1e65SKirill Tkhai { 1242da0c1e65SKirill Tkhai return p->on_rq == TASK_ON_RQ_QUEUED; 1243da0c1e65SKirill Tkhai } 1244391e43daSPeter Zijlstra 1245cca26e80SKirill Tkhai static inline int task_on_rq_migrating(struct task_struct *p) 1246cca26e80SKirill Tkhai { 1247cca26e80SKirill Tkhai return p->on_rq == TASK_ON_RQ_MIGRATING; 1248cca26e80SKirill Tkhai } 1249cca26e80SKirill Tkhai 1250391e43daSPeter Zijlstra #ifndef prepare_arch_switch 1251391e43daSPeter Zijlstra # define prepare_arch_switch(next) do { } while (0) 1252391e43daSPeter Zijlstra #endif 125301f23e16SCatalin Marinas #ifndef finish_arch_post_lock_switch 125401f23e16SCatalin Marinas # define finish_arch_post_lock_switch() do { } while (0) 125501f23e16SCatalin Marinas #endif 1256391e43daSPeter Zijlstra 1257391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 1258391e43daSPeter Zijlstra { 1259391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1260391e43daSPeter Zijlstra /* 1261391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 1262391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 1263391e43daSPeter Zijlstra * here. 1264391e43daSPeter Zijlstra */ 1265391e43daSPeter Zijlstra next->on_cpu = 1; 1266391e43daSPeter Zijlstra #endif 1267391e43daSPeter Zijlstra } 1268391e43daSPeter Zijlstra 1269391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 1270391e43daSPeter Zijlstra { 1271391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1272391e43daSPeter Zijlstra /* 1273391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 1274391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 1275391e43daSPeter Zijlstra * finished. 127695913d97SPeter Zijlstra * 1277b75a2253SPeter Zijlstra * In particular, the load of prev->state in finish_task_switch() must 1278b75a2253SPeter Zijlstra * happen before this. 1279b75a2253SPeter Zijlstra * 12801f03e8d2SPeter Zijlstra * Pairs with the smp_cond_load_acquire() in try_to_wake_up(). 1281391e43daSPeter Zijlstra */ 128295913d97SPeter Zijlstra smp_store_release(&prev->on_cpu, 0); 1283391e43daSPeter Zijlstra #endif 1284391e43daSPeter Zijlstra #ifdef CONFIG_DEBUG_SPINLOCK 1285391e43daSPeter Zijlstra /* this is a valid case when another task releases the spinlock */ 1286391e43daSPeter Zijlstra rq->lock.owner = current; 1287391e43daSPeter Zijlstra #endif 1288391e43daSPeter Zijlstra /* 1289391e43daSPeter Zijlstra * If we are tracking spinlock dependencies then we have to 1290391e43daSPeter Zijlstra * fix up the runqueue lock - which gets 'carried over' from 1291391e43daSPeter Zijlstra * prev into current: 1292391e43daSPeter Zijlstra */ 1293391e43daSPeter Zijlstra spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); 1294391e43daSPeter Zijlstra 1295391e43daSPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 1296391e43daSPeter Zijlstra } 1297391e43daSPeter Zijlstra 1298b13095f0SLi Zefan /* 1299b13095f0SLi Zefan * wake flags 1300b13095f0SLi Zefan */ 1301b13095f0SLi Zefan #define WF_SYNC 0x01 /* waker goes to sleep after wakeup */ 1302b13095f0SLi Zefan #define WF_FORK 0x02 /* child wakeup after fork */ 1303b13095f0SLi Zefan #define WF_MIGRATED 0x4 /* internal use, task got migrated */ 1304b13095f0SLi Zefan 1305391e43daSPeter Zijlstra /* 1306391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 1307391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 1308391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 1309391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 1310391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 1311391e43daSPeter Zijlstra * slice expiry etc. 1312391e43daSPeter Zijlstra */ 1313391e43daSPeter Zijlstra 1314391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 1315391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 1316391e43daSPeter Zijlstra 1317ed82b8a1SAndi Kleen extern const int sched_prio_to_weight[40]; 1318ed82b8a1SAndi Kleen extern const u32 sched_prio_to_wmult[40]; 1319391e43daSPeter Zijlstra 1320ff77e468SPeter Zijlstra /* 1321ff77e468SPeter Zijlstra * {de,en}queue flags: 1322ff77e468SPeter Zijlstra * 1323ff77e468SPeter Zijlstra * DEQUEUE_SLEEP - task is no longer runnable 1324ff77e468SPeter Zijlstra * ENQUEUE_WAKEUP - task just became runnable 1325ff77e468SPeter Zijlstra * 1326ff77e468SPeter Zijlstra * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks 1327ff77e468SPeter Zijlstra * are in a known state which allows modification. Such pairs 1328ff77e468SPeter Zijlstra * should preserve as much state as possible. 1329ff77e468SPeter Zijlstra * 1330ff77e468SPeter Zijlstra * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location 1331ff77e468SPeter Zijlstra * in the runqueue. 1332ff77e468SPeter Zijlstra * 1333ff77e468SPeter Zijlstra * ENQUEUE_HEAD - place at front of runqueue (tail if not specified) 1334ff77e468SPeter Zijlstra * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline) 133559efa0baSPeter Zijlstra * ENQUEUE_MIGRATED - the task was migrated during wakeup 1336ff77e468SPeter Zijlstra * 1337ff77e468SPeter Zijlstra */ 1338ff77e468SPeter Zijlstra 1339ff77e468SPeter Zijlstra #define DEQUEUE_SLEEP 0x01 1340ff77e468SPeter Zijlstra #define DEQUEUE_SAVE 0x02 /* matches ENQUEUE_RESTORE */ 1341ff77e468SPeter Zijlstra #define DEQUEUE_MOVE 0x04 /* matches ENQUEUE_MOVE */ 13420a67d1eeSPeter Zijlstra #define DEQUEUE_NOCLOCK 0x08 /* matches ENQUEUE_NOCLOCK */ 1343ff77e468SPeter Zijlstra 13441de64443SPeter Zijlstra #define ENQUEUE_WAKEUP 0x01 1345ff77e468SPeter Zijlstra #define ENQUEUE_RESTORE 0x02 1346ff77e468SPeter Zijlstra #define ENQUEUE_MOVE 0x04 13470a67d1eeSPeter Zijlstra #define ENQUEUE_NOCLOCK 0x08 1348ff77e468SPeter Zijlstra 13490a67d1eeSPeter Zijlstra #define ENQUEUE_HEAD 0x10 13500a67d1eeSPeter Zijlstra #define ENQUEUE_REPLENISH 0x20 1351c82ba9faSLi Zefan #ifdef CONFIG_SMP 13520a67d1eeSPeter Zijlstra #define ENQUEUE_MIGRATED 0x40 1353c82ba9faSLi Zefan #else 135459efa0baSPeter Zijlstra #define ENQUEUE_MIGRATED 0x00 1355c82ba9faSLi Zefan #endif 1356c82ba9faSLi Zefan 135737e117c0SPeter Zijlstra #define RETRY_TASK ((void *)-1UL) 135837e117c0SPeter Zijlstra 1359c82ba9faSLi Zefan struct sched_class { 1360c82ba9faSLi Zefan const struct sched_class *next; 1361c82ba9faSLi Zefan 1362c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 1363c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 1364c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 1365c82ba9faSLi Zefan bool (*yield_to_task) (struct rq *rq, struct task_struct *p, bool preempt); 1366c82ba9faSLi Zefan 1367c82ba9faSLi Zefan void (*check_preempt_curr) (struct rq *rq, struct task_struct *p, int flags); 1368c82ba9faSLi Zefan 1369606dba2eSPeter Zijlstra /* 1370606dba2eSPeter Zijlstra * It is the responsibility of the pick_next_task() method that will 1371606dba2eSPeter Zijlstra * return the next task to call put_prev_task() on the @prev task or 1372606dba2eSPeter Zijlstra * something equivalent. 137337e117c0SPeter Zijlstra * 137437e117c0SPeter Zijlstra * May return RETRY_TASK when it finds a higher prio class has runnable 137537e117c0SPeter Zijlstra * tasks. 1376606dba2eSPeter Zijlstra */ 1377606dba2eSPeter Zijlstra struct task_struct * (*pick_next_task) (struct rq *rq, 1378e7904a28SPeter Zijlstra struct task_struct *prev, 1379d8ac8971SMatt Fleming struct rq_flags *rf); 1380c82ba9faSLi Zefan void (*put_prev_task) (struct rq *rq, struct task_struct *p); 1381c82ba9faSLi Zefan 1382c82ba9faSLi Zefan #ifdef CONFIG_SMP 1383ac66f547SPeter Zijlstra int (*select_task_rq)(struct task_struct *p, int task_cpu, int sd_flag, int flags); 13845a4fd036Sxiaofeng.yan void (*migrate_task_rq)(struct task_struct *p); 1385c82ba9faSLi Zefan 1386c82ba9faSLi Zefan void (*task_woken) (struct rq *this_rq, struct task_struct *task); 1387c82ba9faSLi Zefan 1388c82ba9faSLi Zefan void (*set_cpus_allowed)(struct task_struct *p, 1389c82ba9faSLi Zefan const struct cpumask *newmask); 1390c82ba9faSLi Zefan 1391c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 1392c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 1393c82ba9faSLi Zefan #endif 1394c82ba9faSLi Zefan 1395c82ba9faSLi Zefan void (*set_curr_task) (struct rq *rq); 1396c82ba9faSLi Zefan void (*task_tick) (struct rq *rq, struct task_struct *p, int queued); 1397c82ba9faSLi Zefan void (*task_fork) (struct task_struct *p); 1398e6c390f2SDario Faggioli void (*task_dead) (struct task_struct *p); 1399c82ba9faSLi Zefan 140067dfa1b7SKirill Tkhai /* 140167dfa1b7SKirill Tkhai * The switched_from() call is allowed to drop rq->lock, therefore we 140267dfa1b7SKirill Tkhai * cannot assume the switched_from/switched_to pair is serliazed by 140367dfa1b7SKirill Tkhai * rq->lock. They are however serialized by p->pi_lock. 140467dfa1b7SKirill Tkhai */ 1405c82ba9faSLi Zefan void (*switched_from) (struct rq *this_rq, struct task_struct *task); 1406c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 1407c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 1408c82ba9faSLi Zefan int oldprio); 1409c82ba9faSLi Zefan 1410c82ba9faSLi Zefan unsigned int (*get_rr_interval) (struct rq *rq, 1411c82ba9faSLi Zefan struct task_struct *task); 1412c82ba9faSLi Zefan 14136e998916SStanislaw Gruszka void (*update_curr) (struct rq *rq); 14146e998916SStanislaw Gruszka 1415ea86cb4bSVincent Guittot #define TASK_SET_GROUP 0 1416ea86cb4bSVincent Guittot #define TASK_MOVE_GROUP 1 1417ea86cb4bSVincent Guittot 1418c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 1419ea86cb4bSVincent Guittot void (*task_change_group) (struct task_struct *p, int type); 1420c82ba9faSLi Zefan #endif 1421c82ba9faSLi Zefan }; 1422391e43daSPeter Zijlstra 14233f1d2a31SPeter Zijlstra static inline void put_prev_task(struct rq *rq, struct task_struct *prev) 14243f1d2a31SPeter Zijlstra { 14253f1d2a31SPeter Zijlstra prev->sched_class->put_prev_task(rq, prev); 14263f1d2a31SPeter Zijlstra } 14273f1d2a31SPeter Zijlstra 1428b2bf6c31SPeter Zijlstra static inline void set_curr_task(struct rq *rq, struct task_struct *curr) 1429b2bf6c31SPeter Zijlstra { 1430b2bf6c31SPeter Zijlstra curr->sched_class->set_curr_task(rq); 1431b2bf6c31SPeter Zijlstra } 1432b2bf6c31SPeter Zijlstra 1433391e43daSPeter Zijlstra #define sched_class_highest (&stop_sched_class) 1434391e43daSPeter Zijlstra #define for_each_class(class) \ 1435391e43daSPeter Zijlstra for (class = sched_class_highest; class; class = class->next) 1436391e43daSPeter Zijlstra 1437391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 1438aab03e05SDario Faggioli extern const struct sched_class dl_sched_class; 1439391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 1440391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 1441391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 1442391e43daSPeter Zijlstra 1443391e43daSPeter Zijlstra 1444391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1445391e43daSPeter Zijlstra 144663b2ca30SNicolas Pitre extern void update_group_capacity(struct sched_domain *sd, int cpu); 1447b719203bSLi Zefan 14487caff66fSDaniel Lezcano extern void trigger_load_balance(struct rq *rq); 1449391e43daSPeter Zijlstra 1450c5b28038SPeter Zijlstra extern void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask); 1451c5b28038SPeter Zijlstra 1452391e43daSPeter Zijlstra #endif 1453391e43daSPeter Zijlstra 1454442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 1455442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 1456442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 1457442bf3aaSDaniel Lezcano { 1458442bf3aaSDaniel Lezcano rq->idle_state = idle_state; 1459442bf3aaSDaniel Lezcano } 1460442bf3aaSDaniel Lezcano 1461442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 1462442bf3aaSDaniel Lezcano { 14639148a3a1SPeter Zijlstra SCHED_WARN_ON(!rcu_read_lock_held()); 1464442bf3aaSDaniel Lezcano return rq->idle_state; 1465442bf3aaSDaniel Lezcano } 1466442bf3aaSDaniel Lezcano #else 1467442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 1468442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 1469442bf3aaSDaniel Lezcano { 1470442bf3aaSDaniel Lezcano } 1471442bf3aaSDaniel Lezcano 1472442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 1473442bf3aaSDaniel Lezcano { 1474442bf3aaSDaniel Lezcano return NULL; 1475442bf3aaSDaniel Lezcano } 1476442bf3aaSDaniel Lezcano #endif 1477442bf3aaSDaniel Lezcano 14788663effbSSteven Rostedt (VMware) extern void schedule_idle(void); 14798663effbSSteven Rostedt (VMware) 1480391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 1481391e43daSPeter Zijlstra extern void sched_init_granularity(void); 1482391e43daSPeter Zijlstra extern void update_max_interval(void); 14831baca4ceSJuri Lelli 14841baca4ceSJuri Lelli extern void init_sched_dl_class(void); 1485391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 1486391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 1487391e43daSPeter Zijlstra 14888875125eSKirill Tkhai extern void resched_curr(struct rq *rq); 1489391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 1490391e43daSPeter Zijlstra 1491391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 1492391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 1493391e43daSPeter Zijlstra 1494332ac17eSDario Faggioli extern struct dl_bandwidth def_dl_bandwidth; 1495332ac17eSDario Faggioli extern void init_dl_bandwidth(struct dl_bandwidth *dl_b, u64 period, u64 runtime); 1496aab03e05SDario Faggioli extern void init_dl_task_timer(struct sched_dl_entity *dl_se); 1497*209a0cbdSLuca Abeni extern void init_dl_inactive_task_timer(struct sched_dl_entity *dl_se); 1498aab03e05SDario Faggioli 1499332ac17eSDario Faggioli unsigned long to_ratio(u64 period, u64 runtime); 1500332ac17eSDario Faggioli 1501540247fbSYuyang Du extern void init_entity_runnable_average(struct sched_entity *se); 15022b8c41daSYuyang Du extern void post_init_entity_util_avg(struct sched_entity *se); 1503a75cdaa9SAlex Shi 150476d92ac3SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 150576d92ac3SFrederic Weisbecker extern bool sched_can_stop_tick(struct rq *rq); 150676d92ac3SFrederic Weisbecker 150776d92ac3SFrederic Weisbecker /* 150876d92ac3SFrederic Weisbecker * Tick may be needed by tasks in the runqueue depending on their policy and 150976d92ac3SFrederic Weisbecker * requirements. If tick is needed, lets send the target an IPI to kick it out of 151076d92ac3SFrederic Weisbecker * nohz mode if necessary. 151176d92ac3SFrederic Weisbecker */ 151276d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) 151376d92ac3SFrederic Weisbecker { 151476d92ac3SFrederic Weisbecker int cpu; 151576d92ac3SFrederic Weisbecker 151676d92ac3SFrederic Weisbecker if (!tick_nohz_full_enabled()) 151776d92ac3SFrederic Weisbecker return; 151876d92ac3SFrederic Weisbecker 151976d92ac3SFrederic Weisbecker cpu = cpu_of(rq); 152076d92ac3SFrederic Weisbecker 152176d92ac3SFrederic Weisbecker if (!tick_nohz_full_cpu(cpu)) 152276d92ac3SFrederic Weisbecker return; 152376d92ac3SFrederic Weisbecker 152476d92ac3SFrederic Weisbecker if (sched_can_stop_tick(rq)) 152576d92ac3SFrederic Weisbecker tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED); 152676d92ac3SFrederic Weisbecker else 152776d92ac3SFrederic Weisbecker tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED); 152876d92ac3SFrederic Weisbecker } 152976d92ac3SFrederic Weisbecker #else 153076d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) { } 153176d92ac3SFrederic Weisbecker #endif 153276d92ac3SFrederic Weisbecker 153372465447SKirill Tkhai static inline void add_nr_running(struct rq *rq, unsigned count) 1534391e43daSPeter Zijlstra { 153572465447SKirill Tkhai unsigned prev_nr = rq->nr_running; 153672465447SKirill Tkhai 153772465447SKirill Tkhai rq->nr_running = prev_nr + count; 15389f3660c2SFrederic Weisbecker 153972465447SKirill Tkhai if (prev_nr < 2 && rq->nr_running >= 2) { 15404486edd1STim Chen #ifdef CONFIG_SMP 15414486edd1STim Chen if (!rq->rd->overload) 15424486edd1STim Chen rq->rd->overload = true; 15434486edd1STim Chen #endif 154476d92ac3SFrederic Weisbecker } 15454486edd1STim Chen 154676d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 15474486edd1STim Chen } 1548391e43daSPeter Zijlstra 154972465447SKirill Tkhai static inline void sub_nr_running(struct rq *rq, unsigned count) 1550391e43daSPeter Zijlstra { 155172465447SKirill Tkhai rq->nr_running -= count; 155276d92ac3SFrederic Weisbecker /* Check if we still need preemption */ 155376d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 1554391e43daSPeter Zijlstra } 1555391e43daSPeter Zijlstra 1556265f22a9SFrederic Weisbecker static inline void rq_last_tick_reset(struct rq *rq) 1557265f22a9SFrederic Weisbecker { 1558265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 1559265f22a9SFrederic Weisbecker rq->last_sched_tick = jiffies; 1560265f22a9SFrederic Weisbecker #endif 1561265f22a9SFrederic Weisbecker } 1562265f22a9SFrederic Weisbecker 1563391e43daSPeter Zijlstra extern void update_rq_clock(struct rq *rq); 1564391e43daSPeter Zijlstra 1565391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 1566391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 1567391e43daSPeter Zijlstra 1568391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 1569391e43daSPeter Zijlstra 1570391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_time_avg; 1571391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 1572391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 1573391e43daSPeter Zijlstra 1574391e43daSPeter Zijlstra static inline u64 sched_avg_period(void) 1575391e43daSPeter Zijlstra { 1576391e43daSPeter Zijlstra return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; 1577391e43daSPeter Zijlstra } 1578391e43daSPeter Zijlstra 1579391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1580391e43daSPeter Zijlstra 1581391e43daSPeter Zijlstra /* 1582391e43daSPeter Zijlstra * Use hrtick when: 1583391e43daSPeter Zijlstra * - enabled by features 1584391e43daSPeter Zijlstra * - hrtimer is actually high res 1585391e43daSPeter Zijlstra */ 1586391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 1587391e43daSPeter Zijlstra { 1588391e43daSPeter Zijlstra if (!sched_feat(HRTICK)) 1589391e43daSPeter Zijlstra return 0; 1590391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 1591391e43daSPeter Zijlstra return 0; 1592391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 1593391e43daSPeter Zijlstra } 1594391e43daSPeter Zijlstra 1595391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 1596391e43daSPeter Zijlstra 1597b39e66eaSMike Galbraith #else 1598b39e66eaSMike Galbraith 1599b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 1600b39e66eaSMike Galbraith { 1601b39e66eaSMike Galbraith return 0; 1602b39e66eaSMike Galbraith } 1603b39e66eaSMike Galbraith 1604391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 1605391e43daSPeter Zijlstra 1606391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1607391e43daSPeter Zijlstra extern void sched_avg_update(struct rq *rq); 1608dfbca41fSPeter Zijlstra 1609dfbca41fSPeter Zijlstra #ifndef arch_scale_freq_capacity 1610dfbca41fSPeter Zijlstra static __always_inline 1611dfbca41fSPeter Zijlstra unsigned long arch_scale_freq_capacity(struct sched_domain *sd, int cpu) 1612dfbca41fSPeter Zijlstra { 1613dfbca41fSPeter Zijlstra return SCHED_CAPACITY_SCALE; 1614dfbca41fSPeter Zijlstra } 1615dfbca41fSPeter Zijlstra #endif 1616b5b4860dSVincent Guittot 16178cd5601cSMorten Rasmussen #ifndef arch_scale_cpu_capacity 16188cd5601cSMorten Rasmussen static __always_inline 16198cd5601cSMorten Rasmussen unsigned long arch_scale_cpu_capacity(struct sched_domain *sd, int cpu) 16208cd5601cSMorten Rasmussen { 1621e3279a2eSDietmar Eggemann if (sd && (sd->flags & SD_SHARE_CPUCAPACITY) && (sd->span_weight > 1)) 16228cd5601cSMorten Rasmussen return sd->smt_gain / sd->span_weight; 16238cd5601cSMorten Rasmussen 16248cd5601cSMorten Rasmussen return SCHED_CAPACITY_SCALE; 16258cd5601cSMorten Rasmussen } 16268cd5601cSMorten Rasmussen #endif 16278cd5601cSMorten Rasmussen 1628391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) 1629391e43daSPeter Zijlstra { 1630b5b4860dSVincent Guittot rq->rt_avg += rt_delta * arch_scale_freq_capacity(NULL, cpu_of(rq)); 1631391e43daSPeter Zijlstra sched_avg_update(rq); 1632391e43daSPeter Zijlstra } 1633391e43daSPeter Zijlstra #else 1634391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) { } 1635391e43daSPeter Zijlstra static inline void sched_avg_update(struct rq *rq) { } 1636391e43daSPeter Zijlstra #endif 1637391e43daSPeter Zijlstra 1638eb580751SPeter Zijlstra struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf) 16393e71a462SPeter Zijlstra __acquires(rq->lock); 16408a8c69c3SPeter Zijlstra 1641eb580751SPeter Zijlstra struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf) 16423960c8c0SPeter Zijlstra __acquires(p->pi_lock) 16433e71a462SPeter Zijlstra __acquires(rq->lock); 16443960c8c0SPeter Zijlstra 1645eb580751SPeter Zijlstra static inline void __task_rq_unlock(struct rq *rq, struct rq_flags *rf) 16463960c8c0SPeter Zijlstra __releases(rq->lock) 16473960c8c0SPeter Zijlstra { 1648d8ac8971SMatt Fleming rq_unpin_lock(rq, rf); 16493960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 16503960c8c0SPeter Zijlstra } 16513960c8c0SPeter Zijlstra 16523960c8c0SPeter Zijlstra static inline void 1653eb580751SPeter Zijlstra task_rq_unlock(struct rq *rq, struct task_struct *p, struct rq_flags *rf) 16543960c8c0SPeter Zijlstra __releases(rq->lock) 16553960c8c0SPeter Zijlstra __releases(p->pi_lock) 16563960c8c0SPeter Zijlstra { 1657d8ac8971SMatt Fleming rq_unpin_lock(rq, rf); 16583960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 1659eb580751SPeter Zijlstra raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags); 16603960c8c0SPeter Zijlstra } 16613960c8c0SPeter Zijlstra 16628a8c69c3SPeter Zijlstra static inline void 16638a8c69c3SPeter Zijlstra rq_lock_irqsave(struct rq *rq, struct rq_flags *rf) 16648a8c69c3SPeter Zijlstra __acquires(rq->lock) 16658a8c69c3SPeter Zijlstra { 16668a8c69c3SPeter Zijlstra raw_spin_lock_irqsave(&rq->lock, rf->flags); 16678a8c69c3SPeter Zijlstra rq_pin_lock(rq, rf); 16688a8c69c3SPeter Zijlstra } 16698a8c69c3SPeter Zijlstra 16708a8c69c3SPeter Zijlstra static inline void 16718a8c69c3SPeter Zijlstra rq_lock_irq(struct rq *rq, struct rq_flags *rf) 16728a8c69c3SPeter Zijlstra __acquires(rq->lock) 16738a8c69c3SPeter Zijlstra { 16748a8c69c3SPeter Zijlstra raw_spin_lock_irq(&rq->lock); 16758a8c69c3SPeter Zijlstra rq_pin_lock(rq, rf); 16768a8c69c3SPeter Zijlstra } 16778a8c69c3SPeter Zijlstra 16788a8c69c3SPeter Zijlstra static inline void 16798a8c69c3SPeter Zijlstra rq_lock(struct rq *rq, struct rq_flags *rf) 16808a8c69c3SPeter Zijlstra __acquires(rq->lock) 16818a8c69c3SPeter Zijlstra { 16828a8c69c3SPeter Zijlstra raw_spin_lock(&rq->lock); 16838a8c69c3SPeter Zijlstra rq_pin_lock(rq, rf); 16848a8c69c3SPeter Zijlstra } 16858a8c69c3SPeter Zijlstra 16868a8c69c3SPeter Zijlstra static inline void 16878a8c69c3SPeter Zijlstra rq_relock(struct rq *rq, struct rq_flags *rf) 16888a8c69c3SPeter Zijlstra __acquires(rq->lock) 16898a8c69c3SPeter Zijlstra { 16908a8c69c3SPeter Zijlstra raw_spin_lock(&rq->lock); 16918a8c69c3SPeter Zijlstra rq_repin_lock(rq, rf); 16928a8c69c3SPeter Zijlstra } 16938a8c69c3SPeter Zijlstra 16948a8c69c3SPeter Zijlstra static inline void 16958a8c69c3SPeter Zijlstra rq_unlock_irqrestore(struct rq *rq, struct rq_flags *rf) 16968a8c69c3SPeter Zijlstra __releases(rq->lock) 16978a8c69c3SPeter Zijlstra { 16988a8c69c3SPeter Zijlstra rq_unpin_lock(rq, rf); 16998a8c69c3SPeter Zijlstra raw_spin_unlock_irqrestore(&rq->lock, rf->flags); 17008a8c69c3SPeter Zijlstra } 17018a8c69c3SPeter Zijlstra 17028a8c69c3SPeter Zijlstra static inline void 17038a8c69c3SPeter Zijlstra rq_unlock_irq(struct rq *rq, struct rq_flags *rf) 17048a8c69c3SPeter Zijlstra __releases(rq->lock) 17058a8c69c3SPeter Zijlstra { 17068a8c69c3SPeter Zijlstra rq_unpin_lock(rq, rf); 17078a8c69c3SPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 17088a8c69c3SPeter Zijlstra } 17098a8c69c3SPeter Zijlstra 17108a8c69c3SPeter Zijlstra static inline void 17118a8c69c3SPeter Zijlstra rq_unlock(struct rq *rq, struct rq_flags *rf) 17128a8c69c3SPeter Zijlstra __releases(rq->lock) 17138a8c69c3SPeter Zijlstra { 17148a8c69c3SPeter Zijlstra rq_unpin_lock(rq, rf); 17158a8c69c3SPeter Zijlstra raw_spin_unlock(&rq->lock); 17168a8c69c3SPeter Zijlstra } 17178a8c69c3SPeter Zijlstra 1718391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1719391e43daSPeter Zijlstra #ifdef CONFIG_PREEMPT 1720391e43daSPeter Zijlstra 1721391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); 1722391e43daSPeter Zijlstra 1723391e43daSPeter Zijlstra /* 1724391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 1725391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 1726391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 1727391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 1728391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 1729391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 1730391e43daSPeter Zijlstra */ 1731391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1732391e43daSPeter Zijlstra __releases(this_rq->lock) 1733391e43daSPeter Zijlstra __acquires(busiest->lock) 1734391e43daSPeter Zijlstra __acquires(this_rq->lock) 1735391e43daSPeter Zijlstra { 1736391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1737391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 1738391e43daSPeter Zijlstra 1739391e43daSPeter Zijlstra return 1; 1740391e43daSPeter Zijlstra } 1741391e43daSPeter Zijlstra 1742391e43daSPeter Zijlstra #else 1743391e43daSPeter Zijlstra /* 1744391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 1745391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 1746391e43daSPeter Zijlstra * already in proper order on entry. This favors lower cpu-ids and will 1747391e43daSPeter Zijlstra * grant the double lock to lower cpus over higher ids under contention, 1748391e43daSPeter Zijlstra * regardless of entry order into the function. 1749391e43daSPeter Zijlstra */ 1750391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1751391e43daSPeter Zijlstra __releases(this_rq->lock) 1752391e43daSPeter Zijlstra __acquires(busiest->lock) 1753391e43daSPeter Zijlstra __acquires(this_rq->lock) 1754391e43daSPeter Zijlstra { 1755391e43daSPeter Zijlstra int ret = 0; 1756391e43daSPeter Zijlstra 1757391e43daSPeter Zijlstra if (unlikely(!raw_spin_trylock(&busiest->lock))) { 1758391e43daSPeter Zijlstra if (busiest < this_rq) { 1759391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1760391e43daSPeter Zijlstra raw_spin_lock(&busiest->lock); 1761391e43daSPeter Zijlstra raw_spin_lock_nested(&this_rq->lock, 1762391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1763391e43daSPeter Zijlstra ret = 1; 1764391e43daSPeter Zijlstra } else 1765391e43daSPeter Zijlstra raw_spin_lock_nested(&busiest->lock, 1766391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1767391e43daSPeter Zijlstra } 1768391e43daSPeter Zijlstra return ret; 1769391e43daSPeter Zijlstra } 1770391e43daSPeter Zijlstra 1771391e43daSPeter Zijlstra #endif /* CONFIG_PREEMPT */ 1772391e43daSPeter Zijlstra 1773391e43daSPeter Zijlstra /* 1774391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 1775391e43daSPeter Zijlstra */ 1776391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 1777391e43daSPeter Zijlstra { 1778391e43daSPeter Zijlstra if (unlikely(!irqs_disabled())) { 1779391e43daSPeter Zijlstra /* printk() doesn't work good under rq->lock */ 1780391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1781391e43daSPeter Zijlstra BUG_ON(1); 1782391e43daSPeter Zijlstra } 1783391e43daSPeter Zijlstra 1784391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 1785391e43daSPeter Zijlstra } 1786391e43daSPeter Zijlstra 1787391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 1788391e43daSPeter Zijlstra __releases(busiest->lock) 1789391e43daSPeter Zijlstra { 1790391e43daSPeter Zijlstra raw_spin_unlock(&busiest->lock); 1791391e43daSPeter Zijlstra lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); 1792391e43daSPeter Zijlstra } 1793391e43daSPeter Zijlstra 179474602315SPeter Zijlstra static inline void double_lock(spinlock_t *l1, spinlock_t *l2) 179574602315SPeter Zijlstra { 179674602315SPeter Zijlstra if (l1 > l2) 179774602315SPeter Zijlstra swap(l1, l2); 179874602315SPeter Zijlstra 179974602315SPeter Zijlstra spin_lock(l1); 180074602315SPeter Zijlstra spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 180174602315SPeter Zijlstra } 180274602315SPeter Zijlstra 180360e69eedSMike Galbraith static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2) 180460e69eedSMike Galbraith { 180560e69eedSMike Galbraith if (l1 > l2) 180660e69eedSMike Galbraith swap(l1, l2); 180760e69eedSMike Galbraith 180860e69eedSMike Galbraith spin_lock_irq(l1); 180960e69eedSMike Galbraith spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 181060e69eedSMike Galbraith } 181160e69eedSMike Galbraith 181274602315SPeter Zijlstra static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) 181374602315SPeter Zijlstra { 181474602315SPeter Zijlstra if (l1 > l2) 181574602315SPeter Zijlstra swap(l1, l2); 181674602315SPeter Zijlstra 181774602315SPeter Zijlstra raw_spin_lock(l1); 181874602315SPeter Zijlstra raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 181974602315SPeter Zijlstra } 182074602315SPeter Zijlstra 1821391e43daSPeter Zijlstra /* 1822391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1823391e43daSPeter Zijlstra * 1824391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1825391e43daSPeter Zijlstra * you need to do so manually before calling. 1826391e43daSPeter Zijlstra */ 1827391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1828391e43daSPeter Zijlstra __acquires(rq1->lock) 1829391e43daSPeter Zijlstra __acquires(rq2->lock) 1830391e43daSPeter Zijlstra { 1831391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1832391e43daSPeter Zijlstra if (rq1 == rq2) { 1833391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1834391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1835391e43daSPeter Zijlstra } else { 1836391e43daSPeter Zijlstra if (rq1 < rq2) { 1837391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1838391e43daSPeter Zijlstra raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); 1839391e43daSPeter Zijlstra } else { 1840391e43daSPeter Zijlstra raw_spin_lock(&rq2->lock); 1841391e43daSPeter Zijlstra raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); 1842391e43daSPeter Zijlstra } 1843391e43daSPeter Zijlstra } 1844391e43daSPeter Zijlstra } 1845391e43daSPeter Zijlstra 1846391e43daSPeter Zijlstra /* 1847391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1848391e43daSPeter Zijlstra * 1849391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1850391e43daSPeter Zijlstra * you need to do so manually after calling. 1851391e43daSPeter Zijlstra */ 1852391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1853391e43daSPeter Zijlstra __releases(rq1->lock) 1854391e43daSPeter Zijlstra __releases(rq2->lock) 1855391e43daSPeter Zijlstra { 1856391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1857391e43daSPeter Zijlstra if (rq1 != rq2) 1858391e43daSPeter Zijlstra raw_spin_unlock(&rq2->lock); 1859391e43daSPeter Zijlstra else 1860391e43daSPeter Zijlstra __release(rq2->lock); 1861391e43daSPeter Zijlstra } 1862391e43daSPeter Zijlstra 1863f2cb1360SIngo Molnar extern void set_rq_online (struct rq *rq); 1864f2cb1360SIngo Molnar extern void set_rq_offline(struct rq *rq); 1865f2cb1360SIngo Molnar extern bool sched_smp_initialized; 1866f2cb1360SIngo Molnar 1867391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1868391e43daSPeter Zijlstra 1869391e43daSPeter Zijlstra /* 1870391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1871391e43daSPeter Zijlstra * 1872391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1873391e43daSPeter Zijlstra * you need to do so manually before calling. 1874391e43daSPeter Zijlstra */ 1875391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1876391e43daSPeter Zijlstra __acquires(rq1->lock) 1877391e43daSPeter Zijlstra __acquires(rq2->lock) 1878391e43daSPeter Zijlstra { 1879391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1880391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1881391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1882391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1883391e43daSPeter Zijlstra } 1884391e43daSPeter Zijlstra 1885391e43daSPeter Zijlstra /* 1886391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1887391e43daSPeter Zijlstra * 1888391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1889391e43daSPeter Zijlstra * you need to do so manually after calling. 1890391e43daSPeter Zijlstra */ 1891391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1892391e43daSPeter Zijlstra __releases(rq1->lock) 1893391e43daSPeter Zijlstra __releases(rq2->lock) 1894391e43daSPeter Zijlstra { 1895391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1896391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1897391e43daSPeter Zijlstra __release(rq2->lock); 1898391e43daSPeter Zijlstra } 1899391e43daSPeter Zijlstra 1900391e43daSPeter Zijlstra #endif 1901391e43daSPeter Zijlstra 1902391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 1903391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 19046b55c965SSrikar Dronamraju 19056b55c965SSrikar Dronamraju #ifdef CONFIG_SCHED_DEBUG 1906391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 1907391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 1908acb32132SWanpeng Li extern void print_dl_stats(struct seq_file *m, int cpu); 19096b55c965SSrikar Dronamraju extern void 19106b55c965SSrikar Dronamraju print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq); 1911397f2378SSrikar Dronamraju #ifdef CONFIG_NUMA_BALANCING 1912397f2378SSrikar Dronamraju extern void 1913397f2378SSrikar Dronamraju show_numa_stats(struct task_struct *p, struct seq_file *m); 1914397f2378SSrikar Dronamraju extern void 1915397f2378SSrikar Dronamraju print_numa_stats(struct seq_file *m, int node, unsigned long tsf, 1916397f2378SSrikar Dronamraju unsigned long tpf, unsigned long gsf, unsigned long gpf); 1917397f2378SSrikar Dronamraju #endif /* CONFIG_NUMA_BALANCING */ 1918397f2378SSrikar Dronamraju #endif /* CONFIG_SCHED_DEBUG */ 1919391e43daSPeter Zijlstra 1920391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 192107c54f7aSAbel Vesa extern void init_rt_rq(struct rt_rq *rt_rq); 192207c54f7aSAbel Vesa extern void init_dl_rq(struct dl_rq *dl_rq); 1923391e43daSPeter Zijlstra 19241ee14e6cSBen Segall extern void cfs_bandwidth_usage_inc(void); 19251ee14e6cSBen Segall extern void cfs_bandwidth_usage_dec(void); 19261c792db7SSuresh Siddha 19273451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 19281c792db7SSuresh Siddha enum rq_nohz_flag_bits { 19291c792db7SSuresh Siddha NOHZ_TICK_STOPPED, 19301c792db7SSuresh Siddha NOHZ_BALANCE_KICK, 19311c792db7SSuresh Siddha }; 19321c792db7SSuresh Siddha 19331c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 193420a5c8ccSThomas Gleixner 193520a5c8ccSThomas Gleixner extern void nohz_balance_exit_idle(unsigned int cpu); 193620a5c8ccSThomas Gleixner #else 193720a5c8ccSThomas Gleixner static inline void nohz_balance_exit_idle(unsigned int cpu) { } 19381c792db7SSuresh Siddha #endif 193973fbec60SFrederic Weisbecker 194073fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 194119d23dbfSFrederic Weisbecker struct irqtime { 194225e2d8c1SFrederic Weisbecker u64 total; 1943a499a5a1SFrederic Weisbecker u64 tick_delta; 194419d23dbfSFrederic Weisbecker u64 irq_start_time; 194519d23dbfSFrederic Weisbecker struct u64_stats_sync sync; 194619d23dbfSFrederic Weisbecker }; 194773fbec60SFrederic Weisbecker 194819d23dbfSFrederic Weisbecker DECLARE_PER_CPU(struct irqtime, cpu_irqtime); 194973fbec60SFrederic Weisbecker 195025e2d8c1SFrederic Weisbecker /* 195125e2d8c1SFrederic Weisbecker * Returns the irqtime minus the softirq time computed by ksoftirqd. 195225e2d8c1SFrederic Weisbecker * Otherwise ksoftirqd's sum_exec_runtime is substracted its own runtime 195325e2d8c1SFrederic Weisbecker * and never move forward. 195425e2d8c1SFrederic Weisbecker */ 195573fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 195673fbec60SFrederic Weisbecker { 195719d23dbfSFrederic Weisbecker struct irqtime *irqtime = &per_cpu(cpu_irqtime, cpu); 195819d23dbfSFrederic Weisbecker unsigned int seq; 195919d23dbfSFrederic Weisbecker u64 total; 196073fbec60SFrederic Weisbecker 196173fbec60SFrederic Weisbecker do { 196219d23dbfSFrederic Weisbecker seq = __u64_stats_fetch_begin(&irqtime->sync); 196325e2d8c1SFrederic Weisbecker total = irqtime->total; 196419d23dbfSFrederic Weisbecker } while (__u64_stats_fetch_retry(&irqtime->sync, seq)); 196573fbec60SFrederic Weisbecker 196619d23dbfSFrederic Weisbecker return total; 196773fbec60SFrederic Weisbecker } 196873fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 1969adaf9fcdSRafael J. Wysocki 1970adaf9fcdSRafael J. Wysocki #ifdef CONFIG_CPU_FREQ 1971adaf9fcdSRafael J. Wysocki DECLARE_PER_CPU(struct update_util_data *, cpufreq_update_util_data); 1972adaf9fcdSRafael J. Wysocki 1973adaf9fcdSRafael J. Wysocki /** 1974adaf9fcdSRafael J. Wysocki * cpufreq_update_util - Take a note about CPU utilization changes. 197512bde33dSRafael J. Wysocki * @rq: Runqueue to carry out the update for. 197658919e83SRafael J. Wysocki * @flags: Update reason flags. 1977adaf9fcdSRafael J. Wysocki * 197858919e83SRafael J. Wysocki * This function is called by the scheduler on the CPU whose utilization is 197958919e83SRafael J. Wysocki * being updated. 1980adaf9fcdSRafael J. Wysocki * 1981adaf9fcdSRafael J. Wysocki * It can only be called from RCU-sched read-side critical sections. 1982adaf9fcdSRafael J. Wysocki * 1983adaf9fcdSRafael J. Wysocki * The way cpufreq is currently arranged requires it to evaluate the CPU 1984adaf9fcdSRafael J. Wysocki * performance state (frequency/voltage) on a regular basis to prevent it from 1985adaf9fcdSRafael J. Wysocki * being stuck in a completely inadequate performance level for too long. 1986adaf9fcdSRafael J. Wysocki * That is not guaranteed to happen if the updates are only triggered from CFS, 1987adaf9fcdSRafael J. Wysocki * though, because they may not be coming in if RT or deadline tasks are active 1988adaf9fcdSRafael J. Wysocki * all the time (or there are RT and DL tasks only). 1989adaf9fcdSRafael J. Wysocki * 1990adaf9fcdSRafael J. Wysocki * As a workaround for that issue, this function is called by the RT and DL 1991adaf9fcdSRafael J. Wysocki * sched classes to trigger extra cpufreq updates to prevent it from stalling, 1992adaf9fcdSRafael J. Wysocki * but that really is a band-aid. Going forward it should be replaced with 1993adaf9fcdSRafael J. Wysocki * solutions targeted more specifically at RT and DL tasks. 1994adaf9fcdSRafael J. Wysocki */ 199512bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) 1996adaf9fcdSRafael J. Wysocki { 199758919e83SRafael J. Wysocki struct update_util_data *data; 199858919e83SRafael J. Wysocki 199958919e83SRafael J. Wysocki data = rcu_dereference_sched(*this_cpu_ptr(&cpufreq_update_util_data)); 200058919e83SRafael J. Wysocki if (data) 200112bde33dSRafael J. Wysocki data->func(data, rq_clock(rq), flags); 200212bde33dSRafael J. Wysocki } 200312bde33dSRafael J. Wysocki 200412bde33dSRafael J. Wysocki static inline void cpufreq_update_this_cpu(struct rq *rq, unsigned int flags) 200512bde33dSRafael J. Wysocki { 200612bde33dSRafael J. Wysocki if (cpu_of(rq) == smp_processor_id()) 200712bde33dSRafael J. Wysocki cpufreq_update_util(rq, flags); 2008adaf9fcdSRafael J. Wysocki } 2009adaf9fcdSRafael J. Wysocki #else 201012bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) {} 201112bde33dSRafael J. Wysocki static inline void cpufreq_update_this_cpu(struct rq *rq, unsigned int flags) {} 2012adaf9fcdSRafael J. Wysocki #endif /* CONFIG_CPU_FREQ */ 2013be53f58fSLinus Torvalds 20149bdcb44eSRafael J. Wysocki #ifdef arch_scale_freq_capacity 20159bdcb44eSRafael J. Wysocki #ifndef arch_scale_freq_invariant 20169bdcb44eSRafael J. Wysocki #define arch_scale_freq_invariant() (true) 20179bdcb44eSRafael J. Wysocki #endif 20189bdcb44eSRafael J. Wysocki #else /* arch_scale_freq_capacity */ 20199bdcb44eSRafael J. Wysocki #define arch_scale_freq_invariant() (false) 20209bdcb44eSRafael J. Wysocki #endif 2021