1391e43daSPeter Zijlstra 2391e43daSPeter Zijlstra #include <linux/sched.h> 3cf4aebc2SClark Williams #include <linux/sched/sysctl.h> 48bd75c77SClark Williams #include <linux/sched/rt.h> 5aab03e05SDario Faggioli #include <linux/sched/deadline.h> 6391e43daSPeter Zijlstra #include <linux/mutex.h> 7391e43daSPeter Zijlstra #include <linux/spinlock.h> 8391e43daSPeter Zijlstra #include <linux/stop_machine.h> 99f3660c2SFrederic Weisbecker #include <linux/tick.h> 10f809ca9aSMel Gorman #include <linux/slab.h> 11391e43daSPeter Zijlstra 12391e43daSPeter Zijlstra #include "cpupri.h" 1360fed789SLi Zefan #include "cpuacct.h" 14391e43daSPeter Zijlstra 1545ceebf7SPaul Gortmaker struct rq; 1645ceebf7SPaul Gortmaker 17391e43daSPeter Zijlstra extern __read_mostly int scheduler_running; 18391e43daSPeter Zijlstra 1945ceebf7SPaul Gortmaker extern unsigned long calc_load_update; 2045ceebf7SPaul Gortmaker extern atomic_long_t calc_load_tasks; 2145ceebf7SPaul Gortmaker 2245ceebf7SPaul Gortmaker extern long calc_load_fold_active(struct rq *this_rq); 2345ceebf7SPaul Gortmaker extern void update_cpu_load_active(struct rq *this_rq); 2445ceebf7SPaul Gortmaker 25391e43daSPeter Zijlstra /* 26391e43daSPeter Zijlstra * Convert user-nice values [ -20 ... 0 ... 19 ] 27391e43daSPeter Zijlstra * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ], 28391e43daSPeter Zijlstra * and back. 29391e43daSPeter Zijlstra */ 30391e43daSPeter Zijlstra #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20) 31391e43daSPeter Zijlstra #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20) 32391e43daSPeter Zijlstra #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio) 33391e43daSPeter Zijlstra 34391e43daSPeter Zijlstra /* 35391e43daSPeter Zijlstra * 'User priority' is the nice value converted to something we 36391e43daSPeter Zijlstra * can work with better when scaling various scheduler parameters, 37391e43daSPeter Zijlstra * it's a [ 0 ... 39 ] range. 38391e43daSPeter Zijlstra */ 39391e43daSPeter Zijlstra #define USER_PRIO(p) ((p)-MAX_RT_PRIO) 40391e43daSPeter Zijlstra #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio) 41391e43daSPeter Zijlstra #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO)) 42391e43daSPeter Zijlstra 43391e43daSPeter Zijlstra /* 44391e43daSPeter Zijlstra * Helpers for converting nanosecond timing to jiffy resolution 45391e43daSPeter Zijlstra */ 46391e43daSPeter Zijlstra #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) 47391e43daSPeter Zijlstra 48cc1f4b1fSLi Zefan /* 49cc1f4b1fSLi Zefan * Increase resolution of nice-level calculations for 64-bit architectures. 50cc1f4b1fSLi Zefan * The extra resolution improves shares distribution and load balancing of 51cc1f4b1fSLi Zefan * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup 52cc1f4b1fSLi Zefan * hierarchies, especially on larger systems. This is not a user-visible change 53cc1f4b1fSLi Zefan * and does not change the user-interface for setting shares/weights. 54cc1f4b1fSLi Zefan * 55cc1f4b1fSLi Zefan * We increase resolution only if we have enough bits to allow this increased 56cc1f4b1fSLi Zefan * resolution (i.e. BITS_PER_LONG > 32). The costs for increasing resolution 57cc1f4b1fSLi Zefan * when BITS_PER_LONG <= 32 are pretty high and the returns do not justify the 58cc1f4b1fSLi Zefan * increased costs. 59cc1f4b1fSLi Zefan */ 60cc1f4b1fSLi Zefan #if 0 /* BITS_PER_LONG > 32 -- currently broken: it increases power usage under light load */ 61cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 10 62cc1f4b1fSLi Zefan # define scale_load(w) ((w) << SCHED_LOAD_RESOLUTION) 63cc1f4b1fSLi Zefan # define scale_load_down(w) ((w) >> SCHED_LOAD_RESOLUTION) 64cc1f4b1fSLi Zefan #else 65cc1f4b1fSLi Zefan # define SCHED_LOAD_RESOLUTION 0 66cc1f4b1fSLi Zefan # define scale_load(w) (w) 67cc1f4b1fSLi Zefan # define scale_load_down(w) (w) 68cc1f4b1fSLi Zefan #endif 69cc1f4b1fSLi Zefan 70cc1f4b1fSLi Zefan #define SCHED_LOAD_SHIFT (10 + SCHED_LOAD_RESOLUTION) 71cc1f4b1fSLi Zefan #define SCHED_LOAD_SCALE (1L << SCHED_LOAD_SHIFT) 72cc1f4b1fSLi Zefan 73391e43daSPeter Zijlstra #define NICE_0_LOAD SCHED_LOAD_SCALE 74391e43daSPeter Zijlstra #define NICE_0_SHIFT SCHED_LOAD_SHIFT 75391e43daSPeter Zijlstra 76391e43daSPeter Zijlstra /* 77391e43daSPeter Zijlstra * These are the 'tuning knobs' of the scheduler: 78391e43daSPeter Zijlstra */ 79391e43daSPeter Zijlstra 80391e43daSPeter Zijlstra /* 81391e43daSPeter Zijlstra * single value that denotes runtime == period, ie unlimited time. 82391e43daSPeter Zijlstra */ 83391e43daSPeter Zijlstra #define RUNTIME_INF ((u64)~0ULL) 84391e43daSPeter Zijlstra 85d50dde5aSDario Faggioli static inline int fair_policy(int policy) 86d50dde5aSDario Faggioli { 87d50dde5aSDario Faggioli return policy == SCHED_NORMAL || policy == SCHED_BATCH; 88d50dde5aSDario Faggioli } 89d50dde5aSDario Faggioli 90391e43daSPeter Zijlstra static inline int rt_policy(int policy) 91391e43daSPeter Zijlstra { 92d50dde5aSDario Faggioli return policy == SCHED_FIFO || policy == SCHED_RR; 93391e43daSPeter Zijlstra } 94391e43daSPeter Zijlstra 95aab03e05SDario Faggioli static inline int dl_policy(int policy) 96aab03e05SDario Faggioli { 97aab03e05SDario Faggioli return policy == SCHED_DEADLINE; 98aab03e05SDario Faggioli } 99aab03e05SDario Faggioli 100391e43daSPeter Zijlstra static inline int task_has_rt_policy(struct task_struct *p) 101391e43daSPeter Zijlstra { 102391e43daSPeter Zijlstra return rt_policy(p->policy); 103391e43daSPeter Zijlstra } 104391e43daSPeter Zijlstra 105aab03e05SDario Faggioli static inline int task_has_dl_policy(struct task_struct *p) 106aab03e05SDario Faggioli { 107aab03e05SDario Faggioli return dl_policy(p->policy); 108aab03e05SDario Faggioli } 109aab03e05SDario Faggioli 1102d3d891dSDario Faggioli static inline int dl_time_before(u64 a, u64 b) 1112d3d891dSDario Faggioli { 1122d3d891dSDario Faggioli return (s64)(a - b) < 0; 1132d3d891dSDario Faggioli } 1142d3d891dSDario Faggioli 1152d3d891dSDario Faggioli /* 1162d3d891dSDario Faggioli * Tells if entity @a should preempt entity @b. 1172d3d891dSDario Faggioli */ 1182d3d891dSDario Faggioli static inline 1192d3d891dSDario Faggioli int dl_entity_preempt(struct sched_dl_entity *a, struct sched_dl_entity *b) 1202d3d891dSDario Faggioli { 1212d3d891dSDario Faggioli return dl_time_before(a->deadline, b->deadline); 1222d3d891dSDario Faggioli } 1232d3d891dSDario Faggioli 124391e43daSPeter Zijlstra /* 125391e43daSPeter Zijlstra * This is the priority-queue data structure of the RT scheduling class: 126391e43daSPeter Zijlstra */ 127391e43daSPeter Zijlstra struct rt_prio_array { 128391e43daSPeter Zijlstra DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ 129391e43daSPeter Zijlstra struct list_head queue[MAX_RT_PRIO]; 130391e43daSPeter Zijlstra }; 131391e43daSPeter Zijlstra 132391e43daSPeter Zijlstra struct rt_bandwidth { 133391e43daSPeter Zijlstra /* nests inside the rq lock: */ 134391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 135391e43daSPeter Zijlstra ktime_t rt_period; 136391e43daSPeter Zijlstra u64 rt_runtime; 137391e43daSPeter Zijlstra struct hrtimer rt_period_timer; 138391e43daSPeter Zijlstra }; 139391e43daSPeter Zijlstra 140391e43daSPeter Zijlstra extern struct mutex sched_domains_mutex; 141391e43daSPeter Zijlstra 142391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 143391e43daSPeter Zijlstra 144391e43daSPeter Zijlstra #include <linux/cgroup.h> 145391e43daSPeter Zijlstra 146391e43daSPeter Zijlstra struct cfs_rq; 147391e43daSPeter Zijlstra struct rt_rq; 148391e43daSPeter Zijlstra 14935cf4e50SMike Galbraith extern struct list_head task_groups; 150391e43daSPeter Zijlstra 151391e43daSPeter Zijlstra struct cfs_bandwidth { 152391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 153391e43daSPeter Zijlstra raw_spinlock_t lock; 154391e43daSPeter Zijlstra ktime_t period; 155391e43daSPeter Zijlstra u64 quota, runtime; 156391e43daSPeter Zijlstra s64 hierarchal_quota; 157391e43daSPeter Zijlstra u64 runtime_expires; 158391e43daSPeter Zijlstra 159391e43daSPeter Zijlstra int idle, timer_active; 160391e43daSPeter Zijlstra struct hrtimer period_timer, slack_timer; 161391e43daSPeter Zijlstra struct list_head throttled_cfs_rq; 162391e43daSPeter Zijlstra 163391e43daSPeter Zijlstra /* statistics */ 164391e43daSPeter Zijlstra int nr_periods, nr_throttled; 165391e43daSPeter Zijlstra u64 throttled_time; 166391e43daSPeter Zijlstra #endif 167391e43daSPeter Zijlstra }; 168391e43daSPeter Zijlstra 169391e43daSPeter Zijlstra /* task group related information */ 170391e43daSPeter Zijlstra struct task_group { 171391e43daSPeter Zijlstra struct cgroup_subsys_state css; 172391e43daSPeter Zijlstra 173391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 174391e43daSPeter Zijlstra /* schedulable entities of this group on each cpu */ 175391e43daSPeter Zijlstra struct sched_entity **se; 176391e43daSPeter Zijlstra /* runqueue "owned" by this group on each cpu */ 177391e43daSPeter Zijlstra struct cfs_rq **cfs_rq; 178391e43daSPeter Zijlstra unsigned long shares; 179391e43daSPeter Zijlstra 180fa6bddebSAlex Shi #ifdef CONFIG_SMP 181bf5b986eSAlex Shi atomic_long_t load_avg; 182bb17f655SPaul Turner atomic_t runnable_avg; 183391e43daSPeter Zijlstra #endif 184fa6bddebSAlex Shi #endif 185391e43daSPeter Zijlstra 186391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 187391e43daSPeter Zijlstra struct sched_rt_entity **rt_se; 188391e43daSPeter Zijlstra struct rt_rq **rt_rq; 189391e43daSPeter Zijlstra 190391e43daSPeter Zijlstra struct rt_bandwidth rt_bandwidth; 191391e43daSPeter Zijlstra #endif 192391e43daSPeter Zijlstra 193391e43daSPeter Zijlstra struct rcu_head rcu; 194391e43daSPeter Zijlstra struct list_head list; 195391e43daSPeter Zijlstra 196391e43daSPeter Zijlstra struct task_group *parent; 197391e43daSPeter Zijlstra struct list_head siblings; 198391e43daSPeter Zijlstra struct list_head children; 199391e43daSPeter Zijlstra 200391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_AUTOGROUP 201391e43daSPeter Zijlstra struct autogroup *autogroup; 202391e43daSPeter Zijlstra #endif 203391e43daSPeter Zijlstra 204391e43daSPeter Zijlstra struct cfs_bandwidth cfs_bandwidth; 205391e43daSPeter Zijlstra }; 206391e43daSPeter Zijlstra 207391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 208391e43daSPeter Zijlstra #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD 209391e43daSPeter Zijlstra 210391e43daSPeter Zijlstra /* 211391e43daSPeter Zijlstra * A weight of 0 or 1 can cause arithmetics problems. 212391e43daSPeter Zijlstra * A weight of a cfs_rq is the sum of weights of which entities 213391e43daSPeter Zijlstra * are queued on this cfs_rq, so a weight of a entity should not be 214391e43daSPeter Zijlstra * too large, so as the shares value of a task group. 215391e43daSPeter Zijlstra * (The default weight is 1024 - so there's no practical 216391e43daSPeter Zijlstra * limitation from this.) 217391e43daSPeter Zijlstra */ 218391e43daSPeter Zijlstra #define MIN_SHARES (1UL << 1) 219391e43daSPeter Zijlstra #define MAX_SHARES (1UL << 18) 220391e43daSPeter Zijlstra #endif 221391e43daSPeter Zijlstra 222391e43daSPeter Zijlstra typedef int (*tg_visitor)(struct task_group *, void *); 223391e43daSPeter Zijlstra 224391e43daSPeter Zijlstra extern int walk_tg_tree_from(struct task_group *from, 225391e43daSPeter Zijlstra tg_visitor down, tg_visitor up, void *data); 226391e43daSPeter Zijlstra 227391e43daSPeter Zijlstra /* 228391e43daSPeter Zijlstra * Iterate the full tree, calling @down when first entering a node and @up when 229391e43daSPeter Zijlstra * leaving it for the final time. 230391e43daSPeter Zijlstra * 231391e43daSPeter Zijlstra * Caller must hold rcu_lock or sufficient equivalent. 232391e43daSPeter Zijlstra */ 233391e43daSPeter Zijlstra static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) 234391e43daSPeter Zijlstra { 235391e43daSPeter Zijlstra return walk_tg_tree_from(&root_task_group, down, up, data); 236391e43daSPeter Zijlstra } 237391e43daSPeter Zijlstra 238391e43daSPeter Zijlstra extern int tg_nop(struct task_group *tg, void *data); 239391e43daSPeter Zijlstra 240391e43daSPeter Zijlstra extern void free_fair_sched_group(struct task_group *tg); 241391e43daSPeter Zijlstra extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); 242391e43daSPeter Zijlstra extern void unregister_fair_sched_group(struct task_group *tg, int cpu); 243391e43daSPeter Zijlstra extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, 244391e43daSPeter Zijlstra struct sched_entity *se, int cpu, 245391e43daSPeter Zijlstra struct sched_entity *parent); 246391e43daSPeter Zijlstra extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 247391e43daSPeter Zijlstra extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 248391e43daSPeter Zijlstra 249391e43daSPeter Zijlstra extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); 250391e43daSPeter Zijlstra extern void __start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); 251391e43daSPeter Zijlstra extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); 252391e43daSPeter Zijlstra 253391e43daSPeter Zijlstra extern void free_rt_sched_group(struct task_group *tg); 254391e43daSPeter Zijlstra extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); 255391e43daSPeter Zijlstra extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, 256391e43daSPeter Zijlstra struct sched_rt_entity *rt_se, int cpu, 257391e43daSPeter Zijlstra struct sched_rt_entity *parent); 258391e43daSPeter Zijlstra 25925cc7da7SLi Zefan extern struct task_group *sched_create_group(struct task_group *parent); 26025cc7da7SLi Zefan extern void sched_online_group(struct task_group *tg, 26125cc7da7SLi Zefan struct task_group *parent); 26225cc7da7SLi Zefan extern void sched_destroy_group(struct task_group *tg); 26325cc7da7SLi Zefan extern void sched_offline_group(struct task_group *tg); 26425cc7da7SLi Zefan 26525cc7da7SLi Zefan extern void sched_move_task(struct task_struct *tsk); 26625cc7da7SLi Zefan 26725cc7da7SLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 26825cc7da7SLi Zefan extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); 26925cc7da7SLi Zefan #endif 27025cc7da7SLi Zefan 271391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 272391e43daSPeter Zijlstra 273391e43daSPeter Zijlstra struct cfs_bandwidth { }; 274391e43daSPeter Zijlstra 275391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 276391e43daSPeter Zijlstra 277391e43daSPeter Zijlstra /* CFS-related fields in a runqueue */ 278391e43daSPeter Zijlstra struct cfs_rq { 279391e43daSPeter Zijlstra struct load_weight load; 280c82513e5SPeter Zijlstra unsigned int nr_running, h_nr_running; 281391e43daSPeter Zijlstra 282391e43daSPeter Zijlstra u64 exec_clock; 283391e43daSPeter Zijlstra u64 min_vruntime; 284391e43daSPeter Zijlstra #ifndef CONFIG_64BIT 285391e43daSPeter Zijlstra u64 min_vruntime_copy; 286391e43daSPeter Zijlstra #endif 287391e43daSPeter Zijlstra 288391e43daSPeter Zijlstra struct rb_root tasks_timeline; 289391e43daSPeter Zijlstra struct rb_node *rb_leftmost; 290391e43daSPeter Zijlstra 291391e43daSPeter Zijlstra /* 292391e43daSPeter Zijlstra * 'curr' points to currently running entity on this cfs_rq. 293391e43daSPeter Zijlstra * It is set to NULL otherwise (i.e when none are currently running). 294391e43daSPeter Zijlstra */ 295391e43daSPeter Zijlstra struct sched_entity *curr, *next, *last, *skip; 296391e43daSPeter Zijlstra 297391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 298391e43daSPeter Zijlstra unsigned int nr_spread_over; 299391e43daSPeter Zijlstra #endif 300391e43daSPeter Zijlstra 3012dac754eSPaul Turner #ifdef CONFIG_SMP 3022dac754eSPaul Turner /* 3032dac754eSPaul Turner * CFS Load tracking 3042dac754eSPaul Turner * Under CFS, load is tracked on a per-entity basis and aggregated up. 3052dac754eSPaul Turner * This allows for the description of both thread and group usage (in 3062dac754eSPaul Turner * the FAIR_GROUP_SCHED case). 3072dac754eSPaul Turner */ 30872a4cf20SAlex Shi unsigned long runnable_load_avg, blocked_load_avg; 3092509940fSAlex Shi atomic64_t decay_counter; 3109ee474f5SPaul Turner u64 last_decay; 3112509940fSAlex Shi atomic_long_t removed_load; 312141965c7SAlex Shi 313c566e8e9SPaul Turner #ifdef CONFIG_FAIR_GROUP_SCHED 314141965c7SAlex Shi /* Required to track per-cpu representation of a task_group */ 315bb17f655SPaul Turner u32 tg_runnable_contrib; 316bf5b986eSAlex Shi unsigned long tg_load_contrib; 31782958366SPaul Turner 31882958366SPaul Turner /* 31982958366SPaul Turner * h_load = weight * f(tg) 32082958366SPaul Turner * 32182958366SPaul Turner * Where f(tg) is the recursive weight fraction assigned to 32282958366SPaul Turner * this group. 32382958366SPaul Turner */ 32482958366SPaul Turner unsigned long h_load; 32568520796SVladimir Davydov u64 last_h_load_update; 32668520796SVladimir Davydov struct sched_entity *h_load_next; 32768520796SVladimir Davydov #endif /* CONFIG_FAIR_GROUP_SCHED */ 32882958366SPaul Turner #endif /* CONFIG_SMP */ 32982958366SPaul Turner 330391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 331391e43daSPeter Zijlstra struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */ 332391e43daSPeter Zijlstra 333391e43daSPeter Zijlstra /* 334391e43daSPeter Zijlstra * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in 335391e43daSPeter Zijlstra * a hierarchy). Non-leaf lrqs hold other higher schedulable entities 336391e43daSPeter Zijlstra * (like users, containers etc.) 337391e43daSPeter Zijlstra * 338391e43daSPeter Zijlstra * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This 339391e43daSPeter Zijlstra * list is used during load balance. 340391e43daSPeter Zijlstra */ 341391e43daSPeter Zijlstra int on_list; 342391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 343391e43daSPeter Zijlstra struct task_group *tg; /* group that "owns" this runqueue */ 344391e43daSPeter Zijlstra 345391e43daSPeter Zijlstra #ifdef CONFIG_CFS_BANDWIDTH 346391e43daSPeter Zijlstra int runtime_enabled; 347391e43daSPeter Zijlstra u64 runtime_expires; 348391e43daSPeter Zijlstra s64 runtime_remaining; 349391e43daSPeter Zijlstra 350f1b17280SPaul Turner u64 throttled_clock, throttled_clock_task; 351f1b17280SPaul Turner u64 throttled_clock_task_time; 352391e43daSPeter Zijlstra int throttled, throttle_count; 353391e43daSPeter Zijlstra struct list_head throttled_list; 354391e43daSPeter Zijlstra #endif /* CONFIG_CFS_BANDWIDTH */ 355391e43daSPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 356391e43daSPeter Zijlstra }; 357391e43daSPeter Zijlstra 358391e43daSPeter Zijlstra static inline int rt_bandwidth_enabled(void) 359391e43daSPeter Zijlstra { 360391e43daSPeter Zijlstra return sysctl_sched_rt_runtime >= 0; 361391e43daSPeter Zijlstra } 362391e43daSPeter Zijlstra 363391e43daSPeter Zijlstra /* Real-Time classes' related field in a runqueue: */ 364391e43daSPeter Zijlstra struct rt_rq { 365391e43daSPeter Zijlstra struct rt_prio_array active; 366c82513e5SPeter Zijlstra unsigned int rt_nr_running; 367391e43daSPeter Zijlstra #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED 368391e43daSPeter Zijlstra struct { 369391e43daSPeter Zijlstra int curr; /* highest queued rt task prio */ 370391e43daSPeter Zijlstra #ifdef CONFIG_SMP 371391e43daSPeter Zijlstra int next; /* next highest */ 372391e43daSPeter Zijlstra #endif 373391e43daSPeter Zijlstra } highest_prio; 374391e43daSPeter Zijlstra #endif 375391e43daSPeter Zijlstra #ifdef CONFIG_SMP 376391e43daSPeter Zijlstra unsigned long rt_nr_migratory; 377391e43daSPeter Zijlstra unsigned long rt_nr_total; 378391e43daSPeter Zijlstra int overloaded; 379391e43daSPeter Zijlstra struct plist_head pushable_tasks; 380391e43daSPeter Zijlstra #endif 381391e43daSPeter Zijlstra int rt_throttled; 382391e43daSPeter Zijlstra u64 rt_time; 383391e43daSPeter Zijlstra u64 rt_runtime; 384391e43daSPeter Zijlstra /* Nests inside the rq lock: */ 385391e43daSPeter Zijlstra raw_spinlock_t rt_runtime_lock; 386391e43daSPeter Zijlstra 387391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 388391e43daSPeter Zijlstra unsigned long rt_nr_boosted; 389391e43daSPeter Zijlstra 390391e43daSPeter Zijlstra struct rq *rq; 391391e43daSPeter Zijlstra struct task_group *tg; 392391e43daSPeter Zijlstra #endif 393391e43daSPeter Zijlstra }; 394391e43daSPeter Zijlstra 395aab03e05SDario Faggioli /* Deadline class' related fields in a runqueue */ 396aab03e05SDario Faggioli struct dl_rq { 397aab03e05SDario Faggioli /* runqueue is an rbtree, ordered by deadline */ 398aab03e05SDario Faggioli struct rb_root rb_root; 399aab03e05SDario Faggioli struct rb_node *rb_leftmost; 400aab03e05SDario Faggioli 401aab03e05SDario Faggioli unsigned long dl_nr_running; 4021baca4ceSJuri Lelli 4031baca4ceSJuri Lelli #ifdef CONFIG_SMP 4041baca4ceSJuri Lelli /* 4051baca4ceSJuri Lelli * Deadline values of the currently executing and the 4061baca4ceSJuri Lelli * earliest ready task on this rq. Caching these facilitates 4071baca4ceSJuri Lelli * the decision wether or not a ready but not running task 4081baca4ceSJuri Lelli * should migrate somewhere else. 4091baca4ceSJuri Lelli */ 4101baca4ceSJuri Lelli struct { 4111baca4ceSJuri Lelli u64 curr; 4121baca4ceSJuri Lelli u64 next; 4131baca4ceSJuri Lelli } earliest_dl; 4141baca4ceSJuri Lelli 4151baca4ceSJuri Lelli unsigned long dl_nr_migratory; 4161baca4ceSJuri Lelli unsigned long dl_nr_total; 4171baca4ceSJuri Lelli int overloaded; 4181baca4ceSJuri Lelli 4191baca4ceSJuri Lelli /* 4201baca4ceSJuri Lelli * Tasks on this rq that can be pushed away. They are kept in 4211baca4ceSJuri Lelli * an rb-tree, ordered by tasks' deadlines, with caching 4221baca4ceSJuri Lelli * of the leftmost (earliest deadline) element. 4231baca4ceSJuri Lelli */ 4241baca4ceSJuri Lelli struct rb_root pushable_dl_tasks_root; 4251baca4ceSJuri Lelli struct rb_node *pushable_dl_tasks_leftmost; 4261baca4ceSJuri Lelli #endif 427aab03e05SDario Faggioli }; 428aab03e05SDario Faggioli 429391e43daSPeter Zijlstra #ifdef CONFIG_SMP 430391e43daSPeter Zijlstra 431391e43daSPeter Zijlstra /* 432391e43daSPeter Zijlstra * We add the notion of a root-domain which will be used to define per-domain 433391e43daSPeter Zijlstra * variables. Each exclusive cpuset essentially defines an island domain by 434391e43daSPeter Zijlstra * fully partitioning the member cpus from any other cpuset. Whenever a new 435391e43daSPeter Zijlstra * exclusive cpuset is created, we also create and attach a new root-domain 436391e43daSPeter Zijlstra * object. 437391e43daSPeter Zijlstra * 438391e43daSPeter Zijlstra */ 439391e43daSPeter Zijlstra struct root_domain { 440391e43daSPeter Zijlstra atomic_t refcount; 441391e43daSPeter Zijlstra atomic_t rto_count; 442391e43daSPeter Zijlstra struct rcu_head rcu; 443391e43daSPeter Zijlstra cpumask_var_t span; 444391e43daSPeter Zijlstra cpumask_var_t online; 445391e43daSPeter Zijlstra 446391e43daSPeter Zijlstra /* 4471baca4ceSJuri Lelli * The bit corresponding to a CPU gets set here if such CPU has more 4481baca4ceSJuri Lelli * than one runnable -deadline task (as it is below for RT tasks). 4491baca4ceSJuri Lelli */ 4501baca4ceSJuri Lelli cpumask_var_t dlo_mask; 4511baca4ceSJuri Lelli atomic_t dlo_count; 4521baca4ceSJuri Lelli 4531baca4ceSJuri Lelli /* 454391e43daSPeter Zijlstra * The "RT overload" flag: it gets set if a CPU has more than 455391e43daSPeter Zijlstra * one runnable RT task. 456391e43daSPeter Zijlstra */ 457391e43daSPeter Zijlstra cpumask_var_t rto_mask; 458391e43daSPeter Zijlstra struct cpupri cpupri; 459391e43daSPeter Zijlstra }; 460391e43daSPeter Zijlstra 461391e43daSPeter Zijlstra extern struct root_domain def_root_domain; 462391e43daSPeter Zijlstra 463391e43daSPeter Zijlstra #endif /* CONFIG_SMP */ 464391e43daSPeter Zijlstra 465391e43daSPeter Zijlstra /* 466391e43daSPeter Zijlstra * This is the main, per-CPU runqueue data structure. 467391e43daSPeter Zijlstra * 468391e43daSPeter Zijlstra * Locking rule: those places that want to lock multiple runqueues 469391e43daSPeter Zijlstra * (such as the load balancing or the thread migration code), lock 470391e43daSPeter Zijlstra * acquire operations must be ordered by ascending &runqueue. 471391e43daSPeter Zijlstra */ 472391e43daSPeter Zijlstra struct rq { 473391e43daSPeter Zijlstra /* runqueue lock: */ 474391e43daSPeter Zijlstra raw_spinlock_t lock; 475391e43daSPeter Zijlstra 476391e43daSPeter Zijlstra /* 477391e43daSPeter Zijlstra * nr_running and cpu_load should be in the same cacheline because 478391e43daSPeter Zijlstra * remote CPUs use both these fields when doing load calculation. 479391e43daSPeter Zijlstra */ 480c82513e5SPeter Zijlstra unsigned int nr_running; 4810ec8aa00SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 4820ec8aa00SPeter Zijlstra unsigned int nr_numa_running; 4830ec8aa00SPeter Zijlstra unsigned int nr_preferred_running; 4840ec8aa00SPeter Zijlstra #endif 485391e43daSPeter Zijlstra #define CPU_LOAD_IDX_MAX 5 486391e43daSPeter Zijlstra unsigned long cpu_load[CPU_LOAD_IDX_MAX]; 487391e43daSPeter Zijlstra unsigned long last_load_update_tick; 4883451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 489391e43daSPeter Zijlstra u64 nohz_stamp; 4901c792db7SSuresh Siddha unsigned long nohz_flags; 491391e43daSPeter Zijlstra #endif 492265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 493265f22a9SFrederic Weisbecker unsigned long last_sched_tick; 494265f22a9SFrederic Weisbecker #endif 495391e43daSPeter Zijlstra int skip_clock_update; 496391e43daSPeter Zijlstra 497391e43daSPeter Zijlstra /* capture load from *all* tasks on this cpu: */ 498391e43daSPeter Zijlstra struct load_weight load; 499391e43daSPeter Zijlstra unsigned long nr_load_updates; 500391e43daSPeter Zijlstra u64 nr_switches; 501391e43daSPeter Zijlstra 502391e43daSPeter Zijlstra struct cfs_rq cfs; 503391e43daSPeter Zijlstra struct rt_rq rt; 504aab03e05SDario Faggioli struct dl_rq dl; 505391e43daSPeter Zijlstra 506391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 507391e43daSPeter Zijlstra /* list of leaf cfs_rq on this cpu: */ 508391e43daSPeter Zijlstra struct list_head leaf_cfs_rq_list; 509a35b6466SPeter Zijlstra #endif /* CONFIG_FAIR_GROUP_SCHED */ 510a35b6466SPeter Zijlstra 511391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 512391e43daSPeter Zijlstra struct list_head leaf_rt_rq_list; 513391e43daSPeter Zijlstra #endif 514391e43daSPeter Zijlstra 515391e43daSPeter Zijlstra /* 516391e43daSPeter Zijlstra * This is part of a global counter where only the total sum 517391e43daSPeter Zijlstra * over all CPUs matters. A task can increase this counter on 518391e43daSPeter Zijlstra * one CPU and if it got migrated afterwards it may decrease 519391e43daSPeter Zijlstra * it on another CPU. Always updated under the runqueue lock: 520391e43daSPeter Zijlstra */ 521391e43daSPeter Zijlstra unsigned long nr_uninterruptible; 522391e43daSPeter Zijlstra 523391e43daSPeter Zijlstra struct task_struct *curr, *idle, *stop; 524391e43daSPeter Zijlstra unsigned long next_balance; 525391e43daSPeter Zijlstra struct mm_struct *prev_mm; 526391e43daSPeter Zijlstra 527391e43daSPeter Zijlstra u64 clock; 528391e43daSPeter Zijlstra u64 clock_task; 529391e43daSPeter Zijlstra 530391e43daSPeter Zijlstra atomic_t nr_iowait; 531391e43daSPeter Zijlstra 532391e43daSPeter Zijlstra #ifdef CONFIG_SMP 533391e43daSPeter Zijlstra struct root_domain *rd; 534391e43daSPeter Zijlstra struct sched_domain *sd; 535391e43daSPeter Zijlstra 536391e43daSPeter Zijlstra unsigned long cpu_power; 537391e43daSPeter Zijlstra 538391e43daSPeter Zijlstra unsigned char idle_balance; 539391e43daSPeter Zijlstra /* For active balancing */ 540391e43daSPeter Zijlstra int post_schedule; 541391e43daSPeter Zijlstra int active_balance; 542391e43daSPeter Zijlstra int push_cpu; 543391e43daSPeter Zijlstra struct cpu_stop_work active_balance_work; 544391e43daSPeter Zijlstra /* cpu of this runqueue: */ 545391e43daSPeter Zijlstra int cpu; 546391e43daSPeter Zijlstra int online; 547391e43daSPeter Zijlstra 548367456c7SPeter Zijlstra struct list_head cfs_tasks; 549367456c7SPeter Zijlstra 550391e43daSPeter Zijlstra u64 rt_avg; 551391e43daSPeter Zijlstra u64 age_stamp; 552391e43daSPeter Zijlstra u64 idle_stamp; 553391e43daSPeter Zijlstra u64 avg_idle; 5549bd721c5SJason Low 5559bd721c5SJason Low /* This is used to determine avg_idle's max value */ 5569bd721c5SJason Low u64 max_idle_balance_cost; 557391e43daSPeter Zijlstra #endif 558391e43daSPeter Zijlstra 559391e43daSPeter Zijlstra #ifdef CONFIG_IRQ_TIME_ACCOUNTING 560391e43daSPeter Zijlstra u64 prev_irq_time; 561391e43daSPeter Zijlstra #endif 562391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT 563391e43daSPeter Zijlstra u64 prev_steal_time; 564391e43daSPeter Zijlstra #endif 565391e43daSPeter Zijlstra #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING 566391e43daSPeter Zijlstra u64 prev_steal_time_rq; 567391e43daSPeter Zijlstra #endif 568391e43daSPeter Zijlstra 569391e43daSPeter Zijlstra /* calc_load related fields */ 570391e43daSPeter Zijlstra unsigned long calc_load_update; 571391e43daSPeter Zijlstra long calc_load_active; 572391e43daSPeter Zijlstra 573391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 574391e43daSPeter Zijlstra #ifdef CONFIG_SMP 575391e43daSPeter Zijlstra int hrtick_csd_pending; 576391e43daSPeter Zijlstra struct call_single_data hrtick_csd; 577391e43daSPeter Zijlstra #endif 578391e43daSPeter Zijlstra struct hrtimer hrtick_timer; 579391e43daSPeter Zijlstra #endif 580391e43daSPeter Zijlstra 581391e43daSPeter Zijlstra #ifdef CONFIG_SCHEDSTATS 582391e43daSPeter Zijlstra /* latency stats */ 583391e43daSPeter Zijlstra struct sched_info rq_sched_info; 584391e43daSPeter Zijlstra unsigned long long rq_cpu_time; 585391e43daSPeter Zijlstra /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ 586391e43daSPeter Zijlstra 587391e43daSPeter Zijlstra /* sys_sched_yield() stats */ 588391e43daSPeter Zijlstra unsigned int yld_count; 589391e43daSPeter Zijlstra 590391e43daSPeter Zijlstra /* schedule() stats */ 591391e43daSPeter Zijlstra unsigned int sched_count; 592391e43daSPeter Zijlstra unsigned int sched_goidle; 593391e43daSPeter Zijlstra 594391e43daSPeter Zijlstra /* try_to_wake_up() stats */ 595391e43daSPeter Zijlstra unsigned int ttwu_count; 596391e43daSPeter Zijlstra unsigned int ttwu_local; 597391e43daSPeter Zijlstra #endif 598391e43daSPeter Zijlstra 599391e43daSPeter Zijlstra #ifdef CONFIG_SMP 600391e43daSPeter Zijlstra struct llist_head wake_list; 601391e43daSPeter Zijlstra #endif 60218bf2805SBen Segall 60318bf2805SBen Segall struct sched_avg avg; 604391e43daSPeter Zijlstra }; 605391e43daSPeter Zijlstra 606391e43daSPeter Zijlstra static inline int cpu_of(struct rq *rq) 607391e43daSPeter Zijlstra { 608391e43daSPeter Zijlstra #ifdef CONFIG_SMP 609391e43daSPeter Zijlstra return rq->cpu; 610391e43daSPeter Zijlstra #else 611391e43daSPeter Zijlstra return 0; 612391e43daSPeter Zijlstra #endif 613391e43daSPeter Zijlstra } 614391e43daSPeter Zijlstra 615391e43daSPeter Zijlstra DECLARE_PER_CPU(struct rq, runqueues); 616391e43daSPeter Zijlstra 617518cd623SPeter Zijlstra #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) 618518cd623SPeter Zijlstra #define this_rq() (&__get_cpu_var(runqueues)) 619518cd623SPeter Zijlstra #define task_rq(p) cpu_rq(task_cpu(p)) 620518cd623SPeter Zijlstra #define cpu_curr(cpu) (cpu_rq(cpu)->curr) 621518cd623SPeter Zijlstra #define raw_rq() (&__raw_get_cpu_var(runqueues)) 622518cd623SPeter Zijlstra 62378becc27SFrederic Weisbecker static inline u64 rq_clock(struct rq *rq) 62478becc27SFrederic Weisbecker { 62578becc27SFrederic Weisbecker return rq->clock; 62678becc27SFrederic Weisbecker } 62778becc27SFrederic Weisbecker 62878becc27SFrederic Weisbecker static inline u64 rq_clock_task(struct rq *rq) 62978becc27SFrederic Weisbecker { 63078becc27SFrederic Weisbecker return rq->clock_task; 63178becc27SFrederic Weisbecker } 63278becc27SFrederic Weisbecker 633f809ca9aSMel Gorman #ifdef CONFIG_NUMA_BALANCING 6340ec8aa00SPeter Zijlstra extern void sched_setnuma(struct task_struct *p, int node); 635e6628d5bSMel Gorman extern int migrate_task_to(struct task_struct *p, int cpu); 636ac66f547SPeter Zijlstra extern int migrate_swap(struct task_struct *, struct task_struct *); 637f809ca9aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 638f809ca9aSMel Gorman 639518cd623SPeter Zijlstra #ifdef CONFIG_SMP 640518cd623SPeter Zijlstra 641391e43daSPeter Zijlstra #define rcu_dereference_check_sched_domain(p) \ 642391e43daSPeter Zijlstra rcu_dereference_check((p), \ 643391e43daSPeter Zijlstra lockdep_is_held(&sched_domains_mutex)) 644391e43daSPeter Zijlstra 645391e43daSPeter Zijlstra /* 646391e43daSPeter Zijlstra * The domain tree (rq->sd) is protected by RCU's quiescent state transition. 647391e43daSPeter Zijlstra * See detach_destroy_domains: synchronize_sched for details. 648391e43daSPeter Zijlstra * 649391e43daSPeter Zijlstra * The domain tree of any CPU may only be accessed from within 650391e43daSPeter Zijlstra * preempt-disabled sections. 651391e43daSPeter Zijlstra */ 652391e43daSPeter Zijlstra #define for_each_domain(cpu, __sd) \ 653518cd623SPeter Zijlstra for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ 654518cd623SPeter Zijlstra __sd; __sd = __sd->parent) 655391e43daSPeter Zijlstra 65677e81365SSuresh Siddha #define for_each_lower_domain(sd) for (; sd; sd = sd->child) 65777e81365SSuresh Siddha 658518cd623SPeter Zijlstra /** 659518cd623SPeter Zijlstra * highest_flag_domain - Return highest sched_domain containing flag. 660518cd623SPeter Zijlstra * @cpu: The cpu whose highest level of sched domain is to 661518cd623SPeter Zijlstra * be returned. 662518cd623SPeter Zijlstra * @flag: The flag to check for the highest sched_domain 663518cd623SPeter Zijlstra * for the given cpu. 664518cd623SPeter Zijlstra * 665518cd623SPeter Zijlstra * Returns the highest sched_domain of a cpu which contains the given flag. 666518cd623SPeter Zijlstra */ 667518cd623SPeter Zijlstra static inline struct sched_domain *highest_flag_domain(int cpu, int flag) 668518cd623SPeter Zijlstra { 669518cd623SPeter Zijlstra struct sched_domain *sd, *hsd = NULL; 670518cd623SPeter Zijlstra 671518cd623SPeter Zijlstra for_each_domain(cpu, sd) { 672518cd623SPeter Zijlstra if (!(sd->flags & flag)) 673518cd623SPeter Zijlstra break; 674518cd623SPeter Zijlstra hsd = sd; 675518cd623SPeter Zijlstra } 676518cd623SPeter Zijlstra 677518cd623SPeter Zijlstra return hsd; 678518cd623SPeter Zijlstra } 679518cd623SPeter Zijlstra 680fb13c7eeSMel Gorman static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) 681fb13c7eeSMel Gorman { 682fb13c7eeSMel Gorman struct sched_domain *sd; 683fb13c7eeSMel Gorman 684fb13c7eeSMel Gorman for_each_domain(cpu, sd) { 685fb13c7eeSMel Gorman if (sd->flags & flag) 686fb13c7eeSMel Gorman break; 687fb13c7eeSMel Gorman } 688fb13c7eeSMel Gorman 689fb13c7eeSMel Gorman return sd; 690fb13c7eeSMel Gorman } 691fb13c7eeSMel Gorman 692518cd623SPeter Zijlstra DECLARE_PER_CPU(struct sched_domain *, sd_llc); 6937d9ffa89SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_size); 694518cd623SPeter Zijlstra DECLARE_PER_CPU(int, sd_llc_id); 695fb13c7eeSMel Gorman DECLARE_PER_CPU(struct sched_domain *, sd_numa); 69637dc6b50SPreeti U Murthy DECLARE_PER_CPU(struct sched_domain *, sd_busy); 69737dc6b50SPreeti U Murthy DECLARE_PER_CPU(struct sched_domain *, sd_asym); 698518cd623SPeter Zijlstra 6995e6521eaSLi Zefan struct sched_group_power { 7005e6521eaSLi Zefan atomic_t ref; 7015e6521eaSLi Zefan /* 7025e6521eaSLi Zefan * CPU power of this group, SCHED_LOAD_SCALE being max power for a 7035e6521eaSLi Zefan * single CPU. 7045e6521eaSLi Zefan */ 7055e6521eaSLi Zefan unsigned int power, power_orig; 7065e6521eaSLi Zefan unsigned long next_update; 7076263322cSPeter Zijlstra int imbalance; /* XXX unrelated to power but shared group state */ 7085e6521eaSLi Zefan /* 7095e6521eaSLi Zefan * Number of busy cpus in this group. 7105e6521eaSLi Zefan */ 7115e6521eaSLi Zefan atomic_t nr_busy_cpus; 7125e6521eaSLi Zefan 7135e6521eaSLi Zefan unsigned long cpumask[0]; /* iteration mask */ 7145e6521eaSLi Zefan }; 7155e6521eaSLi Zefan 7165e6521eaSLi Zefan struct sched_group { 7175e6521eaSLi Zefan struct sched_group *next; /* Must be a circular list */ 7185e6521eaSLi Zefan atomic_t ref; 7195e6521eaSLi Zefan 7205e6521eaSLi Zefan unsigned int group_weight; 7215e6521eaSLi Zefan struct sched_group_power *sgp; 7225e6521eaSLi Zefan 7235e6521eaSLi Zefan /* 7245e6521eaSLi Zefan * The CPUs this group covers. 7255e6521eaSLi Zefan * 7265e6521eaSLi Zefan * NOTE: this field is variable length. (Allocated dynamically 7275e6521eaSLi Zefan * by attaching extra space to the end of the structure, 7285e6521eaSLi Zefan * depending on how many CPUs the kernel has booted up with) 7295e6521eaSLi Zefan */ 7305e6521eaSLi Zefan unsigned long cpumask[0]; 7315e6521eaSLi Zefan }; 7325e6521eaSLi Zefan 7335e6521eaSLi Zefan static inline struct cpumask *sched_group_cpus(struct sched_group *sg) 7345e6521eaSLi Zefan { 7355e6521eaSLi Zefan return to_cpumask(sg->cpumask); 7365e6521eaSLi Zefan } 7375e6521eaSLi Zefan 7385e6521eaSLi Zefan /* 7395e6521eaSLi Zefan * cpumask masking which cpus in the group are allowed to iterate up the domain 7405e6521eaSLi Zefan * tree. 7415e6521eaSLi Zefan */ 7425e6521eaSLi Zefan static inline struct cpumask *sched_group_mask(struct sched_group *sg) 7435e6521eaSLi Zefan { 7445e6521eaSLi Zefan return to_cpumask(sg->sgp->cpumask); 7455e6521eaSLi Zefan } 7465e6521eaSLi Zefan 7475e6521eaSLi Zefan /** 7485e6521eaSLi Zefan * group_first_cpu - Returns the first cpu in the cpumask of a sched_group. 7495e6521eaSLi Zefan * @group: The group whose first cpu is to be returned. 7505e6521eaSLi Zefan */ 7515e6521eaSLi Zefan static inline unsigned int group_first_cpu(struct sched_group *group) 7525e6521eaSLi Zefan { 7535e6521eaSLi Zefan return cpumask_first(sched_group_cpus(group)); 7545e6521eaSLi Zefan } 7555e6521eaSLi Zefan 756c1174876SPeter Zijlstra extern int group_balance_cpu(struct sched_group *sg); 757c1174876SPeter Zijlstra 758518cd623SPeter Zijlstra #endif /* CONFIG_SMP */ 759391e43daSPeter Zijlstra 760391e43daSPeter Zijlstra #include "stats.h" 761391e43daSPeter Zijlstra #include "auto_group.h" 762391e43daSPeter Zijlstra 763391e43daSPeter Zijlstra #ifdef CONFIG_CGROUP_SCHED 764391e43daSPeter Zijlstra 765391e43daSPeter Zijlstra /* 766391e43daSPeter Zijlstra * Return the group to which this tasks belongs. 767391e43daSPeter Zijlstra * 7688af01f56STejun Heo * We cannot use task_css() and friends because the cgroup subsystem 7698af01f56STejun Heo * changes that value before the cgroup_subsys::attach() method is called, 7708af01f56STejun Heo * therefore we cannot pin it and might observe the wrong value. 7718323f26cSPeter Zijlstra * 7728323f26cSPeter Zijlstra * The same is true for autogroup's p->signal->autogroup->tg, the autogroup 7738323f26cSPeter Zijlstra * core changes this before calling sched_move_task(). 7748323f26cSPeter Zijlstra * 7758323f26cSPeter Zijlstra * Instead we use a 'copy' which is updated from sched_move_task() while 7768323f26cSPeter Zijlstra * holding both task_struct::pi_lock and rq::lock. 777391e43daSPeter Zijlstra */ 778391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 779391e43daSPeter Zijlstra { 7808323f26cSPeter Zijlstra return p->sched_task_group; 781391e43daSPeter Zijlstra } 782391e43daSPeter Zijlstra 783391e43daSPeter Zijlstra /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ 784391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) 785391e43daSPeter Zijlstra { 786391e43daSPeter Zijlstra #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) 787391e43daSPeter Zijlstra struct task_group *tg = task_group(p); 788391e43daSPeter Zijlstra #endif 789391e43daSPeter Zijlstra 790391e43daSPeter Zijlstra #ifdef CONFIG_FAIR_GROUP_SCHED 791391e43daSPeter Zijlstra p->se.cfs_rq = tg->cfs_rq[cpu]; 792391e43daSPeter Zijlstra p->se.parent = tg->se[cpu]; 793391e43daSPeter Zijlstra #endif 794391e43daSPeter Zijlstra 795391e43daSPeter Zijlstra #ifdef CONFIG_RT_GROUP_SCHED 796391e43daSPeter Zijlstra p->rt.rt_rq = tg->rt_rq[cpu]; 797391e43daSPeter Zijlstra p->rt.parent = tg->rt_se[cpu]; 798391e43daSPeter Zijlstra #endif 799391e43daSPeter Zijlstra } 800391e43daSPeter Zijlstra 801391e43daSPeter Zijlstra #else /* CONFIG_CGROUP_SCHED */ 802391e43daSPeter Zijlstra 803391e43daSPeter Zijlstra static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } 804391e43daSPeter Zijlstra static inline struct task_group *task_group(struct task_struct *p) 805391e43daSPeter Zijlstra { 806391e43daSPeter Zijlstra return NULL; 807391e43daSPeter Zijlstra } 808391e43daSPeter Zijlstra 809391e43daSPeter Zijlstra #endif /* CONFIG_CGROUP_SCHED */ 810391e43daSPeter Zijlstra 811391e43daSPeter Zijlstra static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) 812391e43daSPeter Zijlstra { 813391e43daSPeter Zijlstra set_task_rq(p, cpu); 814391e43daSPeter Zijlstra #ifdef CONFIG_SMP 815391e43daSPeter Zijlstra /* 816391e43daSPeter Zijlstra * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be 817391e43daSPeter Zijlstra * successfuly executed on another CPU. We must ensure that updates of 818391e43daSPeter Zijlstra * per-task data have been completed by this moment. 819391e43daSPeter Zijlstra */ 820391e43daSPeter Zijlstra smp_wmb(); 821391e43daSPeter Zijlstra task_thread_info(p)->cpu = cpu; 822ac66f547SPeter Zijlstra p->wake_cpu = cpu; 823391e43daSPeter Zijlstra #endif 824391e43daSPeter Zijlstra } 825391e43daSPeter Zijlstra 826391e43daSPeter Zijlstra /* 827391e43daSPeter Zijlstra * Tunables that become constants when CONFIG_SCHED_DEBUG is off: 828391e43daSPeter Zijlstra */ 829391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_DEBUG 830c5905afbSIngo Molnar # include <linux/static_key.h> 831391e43daSPeter Zijlstra # define const_debug __read_mostly 832391e43daSPeter Zijlstra #else 833391e43daSPeter Zijlstra # define const_debug const 834391e43daSPeter Zijlstra #endif 835391e43daSPeter Zijlstra 836391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_features; 837391e43daSPeter Zijlstra 838391e43daSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 839391e43daSPeter Zijlstra __SCHED_FEAT_##name , 840391e43daSPeter Zijlstra 841391e43daSPeter Zijlstra enum { 842391e43daSPeter Zijlstra #include "features.h" 843f8b6d1ccSPeter Zijlstra __SCHED_FEAT_NR, 844391e43daSPeter Zijlstra }; 845391e43daSPeter Zijlstra 846391e43daSPeter Zijlstra #undef SCHED_FEAT 847391e43daSPeter Zijlstra 848f8b6d1ccSPeter Zijlstra #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) 849c5905afbSIngo Molnar static __always_inline bool static_branch__true(struct static_key *key) 850f8b6d1ccSPeter Zijlstra { 851c5905afbSIngo Molnar return static_key_true(key); /* Not out of line branch. */ 852f8b6d1ccSPeter Zijlstra } 853f8b6d1ccSPeter Zijlstra 854c5905afbSIngo Molnar static __always_inline bool static_branch__false(struct static_key *key) 855f8b6d1ccSPeter Zijlstra { 856c5905afbSIngo Molnar return static_key_false(key); /* Out of line branch. */ 857f8b6d1ccSPeter Zijlstra } 858f8b6d1ccSPeter Zijlstra 859f8b6d1ccSPeter Zijlstra #define SCHED_FEAT(name, enabled) \ 860c5905afbSIngo Molnar static __always_inline bool static_branch_##name(struct static_key *key) \ 861f8b6d1ccSPeter Zijlstra { \ 862f8b6d1ccSPeter Zijlstra return static_branch__##enabled(key); \ 863f8b6d1ccSPeter Zijlstra } 864f8b6d1ccSPeter Zijlstra 865f8b6d1ccSPeter Zijlstra #include "features.h" 866f8b6d1ccSPeter Zijlstra 867f8b6d1ccSPeter Zijlstra #undef SCHED_FEAT 868f8b6d1ccSPeter Zijlstra 869c5905afbSIngo Molnar extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; 870f8b6d1ccSPeter Zijlstra #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) 871f8b6d1ccSPeter Zijlstra #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ 872391e43daSPeter Zijlstra #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) 873f8b6d1ccSPeter Zijlstra #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ 874391e43daSPeter Zijlstra 875cbee9f88SPeter Zijlstra #ifdef CONFIG_NUMA_BALANCING 876cbee9f88SPeter Zijlstra #define sched_feat_numa(x) sched_feat(x) 8773105b86aSMel Gorman #ifdef CONFIG_SCHED_DEBUG 8783105b86aSMel Gorman #define numabalancing_enabled sched_feat_numa(NUMA) 8793105b86aSMel Gorman #else 8803105b86aSMel Gorman extern bool numabalancing_enabled; 8813105b86aSMel Gorman #endif /* CONFIG_SCHED_DEBUG */ 882cbee9f88SPeter Zijlstra #else 883cbee9f88SPeter Zijlstra #define sched_feat_numa(x) (0) 8843105b86aSMel Gorman #define numabalancing_enabled (0) 8853105b86aSMel Gorman #endif /* CONFIG_NUMA_BALANCING */ 886cbee9f88SPeter Zijlstra 887391e43daSPeter Zijlstra static inline u64 global_rt_period(void) 888391e43daSPeter Zijlstra { 889391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; 890391e43daSPeter Zijlstra } 891391e43daSPeter Zijlstra 892391e43daSPeter Zijlstra static inline u64 global_rt_runtime(void) 893391e43daSPeter Zijlstra { 894391e43daSPeter Zijlstra if (sysctl_sched_rt_runtime < 0) 895391e43daSPeter Zijlstra return RUNTIME_INF; 896391e43daSPeter Zijlstra 897391e43daSPeter Zijlstra return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; 898391e43daSPeter Zijlstra } 899391e43daSPeter Zijlstra 900391e43daSPeter Zijlstra 901391e43daSPeter Zijlstra 902391e43daSPeter Zijlstra static inline int task_current(struct rq *rq, struct task_struct *p) 903391e43daSPeter Zijlstra { 904391e43daSPeter Zijlstra return rq->curr == p; 905391e43daSPeter Zijlstra } 906391e43daSPeter Zijlstra 907391e43daSPeter Zijlstra static inline int task_running(struct rq *rq, struct task_struct *p) 908391e43daSPeter Zijlstra { 909391e43daSPeter Zijlstra #ifdef CONFIG_SMP 910391e43daSPeter Zijlstra return p->on_cpu; 911391e43daSPeter Zijlstra #else 912391e43daSPeter Zijlstra return task_current(rq, p); 913391e43daSPeter Zijlstra #endif 914391e43daSPeter Zijlstra } 915391e43daSPeter Zijlstra 916391e43daSPeter Zijlstra 917391e43daSPeter Zijlstra #ifndef prepare_arch_switch 918391e43daSPeter Zijlstra # define prepare_arch_switch(next) do { } while (0) 919391e43daSPeter Zijlstra #endif 920391e43daSPeter Zijlstra #ifndef finish_arch_switch 921391e43daSPeter Zijlstra # define finish_arch_switch(prev) do { } while (0) 922391e43daSPeter Zijlstra #endif 92301f23e16SCatalin Marinas #ifndef finish_arch_post_lock_switch 92401f23e16SCatalin Marinas # define finish_arch_post_lock_switch() do { } while (0) 92501f23e16SCatalin Marinas #endif 926391e43daSPeter Zijlstra 927391e43daSPeter Zijlstra #ifndef __ARCH_WANT_UNLOCKED_CTXSW 928391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 929391e43daSPeter Zijlstra { 930391e43daSPeter Zijlstra #ifdef CONFIG_SMP 931391e43daSPeter Zijlstra /* 932391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 933391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 934391e43daSPeter Zijlstra * here. 935391e43daSPeter Zijlstra */ 936391e43daSPeter Zijlstra next->on_cpu = 1; 937391e43daSPeter Zijlstra #endif 938391e43daSPeter Zijlstra } 939391e43daSPeter Zijlstra 940391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 941391e43daSPeter Zijlstra { 942391e43daSPeter Zijlstra #ifdef CONFIG_SMP 943391e43daSPeter Zijlstra /* 944391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 945391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 946391e43daSPeter Zijlstra * finished. 947391e43daSPeter Zijlstra */ 948391e43daSPeter Zijlstra smp_wmb(); 949391e43daSPeter Zijlstra prev->on_cpu = 0; 950391e43daSPeter Zijlstra #endif 951391e43daSPeter Zijlstra #ifdef CONFIG_DEBUG_SPINLOCK 952391e43daSPeter Zijlstra /* this is a valid case when another task releases the spinlock */ 953391e43daSPeter Zijlstra rq->lock.owner = current; 954391e43daSPeter Zijlstra #endif 955391e43daSPeter Zijlstra /* 956391e43daSPeter Zijlstra * If we are tracking spinlock dependencies then we have to 957391e43daSPeter Zijlstra * fix up the runqueue lock - which gets 'carried over' from 958391e43daSPeter Zijlstra * prev into current: 959391e43daSPeter Zijlstra */ 960391e43daSPeter Zijlstra spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); 961391e43daSPeter Zijlstra 962391e43daSPeter Zijlstra raw_spin_unlock_irq(&rq->lock); 963391e43daSPeter Zijlstra } 964391e43daSPeter Zijlstra 965391e43daSPeter Zijlstra #else /* __ARCH_WANT_UNLOCKED_CTXSW */ 966391e43daSPeter Zijlstra static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next) 967391e43daSPeter Zijlstra { 968391e43daSPeter Zijlstra #ifdef CONFIG_SMP 969391e43daSPeter Zijlstra /* 970391e43daSPeter Zijlstra * We can optimise this out completely for !SMP, because the 971391e43daSPeter Zijlstra * SMP rebalancing from interrupt is the only thing that cares 972391e43daSPeter Zijlstra * here. 973391e43daSPeter Zijlstra */ 974391e43daSPeter Zijlstra next->on_cpu = 1; 975391e43daSPeter Zijlstra #endif 976391e43daSPeter Zijlstra raw_spin_unlock(&rq->lock); 977391e43daSPeter Zijlstra } 978391e43daSPeter Zijlstra 979391e43daSPeter Zijlstra static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev) 980391e43daSPeter Zijlstra { 981391e43daSPeter Zijlstra #ifdef CONFIG_SMP 982391e43daSPeter Zijlstra /* 983391e43daSPeter Zijlstra * After ->on_cpu is cleared, the task can be moved to a different CPU. 984391e43daSPeter Zijlstra * We must ensure this doesn't happen until the switch is completely 985391e43daSPeter Zijlstra * finished. 986391e43daSPeter Zijlstra */ 987391e43daSPeter Zijlstra smp_wmb(); 988391e43daSPeter Zijlstra prev->on_cpu = 0; 989391e43daSPeter Zijlstra #endif 990391e43daSPeter Zijlstra local_irq_enable(); 991391e43daSPeter Zijlstra } 992391e43daSPeter Zijlstra #endif /* __ARCH_WANT_UNLOCKED_CTXSW */ 993391e43daSPeter Zijlstra 994b13095f0SLi Zefan /* 995b13095f0SLi Zefan * wake flags 996b13095f0SLi Zefan */ 997b13095f0SLi Zefan #define WF_SYNC 0x01 /* waker goes to sleep after wakeup */ 998b13095f0SLi Zefan #define WF_FORK 0x02 /* child wakeup after fork */ 999b13095f0SLi Zefan #define WF_MIGRATED 0x4 /* internal use, task got migrated */ 1000b13095f0SLi Zefan 1001391e43daSPeter Zijlstra /* 1002391e43daSPeter Zijlstra * To aid in avoiding the subversion of "niceness" due to uneven distribution 1003391e43daSPeter Zijlstra * of tasks with abnormal "nice" values across CPUs the contribution that 1004391e43daSPeter Zijlstra * each task makes to its run queue's load is weighted according to its 1005391e43daSPeter Zijlstra * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a 1006391e43daSPeter Zijlstra * scaled version of the new time slice allocation that they receive on time 1007391e43daSPeter Zijlstra * slice expiry etc. 1008391e43daSPeter Zijlstra */ 1009391e43daSPeter Zijlstra 1010391e43daSPeter Zijlstra #define WEIGHT_IDLEPRIO 3 1011391e43daSPeter Zijlstra #define WMULT_IDLEPRIO 1431655765 1012391e43daSPeter Zijlstra 1013391e43daSPeter Zijlstra /* 1014391e43daSPeter Zijlstra * Nice levels are multiplicative, with a gentle 10% change for every 1015391e43daSPeter Zijlstra * nice level changed. I.e. when a CPU-bound task goes from nice 0 to 1016391e43daSPeter Zijlstra * nice 1, it will get ~10% less CPU time than another CPU-bound task 1017391e43daSPeter Zijlstra * that remained on nice 0. 1018391e43daSPeter Zijlstra * 1019391e43daSPeter Zijlstra * The "10% effect" is relative and cumulative: from _any_ nice level, 1020391e43daSPeter Zijlstra * if you go up 1 level, it's -10% CPU usage, if you go down 1 level 1021391e43daSPeter Zijlstra * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. 1022391e43daSPeter Zijlstra * If a task goes up by ~10% and another task goes down by ~10% then 1023391e43daSPeter Zijlstra * the relative distance between them is ~25%.) 1024391e43daSPeter Zijlstra */ 1025391e43daSPeter Zijlstra static const int prio_to_weight[40] = { 1026391e43daSPeter Zijlstra /* -20 */ 88761, 71755, 56483, 46273, 36291, 1027391e43daSPeter Zijlstra /* -15 */ 29154, 23254, 18705, 14949, 11916, 1028391e43daSPeter Zijlstra /* -10 */ 9548, 7620, 6100, 4904, 3906, 1029391e43daSPeter Zijlstra /* -5 */ 3121, 2501, 1991, 1586, 1277, 1030391e43daSPeter Zijlstra /* 0 */ 1024, 820, 655, 526, 423, 1031391e43daSPeter Zijlstra /* 5 */ 335, 272, 215, 172, 137, 1032391e43daSPeter Zijlstra /* 10 */ 110, 87, 70, 56, 45, 1033391e43daSPeter Zijlstra /* 15 */ 36, 29, 23, 18, 15, 1034391e43daSPeter Zijlstra }; 1035391e43daSPeter Zijlstra 1036391e43daSPeter Zijlstra /* 1037391e43daSPeter Zijlstra * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated. 1038391e43daSPeter Zijlstra * 1039391e43daSPeter Zijlstra * In cases where the weight does not change often, we can use the 1040391e43daSPeter Zijlstra * precalculated inverse to speed up arithmetics by turning divisions 1041391e43daSPeter Zijlstra * into multiplications: 1042391e43daSPeter Zijlstra */ 1043391e43daSPeter Zijlstra static const u32 prio_to_wmult[40] = { 1044391e43daSPeter Zijlstra /* -20 */ 48388, 59856, 76040, 92818, 118348, 1045391e43daSPeter Zijlstra /* -15 */ 147320, 184698, 229616, 287308, 360437, 1046391e43daSPeter Zijlstra /* -10 */ 449829, 563644, 704093, 875809, 1099582, 1047391e43daSPeter Zijlstra /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, 1048391e43daSPeter Zijlstra /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, 1049391e43daSPeter Zijlstra /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, 1050391e43daSPeter Zijlstra /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, 1051391e43daSPeter Zijlstra /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, 1052391e43daSPeter Zijlstra }; 1053391e43daSPeter Zijlstra 1054c82ba9faSLi Zefan #define ENQUEUE_WAKEUP 1 1055c82ba9faSLi Zefan #define ENQUEUE_HEAD 2 1056c82ba9faSLi Zefan #ifdef CONFIG_SMP 1057c82ba9faSLi Zefan #define ENQUEUE_WAKING 4 /* sched_class::task_waking was called */ 1058c82ba9faSLi Zefan #else 1059c82ba9faSLi Zefan #define ENQUEUE_WAKING 0 1060c82ba9faSLi Zefan #endif 1061aab03e05SDario Faggioli #define ENQUEUE_REPLENISH 8 1062c82ba9faSLi Zefan 1063c82ba9faSLi Zefan #define DEQUEUE_SLEEP 1 1064c82ba9faSLi Zefan 1065c82ba9faSLi Zefan struct sched_class { 1066c82ba9faSLi Zefan const struct sched_class *next; 1067c82ba9faSLi Zefan 1068c82ba9faSLi Zefan void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); 1069c82ba9faSLi Zefan void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); 1070c82ba9faSLi Zefan void (*yield_task) (struct rq *rq); 1071c82ba9faSLi Zefan bool (*yield_to_task) (struct rq *rq, struct task_struct *p, bool preempt); 1072c82ba9faSLi Zefan 1073c82ba9faSLi Zefan void (*check_preempt_curr) (struct rq *rq, struct task_struct *p, int flags); 1074c82ba9faSLi Zefan 1075c82ba9faSLi Zefan struct task_struct * (*pick_next_task) (struct rq *rq); 1076c82ba9faSLi Zefan void (*put_prev_task) (struct rq *rq, struct task_struct *p); 1077c82ba9faSLi Zefan 1078c82ba9faSLi Zefan #ifdef CONFIG_SMP 1079ac66f547SPeter Zijlstra int (*select_task_rq)(struct task_struct *p, int task_cpu, int sd_flag, int flags); 1080c82ba9faSLi Zefan void (*migrate_task_rq)(struct task_struct *p, int next_cpu); 1081c82ba9faSLi Zefan 1082c82ba9faSLi Zefan void (*pre_schedule) (struct rq *this_rq, struct task_struct *task); 1083c82ba9faSLi Zefan void (*post_schedule) (struct rq *this_rq); 1084c82ba9faSLi Zefan void (*task_waking) (struct task_struct *task); 1085c82ba9faSLi Zefan void (*task_woken) (struct rq *this_rq, struct task_struct *task); 1086c82ba9faSLi Zefan 1087c82ba9faSLi Zefan void (*set_cpus_allowed)(struct task_struct *p, 1088c82ba9faSLi Zefan const struct cpumask *newmask); 1089c82ba9faSLi Zefan 1090c82ba9faSLi Zefan void (*rq_online)(struct rq *rq); 1091c82ba9faSLi Zefan void (*rq_offline)(struct rq *rq); 1092c82ba9faSLi Zefan #endif 1093c82ba9faSLi Zefan 1094c82ba9faSLi Zefan void (*set_curr_task) (struct rq *rq); 1095c82ba9faSLi Zefan void (*task_tick) (struct rq *rq, struct task_struct *p, int queued); 1096c82ba9faSLi Zefan void (*task_fork) (struct task_struct *p); 1097e6c390f2SDario Faggioli void (*task_dead) (struct task_struct *p); 1098c82ba9faSLi Zefan 1099c82ba9faSLi Zefan void (*switched_from) (struct rq *this_rq, struct task_struct *task); 1100c82ba9faSLi Zefan void (*switched_to) (struct rq *this_rq, struct task_struct *task); 1101c82ba9faSLi Zefan void (*prio_changed) (struct rq *this_rq, struct task_struct *task, 1102c82ba9faSLi Zefan int oldprio); 1103c82ba9faSLi Zefan 1104c82ba9faSLi Zefan unsigned int (*get_rr_interval) (struct rq *rq, 1105c82ba9faSLi Zefan struct task_struct *task); 1106c82ba9faSLi Zefan 1107c82ba9faSLi Zefan #ifdef CONFIG_FAIR_GROUP_SCHED 1108c82ba9faSLi Zefan void (*task_move_group) (struct task_struct *p, int on_rq); 1109c82ba9faSLi Zefan #endif 1110c82ba9faSLi Zefan }; 1111391e43daSPeter Zijlstra 1112391e43daSPeter Zijlstra #define sched_class_highest (&stop_sched_class) 1113391e43daSPeter Zijlstra #define for_each_class(class) \ 1114391e43daSPeter Zijlstra for (class = sched_class_highest; class; class = class->next) 1115391e43daSPeter Zijlstra 1116391e43daSPeter Zijlstra extern const struct sched_class stop_sched_class; 1117aab03e05SDario Faggioli extern const struct sched_class dl_sched_class; 1118391e43daSPeter Zijlstra extern const struct sched_class rt_sched_class; 1119391e43daSPeter Zijlstra extern const struct sched_class fair_sched_class; 1120391e43daSPeter Zijlstra extern const struct sched_class idle_sched_class; 1121391e43daSPeter Zijlstra 1122391e43daSPeter Zijlstra 1123391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1124391e43daSPeter Zijlstra 1125b719203bSLi Zefan extern void update_group_power(struct sched_domain *sd, int cpu); 1126b719203bSLi Zefan 1127391e43daSPeter Zijlstra extern void trigger_load_balance(struct rq *rq, int cpu); 1128391e43daSPeter Zijlstra extern void idle_balance(int this_cpu, struct rq *this_rq); 1129391e43daSPeter Zijlstra 1130642dbc39SVincent Guittot extern void idle_enter_fair(struct rq *this_rq); 1131642dbc39SVincent Guittot extern void idle_exit_fair(struct rq *this_rq); 1132642dbc39SVincent Guittot 1133391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1134391e43daSPeter Zijlstra 1135391e43daSPeter Zijlstra static inline void idle_balance(int cpu, struct rq *rq) 1136391e43daSPeter Zijlstra { 1137391e43daSPeter Zijlstra } 1138391e43daSPeter Zijlstra 1139391e43daSPeter Zijlstra #endif 1140391e43daSPeter Zijlstra 1141391e43daSPeter Zijlstra extern void sysrq_sched_debug_show(void); 1142391e43daSPeter Zijlstra extern void sched_init_granularity(void); 1143391e43daSPeter Zijlstra extern void update_max_interval(void); 11441baca4ceSJuri Lelli 11451baca4ceSJuri Lelli extern void init_sched_dl_class(void); 1146391e43daSPeter Zijlstra extern void init_sched_rt_class(void); 1147391e43daSPeter Zijlstra extern void init_sched_fair_class(void); 1148391e43daSPeter Zijlstra 1149391e43daSPeter Zijlstra extern void resched_task(struct task_struct *p); 1150391e43daSPeter Zijlstra extern void resched_cpu(int cpu); 1151391e43daSPeter Zijlstra 1152391e43daSPeter Zijlstra extern struct rt_bandwidth def_rt_bandwidth; 1153391e43daSPeter Zijlstra extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); 1154391e43daSPeter Zijlstra 1155aab03e05SDario Faggioli extern void init_dl_task_timer(struct sched_dl_entity *dl_se); 1156aab03e05SDario Faggioli 1157556061b0SPeter Zijlstra extern void update_idle_cpu_load(struct rq *this_rq); 1158391e43daSPeter Zijlstra 1159a75cdaa9SAlex Shi extern void init_task_runnable_average(struct task_struct *p); 1160a75cdaa9SAlex Shi 116173fbec60SFrederic Weisbecker #ifdef CONFIG_PARAVIRT 116273fbec60SFrederic Weisbecker static inline u64 steal_ticks(u64 steal) 116373fbec60SFrederic Weisbecker { 116473fbec60SFrederic Weisbecker if (unlikely(steal > NSEC_PER_SEC)) 116573fbec60SFrederic Weisbecker return div_u64(steal, TICK_NSEC); 116673fbec60SFrederic Weisbecker 116773fbec60SFrederic Weisbecker return __iter_div_u64_rem(steal, TICK_NSEC, &steal); 116873fbec60SFrederic Weisbecker } 116973fbec60SFrederic Weisbecker #endif 117073fbec60SFrederic Weisbecker 1171391e43daSPeter Zijlstra static inline void inc_nr_running(struct rq *rq) 1172391e43daSPeter Zijlstra { 1173391e43daSPeter Zijlstra rq->nr_running++; 11749f3660c2SFrederic Weisbecker 11759f3660c2SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 11769f3660c2SFrederic Weisbecker if (rq->nr_running == 2) { 11779f3660c2SFrederic Weisbecker if (tick_nohz_full_cpu(rq->cpu)) { 11789f3660c2SFrederic Weisbecker /* Order rq->nr_running write against the IPI */ 11799f3660c2SFrederic Weisbecker smp_wmb(); 11809f3660c2SFrederic Weisbecker smp_send_reschedule(rq->cpu); 11819f3660c2SFrederic Weisbecker } 11829f3660c2SFrederic Weisbecker } 11839f3660c2SFrederic Weisbecker #endif 1184391e43daSPeter Zijlstra } 1185391e43daSPeter Zijlstra 1186391e43daSPeter Zijlstra static inline void dec_nr_running(struct rq *rq) 1187391e43daSPeter Zijlstra { 1188391e43daSPeter Zijlstra rq->nr_running--; 1189391e43daSPeter Zijlstra } 1190391e43daSPeter Zijlstra 1191265f22a9SFrederic Weisbecker static inline void rq_last_tick_reset(struct rq *rq) 1192265f22a9SFrederic Weisbecker { 1193265f22a9SFrederic Weisbecker #ifdef CONFIG_NO_HZ_FULL 1194265f22a9SFrederic Weisbecker rq->last_sched_tick = jiffies; 1195265f22a9SFrederic Weisbecker #endif 1196265f22a9SFrederic Weisbecker } 1197265f22a9SFrederic Weisbecker 1198391e43daSPeter Zijlstra extern void update_rq_clock(struct rq *rq); 1199391e43daSPeter Zijlstra 1200391e43daSPeter Zijlstra extern void activate_task(struct rq *rq, struct task_struct *p, int flags); 1201391e43daSPeter Zijlstra extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); 1202391e43daSPeter Zijlstra 1203391e43daSPeter Zijlstra extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); 1204391e43daSPeter Zijlstra 1205391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_time_avg; 1206391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_nr_migrate; 1207391e43daSPeter Zijlstra extern const_debug unsigned int sysctl_sched_migration_cost; 1208391e43daSPeter Zijlstra 1209391e43daSPeter Zijlstra static inline u64 sched_avg_period(void) 1210391e43daSPeter Zijlstra { 1211391e43daSPeter Zijlstra return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2; 1212391e43daSPeter Zijlstra } 1213391e43daSPeter Zijlstra 1214391e43daSPeter Zijlstra #ifdef CONFIG_SCHED_HRTICK 1215391e43daSPeter Zijlstra 1216391e43daSPeter Zijlstra /* 1217391e43daSPeter Zijlstra * Use hrtick when: 1218391e43daSPeter Zijlstra * - enabled by features 1219391e43daSPeter Zijlstra * - hrtimer is actually high res 1220391e43daSPeter Zijlstra */ 1221391e43daSPeter Zijlstra static inline int hrtick_enabled(struct rq *rq) 1222391e43daSPeter Zijlstra { 1223391e43daSPeter Zijlstra if (!sched_feat(HRTICK)) 1224391e43daSPeter Zijlstra return 0; 1225391e43daSPeter Zijlstra if (!cpu_active(cpu_of(rq))) 1226391e43daSPeter Zijlstra return 0; 1227391e43daSPeter Zijlstra return hrtimer_is_hres_active(&rq->hrtick_timer); 1228391e43daSPeter Zijlstra } 1229391e43daSPeter Zijlstra 1230391e43daSPeter Zijlstra void hrtick_start(struct rq *rq, u64 delay); 1231391e43daSPeter Zijlstra 1232b39e66eaSMike Galbraith #else 1233b39e66eaSMike Galbraith 1234b39e66eaSMike Galbraith static inline int hrtick_enabled(struct rq *rq) 1235b39e66eaSMike Galbraith { 1236b39e66eaSMike Galbraith return 0; 1237b39e66eaSMike Galbraith } 1238b39e66eaSMike Galbraith 1239391e43daSPeter Zijlstra #endif /* CONFIG_SCHED_HRTICK */ 1240391e43daSPeter Zijlstra 1241391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1242391e43daSPeter Zijlstra extern void sched_avg_update(struct rq *rq); 1243391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) 1244391e43daSPeter Zijlstra { 1245391e43daSPeter Zijlstra rq->rt_avg += rt_delta; 1246391e43daSPeter Zijlstra sched_avg_update(rq); 1247391e43daSPeter Zijlstra } 1248391e43daSPeter Zijlstra #else 1249391e43daSPeter Zijlstra static inline void sched_rt_avg_update(struct rq *rq, u64 rt_delta) { } 1250391e43daSPeter Zijlstra static inline void sched_avg_update(struct rq *rq) { } 1251391e43daSPeter Zijlstra #endif 1252391e43daSPeter Zijlstra 1253391e43daSPeter Zijlstra extern void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period); 1254391e43daSPeter Zijlstra 1255391e43daSPeter Zijlstra #ifdef CONFIG_SMP 1256391e43daSPeter Zijlstra #ifdef CONFIG_PREEMPT 1257391e43daSPeter Zijlstra 1258391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); 1259391e43daSPeter Zijlstra 1260391e43daSPeter Zijlstra /* 1261391e43daSPeter Zijlstra * fair double_lock_balance: Safely acquires both rq->locks in a fair 1262391e43daSPeter Zijlstra * way at the expense of forcing extra atomic operations in all 1263391e43daSPeter Zijlstra * invocations. This assures that the double_lock is acquired using the 1264391e43daSPeter Zijlstra * same underlying policy as the spinlock_t on this architecture, which 1265391e43daSPeter Zijlstra * reduces latency compared to the unfair variant below. However, it 1266391e43daSPeter Zijlstra * also adds more overhead and therefore may reduce throughput. 1267391e43daSPeter Zijlstra */ 1268391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1269391e43daSPeter Zijlstra __releases(this_rq->lock) 1270391e43daSPeter Zijlstra __acquires(busiest->lock) 1271391e43daSPeter Zijlstra __acquires(this_rq->lock) 1272391e43daSPeter Zijlstra { 1273391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1274391e43daSPeter Zijlstra double_rq_lock(this_rq, busiest); 1275391e43daSPeter Zijlstra 1276391e43daSPeter Zijlstra return 1; 1277391e43daSPeter Zijlstra } 1278391e43daSPeter Zijlstra 1279391e43daSPeter Zijlstra #else 1280391e43daSPeter Zijlstra /* 1281391e43daSPeter Zijlstra * Unfair double_lock_balance: Optimizes throughput at the expense of 1282391e43daSPeter Zijlstra * latency by eliminating extra atomic operations when the locks are 1283391e43daSPeter Zijlstra * already in proper order on entry. This favors lower cpu-ids and will 1284391e43daSPeter Zijlstra * grant the double lock to lower cpus over higher ids under contention, 1285391e43daSPeter Zijlstra * regardless of entry order into the function. 1286391e43daSPeter Zijlstra */ 1287391e43daSPeter Zijlstra static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) 1288391e43daSPeter Zijlstra __releases(this_rq->lock) 1289391e43daSPeter Zijlstra __acquires(busiest->lock) 1290391e43daSPeter Zijlstra __acquires(this_rq->lock) 1291391e43daSPeter Zijlstra { 1292391e43daSPeter Zijlstra int ret = 0; 1293391e43daSPeter Zijlstra 1294391e43daSPeter Zijlstra if (unlikely(!raw_spin_trylock(&busiest->lock))) { 1295391e43daSPeter Zijlstra if (busiest < this_rq) { 1296391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1297391e43daSPeter Zijlstra raw_spin_lock(&busiest->lock); 1298391e43daSPeter Zijlstra raw_spin_lock_nested(&this_rq->lock, 1299391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1300391e43daSPeter Zijlstra ret = 1; 1301391e43daSPeter Zijlstra } else 1302391e43daSPeter Zijlstra raw_spin_lock_nested(&busiest->lock, 1303391e43daSPeter Zijlstra SINGLE_DEPTH_NESTING); 1304391e43daSPeter Zijlstra } 1305391e43daSPeter Zijlstra return ret; 1306391e43daSPeter Zijlstra } 1307391e43daSPeter Zijlstra 1308391e43daSPeter Zijlstra #endif /* CONFIG_PREEMPT */ 1309391e43daSPeter Zijlstra 1310391e43daSPeter Zijlstra /* 1311391e43daSPeter Zijlstra * double_lock_balance - lock the busiest runqueue, this_rq is locked already. 1312391e43daSPeter Zijlstra */ 1313391e43daSPeter Zijlstra static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) 1314391e43daSPeter Zijlstra { 1315391e43daSPeter Zijlstra if (unlikely(!irqs_disabled())) { 1316391e43daSPeter Zijlstra /* printk() doesn't work good under rq->lock */ 1317391e43daSPeter Zijlstra raw_spin_unlock(&this_rq->lock); 1318391e43daSPeter Zijlstra BUG_ON(1); 1319391e43daSPeter Zijlstra } 1320391e43daSPeter Zijlstra 1321391e43daSPeter Zijlstra return _double_lock_balance(this_rq, busiest); 1322391e43daSPeter Zijlstra } 1323391e43daSPeter Zijlstra 1324391e43daSPeter Zijlstra static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) 1325391e43daSPeter Zijlstra __releases(busiest->lock) 1326391e43daSPeter Zijlstra { 1327391e43daSPeter Zijlstra raw_spin_unlock(&busiest->lock); 1328391e43daSPeter Zijlstra lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); 1329391e43daSPeter Zijlstra } 1330391e43daSPeter Zijlstra 133174602315SPeter Zijlstra static inline void double_lock(spinlock_t *l1, spinlock_t *l2) 133274602315SPeter Zijlstra { 133374602315SPeter Zijlstra if (l1 > l2) 133474602315SPeter Zijlstra swap(l1, l2); 133574602315SPeter Zijlstra 133674602315SPeter Zijlstra spin_lock(l1); 133774602315SPeter Zijlstra spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 133874602315SPeter Zijlstra } 133974602315SPeter Zijlstra 134074602315SPeter Zijlstra static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) 134174602315SPeter Zijlstra { 134274602315SPeter Zijlstra if (l1 > l2) 134374602315SPeter Zijlstra swap(l1, l2); 134474602315SPeter Zijlstra 134574602315SPeter Zijlstra raw_spin_lock(l1); 134674602315SPeter Zijlstra raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); 134774602315SPeter Zijlstra } 134874602315SPeter Zijlstra 1349391e43daSPeter Zijlstra /* 1350391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1351391e43daSPeter Zijlstra * 1352391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1353391e43daSPeter Zijlstra * you need to do so manually before calling. 1354391e43daSPeter Zijlstra */ 1355391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1356391e43daSPeter Zijlstra __acquires(rq1->lock) 1357391e43daSPeter Zijlstra __acquires(rq2->lock) 1358391e43daSPeter Zijlstra { 1359391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1360391e43daSPeter Zijlstra if (rq1 == rq2) { 1361391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1362391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1363391e43daSPeter Zijlstra } else { 1364391e43daSPeter Zijlstra if (rq1 < rq2) { 1365391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1366391e43daSPeter Zijlstra raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); 1367391e43daSPeter Zijlstra } else { 1368391e43daSPeter Zijlstra raw_spin_lock(&rq2->lock); 1369391e43daSPeter Zijlstra raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); 1370391e43daSPeter Zijlstra } 1371391e43daSPeter Zijlstra } 1372391e43daSPeter Zijlstra } 1373391e43daSPeter Zijlstra 1374391e43daSPeter Zijlstra /* 1375391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1376391e43daSPeter Zijlstra * 1377391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1378391e43daSPeter Zijlstra * you need to do so manually after calling. 1379391e43daSPeter Zijlstra */ 1380391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1381391e43daSPeter Zijlstra __releases(rq1->lock) 1382391e43daSPeter Zijlstra __releases(rq2->lock) 1383391e43daSPeter Zijlstra { 1384391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1385391e43daSPeter Zijlstra if (rq1 != rq2) 1386391e43daSPeter Zijlstra raw_spin_unlock(&rq2->lock); 1387391e43daSPeter Zijlstra else 1388391e43daSPeter Zijlstra __release(rq2->lock); 1389391e43daSPeter Zijlstra } 1390391e43daSPeter Zijlstra 1391391e43daSPeter Zijlstra #else /* CONFIG_SMP */ 1392391e43daSPeter Zijlstra 1393391e43daSPeter Zijlstra /* 1394391e43daSPeter Zijlstra * double_rq_lock - safely lock two runqueues 1395391e43daSPeter Zijlstra * 1396391e43daSPeter Zijlstra * Note this does not disable interrupts like task_rq_lock, 1397391e43daSPeter Zijlstra * you need to do so manually before calling. 1398391e43daSPeter Zijlstra */ 1399391e43daSPeter Zijlstra static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) 1400391e43daSPeter Zijlstra __acquires(rq1->lock) 1401391e43daSPeter Zijlstra __acquires(rq2->lock) 1402391e43daSPeter Zijlstra { 1403391e43daSPeter Zijlstra BUG_ON(!irqs_disabled()); 1404391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1405391e43daSPeter Zijlstra raw_spin_lock(&rq1->lock); 1406391e43daSPeter Zijlstra __acquire(rq2->lock); /* Fake it out ;) */ 1407391e43daSPeter Zijlstra } 1408391e43daSPeter Zijlstra 1409391e43daSPeter Zijlstra /* 1410391e43daSPeter Zijlstra * double_rq_unlock - safely unlock two runqueues 1411391e43daSPeter Zijlstra * 1412391e43daSPeter Zijlstra * Note this does not restore interrupts like task_rq_unlock, 1413391e43daSPeter Zijlstra * you need to do so manually after calling. 1414391e43daSPeter Zijlstra */ 1415391e43daSPeter Zijlstra static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) 1416391e43daSPeter Zijlstra __releases(rq1->lock) 1417391e43daSPeter Zijlstra __releases(rq2->lock) 1418391e43daSPeter Zijlstra { 1419391e43daSPeter Zijlstra BUG_ON(rq1 != rq2); 1420391e43daSPeter Zijlstra raw_spin_unlock(&rq1->lock); 1421391e43daSPeter Zijlstra __release(rq2->lock); 1422391e43daSPeter Zijlstra } 1423391e43daSPeter Zijlstra 1424391e43daSPeter Zijlstra #endif 1425391e43daSPeter Zijlstra 1426391e43daSPeter Zijlstra extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); 1427391e43daSPeter Zijlstra extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); 1428391e43daSPeter Zijlstra extern void print_cfs_stats(struct seq_file *m, int cpu); 1429391e43daSPeter Zijlstra extern void print_rt_stats(struct seq_file *m, int cpu); 1430391e43daSPeter Zijlstra 1431391e43daSPeter Zijlstra extern void init_cfs_rq(struct cfs_rq *cfs_rq); 1432391e43daSPeter Zijlstra extern void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq); 1433aab03e05SDario Faggioli extern void init_dl_rq(struct dl_rq *dl_rq, struct rq *rq); 1434391e43daSPeter Zijlstra 14351ee14e6cSBen Segall extern void cfs_bandwidth_usage_inc(void); 14361ee14e6cSBen Segall extern void cfs_bandwidth_usage_dec(void); 14371c792db7SSuresh Siddha 14383451d024SFrederic Weisbecker #ifdef CONFIG_NO_HZ_COMMON 14391c792db7SSuresh Siddha enum rq_nohz_flag_bits { 14401c792db7SSuresh Siddha NOHZ_TICK_STOPPED, 14411c792db7SSuresh Siddha NOHZ_BALANCE_KICK, 14421c792db7SSuresh Siddha }; 14431c792db7SSuresh Siddha 14441c792db7SSuresh Siddha #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) 14451c792db7SSuresh Siddha #endif 144673fbec60SFrederic Weisbecker 144773fbec60SFrederic Weisbecker #ifdef CONFIG_IRQ_TIME_ACCOUNTING 144873fbec60SFrederic Weisbecker 144973fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_hardirq_time); 145073fbec60SFrederic Weisbecker DECLARE_PER_CPU(u64, cpu_softirq_time); 145173fbec60SFrederic Weisbecker 145273fbec60SFrederic Weisbecker #ifndef CONFIG_64BIT 145373fbec60SFrederic Weisbecker DECLARE_PER_CPU(seqcount_t, irq_time_seq); 145473fbec60SFrederic Weisbecker 145573fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 145673fbec60SFrederic Weisbecker { 145773fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 145873fbec60SFrederic Weisbecker smp_wmb(); 145973fbec60SFrederic Weisbecker } 146073fbec60SFrederic Weisbecker 146173fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 146273fbec60SFrederic Weisbecker { 146373fbec60SFrederic Weisbecker smp_wmb(); 146473fbec60SFrederic Weisbecker __this_cpu_inc(irq_time_seq.sequence); 146573fbec60SFrederic Weisbecker } 146673fbec60SFrederic Weisbecker 146773fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 146873fbec60SFrederic Weisbecker { 146973fbec60SFrederic Weisbecker u64 irq_time; 147073fbec60SFrederic Weisbecker unsigned seq; 147173fbec60SFrederic Weisbecker 147273fbec60SFrederic Weisbecker do { 147373fbec60SFrederic Weisbecker seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu)); 147473fbec60SFrederic Weisbecker irq_time = per_cpu(cpu_softirq_time, cpu) + 147573fbec60SFrederic Weisbecker per_cpu(cpu_hardirq_time, cpu); 147673fbec60SFrederic Weisbecker } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq)); 147773fbec60SFrederic Weisbecker 147873fbec60SFrederic Weisbecker return irq_time; 147973fbec60SFrederic Weisbecker } 148073fbec60SFrederic Weisbecker #else /* CONFIG_64BIT */ 148173fbec60SFrederic Weisbecker static inline void irq_time_write_begin(void) 148273fbec60SFrederic Weisbecker { 148373fbec60SFrederic Weisbecker } 148473fbec60SFrederic Weisbecker 148573fbec60SFrederic Weisbecker static inline void irq_time_write_end(void) 148673fbec60SFrederic Weisbecker { 148773fbec60SFrederic Weisbecker } 148873fbec60SFrederic Weisbecker 148973fbec60SFrederic Weisbecker static inline u64 irq_time_read(int cpu) 149073fbec60SFrederic Weisbecker { 149173fbec60SFrederic Weisbecker return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu); 149273fbec60SFrederic Weisbecker } 149373fbec60SFrederic Weisbecker #endif /* CONFIG_64BIT */ 149473fbec60SFrederic Weisbecker #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ 1495