1391e43daSPeter Zijlstra 2391e43daSPeter Zijlstra #include <linux/sched.h> 3cf4aebc2SClark Williams #include <linux/sched/sysctl.h> 48bd75c77SClark Williams #include <linux/sched/rt.h> 5391e43daSPeter Zijlstra #include <linux/mutex.h> 6391e43daSPeter Zijlstra #include <linux/spinlock.h> 7391e43daSPeter Zijlstra #include <linux/stop_machine.h> 89f3660c2SFrederic Weisbecker #include <linux/tick.h> 9391e43daSPeter Zijlstra 10391e43daSPeter Zijlstra #include "cpupri.h" 1160fed789SLi Zefan #include "cpuacct.h" 12391e43daSPeter Zijlstra 1345ceebf7SPaul Gortmaker struct rq; 1445ceebf7SPaul Gortmaker 15391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 16391e43daSPeter Zijlstra 1745ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 1845ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 1945ceebf7SPaul Gortmaker 2045ceebf7SPaul Gortmaker extern long calc_load_fold_active(struct rq *this_rq); 2145ceebf7SPaul Gortmaker extern void update_cpu_load_active(struct rq *this_rq); 2245ceebf7SPaul Gortmaker 23391e43daSPeter Zijlstra /* 24391e43daSPeter Zijlstra * Convert user-nice values [ -20 ... 0 ... 19 ] 25391e43daSPeter Zijlstra * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ], 26391e43daSPeter Zijlstra * and back. 27391e43daSPeter Zijlstra */ 28391e43daSPeter Zijlstra #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20) 29391e43daSPeter Zijlstra #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20) 30391e43daSPeter Zijlstra #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio) 31391e43daSPeter Zijlstra 32391e43daSPeter Zijlstra /* 33391e43daSPeter Zijlstra * 'User priority' is the nice value converted to something we 34391e43daSPeter Zijlstra * can work with better when scaling various scheduler parameters, 35391e43daSPeter Zijlstra * it's a [ 0 ... 39 ] range. 36391e43daSPeter Zijlstra */ 37391e43daSPeter Zijlstra #define USER_PRIO(p) ((p)-MAX_RT_PRIO) 38391e43daSPeter Zijlstra #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio) 39391e43daSPeter Zijlstra #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO)) 40391e43daSPeter Zijlstra 41391e43daSPeter Zijlstra /* 42391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 43391e43daSPeter Zijlstra */ 44391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 45391e43daSPeter Zijlstra 46cc1f4b1fSLi Zefan /* 47cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 48cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 49cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 50cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 51cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 52cc1f4b1fSLi Zefan * 53cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 54cc1f4b1fSLi Zefan * resolution (i.e. BITS_PER_LONG > 32). The costs for increasing resolution 55cc1f4b1fSLi Zefan * when BITS_PER_LONG <= 32 are pretty high and the returns do not justify the 56cc1f4b1fSLi Zefan * increased costs. 57cc1f4b1fSLi Zefan */ 58cc1f4b1fSLi Zefan #if 0 /* BITS_PER_LONG > 32 -- currently broken: it increases power usage under light load */ 59cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 10 60cc1f4b1fSLi Zefan # define scale_load(w) ((w) << SCHED_LOAD_RESOLUTION) 61cc1f4b1fSLi Zefan # define scale_load_down(w) ((w) >> SCHED_LOAD_RESOLUTION) 62cc1f4b1fSLi Zefan #else 63cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 0 64cc1f4b1fSLi Zefan # define scale_load(w) (w) 65cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 66cc1f4b1fSLi Zefan #endif 67cc1f4b1fSLi Zefan 68cc1f4b1fSLi Zefan #define SCHED_LOAD_SHIFT (10 + SCHED_LOAD_RESOLUTION) 69cc1f4b1fSLi Zefan #define SCHED_LOAD_SCALE (1L << SCHED_LOAD_SHIFT) 70cc1f4b1fSLi Zefan 71391e43daSPeter Zijlstra #define NICE_0_LOAD SCHED_LOAD_SCALE 72391e43daSPeter Zijlstra #define NICE_0_SHIFT SCHED_LOAD_SHIFT 73391e43daSPeter Zijlstra 74391e43daSPeter Zijlstra /* 75391e43daSPeter Zijlstra * These are the 'tuning knobs' of the scheduler: 76391e43daSPeter Zijlstra */ 77391e43daSPeter Zijlstra 78391e43daSPeter Zijlstra /* 79391e43daSPeter Zijlstra * single value that denotes runtime == period, ie unlimited time. 80391e43daSPeter Zijlstra */ 81391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 82391e43daSPeter Zijlstra 83391e43daSPeter Zijlstra static inline int rt_policy(int policy) 84391e43daSPeter Zijlstra { 85391e43daSPeter Zijlstra if (policy == SCHED_FIFO || policy == SCHED_RR) 86391e43daSPeter Zijlstra return 1; 87391e43daSPeter Zijlstra return 0; 88391e43daSPeter Zijlstra } 89391e43daSPeter Zijlstra 90391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 91391e43daSPeter Zijlstra { 92391e43daSPeter Zijlstra return rt_policy(p->policy); 93391e43daSPeter Zijlstra } 94391e43daSPeter Zijlstra 95391e43daSPeter Zijlstra /* 96391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 97391e43daSPeter Zijlstra */ 98391e43daSPeter Zijlstra struct rt_prio_array { 99391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 100391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 101391e43daSPeter Zijlstra }; 102391e43daSPeter Zijlstra 103391e43daSPeter Zijlstra struct rt_bandwidth { 104391e43daSPeter Zijlstra /* nests inside the rq lock: */ 105391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 106391e43daSPeter Zijlstra ktime_t rt_period; 107391e43daSPeter Zijlstra u64 rt_runtime; 108391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 109391e43daSPeter Zijlstra }; 110391e43daSPeter Zijlstra 111391e43daSPeter Zijlstra extern struct mutex sched_domains_mutex; 112391e43daSPeter Zijlstra 113391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 114391e43daSPeter Zijlstra 115391e43daSPeter Zijlstra #include <linux/cgroup.h> 116391e43daSPeter Zijlstra 117391e43daSPeter Zijlstra struct cfs_rq; 118391e43daSPeter Zijlstra struct rt_rq; 119391e43daSPeter Zijlstra 12035cf4e50SMike Galbraith extern struct list_head task_groups; 121391e43daSPeter Zijlstra 122391e43daSPeter Zijlstra struct cfs_bandwidth { 123391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 124391e43daSPeter Zijlstra raw_spinlock_t lock; 125391e43daSPeter Zijlstra ktime_t period; 126391e43daSPeter Zijlstra u64 quota, runtime; 127391e43daSPeter Zijlstra s64 hierarchal_quota; 128391e43daSPeter Zijlstra u64 runtime_expires; 129391e43daSPeter Zijlstra 130391e43daSPeter Zijlstra int idle, timer_active; 131391e43daSPeter Zijlstra struct hrtimer period_timer, slack_timer; 132391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 133391e43daSPeter Zijlstra 134391e43daSPeter Zijlstra /* statistics */ 135391e43daSPeter Zijlstra int nr_periods, nr_throttled; 136391e43daSPeter Zijlstra u64 throttled_time; 137391e43daSPeter Zijlstra #endif 138391e43daSPeter Zijlstra }; 139391e43daSPeter Zijlstra 140391e43daSPeter Zijlstra /* task group related information */ 141391e43daSPeter Zijlstra struct task_group { 142391e43daSPeter Zijlstra struct cgroup_subsys_state css; 143391e43daSPeter Zijlstra 144391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 145391e43daSPeter Zijlstra /* schedulable entities of this group on each cpu */ 146391e43daSPeter Zijlstra struct sched_entity **se; 147391e43daSPeter Zijlstra /* runqueue "owned" by this group on each cpu */ 148391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 149391e43daSPeter Zijlstra unsigned long shares; 150391e43daSPeter Zijlstra 151391e43daSPeter Zijlstra atomic_t load_weight; 152fa6bddebSAlex Shi #ifdef CONFIG_SMP 153c566e8e9SPaul Turner atomic64_t load_avg; 154bb17f655SPaul Turner atomic_t runnable_avg; 155391e43daSPeter Zijlstra #endif 156fa6bddebSAlex Shi #endif 157391e43daSPeter Zijlstra 158391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 159391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 160391e43daSPeter Zijlstra struct rt_rq **rt_rq; 161391e43daSPeter Zijlstra 162391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 163391e43daSPeter Zijlstra #endif 164391e43daSPeter Zijlstra 165391e43daSPeter Zijlstra struct rcu_head rcu; 166391e43daSPeter Zijlstra struct list_head list; 167391e43daSPeter Zijlstra 168391e43daSPeter Zijlstra struct task_group *parent; 169391e43daSPeter Zijlstra struct list_head siblings; 170391e43daSPeter Zijlstra struct list_head children; 171391e43daSPeter Zijlstra 172391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 173391e43daSPeter Zijlstra struct autogroup *autogroup; 174391e43daSPeter Zijlstra #endif 175391e43daSPeter Zijlstra 176391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 177391e43daSPeter Zijlstra }; 178391e43daSPeter Zijlstra 179391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 180391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 181391e43daSPeter Zijlstra 182391e43daSPeter Zijlstra /* 183391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 184391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 185391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 186391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 187391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 188391e43daSPeter Zijlstra * limitation from this.) 189391e43daSPeter Zijlstra */ 190391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 191391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 192391e43daSPeter Zijlstra #endif 193391e43daSPeter Zijlstra 194391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 195391e43daSPeter Zijlstra 196391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 197391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 198391e43daSPeter Zijlstra 199391e43daSPeter Zijlstra /* 200391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 201391e43daSPeter Zijlstra * leaving it for the final time. 202391e43daSPeter Zijlstra * 203391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 204391e43daSPeter Zijlstra */ 205391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 206391e43daSPeter Zijlstra { 207391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 208391e43daSPeter Zijlstra } 209391e43daSPeter Zijlstra 210391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 211391e43daSPeter Zijlstra 212391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 213391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 214391e43daSPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg, int cpu); 215391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 216391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 217391e43daSPeter Zijlstra struct sched_entity *parent); 218391e43daSPeter Zijlstra extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 219391e43daSPeter Zijlstra extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 220391e43daSPeter Zijlstra 221391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 222391e43daSPeter Zijlstra extern void __start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 223391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 224391e43daSPeter Zijlstra 225391e43daSPeter Zijlstra extern void free_rt_sched_group(struct task_group *tg); 226391e43daSPeter Zijlstra extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 227391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 228391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 229391e43daSPeter Zijlstra struct sched_rt_entity *parent); 230391e43daSPeter Zijlstra 23125cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 23225cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 23325cc7da7SLi Zefan struct task_group *parent); 23425cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 23525cc7da7SLi Zefan extern void sched_offline_group(struct task_group *tg); 23625cc7da7SLi Zefan 23725cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 23825cc7da7SLi Zefan 23925cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 24025cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 24125cc7da7SLi Zefan #endif 24225cc7da7SLi Zefan 243391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 244391e43daSPeter Zijlstra 245391e43daSPeter Zijlstra struct cfs_bandwidth { }; 246391e43daSPeter Zijlstra 247391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 248391e43daSPeter Zijlstra 249391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 250391e43daSPeter Zijlstra struct cfs_rq { 251391e43daSPeter Zijlstra struct load_weight load; 252c82513e5SPeter Zijlstra unsigned int nr_running, h_nr_running; 253391e43daSPeter Zijlstra 254391e43daSPeter Zijlstra u64 exec_clock; 255391e43daSPeter Zijlstra u64 min_vruntime; 256391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 257391e43daSPeter Zijlstra u64 min_vruntime_copy; 258391e43daSPeter Zijlstra #endif 259391e43daSPeter Zijlstra 260391e43daSPeter Zijlstra struct rb_root tasks_timeline; 261391e43daSPeter Zijlstra struct rb_node *rb_leftmost; 262391e43daSPeter Zijlstra 263391e43daSPeter Zijlstra /* 264391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 265391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 266391e43daSPeter Zijlstra */ 267391e43daSPeter Zijlstra struct sched_entity *curr, *next, *last, *skip; 268391e43daSPeter Zijlstra 269391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 270391e43daSPeter Zijlstra unsigned int nr_spread_over; 271391e43daSPeter Zijlstra #endif 272391e43daSPeter Zijlstra 2732dac754eSPaul Turner #ifdef CONFIG_SMP 2742dac754eSPaul Turner /* 2752dac754eSPaul Turner * CFS Load tracking 2762dac754eSPaul Turner * Under CFS, load is tracked on a per-entity basis and aggregated up. 2772dac754eSPaul Turner * This allows for the description of both thread and group usage (in 2782dac754eSPaul Turner * the FAIR_GROUP_SCHED case). 2792dac754eSPaul Turner */ 2809ee474f5SPaul Turner u64 runnable_load_avg, blocked_load_avg; 281aff3e498SPaul Turner atomic64_t decay_counter, removed_load; 2829ee474f5SPaul Turner u64 last_decay; 283141965c7SAlex Shi 284c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 285141965c7SAlex Shi /* Required to track per-cpu representation of a task_group */ 286bb17f655SPaul Turner u32 tg_runnable_contrib; 287c566e8e9SPaul Turner u64 tg_load_contrib; 28882958366SPaul Turner #endif /* CONFIG_FAIR_GROUP_SCHED */ 28982958366SPaul Turner 29082958366SPaul Turner /* 29182958366SPaul Turner * h_load = weight * f(tg) 29282958366SPaul Turner * 29382958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 29482958366SPaul Turner * this group. 29582958366SPaul Turner */ 29682958366SPaul Turner unsigned long h_load; 29782958366SPaul Turner #endif /* CONFIG_SMP */ 29882958366SPaul Turner 299391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 300391e43daSPeter Zijlstra struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ 301391e43daSPeter Zijlstra 302391e43daSPeter Zijlstra /* 303391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 304391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 305391e43daSPeter Zijlstra * (like users, containers etc.) 306391e43daSPeter Zijlstra * 307391e43daSPeter Zijlstra * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This 308391e43daSPeter Zijlstra * list is used during load balance. 309391e43daSPeter Zijlstra */ 310391e43daSPeter Zijlstra int on_list; 311391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 312391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 313391e43daSPeter Zijlstra 314391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 315391e43daSPeter Zijlstra int runtime_enabled; 316391e43daSPeter Zijlstra u64 runtime_expires; 317391e43daSPeter Zijlstra s64 runtime_remaining; 318391e43daSPeter Zijlstra 319f1b17280SPaul Turner u64 throttled_clock, throttled_clock_task; 320f1b17280SPaul Turner u64 throttled_clock_task_time; 321391e43daSPeter Zijlstra int throttled, throttle_count; 322391e43daSPeter Zijlstra struct list_head throttled_list; 323391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 324391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 325391e43daSPeter Zijlstra }; 326391e43daSPeter Zijlstra 327391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 328391e43daSPeter Zijlstra { 329391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 330391e43daSPeter Zijlstra } 331391e43daSPeter Zijlstra 332391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 333391e43daSPeter Zijlstra struct rt_rq { 334391e43daSPeter Zijlstra struct rt_prio_array active; 335c82513e5SPeter Zijlstra unsigned int rt_nr_running; 336391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 337391e43daSPeter Zijlstra struct { 338391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 339391e43daSPeter Zijlstra #ifdef CONFIG_SMP 340391e43daSPeter Zijlstra int next; /* next highest */ 341391e43daSPeter Zijlstra #endif 342391e43daSPeter Zijlstra } highest_prio; 343391e43daSPeter Zijlstra #endif 344391e43daSPeter Zijlstra #ifdef CONFIG_SMP 345391e43daSPeter Zijlstra unsigned long rt_nr_migratory; 346391e43daSPeter Zijlstra unsigned long rt_nr_total; 347391e43daSPeter Zijlstra int overloaded; 348391e43daSPeter Zijlstra struct plist_head pushable_tasks; 349391e43daSPeter Zijlstra #endif 350391e43daSPeter Zijlstra int rt_throttled; 351391e43daSPeter Zijlstra u64 rt_time; 352391e43daSPeter Zijlstra u64 rt_runtime; 353391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 354391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 355391e43daSPeter Zijlstra 356391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 357391e43daSPeter Zijlstra unsigned long rt_nr_boosted; 358391e43daSPeter Zijlstra 359391e43daSPeter Zijlstra struct rq *rq; 360391e43daSPeter Zijlstra struct task_group *tg; 361391e43daSPeter Zijlstra #endif 362391e43daSPeter Zijlstra }; 363391e43daSPeter Zijlstra 364391e43daSPeter Zijlstra #ifdef CONFIG_SMP 365391e43daSPeter Zijlstra 366391e43daSPeter Zijlstra /* 367391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 368391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 369391e43daSPeter Zijlstra * fully partitioning the member cpus from any other cpuset. Whenever a new 370391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 371391e43daSPeter Zijlstra * object. 372391e43daSPeter Zijlstra * 373391e43daSPeter Zijlstra */ 374391e43daSPeter Zijlstra struct root_domain { 375391e43daSPeter Zijlstra atomic_t refcount; 376391e43daSPeter Zijlstra atomic_t rto_count; 377391e43daSPeter Zijlstra struct rcu_head rcu; 378391e43daSPeter Zijlstra cpumask_var_t span; 379391e43daSPeter Zijlstra cpumask_var_t online; 380391e43daSPeter Zijlstra 381391e43daSPeter Zijlstra /* 382391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 383391e43daSPeter Zijlstra * one runnable RT task. 384391e43daSPeter Zijlstra */ 385391e43daSPeter Zijlstra cpumask_var_t rto_mask; 386391e43daSPeter Zijlstra struct cpupri cpupri; 387391e43daSPeter Zijlstra }; 388391e43daSPeter Zijlstra 389391e43daSPeter Zijlstra extern struct root_domain def_root_domain; 390391e43daSPeter Zijlstra 391391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 392391e43daSPeter Zijlstra 393391e43daSPeter Zijlstra /* 394391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 395391e43daSPeter Zijlstra * 396391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 397391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 398391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 399391e43daSPeter Zijlstra */ 400391e43daSPeter Zijlstra struct rq { 401391e43daSPeter Zijlstra /* runqueue lock: */ 402391e43daSPeter Zijlstra raw_spinlock_t lock; 403391e43daSPeter Zijlstra 404391e43daSPeter Zijlstra /* 405391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 406391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 407391e43daSPeter Zijlstra */ 408c82513e5SPeter Zijlstra unsigned int nr_running; 409391e43daSPeter Zijlstra #define CPU_LOAD_IDX_MAX 5 410391e43daSPeter Zijlstra unsigned long cpu_load[CPU_LOAD_IDX_MAX]; 411391e43daSPeter Zijlstra unsigned long last_load_update_tick; 4123451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 413391e43daSPeter Zijlstra u64 nohz_stamp; 4141c792db7SSuresh Siddha unsigned long nohz_flags; 415391e43daSPeter Zijlstra #endif 416265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 417265f22a9SFrederic Weisbecker unsigned long last_sched_tick; 418265f22a9SFrederic Weisbecker #endif 419391e43daSPeter Zijlstra int skip_clock_update; 420391e43daSPeter Zijlstra 421391e43daSPeter Zijlstra /* capture load from *all* tasks on this cpu: */ 422391e43daSPeter Zijlstra struct load_weight load; 423391e43daSPeter Zijlstra unsigned long nr_load_updates; 424391e43daSPeter Zijlstra u64 nr_switches; 425391e43daSPeter Zijlstra 426391e43daSPeter Zijlstra struct cfs_rq cfs; 427391e43daSPeter Zijlstra struct rt_rq rt; 428391e43daSPeter Zijlstra 429391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 430391e43daSPeter Zijlstra /* list of leaf cfs_rq on this cpu: */ 431391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 432a35b6466SPeter Zijlstra #ifdef CONFIG_SMP 433a35b6466SPeter Zijlstra unsigned long h_load_throttle; 434a35b6466SPeter Zijlstra #endif /* CONFIG_SMP */ 435a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 436a35b6466SPeter Zijlstra 437391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 438391e43daSPeter Zijlstra struct list_head leaf_rt_rq_list; 439391e43daSPeter Zijlstra #endif 440391e43daSPeter Zijlstra 441391e43daSPeter Zijlstra /* 442391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 443391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 444391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 445391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 446391e43daSPeter Zijlstra */ 447391e43daSPeter Zijlstra unsigned long nr_uninterruptible; 448391e43daSPeter Zijlstra 449391e43daSPeter Zijlstra struct task_struct *curr, *idle, *stop; 450391e43daSPeter Zijlstra unsigned long next_balance; 451391e43daSPeter Zijlstra struct mm_struct *prev_mm; 452391e43daSPeter Zijlstra 453391e43daSPeter Zijlstra u64 clock; 454391e43daSPeter Zijlstra u64 clock_task; 455391e43daSPeter Zijlstra 456391e43daSPeter Zijlstra atomic_t nr_iowait; 457391e43daSPeter Zijlstra 458391e43daSPeter Zijlstra #ifdef CONFIG_SMP 459391e43daSPeter Zijlstra struct root_domain *rd; 460391e43daSPeter Zijlstra struct sched_domain *sd; 461391e43daSPeter Zijlstra 462391e43daSPeter Zijlstra unsigned long cpu_power; 463391e43daSPeter Zijlstra 464391e43daSPeter Zijlstra unsigned char idle_balance; 465391e43daSPeter Zijlstra /* For active balancing */ 466391e43daSPeter Zijlstra int post_schedule; 467391e43daSPeter Zijlstra int active_balance; 468391e43daSPeter Zijlstra int push_cpu; 469391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 470391e43daSPeter Zijlstra /* cpu of this runqueue: */ 471391e43daSPeter Zijlstra int cpu; 472391e43daSPeter Zijlstra int online; 473391e43daSPeter Zijlstra 474367456c7SPeter Zijlstra struct list_head cfs_tasks; 475367456c7SPeter Zijlstra 476391e43daSPeter Zijlstra u64 rt_avg; 477391e43daSPeter Zijlstra u64 age_stamp; 478391e43daSPeter Zijlstra u64 idle_stamp; 479391e43daSPeter Zijlstra u64 avg_idle; 480391e43daSPeter Zijlstra #endif 481391e43daSPeter Zijlstra 482391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 483391e43daSPeter Zijlstra u64 prev_irq_time; 484391e43daSPeter Zijlstra #endif 485391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 486391e43daSPeter Zijlstra u64 prev_steal_time; 487391e43daSPeter Zijlstra #endif 488391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 489391e43daSPeter Zijlstra u64 prev_steal_time_rq; 490391e43daSPeter Zijlstra #endif 491391e43daSPeter Zijlstra 492391e43daSPeter Zijlstra /* calc_load related fields */ 493391e43daSPeter Zijlstra unsigned long calc_load_update; 494391e43daSPeter Zijlstra long calc_load_active; 495391e43daSPeter Zijlstra 496391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 497391e43daSPeter Zijlstra #ifdef CONFIG_SMP 498391e43daSPeter Zijlstra int hrtick_csd_pending; 499391e43daSPeter Zijlstra struct call_single_data hrtick_csd; 500391e43daSPeter Zijlstra #endif 501391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 502391e43daSPeter Zijlstra #endif 503391e43daSPeter Zijlstra 504391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 505391e43daSPeter Zijlstra /* latency stats */ 506391e43daSPeter Zijlstra struct sched_info rq_sched_info; 507391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 508391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 509391e43daSPeter Zijlstra 510391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 511391e43daSPeter Zijlstra unsigned int yld_count; 512391e43daSPeter Zijlstra 513391e43daSPeter Zijlstra /* schedule() stats */ 514391e43daSPeter Zijlstra unsigned int sched_count; 515391e43daSPeter Zijlstra unsigned int sched_goidle; 516391e43daSPeter Zijlstra 517391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 518391e43daSPeter Zijlstra unsigned int ttwu_count; 519391e43daSPeter Zijlstra unsigned int ttwu_local; 520391e43daSPeter Zijlstra #endif 521391e43daSPeter Zijlstra 522391e43daSPeter Zijlstra #ifdef CONFIG_SMP 523391e43daSPeter Zijlstra struct llist_head wake_list; 524391e43daSPeter Zijlstra #endif 52518bf2805SBen Segall 52618bf2805SBen Segall struct sched_avg avg; 527391e43daSPeter Zijlstra }; 528391e43daSPeter Zijlstra 529391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 530391e43daSPeter Zijlstra { 531391e43daSPeter Zijlstra #ifdef CONFIG_SMP 532391e43daSPeter Zijlstra return rq->cpu; 533391e43daSPeter Zijlstra #else 534391e43daSPeter Zijlstra return 0; 535391e43daSPeter Zijlstra #endif 536391e43daSPeter Zijlstra } 537391e43daSPeter Zijlstra 538391e43daSPeter Zijlstra DECLARE_PER_CPU(struct rq, runqueues); 539391e43daSPeter Zijlstra 540518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 541518cd623SPeter Zijlstra #define this_rq() (&__get_cpu_var(runqueues)) 542518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 543518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 544518cd623SPeter Zijlstra #define raw_rq() (&__raw_get_cpu_var(runqueues)) 545518cd623SPeter Zijlstra 54678becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 54778becc27SFrederic Weisbecker { 54878becc27SFrederic Weisbecker return rq->clock; 54978becc27SFrederic Weisbecker } 55078becc27SFrederic Weisbecker 55178becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 55278becc27SFrederic Weisbecker { 55378becc27SFrederic Weisbecker return rq->clock_task; 55478becc27SFrederic Weisbecker } 55578becc27SFrederic Weisbecker 556518cd623SPeter Zijlstra #ifdef CONFIG_SMP 557518cd623SPeter Zijlstra 558391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 559391e43daSPeter Zijlstra rcu_dereference_check((p), \ 560391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 561391e43daSPeter Zijlstra 562391e43daSPeter Zijlstra /* 563391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 564391e43daSPeter Zijlstra * See detach_destroy_domains: synchronize_sched for details. 565391e43daSPeter Zijlstra * 566391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 567391e43daSPeter Zijlstra * preempt-disabled sections. 568391e43daSPeter Zijlstra */ 569391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 570518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 571518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 572391e43daSPeter Zijlstra 57377e81365SSuresh Siddha #define for_each_lower_domain(sd) for (; sd; sd = sd->child) 57477e81365SSuresh Siddha 575518cd623SPeter Zijlstra /** 576518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 577518cd623SPeter Zijlstra * @cpu: The cpu whose highest level of sched domain is to 578518cd623SPeter Zijlstra * be returned. 579518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 580518cd623SPeter Zijlstra * for the given cpu. 581518cd623SPeter Zijlstra * 582518cd623SPeter Zijlstra * Returns the highest sched_domain of a cpu which contains the given flag. 583518cd623SPeter Zijlstra */ 584518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 585518cd623SPeter Zijlstra { 586518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 587518cd623SPeter Zijlstra 588518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 589518cd623SPeter Zijlstra if (!(sd->flags & flag)) 590518cd623SPeter Zijlstra break; 591518cd623SPeter Zijlstra hsd = sd; 592518cd623SPeter Zijlstra } 593518cd623SPeter Zijlstra 594518cd623SPeter Zijlstra return hsd; 595518cd623SPeter Zijlstra } 596518cd623SPeter Zijlstra 597518cd623SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain *, sd_llc); 598518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 599518cd623SPeter Zijlstra 6005e6521eaSLi Zefan struct sched_group_power { 6015e6521eaSLi Zefan atomic_t ref; 6025e6521eaSLi Zefan /* 6035e6521eaSLi Zefan * CPU power of this group, SCHED_LOAD_SCALE being max power for a 6045e6521eaSLi Zefan * single CPU. 6055e6521eaSLi Zefan */ 6065e6521eaSLi Zefan unsigned int power, power_orig; 6075e6521eaSLi Zefan unsigned long next_update; 6085e6521eaSLi Zefan /* 6095e6521eaSLi Zefan * Number of busy cpus in this group. 6105e6521eaSLi Zefan */ 6115e6521eaSLi Zefan atomic_t nr_busy_cpus; 6125e6521eaSLi Zefan 6135e6521eaSLi Zefan unsigned long cpumask[0]; /* iteration mask */ 6145e6521eaSLi Zefan }; 6155e6521eaSLi Zefan 6165e6521eaSLi Zefan struct sched_group { 6175e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 6185e6521eaSLi Zefan atomic_t ref; 6195e6521eaSLi Zefan 6205e6521eaSLi Zefan unsigned int group_weight; 6215e6521eaSLi Zefan struct sched_group_power *sgp; 6225e6521eaSLi Zefan 6235e6521eaSLi Zefan /* 6245e6521eaSLi Zefan * The CPUs this group covers. 6255e6521eaSLi Zefan * 6265e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 6275e6521eaSLi Zefan * by attaching extra space to the end of the structure, 6285e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 6295e6521eaSLi Zefan */ 6305e6521eaSLi Zefan unsigned long cpumask[0]; 6315e6521eaSLi Zefan }; 6325e6521eaSLi Zefan 6335e6521eaSLi Zefan static inline struct cpumask *sched_group_cpus(struct sched_group *sg) 6345e6521eaSLi Zefan { 6355e6521eaSLi Zefan return to_cpumask(sg->cpumask); 6365e6521eaSLi Zefan } 6375e6521eaSLi Zefan 6385e6521eaSLi Zefan /* 6395e6521eaSLi Zefan * cpumask masking which cpus in the group are allowed to iterate up the domain 6405e6521eaSLi Zefan * tree. 6415e6521eaSLi Zefan */ 6425e6521eaSLi Zefan static inline struct cpumask *sched_group_mask(struct sched_group *sg) 6435e6521eaSLi Zefan { 6445e6521eaSLi Zefan return to_cpumask(sg->sgp->cpumask); 6455e6521eaSLi Zefan } 6465e6521eaSLi Zefan 6475e6521eaSLi Zefan /** 6485e6521eaSLi Zefan * group_first_cpu - Returns the first cpu in the cpumask of a sched_group. 6495e6521eaSLi Zefan * @group: The group whose first cpu is to be returned. 6505e6521eaSLi Zefan */ 6515e6521eaSLi Zefan static inline unsigned int group_first_cpu(struct sched_group *group) 6525e6521eaSLi Zefan { 6535e6521eaSLi Zefan return cpumask_first(sched_group_cpus(group)); 6545e6521eaSLi Zefan } 6555e6521eaSLi Zefan 656c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 657c1174876SPeter Zijlstra 658518cd623SPeter Zijlstra #endif /* CONFIG_SMP */ 659391e43daSPeter Zijlstra 660391e43daSPeter Zijlstra #include "stats.h" 661391e43daSPeter Zijlstra #include "auto_group.h" 662391e43daSPeter Zijlstra 663391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 664391e43daSPeter Zijlstra 665391e43daSPeter Zijlstra /* 666391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 667391e43daSPeter Zijlstra * 6688323f26cSPeter Zijlstra * We cannot use task_subsys_state() and friends because the cgroup 6698323f26cSPeter Zijlstra * subsystem changes that value before the cgroup_subsys::attach() method 6708323f26cSPeter Zijlstra * is called, therefore we cannot pin it and might observe the wrong value. 6718323f26cSPeter Zijlstra * 6728323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 6738323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 6748323f26cSPeter Zijlstra * 6758323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 6768323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 677391e43daSPeter Zijlstra */ 678391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 679391e43daSPeter Zijlstra { 6808323f26cSPeter Zijlstra return p->sched_task_group; 681391e43daSPeter Zijlstra } 682391e43daSPeter Zijlstra 683391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 684391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 685391e43daSPeter Zijlstra { 686391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 687391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 688391e43daSPeter Zijlstra #endif 689391e43daSPeter Zijlstra 690391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 691391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 692391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 693391e43daSPeter Zijlstra #endif 694391e43daSPeter Zijlstra 695391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 696391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 697391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 698391e43daSPeter Zijlstra #endif 699391e43daSPeter Zijlstra } 700391e43daSPeter Zijlstra 701391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 702391e43daSPeter Zijlstra 703391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 704391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 705391e43daSPeter Zijlstra { 706391e43daSPeter Zijlstra return NULL; 707391e43daSPeter Zijlstra } 708391e43daSPeter Zijlstra 709391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 710391e43daSPeter Zijlstra 711391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 712391e43daSPeter Zijlstra { 713391e43daSPeter Zijlstra set_task_rq(p, cpu); 714391e43daSPeter Zijlstra #ifdef CONFIG_SMP 715391e43daSPeter Zijlstra /* 716391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 717391e43daSPeter Zijlstra * successfuly executed on another CPU. We must ensure that updates of 718391e43daSPeter Zijlstra * per-task data have been completed by this moment. 719391e43daSPeter Zijlstra */ 720391e43daSPeter Zijlstra smp_wmb(); 721391e43daSPeter Zijlstra task_thread_info(p)->cpu = cpu; 722391e43daSPeter Zijlstra #endif 723391e43daSPeter Zijlstra } 724391e43daSPeter Zijlstra 725391e43daSPeter Zijlstra /* 726391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 727391e43daSPeter Zijlstra */ 728391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 729c5905afbSIngo Molnar # include <linux/static_key.h> 730391e43daSPeter Zijlstra # define const_debug __read_mostly 731391e43daSPeter Zijlstra #else 732391e43daSPeter Zijlstra # define const_debug const 733391e43daSPeter Zijlstra #endif 734391e43daSPeter Zijlstra 735391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_features; 736391e43daSPeter Zijlstra 737391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 738391e43daSPeter Zijlstra __SCHED_FEAT_##name , 739391e43daSPeter Zijlstra 740391e43daSPeter Zijlstra enum { 741391e43daSPeter Zijlstra #include "features.h" 742f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 743391e43daSPeter Zijlstra }; 744391e43daSPeter Zijlstra 745391e43daSPeter Zijlstra #undef SCHED_FEAT 746391e43daSPeter Zijlstra 747f8b6d1ccSPeter Zijlstra #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) 748c5905afbSIngo Molnar static __always_inline bool static_branch__true(struct static_key *key) 749f8b6d1ccSPeter Zijlstra { 750c5905afbSIngo Molnar return static_key_true(key); /* Not out of line branch. */ 751f8b6d1ccSPeter Zijlstra } 752f8b6d1ccSPeter Zijlstra 753c5905afbSIngo Molnar static __always_inline bool static_branch__false(struct static_key *key) 754f8b6d1ccSPeter Zijlstra { 755c5905afbSIngo Molnar return static_key_false(key); /* Out of line branch. */ 756f8b6d1ccSPeter Zijlstra } 757f8b6d1ccSPeter Zijlstra 758f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 759c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 760f8b6d1ccSPeter Zijlstra { \ 761f8b6d1ccSPeter Zijlstra return static_branch__##enabled(key); \ 762f8b6d1ccSPeter Zijlstra } 763f8b6d1ccSPeter Zijlstra 764f8b6d1ccSPeter Zijlstra #include "features.h" 765f8b6d1ccSPeter Zijlstra 766f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 767f8b6d1ccSPeter Zijlstra 768c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 769f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 770f8b6d1ccSPeter Zijlstra #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ 771391e43daSPeter Zijlstra #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 772f8b6d1ccSPeter Zijlstra #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ 773391e43daSPeter Zijlstra 774cbee9f88SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 775cbee9f88SPeter Zijlstra #define sched_feat_numa(x) sched_feat(x) 7763105b86aSMel Gorman #ifdef CONFIG_SCHED_DEBUG 7773105b86aSMel Gorman #define numabalancing_enabled sched_feat_numa(NUMA) 7783105b86aSMel Gorman #else 7793105b86aSMel Gorman extern bool numabalancing_enabled; 7803105b86aSMel Gorman #endif /* CONFIG_SCHED_DEBUG */ 781cbee9f88SPeter Zijlstra #else 782cbee9f88SPeter Zijlstra #define sched_feat_numa(x) (0) 7833105b86aSMel Gorman #define numabalancing_enabled (0) 7843105b86aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 785cbee9f88SPeter Zijlstra 786391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 787391e43daSPeter Zijlstra { 788391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 789391e43daSPeter Zijlstra } 790391e43daSPeter Zijlstra 791391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 792391e43daSPeter Zijlstra { 793391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 794391e43daSPeter Zijlstra return RUNTIME_INF; 795391e43daSPeter Zijlstra 796391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 797391e43daSPeter Zijlstra } 798391e43daSPeter Zijlstra 799391e43daSPeter Zijlstra 800391e43daSPeter Zijlstra 801391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 802391e43daSPeter Zijlstra { 803391e43daSPeter Zijlstra return rq->curr == p; 804391e43daSPeter Zijlstra } 805391e43daSPeter Zijlstra 806391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 807391e43daSPeter Zijlstra { 808391e43daSPeter Zijlstra #ifdef CONFIG_SMP 809391e43daSPeter Zijlstra return p->on_cpu; 810391e43daSPeter Zijlstra #else 811391e43daSPeter Zijlstra return task_current(rq, p); 812391e43daSPeter Zijlstra #endif 813391e43daSPeter Zijlstra } 814391e43daSPeter Zijlstra 815391e43daSPeter Zijlstra 816391e43daSPeter Zijlstra #ifndef prepare_arch_switch 817391e43daSPeter Zijlstra # define prepare_arch_switch(next) do { } while (0) 818391e43daSPeter Zijlstra #endif 819391e43daSPeter Zijlstra #ifndef finish_arch_switch 820391e43daSPeter Zijlstra # define finish_arch_switch(prev) do { } while (0) 821391e43daSPeter Zijlstra #endif 82201f23e16SCatalin Marinas #ifndef finish_arch_post_lock_switch 82301f23e16SCatalin Marinas # define finish_arch_post_lock_switch() do { } while (0) 82401f23e16SCatalin Marinas #endif 825391e43daSPeter Zijlstra 826391e43daSPeter Zijlstra #ifndef __ARCH_WANT_UNLOCKED_CTXSW 827391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 828391e43daSPeter Zijlstra { 829391e43daSPeter Zijlstra #ifdef CONFIG_SMP 830391e43daSPeter Zijlstra /* 831391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 832391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 833391e43daSPeter Zijlstra * here. 834391e43daSPeter Zijlstra */ 835391e43daSPeter Zijlstra next->on_cpu = 1; 836391e43daSPeter Zijlstra #endif 837391e43daSPeter Zijlstra } 838391e43daSPeter Zijlstra 839391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 840391e43daSPeter Zijlstra { 841391e43daSPeter Zijlstra #ifdef CONFIG_SMP 842391e43daSPeter Zijlstra /* 843391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 844391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 845391e43daSPeter Zijlstra * finished. 846391e43daSPeter Zijlstra */ 847391e43daSPeter Zijlstra smp_wmb(); 848391e43daSPeter Zijlstra prev->on_cpu = 0; 849391e43daSPeter Zijlstra #endif 850391e43daSPeter Zijlstra #ifdef CONFIG_DEBUG_SPINLOCK 851391e43daSPeter Zijlstra /* this is a valid case when another task releases the spinlock */ 852391e43daSPeter Zijlstra rq->lock.owner = current; 853391e43daSPeter Zijlstra #endif 854391e43daSPeter Zijlstra /* 855391e43daSPeter Zijlstra * If we are tracking spinlock dependencies then we have to 856391e43daSPeter Zijlstra * fix up the runqueue lock - which gets 'carried over' from 857391e43daSPeter Zijlstra * prev into current: 858391e43daSPeter Zijlstra */ 859391e43daSPeter Zijlstra spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); 860391e43daSPeter Zijlstra 861391e43daSPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 862391e43daSPeter Zijlstra } 863391e43daSPeter Zijlstra 864391e43daSPeter Zijlstra #else /* __ARCH_WANT_UNLOCKED_CTXSW */ 865391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 866391e43daSPeter Zijlstra { 867391e43daSPeter Zijlstra #ifdef CONFIG_SMP 868391e43daSPeter Zijlstra /* 869391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 870391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 871391e43daSPeter Zijlstra * here. 872391e43daSPeter Zijlstra */ 873391e43daSPeter Zijlstra next->on_cpu = 1; 874391e43daSPeter Zijlstra #endif 875391e43daSPeter Zijlstra raw_spin_unlock(&rq->lock); 876391e43daSPeter Zijlstra } 877391e43daSPeter Zijlstra 878391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 879391e43daSPeter Zijlstra { 880391e43daSPeter Zijlstra #ifdef CONFIG_SMP 881391e43daSPeter Zijlstra /* 882391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 883391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 884391e43daSPeter Zijlstra * finished. 885391e43daSPeter Zijlstra */ 886391e43daSPeter Zijlstra smp_wmb(); 887391e43daSPeter Zijlstra prev->on_cpu = 0; 888391e43daSPeter Zijlstra #endif 889391e43daSPeter Zijlstra local_irq_enable(); 890391e43daSPeter Zijlstra } 891391e43daSPeter Zijlstra #endif /* __ARCH_WANT_UNLOCKED_CTXSW */ 892391e43daSPeter Zijlstra 893b13095f0SLi Zefan /* 894b13095f0SLi Zefan * wake flags 895b13095f0SLi Zefan */ 896b13095f0SLi Zefan #define WF_SYNC 0x01 /* waker goes to sleep after wakeup */ 897b13095f0SLi Zefan #define WF_FORK 0x02 /* child wakeup after fork */ 898b13095f0SLi Zefan #define WF_MIGRATED 0x4 /* internal use, task got migrated */ 899b13095f0SLi Zefan 900391e43daSPeter Zijlstra /* 901391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 902391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 903391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 904391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 905391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 906391e43daSPeter Zijlstra * slice expiry etc. 907391e43daSPeter Zijlstra */ 908391e43daSPeter Zijlstra 909391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 910391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 911391e43daSPeter Zijlstra 912391e43daSPeter Zijlstra /* 913391e43daSPeter Zijlstra * Nice levels are multiplicative, with a gentle 10% change for every 914391e43daSPeter Zijlstra * nice level changed. I.e. when a CPU-bound task goes from nice 0 to 915391e43daSPeter Zijlstra * nice 1, it will get ~10% less CPU time than another CPU-bound task 916391e43daSPeter Zijlstra * that remained on nice 0. 917391e43daSPeter Zijlstra * 918391e43daSPeter Zijlstra * The "10% effect" is relative and cumulative: from _any_ nice level, 919391e43daSPeter Zijlstra * if you go up 1 level, it's -10% CPU usage, if you go down 1 level 920391e43daSPeter Zijlstra * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. 921391e43daSPeter Zijlstra * If a task goes up by ~10% and another task goes down by ~10% then 922391e43daSPeter Zijlstra * the relative distance between them is ~25%.) 923391e43daSPeter Zijlstra */ 924391e43daSPeter Zijlstra static const int prio_to_weight[40] = { 925391e43daSPeter Zijlstra /* -20 */ 88761, 71755, 56483, 46273, 36291, 926391e43daSPeter Zijlstra /* -15 */ 29154, 23254, 18705, 14949, 11916, 927391e43daSPeter Zijlstra /* -10 */ 9548, 7620, 6100, 4904, 3906, 928391e43daSPeter Zijlstra /* -5 */ 3121, 2501, 1991, 1586, 1277, 929391e43daSPeter Zijlstra /* 0 */ 1024, 820, 655, 526, 423, 930391e43daSPeter Zijlstra /* 5 */ 335, 272, 215, 172, 137, 931391e43daSPeter Zijlstra /* 10 */ 110, 87, 70, 56, 45, 932391e43daSPeter Zijlstra /* 15 */ 36, 29, 23, 18, 15, 933391e43daSPeter Zijlstra }; 934391e43daSPeter Zijlstra 935391e43daSPeter Zijlstra /* 936391e43daSPeter Zijlstra * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated. 937391e43daSPeter Zijlstra * 938391e43daSPeter Zijlstra * In cases where the weight does not change often, we can use the 939391e43daSPeter Zijlstra * precalculated inverse to speed up arithmetics by turning divisions 940391e43daSPeter Zijlstra * into multiplications: 941391e43daSPeter Zijlstra */ 942391e43daSPeter Zijlstra static const u32 prio_to_wmult[40] = { 943391e43daSPeter Zijlstra /* -20 */ 48388, 59856, 76040, 92818, 118348, 944391e43daSPeter Zijlstra /* -15 */ 147320, 184698, 229616, 287308, 360437, 945391e43daSPeter Zijlstra /* -10 */ 449829, 563644, 704093, 875809, 1099582, 946391e43daSPeter Zijlstra /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, 947391e43daSPeter Zijlstra /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, 948391e43daSPeter Zijlstra /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, 949391e43daSPeter Zijlstra /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, 950391e43daSPeter Zijlstra /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, 951391e43daSPeter Zijlstra }; 952391e43daSPeter Zijlstra 953c82ba9faSLi Zefan #define ENQUEUE_WAKEUP 1 954c82ba9faSLi Zefan #define ENQUEUE_HEAD 2 955c82ba9faSLi Zefan #ifdef CONFIG_SMP 956c82ba9faSLi Zefan #define ENQUEUE_WAKING 4 /* sched_class::task_waking was called */ 957c82ba9faSLi Zefan #else 958c82ba9faSLi Zefan #define ENQUEUE_WAKING 0 959c82ba9faSLi Zefan #endif 960c82ba9faSLi Zefan 961c82ba9faSLi Zefan #define DEQUEUE_SLEEP 1 962c82ba9faSLi Zefan 963c82ba9faSLi Zefan struct sched_class { 964c82ba9faSLi Zefan const struct sched_class *next; 965c82ba9faSLi Zefan 966c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 967c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 968c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 969c82ba9faSLi Zefan bool (*yield_to_task) (struct rq *rq, struct task_struct *p, bool preempt); 970c82ba9faSLi Zefan 971c82ba9faSLi Zefan void (*check_preempt_curr) (struct rq *rq, struct task_struct *p, int flags); 972c82ba9faSLi Zefan 973c82ba9faSLi Zefan struct task_struct * (*pick_next_task) (struct rq *rq); 974c82ba9faSLi Zefan void (*put_prev_task) (struct rq *rq, struct task_struct *p); 975c82ba9faSLi Zefan 976c82ba9faSLi Zefan #ifdef CONFIG_SMP 977c82ba9faSLi Zefan int (*select_task_rq)(struct task_struct *p, int sd_flag, int flags); 978c82ba9faSLi Zefan void (*migrate_task_rq)(struct task_struct *p, int next_cpu); 979c82ba9faSLi Zefan 980c82ba9faSLi Zefan void (*pre_schedule) (struct rq *this_rq, struct task_struct *task); 981c82ba9faSLi Zefan void (*post_schedule) (struct rq *this_rq); 982c82ba9faSLi Zefan void (*task_waking) (struct task_struct *task); 983c82ba9faSLi Zefan void (*task_woken) (struct rq *this_rq, struct task_struct *task); 984c82ba9faSLi Zefan 985c82ba9faSLi Zefan void (*set_cpus_allowed)(struct task_struct *p, 986c82ba9faSLi Zefan const struct cpumask *newmask); 987c82ba9faSLi Zefan 988c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 989c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 990c82ba9faSLi Zefan #endif 991c82ba9faSLi Zefan 992c82ba9faSLi Zefan void (*set_curr_task) (struct rq *rq); 993c82ba9faSLi Zefan void (*task_tick) (struct rq *rq, struct task_struct *p, int queued); 994c82ba9faSLi Zefan void (*task_fork) (struct task_struct *p); 995c82ba9faSLi Zefan 996c82ba9faSLi Zefan void (*switched_from) (struct rq *this_rq, struct task_struct *task); 997c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 998c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 999c82ba9faSLi Zefan int oldprio); 1000c82ba9faSLi Zefan 1001c82ba9faSLi Zefan unsigned int (*get_rr_interval) (struct rq *rq, 1002c82ba9faSLi Zefan struct task_struct *task); 1003c82ba9faSLi Zefan 1004c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 1005c82ba9faSLi Zefan void (*task_move_group) (struct task_struct *p, int on_rq); 1006c82ba9faSLi Zefan #endif 1007c82ba9faSLi Zefan }; 1008391e43daSPeter Zijlstra 1009391e43daSPeter Zijlstra #define sched_class_highest (&stop_sched_class) 1010391e43daSPeter Zijlstra #define for_each_class(class) \ 1011391e43daSPeter Zijlstra for (class = sched_class_highest; class; class = class->next) 1012391e43daSPeter Zijlstra 1013391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 1014391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 1015391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 1016391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 1017391e43daSPeter Zijlstra 1018391e43daSPeter Zijlstra 1019391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1020391e43daSPeter Zijlstra 1021b719203bSLi Zefan extern void update_group_power(struct sched_domain *sd, int cpu); 1022b719203bSLi Zefan 1023391e43daSPeter Zijlstra extern void trigger_load_balance(struct rq *rq, int cpu); 1024391e43daSPeter Zijlstra extern void idle_balance(int this_cpu, struct rq *this_rq); 1025391e43daSPeter Zijlstra 1026642dbc39SVincent Guittot extern void idle_enter_fair(struct rq *this_rq); 1027642dbc39SVincent Guittot extern void idle_exit_fair(struct rq *this_rq); 1028642dbc39SVincent Guittot 1029391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1030391e43daSPeter Zijlstra 1031391e43daSPeter Zijlstra static inline void idle_balance(int cpu, struct rq *rq) 1032391e43daSPeter Zijlstra { 1033391e43daSPeter Zijlstra } 1034391e43daSPeter Zijlstra 1035391e43daSPeter Zijlstra #endif 1036391e43daSPeter Zijlstra 1037391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 1038391e43daSPeter Zijlstra extern void sched_init_granularity(void); 1039391e43daSPeter Zijlstra extern void update_max_interval(void); 1040391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 1041391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 1042391e43daSPeter Zijlstra 1043391e43daSPeter Zijlstra extern void resched_task(struct task_struct *p); 1044391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 1045391e43daSPeter Zijlstra 1046391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 1047391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 1048391e43daSPeter Zijlstra 1049556061b0SPeter Zijlstra extern void update_idle_cpu_load(struct rq *this_rq); 1050391e43daSPeter Zijlstra 1051a75cdaa9SAlex Shi extern void init_task_runnable_average(struct task_struct *p); 1052a75cdaa9SAlex Shi 105373fbec60SFrederic Weisbecker #ifdef CONFIG_PARAVIRT 105473fbec60SFrederic Weisbecker static inline u64 steal_ticks(u64 steal) 105573fbec60SFrederic Weisbecker { 105673fbec60SFrederic Weisbecker if (unlikely(steal > NSEC_PER_SEC)) 105773fbec60SFrederic Weisbecker return div_u64(steal, TICK_NSEC); 105873fbec60SFrederic Weisbecker 105973fbec60SFrederic Weisbecker return __iter_div_u64_rem(steal, TICK_NSEC, &steal); 106073fbec60SFrederic Weisbecker } 106173fbec60SFrederic Weisbecker #endif 106273fbec60SFrederic Weisbecker 1063391e43daSPeter Zijlstra static inline void inc_nr_running(struct rq *rq) 1064391e43daSPeter Zijlstra { 1065391e43daSPeter Zijlstra rq->nr_running++; 10669f3660c2SFrederic Weisbecker 10679f3660c2SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 10689f3660c2SFrederic Weisbecker if (rq->nr_running == 2) { 10699f3660c2SFrederic Weisbecker if (tick_nohz_full_cpu(rq->cpu)) { 10709f3660c2SFrederic Weisbecker /* Order rq->nr_running write against the IPI */ 10719f3660c2SFrederic Weisbecker smp_wmb(); 10729f3660c2SFrederic Weisbecker smp_send_reschedule(rq->cpu); 10739f3660c2SFrederic Weisbecker } 10749f3660c2SFrederic Weisbecker } 10759f3660c2SFrederic Weisbecker #endif 1076391e43daSPeter Zijlstra } 1077391e43daSPeter Zijlstra 1078391e43daSPeter Zijlstra static inline void dec_nr_running(struct rq *rq) 1079391e43daSPeter Zijlstra { 1080391e43daSPeter Zijlstra rq->nr_running--; 1081391e43daSPeter Zijlstra } 1082391e43daSPeter Zijlstra 1083265f22a9SFrederic Weisbecker static inline void rq_last_tick_reset(struct rq *rq) 1084265f22a9SFrederic Weisbecker { 1085265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 1086265f22a9SFrederic Weisbecker rq->last_sched_tick = jiffies; 1087265f22a9SFrederic Weisbecker #endif 1088265f22a9SFrederic Weisbecker } 1089265f22a9SFrederic Weisbecker 1090391e43daSPeter Zijlstra extern void update_rq_clock(struct rq *rq); 1091391e43daSPeter Zijlstra 1092391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 1093391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 1094391e43daSPeter Zijlstra 1095391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 1096391e43daSPeter Zijlstra 1097391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_time_avg; 1098391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 1099391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 1100391e43daSPeter Zijlstra 1101391e43daSPeter Zijlstra static inline u64 sched_avg_period(void) 1102391e43daSPeter Zijlstra { 1103391e43daSPeter Zijlstra return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; 1104391e43daSPeter Zijlstra } 1105391e43daSPeter Zijlstra 1106391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1107391e43daSPeter Zijlstra 1108391e43daSPeter Zijlstra /* 1109391e43daSPeter Zijlstra * Use hrtick when: 1110391e43daSPeter Zijlstra * - enabled by features 1111391e43daSPeter Zijlstra * - hrtimer is actually high res 1112391e43daSPeter Zijlstra */ 1113391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 1114391e43daSPeter Zijlstra { 1115391e43daSPeter Zijlstra if (!sched_feat(HRTICK)) 1116391e43daSPeter Zijlstra return 0; 1117391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 1118391e43daSPeter Zijlstra return 0; 1119391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 1120391e43daSPeter Zijlstra } 1121391e43daSPeter Zijlstra 1122391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 1123391e43daSPeter Zijlstra 1124b39e66eaSMike Galbraith #else 1125b39e66eaSMike Galbraith 1126b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 1127b39e66eaSMike Galbraith { 1128b39e66eaSMike Galbraith return 0; 1129b39e66eaSMike Galbraith } 1130b39e66eaSMike Galbraith 1131391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 1132391e43daSPeter Zijlstra 1133391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1134391e43daSPeter Zijlstra extern void sched_avg_update(struct rq *rq); 1135391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) 1136391e43daSPeter Zijlstra { 1137391e43daSPeter Zijlstra rq->rt_avg += rt_delta; 1138391e43daSPeter Zijlstra sched_avg_update(rq); 1139391e43daSPeter Zijlstra } 1140391e43daSPeter Zijlstra #else 1141391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) { } 1142391e43daSPeter Zijlstra static inline void sched_avg_update(struct rq *rq) { } 1143391e43daSPeter Zijlstra #endif 1144391e43daSPeter Zijlstra 1145391e43daSPeter Zijlstra extern void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period); 1146391e43daSPeter Zijlstra 1147391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1148391e43daSPeter Zijlstra #ifdef CONFIG_PREEMPT 1149391e43daSPeter Zijlstra 1150391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); 1151391e43daSPeter Zijlstra 1152391e43daSPeter Zijlstra /* 1153391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 1154391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 1155391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 1156391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 1157391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 1158391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 1159391e43daSPeter Zijlstra */ 1160391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1161391e43daSPeter Zijlstra __releases(this_rq->lock) 1162391e43daSPeter Zijlstra __acquires(busiest->lock) 1163391e43daSPeter Zijlstra __acquires(this_rq->lock) 1164391e43daSPeter Zijlstra { 1165391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1166391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 1167391e43daSPeter Zijlstra 1168391e43daSPeter Zijlstra return 1; 1169391e43daSPeter Zijlstra } 1170391e43daSPeter Zijlstra 1171391e43daSPeter Zijlstra #else 1172391e43daSPeter Zijlstra /* 1173391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 1174391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 1175391e43daSPeter Zijlstra * already in proper order on entry. This favors lower cpu-ids and will 1176391e43daSPeter Zijlstra * grant the double lock to lower cpus over higher ids under contention, 1177391e43daSPeter Zijlstra * regardless of entry order into the function. 1178391e43daSPeter Zijlstra */ 1179391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1180391e43daSPeter Zijlstra __releases(this_rq->lock) 1181391e43daSPeter Zijlstra __acquires(busiest->lock) 1182391e43daSPeter Zijlstra __acquires(this_rq->lock) 1183391e43daSPeter Zijlstra { 1184391e43daSPeter Zijlstra int ret = 0; 1185391e43daSPeter Zijlstra 1186391e43daSPeter Zijlstra if (unlikely(!raw_spin_trylock(&busiest->lock))) { 1187391e43daSPeter Zijlstra if (busiest < this_rq) { 1188391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1189391e43daSPeter Zijlstra raw_spin_lock(&busiest->lock); 1190391e43daSPeter Zijlstra raw_spin_lock_nested(&this_rq->lock, 1191391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1192391e43daSPeter Zijlstra ret = 1; 1193391e43daSPeter Zijlstra } else 1194391e43daSPeter Zijlstra raw_spin_lock_nested(&busiest->lock, 1195391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1196391e43daSPeter Zijlstra } 1197391e43daSPeter Zijlstra return ret; 1198391e43daSPeter Zijlstra } 1199391e43daSPeter Zijlstra 1200391e43daSPeter Zijlstra #endif /* CONFIG_PREEMPT */ 1201391e43daSPeter Zijlstra 1202391e43daSPeter Zijlstra /* 1203391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 1204391e43daSPeter Zijlstra */ 1205391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 1206391e43daSPeter Zijlstra { 1207391e43daSPeter Zijlstra if (unlikely(!irqs_disabled())) { 1208391e43daSPeter Zijlstra /* printk() doesn't work good under rq->lock */ 1209391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1210391e43daSPeter Zijlstra BUG_ON(1); 1211391e43daSPeter Zijlstra } 1212391e43daSPeter Zijlstra 1213391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 1214391e43daSPeter Zijlstra } 1215391e43daSPeter Zijlstra 1216391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 1217391e43daSPeter Zijlstra __releases(busiest->lock) 1218391e43daSPeter Zijlstra { 1219391e43daSPeter Zijlstra raw_spin_unlock(&busiest->lock); 1220391e43daSPeter Zijlstra lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); 1221391e43daSPeter Zijlstra } 1222391e43daSPeter Zijlstra 1223391e43daSPeter Zijlstra /* 1224391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1225391e43daSPeter Zijlstra * 1226391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1227391e43daSPeter Zijlstra * you need to do so manually before calling. 1228391e43daSPeter Zijlstra */ 1229391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1230391e43daSPeter Zijlstra __acquires(rq1->lock) 1231391e43daSPeter Zijlstra __acquires(rq2->lock) 1232391e43daSPeter Zijlstra { 1233391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1234391e43daSPeter Zijlstra if (rq1 == rq2) { 1235391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1236391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1237391e43daSPeter Zijlstra } else { 1238391e43daSPeter Zijlstra if (rq1 < rq2) { 1239391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1240391e43daSPeter Zijlstra raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); 1241391e43daSPeter Zijlstra } else { 1242391e43daSPeter Zijlstra raw_spin_lock(&rq2->lock); 1243391e43daSPeter Zijlstra raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); 1244391e43daSPeter Zijlstra } 1245391e43daSPeter Zijlstra } 1246391e43daSPeter Zijlstra } 1247391e43daSPeter Zijlstra 1248391e43daSPeter Zijlstra /* 1249391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1250391e43daSPeter Zijlstra * 1251391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1252391e43daSPeter Zijlstra * you need to do so manually after calling. 1253391e43daSPeter Zijlstra */ 1254391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1255391e43daSPeter Zijlstra __releases(rq1->lock) 1256391e43daSPeter Zijlstra __releases(rq2->lock) 1257391e43daSPeter Zijlstra { 1258391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1259391e43daSPeter Zijlstra if (rq1 != rq2) 1260391e43daSPeter Zijlstra raw_spin_unlock(&rq2->lock); 1261391e43daSPeter Zijlstra else 1262391e43daSPeter Zijlstra __release(rq2->lock); 1263391e43daSPeter Zijlstra } 1264391e43daSPeter Zijlstra 1265391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1266391e43daSPeter Zijlstra 1267391e43daSPeter Zijlstra /* 1268391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1269391e43daSPeter Zijlstra * 1270391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1271391e43daSPeter Zijlstra * you need to do so manually before calling. 1272391e43daSPeter Zijlstra */ 1273391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1274391e43daSPeter Zijlstra __acquires(rq1->lock) 1275391e43daSPeter Zijlstra __acquires(rq2->lock) 1276391e43daSPeter Zijlstra { 1277391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1278391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1279391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1280391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1281391e43daSPeter Zijlstra } 1282391e43daSPeter Zijlstra 1283391e43daSPeter Zijlstra /* 1284391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1285391e43daSPeter Zijlstra * 1286391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1287391e43daSPeter Zijlstra * you need to do so manually after calling. 1288391e43daSPeter Zijlstra */ 1289391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1290391e43daSPeter Zijlstra __releases(rq1->lock) 1291391e43daSPeter Zijlstra __releases(rq2->lock) 1292391e43daSPeter Zijlstra { 1293391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1294391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1295391e43daSPeter Zijlstra __release(rq2->lock); 1296391e43daSPeter Zijlstra } 1297391e43daSPeter Zijlstra 1298391e43daSPeter Zijlstra #endif 1299391e43daSPeter Zijlstra 1300391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 1301391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 1302391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 1303391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 1304391e43daSPeter Zijlstra 1305391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 1306391e43daSPeter Zijlstra extern void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq); 1307391e43daSPeter Zijlstra 1308391e43daSPeter Zijlstra extern void account_cfs_bandwidth_used(int enabled, int was_enabled); 13091c792db7SSuresh Siddha 13103451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 13111c792db7SSuresh Siddha enum rq_nohz_flag_bits { 13121c792db7SSuresh Siddha NOHZ_TICK_STOPPED, 13131c792db7SSuresh Siddha NOHZ_BALANCE_KICK, 13141c792db7SSuresh Siddha }; 13151c792db7SSuresh Siddha 13161c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 13171c792db7SSuresh Siddha #endif 131873fbec60SFrederic Weisbecker 131973fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 132073fbec60SFrederic Weisbecker 132173fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_hardirq_time); 132273fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_softirq_time); 132373fbec60SFrederic Weisbecker 132473fbec60SFrederic Weisbecker #ifndef CONFIG_64BIT 132573fbec60SFrederic Weisbecker DECLARE_PER_CPU(seqcount_t, irq_time_seq); 132673fbec60SFrederic Weisbecker 132773fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 132873fbec60SFrederic Weisbecker { 132973fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 133073fbec60SFrederic Weisbecker smp_wmb(); 133173fbec60SFrederic Weisbecker } 133273fbec60SFrederic Weisbecker 133373fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 133473fbec60SFrederic Weisbecker { 133573fbec60SFrederic Weisbecker smp_wmb(); 133673fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 133773fbec60SFrederic Weisbecker } 133873fbec60SFrederic Weisbecker 133973fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 134073fbec60SFrederic Weisbecker { 134173fbec60SFrederic Weisbecker u64 irq_time; 134273fbec60SFrederic Weisbecker unsigned seq; 134373fbec60SFrederic Weisbecker 134473fbec60SFrederic Weisbecker do { 134573fbec60SFrederic Weisbecker seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu)); 134673fbec60SFrederic Weisbecker irq_time = per_cpu(cpu_softirq_time, cpu) + 134773fbec60SFrederic Weisbecker per_cpu(cpu_hardirq_time, cpu); 134873fbec60SFrederic Weisbecker } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq)); 134973fbec60SFrederic Weisbecker 135073fbec60SFrederic Weisbecker return irq_time; 135173fbec60SFrederic Weisbecker } 135273fbec60SFrederic Weisbecker #else /* CONFIG_64BIT */ 135373fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 135473fbec60SFrederic Weisbecker { 135573fbec60SFrederic Weisbecker } 135673fbec60SFrederic Weisbecker 135773fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 135873fbec60SFrederic Weisbecker { 135973fbec60SFrederic Weisbecker } 136073fbec60SFrederic Weisbecker 136173fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 136273fbec60SFrederic Weisbecker { 136373fbec60SFrederic Weisbecker return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu); 136473fbec60SFrederic Weisbecker } 136573fbec60SFrederic Weisbecker #endif /* CONFIG_64BIT */ 136673fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 1367