Commit | Line | Data |
---|---|---|
b2441318 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
97fb7a0a IM |
2 | /* |
3 | * Scheduler internal types and methods: | |
4 | */ | |
029632fb | 5 | #include <linux/sched.h> |
325ea10c | 6 | |
dfc3401a | 7 | #include <linux/sched/autogroup.h> |
e6017571 | 8 | #include <linux/sched/clock.h> |
325ea10c | 9 | #include <linux/sched/coredump.h> |
55687da1 | 10 | #include <linux/sched/cpufreq.h> |
325ea10c IM |
11 | #include <linux/sched/cputime.h> |
12 | #include <linux/sched/deadline.h> | |
b17b0153 | 13 | #include <linux/sched/debug.h> |
ef8bd77f | 14 | #include <linux/sched/hotplug.h> |
325ea10c IM |
15 | #include <linux/sched/idle.h> |
16 | #include <linux/sched/init.h> | |
17 | #include <linux/sched/isolation.h> | |
18 | #include <linux/sched/jobctl.h> | |
19 | #include <linux/sched/loadavg.h> | |
20 | #include <linux/sched/mm.h> | |
21 | #include <linux/sched/nohz.h> | |
22 | #include <linux/sched/numa_balancing.h> | |
23 | #include <linux/sched/prio.h> | |
24 | #include <linux/sched/rt.h> | |
25 | #include <linux/sched/signal.h> | |
26 | #include <linux/sched/stat.h> | |
27 | #include <linux/sched/sysctl.h> | |
29930025 | 28 | #include <linux/sched/task.h> |
68db0cf1 | 29 | #include <linux/sched/task_stack.h> |
325ea10c IM |
30 | #include <linux/sched/topology.h> |
31 | #include <linux/sched/user.h> | |
32 | #include <linux/sched/wake_q.h> | |
33 | #include <linux/sched/xacct.h> | |
34 | ||
35 | #include <uapi/linux/sched/types.h> | |
ef8bd77f | 36 | |
3866e845 | 37 | #include <linux/binfmts.h> |
325ea10c IM |
38 | #include <linux/blkdev.h> |
39 | #include <linux/compat.h> | |
40 | #include <linux/context_tracking.h> | |
41 | #include <linux/cpufreq.h> | |
42 | #include <linux/cpuidle.h> | |
43 | #include <linux/cpuset.h> | |
44 | #include <linux/ctype.h> | |
45 | #include <linux/debugfs.h> | |
46 | #include <linux/delayacct.h> | |
47 | #include <linux/init_task.h> | |
48 | #include <linux/kprobes.h> | |
49 | #include <linux/kthread.h> | |
50 | #include <linux/membarrier.h> | |
51 | #include <linux/migrate.h> | |
52 | #include <linux/mmu_context.h> | |
53 | #include <linux/nmi.h> | |
54 | #include <linux/proc_fs.h> | |
55 | #include <linux/prefetch.h> | |
56 | #include <linux/profile.h> | |
eb414681 | 57 | #include <linux/psi.h> |
325ea10c IM |
58 | #include <linux/rcupdate_wait.h> |
59 | #include <linux/security.h> | |
029632fb | 60 | #include <linux/stop_machine.h> |
325ea10c IM |
61 | #include <linux/suspend.h> |
62 | #include <linux/swait.h> | |
63 | #include <linux/syscalls.h> | |
64 | #include <linux/task_work.h> | |
65 | #include <linux/tsacct_kern.h> | |
66 | ||
67 | #include <asm/tlb.h> | |
029632fb | 68 | |
7fce777c | 69 | #ifdef CONFIG_PARAVIRT |
325ea10c | 70 | # include <asm/paravirt.h> |
7fce777c IM |
71 | #endif |
72 | ||
391e43da | 73 | #include "cpupri.h" |
6bfd6d72 | 74 | #include "cpudeadline.h" |
029632fb | 75 | |
9148a3a1 | 76 | #ifdef CONFIG_SCHED_DEBUG |
6d3aed3d | 77 | # define SCHED_WARN_ON(x) WARN_ONCE(x, #x) |
9148a3a1 | 78 | #else |
6d3aed3d | 79 | # define SCHED_WARN_ON(x) ({ (void)(x), 0; }) |
9148a3a1 PZ |
80 | #endif |
81 | ||
45ceebf7 | 82 | struct rq; |
442bf3aa | 83 | struct cpuidle_state; |
45ceebf7 | 84 | |
da0c1e65 KT |
85 | /* task_struct::on_rq states: */ |
86 | #define TASK_ON_RQ_QUEUED 1 | |
cca26e80 | 87 | #define TASK_ON_RQ_MIGRATING 2 |
da0c1e65 | 88 | |
029632fb PZ |
89 | extern __read_mostly int scheduler_running; |
90 | ||
45ceebf7 PG |
91 | extern unsigned long calc_load_update; |
92 | extern atomic_long_t calc_load_tasks; | |
93 | ||
3289bdb4 | 94 | extern void calc_global_load_tick(struct rq *this_rq); |
d60585c5 | 95 | extern long calc_load_fold_active(struct rq *this_rq, long adjust); |
3289bdb4 PZ |
96 | |
97 | #ifdef CONFIG_SMP | |
cee1afce | 98 | extern void cpu_load_update_active(struct rq *this_rq); |
3289bdb4 | 99 | #else |
cee1afce | 100 | static inline void cpu_load_update_active(struct rq *this_rq) { } |
3289bdb4 | 101 | #endif |
45ceebf7 | 102 | |
029632fb PZ |
103 | /* |
104 | * Helpers for converting nanosecond timing to jiffy resolution | |
105 | */ | |
106 | #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ)) | |
107 | ||
cc1f4b1f LZ |
108 | /* |
109 | * Increase resolution of nice-level calculations for 64-bit architectures. | |
110 | * The extra resolution improves shares distribution and load balancing of | |
111 | * low-weight task groups (eg. nice +19 on an autogroup), deeper taskgroup | |
112 | * hierarchies, especially on larger systems. This is not a user-visible change | |
113 | * and does not change the user-interface for setting shares/weights. | |
114 | * | |
115 | * We increase resolution only if we have enough bits to allow this increased | |
97fb7a0a IM |
116 | * resolution (i.e. 64-bit). The costs for increasing resolution when 32-bit |
117 | * are pretty high and the returns do not justify the increased costs. | |
2159197d | 118 | * |
97fb7a0a IM |
119 | * Really only required when CONFIG_FAIR_GROUP_SCHED=y is also set, but to |
120 | * increase coverage and consistency always enable it on 64-bit platforms. | |
cc1f4b1f | 121 | */ |
2159197d | 122 | #ifdef CONFIG_64BIT |
172895e6 | 123 | # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT + SCHED_FIXEDPOINT_SHIFT) |
6ecdd749 YD |
124 | # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT) |
125 | # define scale_load_down(w) ((w) >> SCHED_FIXEDPOINT_SHIFT) | |
cc1f4b1f | 126 | #else |
172895e6 | 127 | # define NICE_0_LOAD_SHIFT (SCHED_FIXEDPOINT_SHIFT) |
cc1f4b1f LZ |
128 | # define scale_load(w) (w) |
129 | # define scale_load_down(w) (w) | |
130 | #endif | |
131 | ||
6ecdd749 | 132 | /* |
172895e6 YD |
133 | * Task weight (visible to users) and its load (invisible to users) have |
134 | * independent resolution, but they should be well calibrated. We use | |
135 | * scale_load() and scale_load_down(w) to convert between them. The | |
136 | * following must be true: | |
137 | * | |
138 | * scale_load(sched_prio_to_weight[USER_PRIO(NICE_TO_PRIO(0))]) == NICE_0_LOAD | |
139 | * | |
6ecdd749 | 140 | */ |
172895e6 | 141 | #define NICE_0_LOAD (1L << NICE_0_LOAD_SHIFT) |
029632fb | 142 | |
332ac17e DF |
143 | /* |
144 | * Single value that decides SCHED_DEADLINE internal math precision. | |
145 | * 10 -> just above 1us | |
146 | * 9 -> just above 0.5us | |
147 | */ | |
97fb7a0a | 148 | #define DL_SCALE 10 |
029632fb PZ |
149 | |
150 | /* | |
97fb7a0a | 151 | * Single value that denotes runtime == period, ie unlimited time. |
029632fb | 152 | */ |
97fb7a0a | 153 | #define RUNTIME_INF ((u64)~0ULL) |
029632fb | 154 | |
20f9cd2a HA |
155 | static inline int idle_policy(int policy) |
156 | { | |
157 | return policy == SCHED_IDLE; | |
158 | } | |
d50dde5a DF |
159 | static inline int fair_policy(int policy) |
160 | { | |
161 | return policy == SCHED_NORMAL || policy == SCHED_BATCH; | |
162 | } | |
163 | ||
029632fb PZ |
164 | static inline int rt_policy(int policy) |
165 | { | |
d50dde5a | 166 | return policy == SCHED_FIFO || policy == SCHED_RR; |
029632fb PZ |
167 | } |
168 | ||
aab03e05 DF |
169 | static inline int dl_policy(int policy) |
170 | { | |
171 | return policy == SCHED_DEADLINE; | |
172 | } | |
20f9cd2a HA |
173 | static inline bool valid_policy(int policy) |
174 | { | |
175 | return idle_policy(policy) || fair_policy(policy) || | |
176 | rt_policy(policy) || dl_policy(policy); | |
177 | } | |
aab03e05 | 178 | |
1da1843f VK |
179 | static inline int task_has_idle_policy(struct task_struct *p) |
180 | { | |
181 | return idle_policy(p->policy); | |
182 | } | |
183 | ||
029632fb PZ |
184 | static inline int task_has_rt_policy(struct task_struct *p) |
185 | { | |
186 | return rt_policy(p->policy); | |
187 | } | |
188 | ||
aab03e05 DF |
189 | static inline int task_has_dl_policy(struct task_struct *p) |
190 | { | |
191 | return dl_policy(p->policy); | |
192 | } | |
193 | ||
07881166 JL |
194 | #define cap_scale(v, s) ((v)*(s) >> SCHED_CAPACITY_SHIFT) |
195 | ||
794a56eb JL |
196 | /* |
197 | * !! For sched_setattr_nocheck() (kernel) only !! | |
198 | * | |
199 | * This is actually gross. :( | |
200 | * | |
201 | * It is used to make schedutil kworker(s) higher priority than SCHED_DEADLINE | |
202 | * tasks, but still be able to sleep. We need this on platforms that cannot | |
203 | * atomically change clock frequency. Remove once fast switching will be | |
204 | * available on such platforms. | |
205 | * | |
206 | * SUGOV stands for SchedUtil GOVernor. | |
207 | */ | |
208 | #define SCHED_FLAG_SUGOV 0x10000000 | |
209 | ||
210 | static inline bool dl_entity_is_special(struct sched_dl_entity *dl_se) | |
211 | { | |
212 | #ifdef CONFIG_CPU_FREQ_GOV_SCHEDUTIL | |
213 | return unlikely(dl_se->flags & SCHED_FLAG_SUGOV); | |
214 | #else | |
215 | return false; | |
216 | #endif | |
217 | } | |
218 | ||
2d3d891d DF |
219 | /* |
220 | * Tells if entity @a should preempt entity @b. | |
221 | */ | |
332ac17e DF |
222 | static inline bool |
223 | dl_entity_preempt(struct sched_dl_entity *a, struct sched_dl_entity *b) | |
2d3d891d | 224 | { |
794a56eb JL |
225 | return dl_entity_is_special(a) || |
226 | dl_time_before(a->deadline, b->deadline); | |
2d3d891d DF |
227 | } |
228 | ||
029632fb PZ |
229 | /* |
230 | * This is the priority-queue data structure of the RT scheduling class: | |
231 | */ | |
232 | struct rt_prio_array { | |
233 | DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */ | |
234 | struct list_head queue[MAX_RT_PRIO]; | |
235 | }; | |
236 | ||
237 | struct rt_bandwidth { | |
238 | /* nests inside the rq lock: */ | |
239 | raw_spinlock_t rt_runtime_lock; | |
240 | ktime_t rt_period; | |
241 | u64 rt_runtime; | |
242 | struct hrtimer rt_period_timer; | |
4cfafd30 | 243 | unsigned int rt_period_active; |
029632fb | 244 | }; |
a5e7be3b JL |
245 | |
246 | void __dl_clear_params(struct task_struct *p); | |
247 | ||
332ac17e DF |
248 | /* |
249 | * To keep the bandwidth of -deadline tasks and groups under control | |
250 | * we need some place where: | |
251 | * - store the maximum -deadline bandwidth of the system (the group); | |
252 | * - cache the fraction of that bandwidth that is currently allocated. | |
253 | * | |
254 | * This is all done in the data structure below. It is similar to the | |
255 | * one used for RT-throttling (rt_bandwidth), with the main difference | |
256 | * that, since here we are only interested in admission control, we | |
257 | * do not decrease any runtime while the group "executes", neither we | |
258 | * need a timer to replenish it. | |
259 | * | |
260 | * With respect to SMP, the bandwidth is given on a per-CPU basis, | |
261 | * meaning that: | |
262 | * - dl_bw (< 100%) is the bandwidth of the system (group) on each CPU; | |
263 | * - dl_total_bw array contains, in the i-eth element, the currently | |
264 | * allocated bandwidth on the i-eth CPU. | |
265 | * Moreover, groups consume bandwidth on each CPU, while tasks only | |
266 | * consume bandwidth on the CPU they're running on. | |
267 | * Finally, dl_total_bw_cpu is used to cache the index of dl_total_bw | |
268 | * that will be shown the next time the proc or cgroup controls will | |
269 | * be red. It on its turn can be changed by writing on its own | |
270 | * control. | |
271 | */ | |
272 | struct dl_bandwidth { | |
97fb7a0a IM |
273 | raw_spinlock_t dl_runtime_lock; |
274 | u64 dl_runtime; | |
275 | u64 dl_period; | |
332ac17e DF |
276 | }; |
277 | ||
278 | static inline int dl_bandwidth_enabled(void) | |
279 | { | |
1724813d | 280 | return sysctl_sched_rt_runtime >= 0; |
332ac17e DF |
281 | } |
282 | ||
332ac17e | 283 | struct dl_bw { |
97fb7a0a IM |
284 | raw_spinlock_t lock; |
285 | u64 bw; | |
286 | u64 total_bw; | |
332ac17e DF |
287 | }; |
288 | ||
daec5798 LA |
289 | static inline void __dl_update(struct dl_bw *dl_b, s64 bw); |
290 | ||
7f51412a | 291 | static inline |
8c0944ce | 292 | void __dl_sub(struct dl_bw *dl_b, u64 tsk_bw, int cpus) |
7f51412a JL |
293 | { |
294 | dl_b->total_bw -= tsk_bw; | |
daec5798 | 295 | __dl_update(dl_b, (s32)tsk_bw / cpus); |
7f51412a JL |
296 | } |
297 | ||
298 | static inline | |
daec5798 | 299 | void __dl_add(struct dl_bw *dl_b, u64 tsk_bw, int cpus) |
7f51412a JL |
300 | { |
301 | dl_b->total_bw += tsk_bw; | |
daec5798 | 302 | __dl_update(dl_b, -((s32)tsk_bw / cpus)); |
7f51412a JL |
303 | } |
304 | ||
305 | static inline | |
306 | bool __dl_overflow(struct dl_bw *dl_b, int cpus, u64 old_bw, u64 new_bw) | |
307 | { | |
308 | return dl_b->bw != -1 && | |
309 | dl_b->bw * cpus < dl_b->total_bw - old_bw + new_bw; | |
310 | } | |
311 | ||
97fb7a0a | 312 | extern void dl_change_utilization(struct task_struct *p, u64 new_bw); |
f2cb1360 | 313 | extern void init_dl_bw(struct dl_bw *dl_b); |
97fb7a0a | 314 | extern int sched_dl_global_validate(void); |
06a76fe0 | 315 | extern void sched_dl_do_global(void); |
97fb7a0a | 316 | extern int sched_dl_overflow(struct task_struct *p, int policy, const struct sched_attr *attr); |
06a76fe0 NP |
317 | extern void __setparam_dl(struct task_struct *p, const struct sched_attr *attr); |
318 | extern void __getparam_dl(struct task_struct *p, struct sched_attr *attr); | |
319 | extern bool __checkparam_dl(const struct sched_attr *attr); | |
06a76fe0 | 320 | extern bool dl_param_changed(struct task_struct *p, const struct sched_attr *attr); |
97fb7a0a IM |
321 | extern int dl_task_can_attach(struct task_struct *p, const struct cpumask *cs_cpus_allowed); |
322 | extern int dl_cpuset_cpumask_can_shrink(const struct cpumask *cur, const struct cpumask *trial); | |
06a76fe0 | 323 | extern bool dl_cpu_busy(unsigned int cpu); |
029632fb PZ |
324 | |
325 | #ifdef CONFIG_CGROUP_SCHED | |
326 | ||
327 | #include <linux/cgroup.h> | |
eb414681 | 328 | #include <linux/psi.h> |
029632fb PZ |
329 | |
330 | struct cfs_rq; | |
331 | struct rt_rq; | |
332 | ||
35cf4e50 | 333 | extern struct list_head task_groups; |
029632fb PZ |
334 | |
335 | struct cfs_bandwidth { | |
336 | #ifdef CONFIG_CFS_BANDWIDTH | |
97fb7a0a IM |
337 | raw_spinlock_t lock; |
338 | ktime_t period; | |
339 | u64 quota; | |
340 | u64 runtime; | |
341 | s64 hierarchical_quota; | |
342 | u64 runtime_expires; | |
512ac999 | 343 | int expires_seq; |
97fb7a0a | 344 | |
512ac999 XP |
345 | short idle; |
346 | short period_active; | |
97fb7a0a IM |
347 | struct hrtimer period_timer; |
348 | struct hrtimer slack_timer; | |
349 | struct list_head throttled_cfs_rq; | |
350 | ||
351 | /* Statistics: */ | |
352 | int nr_periods; | |
353 | int nr_throttled; | |
354 | u64 throttled_time; | |
baa9be4f PA |
355 | |
356 | bool distribute_running; | |
029632fb PZ |
357 | #endif |
358 | }; | |
359 | ||
97fb7a0a | 360 | /* Task group related information */ |
029632fb PZ |
361 | struct task_group { |
362 | struct cgroup_subsys_state css; | |
363 | ||
364 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
97fb7a0a IM |
365 | /* schedulable entities of this group on each CPU */ |
366 | struct sched_entity **se; | |
367 | /* runqueue "owned" by this group on each CPU */ | |
368 | struct cfs_rq **cfs_rq; | |
369 | unsigned long shares; | |
029632fb | 370 | |
fa6bddeb | 371 | #ifdef CONFIG_SMP |
b0367629 WL |
372 | /* |
373 | * load_avg can be heavily contended at clock tick time, so put | |
374 | * it in its own cacheline separated from the fields above which | |
375 | * will also be accessed at each tick. | |
376 | */ | |
97fb7a0a | 377 | atomic_long_t load_avg ____cacheline_aligned; |
029632fb | 378 | #endif |
fa6bddeb | 379 | #endif |
029632fb PZ |
380 | |
381 | #ifdef CONFIG_RT_GROUP_SCHED | |
97fb7a0a IM |
382 | struct sched_rt_entity **rt_se; |
383 | struct rt_rq **rt_rq; | |
029632fb | 384 | |
97fb7a0a | 385 | struct rt_bandwidth rt_bandwidth; |
029632fb PZ |
386 | #endif |
387 | ||
97fb7a0a IM |
388 | struct rcu_head rcu; |
389 | struct list_head list; | |
029632fb | 390 | |
97fb7a0a IM |
391 | struct task_group *parent; |
392 | struct list_head siblings; | |
393 | struct list_head children; | |
029632fb PZ |
394 | |
395 | #ifdef CONFIG_SCHED_AUTOGROUP | |
97fb7a0a | 396 | struct autogroup *autogroup; |
029632fb PZ |
397 | #endif |
398 | ||
97fb7a0a | 399 | struct cfs_bandwidth cfs_bandwidth; |
029632fb PZ |
400 | }; |
401 | ||
402 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
403 | #define ROOT_TASK_GROUP_LOAD NICE_0_LOAD | |
404 | ||
405 | /* | |
406 | * A weight of 0 or 1 can cause arithmetics problems. | |
407 | * A weight of a cfs_rq is the sum of weights of which entities | |
408 | * are queued on this cfs_rq, so a weight of a entity should not be | |
409 | * too large, so as the shares value of a task group. | |
410 | * (The default weight is 1024 - so there's no practical | |
411 | * limitation from this.) | |
412 | */ | |
97fb7a0a IM |
413 | #define MIN_SHARES (1UL << 1) |
414 | #define MAX_SHARES (1UL << 18) | |
029632fb PZ |
415 | #endif |
416 | ||
029632fb PZ |
417 | typedef int (*tg_visitor)(struct task_group *, void *); |
418 | ||
419 | extern int walk_tg_tree_from(struct task_group *from, | |
420 | tg_visitor down, tg_visitor up, void *data); | |
421 | ||
422 | /* | |
423 | * Iterate the full tree, calling @down when first entering a node and @up when | |
424 | * leaving it for the final time. | |
425 | * | |
426 | * Caller must hold rcu_lock or sufficient equivalent. | |
427 | */ | |
428 | static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data) | |
429 | { | |
430 | return walk_tg_tree_from(&root_task_group, down, up, data); | |
431 | } | |
432 | ||
433 | extern int tg_nop(struct task_group *tg, void *data); | |
434 | ||
435 | extern void free_fair_sched_group(struct task_group *tg); | |
436 | extern int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent); | |
8663e24d | 437 | extern void online_fair_sched_group(struct task_group *tg); |
6fe1f348 | 438 | extern void unregister_fair_sched_group(struct task_group *tg); |
029632fb PZ |
439 | extern void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq, |
440 | struct sched_entity *se, int cpu, | |
441 | struct sched_entity *parent); | |
442 | extern void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b); | |
029632fb PZ |
443 | |
444 | extern void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b); | |
77a4d1a1 | 445 | extern void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b); |
029632fb PZ |
446 | extern void unthrottle_cfs_rq(struct cfs_rq *cfs_rq); |
447 | ||
448 | extern void free_rt_sched_group(struct task_group *tg); | |
449 | extern int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent); | |
450 | extern void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq, | |
451 | struct sched_rt_entity *rt_se, int cpu, | |
452 | struct sched_rt_entity *parent); | |
8887cd99 NP |
453 | extern int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us); |
454 | extern int sched_group_set_rt_period(struct task_group *tg, u64 rt_period_us); | |
455 | extern long sched_group_rt_runtime(struct task_group *tg); | |
456 | extern long sched_group_rt_period(struct task_group *tg); | |
457 | extern int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk); | |
029632fb | 458 | |
25cc7da7 LZ |
459 | extern struct task_group *sched_create_group(struct task_group *parent); |
460 | extern void sched_online_group(struct task_group *tg, | |
461 | struct task_group *parent); | |
462 | extern void sched_destroy_group(struct task_group *tg); | |
463 | extern void sched_offline_group(struct task_group *tg); | |
464 | ||
465 | extern void sched_move_task(struct task_struct *tsk); | |
466 | ||
467 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
468 | extern int sched_group_set_shares(struct task_group *tg, unsigned long shares); | |
ad936d86 BP |
469 | |
470 | #ifdef CONFIG_SMP | |
471 | extern void set_task_rq_fair(struct sched_entity *se, | |
472 | struct cfs_rq *prev, struct cfs_rq *next); | |
473 | #else /* !CONFIG_SMP */ | |
474 | static inline void set_task_rq_fair(struct sched_entity *se, | |
475 | struct cfs_rq *prev, struct cfs_rq *next) { } | |
476 | #endif /* CONFIG_SMP */ | |
477 | #endif /* CONFIG_FAIR_GROUP_SCHED */ | |
25cc7da7 | 478 | |
029632fb PZ |
479 | #else /* CONFIG_CGROUP_SCHED */ |
480 | ||
481 | struct cfs_bandwidth { }; | |
482 | ||
483 | #endif /* CONFIG_CGROUP_SCHED */ | |
484 | ||
485 | /* CFS-related fields in a runqueue */ | |
486 | struct cfs_rq { | |
97fb7a0a IM |
487 | struct load_weight load; |
488 | unsigned long runnable_weight; | |
489 | unsigned int nr_running; | |
490 | unsigned int h_nr_running; | |
029632fb | 491 | |
97fb7a0a IM |
492 | u64 exec_clock; |
493 | u64 min_vruntime; | |
029632fb | 494 | #ifndef CONFIG_64BIT |
97fb7a0a | 495 | u64 min_vruntime_copy; |
029632fb PZ |
496 | #endif |
497 | ||
97fb7a0a | 498 | struct rb_root_cached tasks_timeline; |
029632fb | 499 | |
029632fb PZ |
500 | /* |
501 | * 'curr' points to currently running entity on this cfs_rq. | |
502 | * It is set to NULL otherwise (i.e when none are currently running). | |
503 | */ | |
97fb7a0a IM |
504 | struct sched_entity *curr; |
505 | struct sched_entity *next; | |
506 | struct sched_entity *last; | |
507 | struct sched_entity *skip; | |
029632fb PZ |
508 | |
509 | #ifdef CONFIG_SCHED_DEBUG | |
97fb7a0a | 510 | unsigned int nr_spread_over; |
029632fb PZ |
511 | #endif |
512 | ||
2dac754e PT |
513 | #ifdef CONFIG_SMP |
514 | /* | |
9d89c257 | 515 | * CFS load tracking |
2dac754e | 516 | */ |
97fb7a0a | 517 | struct sched_avg avg; |
2a2f5d4e | 518 | #ifndef CONFIG_64BIT |
97fb7a0a | 519 | u64 load_last_update_time_copy; |
9d89c257 | 520 | #endif |
2a2f5d4e PZ |
521 | struct { |
522 | raw_spinlock_t lock ____cacheline_aligned; | |
523 | int nr; | |
524 | unsigned long load_avg; | |
525 | unsigned long util_avg; | |
0e2d2aaa | 526 | unsigned long runnable_sum; |
2a2f5d4e | 527 | } removed; |
82958366 | 528 | |
9d89c257 | 529 | #ifdef CONFIG_FAIR_GROUP_SCHED |
97fb7a0a IM |
530 | unsigned long tg_load_avg_contrib; |
531 | long propagate; | |
532 | long prop_runnable_sum; | |
0e2d2aaa | 533 | |
82958366 PT |
534 | /* |
535 | * h_load = weight * f(tg) | |
536 | * | |
537 | * Where f(tg) is the recursive weight fraction assigned to | |
538 | * this group. | |
539 | */ | |
97fb7a0a IM |
540 | unsigned long h_load; |
541 | u64 last_h_load_update; | |
542 | struct sched_entity *h_load_next; | |
68520796 | 543 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
82958366 PT |
544 | #endif /* CONFIG_SMP */ |
545 | ||
029632fb | 546 | #ifdef CONFIG_FAIR_GROUP_SCHED |
97fb7a0a | 547 | struct rq *rq; /* CPU runqueue to which this cfs_rq is attached */ |
029632fb PZ |
548 | |
549 | /* | |
550 | * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in | |
551 | * a hierarchy). Non-leaf lrqs hold other higher schedulable entities | |
552 | * (like users, containers etc.) | |
553 | * | |
97fb7a0a IM |
554 | * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a CPU. |
555 | * This list is used during load balance. | |
029632fb | 556 | */ |
97fb7a0a IM |
557 | int on_list; |
558 | struct list_head leaf_cfs_rq_list; | |
559 | struct task_group *tg; /* group that "owns" this runqueue */ | |
029632fb | 560 | |
029632fb | 561 | #ifdef CONFIG_CFS_BANDWIDTH |
97fb7a0a | 562 | int runtime_enabled; |
512ac999 | 563 | int expires_seq; |
97fb7a0a IM |
564 | u64 runtime_expires; |
565 | s64 runtime_remaining; | |
566 | ||
567 | u64 throttled_clock; | |
568 | u64 throttled_clock_task; | |
569 | u64 throttled_clock_task_time; | |
570 | int throttled; | |
571 | int throttle_count; | |
572 | struct list_head throttled_list; | |
029632fb PZ |
573 | #endif /* CONFIG_CFS_BANDWIDTH */ |
574 | #endif /* CONFIG_FAIR_GROUP_SCHED */ | |
575 | }; | |
576 | ||
577 | static inline int rt_bandwidth_enabled(void) | |
578 | { | |
579 | return sysctl_sched_rt_runtime >= 0; | |
580 | } | |
581 | ||
b6366f04 | 582 | /* RT IPI pull logic requires IRQ_WORK */ |
4bdced5c | 583 | #if defined(CONFIG_IRQ_WORK) && defined(CONFIG_SMP) |
b6366f04 SR |
584 | # define HAVE_RT_PUSH_IPI |
585 | #endif | |
586 | ||
029632fb PZ |
587 | /* Real-Time classes' related field in a runqueue: */ |
588 | struct rt_rq { | |
97fb7a0a IM |
589 | struct rt_prio_array active; |
590 | unsigned int rt_nr_running; | |
591 | unsigned int rr_nr_running; | |
029632fb PZ |
592 | #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED |
593 | struct { | |
97fb7a0a | 594 | int curr; /* highest queued rt task prio */ |
029632fb | 595 | #ifdef CONFIG_SMP |
97fb7a0a | 596 | int next; /* next highest */ |
029632fb PZ |
597 | #endif |
598 | } highest_prio; | |
599 | #endif | |
600 | #ifdef CONFIG_SMP | |
97fb7a0a IM |
601 | unsigned long rt_nr_migratory; |
602 | unsigned long rt_nr_total; | |
603 | int overloaded; | |
604 | struct plist_head pushable_tasks; | |
371bf427 | 605 | |
b6366f04 | 606 | #endif /* CONFIG_SMP */ |
97fb7a0a | 607 | int rt_queued; |
f4ebcbc0 | 608 | |
97fb7a0a IM |
609 | int rt_throttled; |
610 | u64 rt_time; | |
611 | u64 rt_runtime; | |
029632fb | 612 | /* Nests inside the rq lock: */ |
97fb7a0a | 613 | raw_spinlock_t rt_runtime_lock; |
029632fb PZ |
614 | |
615 | #ifdef CONFIG_RT_GROUP_SCHED | |
97fb7a0a | 616 | unsigned long rt_nr_boosted; |
029632fb | 617 | |
97fb7a0a IM |
618 | struct rq *rq; |
619 | struct task_group *tg; | |
029632fb PZ |
620 | #endif |
621 | }; | |
622 | ||
296b2ffe VG |
623 | static inline bool rt_rq_is_runnable(struct rt_rq *rt_rq) |
624 | { | |
625 | return rt_rq->rt_queued && rt_rq->rt_nr_running; | |
626 | } | |
627 | ||
aab03e05 DF |
628 | /* Deadline class' related fields in a runqueue */ |
629 | struct dl_rq { | |
630 | /* runqueue is an rbtree, ordered by deadline */ | |
97fb7a0a | 631 | struct rb_root_cached root; |
aab03e05 | 632 | |
97fb7a0a | 633 | unsigned long dl_nr_running; |
1baca4ce JL |
634 | |
635 | #ifdef CONFIG_SMP | |
636 | /* | |
637 | * Deadline values of the currently executing and the | |
638 | * earliest ready task on this rq. Caching these facilitates | |
639 | * the decision wether or not a ready but not running task | |
640 | * should migrate somewhere else. | |
641 | */ | |
642 | struct { | |
97fb7a0a IM |
643 | u64 curr; |
644 | u64 next; | |
1baca4ce JL |
645 | } earliest_dl; |
646 | ||
97fb7a0a IM |
647 | unsigned long dl_nr_migratory; |
648 | int overloaded; | |
1baca4ce JL |
649 | |
650 | /* | |
651 | * Tasks on this rq that can be pushed away. They are kept in | |
652 | * an rb-tree, ordered by tasks' deadlines, with caching | |
653 | * of the leftmost (earliest deadline) element. | |
654 | */ | |
97fb7a0a | 655 | struct rb_root_cached pushable_dl_tasks_root; |
332ac17e | 656 | #else |
97fb7a0a | 657 | struct dl_bw dl_bw; |
1baca4ce | 658 | #endif |
e36d8677 LA |
659 | /* |
660 | * "Active utilization" for this runqueue: increased when a | |
661 | * task wakes up (becomes TASK_RUNNING) and decreased when a | |
662 | * task blocks | |
663 | */ | |
97fb7a0a | 664 | u64 running_bw; |
4da3abce | 665 | |
8fd27231 LA |
666 | /* |
667 | * Utilization of the tasks "assigned" to this runqueue (including | |
668 | * the tasks that are in runqueue and the tasks that executed on this | |
669 | * CPU and blocked). Increased when a task moves to this runqueue, and | |
670 | * decreased when the task moves away (migrates, changes scheduling | |
671 | * policy, or terminates). | |
672 | * This is needed to compute the "inactive utilization" for the | |
673 | * runqueue (inactive utilization = this_bw - running_bw). | |
674 | */ | |
97fb7a0a IM |
675 | u64 this_bw; |
676 | u64 extra_bw; | |
8fd27231 | 677 | |
4da3abce LA |
678 | /* |
679 | * Inverse of the fraction of CPU utilization that can be reclaimed | |
680 | * by the GRUB algorithm. | |
681 | */ | |
97fb7a0a | 682 | u64 bw_ratio; |
aab03e05 DF |
683 | }; |
684 | ||
c0796298 VG |
685 | #ifdef CONFIG_FAIR_GROUP_SCHED |
686 | /* An entity is a task if it doesn't "own" a runqueue */ | |
687 | #define entity_is_task(se) (!se->my_q) | |
688 | #else | |
689 | #define entity_is_task(se) 1 | |
690 | #endif | |
691 | ||
029632fb | 692 | #ifdef CONFIG_SMP |
c0796298 VG |
693 | /* |
694 | * XXX we want to get rid of these helpers and use the full load resolution. | |
695 | */ | |
696 | static inline long se_weight(struct sched_entity *se) | |
697 | { | |
698 | return scale_load_down(se->load.weight); | |
699 | } | |
700 | ||
701 | static inline long se_runnable(struct sched_entity *se) | |
702 | { | |
703 | return scale_load_down(se->runnable_weight); | |
704 | } | |
029632fb | 705 | |
afe06efd TC |
706 | static inline bool sched_asym_prefer(int a, int b) |
707 | { | |
708 | return arch_asym_cpu_priority(a) > arch_asym_cpu_priority(b); | |
709 | } | |
710 | ||
029632fb PZ |
711 | /* |
712 | * We add the notion of a root-domain which will be used to define per-domain | |
713 | * variables. Each exclusive cpuset essentially defines an island domain by | |
97fb7a0a | 714 | * fully partitioning the member CPUs from any other cpuset. Whenever a new |
029632fb PZ |
715 | * exclusive cpuset is created, we also create and attach a new root-domain |
716 | * object. | |
717 | * | |
718 | */ | |
719 | struct root_domain { | |
97fb7a0a IM |
720 | atomic_t refcount; |
721 | atomic_t rto_count; | |
722 | struct rcu_head rcu; | |
723 | cpumask_var_t span; | |
724 | cpumask_var_t online; | |
029632fb | 725 | |
757ffdd7 VS |
726 | /* |
727 | * Indicate pullable load on at least one CPU, e.g: | |
728 | * - More than one runnable task | |
729 | * - Running task is misfit | |
730 | */ | |
575638d1 | 731 | int overload; |
4486edd1 | 732 | |
1baca4ce JL |
733 | /* |
734 | * The bit corresponding to a CPU gets set here if such CPU has more | |
735 | * than one runnable -deadline task (as it is below for RT tasks). | |
736 | */ | |
97fb7a0a IM |
737 | cpumask_var_t dlo_mask; |
738 | atomic_t dlo_count; | |
739 | struct dl_bw dl_bw; | |
740 | struct cpudl cpudl; | |
1baca4ce | 741 | |
4bdced5c SRRH |
742 | #ifdef HAVE_RT_PUSH_IPI |
743 | /* | |
744 | * For IPI pull requests, loop across the rto_mask. | |
745 | */ | |
97fb7a0a IM |
746 | struct irq_work rto_push_work; |
747 | raw_spinlock_t rto_lock; | |
4bdced5c | 748 | /* These are only updated and read within rto_lock */ |
97fb7a0a IM |
749 | int rto_loop; |
750 | int rto_cpu; | |
4bdced5c | 751 | /* These atomics are updated outside of a lock */ |
97fb7a0a IM |
752 | atomic_t rto_loop_next; |
753 | atomic_t rto_loop_start; | |
4bdced5c | 754 | #endif |
029632fb PZ |
755 | /* |
756 | * The "RT overload" flag: it gets set if a CPU has more than | |
757 | * one runnable RT task. | |
758 | */ | |
97fb7a0a IM |
759 | cpumask_var_t rto_mask; |
760 | struct cpupri cpupri; | |
cd92bfd3 | 761 | |
97fb7a0a | 762 | unsigned long max_cpu_capacity; |
029632fb PZ |
763 | }; |
764 | ||
765 | extern struct root_domain def_root_domain; | |
f2cb1360 | 766 | extern struct mutex sched_domains_mutex; |
f2cb1360 IM |
767 | |
768 | extern void init_defrootdomain(void); | |
8d5dc512 | 769 | extern int sched_init_domains(const struct cpumask *cpu_map); |
f2cb1360 | 770 | extern void rq_attach_root(struct rq *rq, struct root_domain *rd); |
364f5665 SRV |
771 | extern void sched_get_rd(struct root_domain *rd); |
772 | extern void sched_put_rd(struct root_domain *rd); | |
029632fb | 773 | |
4bdced5c SRRH |
774 | #ifdef HAVE_RT_PUSH_IPI |
775 | extern void rto_push_irq_work_func(struct irq_work *work); | |
776 | #endif | |
029632fb PZ |
777 | #endif /* CONFIG_SMP */ |
778 | ||
779 | /* | |
780 | * This is the main, per-CPU runqueue data structure. | |
781 | * | |
782 | * Locking rule: those places that want to lock multiple runqueues | |
783 | * (such as the load balancing or the thread migration code), lock | |
784 | * acquire operations must be ordered by ascending &runqueue. | |
785 | */ | |
786 | struct rq { | |
787 | /* runqueue lock: */ | |
97fb7a0a | 788 | raw_spinlock_t lock; |
029632fb PZ |
789 | |
790 | /* | |
791 | * nr_running and cpu_load should be in the same cacheline because | |
792 | * remote CPUs use both these fields when doing load calculation. | |
793 | */ | |
97fb7a0a | 794 | unsigned int nr_running; |
0ec8aa00 | 795 | #ifdef CONFIG_NUMA_BALANCING |
97fb7a0a IM |
796 | unsigned int nr_numa_running; |
797 | unsigned int nr_preferred_running; | |
a4739eca | 798 | unsigned int numa_migrate_on; |
0ec8aa00 | 799 | #endif |
029632fb | 800 | #define CPU_LOAD_IDX_MAX 5 |
97fb7a0a | 801 | unsigned long cpu_load[CPU_LOAD_IDX_MAX]; |
3451d024 | 802 | #ifdef CONFIG_NO_HZ_COMMON |
9fd81dd5 | 803 | #ifdef CONFIG_SMP |
97fb7a0a | 804 | unsigned long last_load_update_tick; |
e022e0d3 | 805 | unsigned long last_blocked_load_update_tick; |
f643ea22 | 806 | unsigned int has_blocked_load; |
9fd81dd5 | 807 | #endif /* CONFIG_SMP */ |
00357f5e | 808 | unsigned int nohz_tick_stopped; |
a22e47a4 | 809 | atomic_t nohz_flags; |
9fd81dd5 | 810 | #endif /* CONFIG_NO_HZ_COMMON */ |
dcdedb24 | 811 | |
97fb7a0a IM |
812 | /* capture load from *all* tasks on this CPU: */ |
813 | struct load_weight load; | |
814 | unsigned long nr_load_updates; | |
815 | u64 nr_switches; | |
029632fb | 816 | |
97fb7a0a IM |
817 | struct cfs_rq cfs; |
818 | struct rt_rq rt; | |
819 | struct dl_rq dl; | |
029632fb PZ |
820 | |
821 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
97fb7a0a IM |
822 | /* list of leaf cfs_rq on this CPU: */ |
823 | struct list_head leaf_cfs_rq_list; | |
824 | struct list_head *tmp_alone_branch; | |
a35b6466 PZ |
825 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
826 | ||
029632fb PZ |
827 | /* |
828 | * This is part of a global counter where only the total sum | |
829 | * over all CPUs matters. A task can increase this counter on | |
830 | * one CPU and if it got migrated afterwards it may decrease | |
831 | * it on another CPU. Always updated under the runqueue lock: | |
832 | */ | |
97fb7a0a | 833 | unsigned long nr_uninterruptible; |
029632fb | 834 | |
97fb7a0a IM |
835 | struct task_struct *curr; |
836 | struct task_struct *idle; | |
837 | struct task_struct *stop; | |
838 | unsigned long next_balance; | |
839 | struct mm_struct *prev_mm; | |
029632fb | 840 | |
97fb7a0a IM |
841 | unsigned int clock_update_flags; |
842 | u64 clock; | |
843 | u64 clock_task; | |
029632fb | 844 | |
97fb7a0a | 845 | atomic_t nr_iowait; |
029632fb PZ |
846 | |
847 | #ifdef CONFIG_SMP | |
97fb7a0a IM |
848 | struct root_domain *rd; |
849 | struct sched_domain *sd; | |
850 | ||
851 | unsigned long cpu_capacity; | |
852 | unsigned long cpu_capacity_orig; | |
029632fb | 853 | |
97fb7a0a | 854 | struct callback_head *balance_callback; |
029632fb | 855 | |
97fb7a0a | 856 | unsigned char idle_balance; |
e3fca9e7 | 857 | |
3b1baa64 MR |
858 | unsigned long misfit_task_load; |
859 | ||
029632fb | 860 | /* For active balancing */ |
97fb7a0a IM |
861 | int active_balance; |
862 | int push_cpu; | |
863 | struct cpu_stop_work active_balance_work; | |
864 | ||
865 | /* CPU of this runqueue: */ | |
866 | int cpu; | |
867 | int online; | |
029632fb | 868 | |
367456c7 PZ |
869 | struct list_head cfs_tasks; |
870 | ||
371bf427 | 871 | struct sched_avg avg_rt; |
3727e0e1 | 872 | struct sched_avg avg_dl; |
11d4afd4 | 873 | #ifdef CONFIG_HAVE_SCHED_AVG_IRQ |
91c27493 VG |
874 | struct sched_avg avg_irq; |
875 | #endif | |
97fb7a0a IM |
876 | u64 idle_stamp; |
877 | u64 avg_idle; | |
9bd721c5 JL |
878 | |
879 | /* This is used to determine avg_idle's max value */ | |
97fb7a0a | 880 | u64 max_idle_balance_cost; |
029632fb PZ |
881 | #endif |
882 | ||
883 | #ifdef CONFIG_IRQ_TIME_ACCOUNTING | |
97fb7a0a | 884 | u64 prev_irq_time; |
029632fb PZ |
885 | #endif |
886 | #ifdef CONFIG_PARAVIRT | |
97fb7a0a | 887 | u64 prev_steal_time; |
029632fb PZ |
888 | #endif |
889 | #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING | |
97fb7a0a | 890 | u64 prev_steal_time_rq; |
029632fb PZ |
891 | #endif |
892 | ||
893 | /* calc_load related fields */ | |
97fb7a0a IM |
894 | unsigned long calc_load_update; |
895 | long calc_load_active; | |
029632fb PZ |
896 | |
897 | #ifdef CONFIG_SCHED_HRTICK | |
898 | #ifdef CONFIG_SMP | |
97fb7a0a IM |
899 | int hrtick_csd_pending; |
900 | call_single_data_t hrtick_csd; | |
029632fb | 901 | #endif |
97fb7a0a | 902 | struct hrtimer hrtick_timer; |
029632fb PZ |
903 | #endif |
904 | ||
905 | #ifdef CONFIG_SCHEDSTATS | |
906 | /* latency stats */ | |
97fb7a0a IM |
907 | struct sched_info rq_sched_info; |
908 | unsigned long long rq_cpu_time; | |
029632fb PZ |
909 | /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */ |
910 | ||
911 | /* sys_sched_yield() stats */ | |
97fb7a0a | 912 | unsigned int yld_count; |
029632fb PZ |
913 | |
914 | /* schedule() stats */ | |
97fb7a0a IM |
915 | unsigned int sched_count; |
916 | unsigned int sched_goidle; | |
029632fb PZ |
917 | |
918 | /* try_to_wake_up() stats */ | |
97fb7a0a IM |
919 | unsigned int ttwu_count; |
920 | unsigned int ttwu_local; | |
029632fb PZ |
921 | #endif |
922 | ||
923 | #ifdef CONFIG_SMP | |
97fb7a0a | 924 | struct llist_head wake_list; |
029632fb | 925 | #endif |
442bf3aa DL |
926 | |
927 | #ifdef CONFIG_CPU_IDLE | |
928 | /* Must be inspected within a rcu lock section */ | |
97fb7a0a | 929 | struct cpuidle_state *idle_state; |
442bf3aa | 930 | #endif |
029632fb PZ |
931 | }; |
932 | ||
933 | static inline int cpu_of(struct rq *rq) | |
934 | { | |
935 | #ifdef CONFIG_SMP | |
936 | return rq->cpu; | |
937 | #else | |
938 | return 0; | |
939 | #endif | |
940 | } | |
941 | ||
1b568f0a PZ |
942 | |
943 | #ifdef CONFIG_SCHED_SMT | |
944 | ||
945 | extern struct static_key_false sched_smt_present; | |
946 | ||
947 | extern void __update_idle_core(struct rq *rq); | |
948 | ||
949 | static inline void update_idle_core(struct rq *rq) | |
950 | { | |
951 | if (static_branch_unlikely(&sched_smt_present)) | |
952 | __update_idle_core(rq); | |
953 | } | |
954 | ||
955 | #else | |
956 | static inline void update_idle_core(struct rq *rq) { } | |
957 | #endif | |
958 | ||
8b06c55b | 959 | DECLARE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); |
029632fb | 960 | |
518cd623 | 961 | #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu))) |
4a32fea9 | 962 | #define this_rq() this_cpu_ptr(&runqueues) |
518cd623 PZ |
963 | #define task_rq(p) cpu_rq(task_cpu(p)) |
964 | #define cpu_curr(cpu) (cpu_rq(cpu)->curr) | |
4a32fea9 | 965 | #define raw_rq() raw_cpu_ptr(&runqueues) |
518cd623 | 966 | |
1f351d7f JW |
967 | extern void update_rq_clock(struct rq *rq); |
968 | ||
cebde6d6 PZ |
969 | static inline u64 __rq_clock_broken(struct rq *rq) |
970 | { | |
316c1608 | 971 | return READ_ONCE(rq->clock); |
cebde6d6 PZ |
972 | } |
973 | ||
cb42c9a3 MF |
974 | /* |
975 | * rq::clock_update_flags bits | |
976 | * | |
977 | * %RQCF_REQ_SKIP - will request skipping of clock update on the next | |
978 | * call to __schedule(). This is an optimisation to avoid | |
979 | * neighbouring rq clock updates. | |
980 | * | |
981 | * %RQCF_ACT_SKIP - is set from inside of __schedule() when skipping is | |
982 | * in effect and calls to update_rq_clock() are being ignored. | |
983 | * | |
984 | * %RQCF_UPDATED - is a debug flag that indicates whether a call has been | |
985 | * made to update_rq_clock() since the last time rq::lock was pinned. | |
986 | * | |
987 | * If inside of __schedule(), clock_update_flags will have been | |
988 | * shifted left (a left shift is a cheap operation for the fast path | |
989 | * to promote %RQCF_REQ_SKIP to %RQCF_ACT_SKIP), so you must use, | |
990 | * | |
991 | * if (rq-clock_update_flags >= RQCF_UPDATED) | |
992 | * | |
993 | * to check if %RQCF_UPADTED is set. It'll never be shifted more than | |
994 | * one position though, because the next rq_unpin_lock() will shift it | |
995 | * back. | |
996 | */ | |
97fb7a0a IM |
997 | #define RQCF_REQ_SKIP 0x01 |
998 | #define RQCF_ACT_SKIP 0x02 | |
999 | #define RQCF_UPDATED 0x04 | |
cb42c9a3 MF |
1000 | |
1001 | static inline void assert_clock_updated(struct rq *rq) | |
1002 | { | |
1003 | /* | |
1004 | * The only reason for not seeing a clock update since the | |
1005 | * last rq_pin_lock() is if we're currently skipping updates. | |
1006 | */ | |
1007 | SCHED_WARN_ON(rq->clock_update_flags < RQCF_ACT_SKIP); | |
1008 | } | |
1009 | ||
78becc27 FW |
1010 | static inline u64 rq_clock(struct rq *rq) |
1011 | { | |
cebde6d6 | 1012 | lockdep_assert_held(&rq->lock); |
cb42c9a3 MF |
1013 | assert_clock_updated(rq); |
1014 | ||
78becc27 FW |
1015 | return rq->clock; |
1016 | } | |
1017 | ||
1018 | static inline u64 rq_clock_task(struct rq *rq) | |
1019 | { | |
cebde6d6 | 1020 | lockdep_assert_held(&rq->lock); |
cb42c9a3 MF |
1021 | assert_clock_updated(rq); |
1022 | ||
78becc27 FW |
1023 | return rq->clock_task; |
1024 | } | |
1025 | ||
adcc8da8 | 1026 | static inline void rq_clock_skip_update(struct rq *rq) |
9edfbfed PZ |
1027 | { |
1028 | lockdep_assert_held(&rq->lock); | |
adcc8da8 DB |
1029 | rq->clock_update_flags |= RQCF_REQ_SKIP; |
1030 | } | |
1031 | ||
1032 | /* | |
595058b6 | 1033 | * See rt task throttling, which is the only time a skip |
adcc8da8 DB |
1034 | * request is cancelled. |
1035 | */ | |
1036 | static inline void rq_clock_cancel_skipupdate(struct rq *rq) | |
1037 | { | |
1038 | lockdep_assert_held(&rq->lock); | |
1039 | rq->clock_update_flags &= ~RQCF_REQ_SKIP; | |
9edfbfed PZ |
1040 | } |
1041 | ||
d8ac8971 MF |
1042 | struct rq_flags { |
1043 | unsigned long flags; | |
1044 | struct pin_cookie cookie; | |
cb42c9a3 MF |
1045 | #ifdef CONFIG_SCHED_DEBUG |
1046 | /* | |
1047 | * A copy of (rq::clock_update_flags & RQCF_UPDATED) for the | |
1048 | * current pin context is stashed here in case it needs to be | |
1049 | * restored in rq_repin_lock(). | |
1050 | */ | |
1051 | unsigned int clock_update_flags; | |
1052 | #endif | |
d8ac8971 MF |
1053 | }; |
1054 | ||
1055 | static inline void rq_pin_lock(struct rq *rq, struct rq_flags *rf) | |
1056 | { | |
1057 | rf->cookie = lockdep_pin_lock(&rq->lock); | |
cb42c9a3 MF |
1058 | |
1059 | #ifdef CONFIG_SCHED_DEBUG | |
1060 | rq->clock_update_flags &= (RQCF_REQ_SKIP|RQCF_ACT_SKIP); | |
1061 | rf->clock_update_flags = 0; | |
1062 | #endif | |
d8ac8971 MF |
1063 | } |
1064 | ||
1065 | static inline void rq_unpin_lock(struct rq *rq, struct rq_flags *rf) | |
1066 | { | |
cb42c9a3 MF |
1067 | #ifdef CONFIG_SCHED_DEBUG |
1068 | if (rq->clock_update_flags > RQCF_ACT_SKIP) | |
1069 | rf->clock_update_flags = RQCF_UPDATED; | |
1070 | #endif | |
1071 | ||
d8ac8971 MF |
1072 | lockdep_unpin_lock(&rq->lock, rf->cookie); |
1073 | } | |
1074 | ||
1075 | static inline void rq_repin_lock(struct rq *rq, struct rq_flags *rf) | |
1076 | { | |
1077 | lockdep_repin_lock(&rq->lock, rf->cookie); | |
cb42c9a3 MF |
1078 | |
1079 | #ifdef CONFIG_SCHED_DEBUG | |
1080 | /* | |
1081 | * Restore the value we stashed in @rf for this pin context. | |
1082 | */ | |
1083 | rq->clock_update_flags |= rf->clock_update_flags; | |
1084 | #endif | |
d8ac8971 MF |
1085 | } |
1086 | ||
1f351d7f JW |
1087 | struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf) |
1088 | __acquires(rq->lock); | |
1089 | ||
1090 | struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf) | |
1091 | __acquires(p->pi_lock) | |
1092 | __acquires(rq->lock); | |
1093 | ||
1094 | static inline void __task_rq_unlock(struct rq *rq, struct rq_flags *rf) | |
1095 | __releases(rq->lock) | |
1096 | { | |
1097 | rq_unpin_lock(rq, rf); | |
1098 | raw_spin_unlock(&rq->lock); | |
1099 | } | |
1100 | ||
1101 | static inline void | |
1102 | task_rq_unlock(struct rq *rq, struct task_struct *p, struct rq_flags *rf) | |
1103 | __releases(rq->lock) | |
1104 | __releases(p->pi_lock) | |
1105 | { | |
1106 | rq_unpin_lock(rq, rf); | |
1107 | raw_spin_unlock(&rq->lock); | |
1108 | raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags); | |
1109 | } | |
1110 | ||
1111 | static inline void | |
1112 | rq_lock_irqsave(struct rq *rq, struct rq_flags *rf) | |
1113 | __acquires(rq->lock) | |
1114 | { | |
1115 | raw_spin_lock_irqsave(&rq->lock, rf->flags); | |
1116 | rq_pin_lock(rq, rf); | |
1117 | } | |
1118 | ||
1119 | static inline void | |
1120 | rq_lock_irq(struct rq *rq, struct rq_flags *rf) | |
1121 | __acquires(rq->lock) | |
1122 | { | |
1123 | raw_spin_lock_irq(&rq->lock); | |
1124 | rq_pin_lock(rq, rf); | |
1125 | } | |
1126 | ||
1127 | static inline void | |
1128 | rq_lock(struct rq *rq, struct rq_flags *rf) | |
1129 | __acquires(rq->lock) | |
1130 | { | |
1131 | raw_spin_lock(&rq->lock); | |
1132 | rq_pin_lock(rq, rf); | |
1133 | } | |
1134 | ||
1135 | static inline void | |
1136 | rq_relock(struct rq *rq, struct rq_flags *rf) | |
1137 | __acquires(rq->lock) | |
1138 | { | |
1139 | raw_spin_lock(&rq->lock); | |
1140 | rq_repin_lock(rq, rf); | |
1141 | } | |
1142 | ||
1143 | static inline void | |
1144 | rq_unlock_irqrestore(struct rq *rq, struct rq_flags *rf) | |
1145 | __releases(rq->lock) | |
1146 | { | |
1147 | rq_unpin_lock(rq, rf); | |
1148 | raw_spin_unlock_irqrestore(&rq->lock, rf->flags); | |
1149 | } | |
1150 | ||
1151 | static inline void | |
1152 | rq_unlock_irq(struct rq *rq, struct rq_flags *rf) | |
1153 | __releases(rq->lock) | |
1154 | { | |
1155 | rq_unpin_lock(rq, rf); | |
1156 | raw_spin_unlock_irq(&rq->lock); | |
1157 | } | |
1158 | ||
1159 | static inline void | |
1160 | rq_unlock(struct rq *rq, struct rq_flags *rf) | |
1161 | __releases(rq->lock) | |
1162 | { | |
1163 | rq_unpin_lock(rq, rf); | |
1164 | raw_spin_unlock(&rq->lock); | |
1165 | } | |
1166 | ||
246b3b33 JW |
1167 | static inline struct rq * |
1168 | this_rq_lock_irq(struct rq_flags *rf) | |
1169 | __acquires(rq->lock) | |
1170 | { | |
1171 | struct rq *rq; | |
1172 | ||
1173 | local_irq_disable(); | |
1174 | rq = this_rq(); | |
1175 | rq_lock(rq, rf); | |
1176 | return rq; | |
1177 | } | |
1178 | ||
9942f79b | 1179 | #ifdef CONFIG_NUMA |
e3fe70b1 RR |
1180 | enum numa_topology_type { |
1181 | NUMA_DIRECT, | |
1182 | NUMA_GLUELESS_MESH, | |
1183 | NUMA_BACKPLANE, | |
1184 | }; | |
1185 | extern enum numa_topology_type sched_numa_topology_type; | |
9942f79b RR |
1186 | extern int sched_max_numa_distance; |
1187 | extern bool find_numa_distance(int distance); | |
1188 | #endif | |
1189 | ||
f2cb1360 IM |
1190 | #ifdef CONFIG_NUMA |
1191 | extern void sched_init_numa(void); | |
1192 | extern void sched_domains_numa_masks_set(unsigned int cpu); | |
1193 | extern void sched_domains_numa_masks_clear(unsigned int cpu); | |
1194 | #else | |
1195 | static inline void sched_init_numa(void) { } | |
1196 | static inline void sched_domains_numa_masks_set(unsigned int cpu) { } | |
1197 | static inline void sched_domains_numa_masks_clear(unsigned int cpu) { } | |
1198 | #endif | |
1199 | ||
f809ca9a | 1200 | #ifdef CONFIG_NUMA_BALANCING |
44dba3d5 IM |
1201 | /* The regions in numa_faults array from task_struct */ |
1202 | enum numa_faults_stats { | |
1203 | NUMA_MEM = 0, | |
1204 | NUMA_CPU, | |
1205 | NUMA_MEMBUF, | |
1206 | NUMA_CPUBUF | |
1207 | }; | |
0ec8aa00 | 1208 | extern void sched_setnuma(struct task_struct *p, int node); |
e6628d5b | 1209 | extern int migrate_task_to(struct task_struct *p, int cpu); |
0ad4e3df SD |
1210 | extern int migrate_swap(struct task_struct *p, struct task_struct *t, |
1211 | int cpu, int scpu); | |
13784475 MG |
1212 | extern void init_numa_balancing(unsigned long clone_flags, struct task_struct *p); |
1213 | #else | |
1214 | static inline void | |
1215 | init_numa_balancing(unsigned long clone_flags, struct task_struct *p) | |
1216 | { | |
1217 | } | |
f809ca9a MG |
1218 | #endif /* CONFIG_NUMA_BALANCING */ |
1219 | ||
518cd623 PZ |
1220 | #ifdef CONFIG_SMP |
1221 | ||
e3fca9e7 PZ |
1222 | static inline void |
1223 | queue_balance_callback(struct rq *rq, | |
1224 | struct callback_head *head, | |
1225 | void (*func)(struct rq *rq)) | |
1226 | { | |
1227 | lockdep_assert_held(&rq->lock); | |
1228 | ||
1229 | if (unlikely(head->next)) | |
1230 | return; | |
1231 | ||
1232 | head->func = (void (*)(struct callback_head *))func; | |
1233 | head->next = rq->balance_callback; | |
1234 | rq->balance_callback = head; | |
1235 | } | |
1236 | ||
e3baac47 PZ |
1237 | extern void sched_ttwu_pending(void); |
1238 | ||
029632fb PZ |
1239 | #define rcu_dereference_check_sched_domain(p) \ |
1240 | rcu_dereference_check((p), \ | |
1241 | lockdep_is_held(&sched_domains_mutex)) | |
1242 | ||
1243 | /* | |
1244 | * The domain tree (rq->sd) is protected by RCU's quiescent state transition. | |
1245 | * See detach_destroy_domains: synchronize_sched for details. | |
1246 | * | |
1247 | * The domain tree of any CPU may only be accessed from within | |
1248 | * preempt-disabled sections. | |
1249 | */ | |
1250 | #define for_each_domain(cpu, __sd) \ | |
518cd623 PZ |
1251 | for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); \ |
1252 | __sd; __sd = __sd->parent) | |
029632fb | 1253 | |
77e81365 SS |
1254 | #define for_each_lower_domain(sd) for (; sd; sd = sd->child) |
1255 | ||
518cd623 PZ |
1256 | /** |
1257 | * highest_flag_domain - Return highest sched_domain containing flag. | |
97fb7a0a | 1258 | * @cpu: The CPU whose highest level of sched domain is to |
518cd623 PZ |
1259 | * be returned. |
1260 | * @flag: The flag to check for the highest sched_domain | |
97fb7a0a | 1261 | * for the given CPU. |
518cd623 | 1262 | * |
97fb7a0a | 1263 | * Returns the highest sched_domain of a CPU which contains the given flag. |
518cd623 PZ |
1264 | */ |
1265 | static inline struct sched_domain *highest_flag_domain(int cpu, int flag) | |
1266 | { | |
1267 | struct sched_domain *sd, *hsd = NULL; | |
1268 | ||
1269 | for_each_domain(cpu, sd) { | |
1270 | if (!(sd->flags & flag)) | |
1271 | break; | |
1272 | hsd = sd; | |
1273 | } | |
1274 | ||
1275 | return hsd; | |
1276 | } | |
1277 | ||
fb13c7ee MG |
1278 | static inline struct sched_domain *lowest_flag_domain(int cpu, int flag) |
1279 | { | |
1280 | struct sched_domain *sd; | |
1281 | ||
1282 | for_each_domain(cpu, sd) { | |
1283 | if (sd->flags & flag) | |
1284 | break; | |
1285 | } | |
1286 | ||
1287 | return sd; | |
1288 | } | |
1289 | ||
518cd623 | 1290 | DECLARE_PER_CPU(struct sched_domain *, sd_llc); |
7d9ffa89 | 1291 | DECLARE_PER_CPU(int, sd_llc_size); |
518cd623 | 1292 | DECLARE_PER_CPU(int, sd_llc_id); |
0e369d75 | 1293 | DECLARE_PER_CPU(struct sched_domain_shared *, sd_llc_shared); |
fb13c7ee | 1294 | DECLARE_PER_CPU(struct sched_domain *, sd_numa); |
37dc6b50 | 1295 | DECLARE_PER_CPU(struct sched_domain *, sd_asym); |
df054e84 | 1296 | extern struct static_key_false sched_asym_cpucapacity; |
518cd623 | 1297 | |
63b2ca30 | 1298 | struct sched_group_capacity { |
97fb7a0a | 1299 | atomic_t ref; |
5e6521ea | 1300 | /* |
172895e6 | 1301 | * CPU capacity of this group, SCHED_CAPACITY_SCALE being max capacity |
63b2ca30 | 1302 | * for a single CPU. |
5e6521ea | 1303 | */ |
97fb7a0a IM |
1304 | unsigned long capacity; |
1305 | unsigned long min_capacity; /* Min per-CPU capacity in group */ | |
e3d6d0cb | 1306 | unsigned long max_capacity; /* Max per-CPU capacity in group */ |
97fb7a0a IM |
1307 | unsigned long next_update; |
1308 | int imbalance; /* XXX unrelated to capacity but shared group state */ | |
5e6521ea | 1309 | |
005f874d | 1310 | #ifdef CONFIG_SCHED_DEBUG |
97fb7a0a | 1311 | int id; |
005f874d PZ |
1312 | #endif |
1313 | ||
97fb7a0a | 1314 | unsigned long cpumask[0]; /* Balance mask */ |
5e6521ea LZ |
1315 | }; |
1316 | ||
1317 | struct sched_group { | |
97fb7a0a IM |
1318 | struct sched_group *next; /* Must be a circular list */ |
1319 | atomic_t ref; | |
5e6521ea | 1320 | |
97fb7a0a | 1321 | unsigned int group_weight; |
63b2ca30 | 1322 | struct sched_group_capacity *sgc; |
97fb7a0a | 1323 | int asym_prefer_cpu; /* CPU of highest priority in group */ |
5e6521ea LZ |
1324 | |
1325 | /* | |
1326 | * The CPUs this group covers. | |
1327 | * | |
1328 | * NOTE: this field is variable length. (Allocated dynamically | |
1329 | * by attaching extra space to the end of the structure, | |
1330 | * depending on how many CPUs the kernel has booted up with) | |
1331 | */ | |
97fb7a0a | 1332 | unsigned long cpumask[0]; |
5e6521ea LZ |
1333 | }; |
1334 | ||
ae4df9d6 | 1335 | static inline struct cpumask *sched_group_span(struct sched_group *sg) |
5e6521ea LZ |
1336 | { |
1337 | return to_cpumask(sg->cpumask); | |
1338 | } | |
1339 | ||
1340 | /* | |
e5c14b1f | 1341 | * See build_balance_mask(). |
5e6521ea | 1342 | */ |
e5c14b1f | 1343 | static inline struct cpumask *group_balance_mask(struct sched_group *sg) |
5e6521ea | 1344 | { |
63b2ca30 | 1345 | return to_cpumask(sg->sgc->cpumask); |
5e6521ea LZ |
1346 | } |
1347 | ||
1348 | /** | |
97fb7a0a IM |
1349 | * group_first_cpu - Returns the first CPU in the cpumask of a sched_group. |
1350 | * @group: The group whose first CPU is to be returned. | |
5e6521ea LZ |
1351 | */ |
1352 | static inline unsigned int group_first_cpu(struct sched_group *group) | |
1353 | { | |
ae4df9d6 | 1354 | return cpumask_first(sched_group_span(group)); |
5e6521ea LZ |
1355 | } |
1356 | ||
c1174876 PZ |
1357 | extern int group_balance_cpu(struct sched_group *sg); |
1358 | ||
3866e845 SRRH |
1359 | #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL) |
1360 | void register_sched_domain_sysctl(void); | |
bbdacdfe | 1361 | void dirty_sched_domain_sysctl(int cpu); |
3866e845 SRRH |
1362 | void unregister_sched_domain_sysctl(void); |
1363 | #else | |
1364 | static inline void register_sched_domain_sysctl(void) | |
1365 | { | |
1366 | } | |
bbdacdfe PZ |
1367 | static inline void dirty_sched_domain_sysctl(int cpu) |
1368 | { | |
1369 | } | |
3866e845 SRRH |
1370 | static inline void unregister_sched_domain_sysctl(void) |
1371 | { | |
1372 | } | |
1373 | #endif | |
1374 | ||
e3baac47 PZ |
1375 | #else |
1376 | ||
1377 | static inline void sched_ttwu_pending(void) { } | |
1378 | ||
518cd623 | 1379 | #endif /* CONFIG_SMP */ |
029632fb | 1380 | |
391e43da | 1381 | #include "stats.h" |
1051408f | 1382 | #include "autogroup.h" |
029632fb PZ |
1383 | |
1384 | #ifdef CONFIG_CGROUP_SCHED | |
1385 | ||
1386 | /* | |
1387 | * Return the group to which this tasks belongs. | |
1388 | * | |
8af01f56 TH |
1389 | * We cannot use task_css() and friends because the cgroup subsystem |
1390 | * changes that value before the cgroup_subsys::attach() method is called, | |
1391 | * therefore we cannot pin it and might observe the wrong value. | |
8323f26c PZ |
1392 | * |
1393 | * The same is true for autogroup's p->signal->autogroup->tg, the autogroup | |
1394 | * core changes this before calling sched_move_task(). | |
1395 | * | |
1396 | * Instead we use a 'copy' which is updated from sched_move_task() while | |
1397 | * holding both task_struct::pi_lock and rq::lock. | |
029632fb PZ |
1398 | */ |
1399 | static inline struct task_group *task_group(struct task_struct *p) | |
1400 | { | |
8323f26c | 1401 | return p->sched_task_group; |
029632fb PZ |
1402 | } |
1403 | ||
1404 | /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */ | |
1405 | static inline void set_task_rq(struct task_struct *p, unsigned int cpu) | |
1406 | { | |
1407 | #if defined(CONFIG_FAIR_GROUP_SCHED) || defined(CONFIG_RT_GROUP_SCHED) | |
1408 | struct task_group *tg = task_group(p); | |
1409 | #endif | |
1410 | ||
1411 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
ad936d86 | 1412 | set_task_rq_fair(&p->se, p->se.cfs_rq, tg->cfs_rq[cpu]); |
029632fb PZ |
1413 | p->se.cfs_rq = tg->cfs_rq[cpu]; |
1414 | p->se.parent = tg->se[cpu]; | |
1415 | #endif | |
1416 | ||
1417 | #ifdef CONFIG_RT_GROUP_SCHED | |
1418 | p->rt.rt_rq = tg->rt_rq[cpu]; | |
1419 | p->rt.parent = tg->rt_se[cpu]; | |
1420 | #endif | |
1421 | } | |
1422 | ||
1423 | #else /* CONFIG_CGROUP_SCHED */ | |
1424 | ||
1425 | static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { } | |
1426 | static inline struct task_group *task_group(struct task_struct *p) | |
1427 | { | |
1428 | return NULL; | |
1429 | } | |
1430 | ||
1431 | #endif /* CONFIG_CGROUP_SCHED */ | |
1432 | ||
1433 | static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu) | |
1434 | { | |
1435 | set_task_rq(p, cpu); | |
1436 | #ifdef CONFIG_SMP | |
1437 | /* | |
1438 | * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be | |
1439 | * successfuly executed on another CPU. We must ensure that updates of | |
1440 | * per-task data have been completed by this moment. | |
1441 | */ | |
1442 | smp_wmb(); | |
c65eacbe AL |
1443 | #ifdef CONFIG_THREAD_INFO_IN_TASK |
1444 | p->cpu = cpu; | |
1445 | #else | |
029632fb | 1446 | task_thread_info(p)->cpu = cpu; |
c65eacbe | 1447 | #endif |
ac66f547 | 1448 | p->wake_cpu = cpu; |
029632fb PZ |
1449 | #endif |
1450 | } | |
1451 | ||
1452 | /* | |
1453 | * Tunables that become constants when CONFIG_SCHED_DEBUG is off: | |
1454 | */ | |
1455 | #ifdef CONFIG_SCHED_DEBUG | |
c5905afb | 1456 | # include <linux/static_key.h> |
029632fb PZ |
1457 | # define const_debug __read_mostly |
1458 | #else | |
1459 | # define const_debug const | |
1460 | #endif | |
1461 | ||
029632fb PZ |
1462 | #define SCHED_FEAT(name, enabled) \ |
1463 | __SCHED_FEAT_##name , | |
1464 | ||
1465 | enum { | |
391e43da | 1466 | #include "features.h" |
f8b6d1cc | 1467 | __SCHED_FEAT_NR, |
029632fb PZ |
1468 | }; |
1469 | ||
1470 | #undef SCHED_FEAT | |
1471 | ||
f8b6d1cc | 1472 | #if defined(CONFIG_SCHED_DEBUG) && defined(HAVE_JUMP_LABEL) |
765cc3a4 PB |
1473 | |
1474 | /* | |
1475 | * To support run-time toggling of sched features, all the translation units | |
1476 | * (but core.c) reference the sysctl_sched_features defined in core.c. | |
1477 | */ | |
1478 | extern const_debug unsigned int sysctl_sched_features; | |
1479 | ||
f8b6d1cc | 1480 | #define SCHED_FEAT(name, enabled) \ |
c5905afb | 1481 | static __always_inline bool static_branch_##name(struct static_key *key) \ |
f8b6d1cc | 1482 | { \ |
6e76ea8a | 1483 | return static_key_##enabled(key); \ |
f8b6d1cc PZ |
1484 | } |
1485 | ||
1486 | #include "features.h" | |
f8b6d1cc PZ |
1487 | #undef SCHED_FEAT |
1488 | ||
c5905afb | 1489 | extern struct static_key sched_feat_keys[__SCHED_FEAT_NR]; |
f8b6d1cc | 1490 | #define sched_feat(x) (static_branch_##x(&sched_feat_keys[__SCHED_FEAT_##x])) |
765cc3a4 | 1491 | |
f8b6d1cc | 1492 | #else /* !(SCHED_DEBUG && HAVE_JUMP_LABEL) */ |
765cc3a4 PB |
1493 | |
1494 | /* | |
1495 | * Each translation unit has its own copy of sysctl_sched_features to allow | |
1496 | * constants propagation at compile time and compiler optimization based on | |
1497 | * features default. | |
1498 | */ | |
1499 | #define SCHED_FEAT(name, enabled) \ | |
1500 | (1UL << __SCHED_FEAT_##name) * enabled | | |
1501 | static const_debug __maybe_unused unsigned int sysctl_sched_features = | |
1502 | #include "features.h" | |
1503 | 0; | |
1504 | #undef SCHED_FEAT | |
1505 | ||
7e6f4c5d | 1506 | #define sched_feat(x) !!(sysctl_sched_features & (1UL << __SCHED_FEAT_##x)) |
765cc3a4 | 1507 | |
f8b6d1cc | 1508 | #endif /* SCHED_DEBUG && HAVE_JUMP_LABEL */ |
029632fb | 1509 | |
2a595721 | 1510 | extern struct static_key_false sched_numa_balancing; |
cb251765 | 1511 | extern struct static_key_false sched_schedstats; |
cbee9f88 | 1512 | |
029632fb PZ |
1513 | static inline u64 global_rt_period(void) |
1514 | { | |
1515 | return (u64)sysctl_sched_rt_period * NSEC_PER_USEC; | |
1516 | } | |
1517 | ||
1518 | static inline u64 global_rt_runtime(void) | |
1519 | { | |
1520 | if (sysctl_sched_rt_runtime < 0) | |
1521 | return RUNTIME_INF; | |
1522 | ||
1523 | return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC; | |
1524 | } | |
1525 | ||
029632fb PZ |
1526 | static inline int task_current(struct rq *rq, struct task_struct *p) |
1527 | { | |
1528 | return rq->curr == p; | |
1529 | } | |
1530 | ||
1531 | static inline int task_running(struct rq *rq, struct task_struct *p) | |
1532 | { | |
1533 | #ifdef CONFIG_SMP | |
1534 | return p->on_cpu; | |
1535 | #else | |
1536 | return task_current(rq, p); | |
1537 | #endif | |
1538 | } | |
1539 | ||
da0c1e65 KT |
1540 | static inline int task_on_rq_queued(struct task_struct *p) |
1541 | { | |
1542 | return p->on_rq == TASK_ON_RQ_QUEUED; | |
1543 | } | |
029632fb | 1544 | |
cca26e80 KT |
1545 | static inline int task_on_rq_migrating(struct task_struct *p) |
1546 | { | |
1547 | return p->on_rq == TASK_ON_RQ_MIGRATING; | |
1548 | } | |
1549 | ||
b13095f0 LZ |
1550 | /* |
1551 | * wake flags | |
1552 | */ | |
97fb7a0a IM |
1553 | #define WF_SYNC 0x01 /* Waker goes to sleep after wakeup */ |
1554 | #define WF_FORK 0x02 /* Child wakeup after fork */ | |
1555 | #define WF_MIGRATED 0x4 /* Internal use, task got migrated */ | |
b13095f0 | 1556 | |
029632fb PZ |
1557 | /* |
1558 | * To aid in avoiding the subversion of "niceness" due to uneven distribution | |
1559 | * of tasks with abnormal "nice" values across CPUs the contribution that | |
1560 | * each task makes to its run queue's load is weighted according to its | |
1561 | * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a | |
1562 | * scaled version of the new time slice allocation that they receive on time | |
1563 | * slice expiry etc. | |
1564 | */ | |
1565 | ||
97fb7a0a IM |
1566 | #define WEIGHT_IDLEPRIO 3 |
1567 | #define WMULT_IDLEPRIO 1431655765 | |
029632fb | 1568 | |
97fb7a0a IM |
1569 | extern const int sched_prio_to_weight[40]; |
1570 | extern const u32 sched_prio_to_wmult[40]; | |
029632fb | 1571 | |
ff77e468 PZ |
1572 | /* |
1573 | * {de,en}queue flags: | |
1574 | * | |
1575 | * DEQUEUE_SLEEP - task is no longer runnable | |
1576 | * ENQUEUE_WAKEUP - task just became runnable | |
1577 | * | |
1578 | * SAVE/RESTORE - an otherwise spurious dequeue/enqueue, done to ensure tasks | |
1579 | * are in a known state which allows modification. Such pairs | |
1580 | * should preserve as much state as possible. | |
1581 | * | |
1582 | * MOVE - paired with SAVE/RESTORE, explicitly does not preserve the location | |
1583 | * in the runqueue. | |
1584 | * | |
1585 | * ENQUEUE_HEAD - place at front of runqueue (tail if not specified) | |
1586 | * ENQUEUE_REPLENISH - CBS (replenish runtime and postpone deadline) | |
59efa0ba | 1587 | * ENQUEUE_MIGRATED - the task was migrated during wakeup |
ff77e468 PZ |
1588 | * |
1589 | */ | |
1590 | ||
1591 | #define DEQUEUE_SLEEP 0x01 | |
97fb7a0a IM |
1592 | #define DEQUEUE_SAVE 0x02 /* Matches ENQUEUE_RESTORE */ |
1593 | #define DEQUEUE_MOVE 0x04 /* Matches ENQUEUE_MOVE */ | |
1594 | #define DEQUEUE_NOCLOCK 0x08 /* Matches ENQUEUE_NOCLOCK */ | |
ff77e468 | 1595 | |
1de64443 | 1596 | #define ENQUEUE_WAKEUP 0x01 |
ff77e468 PZ |
1597 | #define ENQUEUE_RESTORE 0x02 |
1598 | #define ENQUEUE_MOVE 0x04 | |
0a67d1ee | 1599 | #define ENQUEUE_NOCLOCK 0x08 |
ff77e468 | 1600 | |
0a67d1ee PZ |
1601 | #define ENQUEUE_HEAD 0x10 |
1602 | #define ENQUEUE_REPLENISH 0x20 | |
c82ba9fa | 1603 | #ifdef CONFIG_SMP |
0a67d1ee | 1604 | #define ENQUEUE_MIGRATED 0x40 |
c82ba9fa | 1605 | #else |
59efa0ba | 1606 | #define ENQUEUE_MIGRATED 0x00 |
c82ba9fa | 1607 | #endif |
c82ba9fa | 1608 | |
37e117c0 PZ |
1609 | #define RETRY_TASK ((void *)-1UL) |
1610 | ||
c82ba9fa LZ |
1611 | struct sched_class { |
1612 | const struct sched_class *next; | |
1613 | ||
1614 | void (*enqueue_task) (struct rq *rq, struct task_struct *p, int flags); | |
1615 | void (*dequeue_task) (struct rq *rq, struct task_struct *p, int flags); | |
97fb7a0a IM |
1616 | void (*yield_task) (struct rq *rq); |
1617 | bool (*yield_to_task)(struct rq *rq, struct task_struct *p, bool preempt); | |
c82ba9fa | 1618 | |
97fb7a0a | 1619 | void (*check_preempt_curr)(struct rq *rq, struct task_struct *p, int flags); |
c82ba9fa | 1620 | |
606dba2e PZ |
1621 | /* |
1622 | * It is the responsibility of the pick_next_task() method that will | |
1623 | * return the next task to call put_prev_task() on the @prev task or | |
1624 | * something equivalent. | |
37e117c0 PZ |
1625 | * |
1626 | * May return RETRY_TASK when it finds a higher prio class has runnable | |
1627 | * tasks. | |
606dba2e | 1628 | */ |
97fb7a0a IM |
1629 | struct task_struct * (*pick_next_task)(struct rq *rq, |
1630 | struct task_struct *prev, | |
1631 | struct rq_flags *rf); | |
1632 | void (*put_prev_task)(struct rq *rq, struct task_struct *p); | |
c82ba9fa LZ |
1633 | |
1634 | #ifdef CONFIG_SMP | |
ac66f547 | 1635 | int (*select_task_rq)(struct task_struct *p, int task_cpu, int sd_flag, int flags); |
1327237a | 1636 | void (*migrate_task_rq)(struct task_struct *p, int new_cpu); |
c82ba9fa | 1637 | |
97fb7a0a | 1638 | void (*task_woken)(struct rq *this_rq, struct task_struct *task); |
c82ba9fa LZ |
1639 | |
1640 | void (*set_cpus_allowed)(struct task_struct *p, | |
1641 | const struct cpumask *newmask); | |
1642 | ||
1643 | void (*rq_online)(struct rq *rq); | |
1644 | void (*rq_offline)(struct rq *rq); | |
1645 | #endif | |
1646 | ||
97fb7a0a IM |
1647 | void (*set_curr_task)(struct rq *rq); |
1648 | void (*task_tick)(struct rq *rq, struct task_struct *p, int queued); | |
1649 | void (*task_fork)(struct task_struct *p); | |
1650 | void (*task_dead)(struct task_struct *p); | |
c82ba9fa | 1651 | |
67dfa1b7 KT |
1652 | /* |
1653 | * The switched_from() call is allowed to drop rq->lock, therefore we | |
1654 | * cannot assume the switched_from/switched_to pair is serliazed by | |
1655 | * rq->lock. They are however serialized by p->pi_lock. | |
1656 | */ | |
97fb7a0a IM |
1657 | void (*switched_from)(struct rq *this_rq, struct task_struct *task); |
1658 | void (*switched_to) (struct rq *this_rq, struct task_struct *task); | |
c82ba9fa | 1659 | void (*prio_changed) (struct rq *this_rq, struct task_struct *task, |
97fb7a0a | 1660 | int oldprio); |
c82ba9fa | 1661 | |
97fb7a0a IM |
1662 | unsigned int (*get_rr_interval)(struct rq *rq, |
1663 | struct task_struct *task); | |
c82ba9fa | 1664 | |
97fb7a0a | 1665 | void (*update_curr)(struct rq *rq); |
6e998916 | 1666 | |
97fb7a0a IM |
1667 | #define TASK_SET_GROUP 0 |
1668 | #define TASK_MOVE_GROUP 1 | |
ea86cb4b | 1669 | |
c82ba9fa | 1670 | #ifdef CONFIG_FAIR_GROUP_SCHED |
97fb7a0a | 1671 | void (*task_change_group)(struct task_struct *p, int type); |
c82ba9fa LZ |
1672 | #endif |
1673 | }; | |
029632fb | 1674 | |
3f1d2a31 PZ |
1675 | static inline void put_prev_task(struct rq *rq, struct task_struct *prev) |
1676 | { | |
1677 | prev->sched_class->put_prev_task(rq, prev); | |
1678 | } | |
1679 | ||
b2bf6c31 PZ |
1680 | static inline void set_curr_task(struct rq *rq, struct task_struct *curr) |
1681 | { | |
1682 | curr->sched_class->set_curr_task(rq); | |
1683 | } | |
1684 | ||
f5832c19 | 1685 | #ifdef CONFIG_SMP |
029632fb | 1686 | #define sched_class_highest (&stop_sched_class) |
f5832c19 NP |
1687 | #else |
1688 | #define sched_class_highest (&dl_sched_class) | |
1689 | #endif | |
029632fb PZ |
1690 | #define for_each_class(class) \ |
1691 | for (class = sched_class_highest; class; class = class->next) | |
1692 | ||
1693 | extern const struct sched_class stop_sched_class; | |
aab03e05 | 1694 | extern const struct sched_class dl_sched_class; |
029632fb PZ |
1695 | extern const struct sched_class rt_sched_class; |
1696 | extern const struct sched_class fair_sched_class; | |
1697 | extern const struct sched_class idle_sched_class; | |
1698 | ||
1699 | ||
1700 | #ifdef CONFIG_SMP | |
1701 | ||
63b2ca30 | 1702 | extern void update_group_capacity(struct sched_domain *sd, int cpu); |
b719203b | 1703 | |
7caff66f | 1704 | extern void trigger_load_balance(struct rq *rq); |
029632fb | 1705 | |
c5b28038 PZ |
1706 | extern void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask); |
1707 | ||
029632fb PZ |
1708 | #endif |
1709 | ||
442bf3aa DL |
1710 | #ifdef CONFIG_CPU_IDLE |
1711 | static inline void idle_set_state(struct rq *rq, | |
1712 | struct cpuidle_state *idle_state) | |
1713 | { | |
1714 | rq->idle_state = idle_state; | |
1715 | } | |
1716 | ||
1717 | static inline struct cpuidle_state *idle_get_state(struct rq *rq) | |
1718 | { | |
9148a3a1 | 1719 | SCHED_WARN_ON(!rcu_read_lock_held()); |
97fb7a0a | 1720 | |
442bf3aa DL |
1721 | return rq->idle_state; |
1722 | } | |
1723 | #else | |
1724 | static inline void idle_set_state(struct rq *rq, | |
1725 | struct cpuidle_state *idle_state) | |
1726 | { | |
1727 | } | |
1728 | ||
1729 | static inline struct cpuidle_state *idle_get_state(struct rq *rq) | |
1730 | { | |
1731 | return NULL; | |
1732 | } | |
1733 | #endif | |
1734 | ||
8663effb SRV |
1735 | extern void schedule_idle(void); |
1736 | ||
029632fb PZ |
1737 | extern void sysrq_sched_debug_show(void); |
1738 | extern void sched_init_granularity(void); | |
1739 | extern void update_max_interval(void); | |
1baca4ce JL |
1740 | |
1741 | extern void init_sched_dl_class(void); | |
029632fb PZ |
1742 | extern void init_sched_rt_class(void); |
1743 | extern void init_sched_fair_class(void); | |
1744 | ||
9059393e VG |
1745 | extern void reweight_task(struct task_struct *p, int prio); |
1746 | ||
8875125e | 1747 | extern void resched_curr(struct rq *rq); |
029632fb PZ |
1748 | extern void resched_cpu(int cpu); |
1749 | ||
1750 | extern struct rt_bandwidth def_rt_bandwidth; | |
1751 | extern void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime); | |
1752 | ||
332ac17e DF |
1753 | extern struct dl_bandwidth def_dl_bandwidth; |
1754 | extern void init_dl_bandwidth(struct dl_bandwidth *dl_b, u64 period, u64 runtime); | |
aab03e05 | 1755 | extern void init_dl_task_timer(struct sched_dl_entity *dl_se); |
209a0cbd | 1756 | extern void init_dl_inactive_task_timer(struct sched_dl_entity *dl_se); |
4da3abce | 1757 | extern void init_dl_rq_bw_ratio(struct dl_rq *dl_rq); |
aab03e05 | 1758 | |
97fb7a0a IM |
1759 | #define BW_SHIFT 20 |
1760 | #define BW_UNIT (1 << BW_SHIFT) | |
1761 | #define RATIO_SHIFT 8 | |
332ac17e DF |
1762 | unsigned long to_ratio(u64 period, u64 runtime); |
1763 | ||
540247fb | 1764 | extern void init_entity_runnable_average(struct sched_entity *se); |
2b8c41da | 1765 | extern void post_init_entity_util_avg(struct sched_entity *se); |
a75cdaa9 | 1766 | |
76d92ac3 FW |
1767 | #ifdef CONFIG_NO_HZ_FULL |
1768 | extern bool sched_can_stop_tick(struct rq *rq); | |
d84b3131 | 1769 | extern int __init sched_tick_offload_init(void); |
76d92ac3 FW |
1770 | |
1771 | /* | |
1772 | * Tick may be needed by tasks in the runqueue depending on their policy and | |
1773 | * requirements. If tick is needed, lets send the target an IPI to kick it out of | |
1774 | * nohz mode if necessary. | |
1775 | */ | |
1776 | static inline void sched_update_tick_dependency(struct rq *rq) | |
1777 | { | |
1778 | int cpu; | |
1779 | ||
1780 | if (!tick_nohz_full_enabled()) | |
1781 | return; | |
1782 | ||
1783 | cpu = cpu_of(rq); | |
1784 | ||
1785 | if (!tick_nohz_full_cpu(cpu)) | |
1786 | return; | |
1787 | ||
1788 | if (sched_can_stop_tick(rq)) | |
1789 | tick_nohz_dep_clear_cpu(cpu, TICK_DEP_BIT_SCHED); | |
1790 | else | |
1791 | tick_nohz_dep_set_cpu(cpu, TICK_DEP_BIT_SCHED); | |
1792 | } | |
1793 | #else | |
d84b3131 | 1794 | static inline int sched_tick_offload_init(void) { return 0; } |
76d92ac3 FW |
1795 | static inline void sched_update_tick_dependency(struct rq *rq) { } |
1796 | #endif | |
1797 | ||
72465447 | 1798 | static inline void add_nr_running(struct rq *rq, unsigned count) |
029632fb | 1799 | { |
72465447 KT |
1800 | unsigned prev_nr = rq->nr_running; |
1801 | ||
1802 | rq->nr_running = prev_nr + count; | |
9f3660c2 | 1803 | |
72465447 | 1804 | if (prev_nr < 2 && rq->nr_running >= 2) { |
4486edd1 | 1805 | #ifdef CONFIG_SMP |
e90c8fe1 VS |
1806 | if (!READ_ONCE(rq->rd->overload)) |
1807 | WRITE_ONCE(rq->rd->overload, 1); | |
4486edd1 | 1808 | #endif |
4486edd1 | 1809 | } |
76d92ac3 FW |
1810 | |
1811 | sched_update_tick_dependency(rq); | |
029632fb PZ |
1812 | } |
1813 | ||
72465447 | 1814 | static inline void sub_nr_running(struct rq *rq, unsigned count) |
029632fb | 1815 | { |
72465447 | 1816 | rq->nr_running -= count; |
76d92ac3 FW |
1817 | /* Check if we still need preemption */ |
1818 | sched_update_tick_dependency(rq); | |
029632fb PZ |
1819 | } |
1820 | ||
029632fb PZ |
1821 | extern void activate_task(struct rq *rq, struct task_struct *p, int flags); |
1822 | extern void deactivate_task(struct rq *rq, struct task_struct *p, int flags); | |
1823 | ||
1824 | extern void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags); | |
1825 | ||
029632fb PZ |
1826 | extern const_debug unsigned int sysctl_sched_nr_migrate; |
1827 | extern const_debug unsigned int sysctl_sched_migration_cost; | |
1828 | ||
029632fb PZ |
1829 | #ifdef CONFIG_SCHED_HRTICK |
1830 | ||
1831 | /* | |
1832 | * Use hrtick when: | |
1833 | * - enabled by features | |
1834 | * - hrtimer is actually high res | |
1835 | */ | |
1836 | static inline int hrtick_enabled(struct rq *rq) | |
1837 | { | |
1838 | if (!sched_feat(HRTICK)) | |
1839 | return 0; | |
1840 | if (!cpu_active(cpu_of(rq))) | |
1841 | return 0; | |
1842 | return hrtimer_is_hres_active(&rq->hrtick_timer); | |
1843 | } | |
1844 | ||
1845 | void hrtick_start(struct rq *rq, u64 delay); | |
1846 | ||
b39e66ea MG |
1847 | #else |
1848 | ||
1849 | static inline int hrtick_enabled(struct rq *rq) | |
1850 | { | |
1851 | return 0; | |
1852 | } | |
1853 | ||
029632fb PZ |
1854 | #endif /* CONFIG_SCHED_HRTICK */ |
1855 | ||
dfbca41f PZ |
1856 | #ifndef arch_scale_freq_capacity |
1857 | static __always_inline | |
7673c8a4 | 1858 | unsigned long arch_scale_freq_capacity(int cpu) |
dfbca41f PZ |
1859 | { |
1860 | return SCHED_CAPACITY_SCALE; | |
1861 | } | |
1862 | #endif | |
b5b4860d | 1863 | |
7e1a9208 | 1864 | #ifdef CONFIG_SMP |
8cd5601c MR |
1865 | #ifndef arch_scale_cpu_capacity |
1866 | static __always_inline | |
1867 | unsigned long arch_scale_cpu_capacity(struct sched_domain *sd, int cpu) | |
1868 | { | |
e3279a2e | 1869 | if (sd && (sd->flags & SD_SHARE_CPUCAPACITY) && (sd->span_weight > 1)) |
8cd5601c MR |
1870 | return sd->smt_gain / sd->span_weight; |
1871 | ||
1872 | return SCHED_CAPACITY_SCALE; | |
1873 | } | |
1874 | #endif | |
029632fb | 1875 | #else |
7e1a9208 JL |
1876 | #ifndef arch_scale_cpu_capacity |
1877 | static __always_inline | |
1878 | unsigned long arch_scale_cpu_capacity(void __always_unused *sd, int cpu) | |
1879 | { | |
1880 | return SCHED_CAPACITY_SCALE; | |
1881 | } | |
1882 | #endif | |
029632fb PZ |
1883 | #endif |
1884 | ||
029632fb PZ |
1885 | #ifdef CONFIG_SMP |
1886 | #ifdef CONFIG_PREEMPT | |
1887 | ||
1888 | static inline void double_rq_lock(struct rq *rq1, struct rq *rq2); | |
1889 | ||
1890 | /* | |
1891 | * fair double_lock_balance: Safely acquires both rq->locks in a fair | |
1892 | * way at the expense of forcing extra atomic operations in all | |
1893 | * invocations. This assures that the double_lock is acquired using the | |
1894 | * same underlying policy as the spinlock_t on this architecture, which | |
1895 | * reduces latency compared to the unfair variant below. However, it | |
1896 | * also adds more overhead and therefore may reduce throughput. | |
1897 | */ | |
1898 | static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) | |
1899 | __releases(this_rq->lock) | |
1900 | __acquires(busiest->lock) | |
1901 | __acquires(this_rq->lock) | |
1902 | { | |
1903 | raw_spin_unlock(&this_rq->lock); | |
1904 | double_rq_lock(this_rq, busiest); | |
1905 | ||
1906 | return 1; | |
1907 | } | |
1908 | ||
1909 | #else | |
1910 | /* | |
1911 | * Unfair double_lock_balance: Optimizes throughput at the expense of | |
1912 | * latency by eliminating extra atomic operations when the locks are | |
97fb7a0a IM |
1913 | * already in proper order on entry. This favors lower CPU-ids and will |
1914 | * grant the double lock to lower CPUs over higher ids under contention, | |
029632fb PZ |
1915 | * regardless of entry order into the function. |
1916 | */ | |
1917 | static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest) | |
1918 | __releases(this_rq->lock) | |
1919 | __acquires(busiest->lock) | |
1920 | __acquires(this_rq->lock) | |
1921 | { | |
1922 | int ret = 0; | |
1923 | ||
1924 | if (unlikely(!raw_spin_trylock(&busiest->lock))) { | |
1925 | if (busiest < this_rq) { | |
1926 | raw_spin_unlock(&this_rq->lock); | |
1927 | raw_spin_lock(&busiest->lock); | |
1928 | raw_spin_lock_nested(&this_rq->lock, | |
1929 | SINGLE_DEPTH_NESTING); | |
1930 | ret = 1; | |
1931 | } else | |
1932 | raw_spin_lock_nested(&busiest->lock, | |
1933 | SINGLE_DEPTH_NESTING); | |
1934 | } | |
1935 | return ret; | |
1936 | } | |
1937 | ||
1938 | #endif /* CONFIG_PREEMPT */ | |
1939 | ||
1940 | /* | |
1941 | * double_lock_balance - lock the busiest runqueue, this_rq is locked already. | |
1942 | */ | |
1943 | static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest) | |
1944 | { | |
1945 | if (unlikely(!irqs_disabled())) { | |
97fb7a0a | 1946 | /* printk() doesn't work well under rq->lock */ |
029632fb PZ |
1947 | raw_spin_unlock(&this_rq->lock); |
1948 | BUG_ON(1); | |
1949 | } | |
1950 | ||
1951 | return _double_lock_balance(this_rq, busiest); | |
1952 | } | |
1953 | ||
1954 | static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest) | |
1955 | __releases(busiest->lock) | |
1956 | { | |
1957 | raw_spin_unlock(&busiest->lock); | |
1958 | lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_); | |
1959 | } | |
1960 | ||
74602315 PZ |
1961 | static inline void double_lock(spinlock_t *l1, spinlock_t *l2) |
1962 | { | |
1963 | if (l1 > l2) | |
1964 | swap(l1, l2); | |
1965 | ||
1966 | spin_lock(l1); | |
1967 | spin_lock_nested(l2, SINGLE_DEPTH_NESTING); | |
1968 | } | |
1969 | ||
60e69eed MG |
1970 | static inline void double_lock_irq(spinlock_t *l1, spinlock_t *l2) |
1971 | { | |
1972 | if (l1 > l2) | |
1973 | swap(l1, l2); | |
1974 | ||
1975 | spin_lock_irq(l1); | |
1976 | spin_lock_nested(l2, SINGLE_DEPTH_NESTING); | |
1977 | } | |
1978 | ||
74602315 PZ |
1979 | static inline void double_raw_lock(raw_spinlock_t *l1, raw_spinlock_t *l2) |
1980 | { | |
1981 | if (l1 > l2) | |
1982 | swap(l1, l2); | |
1983 | ||
1984 | raw_spin_lock(l1); | |
1985 | raw_spin_lock_nested(l2, SINGLE_DEPTH_NESTING); | |
1986 | } | |
1987 | ||
029632fb PZ |
1988 | /* |
1989 | * double_rq_lock - safely lock two runqueues | |
1990 | * | |
1991 | * Note this does not disable interrupts like task_rq_lock, | |
1992 | * you need to do so manually before calling. | |
1993 | */ | |
1994 | static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) | |
1995 | __acquires(rq1->lock) | |
1996 | __acquires(rq2->lock) | |
1997 | { | |
1998 | BUG_ON(!irqs_disabled()); | |
1999 | if (rq1 == rq2) { | |
2000 | raw_spin_lock(&rq1->lock); | |
2001 | __acquire(rq2->lock); /* Fake it out ;) */ | |
2002 | } else { | |
2003 | if (rq1 < rq2) { | |
2004 | raw_spin_lock(&rq1->lock); | |
2005 | raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING); | |
2006 | } else { | |
2007 | raw_spin_lock(&rq2->lock); | |
2008 | raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING); | |
2009 | } | |
2010 | } | |
2011 | } | |
2012 | ||
2013 | /* | |
2014 | * double_rq_unlock - safely unlock two runqueues | |
2015 | * | |
2016 | * Note this does not restore interrupts like task_rq_unlock, | |
2017 | * you need to do so manually after calling. | |
2018 | */ | |
2019 | static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) | |
2020 | __releases(rq1->lock) | |
2021 | __releases(rq2->lock) | |
2022 | { | |
2023 | raw_spin_unlock(&rq1->lock); | |
2024 | if (rq1 != rq2) | |
2025 | raw_spin_unlock(&rq2->lock); | |
2026 | else | |
2027 | __release(rq2->lock); | |
2028 | } | |
2029 | ||
f2cb1360 IM |
2030 | extern void set_rq_online (struct rq *rq); |
2031 | extern void set_rq_offline(struct rq *rq); | |
2032 | extern bool sched_smp_initialized; | |
2033 | ||
029632fb PZ |
2034 | #else /* CONFIG_SMP */ |
2035 | ||
2036 | /* | |
2037 | * double_rq_lock - safely lock two runqueues | |
2038 | * | |
2039 | * Note this does not disable interrupts like task_rq_lock, | |
2040 | * you need to do so manually before calling. | |
2041 | */ | |
2042 | static inline void double_rq_lock(struct rq *rq1, struct rq *rq2) | |
2043 | __acquires(rq1->lock) | |
2044 | __acquires(rq2->lock) | |
2045 | { | |
2046 | BUG_ON(!irqs_disabled()); | |
2047 | BUG_ON(rq1 != rq2); | |
2048 | raw_spin_lock(&rq1->lock); | |
2049 | __acquire(rq2->lock); /* Fake it out ;) */ | |
2050 | } | |
2051 | ||
2052 | /* | |
2053 | * double_rq_unlock - safely unlock two runqueues | |
2054 | * | |
2055 | * Note this does not restore interrupts like task_rq_unlock, | |
2056 | * you need to do so manually after calling. | |
2057 | */ | |
2058 | static inline void double_rq_unlock(struct rq *rq1, struct rq *rq2) | |
2059 | __releases(rq1->lock) | |
2060 | __releases(rq2->lock) | |
2061 | { | |
2062 | BUG_ON(rq1 != rq2); | |
2063 | raw_spin_unlock(&rq1->lock); | |
2064 | __release(rq2->lock); | |
2065 | } | |
2066 | ||
2067 | #endif | |
2068 | ||
2069 | extern struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq); | |
2070 | extern struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq); | |
6b55c965 SD |
2071 | |
2072 | #ifdef CONFIG_SCHED_DEBUG | |
9469eb01 PZ |
2073 | extern bool sched_debug_enabled; |
2074 | ||
029632fb PZ |
2075 | extern void print_cfs_stats(struct seq_file *m, int cpu); |
2076 | extern void print_rt_stats(struct seq_file *m, int cpu); | |
acb32132 | 2077 | extern void print_dl_stats(struct seq_file *m, int cpu); |
f6a34630 MM |
2078 | extern void print_cfs_rq(struct seq_file *m, int cpu, struct cfs_rq *cfs_rq); |
2079 | extern void print_rt_rq(struct seq_file *m, int cpu, struct rt_rq *rt_rq); | |
2080 | extern void print_dl_rq(struct seq_file *m, int cpu, struct dl_rq *dl_rq); | |
397f2378 SD |
2081 | #ifdef CONFIG_NUMA_BALANCING |
2082 | extern void | |
2083 | show_numa_stats(struct task_struct *p, struct seq_file *m); | |
2084 | extern void | |
2085 | print_numa_stats(struct seq_file *m, int node, unsigned long tsf, | |
2086 | unsigned long tpf, unsigned long gsf, unsigned long gpf); | |
2087 | #endif /* CONFIG_NUMA_BALANCING */ | |
2088 | #endif /* CONFIG_SCHED_DEBUG */ | |
029632fb PZ |
2089 | |
2090 | extern void init_cfs_rq(struct cfs_rq *cfs_rq); | |
07c54f7a AV |
2091 | extern void init_rt_rq(struct rt_rq *rt_rq); |
2092 | extern void init_dl_rq(struct dl_rq *dl_rq); | |
029632fb | 2093 | |
1ee14e6c BS |
2094 | extern void cfs_bandwidth_usage_inc(void); |
2095 | extern void cfs_bandwidth_usage_dec(void); | |
1c792db7 | 2096 | |
3451d024 | 2097 | #ifdef CONFIG_NO_HZ_COMMON |
00357f5e PZ |
2098 | #define NOHZ_BALANCE_KICK_BIT 0 |
2099 | #define NOHZ_STATS_KICK_BIT 1 | |
a22e47a4 | 2100 | |
a22e47a4 | 2101 | #define NOHZ_BALANCE_KICK BIT(NOHZ_BALANCE_KICK_BIT) |
b7031a02 PZ |
2102 | #define NOHZ_STATS_KICK BIT(NOHZ_STATS_KICK_BIT) |
2103 | ||
2104 | #define NOHZ_KICK_MASK (NOHZ_BALANCE_KICK | NOHZ_STATS_KICK) | |
1c792db7 SS |
2105 | |
2106 | #define nohz_flags(cpu) (&cpu_rq(cpu)->nohz_flags) | |
20a5c8cc | 2107 | |
00357f5e | 2108 | extern void nohz_balance_exit_idle(struct rq *rq); |
20a5c8cc | 2109 | #else |
00357f5e | 2110 | static inline void nohz_balance_exit_idle(struct rq *rq) { } |
1c792db7 | 2111 | #endif |
73fbec60 | 2112 | |
daec5798 LA |
2113 | |
2114 | #ifdef CONFIG_SMP | |
2115 | static inline | |
2116 | void __dl_update(struct dl_bw *dl_b, s64 bw) | |
2117 | { | |
2118 | struct root_domain *rd = container_of(dl_b, struct root_domain, dl_bw); | |
2119 | int i; | |
2120 | ||
2121 | RCU_LOCKDEP_WARN(!rcu_read_lock_sched_held(), | |
2122 | "sched RCU must be held"); | |
2123 | for_each_cpu_and(i, rd->span, cpu_active_mask) { | |
2124 | struct rq *rq = cpu_rq(i); | |
2125 | ||
2126 | rq->dl.extra_bw += bw; | |
2127 | } | |
2128 | } | |
2129 | #else | |
2130 | static inline | |
2131 | void __dl_update(struct dl_bw *dl_b, s64 bw) | |
2132 | { | |
2133 | struct dl_rq *dl = container_of(dl_b, struct dl_rq, dl_bw); | |
2134 | ||
2135 | dl->extra_bw += bw; | |
2136 | } | |
2137 | #endif | |
2138 | ||
2139 | ||
73fbec60 | 2140 | #ifdef CONFIG_IRQ_TIME_ACCOUNTING |
19d23dbf | 2141 | struct irqtime { |
25e2d8c1 | 2142 | u64 total; |
a499a5a1 | 2143 | u64 tick_delta; |
19d23dbf FW |
2144 | u64 irq_start_time; |
2145 | struct u64_stats_sync sync; | |
2146 | }; | |
73fbec60 | 2147 | |
19d23dbf | 2148 | DECLARE_PER_CPU(struct irqtime, cpu_irqtime); |
73fbec60 | 2149 | |
25e2d8c1 FW |
2150 | /* |
2151 | * Returns the irqtime minus the softirq time computed by ksoftirqd. | |
2152 | * Otherwise ksoftirqd's sum_exec_runtime is substracted its own runtime | |
2153 | * and never move forward. | |
2154 | */ | |
73fbec60 FW |
2155 | static inline u64 irq_time_read(int cpu) |
2156 | { | |
19d23dbf FW |
2157 | struct irqtime *irqtime = &per_cpu(cpu_irqtime, cpu); |
2158 | unsigned int seq; | |
2159 | u64 total; | |
73fbec60 FW |
2160 | |
2161 | do { | |
19d23dbf | 2162 | seq = __u64_stats_fetch_begin(&irqtime->sync); |
25e2d8c1 | 2163 | total = irqtime->total; |
19d23dbf | 2164 | } while (__u64_stats_fetch_retry(&irqtime->sync, seq)); |
73fbec60 | 2165 | |
19d23dbf | 2166 | return total; |
73fbec60 | 2167 | } |
73fbec60 | 2168 | #endif /* CONFIG_IRQ_TIME_ACCOUNTING */ |
adaf9fcd RW |
2169 | |
2170 | #ifdef CONFIG_CPU_FREQ | |
2171 | DECLARE_PER_CPU(struct update_util_data *, cpufreq_update_util_data); | |
2172 | ||
2173 | /** | |
2174 | * cpufreq_update_util - Take a note about CPU utilization changes. | |
12bde33d | 2175 | * @rq: Runqueue to carry out the update for. |
58919e83 | 2176 | * @flags: Update reason flags. |
adaf9fcd | 2177 | * |
58919e83 RW |
2178 | * This function is called by the scheduler on the CPU whose utilization is |
2179 | * being updated. | |
adaf9fcd RW |
2180 | * |
2181 | * It can only be called from RCU-sched read-side critical sections. | |
adaf9fcd RW |
2182 | * |
2183 | * The way cpufreq is currently arranged requires it to evaluate the CPU | |
2184 | * performance state (frequency/voltage) on a regular basis to prevent it from | |
2185 | * being stuck in a completely inadequate performance level for too long. | |
e0367b12 JL |
2186 | * That is not guaranteed to happen if the updates are only triggered from CFS |
2187 | * and DL, though, because they may not be coming in if only RT tasks are | |
2188 | * active all the time (or there are RT tasks only). | |
adaf9fcd | 2189 | * |
e0367b12 JL |
2190 | * As a workaround for that issue, this function is called periodically by the |
2191 | * RT sched class to trigger extra cpufreq updates to prevent it from stalling, | |
adaf9fcd | 2192 | * but that really is a band-aid. Going forward it should be replaced with |
e0367b12 | 2193 | * solutions targeted more specifically at RT tasks. |
adaf9fcd | 2194 | */ |
12bde33d | 2195 | static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) |
adaf9fcd | 2196 | { |
58919e83 RW |
2197 | struct update_util_data *data; |
2198 | ||
674e7541 VK |
2199 | data = rcu_dereference_sched(*per_cpu_ptr(&cpufreq_update_util_data, |
2200 | cpu_of(rq))); | |
58919e83 | 2201 | if (data) |
12bde33d RW |
2202 | data->func(data, rq_clock(rq), flags); |
2203 | } | |
adaf9fcd | 2204 | #else |
12bde33d | 2205 | static inline void cpufreq_update_util(struct rq *rq, unsigned int flags) {} |
adaf9fcd | 2206 | #endif /* CONFIG_CPU_FREQ */ |
be53f58f | 2207 | |
9bdcb44e | 2208 | #ifdef arch_scale_freq_capacity |
97fb7a0a IM |
2209 | # ifndef arch_scale_freq_invariant |
2210 | # define arch_scale_freq_invariant() true | |
2211 | # endif | |
2212 | #else | |
2213 | # define arch_scale_freq_invariant() false | |
9bdcb44e | 2214 | #endif |
d4edd662 | 2215 | |
794a56eb | 2216 | #ifdef CONFIG_CPU_FREQ_GOV_SCHEDUTIL |
8cc90515 | 2217 | static inline unsigned long cpu_bw_dl(struct rq *rq) |
d4edd662 JL |
2218 | { |
2219 | return (rq->dl.running_bw * SCHED_CAPACITY_SCALE) >> BW_SHIFT; | |
2220 | } | |
2221 | ||
8cc90515 VG |
2222 | static inline unsigned long cpu_util_dl(struct rq *rq) |
2223 | { | |
2224 | return READ_ONCE(rq->avg_dl.util_avg); | |
2225 | } | |
2226 | ||
d4edd662 JL |
2227 | static inline unsigned long cpu_util_cfs(struct rq *rq) |
2228 | { | |
a07630b8 PB |
2229 | unsigned long util = READ_ONCE(rq->cfs.avg.util_avg); |
2230 | ||
2231 | if (sched_feat(UTIL_EST)) { | |
2232 | util = max_t(unsigned long, util, | |
2233 | READ_ONCE(rq->cfs.avg.util_est.enqueued)); | |
2234 | } | |
2235 | ||
2236 | return util; | |
d4edd662 | 2237 | } |
371bf427 VG |
2238 | |
2239 | static inline unsigned long cpu_util_rt(struct rq *rq) | |
2240 | { | |
dfa444dc | 2241 | return READ_ONCE(rq->avg_rt.util_avg); |
371bf427 | 2242 | } |
2e62c474 | 2243 | #endif |
9033ea11 | 2244 | |
11d4afd4 | 2245 | #ifdef CONFIG_HAVE_SCHED_AVG_IRQ |
9033ea11 VG |
2246 | static inline unsigned long cpu_util_irq(struct rq *rq) |
2247 | { | |
2248 | return rq->avg_irq.util_avg; | |
2249 | } | |
2e62c474 VG |
2250 | |
2251 | static inline | |
2252 | unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) | |
2253 | { | |
2254 | util *= (max - irq); | |
2255 | util /= max; | |
2256 | ||
2257 | return util; | |
2258 | ||
2259 | } | |
9033ea11 VG |
2260 | #else |
2261 | static inline unsigned long cpu_util_irq(struct rq *rq) | |
2262 | { | |
2263 | return 0; | |
2264 | } | |
2265 | ||
2e62c474 VG |
2266 | static inline |
2267 | unsigned long scale_irq_capacity(unsigned long util, unsigned long irq, unsigned long max) | |
2268 | { | |
2269 | return util; | |
2270 | } | |
794a56eb | 2271 | #endif |