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> 8391e43daSPeter Zijlstra 9391e43daSPeter Zijlstra #include "cpupri.h" 10391e43daSPeter Zijlstra 11391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 12391e43daSPeter Zijlstra 13391e43daSPeter Zijlstra /* 14391e43daSPeter Zijlstra * Convert user-nice values [ -20 ... 0 ... 19 ] 15391e43daSPeter Zijlstra * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ], 16391e43daSPeter Zijlstra * and back. 17391e43daSPeter Zijlstra */ 18391e43daSPeter Zijlstra #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20) 19391e43daSPeter Zijlstra #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20) 20391e43daSPeter Zijlstra #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio) 21391e43daSPeter Zijlstra 22391e43daSPeter Zijlstra /* 23391e43daSPeter Zijlstra * 'User priority' is the nice value converted to something we 24391e43daSPeter Zijlstra * can work with better when scaling various scheduler parameters, 25391e43daSPeter Zijlstra * it's a [ 0 ... 39 ] range. 26391e43daSPeter Zijlstra */ 27391e43daSPeter Zijlstra #define USER_PRIO(p) ((p)-MAX_RT_PRIO) 28391e43daSPeter Zijlstra #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio) 29391e43daSPeter Zijlstra #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO)) 30391e43daSPeter Zijlstra 31391e43daSPeter Zijlstra /* 32391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 33391e43daSPeter Zijlstra */ 34391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 35391e43daSPeter Zijlstra 36cc1f4b1fSLi Zefan /* 37cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 38cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 39cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 40cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 41cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 42cc1f4b1fSLi Zefan * 43cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 44cc1f4b1fSLi Zefan * resolution (i.e. BITS_PER_LONG > 32). The costs for increasing resolution 45cc1f4b1fSLi Zefan * when BITS_PER_LONG <= 32 are pretty high and the returns do not justify the 46cc1f4b1fSLi Zefan * increased costs. 47cc1f4b1fSLi Zefan */ 48cc1f4b1fSLi Zefan #if 0 /* BITS_PER_LONG > 32 -- currently broken: it increases power usage under light load */ 49cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 10 50cc1f4b1fSLi Zefan # define scale_load(w) ((w) << SCHED_LOAD_RESOLUTION) 51cc1f4b1fSLi Zefan # define scale_load_down(w) ((w) >> SCHED_LOAD_RESOLUTION) 52cc1f4b1fSLi Zefan #else 53cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 0 54cc1f4b1fSLi Zefan # define scale_load(w) (w) 55cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 56cc1f4b1fSLi Zefan #endif 57cc1f4b1fSLi Zefan 58cc1f4b1fSLi Zefan #define SCHED_LOAD_SHIFT (10 + SCHED_LOAD_RESOLUTION) 59cc1f4b1fSLi Zefan #define SCHED_LOAD_SCALE (1L << SCHED_LOAD_SHIFT) 60cc1f4b1fSLi Zefan 61391e43daSPeter Zijlstra #define NICE_0_LOAD SCHED_LOAD_SCALE 62391e43daSPeter Zijlstra #define NICE_0_SHIFT SCHED_LOAD_SHIFT 63391e43daSPeter Zijlstra 64391e43daSPeter Zijlstra /* 65391e43daSPeter Zijlstra * These are the 'tuning knobs' of the scheduler: 66391e43daSPeter Zijlstra */ 67391e43daSPeter Zijlstra 68391e43daSPeter Zijlstra /* 69391e43daSPeter Zijlstra * single value that denotes runtime == period, ie unlimited time. 70391e43daSPeter Zijlstra */ 71391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 72391e43daSPeter Zijlstra 73391e43daSPeter Zijlstra static inline int rt_policy(int policy) 74391e43daSPeter Zijlstra { 75391e43daSPeter Zijlstra if (policy == SCHED_FIFO || policy == SCHED_RR) 76391e43daSPeter Zijlstra return 1; 77391e43daSPeter Zijlstra return 0; 78391e43daSPeter Zijlstra } 79391e43daSPeter Zijlstra 80391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 81391e43daSPeter Zijlstra { 82391e43daSPeter Zijlstra return rt_policy(p->policy); 83391e43daSPeter Zijlstra } 84391e43daSPeter Zijlstra 85391e43daSPeter Zijlstra /* 86391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 87391e43daSPeter Zijlstra */ 88391e43daSPeter Zijlstra struct rt_prio_array { 89391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 90391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 91391e43daSPeter Zijlstra }; 92391e43daSPeter Zijlstra 93391e43daSPeter Zijlstra struct rt_bandwidth { 94391e43daSPeter Zijlstra /* nests inside the rq lock: */ 95391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 96391e43daSPeter Zijlstra ktime_t rt_period; 97391e43daSPeter Zijlstra u64 rt_runtime; 98391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 99391e43daSPeter Zijlstra }; 100391e43daSPeter Zijlstra 101391e43daSPeter Zijlstra extern struct mutex sched_domains_mutex; 102391e43daSPeter Zijlstra 103391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 104391e43daSPeter Zijlstra 105391e43daSPeter Zijlstra #include <linux/cgroup.h> 106391e43daSPeter Zijlstra 107391e43daSPeter Zijlstra struct cfs_rq; 108391e43daSPeter Zijlstra struct rt_rq; 109391e43daSPeter Zijlstra 11035cf4e50SMike Galbraith extern struct list_head task_groups; 111391e43daSPeter Zijlstra 112391e43daSPeter Zijlstra struct cfs_bandwidth { 113391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 114391e43daSPeter Zijlstra raw_spinlock_t lock; 115391e43daSPeter Zijlstra ktime_t period; 116391e43daSPeter Zijlstra u64 quota, runtime; 117391e43daSPeter Zijlstra s64 hierarchal_quota; 118391e43daSPeter Zijlstra u64 runtime_expires; 119391e43daSPeter Zijlstra 120391e43daSPeter Zijlstra int idle, timer_active; 121391e43daSPeter Zijlstra struct hrtimer period_timer, slack_timer; 122391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 123391e43daSPeter Zijlstra 124391e43daSPeter Zijlstra /* statistics */ 125391e43daSPeter Zijlstra int nr_periods, nr_throttled; 126391e43daSPeter Zijlstra u64 throttled_time; 127391e43daSPeter Zijlstra #endif 128391e43daSPeter Zijlstra }; 129391e43daSPeter Zijlstra 130391e43daSPeter Zijlstra /* task group related information */ 131391e43daSPeter Zijlstra struct task_group { 132391e43daSPeter Zijlstra struct cgroup_subsys_state css; 133391e43daSPeter Zijlstra 134391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 135391e43daSPeter Zijlstra /* schedulable entities of this group on each cpu */ 136391e43daSPeter Zijlstra struct sched_entity **se; 137391e43daSPeter Zijlstra /* runqueue "owned" by this group on each cpu */ 138391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 139391e43daSPeter Zijlstra unsigned long shares; 140391e43daSPeter Zijlstra 141391e43daSPeter Zijlstra atomic_t load_weight; 142c566e8e9SPaul Turner atomic64_t load_avg; 143bb17f655SPaul Turner atomic_t runnable_avg; 144391e43daSPeter Zijlstra #endif 145391e43daSPeter Zijlstra 146391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 147391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 148391e43daSPeter Zijlstra struct rt_rq **rt_rq; 149391e43daSPeter Zijlstra 150391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 151391e43daSPeter Zijlstra #endif 152391e43daSPeter Zijlstra 153391e43daSPeter Zijlstra struct rcu_head rcu; 154391e43daSPeter Zijlstra struct list_head list; 155391e43daSPeter Zijlstra 156391e43daSPeter Zijlstra struct task_group *parent; 157391e43daSPeter Zijlstra struct list_head siblings; 158391e43daSPeter Zijlstra struct list_head children; 159391e43daSPeter Zijlstra 160391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 161391e43daSPeter Zijlstra struct autogroup *autogroup; 162391e43daSPeter Zijlstra #endif 163391e43daSPeter Zijlstra 164391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 165391e43daSPeter Zijlstra }; 166391e43daSPeter Zijlstra 167391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 168391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 169391e43daSPeter Zijlstra 170391e43daSPeter Zijlstra /* 171391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 172391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 173391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 174391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 175391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 176391e43daSPeter Zijlstra * limitation from this.) 177391e43daSPeter Zijlstra */ 178391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 179391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 180391e43daSPeter Zijlstra #endif 181391e43daSPeter Zijlstra 182391e43daSPeter Zijlstra /* Default task group. 183391e43daSPeter Zijlstra * Every task in system belong to this group at bootup. 184391e43daSPeter Zijlstra */ 185391e43daSPeter Zijlstra extern struct task_group root_task_group; 186391e43daSPeter Zijlstra 187391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 188391e43daSPeter Zijlstra 189391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 190391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 191391e43daSPeter Zijlstra 192391e43daSPeter Zijlstra /* 193391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 194391e43daSPeter Zijlstra * leaving it for the final time. 195391e43daSPeter Zijlstra * 196391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 197391e43daSPeter Zijlstra */ 198391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 199391e43daSPeter Zijlstra { 200391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 201391e43daSPeter Zijlstra } 202391e43daSPeter Zijlstra 203391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 204391e43daSPeter Zijlstra 205391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 206391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 207391e43daSPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg, int cpu); 208391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 209391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 210391e43daSPeter Zijlstra struct sched_entity *parent); 211391e43daSPeter Zijlstra extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 212391e43daSPeter Zijlstra extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 213391e43daSPeter Zijlstra 214391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 215391e43daSPeter Zijlstra extern void __start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 216391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 217391e43daSPeter Zijlstra 218391e43daSPeter Zijlstra extern void free_rt_sched_group(struct task_group *tg); 219391e43daSPeter Zijlstra extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 220391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 221391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 222391e43daSPeter Zijlstra struct sched_rt_entity *parent); 223391e43daSPeter Zijlstra 224391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 225391e43daSPeter Zijlstra 226391e43daSPeter Zijlstra struct cfs_bandwidth { }; 227391e43daSPeter Zijlstra 228391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 229391e43daSPeter Zijlstra 230391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 231391e43daSPeter Zijlstra struct cfs_rq { 232391e43daSPeter Zijlstra struct load_weight load; 233c82513e5SPeter Zijlstra unsigned int nr_running, h_nr_running; 234391e43daSPeter Zijlstra 235391e43daSPeter Zijlstra u64 exec_clock; 236391e43daSPeter Zijlstra u64 min_vruntime; 237391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 238391e43daSPeter Zijlstra u64 min_vruntime_copy; 239391e43daSPeter Zijlstra #endif 240391e43daSPeter Zijlstra 241391e43daSPeter Zijlstra struct rb_root tasks_timeline; 242391e43daSPeter Zijlstra struct rb_node *rb_leftmost; 243391e43daSPeter Zijlstra 244391e43daSPeter Zijlstra /* 245391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 246391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 247391e43daSPeter Zijlstra */ 248391e43daSPeter Zijlstra struct sched_entity *curr, *next, *last, *skip; 249391e43daSPeter Zijlstra 250391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 251391e43daSPeter Zijlstra unsigned int nr_spread_over; 252391e43daSPeter Zijlstra #endif 253391e43daSPeter Zijlstra 2542dac754eSPaul Turner #ifdef CONFIG_SMP 2552dac754eSPaul Turner /* 256f4e26b12SPaul Turner * Load-tracking only depends on SMP, FAIR_GROUP_SCHED dependency below may be 257f4e26b12SPaul Turner * removed when useful for applications beyond shares distribution (e.g. 258f4e26b12SPaul Turner * load-balance). 259f4e26b12SPaul Turner */ 260f4e26b12SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 261f4e26b12SPaul Turner /* 2622dac754eSPaul Turner * CFS Load tracking 2632dac754eSPaul Turner * Under CFS, load is tracked on a per-entity basis and aggregated up. 2642dac754eSPaul Turner * This allows for the description of both thread and group usage (in 2652dac754eSPaul Turner * the FAIR_GROUP_SCHED case). 2662dac754eSPaul Turner */ 2679ee474f5SPaul Turner u64 runnable_load_avg, blocked_load_avg; 268aff3e498SPaul Turner atomic64_t decay_counter, removed_load; 2699ee474f5SPaul Turner u64 last_decay; 270f4e26b12SPaul Turner #endif /* CONFIG_FAIR_GROUP_SCHED */ 271f4e26b12SPaul Turner /* These always depend on CONFIG_FAIR_GROUP_SCHED */ 272c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 273bb17f655SPaul Turner u32 tg_runnable_contrib; 274c566e8e9SPaul Turner u64 tg_load_contrib; 27582958366SPaul Turner #endif /* CONFIG_FAIR_GROUP_SCHED */ 27682958366SPaul Turner 27782958366SPaul Turner /* 27882958366SPaul Turner * h_load = weight * f(tg) 27982958366SPaul Turner * 28082958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 28182958366SPaul Turner * this group. 28282958366SPaul Turner */ 28382958366SPaul Turner unsigned long h_load; 28482958366SPaul Turner #endif /* CONFIG_SMP */ 28582958366SPaul Turner 286391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 287391e43daSPeter Zijlstra struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ 288391e43daSPeter Zijlstra 289391e43daSPeter Zijlstra /* 290391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 291391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 292391e43daSPeter Zijlstra * (like users, containers etc.) 293391e43daSPeter Zijlstra * 294391e43daSPeter Zijlstra * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This 295391e43daSPeter Zijlstra * list is used during load balance. 296391e43daSPeter Zijlstra */ 297391e43daSPeter Zijlstra int on_list; 298391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 299391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 300391e43daSPeter Zijlstra 301391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 302391e43daSPeter Zijlstra int runtime_enabled; 303391e43daSPeter Zijlstra u64 runtime_expires; 304391e43daSPeter Zijlstra s64 runtime_remaining; 305391e43daSPeter Zijlstra 306f1b17280SPaul Turner u64 throttled_clock, throttled_clock_task; 307f1b17280SPaul Turner u64 throttled_clock_task_time; 308391e43daSPeter Zijlstra int throttled, throttle_count; 309391e43daSPeter Zijlstra struct list_head throttled_list; 310391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 311391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 312391e43daSPeter Zijlstra }; 313391e43daSPeter Zijlstra 314391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 315391e43daSPeter Zijlstra { 316391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 317391e43daSPeter Zijlstra } 318391e43daSPeter Zijlstra 319391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 320391e43daSPeter Zijlstra struct rt_rq { 321391e43daSPeter Zijlstra struct rt_prio_array active; 322c82513e5SPeter Zijlstra unsigned int rt_nr_running; 323391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 324391e43daSPeter Zijlstra struct { 325391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 326391e43daSPeter Zijlstra #ifdef CONFIG_SMP 327391e43daSPeter Zijlstra int next; /* next highest */ 328391e43daSPeter Zijlstra #endif 329391e43daSPeter Zijlstra } highest_prio; 330391e43daSPeter Zijlstra #endif 331391e43daSPeter Zijlstra #ifdef CONFIG_SMP 332391e43daSPeter Zijlstra unsigned long rt_nr_migratory; 333391e43daSPeter Zijlstra unsigned long rt_nr_total; 334391e43daSPeter Zijlstra int overloaded; 335391e43daSPeter Zijlstra struct plist_head pushable_tasks; 336391e43daSPeter Zijlstra #endif 337391e43daSPeter Zijlstra int rt_throttled; 338391e43daSPeter Zijlstra u64 rt_time; 339391e43daSPeter Zijlstra u64 rt_runtime; 340391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 341391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 342391e43daSPeter Zijlstra 343391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 344391e43daSPeter Zijlstra unsigned long rt_nr_boosted; 345391e43daSPeter Zijlstra 346391e43daSPeter Zijlstra struct rq *rq; 347391e43daSPeter Zijlstra struct list_head leaf_rt_rq_list; 348391e43daSPeter Zijlstra struct task_group *tg; 349391e43daSPeter Zijlstra #endif 350391e43daSPeter Zijlstra }; 351391e43daSPeter Zijlstra 352391e43daSPeter Zijlstra #ifdef CONFIG_SMP 353391e43daSPeter Zijlstra 354391e43daSPeter Zijlstra /* 355391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 356391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 357391e43daSPeter Zijlstra * fully partitioning the member cpus from any other cpuset. Whenever a new 358391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 359391e43daSPeter Zijlstra * object. 360391e43daSPeter Zijlstra * 361391e43daSPeter Zijlstra */ 362391e43daSPeter Zijlstra struct root_domain { 363391e43daSPeter Zijlstra atomic_t refcount; 364391e43daSPeter Zijlstra atomic_t rto_count; 365391e43daSPeter Zijlstra struct rcu_head rcu; 366391e43daSPeter Zijlstra cpumask_var_t span; 367391e43daSPeter Zijlstra cpumask_var_t online; 368391e43daSPeter Zijlstra 369391e43daSPeter Zijlstra /* 370391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 371391e43daSPeter Zijlstra * one runnable RT task. 372391e43daSPeter Zijlstra */ 373391e43daSPeter Zijlstra cpumask_var_t rto_mask; 374391e43daSPeter Zijlstra struct cpupri cpupri; 375391e43daSPeter Zijlstra }; 376391e43daSPeter Zijlstra 377391e43daSPeter Zijlstra extern struct root_domain def_root_domain; 378391e43daSPeter Zijlstra 379391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 380391e43daSPeter Zijlstra 381391e43daSPeter Zijlstra /* 382391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 383391e43daSPeter Zijlstra * 384391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 385391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 386391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 387391e43daSPeter Zijlstra */ 388391e43daSPeter Zijlstra struct rq { 389391e43daSPeter Zijlstra /* runqueue lock: */ 390391e43daSPeter Zijlstra raw_spinlock_t lock; 391391e43daSPeter Zijlstra 392391e43daSPeter Zijlstra /* 393391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 394391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 395391e43daSPeter Zijlstra */ 396c82513e5SPeter Zijlstra unsigned int nr_running; 397391e43daSPeter Zijlstra #define CPU_LOAD_IDX_MAX 5 398391e43daSPeter Zijlstra unsigned long cpu_load[CPU_LOAD_IDX_MAX]; 399391e43daSPeter Zijlstra unsigned long last_load_update_tick; 400391e43daSPeter Zijlstra #ifdef CONFIG_NO_HZ 401391e43daSPeter Zijlstra u64 nohz_stamp; 4021c792db7SSuresh Siddha unsigned long nohz_flags; 403391e43daSPeter Zijlstra #endif 404391e43daSPeter Zijlstra int skip_clock_update; 405391e43daSPeter Zijlstra 406391e43daSPeter Zijlstra /* capture load from *all* tasks on this cpu: */ 407391e43daSPeter Zijlstra struct load_weight load; 408391e43daSPeter Zijlstra unsigned long nr_load_updates; 409391e43daSPeter Zijlstra u64 nr_switches; 410391e43daSPeter Zijlstra 411391e43daSPeter Zijlstra struct cfs_rq cfs; 412391e43daSPeter Zijlstra struct rt_rq rt; 413391e43daSPeter Zijlstra 414391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 415391e43daSPeter Zijlstra /* list of leaf cfs_rq on this cpu: */ 416391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 417a35b6466SPeter Zijlstra #ifdef CONFIG_SMP 418a35b6466SPeter Zijlstra unsigned long h_load_throttle; 419a35b6466SPeter Zijlstra #endif /* CONFIG_SMP */ 420a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 421a35b6466SPeter Zijlstra 422391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 423391e43daSPeter Zijlstra struct list_head leaf_rt_rq_list; 424391e43daSPeter Zijlstra #endif 425391e43daSPeter Zijlstra 426391e43daSPeter Zijlstra /* 427391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 428391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 429391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 430391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 431391e43daSPeter Zijlstra */ 432391e43daSPeter Zijlstra unsigned long nr_uninterruptible; 433391e43daSPeter Zijlstra 434391e43daSPeter Zijlstra struct task_struct *curr, *idle, *stop; 435391e43daSPeter Zijlstra unsigned long next_balance; 436391e43daSPeter Zijlstra struct mm_struct *prev_mm; 437391e43daSPeter Zijlstra 438391e43daSPeter Zijlstra u64 clock; 439391e43daSPeter Zijlstra u64 clock_task; 440391e43daSPeter Zijlstra 441391e43daSPeter Zijlstra atomic_t nr_iowait; 442391e43daSPeter Zijlstra 443391e43daSPeter Zijlstra #ifdef CONFIG_SMP 444391e43daSPeter Zijlstra struct root_domain *rd; 445391e43daSPeter Zijlstra struct sched_domain *sd; 446391e43daSPeter Zijlstra 447391e43daSPeter Zijlstra unsigned long cpu_power; 448391e43daSPeter Zijlstra 449391e43daSPeter Zijlstra unsigned char idle_balance; 450391e43daSPeter Zijlstra /* For active balancing */ 451391e43daSPeter Zijlstra int post_schedule; 452391e43daSPeter Zijlstra int active_balance; 453391e43daSPeter Zijlstra int push_cpu; 454391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 455391e43daSPeter Zijlstra /* cpu of this runqueue: */ 456391e43daSPeter Zijlstra int cpu; 457391e43daSPeter Zijlstra int online; 458391e43daSPeter Zijlstra 459367456c7SPeter Zijlstra struct list_head cfs_tasks; 460367456c7SPeter Zijlstra 461391e43daSPeter Zijlstra u64 rt_avg; 462391e43daSPeter Zijlstra u64 age_stamp; 463391e43daSPeter Zijlstra u64 idle_stamp; 464391e43daSPeter Zijlstra u64 avg_idle; 465391e43daSPeter Zijlstra #endif 466391e43daSPeter Zijlstra 467391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 468391e43daSPeter Zijlstra u64 prev_irq_time; 469391e43daSPeter Zijlstra #endif 470391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 471391e43daSPeter Zijlstra u64 prev_steal_time; 472391e43daSPeter Zijlstra #endif 473391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 474391e43daSPeter Zijlstra u64 prev_steal_time_rq; 475391e43daSPeter Zijlstra #endif 476391e43daSPeter Zijlstra 477391e43daSPeter Zijlstra /* calc_load related fields */ 478391e43daSPeter Zijlstra unsigned long calc_load_update; 479391e43daSPeter Zijlstra long calc_load_active; 480391e43daSPeter Zijlstra 481391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 482391e43daSPeter Zijlstra #ifdef CONFIG_SMP 483391e43daSPeter Zijlstra int hrtick_csd_pending; 484391e43daSPeter Zijlstra struct call_single_data hrtick_csd; 485391e43daSPeter Zijlstra #endif 486391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 487391e43daSPeter Zijlstra #endif 488391e43daSPeter Zijlstra 489391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 490391e43daSPeter Zijlstra /* latency stats */ 491391e43daSPeter Zijlstra struct sched_info rq_sched_info; 492391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 493391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 494391e43daSPeter Zijlstra 495391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 496391e43daSPeter Zijlstra unsigned int yld_count; 497391e43daSPeter Zijlstra 498391e43daSPeter Zijlstra /* schedule() stats */ 499391e43daSPeter Zijlstra unsigned int sched_count; 500391e43daSPeter Zijlstra unsigned int sched_goidle; 501391e43daSPeter Zijlstra 502391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 503391e43daSPeter Zijlstra unsigned int ttwu_count; 504391e43daSPeter Zijlstra unsigned int ttwu_local; 505391e43daSPeter Zijlstra #endif 506391e43daSPeter Zijlstra 507391e43daSPeter Zijlstra #ifdef CONFIG_SMP 508391e43daSPeter Zijlstra struct llist_head wake_list; 509391e43daSPeter Zijlstra #endif 51018bf2805SBen Segall 51118bf2805SBen Segall struct sched_avg avg; 512391e43daSPeter Zijlstra }; 513391e43daSPeter Zijlstra 514391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 515391e43daSPeter Zijlstra { 516391e43daSPeter Zijlstra #ifdef CONFIG_SMP 517391e43daSPeter Zijlstra return rq->cpu; 518391e43daSPeter Zijlstra #else 519391e43daSPeter Zijlstra return 0; 520391e43daSPeter Zijlstra #endif 521391e43daSPeter Zijlstra } 522391e43daSPeter Zijlstra 523391e43daSPeter Zijlstra DECLARE_PER_CPU(struct rq, runqueues); 524391e43daSPeter Zijlstra 525518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 526518cd623SPeter Zijlstra #define this_rq() (&__get_cpu_var(runqueues)) 527518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 528518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 529518cd623SPeter Zijlstra #define raw_rq() (&__raw_get_cpu_var(runqueues)) 530518cd623SPeter Zijlstra 531518cd623SPeter Zijlstra #ifdef CONFIG_SMP 532518cd623SPeter Zijlstra 533391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 534391e43daSPeter Zijlstra rcu_dereference_check((p), \ 535391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 536391e43daSPeter Zijlstra 537391e43daSPeter Zijlstra /* 538391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 539391e43daSPeter Zijlstra * See detach_destroy_domains: synchronize_sched for details. 540391e43daSPeter Zijlstra * 541391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 542391e43daSPeter Zijlstra * preempt-disabled sections. 543391e43daSPeter Zijlstra */ 544391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 545518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 546518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 547391e43daSPeter Zijlstra 54877e81365SSuresh Siddha #define for_each_lower_domain(sd) for (; sd; sd = sd->child) 54977e81365SSuresh Siddha 550518cd623SPeter Zijlstra /** 551518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 552518cd623SPeter Zijlstra * @cpu: The cpu whose highest level of sched domain is to 553518cd623SPeter Zijlstra * be returned. 554518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 555518cd623SPeter Zijlstra * for the given cpu. 556518cd623SPeter Zijlstra * 557518cd623SPeter Zijlstra * Returns the highest sched_domain of a cpu which contains the given flag. 558518cd623SPeter Zijlstra */ 559518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 560518cd623SPeter Zijlstra { 561518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 562518cd623SPeter Zijlstra 563518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 564518cd623SPeter Zijlstra if (!(sd->flags & flag)) 565518cd623SPeter Zijlstra break; 566518cd623SPeter Zijlstra hsd = sd; 567518cd623SPeter Zijlstra } 568518cd623SPeter Zijlstra 569518cd623SPeter Zijlstra return hsd; 570518cd623SPeter Zijlstra } 571518cd623SPeter Zijlstra 572518cd623SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain *, sd_llc); 573518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 574518cd623SPeter Zijlstra 575c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 576c1174876SPeter Zijlstra 577518cd623SPeter Zijlstra #endif /* CONFIG_SMP */ 578391e43daSPeter Zijlstra 579391e43daSPeter Zijlstra #include "stats.h" 580391e43daSPeter Zijlstra #include "auto_group.h" 581391e43daSPeter Zijlstra 582391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 583391e43daSPeter Zijlstra 584391e43daSPeter Zijlstra /* 585391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 586391e43daSPeter Zijlstra * 5878323f26cSPeter Zijlstra * We cannot use task_subsys_state() and friends because the cgroup 5888323f26cSPeter Zijlstra * subsystem changes that value before the cgroup_subsys::attach() method 5898323f26cSPeter Zijlstra * is called, therefore we cannot pin it and might observe the wrong value. 5908323f26cSPeter Zijlstra * 5918323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 5928323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 5938323f26cSPeter Zijlstra * 5948323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 5958323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 596391e43daSPeter Zijlstra */ 597391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 598391e43daSPeter Zijlstra { 5998323f26cSPeter Zijlstra return p->sched_task_group; 600391e43daSPeter Zijlstra } 601391e43daSPeter Zijlstra 602391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 603391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 604391e43daSPeter Zijlstra { 605391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 606391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 607391e43daSPeter Zijlstra #endif 608391e43daSPeter Zijlstra 609391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 610391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 611391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 612391e43daSPeter Zijlstra #endif 613391e43daSPeter Zijlstra 614391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 615391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 616391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 617391e43daSPeter Zijlstra #endif 618391e43daSPeter Zijlstra } 619391e43daSPeter Zijlstra 620391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 621391e43daSPeter Zijlstra 622391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 623391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 624391e43daSPeter Zijlstra { 625391e43daSPeter Zijlstra return NULL; 626391e43daSPeter Zijlstra } 627391e43daSPeter Zijlstra 628391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 629391e43daSPeter Zijlstra 630391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 631391e43daSPeter Zijlstra { 632391e43daSPeter Zijlstra set_task_rq(p, cpu); 633391e43daSPeter Zijlstra #ifdef CONFIG_SMP 634391e43daSPeter Zijlstra /* 635391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 636391e43daSPeter Zijlstra * successfuly executed on another CPU. We must ensure that updates of 637391e43daSPeter Zijlstra * per-task data have been completed by this moment. 638391e43daSPeter Zijlstra */ 639391e43daSPeter Zijlstra smp_wmb(); 640391e43daSPeter Zijlstra task_thread_info(p)->cpu = cpu; 641391e43daSPeter Zijlstra #endif 642391e43daSPeter Zijlstra } 643391e43daSPeter Zijlstra 644391e43daSPeter Zijlstra /* 645391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 646391e43daSPeter Zijlstra */ 647391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 648c5905afbSIngo Molnar # include <linux/static_key.h> 649391e43daSPeter Zijlstra # define const_debug __read_mostly 650391e43daSPeter Zijlstra #else 651391e43daSPeter Zijlstra # define const_debug const 652391e43daSPeter Zijlstra #endif 653391e43daSPeter Zijlstra 654391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_features; 655391e43daSPeter Zijlstra 656391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 657391e43daSPeter Zijlstra __SCHED_FEAT_##name , 658391e43daSPeter Zijlstra 659391e43daSPeter Zijlstra enum { 660391e43daSPeter Zijlstra #include "features.h" 661f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 662391e43daSPeter Zijlstra }; 663391e43daSPeter Zijlstra 664391e43daSPeter Zijlstra #undef SCHED_FEAT 665391e43daSPeter Zijlstra 666f8b6d1ccSPeter Zijlstra #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) 667c5905afbSIngo Molnar static __always_inline bool static_branch__true(struct static_key *key) 668f8b6d1ccSPeter Zijlstra { 669c5905afbSIngo Molnar return static_key_true(key); /* Not out of line branch. */ 670f8b6d1ccSPeter Zijlstra } 671f8b6d1ccSPeter Zijlstra 672c5905afbSIngo Molnar static __always_inline bool static_branch__false(struct static_key *key) 673f8b6d1ccSPeter Zijlstra { 674c5905afbSIngo Molnar return static_key_false(key); /* Out of line branch. */ 675f8b6d1ccSPeter Zijlstra } 676f8b6d1ccSPeter Zijlstra 677f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 678c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 679f8b6d1ccSPeter Zijlstra { \ 680f8b6d1ccSPeter Zijlstra return static_branch__##enabled(key); \ 681f8b6d1ccSPeter Zijlstra } 682f8b6d1ccSPeter Zijlstra 683f8b6d1ccSPeter Zijlstra #include "features.h" 684f8b6d1ccSPeter Zijlstra 685f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 686f8b6d1ccSPeter Zijlstra 687c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 688f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 689f8b6d1ccSPeter Zijlstra #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ 690391e43daSPeter Zijlstra #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 691f8b6d1ccSPeter Zijlstra #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ 692391e43daSPeter Zijlstra 693cbee9f88SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 694cbee9f88SPeter Zijlstra #define sched_feat_numa(x) sched_feat(x) 6953105b86aSMel Gorman #ifdef CONFIG_SCHED_DEBUG 6963105b86aSMel Gorman #define numabalancing_enabled sched_feat_numa(NUMA) 6973105b86aSMel Gorman #else 6983105b86aSMel Gorman extern bool numabalancing_enabled; 6993105b86aSMel Gorman #endif /* CONFIG_SCHED_DEBUG */ 700cbee9f88SPeter Zijlstra #else 701cbee9f88SPeter Zijlstra #define sched_feat_numa(x) (0) 7023105b86aSMel Gorman #define numabalancing_enabled (0) 7033105b86aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 704cbee9f88SPeter Zijlstra 705391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 706391e43daSPeter Zijlstra { 707391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 708391e43daSPeter Zijlstra } 709391e43daSPeter Zijlstra 710391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 711391e43daSPeter Zijlstra { 712391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 713391e43daSPeter Zijlstra return RUNTIME_INF; 714391e43daSPeter Zijlstra 715391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 716391e43daSPeter Zijlstra } 717391e43daSPeter Zijlstra 718391e43daSPeter Zijlstra 719391e43daSPeter Zijlstra 720391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 721391e43daSPeter Zijlstra { 722391e43daSPeter Zijlstra return rq->curr == p; 723391e43daSPeter Zijlstra } 724391e43daSPeter Zijlstra 725391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 726391e43daSPeter Zijlstra { 727391e43daSPeter Zijlstra #ifdef CONFIG_SMP 728391e43daSPeter Zijlstra return p->on_cpu; 729391e43daSPeter Zijlstra #else 730391e43daSPeter Zijlstra return task_current(rq, p); 731391e43daSPeter Zijlstra #endif 732391e43daSPeter Zijlstra } 733391e43daSPeter Zijlstra 734391e43daSPeter Zijlstra 735391e43daSPeter Zijlstra #ifndef prepare_arch_switch 736391e43daSPeter Zijlstra # define prepare_arch_switch(next) do { } while (0) 737391e43daSPeter Zijlstra #endif 738391e43daSPeter Zijlstra #ifndef finish_arch_switch 739391e43daSPeter Zijlstra # define finish_arch_switch(prev) do { } while (0) 740391e43daSPeter Zijlstra #endif 74101f23e16SCatalin Marinas #ifndef finish_arch_post_lock_switch 74201f23e16SCatalin Marinas # define finish_arch_post_lock_switch() do { } while (0) 74301f23e16SCatalin Marinas #endif 744391e43daSPeter Zijlstra 745391e43daSPeter Zijlstra #ifndef __ARCH_WANT_UNLOCKED_CTXSW 746391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 747391e43daSPeter Zijlstra { 748391e43daSPeter Zijlstra #ifdef CONFIG_SMP 749391e43daSPeter Zijlstra /* 750391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 751391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 752391e43daSPeter Zijlstra * here. 753391e43daSPeter Zijlstra */ 754391e43daSPeter Zijlstra next->on_cpu = 1; 755391e43daSPeter Zijlstra #endif 756391e43daSPeter Zijlstra } 757391e43daSPeter Zijlstra 758391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 759391e43daSPeter Zijlstra { 760391e43daSPeter Zijlstra #ifdef CONFIG_SMP 761391e43daSPeter Zijlstra /* 762391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 763391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 764391e43daSPeter Zijlstra * finished. 765391e43daSPeter Zijlstra */ 766391e43daSPeter Zijlstra smp_wmb(); 767391e43daSPeter Zijlstra prev->on_cpu = 0; 768391e43daSPeter Zijlstra #endif 769391e43daSPeter Zijlstra #ifdef CONFIG_DEBUG_SPINLOCK 770391e43daSPeter Zijlstra /* this is a valid case when another task releases the spinlock */ 771391e43daSPeter Zijlstra rq->lock.owner = current; 772391e43daSPeter Zijlstra #endif 773391e43daSPeter Zijlstra /* 774391e43daSPeter Zijlstra * If we are tracking spinlock dependencies then we have to 775391e43daSPeter Zijlstra * fix up the runqueue lock - which gets 'carried over' from 776391e43daSPeter Zijlstra * prev into current: 777391e43daSPeter Zijlstra */ 778391e43daSPeter Zijlstra spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); 779391e43daSPeter Zijlstra 780391e43daSPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 781391e43daSPeter Zijlstra } 782391e43daSPeter Zijlstra 783391e43daSPeter Zijlstra #else /* __ARCH_WANT_UNLOCKED_CTXSW */ 784391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 785391e43daSPeter Zijlstra { 786391e43daSPeter Zijlstra #ifdef CONFIG_SMP 787391e43daSPeter Zijlstra /* 788391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 789391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 790391e43daSPeter Zijlstra * here. 791391e43daSPeter Zijlstra */ 792391e43daSPeter Zijlstra next->on_cpu = 1; 793391e43daSPeter Zijlstra #endif 794391e43daSPeter Zijlstra raw_spin_unlock(&rq->lock); 795391e43daSPeter Zijlstra } 796391e43daSPeter Zijlstra 797391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 798391e43daSPeter Zijlstra { 799391e43daSPeter Zijlstra #ifdef CONFIG_SMP 800391e43daSPeter Zijlstra /* 801391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 802391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 803391e43daSPeter Zijlstra * finished. 804391e43daSPeter Zijlstra */ 805391e43daSPeter Zijlstra smp_wmb(); 806391e43daSPeter Zijlstra prev->on_cpu = 0; 807391e43daSPeter Zijlstra #endif 808391e43daSPeter Zijlstra local_irq_enable(); 809391e43daSPeter Zijlstra } 810391e43daSPeter Zijlstra #endif /* __ARCH_WANT_UNLOCKED_CTXSW */ 811391e43daSPeter Zijlstra 812391e43daSPeter Zijlstra static inline void update_load_add(struct load_weight *lw, unsigned long inc) 813391e43daSPeter Zijlstra { 814391e43daSPeter Zijlstra lw->weight += inc; 815391e43daSPeter Zijlstra lw->inv_weight = 0; 816391e43daSPeter Zijlstra } 817391e43daSPeter Zijlstra 818391e43daSPeter Zijlstra static inline void update_load_sub(struct load_weight *lw, unsigned long dec) 819391e43daSPeter Zijlstra { 820391e43daSPeter Zijlstra lw->weight -= dec; 821391e43daSPeter Zijlstra lw->inv_weight = 0; 822391e43daSPeter Zijlstra } 823391e43daSPeter Zijlstra 824391e43daSPeter Zijlstra static inline void update_load_set(struct load_weight *lw, unsigned long w) 825391e43daSPeter Zijlstra { 826391e43daSPeter Zijlstra lw->weight = w; 827391e43daSPeter Zijlstra lw->inv_weight = 0; 828391e43daSPeter Zijlstra } 829391e43daSPeter Zijlstra 830391e43daSPeter Zijlstra /* 831391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 832391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 833391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 834391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 835391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 836391e43daSPeter Zijlstra * slice expiry etc. 837391e43daSPeter Zijlstra */ 838391e43daSPeter Zijlstra 839391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 840391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 841391e43daSPeter Zijlstra 842391e43daSPeter Zijlstra /* 843391e43daSPeter Zijlstra * Nice levels are multiplicative, with a gentle 10% change for every 844391e43daSPeter Zijlstra * nice level changed. I.e. when a CPU-bound task goes from nice 0 to 845391e43daSPeter Zijlstra * nice 1, it will get ~10% less CPU time than another CPU-bound task 846391e43daSPeter Zijlstra * that remained on nice 0. 847391e43daSPeter Zijlstra * 848391e43daSPeter Zijlstra * The "10% effect" is relative and cumulative: from _any_ nice level, 849391e43daSPeter Zijlstra * if you go up 1 level, it's -10% CPU usage, if you go down 1 level 850391e43daSPeter Zijlstra * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. 851391e43daSPeter Zijlstra * If a task goes up by ~10% and another task goes down by ~10% then 852391e43daSPeter Zijlstra * the relative distance between them is ~25%.) 853391e43daSPeter Zijlstra */ 854391e43daSPeter Zijlstra static const int prio_to_weight[40] = { 855391e43daSPeter Zijlstra /* -20 */ 88761, 71755, 56483, 46273, 36291, 856391e43daSPeter Zijlstra /* -15 */ 29154, 23254, 18705, 14949, 11916, 857391e43daSPeter Zijlstra /* -10 */ 9548, 7620, 6100, 4904, 3906, 858391e43daSPeter Zijlstra /* -5 */ 3121, 2501, 1991, 1586, 1277, 859391e43daSPeter Zijlstra /* 0 */ 1024, 820, 655, 526, 423, 860391e43daSPeter Zijlstra /* 5 */ 335, 272, 215, 172, 137, 861391e43daSPeter Zijlstra /* 10 */ 110, 87, 70, 56, 45, 862391e43daSPeter Zijlstra /* 15 */ 36, 29, 23, 18, 15, 863391e43daSPeter Zijlstra }; 864391e43daSPeter Zijlstra 865391e43daSPeter Zijlstra /* 866391e43daSPeter Zijlstra * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated. 867391e43daSPeter Zijlstra * 868391e43daSPeter Zijlstra * In cases where the weight does not change often, we can use the 869391e43daSPeter Zijlstra * precalculated inverse to speed up arithmetics by turning divisions 870391e43daSPeter Zijlstra * into multiplications: 871391e43daSPeter Zijlstra */ 872391e43daSPeter Zijlstra static const u32 prio_to_wmult[40] = { 873391e43daSPeter Zijlstra /* -20 */ 48388, 59856, 76040, 92818, 118348, 874391e43daSPeter Zijlstra /* -15 */ 147320, 184698, 229616, 287308, 360437, 875391e43daSPeter Zijlstra /* -10 */ 449829, 563644, 704093, 875809, 1099582, 876391e43daSPeter Zijlstra /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, 877391e43daSPeter Zijlstra /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, 878391e43daSPeter Zijlstra /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, 879391e43daSPeter Zijlstra /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, 880391e43daSPeter Zijlstra /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, 881391e43daSPeter Zijlstra }; 882391e43daSPeter Zijlstra 883391e43daSPeter Zijlstra /* Time spent by the tasks of the cpu accounting group executing in ... */ 884391e43daSPeter Zijlstra enum cpuacct_stat_index { 885391e43daSPeter Zijlstra CPUACCT_STAT_USER, /* ... user mode */ 886391e43daSPeter Zijlstra CPUACCT_STAT_SYSTEM, /* ... kernel mode */ 887391e43daSPeter Zijlstra 888391e43daSPeter Zijlstra CPUACCT_STAT_NSTATS, 889391e43daSPeter Zijlstra }; 890391e43daSPeter Zijlstra 891391e43daSPeter Zijlstra 892391e43daSPeter Zijlstra #define sched_class_highest (&stop_sched_class) 893391e43daSPeter Zijlstra #define for_each_class(class) \ 894391e43daSPeter Zijlstra for (class = sched_class_highest; class; class = class->next) 895391e43daSPeter Zijlstra 896391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 897391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 898391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 899391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 900391e43daSPeter Zijlstra 901391e43daSPeter Zijlstra 902391e43daSPeter Zijlstra #ifdef CONFIG_SMP 903391e43daSPeter Zijlstra 904391e43daSPeter Zijlstra extern void trigger_load_balance(struct rq *rq, int cpu); 905391e43daSPeter Zijlstra extern void idle_balance(int this_cpu, struct rq *this_rq); 906391e43daSPeter Zijlstra 907391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 908391e43daSPeter Zijlstra 909391e43daSPeter Zijlstra static inline void idle_balance(int cpu, struct rq *rq) 910391e43daSPeter Zijlstra { 911391e43daSPeter Zijlstra } 912391e43daSPeter Zijlstra 913391e43daSPeter Zijlstra #endif 914391e43daSPeter Zijlstra 915391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 916391e43daSPeter Zijlstra extern void sched_init_granularity(void); 917391e43daSPeter Zijlstra extern void update_max_interval(void); 918391e43daSPeter Zijlstra extern void update_group_power(struct sched_domain *sd, int cpu); 919391e43daSPeter Zijlstra extern int update_runtime(struct notifier_block *nfb, unsigned long action, void *hcpu); 920391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 921391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 922391e43daSPeter Zijlstra 923391e43daSPeter Zijlstra extern void resched_task(struct task_struct *p); 924391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 925391e43daSPeter Zijlstra 926391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 927391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 928391e43daSPeter Zijlstra 929556061b0SPeter Zijlstra extern void update_idle_cpu_load(struct rq *this_rq); 930391e43daSPeter Zijlstra 931391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_CPUACCT 93254c707e9SGlauber Costa #include <linux/cgroup.h> 93354c707e9SGlauber Costa /* track cpu usage of a group of tasks and its child groups */ 93454c707e9SGlauber Costa struct cpuacct { 93554c707e9SGlauber Costa struct cgroup_subsys_state css; 93654c707e9SGlauber Costa /* cpuusage holds pointer to a u64-type object on every cpu */ 93754c707e9SGlauber Costa u64 __percpu *cpuusage; 93854c707e9SGlauber Costa struct kernel_cpustat __percpu *cpustat; 93954c707e9SGlauber Costa }; 94054c707e9SGlauber Costa 94173fbec60SFrederic Weisbecker extern struct cgroup_subsys cpuacct_subsys; 94273fbec60SFrederic Weisbecker extern struct cpuacct root_cpuacct; 94373fbec60SFrederic Weisbecker 94454c707e9SGlauber Costa /* return cpu accounting group corresponding to this container */ 94554c707e9SGlauber Costa static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp) 94654c707e9SGlauber Costa { 94754c707e9SGlauber Costa return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id), 94854c707e9SGlauber Costa struct cpuacct, css); 94954c707e9SGlauber Costa } 95054c707e9SGlauber Costa 95154c707e9SGlauber Costa /* return cpu accounting group to which this task belongs */ 95254c707e9SGlauber Costa static inline struct cpuacct *task_ca(struct task_struct *tsk) 95354c707e9SGlauber Costa { 95454c707e9SGlauber Costa return container_of(task_subsys_state(tsk, cpuacct_subsys_id), 95554c707e9SGlauber Costa struct cpuacct, css); 95654c707e9SGlauber Costa } 95754c707e9SGlauber Costa 95854c707e9SGlauber Costa static inline struct cpuacct *parent_ca(struct cpuacct *ca) 95954c707e9SGlauber Costa { 96054c707e9SGlauber Costa if (!ca || !ca->css.cgroup->parent) 96154c707e9SGlauber Costa return NULL; 96254c707e9SGlauber Costa return cgroup_ca(ca->css.cgroup->parent); 96354c707e9SGlauber Costa } 96454c707e9SGlauber Costa 965391e43daSPeter Zijlstra extern void cpuacct_charge(struct task_struct *tsk, u64 cputime); 966391e43daSPeter Zijlstra #else 967391e43daSPeter Zijlstra static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {} 968391e43daSPeter Zijlstra #endif 969391e43daSPeter Zijlstra 97073fbec60SFrederic Weisbecker #ifdef CONFIG_PARAVIRT 97173fbec60SFrederic Weisbecker static inline u64 steal_ticks(u64 steal) 97273fbec60SFrederic Weisbecker { 97373fbec60SFrederic Weisbecker if (unlikely(steal > NSEC_PER_SEC)) 97473fbec60SFrederic Weisbecker return div_u64(steal, TICK_NSEC); 97573fbec60SFrederic Weisbecker 97673fbec60SFrederic Weisbecker return __iter_div_u64_rem(steal, TICK_NSEC, &steal); 97773fbec60SFrederic Weisbecker } 97873fbec60SFrederic Weisbecker #endif 97973fbec60SFrederic Weisbecker 980391e43daSPeter Zijlstra static inline void inc_nr_running(struct rq *rq) 981391e43daSPeter Zijlstra { 982391e43daSPeter Zijlstra rq->nr_running++; 983391e43daSPeter Zijlstra } 984391e43daSPeter Zijlstra 985391e43daSPeter Zijlstra static inline void dec_nr_running(struct rq *rq) 986391e43daSPeter Zijlstra { 987391e43daSPeter Zijlstra rq->nr_running--; 988391e43daSPeter Zijlstra } 989391e43daSPeter Zijlstra 990391e43daSPeter Zijlstra extern void update_rq_clock(struct rq *rq); 991391e43daSPeter Zijlstra 992391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 993391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 994391e43daSPeter Zijlstra 995391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 996391e43daSPeter Zijlstra 997391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_time_avg; 998391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 999391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 1000391e43daSPeter Zijlstra 1001391e43daSPeter Zijlstra static inline u64 sched_avg_period(void) 1002391e43daSPeter Zijlstra { 1003391e43daSPeter Zijlstra return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; 1004391e43daSPeter Zijlstra } 1005391e43daSPeter Zijlstra 1006391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1007391e43daSPeter Zijlstra 1008391e43daSPeter Zijlstra /* 1009391e43daSPeter Zijlstra * Use hrtick when: 1010391e43daSPeter Zijlstra * - enabled by features 1011391e43daSPeter Zijlstra * - hrtimer is actually high res 1012391e43daSPeter Zijlstra */ 1013391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 1014391e43daSPeter Zijlstra { 1015391e43daSPeter Zijlstra if (!sched_feat(HRTICK)) 1016391e43daSPeter Zijlstra return 0; 1017391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 1018391e43daSPeter Zijlstra return 0; 1019391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 1020391e43daSPeter Zijlstra } 1021391e43daSPeter Zijlstra 1022391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 1023391e43daSPeter Zijlstra 1024b39e66eaSMike Galbraith #else 1025b39e66eaSMike Galbraith 1026b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 1027b39e66eaSMike Galbraith { 1028b39e66eaSMike Galbraith return 0; 1029b39e66eaSMike Galbraith } 1030b39e66eaSMike Galbraith 1031391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 1032391e43daSPeter Zijlstra 1033391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1034391e43daSPeter Zijlstra extern void sched_avg_update(struct rq *rq); 1035391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) 1036391e43daSPeter Zijlstra { 1037391e43daSPeter Zijlstra rq->rt_avg += rt_delta; 1038391e43daSPeter Zijlstra sched_avg_update(rq); 1039391e43daSPeter Zijlstra } 1040391e43daSPeter Zijlstra #else 1041391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) { } 1042391e43daSPeter Zijlstra static inline void sched_avg_update(struct rq *rq) { } 1043391e43daSPeter Zijlstra #endif 1044391e43daSPeter Zijlstra 1045391e43daSPeter Zijlstra extern void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period); 1046391e43daSPeter Zijlstra 1047391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1048391e43daSPeter Zijlstra #ifdef CONFIG_PREEMPT 1049391e43daSPeter Zijlstra 1050391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); 1051391e43daSPeter Zijlstra 1052391e43daSPeter Zijlstra /* 1053391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 1054391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 1055391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 1056391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 1057391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 1058391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 1059391e43daSPeter Zijlstra */ 1060391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1061391e43daSPeter Zijlstra __releases(this_rq->lock) 1062391e43daSPeter Zijlstra __acquires(busiest->lock) 1063391e43daSPeter Zijlstra __acquires(this_rq->lock) 1064391e43daSPeter Zijlstra { 1065391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1066391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 1067391e43daSPeter Zijlstra 1068391e43daSPeter Zijlstra return 1; 1069391e43daSPeter Zijlstra } 1070391e43daSPeter Zijlstra 1071391e43daSPeter Zijlstra #else 1072391e43daSPeter Zijlstra /* 1073391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 1074391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 1075391e43daSPeter Zijlstra * already in proper order on entry. This favors lower cpu-ids and will 1076391e43daSPeter Zijlstra * grant the double lock to lower cpus over higher ids under contention, 1077391e43daSPeter Zijlstra * regardless of entry order into the function. 1078391e43daSPeter Zijlstra */ 1079391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1080391e43daSPeter Zijlstra __releases(this_rq->lock) 1081391e43daSPeter Zijlstra __acquires(busiest->lock) 1082391e43daSPeter Zijlstra __acquires(this_rq->lock) 1083391e43daSPeter Zijlstra { 1084391e43daSPeter Zijlstra int ret = 0; 1085391e43daSPeter Zijlstra 1086391e43daSPeter Zijlstra if (unlikely(!raw_spin_trylock(&busiest->lock))) { 1087391e43daSPeter Zijlstra if (busiest < this_rq) { 1088391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1089391e43daSPeter Zijlstra raw_spin_lock(&busiest->lock); 1090391e43daSPeter Zijlstra raw_spin_lock_nested(&this_rq->lock, 1091391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1092391e43daSPeter Zijlstra ret = 1; 1093391e43daSPeter Zijlstra } else 1094391e43daSPeter Zijlstra raw_spin_lock_nested(&busiest->lock, 1095391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1096391e43daSPeter Zijlstra } 1097391e43daSPeter Zijlstra return ret; 1098391e43daSPeter Zijlstra } 1099391e43daSPeter Zijlstra 1100391e43daSPeter Zijlstra #endif /* CONFIG_PREEMPT */ 1101391e43daSPeter Zijlstra 1102391e43daSPeter Zijlstra /* 1103391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 1104391e43daSPeter Zijlstra */ 1105391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 1106391e43daSPeter Zijlstra { 1107391e43daSPeter Zijlstra if (unlikely(!irqs_disabled())) { 1108391e43daSPeter Zijlstra /* printk() doesn't work good under rq->lock */ 1109391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1110391e43daSPeter Zijlstra BUG_ON(1); 1111391e43daSPeter Zijlstra } 1112391e43daSPeter Zijlstra 1113391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 1114391e43daSPeter Zijlstra } 1115391e43daSPeter Zijlstra 1116391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 1117391e43daSPeter Zijlstra __releases(busiest->lock) 1118391e43daSPeter Zijlstra { 1119391e43daSPeter Zijlstra raw_spin_unlock(&busiest->lock); 1120391e43daSPeter Zijlstra lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); 1121391e43daSPeter Zijlstra } 1122391e43daSPeter Zijlstra 1123391e43daSPeter Zijlstra /* 1124391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1125391e43daSPeter Zijlstra * 1126391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1127391e43daSPeter Zijlstra * you need to do so manually before calling. 1128391e43daSPeter Zijlstra */ 1129391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1130391e43daSPeter Zijlstra __acquires(rq1->lock) 1131391e43daSPeter Zijlstra __acquires(rq2->lock) 1132391e43daSPeter Zijlstra { 1133391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1134391e43daSPeter Zijlstra if (rq1 == rq2) { 1135391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1136391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1137391e43daSPeter Zijlstra } else { 1138391e43daSPeter Zijlstra if (rq1 < rq2) { 1139391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1140391e43daSPeter Zijlstra raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); 1141391e43daSPeter Zijlstra } else { 1142391e43daSPeter Zijlstra raw_spin_lock(&rq2->lock); 1143391e43daSPeter Zijlstra raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); 1144391e43daSPeter Zijlstra } 1145391e43daSPeter Zijlstra } 1146391e43daSPeter Zijlstra } 1147391e43daSPeter Zijlstra 1148391e43daSPeter Zijlstra /* 1149391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1150391e43daSPeter Zijlstra * 1151391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1152391e43daSPeter Zijlstra * you need to do so manually after calling. 1153391e43daSPeter Zijlstra */ 1154391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1155391e43daSPeter Zijlstra __releases(rq1->lock) 1156391e43daSPeter Zijlstra __releases(rq2->lock) 1157391e43daSPeter Zijlstra { 1158391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1159391e43daSPeter Zijlstra if (rq1 != rq2) 1160391e43daSPeter Zijlstra raw_spin_unlock(&rq2->lock); 1161391e43daSPeter Zijlstra else 1162391e43daSPeter Zijlstra __release(rq2->lock); 1163391e43daSPeter Zijlstra } 1164391e43daSPeter Zijlstra 1165391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1166391e43daSPeter Zijlstra 1167391e43daSPeter Zijlstra /* 1168391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1169391e43daSPeter Zijlstra * 1170391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1171391e43daSPeter Zijlstra * you need to do so manually before calling. 1172391e43daSPeter Zijlstra */ 1173391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1174391e43daSPeter Zijlstra __acquires(rq1->lock) 1175391e43daSPeter Zijlstra __acquires(rq2->lock) 1176391e43daSPeter Zijlstra { 1177391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1178391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1179391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1180391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1181391e43daSPeter Zijlstra } 1182391e43daSPeter Zijlstra 1183391e43daSPeter Zijlstra /* 1184391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1185391e43daSPeter Zijlstra * 1186391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1187391e43daSPeter Zijlstra * you need to do so manually after calling. 1188391e43daSPeter Zijlstra */ 1189391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1190391e43daSPeter Zijlstra __releases(rq1->lock) 1191391e43daSPeter Zijlstra __releases(rq2->lock) 1192391e43daSPeter Zijlstra { 1193391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1194391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1195391e43daSPeter Zijlstra __release(rq2->lock); 1196391e43daSPeter Zijlstra } 1197391e43daSPeter Zijlstra 1198391e43daSPeter Zijlstra #endif 1199391e43daSPeter Zijlstra 1200391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 1201391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 1202391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 1203391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 1204391e43daSPeter Zijlstra 1205391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 1206391e43daSPeter Zijlstra extern void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq); 1207391e43daSPeter Zijlstra 1208391e43daSPeter Zijlstra extern void account_cfs_bandwidth_used(int enabled, int was_enabled); 12091c792db7SSuresh Siddha 12101c792db7SSuresh Siddha #ifdef CONFIG_NO_HZ 12111c792db7SSuresh Siddha enum rq_nohz_flag_bits { 12121c792db7SSuresh Siddha NOHZ_TICK_STOPPED, 12131c792db7SSuresh Siddha NOHZ_BALANCE_KICK, 121469e1e811SSuresh Siddha NOHZ_IDLE, 12151c792db7SSuresh Siddha }; 12161c792db7SSuresh Siddha 12171c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 12181c792db7SSuresh Siddha #endif 121973fbec60SFrederic Weisbecker 122073fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 122173fbec60SFrederic Weisbecker 122273fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_hardirq_time); 122373fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_softirq_time); 122473fbec60SFrederic Weisbecker 122573fbec60SFrederic Weisbecker #ifndef CONFIG_64BIT 122673fbec60SFrederic Weisbecker DECLARE_PER_CPU(seqcount_t, irq_time_seq); 122773fbec60SFrederic Weisbecker 122873fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 122973fbec60SFrederic Weisbecker { 123073fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 123173fbec60SFrederic Weisbecker smp_wmb(); 123273fbec60SFrederic Weisbecker } 123373fbec60SFrederic Weisbecker 123473fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 123573fbec60SFrederic Weisbecker { 123673fbec60SFrederic Weisbecker smp_wmb(); 123773fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 123873fbec60SFrederic Weisbecker } 123973fbec60SFrederic Weisbecker 124073fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 124173fbec60SFrederic Weisbecker { 124273fbec60SFrederic Weisbecker u64 irq_time; 124373fbec60SFrederic Weisbecker unsigned seq; 124473fbec60SFrederic Weisbecker 124573fbec60SFrederic Weisbecker do { 124673fbec60SFrederic Weisbecker seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu)); 124773fbec60SFrederic Weisbecker irq_time = per_cpu(cpu_softirq_time, cpu) + 124873fbec60SFrederic Weisbecker per_cpu(cpu_hardirq_time, cpu); 124973fbec60SFrederic Weisbecker } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq)); 125073fbec60SFrederic Weisbecker 125173fbec60SFrederic Weisbecker return irq_time; 125273fbec60SFrederic Weisbecker } 125373fbec60SFrederic Weisbecker #else /* CONFIG_64BIT */ 125473fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 125573fbec60SFrederic Weisbecker { 125673fbec60SFrederic Weisbecker } 125773fbec60SFrederic Weisbecker 125873fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 125973fbec60SFrederic Weisbecker { 126073fbec60SFrederic Weisbecker } 126173fbec60SFrederic Weisbecker 126273fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 126373fbec60SFrederic Weisbecker { 126473fbec60SFrederic Weisbecker return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu); 126573fbec60SFrederic Weisbecker } 126673fbec60SFrederic Weisbecker #endif /* CONFIG_64BIT */ 126773fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 1268