1391e43daSPeter Zijlstra 2391e43daSPeter Zijlstra #include <linux/sched.h> 3cf4aebc2SClark Williams #include <linux/sched/sysctl.h> 4*105ab3d8SIngo Molnar #include <linux/sched/topology.h> 58bd75c77SClark Williams #include <linux/sched/rt.h> 619d23dbfSFrederic Weisbecker #include <linux/u64_stats_sync.h> 7aab03e05SDario Faggioli #include <linux/sched/deadline.h> 8a499a5a1SFrederic Weisbecker #include <linux/kernel_stat.h> 93866e845SSteven Rostedt (Red Hat) #include <linux/binfmts.h> 10391e43daSPeter Zijlstra #include <linux/mutex.h> 11391e43daSPeter Zijlstra #include <linux/spinlock.h> 12391e43daSPeter Zijlstra #include <linux/stop_machine.h> 13b6366f04SSteven Rostedt #include <linux/irq_work.h> 149f3660c2SFrederic Weisbecker #include <linux/tick.h> 15f809ca9aSMel Gorman #include <linux/slab.h> 16391e43daSPeter Zijlstra 17391e43daSPeter Zijlstra #include "cpupri.h" 186bfd6d72SJuri Lelli #include "cpudeadline.h" 1960fed789SLi Zefan #include "cpuacct.h" 20391e43daSPeter Zijlstra 219148a3a1SPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 229148a3a1SPeter Zijlstra #define SCHED_WARN_ON(x) WARN_ONCE(x, #x) 239148a3a1SPeter Zijlstra #else 249148a3a1SPeter Zijlstra #define SCHED_WARN_ON(x) ((void)(x)) 259148a3a1SPeter Zijlstra #endif 269148a3a1SPeter Zijlstra 2745ceebf7SPaul Gortmaker struct rq; 28442bf3aaSDaniel Lezcano struct cpuidle_state; 2945ceebf7SPaul Gortmaker 30da0c1e65SKirill Tkhai /* task_struct::on_rq states: */ 31da0c1e65SKirill Tkhai #define TASK_ON_RQ_QUEUED 1 32cca26e80SKirill Tkhai #define TASK_ON_RQ_MIGRATING 2 33da0c1e65SKirill Tkhai 34391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 35391e43daSPeter Zijlstra 3645ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 3745ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 3845ceebf7SPaul Gortmaker 393289bdb4SPeter Zijlstra extern void calc_global_load_tick(struct rq *this_rq); 40d60585c5SThomas Gleixner extern long calc_load_fold_active(struct rq *this_rq, long adjust); 413289bdb4SPeter Zijlstra 423289bdb4SPeter Zijlstra #ifdef CONFIG_SMP 43cee1afceSFrederic Weisbecker extern void cpu_load_update_active(struct rq *this_rq); 443289bdb4SPeter Zijlstra #else 45cee1afceSFrederic Weisbecker static inline void cpu_load_update_active(struct rq *this_rq) { } 463289bdb4SPeter Zijlstra #endif 4745ceebf7SPaul Gortmaker 48391e43daSPeter Zijlstra /* 49391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 50391e43daSPeter Zijlstra */ 51391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 52391e43daSPeter Zijlstra 53cc1f4b1fSLi Zefan /* 54cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 55cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 56cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 57cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 58cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 59cc1f4b1fSLi Zefan * 60cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 612159197dSPeter Zijlstra * resolution (i.e. 64bit). The costs for increasing resolution when 32bit are 622159197dSPeter Zijlstra * pretty high and the returns do not justify the increased costs. 632159197dSPeter Zijlstra * 642159197dSPeter Zijlstra * Really only required when CONFIG_FAIR_GROUP_SCHED is also set, but to 652159197dSPeter Zijlstra * increase coverage and consistency always enable it on 64bit platforms. 66cc1f4b1fSLi Zefan */ 672159197dSPeter Zijlstra #ifdef CONFIG_64BIT 68172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT + SCHED_FIXEDPOINT_SHIFT) 696ecdd749SYuyang Du # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT) 706ecdd749SYuyang Du # define scale_load_down(w) ((w) >> SCHED_FIXEDPOINT_SHIFT) 71cc1f4b1fSLi Zefan #else 72172895e6SYuyang Du # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT) 73cc1f4b1fSLi Zefan # define scale_load(w) (w) 74cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 75cc1f4b1fSLi Zefan #endif 76cc1f4b1fSLi Zefan 776ecdd749SYuyang Du /* 78172895e6SYuyang Du * Task weight (visible to users) and its load (invisible to users) have 79172895e6SYuyang Du * independent resolution, but they should be well calibrated. We use 80172895e6SYuyang Du * scale_load() and scale_load_down(w) to convert between them. The 81172895e6SYuyang Du * following must be true: 82172895e6SYuyang Du * 83172895e6SYuyang Du * scale_load(sched_prio_to_weight[USER_PRIO(NICE_TO_PRIO(0))]) == NICE_0_LOAD 84172895e6SYuyang Du * 856ecdd749SYuyang Du */ 86172895e6SYuyang Du #define NICE_0_LOAD (1L << NICE_0_LOAD_SHIFT) 87391e43daSPeter Zijlstra 88391e43daSPeter Zijlstra /* 89332ac17eSDario Faggioli * Single value that decides SCHED_DEADLINE internal math precision. 90332ac17eSDario Faggioli * 10 -> just above 1us 91332ac17eSDario Faggioli * 9 -> just above 0.5us 92332ac17eSDario Faggioli */ 93332ac17eSDario Faggioli #define DL_SCALE (10) 94332ac17eSDario Faggioli 95332ac17eSDario Faggioli /* 96391e43daSPeter Zijlstra * These are the 'tuning knobs' of the scheduler: 97391e43daSPeter Zijlstra */ 98391e43daSPeter Zijlstra 99391e43daSPeter Zijlstra /* 100391e43daSPeter Zijlstra * single value that denotes runtime == period, ie unlimited time. 101391e43daSPeter Zijlstra */ 102391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 103391e43daSPeter Zijlstra 10420f9cd2aSHenrik Austad static inline int idle_policy(int policy) 10520f9cd2aSHenrik Austad { 10620f9cd2aSHenrik Austad return policy == SCHED_IDLE; 10720f9cd2aSHenrik Austad } 108d50dde5aSDario Faggioli static inline int fair_policy(int policy) 109d50dde5aSDario Faggioli { 110d50dde5aSDario Faggioli return policy == SCHED_NORMAL || policy == SCHED_BATCH; 111d50dde5aSDario Faggioli } 112d50dde5aSDario Faggioli 113391e43daSPeter Zijlstra static inline int rt_policy(int policy) 114391e43daSPeter Zijlstra { 115d50dde5aSDario Faggioli return policy == SCHED_FIFO || policy == SCHED_RR; 116391e43daSPeter Zijlstra } 117391e43daSPeter Zijlstra 118aab03e05SDario Faggioli static inline int dl_policy(int policy) 119aab03e05SDario Faggioli { 120aab03e05SDario Faggioli return policy == SCHED_DEADLINE; 121aab03e05SDario Faggioli } 12220f9cd2aSHenrik Austad static inline bool valid_policy(int policy) 12320f9cd2aSHenrik Austad { 12420f9cd2aSHenrik Austad return idle_policy(policy) || fair_policy(policy) || 12520f9cd2aSHenrik Austad rt_policy(policy) || dl_policy(policy); 12620f9cd2aSHenrik Austad } 127aab03e05SDario Faggioli 128391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 129391e43daSPeter Zijlstra { 130391e43daSPeter Zijlstra return rt_policy(p->policy); 131391e43daSPeter Zijlstra } 132391e43daSPeter Zijlstra 133aab03e05SDario Faggioli static inline int task_has_dl_policy(struct task_struct *p) 134aab03e05SDario Faggioli { 135aab03e05SDario Faggioli return dl_policy(p->policy); 136aab03e05SDario Faggioli } 137aab03e05SDario Faggioli 1382d3d891dSDario Faggioli /* 1392d3d891dSDario Faggioli * Tells if entity @a should preempt entity @b. 1402d3d891dSDario Faggioli */ 141332ac17eSDario Faggioli static inline bool 142332ac17eSDario Faggioli dl_entity_preempt(struct sched_dl_entity *a, struct sched_dl_entity *b) 1432d3d891dSDario Faggioli { 1442d3d891dSDario Faggioli return dl_time_before(a->deadline, b->deadline); 1452d3d891dSDario Faggioli } 1462d3d891dSDario Faggioli 147391e43daSPeter Zijlstra /* 148391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 149391e43daSPeter Zijlstra */ 150391e43daSPeter Zijlstra struct rt_prio_array { 151391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 152391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 153391e43daSPeter Zijlstra }; 154391e43daSPeter Zijlstra 155391e43daSPeter Zijlstra struct rt_bandwidth { 156391e43daSPeter Zijlstra /* nests inside the rq lock: */ 157391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 158391e43daSPeter Zijlstra ktime_t rt_period; 159391e43daSPeter Zijlstra u64 rt_runtime; 160391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 1614cfafd30SPeter Zijlstra unsigned int rt_period_active; 162391e43daSPeter Zijlstra }; 163a5e7be3bSJuri Lelli 164a5e7be3bSJuri Lelli void __dl_clear_params(struct task_struct *p); 165a5e7be3bSJuri Lelli 166332ac17eSDario Faggioli /* 167332ac17eSDario Faggioli * To keep the bandwidth of -deadline tasks and groups under control 168332ac17eSDario Faggioli * we need some place where: 169332ac17eSDario Faggioli * - store the maximum -deadline bandwidth of the system (the group); 170332ac17eSDario Faggioli * - cache the fraction of that bandwidth that is currently allocated. 171332ac17eSDario Faggioli * 172332ac17eSDario Faggioli * This is all done in the data structure below. It is similar to the 173332ac17eSDario Faggioli * one used for RT-throttling (rt_bandwidth), with the main difference 174332ac17eSDario Faggioli * that, since here we are only interested in admission control, we 175332ac17eSDario Faggioli * do not decrease any runtime while the group "executes", neither we 176332ac17eSDario Faggioli * need a timer to replenish it. 177332ac17eSDario Faggioli * 178332ac17eSDario Faggioli * With respect to SMP, the bandwidth is given on a per-CPU basis, 179332ac17eSDario Faggioli * meaning that: 180332ac17eSDario Faggioli * - dl_bw (< 100%) is the bandwidth of the system (group) on each CPU; 181332ac17eSDario Faggioli * - dl_total_bw array contains, in the i-eth element, the currently 182332ac17eSDario Faggioli * allocated bandwidth on the i-eth CPU. 183332ac17eSDario Faggioli * Moreover, groups consume bandwidth on each CPU, while tasks only 184332ac17eSDario Faggioli * consume bandwidth on the CPU they're running on. 185332ac17eSDario Faggioli * Finally, dl_total_bw_cpu is used to cache the index of dl_total_bw 186332ac17eSDario Faggioli * that will be shown the next time the proc or cgroup controls will 187332ac17eSDario Faggioli * be red. It on its turn can be changed by writing on its own 188332ac17eSDario Faggioli * control. 189332ac17eSDario Faggioli */ 190332ac17eSDario Faggioli struct dl_bandwidth { 191332ac17eSDario Faggioli raw_spinlock_t dl_runtime_lock; 192332ac17eSDario Faggioli u64 dl_runtime; 193332ac17eSDario Faggioli u64 dl_period; 194332ac17eSDario Faggioli }; 195332ac17eSDario Faggioli 196332ac17eSDario Faggioli static inline int dl_bandwidth_enabled(void) 197332ac17eSDario Faggioli { 1981724813dSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 199332ac17eSDario Faggioli } 200332ac17eSDario Faggioli 201332ac17eSDario Faggioli extern struct dl_bw *dl_bw_of(int i); 202332ac17eSDario Faggioli 203332ac17eSDario Faggioli struct dl_bw { 204332ac17eSDario Faggioli raw_spinlock_t lock; 205332ac17eSDario Faggioli u64 bw, total_bw; 206332ac17eSDario Faggioli }; 207332ac17eSDario Faggioli 2087f51412aSJuri Lelli static inline 2097f51412aSJuri Lelli void __dl_clear(struct dl_bw *dl_b, u64 tsk_bw) 2107f51412aSJuri Lelli { 2117f51412aSJuri Lelli dl_b->total_bw -= tsk_bw; 2127f51412aSJuri Lelli } 2137f51412aSJuri Lelli 2147f51412aSJuri Lelli static inline 2157f51412aSJuri Lelli void __dl_add(struct dl_bw *dl_b, u64 tsk_bw) 2167f51412aSJuri Lelli { 2177f51412aSJuri Lelli dl_b->total_bw += tsk_bw; 2187f51412aSJuri Lelli } 2197f51412aSJuri Lelli 2207f51412aSJuri Lelli static inline 2217f51412aSJuri Lelli bool __dl_overflow(struct dl_bw *dl_b, int cpus, u64 old_bw, u64 new_bw) 2227f51412aSJuri Lelli { 2237f51412aSJuri Lelli return dl_b->bw != -1 && 2247f51412aSJuri Lelli dl_b->bw * cpus < dl_b->total_bw - old_bw + new_bw; 2257f51412aSJuri Lelli } 2267f51412aSJuri Lelli 227f2cb1360SIngo Molnar extern void init_dl_bw(struct dl_bw *dl_b); 228391e43daSPeter Zijlstra 229391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 230391e43daSPeter Zijlstra 231391e43daSPeter Zijlstra #include <linux/cgroup.h> 232391e43daSPeter Zijlstra 233391e43daSPeter Zijlstra struct cfs_rq; 234391e43daSPeter Zijlstra struct rt_rq; 235391e43daSPeter Zijlstra 23635cf4e50SMike Galbraith extern struct list_head task_groups; 237391e43daSPeter Zijlstra 238391e43daSPeter Zijlstra struct cfs_bandwidth { 239391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 240391e43daSPeter Zijlstra raw_spinlock_t lock; 241391e43daSPeter Zijlstra ktime_t period; 242391e43daSPeter Zijlstra u64 quota, runtime; 2439c58c79aSZhihui Zhang s64 hierarchical_quota; 244391e43daSPeter Zijlstra u64 runtime_expires; 245391e43daSPeter Zijlstra 2464cfafd30SPeter Zijlstra int idle, period_active; 247391e43daSPeter Zijlstra struct hrtimer period_timer, slack_timer; 248391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 249391e43daSPeter Zijlstra 250391e43daSPeter Zijlstra /* statistics */ 251391e43daSPeter Zijlstra int nr_periods, nr_throttled; 252391e43daSPeter Zijlstra u64 throttled_time; 253391e43daSPeter Zijlstra #endif 254391e43daSPeter Zijlstra }; 255391e43daSPeter Zijlstra 256391e43daSPeter Zijlstra /* task group related information */ 257391e43daSPeter Zijlstra struct task_group { 258391e43daSPeter Zijlstra struct cgroup_subsys_state css; 259391e43daSPeter Zijlstra 260391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 261391e43daSPeter Zijlstra /* schedulable entities of this group on each cpu */ 262391e43daSPeter Zijlstra struct sched_entity **se; 263391e43daSPeter Zijlstra /* runqueue "owned" by this group on each cpu */ 264391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 265391e43daSPeter Zijlstra unsigned long shares; 266391e43daSPeter Zijlstra 267fa6bddebSAlex Shi #ifdef CONFIG_SMP 268b0367629SWaiman Long /* 269b0367629SWaiman Long * load_avg can be heavily contended at clock tick time, so put 270b0367629SWaiman Long * it in its own cacheline separated from the fields above which 271b0367629SWaiman Long * will also be accessed at each tick. 272b0367629SWaiman Long */ 273b0367629SWaiman Long atomic_long_t load_avg ____cacheline_aligned; 274391e43daSPeter Zijlstra #endif 275fa6bddebSAlex Shi #endif 276391e43daSPeter Zijlstra 277391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 278391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 279391e43daSPeter Zijlstra struct rt_rq **rt_rq; 280391e43daSPeter Zijlstra 281391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 282391e43daSPeter Zijlstra #endif 283391e43daSPeter Zijlstra 284391e43daSPeter Zijlstra struct rcu_head rcu; 285391e43daSPeter Zijlstra struct list_head list; 286391e43daSPeter Zijlstra 287391e43daSPeter Zijlstra struct task_group *parent; 288391e43daSPeter Zijlstra struct list_head siblings; 289391e43daSPeter Zijlstra struct list_head children; 290391e43daSPeter Zijlstra 291391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 292391e43daSPeter Zijlstra struct autogroup *autogroup; 293391e43daSPeter Zijlstra #endif 294391e43daSPeter Zijlstra 295391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 296391e43daSPeter Zijlstra }; 297391e43daSPeter Zijlstra 298391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 299391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 300391e43daSPeter Zijlstra 301391e43daSPeter Zijlstra /* 302391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 303391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 304391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 305391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 306391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 307391e43daSPeter Zijlstra * limitation from this.) 308391e43daSPeter Zijlstra */ 309391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 310391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 311391e43daSPeter Zijlstra #endif 312391e43daSPeter Zijlstra 313391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 314391e43daSPeter Zijlstra 315391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 316391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 317391e43daSPeter Zijlstra 318391e43daSPeter Zijlstra /* 319391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 320391e43daSPeter Zijlstra * leaving it for the final time. 321391e43daSPeter Zijlstra * 322391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 323391e43daSPeter Zijlstra */ 324391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 325391e43daSPeter Zijlstra { 326391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 327391e43daSPeter Zijlstra } 328391e43daSPeter Zijlstra 329391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 330391e43daSPeter Zijlstra 331391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 332391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 3338663e24dSPeter Zijlstra extern void online_fair_sched_group(struct task_group *tg); 3346fe1f348SPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg); 335391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 336391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 337391e43daSPeter Zijlstra struct sched_entity *parent); 338391e43daSPeter Zijlstra extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 339391e43daSPeter Zijlstra 340391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 34177a4d1a1SPeter Zijlstra extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 342391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 343391e43daSPeter Zijlstra 344391e43daSPeter Zijlstra extern void free_rt_sched_group(struct task_group *tg); 345391e43daSPeter Zijlstra extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 346391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 347391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 348391e43daSPeter Zijlstra struct sched_rt_entity *parent); 349391e43daSPeter Zijlstra 35025cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 35125cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 35225cc7da7SLi Zefan struct task_group *parent); 35325cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 35425cc7da7SLi Zefan extern void sched_offline_group(struct task_group *tg); 35525cc7da7SLi Zefan 35625cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 35725cc7da7SLi Zefan 35825cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 35925cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 360ad936d86SByungchul Park 361ad936d86SByungchul Park #ifdef CONFIG_SMP 362ad936d86SByungchul Park extern void set_task_rq_fair(struct sched_entity *se, 363ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next); 364ad936d86SByungchul Park #else /* !CONFIG_SMP */ 365ad936d86SByungchul Park static inline void set_task_rq_fair(struct sched_entity *se, 366ad936d86SByungchul Park struct cfs_rq *prev, struct cfs_rq *next) { } 367ad936d86SByungchul Park #endif /* CONFIG_SMP */ 368ad936d86SByungchul Park #endif /* CONFIG_FAIR_GROUP_SCHED */ 36925cc7da7SLi Zefan 370391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 371391e43daSPeter Zijlstra 372391e43daSPeter Zijlstra struct cfs_bandwidth { }; 373391e43daSPeter Zijlstra 374391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 375391e43daSPeter Zijlstra 376391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 377391e43daSPeter Zijlstra struct cfs_rq { 378391e43daSPeter Zijlstra struct load_weight load; 379c82513e5SPeter Zijlstra unsigned int nr_running, h_nr_running; 380391e43daSPeter Zijlstra 381391e43daSPeter Zijlstra u64 exec_clock; 382391e43daSPeter Zijlstra u64 min_vruntime; 383391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 384391e43daSPeter Zijlstra u64 min_vruntime_copy; 385391e43daSPeter Zijlstra #endif 386391e43daSPeter Zijlstra 387391e43daSPeter Zijlstra struct rb_root tasks_timeline; 388391e43daSPeter Zijlstra struct rb_node *rb_leftmost; 389391e43daSPeter Zijlstra 390391e43daSPeter Zijlstra /* 391391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 392391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 393391e43daSPeter Zijlstra */ 394391e43daSPeter Zijlstra struct sched_entity *curr, *next, *last, *skip; 395391e43daSPeter Zijlstra 396391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 397391e43daSPeter Zijlstra unsigned int nr_spread_over; 398391e43daSPeter Zijlstra #endif 399391e43daSPeter Zijlstra 4002dac754eSPaul Turner #ifdef CONFIG_SMP 4012dac754eSPaul Turner /* 4029d89c257SYuyang Du * CFS load tracking 4032dac754eSPaul Turner */ 4049d89c257SYuyang Du struct sched_avg avg; 40513962234SYuyang Du u64 runnable_load_sum; 40613962234SYuyang Du unsigned long runnable_load_avg; 4079d89c257SYuyang Du #ifdef CONFIG_FAIR_GROUP_SCHED 4089d89c257SYuyang Du unsigned long tg_load_avg_contrib; 40909a43aceSVincent Guittot unsigned long propagate_avg; 4109d89c257SYuyang Du #endif 4119d89c257SYuyang Du atomic_long_t removed_load_avg, removed_util_avg; 4129d89c257SYuyang Du #ifndef CONFIG_64BIT 4139d89c257SYuyang Du u64 load_last_update_time_copy; 4149d89c257SYuyang Du #endif 415141965c7SAlex Shi 416c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 41782958366SPaul Turner /* 41882958366SPaul Turner * h_load = weight * f(tg) 41982958366SPaul Turner * 42082958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 42182958366SPaul Turner * this group. 42282958366SPaul Turner */ 42382958366SPaul Turner unsigned long h_load; 42468520796SVladimir Davydov u64 last_h_load_update; 42568520796SVladimir Davydov struct sched_entity *h_load_next; 42668520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 42782958366SPaul Turner #endif /* CONFIG_SMP */ 42882958366SPaul Turner 429391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 430391e43daSPeter Zijlstra struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ 431391e43daSPeter Zijlstra 432391e43daSPeter Zijlstra /* 433391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 434391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 435391e43daSPeter Zijlstra * (like users, containers etc.) 436391e43daSPeter Zijlstra * 437391e43daSPeter Zijlstra * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This 438391e43daSPeter Zijlstra * list is used during load balance. 439391e43daSPeter Zijlstra */ 440391e43daSPeter Zijlstra int on_list; 441391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 442391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 443391e43daSPeter Zijlstra 444391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 445391e43daSPeter Zijlstra int runtime_enabled; 446391e43daSPeter Zijlstra u64 runtime_expires; 447391e43daSPeter Zijlstra s64 runtime_remaining; 448391e43daSPeter Zijlstra 449f1b17280SPaul Turner u64 throttled_clock, throttled_clock_task; 450f1b17280SPaul Turner u64 throttled_clock_task_time; 45155e16d30SPeter Zijlstra int throttled, throttle_count; 452391e43daSPeter Zijlstra struct list_head throttled_list; 453391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 454391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 455391e43daSPeter Zijlstra }; 456391e43daSPeter Zijlstra 457391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 458391e43daSPeter Zijlstra { 459391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 460391e43daSPeter Zijlstra } 461391e43daSPeter Zijlstra 462b6366f04SSteven Rostedt /* RT IPI pull logic requires IRQ_WORK */ 463b6366f04SSteven Rostedt #ifdef CONFIG_IRQ_WORK 464b6366f04SSteven Rostedt # define HAVE_RT_PUSH_IPI 465b6366f04SSteven Rostedt #endif 466b6366f04SSteven Rostedt 467391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 468391e43daSPeter Zijlstra struct rt_rq { 469391e43daSPeter Zijlstra struct rt_prio_array active; 470c82513e5SPeter Zijlstra unsigned int rt_nr_running; 47101d36d0aSFrederic Weisbecker unsigned int rr_nr_running; 472391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 473391e43daSPeter Zijlstra struct { 474391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 475391e43daSPeter Zijlstra #ifdef CONFIG_SMP 476391e43daSPeter Zijlstra int next; /* next highest */ 477391e43daSPeter Zijlstra #endif 478391e43daSPeter Zijlstra } highest_prio; 479391e43daSPeter Zijlstra #endif 480391e43daSPeter Zijlstra #ifdef CONFIG_SMP 481391e43daSPeter Zijlstra unsigned long rt_nr_migratory; 482391e43daSPeter Zijlstra unsigned long rt_nr_total; 483391e43daSPeter Zijlstra int overloaded; 484391e43daSPeter Zijlstra struct plist_head pushable_tasks; 485b6366f04SSteven Rostedt #ifdef HAVE_RT_PUSH_IPI 486b6366f04SSteven Rostedt int push_flags; 487b6366f04SSteven Rostedt int push_cpu; 488b6366f04SSteven Rostedt struct irq_work push_work; 489b6366f04SSteven Rostedt raw_spinlock_t push_lock; 490391e43daSPeter Zijlstra #endif 491b6366f04SSteven Rostedt #endif /* CONFIG_SMP */ 492f4ebcbc0SKirill Tkhai int rt_queued; 493f4ebcbc0SKirill Tkhai 494391e43daSPeter Zijlstra int rt_throttled; 495391e43daSPeter Zijlstra u64 rt_time; 496391e43daSPeter Zijlstra u64 rt_runtime; 497391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 498391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 499391e43daSPeter Zijlstra 500391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 501391e43daSPeter Zijlstra unsigned long rt_nr_boosted; 502391e43daSPeter Zijlstra 503391e43daSPeter Zijlstra struct rq *rq; 504391e43daSPeter Zijlstra struct task_group *tg; 505391e43daSPeter Zijlstra #endif 506391e43daSPeter Zijlstra }; 507391e43daSPeter Zijlstra 508aab03e05SDario Faggioli /* Deadline class' related fields in a runqueue */ 509aab03e05SDario Faggioli struct dl_rq { 510aab03e05SDario Faggioli /* runqueue is an rbtree, ordered by deadline */ 511aab03e05SDario Faggioli struct rb_root rb_root; 512aab03e05SDario Faggioli struct rb_node *rb_leftmost; 513aab03e05SDario Faggioli 514aab03e05SDario Faggioli unsigned long dl_nr_running; 5151baca4ceSJuri Lelli 5161baca4ceSJuri Lelli #ifdef CONFIG_SMP 5171baca4ceSJuri Lelli /* 5181baca4ceSJuri Lelli * Deadline values of the currently executing and the 5191baca4ceSJuri Lelli * earliest ready task on this rq. Caching these facilitates 5201baca4ceSJuri Lelli * the decision wether or not a ready but not running task 5211baca4ceSJuri Lelli * should migrate somewhere else. 5221baca4ceSJuri Lelli */ 5231baca4ceSJuri Lelli struct { 5241baca4ceSJuri Lelli u64 curr; 5251baca4ceSJuri Lelli u64 next; 5261baca4ceSJuri Lelli } earliest_dl; 5271baca4ceSJuri Lelli 5281baca4ceSJuri Lelli unsigned long dl_nr_migratory; 5291baca4ceSJuri Lelli int overloaded; 5301baca4ceSJuri Lelli 5311baca4ceSJuri Lelli /* 5321baca4ceSJuri Lelli * Tasks on this rq that can be pushed away. They are kept in 5331baca4ceSJuri Lelli * an rb-tree, ordered by tasks' deadlines, with caching 5341baca4ceSJuri Lelli * of the leftmost (earliest deadline) element. 5351baca4ceSJuri Lelli */ 5361baca4ceSJuri Lelli struct rb_root pushable_dl_tasks_root; 5371baca4ceSJuri Lelli struct rb_node *pushable_dl_tasks_leftmost; 538332ac17eSDario Faggioli #else 539332ac17eSDario Faggioli struct dl_bw dl_bw; 5401baca4ceSJuri Lelli #endif 541aab03e05SDario Faggioli }; 542aab03e05SDario Faggioli 543391e43daSPeter Zijlstra #ifdef CONFIG_SMP 544391e43daSPeter Zijlstra 545afe06efdSTim Chen static inline bool sched_asym_prefer(int a, int b) 546afe06efdSTim Chen { 547afe06efdSTim Chen return arch_asym_cpu_priority(a) > arch_asym_cpu_priority(b); 548afe06efdSTim Chen } 549afe06efdSTim Chen 550391e43daSPeter Zijlstra /* 551391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 552391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 553391e43daSPeter Zijlstra * fully partitioning the member cpus from any other cpuset. Whenever a new 554391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 555391e43daSPeter Zijlstra * object. 556391e43daSPeter Zijlstra * 557391e43daSPeter Zijlstra */ 558391e43daSPeter Zijlstra struct root_domain { 559391e43daSPeter Zijlstra atomic_t refcount; 560391e43daSPeter Zijlstra atomic_t rto_count; 561391e43daSPeter Zijlstra struct rcu_head rcu; 562391e43daSPeter Zijlstra cpumask_var_t span; 563391e43daSPeter Zijlstra cpumask_var_t online; 564391e43daSPeter Zijlstra 5654486edd1STim Chen /* Indicate more than one runnable task for any CPU */ 5664486edd1STim Chen bool overload; 5674486edd1STim Chen 568391e43daSPeter Zijlstra /* 5691baca4ceSJuri Lelli * The bit corresponding to a CPU gets set here if such CPU has more 5701baca4ceSJuri Lelli * than one runnable -deadline task (as it is below for RT tasks). 5711baca4ceSJuri Lelli */ 5721baca4ceSJuri Lelli cpumask_var_t dlo_mask; 5731baca4ceSJuri Lelli atomic_t dlo_count; 574332ac17eSDario Faggioli struct dl_bw dl_bw; 5756bfd6d72SJuri Lelli struct cpudl cpudl; 5761baca4ceSJuri Lelli 5771baca4ceSJuri Lelli /* 578391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 579391e43daSPeter Zijlstra * one runnable RT task. 580391e43daSPeter Zijlstra */ 581391e43daSPeter Zijlstra cpumask_var_t rto_mask; 582391e43daSPeter Zijlstra struct cpupri cpupri; 583cd92bfd3SDietmar Eggemann 584cd92bfd3SDietmar Eggemann unsigned long max_cpu_capacity; 585391e43daSPeter Zijlstra }; 586391e43daSPeter Zijlstra 587391e43daSPeter Zijlstra extern struct root_domain def_root_domain; 588f2cb1360SIngo Molnar extern struct mutex sched_domains_mutex; 589f2cb1360SIngo Molnar extern cpumask_var_t fallback_doms; 590f2cb1360SIngo Molnar extern cpumask_var_t sched_domains_tmpmask; 591f2cb1360SIngo Molnar 592f2cb1360SIngo Molnar extern void init_defrootdomain(void); 593f2cb1360SIngo Molnar extern int init_sched_domains(const struct cpumask *cpu_map); 594f2cb1360SIngo Molnar extern void rq_attach_root(struct rq *rq, struct root_domain *rd); 595391e43daSPeter Zijlstra 596391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 597391e43daSPeter Zijlstra 598391e43daSPeter Zijlstra /* 599391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 600391e43daSPeter Zijlstra * 601391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 602391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 603391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 604391e43daSPeter Zijlstra */ 605391e43daSPeter Zijlstra struct rq { 606391e43daSPeter Zijlstra /* runqueue lock: */ 607391e43daSPeter Zijlstra raw_spinlock_t lock; 608391e43daSPeter Zijlstra 609391e43daSPeter Zijlstra /* 610391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 611391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 612391e43daSPeter Zijlstra */ 613c82513e5SPeter Zijlstra unsigned int nr_running; 6140ec8aa00SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 6150ec8aa00SPeter Zijlstra unsigned int nr_numa_running; 6160ec8aa00SPeter Zijlstra unsigned int nr_preferred_running; 6170ec8aa00SPeter Zijlstra #endif 618391e43daSPeter Zijlstra #define CPU_LOAD_IDX_MAX 5 619391e43daSPeter Zijlstra unsigned long cpu_load[CPU_LOAD_IDX_MAX]; 6203451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 6219fd81dd5SFrederic Weisbecker #ifdef CONFIG_SMP 6229fd81dd5SFrederic Weisbecker unsigned long last_load_update_tick; 6239fd81dd5SFrederic Weisbecker #endif /* CONFIG_SMP */ 6241c792db7SSuresh Siddha unsigned long nohz_flags; 6259fd81dd5SFrederic Weisbecker #endif /* CONFIG_NO_HZ_COMMON */ 626265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 627265f22a9SFrederic Weisbecker unsigned long last_sched_tick; 628265f22a9SFrederic Weisbecker #endif 629391e43daSPeter Zijlstra /* capture load from *all* tasks on this cpu: */ 630391e43daSPeter Zijlstra struct load_weight load; 631391e43daSPeter Zijlstra unsigned long nr_load_updates; 632391e43daSPeter Zijlstra u64 nr_switches; 633391e43daSPeter Zijlstra 634391e43daSPeter Zijlstra struct cfs_rq cfs; 635391e43daSPeter Zijlstra struct rt_rq rt; 636aab03e05SDario Faggioli struct dl_rq dl; 637391e43daSPeter Zijlstra 638391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 639391e43daSPeter Zijlstra /* list of leaf cfs_rq on this cpu: */ 640391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 6419c2791f9SVincent Guittot struct list_head *tmp_alone_branch; 642a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 643a35b6466SPeter Zijlstra 644391e43daSPeter Zijlstra /* 645391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 646391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 647391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 648391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 649391e43daSPeter Zijlstra */ 650391e43daSPeter Zijlstra unsigned long nr_uninterruptible; 651391e43daSPeter Zijlstra 652391e43daSPeter Zijlstra struct task_struct *curr, *idle, *stop; 653391e43daSPeter Zijlstra unsigned long next_balance; 654391e43daSPeter Zijlstra struct mm_struct *prev_mm; 655391e43daSPeter Zijlstra 656cb42c9a3SMatt Fleming unsigned int clock_update_flags; 657391e43daSPeter Zijlstra u64 clock; 658391e43daSPeter Zijlstra u64 clock_task; 659391e43daSPeter Zijlstra 660391e43daSPeter Zijlstra atomic_t nr_iowait; 661391e43daSPeter Zijlstra 662391e43daSPeter Zijlstra #ifdef CONFIG_SMP 663391e43daSPeter Zijlstra struct root_domain *rd; 664391e43daSPeter Zijlstra struct sched_domain *sd; 665391e43daSPeter Zijlstra 666ced549faSNicolas Pitre unsigned long cpu_capacity; 667ca6d75e6SVincent Guittot unsigned long cpu_capacity_orig; 668391e43daSPeter Zijlstra 669e3fca9e7SPeter Zijlstra struct callback_head *balance_callback; 670e3fca9e7SPeter Zijlstra 671391e43daSPeter Zijlstra unsigned char idle_balance; 672391e43daSPeter Zijlstra /* For active balancing */ 673391e43daSPeter Zijlstra int active_balance; 674391e43daSPeter Zijlstra int push_cpu; 675391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 676391e43daSPeter Zijlstra /* cpu of this runqueue: */ 677391e43daSPeter Zijlstra int cpu; 678391e43daSPeter Zijlstra int online; 679391e43daSPeter Zijlstra 680367456c7SPeter Zijlstra struct list_head cfs_tasks; 681367456c7SPeter Zijlstra 682391e43daSPeter Zijlstra u64 rt_avg; 683391e43daSPeter Zijlstra u64 age_stamp; 684391e43daSPeter Zijlstra u64 idle_stamp; 685391e43daSPeter Zijlstra u64 avg_idle; 6869bd721c5SJason Low 6879bd721c5SJason Low /* This is used to determine avg_idle's max value */ 6889bd721c5SJason Low u64 max_idle_balance_cost; 689391e43daSPeter Zijlstra #endif 690391e43daSPeter Zijlstra 691391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 692391e43daSPeter Zijlstra u64 prev_irq_time; 693391e43daSPeter Zijlstra #endif 694391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 695391e43daSPeter Zijlstra u64 prev_steal_time; 696391e43daSPeter Zijlstra #endif 697391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 698391e43daSPeter Zijlstra u64 prev_steal_time_rq; 699391e43daSPeter Zijlstra #endif 700391e43daSPeter Zijlstra 701391e43daSPeter Zijlstra /* calc_load related fields */ 702391e43daSPeter Zijlstra unsigned long calc_load_update; 703391e43daSPeter Zijlstra long calc_load_active; 704391e43daSPeter Zijlstra 705391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 706391e43daSPeter Zijlstra #ifdef CONFIG_SMP 707391e43daSPeter Zijlstra int hrtick_csd_pending; 708391e43daSPeter Zijlstra struct call_single_data hrtick_csd; 709391e43daSPeter Zijlstra #endif 710391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 711391e43daSPeter Zijlstra #endif 712391e43daSPeter Zijlstra 713391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 714391e43daSPeter Zijlstra /* latency stats */ 715391e43daSPeter Zijlstra struct sched_info rq_sched_info; 716391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 717391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 718391e43daSPeter Zijlstra 719391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 720391e43daSPeter Zijlstra unsigned int yld_count; 721391e43daSPeter Zijlstra 722391e43daSPeter Zijlstra /* schedule() stats */ 723391e43daSPeter Zijlstra unsigned int sched_count; 724391e43daSPeter Zijlstra unsigned int sched_goidle; 725391e43daSPeter Zijlstra 726391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 727391e43daSPeter Zijlstra unsigned int ttwu_count; 728391e43daSPeter Zijlstra unsigned int ttwu_local; 729391e43daSPeter Zijlstra #endif 730391e43daSPeter Zijlstra 731391e43daSPeter Zijlstra #ifdef CONFIG_SMP 732391e43daSPeter Zijlstra struct llist_head wake_list; 733391e43daSPeter Zijlstra #endif 734442bf3aaSDaniel Lezcano 735442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 736442bf3aaSDaniel Lezcano /* Must be inspected within a rcu lock section */ 737442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state; 738442bf3aaSDaniel Lezcano #endif 739391e43daSPeter Zijlstra }; 740391e43daSPeter Zijlstra 741391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 742391e43daSPeter Zijlstra { 743391e43daSPeter Zijlstra #ifdef CONFIG_SMP 744391e43daSPeter Zijlstra return rq->cpu; 745391e43daSPeter Zijlstra #else 746391e43daSPeter Zijlstra return 0; 747391e43daSPeter Zijlstra #endif 748391e43daSPeter Zijlstra } 749391e43daSPeter Zijlstra 7501b568f0aSPeter Zijlstra 7511b568f0aSPeter Zijlstra #ifdef CONFIG_SCHED_SMT 7521b568f0aSPeter Zijlstra 7531b568f0aSPeter Zijlstra extern struct static_key_false sched_smt_present; 7541b568f0aSPeter Zijlstra 7551b568f0aSPeter Zijlstra extern void __update_idle_core(struct rq *rq); 7561b568f0aSPeter Zijlstra 7571b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) 7581b568f0aSPeter Zijlstra { 7591b568f0aSPeter Zijlstra if (static_branch_unlikely(&sched_smt_present)) 7601b568f0aSPeter Zijlstra __update_idle_core(rq); 7611b568f0aSPeter Zijlstra } 7621b568f0aSPeter Zijlstra 7631b568f0aSPeter Zijlstra #else 7641b568f0aSPeter Zijlstra static inline void update_idle_core(struct rq *rq) { } 7651b568f0aSPeter Zijlstra #endif 7661b568f0aSPeter Zijlstra 7678b06c55bSPranith Kumar DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); 768391e43daSPeter Zijlstra 769518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 7704a32fea9SChristoph Lameter #define this_rq() this_cpu_ptr(&runqueues) 771518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 772518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 7734a32fea9SChristoph Lameter #define raw_rq() raw_cpu_ptr(&runqueues) 774518cd623SPeter Zijlstra 775cebde6d6SPeter Zijlstra static inline u64 __rq_clock_broken(struct rq *rq) 776cebde6d6SPeter Zijlstra { 777316c1608SJason Low return READ_ONCE(rq->clock); 778cebde6d6SPeter Zijlstra } 779cebde6d6SPeter Zijlstra 780cb42c9a3SMatt Fleming /* 781cb42c9a3SMatt Fleming * rq::clock_update_flags bits 782cb42c9a3SMatt Fleming * 783cb42c9a3SMatt Fleming * %RQCF_REQ_SKIP - will request skipping of clock update on the next 784cb42c9a3SMatt Fleming * call to __schedule(). This is an optimisation to avoid 785cb42c9a3SMatt Fleming * neighbouring rq clock updates. 786cb42c9a3SMatt Fleming * 787cb42c9a3SMatt Fleming * %RQCF_ACT_SKIP - is set from inside of __schedule() when skipping is 788cb42c9a3SMatt Fleming * in effect and calls to update_rq_clock() are being ignored. 789cb42c9a3SMatt Fleming * 790cb42c9a3SMatt Fleming * %RQCF_UPDATED - is a debug flag that indicates whether a call has been 791cb42c9a3SMatt Fleming * made to update_rq_clock() since the last time rq::lock was pinned. 792cb42c9a3SMatt Fleming * 793cb42c9a3SMatt Fleming * If inside of __schedule(), clock_update_flags will have been 794cb42c9a3SMatt Fleming * shifted left (a left shift is a cheap operation for the fast path 795cb42c9a3SMatt Fleming * to promote %RQCF_REQ_SKIP to %RQCF_ACT_SKIP), so you must use, 796cb42c9a3SMatt Fleming * 797cb42c9a3SMatt Fleming * if (rq-clock_update_flags >= RQCF_UPDATED) 798cb42c9a3SMatt Fleming * 799cb42c9a3SMatt Fleming * to check if %RQCF_UPADTED is set. It'll never be shifted more than 800cb42c9a3SMatt Fleming * one position though, because the next rq_unpin_lock() will shift it 801cb42c9a3SMatt Fleming * back. 802cb42c9a3SMatt Fleming */ 803cb42c9a3SMatt Fleming #define RQCF_REQ_SKIP 0x01 804cb42c9a3SMatt Fleming #define RQCF_ACT_SKIP 0x02 805cb42c9a3SMatt Fleming #define RQCF_UPDATED 0x04 806cb42c9a3SMatt Fleming 807cb42c9a3SMatt Fleming static inline void assert_clock_updated(struct rq *rq) 808cb42c9a3SMatt Fleming { 809cb42c9a3SMatt Fleming /* 810cb42c9a3SMatt Fleming * The only reason for not seeing a clock update since the 811cb42c9a3SMatt Fleming * last rq_pin_lock() is if we're currently skipping updates. 812cb42c9a3SMatt Fleming */ 813cb42c9a3SMatt Fleming SCHED_WARN_ON(rq->clock_update_flags < RQCF_ACT_SKIP); 814cb42c9a3SMatt Fleming } 815cb42c9a3SMatt Fleming 81678becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 81778becc27SFrederic Weisbecker { 818cebde6d6SPeter Zijlstra lockdep_assert_held(&rq->lock); 819cb42c9a3SMatt Fleming assert_clock_updated(rq); 820cb42c9a3SMatt Fleming 82178becc27SFrederic Weisbecker return rq->clock; 82278becc27SFrederic Weisbecker } 82378becc27SFrederic Weisbecker 82478becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 82578becc27SFrederic Weisbecker { 826cebde6d6SPeter Zijlstra lockdep_assert_held(&rq->lock); 827cb42c9a3SMatt Fleming assert_clock_updated(rq); 828cb42c9a3SMatt Fleming 82978becc27SFrederic Weisbecker return rq->clock_task; 83078becc27SFrederic Weisbecker } 83178becc27SFrederic Weisbecker 8329edfbfedSPeter Zijlstra static inline void rq_clock_skip_update(struct rq *rq, bool skip) 8339edfbfedSPeter Zijlstra { 8349edfbfedSPeter Zijlstra lockdep_assert_held(&rq->lock); 8359edfbfedSPeter Zijlstra if (skip) 836cb42c9a3SMatt Fleming rq->clock_update_flags |= RQCF_REQ_SKIP; 8379edfbfedSPeter Zijlstra else 838cb42c9a3SMatt Fleming rq->clock_update_flags &= ~RQCF_REQ_SKIP; 8399edfbfedSPeter Zijlstra } 8409edfbfedSPeter Zijlstra 841d8ac8971SMatt Fleming struct rq_flags { 842d8ac8971SMatt Fleming unsigned long flags; 843d8ac8971SMatt Fleming struct pin_cookie cookie; 844cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 845cb42c9a3SMatt Fleming /* 846cb42c9a3SMatt Fleming * A copy of (rq::clock_update_flags & RQCF_UPDATED) for the 847cb42c9a3SMatt Fleming * current pin context is stashed here in case it needs to be 848cb42c9a3SMatt Fleming * restored in rq_repin_lock(). 849cb42c9a3SMatt Fleming */ 850cb42c9a3SMatt Fleming unsigned int clock_update_flags; 851cb42c9a3SMatt Fleming #endif 852d8ac8971SMatt Fleming }; 853d8ac8971SMatt Fleming 854d8ac8971SMatt Fleming static inline void rq_pin_lock(struct rq *rq, struct rq_flags *rf) 855d8ac8971SMatt Fleming { 856d8ac8971SMatt Fleming rf->cookie = lockdep_pin_lock(&rq->lock); 857cb42c9a3SMatt Fleming 858cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 859cb42c9a3SMatt Fleming rq->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); 860cb42c9a3SMatt Fleming rf->clock_update_flags = 0; 861cb42c9a3SMatt Fleming #endif 862d8ac8971SMatt Fleming } 863d8ac8971SMatt Fleming 864d8ac8971SMatt Fleming static inline void rq_unpin_lock(struct rq *rq, struct rq_flags *rf) 865d8ac8971SMatt Fleming { 866cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 867cb42c9a3SMatt Fleming if (rq->clock_update_flags > RQCF_ACT_SKIP) 868cb42c9a3SMatt Fleming rf->clock_update_flags = RQCF_UPDATED; 869cb42c9a3SMatt Fleming #endif 870cb42c9a3SMatt Fleming 871d8ac8971SMatt Fleming lockdep_unpin_lock(&rq->lock, rf->cookie); 872d8ac8971SMatt Fleming } 873d8ac8971SMatt Fleming 874d8ac8971SMatt Fleming static inline void rq_repin_lock(struct rq *rq, struct rq_flags *rf) 875d8ac8971SMatt Fleming { 876d8ac8971SMatt Fleming lockdep_repin_lock(&rq->lock, rf->cookie); 877cb42c9a3SMatt Fleming 878cb42c9a3SMatt Fleming #ifdef CONFIG_SCHED_DEBUG 879cb42c9a3SMatt Fleming /* 880cb42c9a3SMatt Fleming * Restore the value we stashed in @rf for this pin context. 881cb42c9a3SMatt Fleming */ 882cb42c9a3SMatt Fleming rq->clock_update_flags |= rf->clock_update_flags; 883cb42c9a3SMatt Fleming #endif 884d8ac8971SMatt Fleming } 885d8ac8971SMatt Fleming 8869942f79bSRik van Riel #ifdef CONFIG_NUMA 887e3fe70b1SRik van Riel enum numa_topology_type { 888e3fe70b1SRik van Riel NUMA_DIRECT, 889e3fe70b1SRik van Riel NUMA_GLUELESS_MESH, 890e3fe70b1SRik van Riel NUMA_BACKPLANE, 891e3fe70b1SRik van Riel }; 892e3fe70b1SRik van Riel extern enum numa_topology_type sched_numa_topology_type; 8939942f79bSRik van Riel extern int sched_max_numa_distance; 8949942f79bSRik van Riel extern bool find_numa_distance(int distance); 8959942f79bSRik van Riel #endif 8969942f79bSRik van Riel 897f2cb1360SIngo Molnar #ifdef CONFIG_NUMA 898f2cb1360SIngo Molnar extern void sched_init_numa(void); 899f2cb1360SIngo Molnar extern void sched_domains_numa_masks_set(unsigned int cpu); 900f2cb1360SIngo Molnar extern void sched_domains_numa_masks_clear(unsigned int cpu); 901f2cb1360SIngo Molnar #else 902f2cb1360SIngo Molnar static inline void sched_init_numa(void) { } 903f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_set(unsigned int cpu) { } 904f2cb1360SIngo Molnar static inline void sched_domains_numa_masks_clear(unsigned int cpu) { } 905f2cb1360SIngo Molnar #endif 906f2cb1360SIngo Molnar 907f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 90844dba3d5SIulia Manda /* The regions in numa_faults array from task_struct */ 90944dba3d5SIulia Manda enum numa_faults_stats { 91044dba3d5SIulia Manda NUMA_MEM = 0, 91144dba3d5SIulia Manda NUMA_CPU, 91244dba3d5SIulia Manda NUMA_MEMBUF, 91344dba3d5SIulia Manda NUMA_CPUBUF 91444dba3d5SIulia Manda }; 9150ec8aa00SPeter Zijlstra extern void sched_setnuma(struct task_struct *p, int node); 916e6628d5bSMel Gorman extern int migrate_task_to(struct task_struct *p, int cpu); 917ac66f547SPeter Zijlstra extern int migrate_swap(struct task_struct *, struct task_struct *); 918f809ca9aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 919f809ca9aSMel Gorman 920518cd623SPeter Zijlstra #ifdef CONFIG_SMP 921518cd623SPeter Zijlstra 922e3fca9e7SPeter Zijlstra static inline void 923e3fca9e7SPeter Zijlstra queue_balance_callback(struct rq *rq, 924e3fca9e7SPeter Zijlstra struct callback_head *head, 925e3fca9e7SPeter Zijlstra void (*func)(struct rq *rq)) 926e3fca9e7SPeter Zijlstra { 927e3fca9e7SPeter Zijlstra lockdep_assert_held(&rq->lock); 928e3fca9e7SPeter Zijlstra 929e3fca9e7SPeter Zijlstra if (unlikely(head->next)) 930e3fca9e7SPeter Zijlstra return; 931e3fca9e7SPeter Zijlstra 932e3fca9e7SPeter Zijlstra head->func = (void (*)(struct callback_head *))func; 933e3fca9e7SPeter Zijlstra head->next = rq->balance_callback; 934e3fca9e7SPeter Zijlstra rq->balance_callback = head; 935e3fca9e7SPeter Zijlstra } 936e3fca9e7SPeter Zijlstra 937e3baac47SPeter Zijlstra extern void sched_ttwu_pending(void); 938e3baac47SPeter Zijlstra 939391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 940391e43daSPeter Zijlstra rcu_dereference_check((p), \ 941391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 942391e43daSPeter Zijlstra 943391e43daSPeter Zijlstra /* 944391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 945391e43daSPeter Zijlstra * See detach_destroy_domains: synchronize_sched for details. 946391e43daSPeter Zijlstra * 947391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 948391e43daSPeter Zijlstra * preempt-disabled sections. 949391e43daSPeter Zijlstra */ 950391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 951518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 952518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 953391e43daSPeter Zijlstra 95477e81365SSuresh Siddha #define for_each_lower_domain(sd) for (; sd; sd = sd->child) 95577e81365SSuresh Siddha 956518cd623SPeter Zijlstra /** 957518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 958518cd623SPeter Zijlstra * @cpu: The cpu whose highest level of sched domain is to 959518cd623SPeter Zijlstra * be returned. 960518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 961518cd623SPeter Zijlstra * for the given cpu. 962518cd623SPeter Zijlstra * 963518cd623SPeter Zijlstra * Returns the highest sched_domain of a cpu which contains the given flag. 964518cd623SPeter Zijlstra */ 965518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 966518cd623SPeter Zijlstra { 967518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 968518cd623SPeter Zijlstra 969518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 970518cd623SPeter Zijlstra if (!(sd->flags & flag)) 971518cd623SPeter Zijlstra break; 972518cd623SPeter Zijlstra hsd = sd; 973518cd623SPeter Zijlstra } 974518cd623SPeter Zijlstra 975518cd623SPeter Zijlstra return hsd; 976518cd623SPeter Zijlstra } 977518cd623SPeter Zijlstra 978fb13c7eeSMel Gorman static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) 979fb13c7eeSMel Gorman { 980fb13c7eeSMel Gorman struct sched_domain *sd; 981fb13c7eeSMel Gorman 982fb13c7eeSMel Gorman for_each_domain(cpu, sd) { 983fb13c7eeSMel Gorman if (sd->flags & flag) 984fb13c7eeSMel Gorman break; 985fb13c7eeSMel Gorman } 986fb13c7eeSMel Gorman 987fb13c7eeSMel Gorman return sd; 988fb13c7eeSMel Gorman } 989fb13c7eeSMel Gorman 990518cd623SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain *, sd_llc); 9917d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 992518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 9930e369d75SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain_shared *, sd_llc_shared); 994fb13c7eeSMel Gorman DECLARE_PER_CPU(struct sched_domain *, sd_numa); 99537dc6b50SPreeti U Murthy DECLARE_PER_CPU(struct sched_domain *, sd_asym); 996518cd623SPeter Zijlstra 99763b2ca30SNicolas Pitre struct sched_group_capacity { 9985e6521eaSLi Zefan atomic_t ref; 9995e6521eaSLi Zefan /* 1000172895e6SYuyang Du * CPU capacity of this group, SCHED_CAPACITY_SCALE being max capacity 100163b2ca30SNicolas Pitre * for a single CPU. 10025e6521eaSLi Zefan */ 1003bf475ce0SMorten Rasmussen unsigned long capacity; 1004bf475ce0SMorten Rasmussen unsigned long min_capacity; /* Min per-CPU capacity in group */ 10055e6521eaSLi Zefan unsigned long next_update; 100663b2ca30SNicolas Pitre int imbalance; /* XXX unrelated to capacity but shared group state */ 10075e6521eaSLi Zefan 10085e6521eaSLi Zefan unsigned long cpumask[0]; /* iteration mask */ 10095e6521eaSLi Zefan }; 10105e6521eaSLi Zefan 10115e6521eaSLi Zefan struct sched_group { 10125e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 10135e6521eaSLi Zefan atomic_t ref; 10145e6521eaSLi Zefan 10155e6521eaSLi Zefan unsigned int group_weight; 101663b2ca30SNicolas Pitre struct sched_group_capacity *sgc; 1017afe06efdSTim Chen int asym_prefer_cpu; /* cpu of highest priority in group */ 10185e6521eaSLi Zefan 10195e6521eaSLi Zefan /* 10205e6521eaSLi Zefan * The CPUs this group covers. 10215e6521eaSLi Zefan * 10225e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 10235e6521eaSLi Zefan * by attaching extra space to the end of the structure, 10245e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 10255e6521eaSLi Zefan */ 10265e6521eaSLi Zefan unsigned long cpumask[0]; 10275e6521eaSLi Zefan }; 10285e6521eaSLi Zefan 10295e6521eaSLi Zefan static inline struct cpumask *sched_group_cpus(struct sched_group *sg) 10305e6521eaSLi Zefan { 10315e6521eaSLi Zefan return to_cpumask(sg->cpumask); 10325e6521eaSLi Zefan } 10335e6521eaSLi Zefan 10345e6521eaSLi Zefan /* 10355e6521eaSLi Zefan * cpumask masking which cpus in the group are allowed to iterate up the domain 10365e6521eaSLi Zefan * tree. 10375e6521eaSLi Zefan */ 10385e6521eaSLi Zefan static inline struct cpumask *sched_group_mask(struct sched_group *sg) 10395e6521eaSLi Zefan { 104063b2ca30SNicolas Pitre return to_cpumask(sg->sgc->cpumask); 10415e6521eaSLi Zefan } 10425e6521eaSLi Zefan 10435e6521eaSLi Zefan /** 10445e6521eaSLi Zefan * group_first_cpu - Returns the first cpu in the cpumask of a sched_group. 10455e6521eaSLi Zefan * @group: The group whose first cpu is to be returned. 10465e6521eaSLi Zefan */ 10475e6521eaSLi Zefan static inline unsigned int group_first_cpu(struct sched_group *group) 10485e6521eaSLi Zefan { 10495e6521eaSLi Zefan return cpumask_first(sched_group_cpus(group)); 10505e6521eaSLi Zefan } 10515e6521eaSLi Zefan 1052c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 1053c1174876SPeter Zijlstra 10543866e845SSteven Rostedt (Red Hat) #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL) 10553866e845SSteven Rostedt (Red Hat) void register_sched_domain_sysctl(void); 10563866e845SSteven Rostedt (Red Hat) void unregister_sched_domain_sysctl(void); 10573866e845SSteven Rostedt (Red Hat) #else 10583866e845SSteven Rostedt (Red Hat) static inline void register_sched_domain_sysctl(void) 10593866e845SSteven Rostedt (Red Hat) { 10603866e845SSteven Rostedt (Red Hat) } 10613866e845SSteven Rostedt (Red Hat) static inline void unregister_sched_domain_sysctl(void) 10623866e845SSteven Rostedt (Red Hat) { 10633866e845SSteven Rostedt (Red Hat) } 10643866e845SSteven Rostedt (Red Hat) #endif 10653866e845SSteven Rostedt (Red Hat) 1066e3baac47SPeter Zijlstra #else 1067e3baac47SPeter Zijlstra 1068e3baac47SPeter Zijlstra static inline void sched_ttwu_pending(void) { } 1069e3baac47SPeter Zijlstra 1070518cd623SPeter Zijlstra #endif /* CONFIG_SMP */ 1071391e43daSPeter Zijlstra 1072391e43daSPeter Zijlstra #include "stats.h" 10731051408fSIngo Molnar #include "autogroup.h" 1074391e43daSPeter Zijlstra 1075391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 1076391e43daSPeter Zijlstra 1077391e43daSPeter Zijlstra /* 1078391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 1079391e43daSPeter Zijlstra * 10808af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 10818af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 10828af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 10838323f26cSPeter Zijlstra * 10848323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 10858323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 10868323f26cSPeter Zijlstra * 10878323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 10888323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 1089391e43daSPeter Zijlstra */ 1090391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 1091391e43daSPeter Zijlstra { 10928323f26cSPeter Zijlstra return p->sched_task_group; 1093391e43daSPeter Zijlstra } 1094391e43daSPeter Zijlstra 1095391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 1096391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 1097391e43daSPeter Zijlstra { 1098391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 1099391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 1100391e43daSPeter Zijlstra #endif 1101391e43daSPeter Zijlstra 1102391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 1103ad936d86SByungchul Park set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]); 1104391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 1105391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 1106391e43daSPeter Zijlstra #endif 1107391e43daSPeter Zijlstra 1108391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 1109391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 1110391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 1111391e43daSPeter Zijlstra #endif 1112391e43daSPeter Zijlstra } 1113391e43daSPeter Zijlstra 1114391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 1115391e43daSPeter Zijlstra 1116391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 1117391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 1118391e43daSPeter Zijlstra { 1119391e43daSPeter Zijlstra return NULL; 1120391e43daSPeter Zijlstra } 1121391e43daSPeter Zijlstra 1122391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 1123391e43daSPeter Zijlstra 1124391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 1125391e43daSPeter Zijlstra { 1126391e43daSPeter Zijlstra set_task_rq(p, cpu); 1127391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1128391e43daSPeter Zijlstra /* 1129391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 1130391e43daSPeter Zijlstra * successfuly executed on another CPU. We must ensure that updates of 1131391e43daSPeter Zijlstra * per-task data have been completed by this moment. 1132391e43daSPeter Zijlstra */ 1133391e43daSPeter Zijlstra smp_wmb(); 1134c65eacbeSAndy Lutomirski #ifdef CONFIG_THREAD_INFO_IN_TASK 1135c65eacbeSAndy Lutomirski p->cpu = cpu; 1136c65eacbeSAndy Lutomirski #else 1137391e43daSPeter Zijlstra task_thread_info(p)->cpu = cpu; 1138c65eacbeSAndy Lutomirski #endif 1139ac66f547SPeter Zijlstra p->wake_cpu = cpu; 1140391e43daSPeter Zijlstra #endif 1141391e43daSPeter Zijlstra } 1142391e43daSPeter Zijlstra 1143391e43daSPeter Zijlstra /* 1144391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 1145391e43daSPeter Zijlstra */ 1146391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 1147c5905afbSIngo Molnar # include <linux/static_key.h> 1148391e43daSPeter Zijlstra # define const_debug __read_mostly 1149391e43daSPeter Zijlstra #else 1150391e43daSPeter Zijlstra # define const_debug const 1151391e43daSPeter Zijlstra #endif 1152391e43daSPeter Zijlstra 1153391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_features; 1154391e43daSPeter Zijlstra 1155391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1156391e43daSPeter Zijlstra __SCHED_FEAT_##name , 1157391e43daSPeter Zijlstra 1158391e43daSPeter Zijlstra enum { 1159391e43daSPeter Zijlstra #include "features.h" 1160f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 1161391e43daSPeter Zijlstra }; 1162391e43daSPeter Zijlstra 1163391e43daSPeter Zijlstra #undef SCHED_FEAT 1164391e43daSPeter Zijlstra 1165f8b6d1ccSPeter Zijlstra #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) 1166f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 1167c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 1168f8b6d1ccSPeter Zijlstra { \ 11696e76ea8aSJason Baron return static_key_##enabled(key); \ 1170f8b6d1ccSPeter Zijlstra } 1171f8b6d1ccSPeter Zijlstra 1172f8b6d1ccSPeter Zijlstra #include "features.h" 1173f8b6d1ccSPeter Zijlstra 1174f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 1175f8b6d1ccSPeter Zijlstra 1176c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 1177f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 1178f8b6d1ccSPeter Zijlstra #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ 1179391e43daSPeter Zijlstra #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 1180f8b6d1ccSPeter Zijlstra #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ 1181391e43daSPeter Zijlstra 11822a595721SSrikar Dronamraju extern struct static_key_false sched_numa_balancing; 1183cb251765SMel Gorman extern struct static_key_false sched_schedstats; 1184cbee9f88SPeter Zijlstra 1185391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 1186391e43daSPeter Zijlstra { 1187391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 1188391e43daSPeter Zijlstra } 1189391e43daSPeter Zijlstra 1190391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 1191391e43daSPeter Zijlstra { 1192391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 1193391e43daSPeter Zijlstra return RUNTIME_INF; 1194391e43daSPeter Zijlstra 1195391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 1196391e43daSPeter Zijlstra } 1197391e43daSPeter Zijlstra 1198391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 1199391e43daSPeter Zijlstra { 1200391e43daSPeter Zijlstra return rq->curr == p; 1201391e43daSPeter Zijlstra } 1202391e43daSPeter Zijlstra 1203391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 1204391e43daSPeter Zijlstra { 1205391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1206391e43daSPeter Zijlstra return p->on_cpu; 1207391e43daSPeter Zijlstra #else 1208391e43daSPeter Zijlstra return task_current(rq, p); 1209391e43daSPeter Zijlstra #endif 1210391e43daSPeter Zijlstra } 1211391e43daSPeter Zijlstra 1212da0c1e65SKirill Tkhai static inline int task_on_rq_queued(struct task_struct *p) 1213da0c1e65SKirill Tkhai { 1214da0c1e65SKirill Tkhai return p->on_rq == TASK_ON_RQ_QUEUED; 1215da0c1e65SKirill Tkhai } 1216391e43daSPeter Zijlstra 1217cca26e80SKirill Tkhai static inline int task_on_rq_migrating(struct task_struct *p) 1218cca26e80SKirill Tkhai { 1219cca26e80SKirill Tkhai return p->on_rq == TASK_ON_RQ_MIGRATING; 1220cca26e80SKirill Tkhai } 1221cca26e80SKirill Tkhai 1222391e43daSPeter Zijlstra #ifndef prepare_arch_switch 1223391e43daSPeter Zijlstra # define prepare_arch_switch(next) do { } while (0) 1224391e43daSPeter Zijlstra #endif 122501f23e16SCatalin Marinas #ifndef finish_arch_post_lock_switch 122601f23e16SCatalin Marinas # define finish_arch_post_lock_switch() do { } while (0) 122701f23e16SCatalin Marinas #endif 1228391e43daSPeter Zijlstra 1229391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 1230391e43daSPeter Zijlstra { 1231391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1232391e43daSPeter Zijlstra /* 1233391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 1234391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 1235391e43daSPeter Zijlstra * here. 1236391e43daSPeter Zijlstra */ 1237391e43daSPeter Zijlstra next->on_cpu = 1; 1238391e43daSPeter Zijlstra #endif 1239391e43daSPeter Zijlstra } 1240391e43daSPeter Zijlstra 1241391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 1242391e43daSPeter Zijlstra { 1243391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1244391e43daSPeter Zijlstra /* 1245391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 1246391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 1247391e43daSPeter Zijlstra * finished. 124895913d97SPeter Zijlstra * 1249b75a2253SPeter Zijlstra * In particular, the load of prev->state in finish_task_switch() must 1250b75a2253SPeter Zijlstra * happen before this. 1251b75a2253SPeter Zijlstra * 12521f03e8d2SPeter Zijlstra * Pairs with the smp_cond_load_acquire() in try_to_wake_up(). 1253391e43daSPeter Zijlstra */ 125495913d97SPeter Zijlstra smp_store_release(&prev->on_cpu, 0); 1255391e43daSPeter Zijlstra #endif 1256391e43daSPeter Zijlstra #ifdef CONFIG_DEBUG_SPINLOCK 1257391e43daSPeter Zijlstra /* this is a valid case when another task releases the spinlock */ 1258391e43daSPeter Zijlstra rq->lock.owner = current; 1259391e43daSPeter Zijlstra #endif 1260391e43daSPeter Zijlstra /* 1261391e43daSPeter Zijlstra * If we are tracking spinlock dependencies then we have to 1262391e43daSPeter Zijlstra * fix up the runqueue lock - which gets 'carried over' from 1263391e43daSPeter Zijlstra * prev into current: 1264391e43daSPeter Zijlstra */ 1265391e43daSPeter Zijlstra spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); 1266391e43daSPeter Zijlstra 1267391e43daSPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 1268391e43daSPeter Zijlstra } 1269391e43daSPeter Zijlstra 1270b13095f0SLi Zefan /* 1271b13095f0SLi Zefan * wake flags 1272b13095f0SLi Zefan */ 1273b13095f0SLi Zefan #define WF_SYNC 0x01 /* waker goes to sleep after wakeup */ 1274b13095f0SLi Zefan #define WF_FORK 0x02 /* child wakeup after fork */ 1275b13095f0SLi Zefan #define WF_MIGRATED 0x4 /* internal use, task got migrated */ 1276b13095f0SLi Zefan 1277391e43daSPeter Zijlstra /* 1278391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 1279391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 1280391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 1281391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 1282391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 1283391e43daSPeter Zijlstra * slice expiry etc. 1284391e43daSPeter Zijlstra */ 1285391e43daSPeter Zijlstra 1286391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 1287391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 1288391e43daSPeter Zijlstra 1289ed82b8a1SAndi Kleen extern const int sched_prio_to_weight[40]; 1290ed82b8a1SAndi Kleen extern const u32 sched_prio_to_wmult[40]; 1291391e43daSPeter Zijlstra 1292ff77e468SPeter Zijlstra /* 1293ff77e468SPeter Zijlstra * {de,en}queue flags: 1294ff77e468SPeter Zijlstra * 1295ff77e468SPeter Zijlstra * DEQUEUE_SLEEP - task is no longer runnable 1296ff77e468SPeter Zijlstra * ENQUEUE_WAKEUP - task just became runnable 1297ff77e468SPeter Zijlstra * 1298ff77e468SPeter Zijlstra * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks 1299ff77e468SPeter Zijlstra * are in a known state which allows modification. Such pairs 1300ff77e468SPeter Zijlstra * should preserve as much state as possible. 1301ff77e468SPeter Zijlstra * 1302ff77e468SPeter Zijlstra * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location 1303ff77e468SPeter Zijlstra * in the runqueue. 1304ff77e468SPeter Zijlstra * 1305ff77e468SPeter Zijlstra * ENQUEUE_HEAD - place at front of runqueue (tail if not specified) 1306ff77e468SPeter Zijlstra * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline) 130759efa0baSPeter Zijlstra * ENQUEUE_MIGRATED - the task was migrated during wakeup 1308ff77e468SPeter Zijlstra * 1309ff77e468SPeter Zijlstra */ 1310ff77e468SPeter Zijlstra 1311ff77e468SPeter Zijlstra #define DEQUEUE_SLEEP 0x01 1312ff77e468SPeter Zijlstra #define DEQUEUE_SAVE 0x02 /* matches ENQUEUE_RESTORE */ 1313ff77e468SPeter Zijlstra #define DEQUEUE_MOVE 0x04 /* matches ENQUEUE_MOVE */ 1314ff77e468SPeter Zijlstra 13151de64443SPeter Zijlstra #define ENQUEUE_WAKEUP 0x01 1316ff77e468SPeter Zijlstra #define ENQUEUE_RESTORE 0x02 1317ff77e468SPeter Zijlstra #define ENQUEUE_MOVE 0x04 1318ff77e468SPeter Zijlstra 1319ff77e468SPeter Zijlstra #define ENQUEUE_HEAD 0x08 1320ff77e468SPeter Zijlstra #define ENQUEUE_REPLENISH 0x10 1321c82ba9faSLi Zefan #ifdef CONFIG_SMP 132259efa0baSPeter Zijlstra #define ENQUEUE_MIGRATED 0x20 1323c82ba9faSLi Zefan #else 132459efa0baSPeter Zijlstra #define ENQUEUE_MIGRATED 0x00 1325c82ba9faSLi Zefan #endif 1326c82ba9faSLi Zefan 132737e117c0SPeter Zijlstra #define RETRY_TASK ((void *)-1UL) 132837e117c0SPeter Zijlstra 1329c82ba9faSLi Zefan struct sched_class { 1330c82ba9faSLi Zefan const struct sched_class *next; 1331c82ba9faSLi Zefan 1332c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 1333c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 1334c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 1335c82ba9faSLi Zefan bool (*yield_to_task) (struct rq *rq, struct task_struct *p, bool preempt); 1336c82ba9faSLi Zefan 1337c82ba9faSLi Zefan void (*check_preempt_curr) (struct rq *rq, struct task_struct *p, int flags); 1338c82ba9faSLi Zefan 1339606dba2eSPeter Zijlstra /* 1340606dba2eSPeter Zijlstra * It is the responsibility of the pick_next_task() method that will 1341606dba2eSPeter Zijlstra * return the next task to call put_prev_task() on the @prev task or 1342606dba2eSPeter Zijlstra * something equivalent. 134337e117c0SPeter Zijlstra * 134437e117c0SPeter Zijlstra * May return RETRY_TASK when it finds a higher prio class has runnable 134537e117c0SPeter Zijlstra * tasks. 1346606dba2eSPeter Zijlstra */ 1347606dba2eSPeter Zijlstra struct task_struct * (*pick_next_task) (struct rq *rq, 1348e7904a28SPeter Zijlstra struct task_struct *prev, 1349d8ac8971SMatt Fleming struct rq_flags *rf); 1350c82ba9faSLi Zefan void (*put_prev_task) (struct rq *rq, struct task_struct *p); 1351c82ba9faSLi Zefan 1352c82ba9faSLi Zefan #ifdef CONFIG_SMP 1353ac66f547SPeter Zijlstra int (*select_task_rq)(struct task_struct *p, int task_cpu, int sd_flag, int flags); 13545a4fd036Sxiaofeng.yan void (*migrate_task_rq)(struct task_struct *p); 1355c82ba9faSLi Zefan 1356c82ba9faSLi Zefan void (*task_woken) (struct rq *this_rq, struct task_struct *task); 1357c82ba9faSLi Zefan 1358c82ba9faSLi Zefan void (*set_cpus_allowed)(struct task_struct *p, 1359c82ba9faSLi Zefan const struct cpumask *newmask); 1360c82ba9faSLi Zefan 1361c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 1362c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 1363c82ba9faSLi Zefan #endif 1364c82ba9faSLi Zefan 1365c82ba9faSLi Zefan void (*set_curr_task) (struct rq *rq); 1366c82ba9faSLi Zefan void (*task_tick) (struct rq *rq, struct task_struct *p, int queued); 1367c82ba9faSLi Zefan void (*task_fork) (struct task_struct *p); 1368e6c390f2SDario Faggioli void (*task_dead) (struct task_struct *p); 1369c82ba9faSLi Zefan 137067dfa1b7SKirill Tkhai /* 137167dfa1b7SKirill Tkhai * The switched_from() call is allowed to drop rq->lock, therefore we 137267dfa1b7SKirill Tkhai * cannot assume the switched_from/switched_to pair is serliazed by 137367dfa1b7SKirill Tkhai * rq->lock. They are however serialized by p->pi_lock. 137467dfa1b7SKirill Tkhai */ 1375c82ba9faSLi Zefan void (*switched_from) (struct rq *this_rq, struct task_struct *task); 1376c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 1377c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 1378c82ba9faSLi Zefan int oldprio); 1379c82ba9faSLi Zefan 1380c82ba9faSLi Zefan unsigned int (*get_rr_interval) (struct rq *rq, 1381c82ba9faSLi Zefan struct task_struct *task); 1382c82ba9faSLi Zefan 13836e998916SStanislaw Gruszka void (*update_curr) (struct rq *rq); 13846e998916SStanislaw Gruszka 1385ea86cb4bSVincent Guittot #define TASK_SET_GROUP 0 1386ea86cb4bSVincent Guittot #define TASK_MOVE_GROUP 1 1387ea86cb4bSVincent Guittot 1388c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 1389ea86cb4bSVincent Guittot void (*task_change_group) (struct task_struct *p, int type); 1390c82ba9faSLi Zefan #endif 1391c82ba9faSLi Zefan }; 1392391e43daSPeter Zijlstra 13933f1d2a31SPeter Zijlstra static inline void put_prev_task(struct rq *rq, struct task_struct *prev) 13943f1d2a31SPeter Zijlstra { 13953f1d2a31SPeter Zijlstra prev->sched_class->put_prev_task(rq, prev); 13963f1d2a31SPeter Zijlstra } 13973f1d2a31SPeter Zijlstra 1398b2bf6c31SPeter Zijlstra static inline void set_curr_task(struct rq *rq, struct task_struct *curr) 1399b2bf6c31SPeter Zijlstra { 1400b2bf6c31SPeter Zijlstra curr->sched_class->set_curr_task(rq); 1401b2bf6c31SPeter Zijlstra } 1402b2bf6c31SPeter Zijlstra 1403391e43daSPeter Zijlstra #define sched_class_highest (&stop_sched_class) 1404391e43daSPeter Zijlstra #define for_each_class(class) \ 1405391e43daSPeter Zijlstra for (class = sched_class_highest; class; class = class->next) 1406391e43daSPeter Zijlstra 1407391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 1408aab03e05SDario Faggioli extern const struct sched_class dl_sched_class; 1409391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 1410391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 1411391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 1412391e43daSPeter Zijlstra 1413391e43daSPeter Zijlstra 1414391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1415391e43daSPeter Zijlstra 141663b2ca30SNicolas Pitre extern void update_group_capacity(struct sched_domain *sd, int cpu); 1417b719203bSLi Zefan 14187caff66fSDaniel Lezcano extern void trigger_load_balance(struct rq *rq); 1419391e43daSPeter Zijlstra 1420c5b28038SPeter Zijlstra extern void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask); 1421c5b28038SPeter Zijlstra 1422391e43daSPeter Zijlstra #endif 1423391e43daSPeter Zijlstra 1424442bf3aaSDaniel Lezcano #ifdef CONFIG_CPU_IDLE 1425442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 1426442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 1427442bf3aaSDaniel Lezcano { 1428442bf3aaSDaniel Lezcano rq->idle_state = idle_state; 1429442bf3aaSDaniel Lezcano } 1430442bf3aaSDaniel Lezcano 1431442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 1432442bf3aaSDaniel Lezcano { 14339148a3a1SPeter Zijlstra SCHED_WARN_ON(!rcu_read_lock_held()); 1434442bf3aaSDaniel Lezcano return rq->idle_state; 1435442bf3aaSDaniel Lezcano } 1436442bf3aaSDaniel Lezcano #else 1437442bf3aaSDaniel Lezcano static inline void idle_set_state(struct rq *rq, 1438442bf3aaSDaniel Lezcano struct cpuidle_state *idle_state) 1439442bf3aaSDaniel Lezcano { 1440442bf3aaSDaniel Lezcano } 1441442bf3aaSDaniel Lezcano 1442442bf3aaSDaniel Lezcano static inline struct cpuidle_state *idle_get_state(struct rq *rq) 1443442bf3aaSDaniel Lezcano { 1444442bf3aaSDaniel Lezcano return NULL; 1445442bf3aaSDaniel Lezcano } 1446442bf3aaSDaniel Lezcano #endif 1447442bf3aaSDaniel Lezcano 1448391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 1449391e43daSPeter Zijlstra extern void sched_init_granularity(void); 1450391e43daSPeter Zijlstra extern void update_max_interval(void); 14511baca4ceSJuri Lelli 14521baca4ceSJuri Lelli extern void init_sched_dl_class(void); 1453391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 1454391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 1455391e43daSPeter Zijlstra 14568875125eSKirill Tkhai extern void resched_curr(struct rq *rq); 1457391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 1458391e43daSPeter Zijlstra 1459391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 1460391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 1461391e43daSPeter Zijlstra 1462332ac17eSDario Faggioli extern struct dl_bandwidth def_dl_bandwidth; 1463332ac17eSDario Faggioli extern void init_dl_bandwidth(struct dl_bandwidth *dl_b, u64 period, u64 runtime); 1464aab03e05SDario Faggioli extern void init_dl_task_timer(struct sched_dl_entity *dl_se); 1465aab03e05SDario Faggioli 1466332ac17eSDario Faggioli unsigned long to_ratio(u64 period, u64 runtime); 1467332ac17eSDario Faggioli 1468540247fbSYuyang Du extern void init_entity_runnable_average(struct sched_entity *se); 14692b8c41daSYuyang Du extern void post_init_entity_util_avg(struct sched_entity *se); 1470a75cdaa9SAlex Shi 147176d92ac3SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 147276d92ac3SFrederic Weisbecker extern bool sched_can_stop_tick(struct rq *rq); 147376d92ac3SFrederic Weisbecker 147476d92ac3SFrederic Weisbecker /* 147576d92ac3SFrederic Weisbecker * Tick may be needed by tasks in the runqueue depending on their policy and 147676d92ac3SFrederic Weisbecker * requirements. If tick is needed, lets send the target an IPI to kick it out of 147776d92ac3SFrederic Weisbecker * nohz mode if necessary. 147876d92ac3SFrederic Weisbecker */ 147976d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) 148076d92ac3SFrederic Weisbecker { 148176d92ac3SFrederic Weisbecker int cpu; 148276d92ac3SFrederic Weisbecker 148376d92ac3SFrederic Weisbecker if (!tick_nohz_full_enabled()) 148476d92ac3SFrederic Weisbecker return; 148576d92ac3SFrederic Weisbecker 148676d92ac3SFrederic Weisbecker cpu = cpu_of(rq); 148776d92ac3SFrederic Weisbecker 148876d92ac3SFrederic Weisbecker if (!tick_nohz_full_cpu(cpu)) 148976d92ac3SFrederic Weisbecker return; 149076d92ac3SFrederic Weisbecker 149176d92ac3SFrederic Weisbecker if (sched_can_stop_tick(rq)) 149276d92ac3SFrederic Weisbecker tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED); 149376d92ac3SFrederic Weisbecker else 149476d92ac3SFrederic Weisbecker tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED); 149576d92ac3SFrederic Weisbecker } 149676d92ac3SFrederic Weisbecker #else 149776d92ac3SFrederic Weisbecker static inline void sched_update_tick_dependency(struct rq *rq) { } 149876d92ac3SFrederic Weisbecker #endif 149976d92ac3SFrederic Weisbecker 150072465447SKirill Tkhai static inline void add_nr_running(struct rq *rq, unsigned count) 1501391e43daSPeter Zijlstra { 150272465447SKirill Tkhai unsigned prev_nr = rq->nr_running; 150372465447SKirill Tkhai 150472465447SKirill Tkhai rq->nr_running = prev_nr + count; 15059f3660c2SFrederic Weisbecker 150672465447SKirill Tkhai if (prev_nr < 2 && rq->nr_running >= 2) { 15074486edd1STim Chen #ifdef CONFIG_SMP 15084486edd1STim Chen if (!rq->rd->overload) 15094486edd1STim Chen rq->rd->overload = true; 15104486edd1STim Chen #endif 151176d92ac3SFrederic Weisbecker } 15124486edd1STim Chen 151376d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 15144486edd1STim Chen } 1515391e43daSPeter Zijlstra 151672465447SKirill Tkhai static inline void sub_nr_running(struct rq *rq, unsigned count) 1517391e43daSPeter Zijlstra { 151872465447SKirill Tkhai rq->nr_running -= count; 151976d92ac3SFrederic Weisbecker /* Check if we still need preemption */ 152076d92ac3SFrederic Weisbecker sched_update_tick_dependency(rq); 1521391e43daSPeter Zijlstra } 1522391e43daSPeter Zijlstra 1523265f22a9SFrederic Weisbecker static inline void rq_last_tick_reset(struct rq *rq) 1524265f22a9SFrederic Weisbecker { 1525265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 1526265f22a9SFrederic Weisbecker rq->last_sched_tick = jiffies; 1527265f22a9SFrederic Weisbecker #endif 1528265f22a9SFrederic Weisbecker } 1529265f22a9SFrederic Weisbecker 1530391e43daSPeter Zijlstra extern void update_rq_clock(struct rq *rq); 1531391e43daSPeter Zijlstra 1532391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 1533391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 1534391e43daSPeter Zijlstra 1535391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 1536391e43daSPeter Zijlstra 1537391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_time_avg; 1538391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 1539391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 1540391e43daSPeter Zijlstra 1541391e43daSPeter Zijlstra static inline u64 sched_avg_period(void) 1542391e43daSPeter Zijlstra { 1543391e43daSPeter Zijlstra return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; 1544391e43daSPeter Zijlstra } 1545391e43daSPeter Zijlstra 1546391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1547391e43daSPeter Zijlstra 1548391e43daSPeter Zijlstra /* 1549391e43daSPeter Zijlstra * Use hrtick when: 1550391e43daSPeter Zijlstra * - enabled by features 1551391e43daSPeter Zijlstra * - hrtimer is actually high res 1552391e43daSPeter Zijlstra */ 1553391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 1554391e43daSPeter Zijlstra { 1555391e43daSPeter Zijlstra if (!sched_feat(HRTICK)) 1556391e43daSPeter Zijlstra return 0; 1557391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 1558391e43daSPeter Zijlstra return 0; 1559391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 1560391e43daSPeter Zijlstra } 1561391e43daSPeter Zijlstra 1562391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 1563391e43daSPeter Zijlstra 1564b39e66eaSMike Galbraith #else 1565b39e66eaSMike Galbraith 1566b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 1567b39e66eaSMike Galbraith { 1568b39e66eaSMike Galbraith return 0; 1569b39e66eaSMike Galbraith } 1570b39e66eaSMike Galbraith 1571391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 1572391e43daSPeter Zijlstra 1573391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1574391e43daSPeter Zijlstra extern void sched_avg_update(struct rq *rq); 1575dfbca41fSPeter Zijlstra 1576dfbca41fSPeter Zijlstra #ifndef arch_scale_freq_capacity 1577dfbca41fSPeter Zijlstra static __always_inline 1578dfbca41fSPeter Zijlstra unsigned long arch_scale_freq_capacity(struct sched_domain *sd, int cpu) 1579dfbca41fSPeter Zijlstra { 1580dfbca41fSPeter Zijlstra return SCHED_CAPACITY_SCALE; 1581dfbca41fSPeter Zijlstra } 1582dfbca41fSPeter Zijlstra #endif 1583b5b4860dSVincent Guittot 15848cd5601cSMorten Rasmussen #ifndef arch_scale_cpu_capacity 15858cd5601cSMorten Rasmussen static __always_inline 15868cd5601cSMorten Rasmussen unsigned long arch_scale_cpu_capacity(struct sched_domain *sd, int cpu) 15878cd5601cSMorten Rasmussen { 1588e3279a2eSDietmar Eggemann if (sd && (sd->flags & SD_SHARE_CPUCAPACITY) && (sd->span_weight > 1)) 15898cd5601cSMorten Rasmussen return sd->smt_gain / sd->span_weight; 15908cd5601cSMorten Rasmussen 15918cd5601cSMorten Rasmussen return SCHED_CAPACITY_SCALE; 15928cd5601cSMorten Rasmussen } 15938cd5601cSMorten Rasmussen #endif 15948cd5601cSMorten Rasmussen 1595391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) 1596391e43daSPeter Zijlstra { 1597b5b4860dSVincent Guittot rq->rt_avg += rt_delta * arch_scale_freq_capacity(NULL, cpu_of(rq)); 1598391e43daSPeter Zijlstra sched_avg_update(rq); 1599391e43daSPeter Zijlstra } 1600391e43daSPeter Zijlstra #else 1601391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) { } 1602391e43daSPeter Zijlstra static inline void sched_avg_update(struct rq *rq) { } 1603391e43daSPeter Zijlstra #endif 1604391e43daSPeter Zijlstra 1605eb580751SPeter Zijlstra struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf) 16063e71a462SPeter Zijlstra __acquires(rq->lock); 1607eb580751SPeter Zijlstra struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf) 16083960c8c0SPeter Zijlstra __acquires(p->pi_lock) 16093e71a462SPeter Zijlstra __acquires(rq->lock); 16103960c8c0SPeter Zijlstra 1611eb580751SPeter Zijlstra static inline void __task_rq_unlock(struct rq *rq, struct rq_flags *rf) 16123960c8c0SPeter Zijlstra __releases(rq->lock) 16133960c8c0SPeter Zijlstra { 1614d8ac8971SMatt Fleming rq_unpin_lock(rq, rf); 16153960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 16163960c8c0SPeter Zijlstra } 16173960c8c0SPeter Zijlstra 16183960c8c0SPeter Zijlstra static inline void 1619eb580751SPeter Zijlstra task_rq_unlock(struct rq *rq, struct task_struct *p, struct rq_flags *rf) 16203960c8c0SPeter Zijlstra __releases(rq->lock) 16213960c8c0SPeter Zijlstra __releases(p->pi_lock) 16223960c8c0SPeter Zijlstra { 1623d8ac8971SMatt Fleming rq_unpin_lock(rq, rf); 16243960c8c0SPeter Zijlstra raw_spin_unlock(&rq->lock); 1625eb580751SPeter Zijlstra raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags); 16263960c8c0SPeter Zijlstra } 16273960c8c0SPeter Zijlstra 1628391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1629391e43daSPeter Zijlstra #ifdef CONFIG_PREEMPT 1630391e43daSPeter Zijlstra 1631391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); 1632391e43daSPeter Zijlstra 1633391e43daSPeter Zijlstra /* 1634391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 1635391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 1636391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 1637391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 1638391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 1639391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 1640391e43daSPeter Zijlstra */ 1641391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1642391e43daSPeter Zijlstra __releases(this_rq->lock) 1643391e43daSPeter Zijlstra __acquires(busiest->lock) 1644391e43daSPeter Zijlstra __acquires(this_rq->lock) 1645391e43daSPeter Zijlstra { 1646391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1647391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 1648391e43daSPeter Zijlstra 1649391e43daSPeter Zijlstra return 1; 1650391e43daSPeter Zijlstra } 1651391e43daSPeter Zijlstra 1652391e43daSPeter Zijlstra #else 1653391e43daSPeter Zijlstra /* 1654391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 1655391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 1656391e43daSPeter Zijlstra * already in proper order on entry. This favors lower cpu-ids and will 1657391e43daSPeter Zijlstra * grant the double lock to lower cpus over higher ids under contention, 1658391e43daSPeter Zijlstra * regardless of entry order into the function. 1659391e43daSPeter Zijlstra */ 1660391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1661391e43daSPeter Zijlstra __releases(this_rq->lock) 1662391e43daSPeter Zijlstra __acquires(busiest->lock) 1663391e43daSPeter Zijlstra __acquires(this_rq->lock) 1664391e43daSPeter Zijlstra { 1665391e43daSPeter Zijlstra int ret = 0; 1666391e43daSPeter Zijlstra 1667391e43daSPeter Zijlstra if (unlikely(!raw_spin_trylock(&busiest->lock))) { 1668391e43daSPeter Zijlstra if (busiest < this_rq) { 1669391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1670391e43daSPeter Zijlstra raw_spin_lock(&busiest->lock); 1671391e43daSPeter Zijlstra raw_spin_lock_nested(&this_rq->lock, 1672391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1673391e43daSPeter Zijlstra ret = 1; 1674391e43daSPeter Zijlstra } else 1675391e43daSPeter Zijlstra raw_spin_lock_nested(&busiest->lock, 1676391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1677391e43daSPeter Zijlstra } 1678391e43daSPeter Zijlstra return ret; 1679391e43daSPeter Zijlstra } 1680391e43daSPeter Zijlstra 1681391e43daSPeter Zijlstra #endif /* CONFIG_PREEMPT */ 1682391e43daSPeter Zijlstra 1683391e43daSPeter Zijlstra /* 1684391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 1685391e43daSPeter Zijlstra */ 1686391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 1687391e43daSPeter Zijlstra { 1688391e43daSPeter Zijlstra if (unlikely(!irqs_disabled())) { 1689391e43daSPeter Zijlstra /* printk() doesn't work good under rq->lock */ 1690391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1691391e43daSPeter Zijlstra BUG_ON(1); 1692391e43daSPeter Zijlstra } 1693391e43daSPeter Zijlstra 1694391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 1695391e43daSPeter Zijlstra } 1696391e43daSPeter Zijlstra 1697391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 1698391e43daSPeter Zijlstra __releases(busiest->lock) 1699391e43daSPeter Zijlstra { 1700391e43daSPeter Zijlstra raw_spin_unlock(&busiest->lock); 1701391e43daSPeter Zijlstra lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); 1702391e43daSPeter Zijlstra } 1703391e43daSPeter Zijlstra 170474602315SPeter Zijlstra static inline void double_lock(spinlock_t *l1, spinlock_t *l2) 170574602315SPeter Zijlstra { 170674602315SPeter Zijlstra if (l1 > l2) 170774602315SPeter Zijlstra swap(l1, l2); 170874602315SPeter Zijlstra 170974602315SPeter Zijlstra spin_lock(l1); 171074602315SPeter Zijlstra spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 171174602315SPeter Zijlstra } 171274602315SPeter Zijlstra 171360e69eedSMike Galbraith static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2) 171460e69eedSMike Galbraith { 171560e69eedSMike Galbraith if (l1 > l2) 171660e69eedSMike Galbraith swap(l1, l2); 171760e69eedSMike Galbraith 171860e69eedSMike Galbraith spin_lock_irq(l1); 171960e69eedSMike Galbraith spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 172060e69eedSMike Galbraith } 172160e69eedSMike Galbraith 172274602315SPeter Zijlstra static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) 172374602315SPeter Zijlstra { 172474602315SPeter Zijlstra if (l1 > l2) 172574602315SPeter Zijlstra swap(l1, l2); 172674602315SPeter Zijlstra 172774602315SPeter Zijlstra raw_spin_lock(l1); 172874602315SPeter Zijlstra raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 172974602315SPeter Zijlstra } 173074602315SPeter Zijlstra 1731391e43daSPeter Zijlstra /* 1732391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1733391e43daSPeter Zijlstra * 1734391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1735391e43daSPeter Zijlstra * you need to do so manually before calling. 1736391e43daSPeter Zijlstra */ 1737391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1738391e43daSPeter Zijlstra __acquires(rq1->lock) 1739391e43daSPeter Zijlstra __acquires(rq2->lock) 1740391e43daSPeter Zijlstra { 1741391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1742391e43daSPeter Zijlstra if (rq1 == rq2) { 1743391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1744391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1745391e43daSPeter Zijlstra } else { 1746391e43daSPeter Zijlstra if (rq1 < rq2) { 1747391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1748391e43daSPeter Zijlstra raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); 1749391e43daSPeter Zijlstra } else { 1750391e43daSPeter Zijlstra raw_spin_lock(&rq2->lock); 1751391e43daSPeter Zijlstra raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); 1752391e43daSPeter Zijlstra } 1753391e43daSPeter Zijlstra } 1754391e43daSPeter Zijlstra } 1755391e43daSPeter Zijlstra 1756391e43daSPeter Zijlstra /* 1757391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1758391e43daSPeter Zijlstra * 1759391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1760391e43daSPeter Zijlstra * you need to do so manually after calling. 1761391e43daSPeter Zijlstra */ 1762391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1763391e43daSPeter Zijlstra __releases(rq1->lock) 1764391e43daSPeter Zijlstra __releases(rq2->lock) 1765391e43daSPeter Zijlstra { 1766391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1767391e43daSPeter Zijlstra if (rq1 != rq2) 1768391e43daSPeter Zijlstra raw_spin_unlock(&rq2->lock); 1769391e43daSPeter Zijlstra else 1770391e43daSPeter Zijlstra __release(rq2->lock); 1771391e43daSPeter Zijlstra } 1772391e43daSPeter Zijlstra 1773f2cb1360SIngo Molnar extern void set_rq_online (struct rq *rq); 1774f2cb1360SIngo Molnar extern void set_rq_offline(struct rq *rq); 1775f2cb1360SIngo Molnar extern bool sched_smp_initialized; 1776f2cb1360SIngo Molnar 1777391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1778391e43daSPeter Zijlstra 1779391e43daSPeter Zijlstra /* 1780391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1781391e43daSPeter Zijlstra * 1782391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1783391e43daSPeter Zijlstra * you need to do so manually before calling. 1784391e43daSPeter Zijlstra */ 1785391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1786391e43daSPeter Zijlstra __acquires(rq1->lock) 1787391e43daSPeter Zijlstra __acquires(rq2->lock) 1788391e43daSPeter Zijlstra { 1789391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1790391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1791391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1792391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1793391e43daSPeter Zijlstra } 1794391e43daSPeter Zijlstra 1795391e43daSPeter Zijlstra /* 1796391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1797391e43daSPeter Zijlstra * 1798391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1799391e43daSPeter Zijlstra * you need to do so manually after calling. 1800391e43daSPeter Zijlstra */ 1801391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1802391e43daSPeter Zijlstra __releases(rq1->lock) 1803391e43daSPeter Zijlstra __releases(rq2->lock) 1804391e43daSPeter Zijlstra { 1805391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1806391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1807391e43daSPeter Zijlstra __release(rq2->lock); 1808391e43daSPeter Zijlstra } 1809391e43daSPeter Zijlstra 1810391e43daSPeter Zijlstra #endif 1811391e43daSPeter Zijlstra 1812391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 1813391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 18146b55c965SSrikar Dronamraju 18156b55c965SSrikar Dronamraju #ifdef CONFIG_SCHED_DEBUG 1816391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 1817391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 1818acb32132SWanpeng Li extern void print_dl_stats(struct seq_file *m, int cpu); 18196b55c965SSrikar Dronamraju extern void 18206b55c965SSrikar Dronamraju print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq); 1821397f2378SSrikar Dronamraju 1822397f2378SSrikar Dronamraju #ifdef CONFIG_NUMA_BALANCING 1823397f2378SSrikar Dronamraju extern void 1824397f2378SSrikar Dronamraju show_numa_stats(struct task_struct *p, struct seq_file *m); 1825397f2378SSrikar Dronamraju extern void 1826397f2378SSrikar Dronamraju print_numa_stats(struct seq_file *m, int node, unsigned long tsf, 1827397f2378SSrikar Dronamraju unsigned long tpf, unsigned long gsf, unsigned long gpf); 1828397f2378SSrikar Dronamraju #endif /* CONFIG_NUMA_BALANCING */ 1829397f2378SSrikar Dronamraju #endif /* CONFIG_SCHED_DEBUG */ 1830391e43daSPeter Zijlstra 1831391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 183207c54f7aSAbel Vesa extern void init_rt_rq(struct rt_rq *rt_rq); 183307c54f7aSAbel Vesa extern void init_dl_rq(struct dl_rq *dl_rq); 1834391e43daSPeter Zijlstra 18351ee14e6cSBen Segall extern void cfs_bandwidth_usage_inc(void); 18361ee14e6cSBen Segall extern void cfs_bandwidth_usage_dec(void); 18371c792db7SSuresh Siddha 18383451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 18391c792db7SSuresh Siddha enum rq_nohz_flag_bits { 18401c792db7SSuresh Siddha NOHZ_TICK_STOPPED, 18411c792db7SSuresh Siddha NOHZ_BALANCE_KICK, 18421c792db7SSuresh Siddha }; 18431c792db7SSuresh Siddha 18441c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 184520a5c8ccSThomas Gleixner 184620a5c8ccSThomas Gleixner extern void nohz_balance_exit_idle(unsigned int cpu); 184720a5c8ccSThomas Gleixner #else 184820a5c8ccSThomas Gleixner static inline void nohz_balance_exit_idle(unsigned int cpu) { } 18491c792db7SSuresh Siddha #endif 185073fbec60SFrederic Weisbecker 185173fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 185219d23dbfSFrederic Weisbecker struct irqtime { 1853a499a5a1SFrederic Weisbecker u64 tick_delta; 185419d23dbfSFrederic Weisbecker u64 irq_start_time; 185519d23dbfSFrederic Weisbecker struct u64_stats_sync sync; 185619d23dbfSFrederic Weisbecker }; 185773fbec60SFrederic Weisbecker 185819d23dbfSFrederic Weisbecker DECLARE_PER_CPU(struct irqtime, cpu_irqtime); 185973fbec60SFrederic Weisbecker 186073fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 186173fbec60SFrederic Weisbecker { 186219d23dbfSFrederic Weisbecker struct irqtime *irqtime = &per_cpu(cpu_irqtime, cpu); 1863a499a5a1SFrederic Weisbecker u64 *cpustat = kcpustat_cpu(cpu).cpustat; 186419d23dbfSFrederic Weisbecker unsigned int seq; 186519d23dbfSFrederic Weisbecker u64 total; 186673fbec60SFrederic Weisbecker 186773fbec60SFrederic Weisbecker do { 186819d23dbfSFrederic Weisbecker seq = __u64_stats_fetch_begin(&irqtime->sync); 1869a499a5a1SFrederic Weisbecker total = cpustat[CPUTIME_SOFTIRQ] + cpustat[CPUTIME_IRQ]; 187019d23dbfSFrederic Weisbecker } while (__u64_stats_fetch_retry(&irqtime->sync, seq)); 187173fbec60SFrederic Weisbecker 187219d23dbfSFrederic Weisbecker return total; 187373fbec60SFrederic Weisbecker } 187473fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 1875adaf9fcdSRafael J. Wysocki 1876adaf9fcdSRafael J. Wysocki #ifdef CONFIG_CPU_FREQ 1877adaf9fcdSRafael J. Wysocki DECLARE_PER_CPU(struct update_util_data *, cpufreq_update_util_data); 1878adaf9fcdSRafael J. Wysocki 1879adaf9fcdSRafael J. Wysocki /** 1880adaf9fcdSRafael J. Wysocki * cpufreq_update_util - Take a note about CPU utilization changes. 188112bde33dSRafael J. Wysocki * @rq: Runqueue to carry out the update for. 188258919e83SRafael J. Wysocki * @flags: Update reason flags. 1883adaf9fcdSRafael J. Wysocki * 188458919e83SRafael J. Wysocki * This function is called by the scheduler on the CPU whose utilization is 188558919e83SRafael J. Wysocki * being updated. 1886adaf9fcdSRafael J. Wysocki * 1887adaf9fcdSRafael J. Wysocki * It can only be called from RCU-sched read-side critical sections. 1888adaf9fcdSRafael J. Wysocki * 1889adaf9fcdSRafael J. Wysocki * The way cpufreq is currently arranged requires it to evaluate the CPU 1890adaf9fcdSRafael J. Wysocki * performance state (frequency/voltage) on a regular basis to prevent it from 1891adaf9fcdSRafael J. Wysocki * being stuck in a completely inadequate performance level for too long. 1892adaf9fcdSRafael J. Wysocki * That is not guaranteed to happen if the updates are only triggered from CFS, 1893adaf9fcdSRafael J. Wysocki * though, because they may not be coming in if RT or deadline tasks are active 1894adaf9fcdSRafael J. Wysocki * all the time (or there are RT and DL tasks only). 1895adaf9fcdSRafael J. Wysocki * 1896adaf9fcdSRafael J. Wysocki * As a workaround for that issue, this function is called by the RT and DL 1897adaf9fcdSRafael J. Wysocki * sched classes to trigger extra cpufreq updates to prevent it from stalling, 1898adaf9fcdSRafael J. Wysocki * but that really is a band-aid. Going forward it should be replaced with 1899adaf9fcdSRafael J. Wysocki * solutions targeted more specifically at RT and DL tasks. 1900adaf9fcdSRafael J. Wysocki */ 190112bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) 1902adaf9fcdSRafael J. Wysocki { 190358919e83SRafael J. Wysocki struct update_util_data *data; 190458919e83SRafael J. Wysocki 190558919e83SRafael J. Wysocki data = rcu_dereference_sched(*this_cpu_ptr(&cpufreq_update_util_data)); 190658919e83SRafael J. Wysocki if (data) 190712bde33dSRafael J. Wysocki data->func(data, rq_clock(rq), flags); 190812bde33dSRafael J. Wysocki } 190912bde33dSRafael J. Wysocki 191012bde33dSRafael J. Wysocki static inline void cpufreq_update_this_cpu(struct rq *rq, unsigned int flags) 191112bde33dSRafael J. Wysocki { 191212bde33dSRafael J. Wysocki if (cpu_of(rq) == smp_processor_id()) 191312bde33dSRafael J. Wysocki cpufreq_update_util(rq, flags); 1914adaf9fcdSRafael J. Wysocki } 1915adaf9fcdSRafael J. Wysocki #else 191612bde33dSRafael J. Wysocki static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) {} 191712bde33dSRafael J. Wysocki static inline void cpufreq_update_this_cpu(struct rq *rq, unsigned int flags) {} 1918adaf9fcdSRafael J. Wysocki #endif /* CONFIG_CPU_FREQ */ 1919be53f58fSLinus Torvalds 19209bdcb44eSRafael J. Wysocki #ifdef arch_scale_freq_capacity 19219bdcb44eSRafael J. Wysocki #ifndef arch_scale_freq_invariant 19229bdcb44eSRafael J. Wysocki #define arch_scale_freq_invariant() (true) 19239bdcb44eSRafael J. Wysocki #endif 19249bdcb44eSRafael J. Wysocki #else /* arch_scale_freq_capacity */ 19259bdcb44eSRafael J. Wysocki #define arch_scale_freq_invariant() (false) 19269bdcb44eSRafael J. Wysocki #endif 1927