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> 9f809ca9aSMel Gorman #include <linux/slab.h> 10391e43daSPeter Zijlstra 11391e43daSPeter Zijlstra #include "cpupri.h" 1260fed789SLi Zefan #include "cpuacct.h" 13391e43daSPeter Zijlstra 1445ceebf7SPaul Gortmaker struct rq; 1545ceebf7SPaul Gortmaker 16391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 17391e43daSPeter Zijlstra 1845ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 1945ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 2045ceebf7SPaul Gortmaker 2145ceebf7SPaul Gortmaker extern long calc_load_fold_active(struct rq *this_rq); 2245ceebf7SPaul Gortmaker extern void update_cpu_load_active(struct rq *this_rq); 2345ceebf7SPaul Gortmaker 24391e43daSPeter Zijlstra /* 25391e43daSPeter Zijlstra * Convert user-nice values [ -20 ... 0 ... 19 ] 26391e43daSPeter Zijlstra * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ], 27391e43daSPeter Zijlstra * and back. 28391e43daSPeter Zijlstra */ 29391e43daSPeter Zijlstra #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20) 30391e43daSPeter Zijlstra #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20) 31391e43daSPeter Zijlstra #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio) 32391e43daSPeter Zijlstra 33391e43daSPeter Zijlstra /* 34391e43daSPeter Zijlstra * 'User priority' is the nice value converted to something we 35391e43daSPeter Zijlstra * can work with better when scaling various scheduler parameters, 36391e43daSPeter Zijlstra * it's a [ 0 ... 39 ] range. 37391e43daSPeter Zijlstra */ 38391e43daSPeter Zijlstra #define USER_PRIO(p) ((p)-MAX_RT_PRIO) 39391e43daSPeter Zijlstra #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio) 40391e43daSPeter Zijlstra #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO)) 41391e43daSPeter Zijlstra 42391e43daSPeter Zijlstra /* 43391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 44391e43daSPeter Zijlstra */ 45391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 46391e43daSPeter Zijlstra 47cc1f4b1fSLi Zefan /* 48cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 49cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 50cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 51cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 52cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 53cc1f4b1fSLi Zefan * 54cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 55cc1f4b1fSLi Zefan * resolution (i.e. BITS_PER_LONG > 32). The costs for increasing resolution 56cc1f4b1fSLi Zefan * when BITS_PER_LONG <= 32 are pretty high and the returns do not justify the 57cc1f4b1fSLi Zefan * increased costs. 58cc1f4b1fSLi Zefan */ 59cc1f4b1fSLi Zefan #if 0 /* BITS_PER_LONG > 32 -- currently broken: it increases power usage under light load */ 60cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 10 61cc1f4b1fSLi Zefan # define scale_load(w) ((w) << SCHED_LOAD_RESOLUTION) 62cc1f4b1fSLi Zefan # define scale_load_down(w) ((w) >> SCHED_LOAD_RESOLUTION) 63cc1f4b1fSLi Zefan #else 64cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 0 65cc1f4b1fSLi Zefan # define scale_load(w) (w) 66cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 67cc1f4b1fSLi Zefan #endif 68cc1f4b1fSLi Zefan 69cc1f4b1fSLi Zefan #define SCHED_LOAD_SHIFT (10 + SCHED_LOAD_RESOLUTION) 70cc1f4b1fSLi Zefan #define SCHED_LOAD_SCALE (1L << SCHED_LOAD_SHIFT) 71cc1f4b1fSLi Zefan 72391e43daSPeter Zijlstra #define NICE_0_LOAD SCHED_LOAD_SCALE 73391e43daSPeter Zijlstra #define NICE_0_SHIFT SCHED_LOAD_SHIFT 74391e43daSPeter Zijlstra 75391e43daSPeter Zijlstra /* 76391e43daSPeter Zijlstra * These are the 'tuning knobs' of the scheduler: 77391e43daSPeter Zijlstra */ 78391e43daSPeter Zijlstra 79391e43daSPeter Zijlstra /* 80391e43daSPeter Zijlstra * single value that denotes runtime == period, ie unlimited time. 81391e43daSPeter Zijlstra */ 82391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 83391e43daSPeter Zijlstra 84391e43daSPeter Zijlstra static inline int rt_policy(int policy) 85391e43daSPeter Zijlstra { 86391e43daSPeter Zijlstra if (policy == SCHED_FIFO || policy == SCHED_RR) 87391e43daSPeter Zijlstra return 1; 88391e43daSPeter Zijlstra return 0; 89391e43daSPeter Zijlstra } 90391e43daSPeter Zijlstra 91391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 92391e43daSPeter Zijlstra { 93391e43daSPeter Zijlstra return rt_policy(p->policy); 94391e43daSPeter Zijlstra } 95391e43daSPeter Zijlstra 96391e43daSPeter Zijlstra /* 97391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 98391e43daSPeter Zijlstra */ 99391e43daSPeter Zijlstra struct rt_prio_array { 100391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 101391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 102391e43daSPeter Zijlstra }; 103391e43daSPeter Zijlstra 104391e43daSPeter Zijlstra struct rt_bandwidth { 105391e43daSPeter Zijlstra /* nests inside the rq lock: */ 106391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 107391e43daSPeter Zijlstra ktime_t rt_period; 108391e43daSPeter Zijlstra u64 rt_runtime; 109391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 110391e43daSPeter Zijlstra }; 111391e43daSPeter Zijlstra 112391e43daSPeter Zijlstra extern struct mutex sched_domains_mutex; 113391e43daSPeter Zijlstra 114391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 115391e43daSPeter Zijlstra 116391e43daSPeter Zijlstra #include <linux/cgroup.h> 117391e43daSPeter Zijlstra 118391e43daSPeter Zijlstra struct cfs_rq; 119391e43daSPeter Zijlstra struct rt_rq; 120391e43daSPeter Zijlstra 12135cf4e50SMike Galbraith extern struct list_head task_groups; 122391e43daSPeter Zijlstra 123391e43daSPeter Zijlstra struct cfs_bandwidth { 124391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 125391e43daSPeter Zijlstra raw_spinlock_t lock; 126391e43daSPeter Zijlstra ktime_t period; 127391e43daSPeter Zijlstra u64 quota, runtime; 128391e43daSPeter Zijlstra s64 hierarchal_quota; 129391e43daSPeter Zijlstra u64 runtime_expires; 130391e43daSPeter Zijlstra 131391e43daSPeter Zijlstra int idle, timer_active; 132391e43daSPeter Zijlstra struct hrtimer period_timer, slack_timer; 133391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 134391e43daSPeter Zijlstra 135391e43daSPeter Zijlstra /* statistics */ 136391e43daSPeter Zijlstra int nr_periods, nr_throttled; 137391e43daSPeter Zijlstra u64 throttled_time; 138391e43daSPeter Zijlstra #endif 139391e43daSPeter Zijlstra }; 140391e43daSPeter Zijlstra 141391e43daSPeter Zijlstra /* task group related information */ 142391e43daSPeter Zijlstra struct task_group { 143391e43daSPeter Zijlstra struct cgroup_subsys_state css; 144391e43daSPeter Zijlstra 145391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 146391e43daSPeter Zijlstra /* schedulable entities of this group on each cpu */ 147391e43daSPeter Zijlstra struct sched_entity **se; 148391e43daSPeter Zijlstra /* runqueue "owned" by this group on each cpu */ 149391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 150391e43daSPeter Zijlstra unsigned long shares; 151391e43daSPeter Zijlstra 152fa6bddebSAlex Shi #ifdef CONFIG_SMP 153bf5b986eSAlex Shi atomic_long_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 */ 28072a4cf20SAlex Shi unsigned long runnable_load_avg, blocked_load_avg; 2812509940fSAlex Shi atomic64_t decay_counter; 2829ee474f5SPaul Turner u64 last_decay; 2832509940fSAlex Shi atomic_long_t removed_load; 284141965c7SAlex Shi 285c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 286141965c7SAlex Shi /* Required to track per-cpu representation of a task_group */ 287bb17f655SPaul Turner u32 tg_runnable_contrib; 288bf5b986eSAlex Shi unsigned long tg_load_contrib; 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; 29768520796SVladimir Davydov u64 last_h_load_update; 29868520796SVladimir Davydov struct sched_entity *h_load_next; 29968520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 30082958366SPaul Turner #endif /* CONFIG_SMP */ 30182958366SPaul Turner 302391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 303391e43daSPeter Zijlstra struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ 304391e43daSPeter Zijlstra 305391e43daSPeter Zijlstra /* 306391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 307391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 308391e43daSPeter Zijlstra * (like users, containers etc.) 309391e43daSPeter Zijlstra * 310391e43daSPeter Zijlstra * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This 311391e43daSPeter Zijlstra * list is used during load balance. 312391e43daSPeter Zijlstra */ 313391e43daSPeter Zijlstra int on_list; 314391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 315391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 316391e43daSPeter Zijlstra 317391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 318391e43daSPeter Zijlstra int runtime_enabled; 319391e43daSPeter Zijlstra u64 runtime_expires; 320391e43daSPeter Zijlstra s64 runtime_remaining; 321391e43daSPeter Zijlstra 322f1b17280SPaul Turner u64 throttled_clock, throttled_clock_task; 323f1b17280SPaul Turner u64 throttled_clock_task_time; 324391e43daSPeter Zijlstra int throttled, throttle_count; 325391e43daSPeter Zijlstra struct list_head throttled_list; 326391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 327391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 328391e43daSPeter Zijlstra }; 329391e43daSPeter Zijlstra 330391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 331391e43daSPeter Zijlstra { 332391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 333391e43daSPeter Zijlstra } 334391e43daSPeter Zijlstra 335391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 336391e43daSPeter Zijlstra struct rt_rq { 337391e43daSPeter Zijlstra struct rt_prio_array active; 338c82513e5SPeter Zijlstra unsigned int rt_nr_running; 339391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 340391e43daSPeter Zijlstra struct { 341391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 342391e43daSPeter Zijlstra #ifdef CONFIG_SMP 343391e43daSPeter Zijlstra int next; /* next highest */ 344391e43daSPeter Zijlstra #endif 345391e43daSPeter Zijlstra } highest_prio; 346391e43daSPeter Zijlstra #endif 347391e43daSPeter Zijlstra #ifdef CONFIG_SMP 348391e43daSPeter Zijlstra unsigned long rt_nr_migratory; 349391e43daSPeter Zijlstra unsigned long rt_nr_total; 350391e43daSPeter Zijlstra int overloaded; 351391e43daSPeter Zijlstra struct plist_head pushable_tasks; 352391e43daSPeter Zijlstra #endif 353391e43daSPeter Zijlstra int rt_throttled; 354391e43daSPeter Zijlstra u64 rt_time; 355391e43daSPeter Zijlstra u64 rt_runtime; 356391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 357391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 358391e43daSPeter Zijlstra 359391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 360391e43daSPeter Zijlstra unsigned long rt_nr_boosted; 361391e43daSPeter Zijlstra 362391e43daSPeter Zijlstra struct rq *rq; 363391e43daSPeter Zijlstra struct task_group *tg; 364391e43daSPeter Zijlstra #endif 365391e43daSPeter Zijlstra }; 366391e43daSPeter Zijlstra 367391e43daSPeter Zijlstra #ifdef CONFIG_SMP 368391e43daSPeter Zijlstra 369391e43daSPeter Zijlstra /* 370391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 371391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 372391e43daSPeter Zijlstra * fully partitioning the member cpus from any other cpuset. Whenever a new 373391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 374391e43daSPeter Zijlstra * object. 375391e43daSPeter Zijlstra * 376391e43daSPeter Zijlstra */ 377391e43daSPeter Zijlstra struct root_domain { 378391e43daSPeter Zijlstra atomic_t refcount; 379391e43daSPeter Zijlstra atomic_t rto_count; 380391e43daSPeter Zijlstra struct rcu_head rcu; 381391e43daSPeter Zijlstra cpumask_var_t span; 382391e43daSPeter Zijlstra cpumask_var_t online; 383391e43daSPeter Zijlstra 384391e43daSPeter Zijlstra /* 385391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 386391e43daSPeter Zijlstra * one runnable RT task. 387391e43daSPeter Zijlstra */ 388391e43daSPeter Zijlstra cpumask_var_t rto_mask; 389391e43daSPeter Zijlstra struct cpupri cpupri; 390391e43daSPeter Zijlstra }; 391391e43daSPeter Zijlstra 392391e43daSPeter Zijlstra extern struct root_domain def_root_domain; 393391e43daSPeter Zijlstra 394391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 395391e43daSPeter Zijlstra 396391e43daSPeter Zijlstra /* 397391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 398391e43daSPeter Zijlstra * 399391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 400391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 401391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 402391e43daSPeter Zijlstra */ 403391e43daSPeter Zijlstra struct rq { 404391e43daSPeter Zijlstra /* runqueue lock: */ 405391e43daSPeter Zijlstra raw_spinlock_t lock; 406391e43daSPeter Zijlstra 407391e43daSPeter Zijlstra /* 408391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 409391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 410391e43daSPeter Zijlstra */ 411c82513e5SPeter Zijlstra unsigned int nr_running; 412391e43daSPeter Zijlstra #define CPU_LOAD_IDX_MAX 5 413391e43daSPeter Zijlstra unsigned long cpu_load[CPU_LOAD_IDX_MAX]; 414391e43daSPeter Zijlstra unsigned long last_load_update_tick; 4153451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 416391e43daSPeter Zijlstra u64 nohz_stamp; 4171c792db7SSuresh Siddha unsigned long nohz_flags; 418391e43daSPeter Zijlstra #endif 419265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 420265f22a9SFrederic Weisbecker unsigned long last_sched_tick; 421265f22a9SFrederic Weisbecker #endif 422391e43daSPeter Zijlstra int skip_clock_update; 423391e43daSPeter Zijlstra 424391e43daSPeter Zijlstra /* capture load from *all* tasks on this cpu: */ 425391e43daSPeter Zijlstra struct load_weight load; 426391e43daSPeter Zijlstra unsigned long nr_load_updates; 427391e43daSPeter Zijlstra u64 nr_switches; 428391e43daSPeter Zijlstra 429391e43daSPeter Zijlstra struct cfs_rq cfs; 430391e43daSPeter Zijlstra struct rt_rq rt; 431391e43daSPeter Zijlstra 432391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 433391e43daSPeter Zijlstra /* list of leaf cfs_rq on this cpu: */ 434391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 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; 4809bd721c5SJason Low 4819bd721c5SJason Low /* This is used to determine avg_idle's max value */ 4829bd721c5SJason Low u64 max_idle_balance_cost; 483391e43daSPeter Zijlstra #endif 484391e43daSPeter Zijlstra 485391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 486391e43daSPeter Zijlstra u64 prev_irq_time; 487391e43daSPeter Zijlstra #endif 488391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 489391e43daSPeter Zijlstra u64 prev_steal_time; 490391e43daSPeter Zijlstra #endif 491391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 492391e43daSPeter Zijlstra u64 prev_steal_time_rq; 493391e43daSPeter Zijlstra #endif 494391e43daSPeter Zijlstra 495391e43daSPeter Zijlstra /* calc_load related fields */ 496391e43daSPeter Zijlstra unsigned long calc_load_update; 497391e43daSPeter Zijlstra long calc_load_active; 498391e43daSPeter Zijlstra 499391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 500391e43daSPeter Zijlstra #ifdef CONFIG_SMP 501391e43daSPeter Zijlstra int hrtick_csd_pending; 502391e43daSPeter Zijlstra struct call_single_data hrtick_csd; 503391e43daSPeter Zijlstra #endif 504391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 505391e43daSPeter Zijlstra #endif 506391e43daSPeter Zijlstra 507391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 508391e43daSPeter Zijlstra /* latency stats */ 509391e43daSPeter Zijlstra struct sched_info rq_sched_info; 510391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 511391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 512391e43daSPeter Zijlstra 513391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 514391e43daSPeter Zijlstra unsigned int yld_count; 515391e43daSPeter Zijlstra 516391e43daSPeter Zijlstra /* schedule() stats */ 517391e43daSPeter Zijlstra unsigned int sched_count; 518391e43daSPeter Zijlstra unsigned int sched_goidle; 519391e43daSPeter Zijlstra 520391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 521391e43daSPeter Zijlstra unsigned int ttwu_count; 522391e43daSPeter Zijlstra unsigned int ttwu_local; 523391e43daSPeter Zijlstra #endif 524391e43daSPeter Zijlstra 525391e43daSPeter Zijlstra #ifdef CONFIG_SMP 526391e43daSPeter Zijlstra struct llist_head wake_list; 527391e43daSPeter Zijlstra #endif 52818bf2805SBen Segall 52918bf2805SBen Segall struct sched_avg avg; 530391e43daSPeter Zijlstra }; 531391e43daSPeter Zijlstra 532391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 533391e43daSPeter Zijlstra { 534391e43daSPeter Zijlstra #ifdef CONFIG_SMP 535391e43daSPeter Zijlstra return rq->cpu; 536391e43daSPeter Zijlstra #else 537391e43daSPeter Zijlstra return 0; 538391e43daSPeter Zijlstra #endif 539391e43daSPeter Zijlstra } 540391e43daSPeter Zijlstra 541391e43daSPeter Zijlstra DECLARE_PER_CPU(struct rq, runqueues); 542391e43daSPeter Zijlstra 543518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 544518cd623SPeter Zijlstra #define this_rq() (&__get_cpu_var(runqueues)) 545518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 546518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 547518cd623SPeter Zijlstra #define raw_rq() (&__raw_get_cpu_var(runqueues)) 548518cd623SPeter Zijlstra 54978becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 55078becc27SFrederic Weisbecker { 55178becc27SFrederic Weisbecker return rq->clock; 55278becc27SFrederic Weisbecker } 55378becc27SFrederic Weisbecker 55478becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 55578becc27SFrederic Weisbecker { 55678becc27SFrederic Weisbecker return rq->clock_task; 55778becc27SFrederic Weisbecker } 55878becc27SFrederic Weisbecker 559f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 560f809ca9aSMel Gorman static inline void task_numa_free(struct task_struct *p) 561f809ca9aSMel Gorman { 562f809ca9aSMel Gorman kfree(p->numa_faults); 563f809ca9aSMel Gorman } 564f809ca9aSMel Gorman #else /* CONFIG_NUMA_BALANCING */ 565f809ca9aSMel Gorman static inline void task_numa_free(struct task_struct *p) 566f809ca9aSMel Gorman { 567f809ca9aSMel Gorman } 568f809ca9aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 569f809ca9aSMel Gorman 570518cd623SPeter Zijlstra #ifdef CONFIG_SMP 571518cd623SPeter Zijlstra 572391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 573391e43daSPeter Zijlstra rcu_dereference_check((p), \ 574391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 575391e43daSPeter Zijlstra 576391e43daSPeter Zijlstra /* 577391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 578391e43daSPeter Zijlstra * See detach_destroy_domains: synchronize_sched for details. 579391e43daSPeter Zijlstra * 580391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 581391e43daSPeter Zijlstra * preempt-disabled sections. 582391e43daSPeter Zijlstra */ 583391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 584518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 585518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 586391e43daSPeter Zijlstra 58777e81365SSuresh Siddha #define for_each_lower_domain(sd) for (; sd; sd = sd->child) 58877e81365SSuresh Siddha 589518cd623SPeter Zijlstra /** 590518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 591518cd623SPeter Zijlstra * @cpu: The cpu whose highest level of sched domain is to 592518cd623SPeter Zijlstra * be returned. 593518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 594518cd623SPeter Zijlstra * for the given cpu. 595518cd623SPeter Zijlstra * 596518cd623SPeter Zijlstra * Returns the highest sched_domain of a cpu which contains the given flag. 597518cd623SPeter Zijlstra */ 598518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 599518cd623SPeter Zijlstra { 600518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 601518cd623SPeter Zijlstra 602518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 603518cd623SPeter Zijlstra if (!(sd->flags & flag)) 604518cd623SPeter Zijlstra break; 605518cd623SPeter Zijlstra hsd = sd; 606518cd623SPeter Zijlstra } 607518cd623SPeter Zijlstra 608518cd623SPeter Zijlstra return hsd; 609518cd623SPeter Zijlstra } 610518cd623SPeter Zijlstra 611518cd623SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain *, sd_llc); 6127d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 613518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 614518cd623SPeter Zijlstra 6155e6521eaSLi Zefan struct sched_group_power { 6165e6521eaSLi Zefan atomic_t ref; 6175e6521eaSLi Zefan /* 6185e6521eaSLi Zefan * CPU power of this group, SCHED_LOAD_SCALE being max power for a 6195e6521eaSLi Zefan * single CPU. 6205e6521eaSLi Zefan */ 6215e6521eaSLi Zefan unsigned int power, power_orig; 6225e6521eaSLi Zefan unsigned long next_update; 6236263322cSPeter Zijlstra int imbalance; /* XXX unrelated to power but shared group state */ 6245e6521eaSLi Zefan /* 6255e6521eaSLi Zefan * Number of busy cpus in this group. 6265e6521eaSLi Zefan */ 6275e6521eaSLi Zefan atomic_t nr_busy_cpus; 6285e6521eaSLi Zefan 6295e6521eaSLi Zefan unsigned long cpumask[0]; /* iteration mask */ 6305e6521eaSLi Zefan }; 6315e6521eaSLi Zefan 6325e6521eaSLi Zefan struct sched_group { 6335e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 6345e6521eaSLi Zefan atomic_t ref; 6355e6521eaSLi Zefan 6365e6521eaSLi Zefan unsigned int group_weight; 6375e6521eaSLi Zefan struct sched_group_power *sgp; 6385e6521eaSLi Zefan 6395e6521eaSLi Zefan /* 6405e6521eaSLi Zefan * The CPUs this group covers. 6415e6521eaSLi Zefan * 6425e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 6435e6521eaSLi Zefan * by attaching extra space to the end of the structure, 6445e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 6455e6521eaSLi Zefan */ 6465e6521eaSLi Zefan unsigned long cpumask[0]; 6475e6521eaSLi Zefan }; 6485e6521eaSLi Zefan 6495e6521eaSLi Zefan static inline struct cpumask *sched_group_cpus(struct sched_group *sg) 6505e6521eaSLi Zefan { 6515e6521eaSLi Zefan return to_cpumask(sg->cpumask); 6525e6521eaSLi Zefan } 6535e6521eaSLi Zefan 6545e6521eaSLi Zefan /* 6555e6521eaSLi Zefan * cpumask masking which cpus in the group are allowed to iterate up the domain 6565e6521eaSLi Zefan * tree. 6575e6521eaSLi Zefan */ 6585e6521eaSLi Zefan static inline struct cpumask *sched_group_mask(struct sched_group *sg) 6595e6521eaSLi Zefan { 6605e6521eaSLi Zefan return to_cpumask(sg->sgp->cpumask); 6615e6521eaSLi Zefan } 6625e6521eaSLi Zefan 6635e6521eaSLi Zefan /** 6645e6521eaSLi Zefan * group_first_cpu - Returns the first cpu in the cpumask of a sched_group. 6655e6521eaSLi Zefan * @group: The group whose first cpu is to be returned. 6665e6521eaSLi Zefan */ 6675e6521eaSLi Zefan static inline unsigned int group_first_cpu(struct sched_group *group) 6685e6521eaSLi Zefan { 6695e6521eaSLi Zefan return cpumask_first(sched_group_cpus(group)); 6705e6521eaSLi Zefan } 6715e6521eaSLi Zefan 672c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 673c1174876SPeter Zijlstra 674518cd623SPeter Zijlstra #endif /* CONFIG_SMP */ 675391e43daSPeter Zijlstra 676391e43daSPeter Zijlstra #include "stats.h" 677391e43daSPeter Zijlstra #include "auto_group.h" 678391e43daSPeter Zijlstra 679391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 680391e43daSPeter Zijlstra 681391e43daSPeter Zijlstra /* 682391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 683391e43daSPeter Zijlstra * 6848af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 6858af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 6868af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 6878323f26cSPeter Zijlstra * 6888323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 6898323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 6908323f26cSPeter Zijlstra * 6918323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 6928323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 693391e43daSPeter Zijlstra */ 694391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 695391e43daSPeter Zijlstra { 6968323f26cSPeter Zijlstra return p->sched_task_group; 697391e43daSPeter Zijlstra } 698391e43daSPeter Zijlstra 699391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 700391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 701391e43daSPeter Zijlstra { 702391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 703391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 704391e43daSPeter Zijlstra #endif 705391e43daSPeter Zijlstra 706391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 707391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 708391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 709391e43daSPeter Zijlstra #endif 710391e43daSPeter Zijlstra 711391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 712391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 713391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 714391e43daSPeter Zijlstra #endif 715391e43daSPeter Zijlstra } 716391e43daSPeter Zijlstra 717391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 718391e43daSPeter Zijlstra 719391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 720391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 721391e43daSPeter Zijlstra { 722391e43daSPeter Zijlstra return NULL; 723391e43daSPeter Zijlstra } 724391e43daSPeter Zijlstra 725391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 726391e43daSPeter Zijlstra 727391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 728391e43daSPeter Zijlstra { 729391e43daSPeter Zijlstra set_task_rq(p, cpu); 730391e43daSPeter Zijlstra #ifdef CONFIG_SMP 731391e43daSPeter Zijlstra /* 732391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 733391e43daSPeter Zijlstra * successfuly executed on another CPU. We must ensure that updates of 734391e43daSPeter Zijlstra * per-task data have been completed by this moment. 735391e43daSPeter Zijlstra */ 736391e43daSPeter Zijlstra smp_wmb(); 737391e43daSPeter Zijlstra task_thread_info(p)->cpu = cpu; 738391e43daSPeter Zijlstra #endif 739391e43daSPeter Zijlstra } 740391e43daSPeter Zijlstra 741391e43daSPeter Zijlstra /* 742391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 743391e43daSPeter Zijlstra */ 744391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 745c5905afbSIngo Molnar # include <linux/static_key.h> 746391e43daSPeter Zijlstra # define const_debug __read_mostly 747391e43daSPeter Zijlstra #else 748391e43daSPeter Zijlstra # define const_debug const 749391e43daSPeter Zijlstra #endif 750391e43daSPeter Zijlstra 751391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_features; 752391e43daSPeter Zijlstra 753391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 754391e43daSPeter Zijlstra __SCHED_FEAT_##name , 755391e43daSPeter Zijlstra 756391e43daSPeter Zijlstra enum { 757391e43daSPeter Zijlstra #include "features.h" 758f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 759391e43daSPeter Zijlstra }; 760391e43daSPeter Zijlstra 761391e43daSPeter Zijlstra #undef SCHED_FEAT 762391e43daSPeter Zijlstra 763f8b6d1ccSPeter Zijlstra #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) 764c5905afbSIngo Molnar static __always_inline bool static_branch__true(struct static_key *key) 765f8b6d1ccSPeter Zijlstra { 766c5905afbSIngo Molnar return static_key_true(key); /* Not out of line branch. */ 767f8b6d1ccSPeter Zijlstra } 768f8b6d1ccSPeter Zijlstra 769c5905afbSIngo Molnar static __always_inline bool static_branch__false(struct static_key *key) 770f8b6d1ccSPeter Zijlstra { 771c5905afbSIngo Molnar return static_key_false(key); /* Out of line branch. */ 772f8b6d1ccSPeter Zijlstra } 773f8b6d1ccSPeter Zijlstra 774f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 775c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 776f8b6d1ccSPeter Zijlstra { \ 777f8b6d1ccSPeter Zijlstra return static_branch__##enabled(key); \ 778f8b6d1ccSPeter Zijlstra } 779f8b6d1ccSPeter Zijlstra 780f8b6d1ccSPeter Zijlstra #include "features.h" 781f8b6d1ccSPeter Zijlstra 782f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 783f8b6d1ccSPeter Zijlstra 784c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 785f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 786f8b6d1ccSPeter Zijlstra #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ 787391e43daSPeter Zijlstra #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 788f8b6d1ccSPeter Zijlstra #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ 789391e43daSPeter Zijlstra 790cbee9f88SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 791cbee9f88SPeter Zijlstra #define sched_feat_numa(x) sched_feat(x) 7923105b86aSMel Gorman #ifdef CONFIG_SCHED_DEBUG 7933105b86aSMel Gorman #define numabalancing_enabled sched_feat_numa(NUMA) 7943105b86aSMel Gorman #else 7953105b86aSMel Gorman extern bool numabalancing_enabled; 7963105b86aSMel Gorman #endif /* CONFIG_SCHED_DEBUG */ 797cbee9f88SPeter Zijlstra #else 798cbee9f88SPeter Zijlstra #define sched_feat_numa(x) (0) 7993105b86aSMel Gorman #define numabalancing_enabled (0) 8003105b86aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 801cbee9f88SPeter Zijlstra 802391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 803391e43daSPeter Zijlstra { 804391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 805391e43daSPeter Zijlstra } 806391e43daSPeter Zijlstra 807391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 808391e43daSPeter Zijlstra { 809391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 810391e43daSPeter Zijlstra return RUNTIME_INF; 811391e43daSPeter Zijlstra 812391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 813391e43daSPeter Zijlstra } 814391e43daSPeter Zijlstra 815391e43daSPeter Zijlstra 816391e43daSPeter Zijlstra 817391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 818391e43daSPeter Zijlstra { 819391e43daSPeter Zijlstra return rq->curr == p; 820391e43daSPeter Zijlstra } 821391e43daSPeter Zijlstra 822391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 823391e43daSPeter Zijlstra { 824391e43daSPeter Zijlstra #ifdef CONFIG_SMP 825391e43daSPeter Zijlstra return p->on_cpu; 826391e43daSPeter Zijlstra #else 827391e43daSPeter Zijlstra return task_current(rq, p); 828391e43daSPeter Zijlstra #endif 829391e43daSPeter Zijlstra } 830391e43daSPeter Zijlstra 831391e43daSPeter Zijlstra 832391e43daSPeter Zijlstra #ifndef prepare_arch_switch 833391e43daSPeter Zijlstra # define prepare_arch_switch(next) do { } while (0) 834391e43daSPeter Zijlstra #endif 835391e43daSPeter Zijlstra #ifndef finish_arch_switch 836391e43daSPeter Zijlstra # define finish_arch_switch(prev) do { } while (0) 837391e43daSPeter Zijlstra #endif 83801f23e16SCatalin Marinas #ifndef finish_arch_post_lock_switch 83901f23e16SCatalin Marinas # define finish_arch_post_lock_switch() do { } while (0) 84001f23e16SCatalin Marinas #endif 841391e43daSPeter Zijlstra 842391e43daSPeter Zijlstra #ifndef __ARCH_WANT_UNLOCKED_CTXSW 843391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 844391e43daSPeter Zijlstra { 845391e43daSPeter Zijlstra #ifdef CONFIG_SMP 846391e43daSPeter Zijlstra /* 847391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 848391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 849391e43daSPeter Zijlstra * here. 850391e43daSPeter Zijlstra */ 851391e43daSPeter Zijlstra next->on_cpu = 1; 852391e43daSPeter Zijlstra #endif 853391e43daSPeter Zijlstra } 854391e43daSPeter Zijlstra 855391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 856391e43daSPeter Zijlstra { 857391e43daSPeter Zijlstra #ifdef CONFIG_SMP 858391e43daSPeter Zijlstra /* 859391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 860391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 861391e43daSPeter Zijlstra * finished. 862391e43daSPeter Zijlstra */ 863391e43daSPeter Zijlstra smp_wmb(); 864391e43daSPeter Zijlstra prev->on_cpu = 0; 865391e43daSPeter Zijlstra #endif 866391e43daSPeter Zijlstra #ifdef CONFIG_DEBUG_SPINLOCK 867391e43daSPeter Zijlstra /* this is a valid case when another task releases the spinlock */ 868391e43daSPeter Zijlstra rq->lock.owner = current; 869391e43daSPeter Zijlstra #endif 870391e43daSPeter Zijlstra /* 871391e43daSPeter Zijlstra * If we are tracking spinlock dependencies then we have to 872391e43daSPeter Zijlstra * fix up the runqueue lock - which gets 'carried over' from 873391e43daSPeter Zijlstra * prev into current: 874391e43daSPeter Zijlstra */ 875391e43daSPeter Zijlstra spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); 876391e43daSPeter Zijlstra 877391e43daSPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 878391e43daSPeter Zijlstra } 879391e43daSPeter Zijlstra 880391e43daSPeter Zijlstra #else /* __ARCH_WANT_UNLOCKED_CTXSW */ 881391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 882391e43daSPeter Zijlstra { 883391e43daSPeter Zijlstra #ifdef CONFIG_SMP 884391e43daSPeter Zijlstra /* 885391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 886391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 887391e43daSPeter Zijlstra * here. 888391e43daSPeter Zijlstra */ 889391e43daSPeter Zijlstra next->on_cpu = 1; 890391e43daSPeter Zijlstra #endif 891391e43daSPeter Zijlstra raw_spin_unlock(&rq->lock); 892391e43daSPeter Zijlstra } 893391e43daSPeter Zijlstra 894391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 895391e43daSPeter Zijlstra { 896391e43daSPeter Zijlstra #ifdef CONFIG_SMP 897391e43daSPeter Zijlstra /* 898391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 899391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 900391e43daSPeter Zijlstra * finished. 901391e43daSPeter Zijlstra */ 902391e43daSPeter Zijlstra smp_wmb(); 903391e43daSPeter Zijlstra prev->on_cpu = 0; 904391e43daSPeter Zijlstra #endif 905391e43daSPeter Zijlstra local_irq_enable(); 906391e43daSPeter Zijlstra } 907391e43daSPeter Zijlstra #endif /* __ARCH_WANT_UNLOCKED_CTXSW */ 908391e43daSPeter Zijlstra 909b13095f0SLi Zefan /* 910b13095f0SLi Zefan * wake flags 911b13095f0SLi Zefan */ 912b13095f0SLi Zefan #define WF_SYNC 0x01 /* waker goes to sleep after wakeup */ 913b13095f0SLi Zefan #define WF_FORK 0x02 /* child wakeup after fork */ 914b13095f0SLi Zefan #define WF_MIGRATED 0x4 /* internal use, task got migrated */ 915b13095f0SLi Zefan 916391e43daSPeter Zijlstra /* 917391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 918391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 919391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 920391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 921391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 922391e43daSPeter Zijlstra * slice expiry etc. 923391e43daSPeter Zijlstra */ 924391e43daSPeter Zijlstra 925391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 926391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 927391e43daSPeter Zijlstra 928391e43daSPeter Zijlstra /* 929391e43daSPeter Zijlstra * Nice levels are multiplicative, with a gentle 10% change for every 930391e43daSPeter Zijlstra * nice level changed. I.e. when a CPU-bound task goes from nice 0 to 931391e43daSPeter Zijlstra * nice 1, it will get ~10% less CPU time than another CPU-bound task 932391e43daSPeter Zijlstra * that remained on nice 0. 933391e43daSPeter Zijlstra * 934391e43daSPeter Zijlstra * The "10% effect" is relative and cumulative: from _any_ nice level, 935391e43daSPeter Zijlstra * if you go up 1 level, it's -10% CPU usage, if you go down 1 level 936391e43daSPeter Zijlstra * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. 937391e43daSPeter Zijlstra * If a task goes up by ~10% and another task goes down by ~10% then 938391e43daSPeter Zijlstra * the relative distance between them is ~25%.) 939391e43daSPeter Zijlstra */ 940391e43daSPeter Zijlstra static const int prio_to_weight[40] = { 941391e43daSPeter Zijlstra /* -20 */ 88761, 71755, 56483, 46273, 36291, 942391e43daSPeter Zijlstra /* -15 */ 29154, 23254, 18705, 14949, 11916, 943391e43daSPeter Zijlstra /* -10 */ 9548, 7620, 6100, 4904, 3906, 944391e43daSPeter Zijlstra /* -5 */ 3121, 2501, 1991, 1586, 1277, 945391e43daSPeter Zijlstra /* 0 */ 1024, 820, 655, 526, 423, 946391e43daSPeter Zijlstra /* 5 */ 335, 272, 215, 172, 137, 947391e43daSPeter Zijlstra /* 10 */ 110, 87, 70, 56, 45, 948391e43daSPeter Zijlstra /* 15 */ 36, 29, 23, 18, 15, 949391e43daSPeter Zijlstra }; 950391e43daSPeter Zijlstra 951391e43daSPeter Zijlstra /* 952391e43daSPeter Zijlstra * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated. 953391e43daSPeter Zijlstra * 954391e43daSPeter Zijlstra * In cases where the weight does not change often, we can use the 955391e43daSPeter Zijlstra * precalculated inverse to speed up arithmetics by turning divisions 956391e43daSPeter Zijlstra * into multiplications: 957391e43daSPeter Zijlstra */ 958391e43daSPeter Zijlstra static const u32 prio_to_wmult[40] = { 959391e43daSPeter Zijlstra /* -20 */ 48388, 59856, 76040, 92818, 118348, 960391e43daSPeter Zijlstra /* -15 */ 147320, 184698, 229616, 287308, 360437, 961391e43daSPeter Zijlstra /* -10 */ 449829, 563644, 704093, 875809, 1099582, 962391e43daSPeter Zijlstra /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, 963391e43daSPeter Zijlstra /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, 964391e43daSPeter Zijlstra /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, 965391e43daSPeter Zijlstra /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, 966391e43daSPeter Zijlstra /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, 967391e43daSPeter Zijlstra }; 968391e43daSPeter Zijlstra 969c82ba9faSLi Zefan #define ENQUEUE_WAKEUP 1 970c82ba9faSLi Zefan #define ENQUEUE_HEAD 2 971c82ba9faSLi Zefan #ifdef CONFIG_SMP 972c82ba9faSLi Zefan #define ENQUEUE_WAKING 4 /* sched_class::task_waking was called */ 973c82ba9faSLi Zefan #else 974c82ba9faSLi Zefan #define ENQUEUE_WAKING 0 975c82ba9faSLi Zefan #endif 976c82ba9faSLi Zefan 977c82ba9faSLi Zefan #define DEQUEUE_SLEEP 1 978c82ba9faSLi Zefan 979c82ba9faSLi Zefan struct sched_class { 980c82ba9faSLi Zefan const struct sched_class *next; 981c82ba9faSLi Zefan 982c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 983c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 984c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 985c82ba9faSLi Zefan bool (*yield_to_task) (struct rq *rq, struct task_struct *p, bool preempt); 986c82ba9faSLi Zefan 987c82ba9faSLi Zefan void (*check_preempt_curr) (struct rq *rq, struct task_struct *p, int flags); 988c82ba9faSLi Zefan 989c82ba9faSLi Zefan struct task_struct * (*pick_next_task) (struct rq *rq); 990c82ba9faSLi Zefan void (*put_prev_task) (struct rq *rq, struct task_struct *p); 991c82ba9faSLi Zefan 992c82ba9faSLi Zefan #ifdef CONFIG_SMP 993c82ba9faSLi Zefan int (*select_task_rq)(struct task_struct *p, int sd_flag, int flags); 994c82ba9faSLi Zefan void (*migrate_task_rq)(struct task_struct *p, int next_cpu); 995c82ba9faSLi Zefan 996c82ba9faSLi Zefan void (*pre_schedule) (struct rq *this_rq, struct task_struct *task); 997c82ba9faSLi Zefan void (*post_schedule) (struct rq *this_rq); 998c82ba9faSLi Zefan void (*task_waking) (struct task_struct *task); 999c82ba9faSLi Zefan void (*task_woken) (struct rq *this_rq, struct task_struct *task); 1000c82ba9faSLi Zefan 1001c82ba9faSLi Zefan void (*set_cpus_allowed)(struct task_struct *p, 1002c82ba9faSLi Zefan const struct cpumask *newmask); 1003c82ba9faSLi Zefan 1004c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 1005c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 1006c82ba9faSLi Zefan #endif 1007c82ba9faSLi Zefan 1008c82ba9faSLi Zefan void (*set_curr_task) (struct rq *rq); 1009c82ba9faSLi Zefan void (*task_tick) (struct rq *rq, struct task_struct *p, int queued); 1010c82ba9faSLi Zefan void (*task_fork) (struct task_struct *p); 1011c82ba9faSLi Zefan 1012c82ba9faSLi Zefan void (*switched_from) (struct rq *this_rq, struct task_struct *task); 1013c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 1014c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 1015c82ba9faSLi Zefan int oldprio); 1016c82ba9faSLi Zefan 1017c82ba9faSLi Zefan unsigned int (*get_rr_interval) (struct rq *rq, 1018c82ba9faSLi Zefan struct task_struct *task); 1019c82ba9faSLi Zefan 1020c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 1021c82ba9faSLi Zefan void (*task_move_group) (struct task_struct *p, int on_rq); 1022c82ba9faSLi Zefan #endif 1023c82ba9faSLi Zefan }; 1024391e43daSPeter Zijlstra 1025391e43daSPeter Zijlstra #define sched_class_highest (&stop_sched_class) 1026391e43daSPeter Zijlstra #define for_each_class(class) \ 1027391e43daSPeter Zijlstra for (class = sched_class_highest; class; class = class->next) 1028391e43daSPeter Zijlstra 1029391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 1030391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 1031391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 1032391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 1033391e43daSPeter Zijlstra 1034391e43daSPeter Zijlstra 1035391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1036391e43daSPeter Zijlstra 1037b719203bSLi Zefan extern void update_group_power(struct sched_domain *sd, int cpu); 1038b719203bSLi Zefan 1039391e43daSPeter Zijlstra extern void trigger_load_balance(struct rq *rq, int cpu); 1040391e43daSPeter Zijlstra extern void idle_balance(int this_cpu, struct rq *this_rq); 1041391e43daSPeter Zijlstra 1042642dbc39SVincent Guittot extern void idle_enter_fair(struct rq *this_rq); 1043642dbc39SVincent Guittot extern void idle_exit_fair(struct rq *this_rq); 1044642dbc39SVincent Guittot 1045391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1046391e43daSPeter Zijlstra 1047391e43daSPeter Zijlstra static inline void idle_balance(int cpu, struct rq *rq) 1048391e43daSPeter Zijlstra { 1049391e43daSPeter Zijlstra } 1050391e43daSPeter Zijlstra 1051391e43daSPeter Zijlstra #endif 1052391e43daSPeter Zijlstra 1053391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 1054391e43daSPeter Zijlstra extern void sched_init_granularity(void); 1055391e43daSPeter Zijlstra extern void update_max_interval(void); 1056391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 1057391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 1058391e43daSPeter Zijlstra 1059391e43daSPeter Zijlstra extern void resched_task(struct task_struct *p); 1060391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 1061391e43daSPeter Zijlstra 1062391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 1063391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 1064391e43daSPeter Zijlstra 1065556061b0SPeter Zijlstra extern void update_idle_cpu_load(struct rq *this_rq); 1066391e43daSPeter Zijlstra 1067a75cdaa9SAlex Shi extern void init_task_runnable_average(struct task_struct *p); 1068a75cdaa9SAlex Shi 106973fbec60SFrederic Weisbecker #ifdef CONFIG_PARAVIRT 107073fbec60SFrederic Weisbecker static inline u64 steal_ticks(u64 steal) 107173fbec60SFrederic Weisbecker { 107273fbec60SFrederic Weisbecker if (unlikely(steal > NSEC_PER_SEC)) 107373fbec60SFrederic Weisbecker return div_u64(steal, TICK_NSEC); 107473fbec60SFrederic Weisbecker 107573fbec60SFrederic Weisbecker return __iter_div_u64_rem(steal, TICK_NSEC, &steal); 107673fbec60SFrederic Weisbecker } 107773fbec60SFrederic Weisbecker #endif 107873fbec60SFrederic Weisbecker 1079391e43daSPeter Zijlstra static inline void inc_nr_running(struct rq *rq) 1080391e43daSPeter Zijlstra { 1081391e43daSPeter Zijlstra rq->nr_running++; 10829f3660c2SFrederic Weisbecker 10839f3660c2SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 10849f3660c2SFrederic Weisbecker if (rq->nr_running == 2) { 10859f3660c2SFrederic Weisbecker if (tick_nohz_full_cpu(rq->cpu)) { 10869f3660c2SFrederic Weisbecker /* Order rq->nr_running write against the IPI */ 10879f3660c2SFrederic Weisbecker smp_wmb(); 10889f3660c2SFrederic Weisbecker smp_send_reschedule(rq->cpu); 10899f3660c2SFrederic Weisbecker } 10909f3660c2SFrederic Weisbecker } 10919f3660c2SFrederic Weisbecker #endif 1092391e43daSPeter Zijlstra } 1093391e43daSPeter Zijlstra 1094391e43daSPeter Zijlstra static inline void dec_nr_running(struct rq *rq) 1095391e43daSPeter Zijlstra { 1096391e43daSPeter Zijlstra rq->nr_running--; 1097391e43daSPeter Zijlstra } 1098391e43daSPeter Zijlstra 1099265f22a9SFrederic Weisbecker static inline void rq_last_tick_reset(struct rq *rq) 1100265f22a9SFrederic Weisbecker { 1101265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 1102265f22a9SFrederic Weisbecker rq->last_sched_tick = jiffies; 1103265f22a9SFrederic Weisbecker #endif 1104265f22a9SFrederic Weisbecker } 1105265f22a9SFrederic Weisbecker 1106391e43daSPeter Zijlstra extern void update_rq_clock(struct rq *rq); 1107391e43daSPeter Zijlstra 1108391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 1109391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 1110391e43daSPeter Zijlstra 1111391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 1112391e43daSPeter Zijlstra 1113391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_time_avg; 1114391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 1115391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 1116391e43daSPeter Zijlstra 1117391e43daSPeter Zijlstra static inline u64 sched_avg_period(void) 1118391e43daSPeter Zijlstra { 1119391e43daSPeter Zijlstra return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; 1120391e43daSPeter Zijlstra } 1121391e43daSPeter Zijlstra 1122391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1123391e43daSPeter Zijlstra 1124391e43daSPeter Zijlstra /* 1125391e43daSPeter Zijlstra * Use hrtick when: 1126391e43daSPeter Zijlstra * - enabled by features 1127391e43daSPeter Zijlstra * - hrtimer is actually high res 1128391e43daSPeter Zijlstra */ 1129391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 1130391e43daSPeter Zijlstra { 1131391e43daSPeter Zijlstra if (!sched_feat(HRTICK)) 1132391e43daSPeter Zijlstra return 0; 1133391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 1134391e43daSPeter Zijlstra return 0; 1135391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 1136391e43daSPeter Zijlstra } 1137391e43daSPeter Zijlstra 1138391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 1139391e43daSPeter Zijlstra 1140b39e66eaSMike Galbraith #else 1141b39e66eaSMike Galbraith 1142b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 1143b39e66eaSMike Galbraith { 1144b39e66eaSMike Galbraith return 0; 1145b39e66eaSMike Galbraith } 1146b39e66eaSMike Galbraith 1147391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 1148391e43daSPeter Zijlstra 1149391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1150391e43daSPeter Zijlstra extern void sched_avg_update(struct rq *rq); 1151391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) 1152391e43daSPeter Zijlstra { 1153391e43daSPeter Zijlstra rq->rt_avg += rt_delta; 1154391e43daSPeter Zijlstra sched_avg_update(rq); 1155391e43daSPeter Zijlstra } 1156391e43daSPeter Zijlstra #else 1157391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) { } 1158391e43daSPeter Zijlstra static inline void sched_avg_update(struct rq *rq) { } 1159391e43daSPeter Zijlstra #endif 1160391e43daSPeter Zijlstra 1161391e43daSPeter Zijlstra extern void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period); 1162391e43daSPeter Zijlstra 1163391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1164391e43daSPeter Zijlstra #ifdef CONFIG_PREEMPT 1165391e43daSPeter Zijlstra 1166391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); 1167391e43daSPeter Zijlstra 1168391e43daSPeter Zijlstra /* 1169391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 1170391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 1171391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 1172391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 1173391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 1174391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 1175391e43daSPeter Zijlstra */ 1176391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1177391e43daSPeter Zijlstra __releases(this_rq->lock) 1178391e43daSPeter Zijlstra __acquires(busiest->lock) 1179391e43daSPeter Zijlstra __acquires(this_rq->lock) 1180391e43daSPeter Zijlstra { 1181391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1182391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 1183391e43daSPeter Zijlstra 1184391e43daSPeter Zijlstra return 1; 1185391e43daSPeter Zijlstra } 1186391e43daSPeter Zijlstra 1187391e43daSPeter Zijlstra #else 1188391e43daSPeter Zijlstra /* 1189391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 1190391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 1191391e43daSPeter Zijlstra * already in proper order on entry. This favors lower cpu-ids and will 1192391e43daSPeter Zijlstra * grant the double lock to lower cpus over higher ids under contention, 1193391e43daSPeter Zijlstra * regardless of entry order into the function. 1194391e43daSPeter Zijlstra */ 1195391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1196391e43daSPeter Zijlstra __releases(this_rq->lock) 1197391e43daSPeter Zijlstra __acquires(busiest->lock) 1198391e43daSPeter Zijlstra __acquires(this_rq->lock) 1199391e43daSPeter Zijlstra { 1200391e43daSPeter Zijlstra int ret = 0; 1201391e43daSPeter Zijlstra 1202391e43daSPeter Zijlstra if (unlikely(!raw_spin_trylock(&busiest->lock))) { 1203391e43daSPeter Zijlstra if (busiest < this_rq) { 1204391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1205391e43daSPeter Zijlstra raw_spin_lock(&busiest->lock); 1206391e43daSPeter Zijlstra raw_spin_lock_nested(&this_rq->lock, 1207391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1208391e43daSPeter Zijlstra ret = 1; 1209391e43daSPeter Zijlstra } else 1210391e43daSPeter Zijlstra raw_spin_lock_nested(&busiest->lock, 1211391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1212391e43daSPeter Zijlstra } 1213391e43daSPeter Zijlstra return ret; 1214391e43daSPeter Zijlstra } 1215391e43daSPeter Zijlstra 1216391e43daSPeter Zijlstra #endif /* CONFIG_PREEMPT */ 1217391e43daSPeter Zijlstra 1218391e43daSPeter Zijlstra /* 1219391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 1220391e43daSPeter Zijlstra */ 1221391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 1222391e43daSPeter Zijlstra { 1223391e43daSPeter Zijlstra if (unlikely(!irqs_disabled())) { 1224391e43daSPeter Zijlstra /* printk() doesn't work good under rq->lock */ 1225391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1226391e43daSPeter Zijlstra BUG_ON(1); 1227391e43daSPeter Zijlstra } 1228391e43daSPeter Zijlstra 1229391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 1230391e43daSPeter Zijlstra } 1231391e43daSPeter Zijlstra 1232391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 1233391e43daSPeter Zijlstra __releases(busiest->lock) 1234391e43daSPeter Zijlstra { 1235391e43daSPeter Zijlstra raw_spin_unlock(&busiest->lock); 1236391e43daSPeter Zijlstra lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); 1237391e43daSPeter Zijlstra } 1238391e43daSPeter Zijlstra 1239391e43daSPeter Zijlstra /* 1240391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1241391e43daSPeter Zijlstra * 1242391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1243391e43daSPeter Zijlstra * you need to do so manually before calling. 1244391e43daSPeter Zijlstra */ 1245391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1246391e43daSPeter Zijlstra __acquires(rq1->lock) 1247391e43daSPeter Zijlstra __acquires(rq2->lock) 1248391e43daSPeter Zijlstra { 1249391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1250391e43daSPeter Zijlstra if (rq1 == rq2) { 1251391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1252391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1253391e43daSPeter Zijlstra } else { 1254391e43daSPeter Zijlstra if (rq1 < rq2) { 1255391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1256391e43daSPeter Zijlstra raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); 1257391e43daSPeter Zijlstra } else { 1258391e43daSPeter Zijlstra raw_spin_lock(&rq2->lock); 1259391e43daSPeter Zijlstra raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); 1260391e43daSPeter Zijlstra } 1261391e43daSPeter Zijlstra } 1262391e43daSPeter Zijlstra } 1263391e43daSPeter Zijlstra 1264391e43daSPeter Zijlstra /* 1265391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1266391e43daSPeter Zijlstra * 1267391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1268391e43daSPeter Zijlstra * you need to do so manually after calling. 1269391e43daSPeter Zijlstra */ 1270391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1271391e43daSPeter Zijlstra __releases(rq1->lock) 1272391e43daSPeter Zijlstra __releases(rq2->lock) 1273391e43daSPeter Zijlstra { 1274391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1275391e43daSPeter Zijlstra if (rq1 != rq2) 1276391e43daSPeter Zijlstra raw_spin_unlock(&rq2->lock); 1277391e43daSPeter Zijlstra else 1278391e43daSPeter Zijlstra __release(rq2->lock); 1279391e43daSPeter Zijlstra } 1280391e43daSPeter Zijlstra 1281391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1282391e43daSPeter Zijlstra 1283391e43daSPeter Zijlstra /* 1284391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1285391e43daSPeter Zijlstra * 1286391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1287391e43daSPeter Zijlstra * you need to do so manually before calling. 1288391e43daSPeter Zijlstra */ 1289391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1290391e43daSPeter Zijlstra __acquires(rq1->lock) 1291391e43daSPeter Zijlstra __acquires(rq2->lock) 1292391e43daSPeter Zijlstra { 1293391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1294391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1295391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1296391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1297391e43daSPeter Zijlstra } 1298391e43daSPeter Zijlstra 1299391e43daSPeter Zijlstra /* 1300391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1301391e43daSPeter Zijlstra * 1302391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1303391e43daSPeter Zijlstra * you need to do so manually after calling. 1304391e43daSPeter Zijlstra */ 1305391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1306391e43daSPeter Zijlstra __releases(rq1->lock) 1307391e43daSPeter Zijlstra __releases(rq2->lock) 1308391e43daSPeter Zijlstra { 1309391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1310391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1311391e43daSPeter Zijlstra __release(rq2->lock); 1312391e43daSPeter Zijlstra } 1313391e43daSPeter Zijlstra 1314391e43daSPeter Zijlstra #endif 1315391e43daSPeter Zijlstra 1316391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 1317391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 1318391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 1319391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 1320391e43daSPeter Zijlstra 1321391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 1322391e43daSPeter Zijlstra extern void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq); 1323391e43daSPeter Zijlstra 1324391e43daSPeter Zijlstra extern void account_cfs_bandwidth_used(int enabled, int was_enabled); 13251c792db7SSuresh Siddha 13263451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 13271c792db7SSuresh Siddha enum rq_nohz_flag_bits { 13281c792db7SSuresh Siddha NOHZ_TICK_STOPPED, 13291c792db7SSuresh Siddha NOHZ_BALANCE_KICK, 13301c792db7SSuresh Siddha }; 13311c792db7SSuresh Siddha 13321c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 13331c792db7SSuresh Siddha #endif 133473fbec60SFrederic Weisbecker 133573fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 133673fbec60SFrederic Weisbecker 133773fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_hardirq_time); 133873fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_softirq_time); 133973fbec60SFrederic Weisbecker 134073fbec60SFrederic Weisbecker #ifndef CONFIG_64BIT 134173fbec60SFrederic Weisbecker DECLARE_PER_CPU(seqcount_t, irq_time_seq); 134273fbec60SFrederic Weisbecker 134373fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 134473fbec60SFrederic Weisbecker { 134573fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 134673fbec60SFrederic Weisbecker smp_wmb(); 134773fbec60SFrederic Weisbecker } 134873fbec60SFrederic Weisbecker 134973fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 135073fbec60SFrederic Weisbecker { 135173fbec60SFrederic Weisbecker smp_wmb(); 135273fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 135373fbec60SFrederic Weisbecker } 135473fbec60SFrederic Weisbecker 135573fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 135673fbec60SFrederic Weisbecker { 135773fbec60SFrederic Weisbecker u64 irq_time; 135873fbec60SFrederic Weisbecker unsigned seq; 135973fbec60SFrederic Weisbecker 136073fbec60SFrederic Weisbecker do { 136173fbec60SFrederic Weisbecker seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu)); 136273fbec60SFrederic Weisbecker irq_time = per_cpu(cpu_softirq_time, cpu) + 136373fbec60SFrederic Weisbecker per_cpu(cpu_hardirq_time, cpu); 136473fbec60SFrederic Weisbecker } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq)); 136573fbec60SFrederic Weisbecker 136673fbec60SFrederic Weisbecker return irq_time; 136773fbec60SFrederic Weisbecker } 136873fbec60SFrederic Weisbecker #else /* CONFIG_64BIT */ 136973fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 137073fbec60SFrederic Weisbecker { 137173fbec60SFrederic Weisbecker } 137273fbec60SFrederic Weisbecker 137373fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 137473fbec60SFrederic Weisbecker { 137573fbec60SFrederic Weisbecker } 137673fbec60SFrederic Weisbecker 137773fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 137873fbec60SFrederic Weisbecker { 137973fbec60SFrederic Weisbecker return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu); 138073fbec60SFrederic Weisbecker } 138173fbec60SFrederic Weisbecker #endif /* CONFIG_64BIT */ 138273fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 1383