1 // SPDX-License-Identifier: GPL-2.0
3 * Completely Fair Scheduling (CFS) Class (SCHED_NORMAL/SCHED_BATCH)
5 * Copyright (C) 2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
7 * Interactivity improvements by Mike Galbraith
8 * (C) 2007 Mike Galbraith <efault@gmx.de>
10 * Various enhancements by Dmitry Adamushko.
11 * (C) 2007 Dmitry Adamushko <dmitry.adamushko@gmail.com>
13 * Group scheduling enhancements by Srivatsa Vaddagiri
14 * Copyright IBM Corporation, 2007
15 * Author: Srivatsa Vaddagiri <vatsa@linux.vnet.ibm.com>
17 * Scaled math optimizations by Thomas Gleixner
18 * Copyright (C) 2007, Thomas Gleixner <tglx@linutronix.de>
20 * Adaptive scheduling granularity, math enhancements by Peter Zijlstra
21 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra
25 #include <trace/events/sched.h>
28 * Targeted preemption latency for CPU-bound tasks:
30 * NOTE: this latency value is not the same as the concept of
31 * 'timeslice length' - timeslices in CFS are of variable length
32 * and have no persistent notion like in traditional, time-slice
33 * based scheduling concepts.
35 * (to see the precise effective timeslice length of your workload,
36 * run vmstat and monitor the context-switches (cs) field)
38 * (default: 6ms * (1 + ilog(ncpus)), units: nanoseconds)
40 unsigned int sysctl_sched_latency
= 6000000ULL;
41 static unsigned int normalized_sysctl_sched_latency
= 6000000ULL;
44 * The initial- and re-scaling of tunables is configurable
48 * SCHED_TUNABLESCALING_NONE - unscaled, always *1
49 * SCHED_TUNABLESCALING_LOG - scaled logarithmical, *1+ilog(ncpus)
50 * SCHED_TUNABLESCALING_LINEAR - scaled linear, *ncpus
52 * (default SCHED_TUNABLESCALING_LOG = *(1+ilog(ncpus))
54 enum sched_tunable_scaling sysctl_sched_tunable_scaling
= SCHED_TUNABLESCALING_LOG
;
57 * Minimal preemption granularity for CPU-bound tasks:
59 * (default: 0.75 msec * (1 + ilog(ncpus)), units: nanoseconds)
61 unsigned int sysctl_sched_min_granularity
= 750000ULL;
62 static unsigned int normalized_sysctl_sched_min_granularity
= 750000ULL;
65 * This value is kept at sysctl_sched_latency/sysctl_sched_min_granularity
67 static unsigned int sched_nr_latency
= 8;
70 * After fork, child runs first. If set to 0 (default) then
71 * parent will (try to) run first.
73 unsigned int sysctl_sched_child_runs_first __read_mostly
;
76 * SCHED_OTHER wake-up granularity.
78 * This option delays the preemption effects of decoupled workloads
79 * and reduces their over-scheduling. Synchronous workloads will still
80 * have immediate wakeup/sleep latencies.
82 * (default: 1 msec * (1 + ilog(ncpus)), units: nanoseconds)
84 unsigned int sysctl_sched_wakeup_granularity
= 1000000UL;
85 static unsigned int normalized_sysctl_sched_wakeup_granularity
= 1000000UL;
87 const_debug
unsigned int sysctl_sched_migration_cost
= 500000UL;
91 * For asym packing, by default the lower numbered CPU has higher priority.
93 int __weak
arch_asym_cpu_priority(int cpu
)
99 * The margin used when comparing utilization with CPU capacity:
100 * util * margin < capacity * 1024
104 static unsigned int capacity_margin
= 1280;
107 #ifdef CONFIG_CFS_BANDWIDTH
109 * Amount of runtime to allocate from global (tg) to local (per-cfs_rq) pool
110 * each time a cfs_rq requests quota.
112 * Note: in the case that the slice exceeds the runtime remaining (either due
113 * to consumption or the quota being specified to be smaller than the slice)
114 * we will always only issue the remaining available time.
116 * (default: 5 msec, units: microseconds)
118 unsigned int sysctl_sched_cfs_bandwidth_slice
= 5000UL;
121 static inline void update_load_add(struct load_weight
*lw
, unsigned long inc
)
127 static inline void update_load_sub(struct load_weight
*lw
, unsigned long dec
)
133 static inline void update_load_set(struct load_weight
*lw
, unsigned long w
)
140 * Increase the granularity value when there are more CPUs,
141 * because with more CPUs the 'effective latency' as visible
142 * to users decreases. But the relationship is not linear,
143 * so pick a second-best guess by going with the log2 of the
146 * This idea comes from the SD scheduler of Con Kolivas:
148 static unsigned int get_update_sysctl_factor(void)
150 unsigned int cpus
= min_t(unsigned int, num_online_cpus(), 8);
153 switch (sysctl_sched_tunable_scaling
) {
154 case SCHED_TUNABLESCALING_NONE
:
157 case SCHED_TUNABLESCALING_LINEAR
:
160 case SCHED_TUNABLESCALING_LOG
:
162 factor
= 1 + ilog2(cpus
);
169 static void update_sysctl(void)
171 unsigned int factor
= get_update_sysctl_factor();
173 #define SET_SYSCTL(name) \
174 (sysctl_##name = (factor) * normalized_sysctl_##name)
175 SET_SYSCTL(sched_min_granularity
);
176 SET_SYSCTL(sched_latency
);
177 SET_SYSCTL(sched_wakeup_granularity
);
181 void sched_init_granularity(void)
186 #define WMULT_CONST (~0U)
187 #define WMULT_SHIFT 32
189 static void __update_inv_weight(struct load_weight
*lw
)
193 if (likely(lw
->inv_weight
))
196 w
= scale_load_down(lw
->weight
);
198 if (BITS_PER_LONG
> 32 && unlikely(w
>= WMULT_CONST
))
200 else if (unlikely(!w
))
201 lw
->inv_weight
= WMULT_CONST
;
203 lw
->inv_weight
= WMULT_CONST
/ w
;
207 * delta_exec * weight / lw.weight
209 * (delta_exec * (weight * lw->inv_weight)) >> WMULT_SHIFT
211 * Either weight := NICE_0_LOAD and lw \e sched_prio_to_wmult[], in which case
212 * we're guaranteed shift stays positive because inv_weight is guaranteed to
213 * fit 32 bits, and NICE_0_LOAD gives another 10 bits; therefore shift >= 22.
215 * Or, weight =< lw.weight (because lw.weight is the runqueue weight), thus
216 * weight/lw.weight <= 1, and therefore our shift will also be positive.
218 static u64
__calc_delta(u64 delta_exec
, unsigned long weight
, struct load_weight
*lw
)
220 u64 fact
= scale_load_down(weight
);
221 int shift
= WMULT_SHIFT
;
223 __update_inv_weight(lw
);
225 if (unlikely(fact
>> 32)) {
232 /* hint to use a 32x32->64 mul */
233 fact
= (u64
)(u32
)fact
* lw
->inv_weight
;
240 return mul_u64_u32_shr(delta_exec
, fact
, shift
);
244 const struct sched_class fair_sched_class
;
246 /**************************************************************
247 * CFS operations on generic schedulable entities:
250 #ifdef CONFIG_FAIR_GROUP_SCHED
251 static inline struct task_struct
*task_of(struct sched_entity
*se
)
253 SCHED_WARN_ON(!entity_is_task(se
));
254 return container_of(se
, struct task_struct
, se
);
257 /* Walk up scheduling entities hierarchy */
258 #define for_each_sched_entity(se) \
259 for (; se; se = se->parent)
261 static inline struct cfs_rq
*task_cfs_rq(struct task_struct
*p
)
266 /* runqueue on which this entity is (to be) queued */
267 static inline struct cfs_rq
*cfs_rq_of(struct sched_entity
*se
)
272 /* runqueue "owned" by this group */
273 static inline struct cfs_rq
*group_cfs_rq(struct sched_entity
*grp
)
278 static inline bool list_add_leaf_cfs_rq(struct cfs_rq
*cfs_rq
)
280 struct rq
*rq
= rq_of(cfs_rq
);
281 int cpu
= cpu_of(rq
);
284 return rq
->tmp_alone_branch
== &rq
->leaf_cfs_rq_list
;
289 * Ensure we either appear before our parent (if already
290 * enqueued) or force our parent to appear after us when it is
291 * enqueued. The fact that we always enqueue bottom-up
292 * reduces this to two cases and a special case for the root
293 * cfs_rq. Furthermore, it also means that we will always reset
294 * tmp_alone_branch either when the branch is connected
295 * to a tree or when we reach the top of the tree
297 if (cfs_rq
->tg
->parent
&&
298 cfs_rq
->tg
->parent
->cfs_rq
[cpu
]->on_list
) {
300 * If parent is already on the list, we add the child
301 * just before. Thanks to circular linked property of
302 * the list, this means to put the child at the tail
303 * of the list that starts by parent.
305 list_add_tail_rcu(&cfs_rq
->leaf_cfs_rq_list
,
306 &(cfs_rq
->tg
->parent
->cfs_rq
[cpu
]->leaf_cfs_rq_list
));
308 * The branch is now connected to its tree so we can
309 * reset tmp_alone_branch to the beginning of the
312 rq
->tmp_alone_branch
= &rq
->leaf_cfs_rq_list
;
316 if (!cfs_rq
->tg
->parent
) {
318 * cfs rq without parent should be put
319 * at the tail of the list.
321 list_add_tail_rcu(&cfs_rq
->leaf_cfs_rq_list
,
322 &rq
->leaf_cfs_rq_list
);
324 * We have reach the top of a tree so we can reset
325 * tmp_alone_branch to the beginning of the list.
327 rq
->tmp_alone_branch
= &rq
->leaf_cfs_rq_list
;
332 * The parent has not already been added so we want to
333 * make sure that it will be put after us.
334 * tmp_alone_branch points to the begin of the branch
335 * where we will add parent.
337 list_add_rcu(&cfs_rq
->leaf_cfs_rq_list
, rq
->tmp_alone_branch
);
339 * update tmp_alone_branch to points to the new begin
342 rq
->tmp_alone_branch
= &cfs_rq
->leaf_cfs_rq_list
;
346 static inline void list_del_leaf_cfs_rq(struct cfs_rq
*cfs_rq
)
348 if (cfs_rq
->on_list
) {
349 struct rq
*rq
= rq_of(cfs_rq
);
352 * With cfs_rq being unthrottled/throttled during an enqueue,
353 * it can happen the tmp_alone_branch points the a leaf that
354 * we finally want to del. In this case, tmp_alone_branch moves
355 * to the prev element but it will point to rq->leaf_cfs_rq_list
356 * at the end of the enqueue.
358 if (rq
->tmp_alone_branch
== &cfs_rq
->leaf_cfs_rq_list
)
359 rq
->tmp_alone_branch
= cfs_rq
->leaf_cfs_rq_list
.prev
;
361 list_del_rcu(&cfs_rq
->leaf_cfs_rq_list
);
366 static inline void assert_list_leaf_cfs_rq(struct rq
*rq
)
368 SCHED_WARN_ON(rq
->tmp_alone_branch
!= &rq
->leaf_cfs_rq_list
);
371 /* Iterate thr' all leaf cfs_rq's on a runqueue */
372 #define for_each_leaf_cfs_rq_safe(rq, cfs_rq, pos) \
373 list_for_each_entry_safe(cfs_rq, pos, &rq->leaf_cfs_rq_list, \
376 /* Do the two (enqueued) entities belong to the same group ? */
377 static inline struct cfs_rq
*
378 is_same_group(struct sched_entity
*se
, struct sched_entity
*pse
)
380 if (se
->cfs_rq
== pse
->cfs_rq
)
386 static inline struct sched_entity
*parent_entity(struct sched_entity
*se
)
392 find_matching_se(struct sched_entity
**se
, struct sched_entity
**pse
)
394 int se_depth
, pse_depth
;
397 * preemption test can be made between sibling entities who are in the
398 * same cfs_rq i.e who have a common parent. Walk up the hierarchy of
399 * both tasks until we find their ancestors who are siblings of common
403 /* First walk up until both entities are at same depth */
404 se_depth
= (*se
)->depth
;
405 pse_depth
= (*pse
)->depth
;
407 while (se_depth
> pse_depth
) {
409 *se
= parent_entity(*se
);
412 while (pse_depth
> se_depth
) {
414 *pse
= parent_entity(*pse
);
417 while (!is_same_group(*se
, *pse
)) {
418 *se
= parent_entity(*se
);
419 *pse
= parent_entity(*pse
);
423 #else /* !CONFIG_FAIR_GROUP_SCHED */
425 static inline struct task_struct
*task_of(struct sched_entity
*se
)
427 return container_of(se
, struct task_struct
, se
);
430 #define for_each_sched_entity(se) \
431 for (; se; se = NULL)
433 static inline struct cfs_rq
*task_cfs_rq(struct task_struct
*p
)
435 return &task_rq(p
)->cfs
;
438 static inline struct cfs_rq
*cfs_rq_of(struct sched_entity
*se
)
440 struct task_struct
*p
= task_of(se
);
441 struct rq
*rq
= task_rq(p
);
446 /* runqueue "owned" by this group */
447 static inline struct cfs_rq
*group_cfs_rq(struct sched_entity
*grp
)
452 static inline bool list_add_leaf_cfs_rq(struct cfs_rq
*cfs_rq
)
457 static inline void list_del_leaf_cfs_rq(struct cfs_rq
*cfs_rq
)
461 static inline void assert_list_leaf_cfs_rq(struct rq
*rq
)
465 #define for_each_leaf_cfs_rq_safe(rq, cfs_rq, pos) \
466 for (cfs_rq = &rq->cfs, pos = NULL; cfs_rq; cfs_rq = pos)
468 static inline struct sched_entity
*parent_entity(struct sched_entity
*se
)
474 find_matching_se(struct sched_entity
**se
, struct sched_entity
**pse
)
478 #endif /* CONFIG_FAIR_GROUP_SCHED */
480 static __always_inline
481 void account_cfs_rq_runtime(struct cfs_rq
*cfs_rq
, u64 delta_exec
);
483 /**************************************************************
484 * Scheduling class tree data structure manipulation methods:
487 static inline u64
max_vruntime(u64 max_vruntime
, u64 vruntime
)
489 s64 delta
= (s64
)(vruntime
- max_vruntime
);
491 max_vruntime
= vruntime
;
496 static inline u64
min_vruntime(u64 min_vruntime
, u64 vruntime
)
498 s64 delta
= (s64
)(vruntime
- min_vruntime
);
500 min_vruntime
= vruntime
;
505 static inline int entity_before(struct sched_entity
*a
,
506 struct sched_entity
*b
)
508 return (s64
)(a
->vruntime
- b
->vruntime
) < 0;
511 static void update_min_vruntime(struct cfs_rq
*cfs_rq
)
513 struct sched_entity
*curr
= cfs_rq
->curr
;
514 struct rb_node
*leftmost
= rb_first_cached(&cfs_rq
->tasks_timeline
);
516 u64 vruntime
= cfs_rq
->min_vruntime
;
520 vruntime
= curr
->vruntime
;
525 if (leftmost
) { /* non-empty tree */
526 struct sched_entity
*se
;
527 se
= rb_entry(leftmost
, struct sched_entity
, run_node
);
530 vruntime
= se
->vruntime
;
532 vruntime
= min_vruntime(vruntime
, se
->vruntime
);
535 /* ensure we never gain time by being placed backwards. */
536 cfs_rq
->min_vruntime
= max_vruntime(cfs_rq
->min_vruntime
, vruntime
);
539 cfs_rq
->min_vruntime_copy
= cfs_rq
->min_vruntime
;
544 * Enqueue an entity into the rb-tree:
546 static void __enqueue_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
548 struct rb_node
**link
= &cfs_rq
->tasks_timeline
.rb_root
.rb_node
;
549 struct rb_node
*parent
= NULL
;
550 struct sched_entity
*entry
;
551 bool leftmost
= true;
554 * Find the right place in the rbtree:
558 entry
= rb_entry(parent
, struct sched_entity
, run_node
);
560 * We dont care about collisions. Nodes with
561 * the same key stay together.
563 if (entity_before(se
, entry
)) {
564 link
= &parent
->rb_left
;
566 link
= &parent
->rb_right
;
571 rb_link_node(&se
->run_node
, parent
, link
);
572 rb_insert_color_cached(&se
->run_node
,
573 &cfs_rq
->tasks_timeline
, leftmost
);
576 static void __dequeue_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
578 rb_erase_cached(&se
->run_node
, &cfs_rq
->tasks_timeline
);
581 struct sched_entity
*__pick_first_entity(struct cfs_rq
*cfs_rq
)
583 struct rb_node
*left
= rb_first_cached(&cfs_rq
->tasks_timeline
);
588 return rb_entry(left
, struct sched_entity
, run_node
);
591 static struct sched_entity
*__pick_next_entity(struct sched_entity
*se
)
593 struct rb_node
*next
= rb_next(&se
->run_node
);
598 return rb_entry(next
, struct sched_entity
, run_node
);
601 #ifdef CONFIG_SCHED_DEBUG
602 struct sched_entity
*__pick_last_entity(struct cfs_rq
*cfs_rq
)
604 struct rb_node
*last
= rb_last(&cfs_rq
->tasks_timeline
.rb_root
);
609 return rb_entry(last
, struct sched_entity
, run_node
);
612 /**************************************************************
613 * Scheduling class statistics methods:
616 int sched_proc_update_handler(struct ctl_table
*table
, int write
,
617 void __user
*buffer
, size_t *lenp
,
620 int ret
= proc_dointvec_minmax(table
, write
, buffer
, lenp
, ppos
);
621 unsigned int factor
= get_update_sysctl_factor();
626 sched_nr_latency
= DIV_ROUND_UP(sysctl_sched_latency
,
627 sysctl_sched_min_granularity
);
629 #define WRT_SYSCTL(name) \
630 (normalized_sysctl_##name = sysctl_##name / (factor))
631 WRT_SYSCTL(sched_min_granularity
);
632 WRT_SYSCTL(sched_latency
);
633 WRT_SYSCTL(sched_wakeup_granularity
);
643 static inline u64
calc_delta_fair(u64 delta
, struct sched_entity
*se
)
645 if (unlikely(se
->load
.weight
!= NICE_0_LOAD
))
646 delta
= __calc_delta(delta
, NICE_0_LOAD
, &se
->load
);
652 * The idea is to set a period in which each task runs once.
654 * When there are too many tasks (sched_nr_latency) we have to stretch
655 * this period because otherwise the slices get too small.
657 * p = (nr <= nl) ? l : l*nr/nl
659 static u64
__sched_period(unsigned long nr_running
)
661 if (unlikely(nr_running
> sched_nr_latency
))
662 return nr_running
* sysctl_sched_min_granularity
;
664 return sysctl_sched_latency
;
668 * We calculate the wall-time slice from the period by taking a part
669 * proportional to the weight.
673 static u64
sched_slice(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
675 u64 slice
= __sched_period(cfs_rq
->nr_running
+ !se
->on_rq
);
677 for_each_sched_entity(se
) {
678 struct load_weight
*load
;
679 struct load_weight lw
;
681 cfs_rq
= cfs_rq_of(se
);
682 load
= &cfs_rq
->load
;
684 if (unlikely(!se
->on_rq
)) {
687 update_load_add(&lw
, se
->load
.weight
);
690 slice
= __calc_delta(slice
, se
->load
.weight
, load
);
696 * We calculate the vruntime slice of a to-be-inserted task.
700 static u64
sched_vslice(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
702 return calc_delta_fair(sched_slice(cfs_rq
, se
), se
);
708 static int select_idle_sibling(struct task_struct
*p
, int prev_cpu
, int cpu
);
709 static unsigned long task_h_load(struct task_struct
*p
);
710 static unsigned long capacity_of(int cpu
);
712 /* Give new sched_entity start runnable values to heavy its load in infant time */
713 void init_entity_runnable_average(struct sched_entity
*se
)
715 struct sched_avg
*sa
= &se
->avg
;
717 memset(sa
, 0, sizeof(*sa
));
720 * Tasks are initialized with full load to be seen as heavy tasks until
721 * they get a chance to stabilize to their real load level.
722 * Group entities are initialized with zero load to reflect the fact that
723 * nothing has been attached to the task group yet.
725 if (entity_is_task(se
))
726 sa
->runnable_load_avg
= sa
->load_avg
= scale_load_down(se
->load
.weight
);
728 se
->runnable_weight
= se
->load
.weight
;
730 /* when this task enqueue'ed, it will contribute to its cfs_rq's load_avg */
733 static inline u64
cfs_rq_clock_task(struct cfs_rq
*cfs_rq
);
734 static void attach_entity_cfs_rq(struct sched_entity
*se
);
737 * With new tasks being created, their initial util_avgs are extrapolated
738 * based on the cfs_rq's current util_avg:
740 * util_avg = cfs_rq->util_avg / (cfs_rq->load_avg + 1) * se.load.weight
742 * However, in many cases, the above util_avg does not give a desired
743 * value. Moreover, the sum of the util_avgs may be divergent, such
744 * as when the series is a harmonic series.
746 * To solve this problem, we also cap the util_avg of successive tasks to
747 * only 1/2 of the left utilization budget:
749 * util_avg_cap = (cpu_scale - cfs_rq->avg.util_avg) / 2^n
751 * where n denotes the nth task and cpu_scale the CPU capacity.
753 * For example, for a CPU with 1024 of capacity, a simplest series from
754 * the beginning would be like:
756 * task util_avg: 512, 256, 128, 64, 32, 16, 8, ...
757 * cfs_rq util_avg: 512, 768, 896, 960, 992, 1008, 1016, ...
759 * Finally, that extrapolated util_avg is clamped to the cap (util_avg_cap)
760 * if util_avg > util_avg_cap.
762 void post_init_entity_util_avg(struct task_struct
*p
)
764 struct sched_entity
*se
= &p
->se
;
765 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
766 struct sched_avg
*sa
= &se
->avg
;
767 long cpu_scale
= arch_scale_cpu_capacity(NULL
, cpu_of(rq_of(cfs_rq
)));
768 long cap
= (long)(cpu_scale
- cfs_rq
->avg
.util_avg
) / 2;
771 if (cfs_rq
->avg
.util_avg
!= 0) {
772 sa
->util_avg
= cfs_rq
->avg
.util_avg
* se
->load
.weight
;
773 sa
->util_avg
/= (cfs_rq
->avg
.load_avg
+ 1);
775 if (sa
->util_avg
> cap
)
782 if (p
->sched_class
!= &fair_sched_class
) {
784 * For !fair tasks do:
786 update_cfs_rq_load_avg(now, cfs_rq);
787 attach_entity_load_avg(cfs_rq, se, 0);
788 switched_from_fair(rq, p);
790 * such that the next switched_to_fair() has the
793 se
->avg
.last_update_time
= cfs_rq_clock_pelt(cfs_rq
);
797 attach_entity_cfs_rq(se
);
800 #else /* !CONFIG_SMP */
801 void init_entity_runnable_average(struct sched_entity
*se
)
804 void post_init_entity_util_avg(struct task_struct
*p
)
807 static void update_tg_load_avg(struct cfs_rq
*cfs_rq
, int force
)
810 #endif /* CONFIG_SMP */
813 * Update the current task's runtime statistics.
815 static void update_curr(struct cfs_rq
*cfs_rq
)
817 struct sched_entity
*curr
= cfs_rq
->curr
;
818 u64 now
= rq_clock_task(rq_of(cfs_rq
));
824 delta_exec
= now
- curr
->exec_start
;
825 if (unlikely((s64
)delta_exec
<= 0))
828 curr
->exec_start
= now
;
830 schedstat_set(curr
->statistics
.exec_max
,
831 max(delta_exec
, curr
->statistics
.exec_max
));
833 curr
->sum_exec_runtime
+= delta_exec
;
834 schedstat_add(cfs_rq
->exec_clock
, delta_exec
);
836 curr
->vruntime
+= calc_delta_fair(delta_exec
, curr
);
837 update_min_vruntime(cfs_rq
);
839 if (entity_is_task(curr
)) {
840 struct task_struct
*curtask
= task_of(curr
);
842 trace_sched_stat_runtime(curtask
, delta_exec
, curr
->vruntime
);
843 cgroup_account_cputime(curtask
, delta_exec
);
844 account_group_exec_runtime(curtask
, delta_exec
);
847 account_cfs_rq_runtime(cfs_rq
, delta_exec
);
850 static void update_curr_fair(struct rq
*rq
)
852 update_curr(cfs_rq_of(&rq
->curr
->se
));
856 update_stats_wait_start(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
858 u64 wait_start
, prev_wait_start
;
860 if (!schedstat_enabled())
863 wait_start
= rq_clock(rq_of(cfs_rq
));
864 prev_wait_start
= schedstat_val(se
->statistics
.wait_start
);
866 if (entity_is_task(se
) && task_on_rq_migrating(task_of(se
)) &&
867 likely(wait_start
> prev_wait_start
))
868 wait_start
-= prev_wait_start
;
870 __schedstat_set(se
->statistics
.wait_start
, wait_start
);
874 update_stats_wait_end(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
876 struct task_struct
*p
;
879 if (!schedstat_enabled())
882 delta
= rq_clock(rq_of(cfs_rq
)) - schedstat_val(se
->statistics
.wait_start
);
884 if (entity_is_task(se
)) {
886 if (task_on_rq_migrating(p
)) {
888 * Preserve migrating task's wait time so wait_start
889 * time stamp can be adjusted to accumulate wait time
890 * prior to migration.
892 __schedstat_set(se
->statistics
.wait_start
, delta
);
895 trace_sched_stat_wait(p
, delta
);
898 __schedstat_set(se
->statistics
.wait_max
,
899 max(schedstat_val(se
->statistics
.wait_max
), delta
));
900 __schedstat_inc(se
->statistics
.wait_count
);
901 __schedstat_add(se
->statistics
.wait_sum
, delta
);
902 __schedstat_set(se
->statistics
.wait_start
, 0);
906 update_stats_enqueue_sleeper(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
908 struct task_struct
*tsk
= NULL
;
909 u64 sleep_start
, block_start
;
911 if (!schedstat_enabled())
914 sleep_start
= schedstat_val(se
->statistics
.sleep_start
);
915 block_start
= schedstat_val(se
->statistics
.block_start
);
917 if (entity_is_task(se
))
921 u64 delta
= rq_clock(rq_of(cfs_rq
)) - sleep_start
;
926 if (unlikely(delta
> schedstat_val(se
->statistics
.sleep_max
)))
927 __schedstat_set(se
->statistics
.sleep_max
, delta
);
929 __schedstat_set(se
->statistics
.sleep_start
, 0);
930 __schedstat_add(se
->statistics
.sum_sleep_runtime
, delta
);
933 account_scheduler_latency(tsk
, delta
>> 10, 1);
934 trace_sched_stat_sleep(tsk
, delta
);
938 u64 delta
= rq_clock(rq_of(cfs_rq
)) - block_start
;
943 if (unlikely(delta
> schedstat_val(se
->statistics
.block_max
)))
944 __schedstat_set(se
->statistics
.block_max
, delta
);
946 __schedstat_set(se
->statistics
.block_start
, 0);
947 __schedstat_add(se
->statistics
.sum_sleep_runtime
, delta
);
950 if (tsk
->in_iowait
) {
951 __schedstat_add(se
->statistics
.iowait_sum
, delta
);
952 __schedstat_inc(se
->statistics
.iowait_count
);
953 trace_sched_stat_iowait(tsk
, delta
);
956 trace_sched_stat_blocked(tsk
, delta
);
959 * Blocking time is in units of nanosecs, so shift by
960 * 20 to get a milliseconds-range estimation of the
961 * amount of time that the task spent sleeping:
963 if (unlikely(prof_on
== SLEEP_PROFILING
)) {
964 profile_hits(SLEEP_PROFILING
,
965 (void *)get_wchan(tsk
),
968 account_scheduler_latency(tsk
, delta
>> 10, 0);
974 * Task is being enqueued - update stats:
977 update_stats_enqueue(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int flags
)
979 if (!schedstat_enabled())
983 * Are we enqueueing a waiting task? (for current tasks
984 * a dequeue/enqueue event is a NOP)
986 if (se
!= cfs_rq
->curr
)
987 update_stats_wait_start(cfs_rq
, se
);
989 if (flags
& ENQUEUE_WAKEUP
)
990 update_stats_enqueue_sleeper(cfs_rq
, se
);
994 update_stats_dequeue(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int flags
)
997 if (!schedstat_enabled())
1001 * Mark the end of the wait period if dequeueing a
1004 if (se
!= cfs_rq
->curr
)
1005 update_stats_wait_end(cfs_rq
, se
);
1007 if ((flags
& DEQUEUE_SLEEP
) && entity_is_task(se
)) {
1008 struct task_struct
*tsk
= task_of(se
);
1010 if (tsk
->state
& TASK_INTERRUPTIBLE
)
1011 __schedstat_set(se
->statistics
.sleep_start
,
1012 rq_clock(rq_of(cfs_rq
)));
1013 if (tsk
->state
& TASK_UNINTERRUPTIBLE
)
1014 __schedstat_set(se
->statistics
.block_start
,
1015 rq_clock(rq_of(cfs_rq
)));
1020 * We are picking a new current task - update its stats:
1023 update_stats_curr_start(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
1026 * We are starting a new run period:
1028 se
->exec_start
= rq_clock_task(rq_of(cfs_rq
));
1031 /**************************************************
1032 * Scheduling class queueing methods:
1035 #ifdef CONFIG_NUMA_BALANCING
1037 * Approximate time to scan a full NUMA task in ms. The task scan period is
1038 * calculated based on the tasks virtual memory size and
1039 * numa_balancing_scan_size.
1041 unsigned int sysctl_numa_balancing_scan_period_min
= 1000;
1042 unsigned int sysctl_numa_balancing_scan_period_max
= 60000;
1044 /* Portion of address space to scan in MB */
1045 unsigned int sysctl_numa_balancing_scan_size
= 256;
1047 /* Scan @scan_size MB every @scan_period after an initial @scan_delay in ms */
1048 unsigned int sysctl_numa_balancing_scan_delay
= 1000;
1051 refcount_t refcount
;
1053 spinlock_t lock
; /* nr_tasks, tasks */
1058 struct rcu_head rcu
;
1059 unsigned long total_faults
;
1060 unsigned long max_faults_cpu
;
1062 * Faults_cpu is used to decide whether memory should move
1063 * towards the CPU. As a consequence, these stats are weighted
1064 * more by CPU use than by memory faults.
1066 unsigned long *faults_cpu
;
1067 unsigned long faults
[0];
1070 static inline unsigned long group_faults_priv(struct numa_group
*ng
);
1071 static inline unsigned long group_faults_shared(struct numa_group
*ng
);
1073 static unsigned int task_nr_scan_windows(struct task_struct
*p
)
1075 unsigned long rss
= 0;
1076 unsigned long nr_scan_pages
;
1079 * Calculations based on RSS as non-present and empty pages are skipped
1080 * by the PTE scanner and NUMA hinting faults should be trapped based
1083 nr_scan_pages
= sysctl_numa_balancing_scan_size
<< (20 - PAGE_SHIFT
);
1084 rss
= get_mm_rss(p
->mm
);
1086 rss
= nr_scan_pages
;
1088 rss
= round_up(rss
, nr_scan_pages
);
1089 return rss
/ nr_scan_pages
;
1092 /* For sanitys sake, never scan more PTEs than MAX_SCAN_WINDOW MB/sec. */
1093 #define MAX_SCAN_WINDOW 2560
1095 static unsigned int task_scan_min(struct task_struct
*p
)
1097 unsigned int scan_size
= READ_ONCE(sysctl_numa_balancing_scan_size
);
1098 unsigned int scan
, floor
;
1099 unsigned int windows
= 1;
1101 if (scan_size
< MAX_SCAN_WINDOW
)
1102 windows
= MAX_SCAN_WINDOW
/ scan_size
;
1103 floor
= 1000 / windows
;
1105 scan
= sysctl_numa_balancing_scan_period_min
/ task_nr_scan_windows(p
);
1106 return max_t(unsigned int, floor
, scan
);
1109 static unsigned int task_scan_start(struct task_struct
*p
)
1111 unsigned long smin
= task_scan_min(p
);
1112 unsigned long period
= smin
;
1114 /* Scale the maximum scan period with the amount of shared memory. */
1115 if (p
->numa_group
) {
1116 struct numa_group
*ng
= p
->numa_group
;
1117 unsigned long shared
= group_faults_shared(ng
);
1118 unsigned long private = group_faults_priv(ng
);
1120 period
*= refcount_read(&ng
->refcount
);
1121 period
*= shared
+ 1;
1122 period
/= private + shared
+ 1;
1125 return max(smin
, period
);
1128 static unsigned int task_scan_max(struct task_struct
*p
)
1130 unsigned long smin
= task_scan_min(p
);
1133 /* Watch for min being lower than max due to floor calculations */
1134 smax
= sysctl_numa_balancing_scan_period_max
/ task_nr_scan_windows(p
);
1136 /* Scale the maximum scan period with the amount of shared memory. */
1137 if (p
->numa_group
) {
1138 struct numa_group
*ng
= p
->numa_group
;
1139 unsigned long shared
= group_faults_shared(ng
);
1140 unsigned long private = group_faults_priv(ng
);
1141 unsigned long period
= smax
;
1143 period
*= refcount_read(&ng
->refcount
);
1144 period
*= shared
+ 1;
1145 period
/= private + shared
+ 1;
1147 smax
= max(smax
, period
);
1150 return max(smin
, smax
);
1153 void init_numa_balancing(unsigned long clone_flags
, struct task_struct
*p
)
1156 struct mm_struct
*mm
= p
->mm
;
1159 mm_users
= atomic_read(&mm
->mm_users
);
1160 if (mm_users
== 1) {
1161 mm
->numa_next_scan
= jiffies
+ msecs_to_jiffies(sysctl_numa_balancing_scan_delay
);
1162 mm
->numa_scan_seq
= 0;
1166 p
->numa_scan_seq
= mm
? mm
->numa_scan_seq
: 0;
1167 p
->numa_scan_period
= sysctl_numa_balancing_scan_delay
;
1168 p
->numa_work
.next
= &p
->numa_work
;
1169 p
->numa_faults
= NULL
;
1170 p
->numa_group
= NULL
;
1171 p
->last_task_numa_placement
= 0;
1172 p
->last_sum_exec_runtime
= 0;
1174 /* New address space, reset the preferred nid */
1175 if (!(clone_flags
& CLONE_VM
)) {
1176 p
->numa_preferred_nid
= NUMA_NO_NODE
;
1181 * New thread, keep existing numa_preferred_nid which should be copied
1182 * already by arch_dup_task_struct but stagger when scans start.
1187 delay
= min_t(unsigned int, task_scan_max(current
),
1188 current
->numa_scan_period
* mm_users
* NSEC_PER_MSEC
);
1189 delay
+= 2 * TICK_NSEC
;
1190 p
->node_stamp
= delay
;
1194 static void account_numa_enqueue(struct rq
*rq
, struct task_struct
*p
)
1196 rq
->nr_numa_running
+= (p
->numa_preferred_nid
!= NUMA_NO_NODE
);
1197 rq
->nr_preferred_running
+= (p
->numa_preferred_nid
== task_node(p
));
1200 static void account_numa_dequeue(struct rq
*rq
, struct task_struct
*p
)
1202 rq
->nr_numa_running
-= (p
->numa_preferred_nid
!= NUMA_NO_NODE
);
1203 rq
->nr_preferred_running
-= (p
->numa_preferred_nid
== task_node(p
));
1206 /* Shared or private faults. */
1207 #define NR_NUMA_HINT_FAULT_TYPES 2
1209 /* Memory and CPU locality */
1210 #define NR_NUMA_HINT_FAULT_STATS (NR_NUMA_HINT_FAULT_TYPES * 2)
1212 /* Averaged statistics, and temporary buffers. */
1213 #define NR_NUMA_HINT_FAULT_BUCKETS (NR_NUMA_HINT_FAULT_STATS * 2)
1215 pid_t
task_numa_group_id(struct task_struct
*p
)
1217 return p
->numa_group
? p
->numa_group
->gid
: 0;
1221 * The averaged statistics, shared & private, memory & CPU,
1222 * occupy the first half of the array. The second half of the
1223 * array is for current counters, which are averaged into the
1224 * first set by task_numa_placement.
1226 static inline int task_faults_idx(enum numa_faults_stats s
, int nid
, int priv
)
1228 return NR_NUMA_HINT_FAULT_TYPES
* (s
* nr_node_ids
+ nid
) + priv
;
1231 static inline unsigned long task_faults(struct task_struct
*p
, int nid
)
1233 if (!p
->numa_faults
)
1236 return p
->numa_faults
[task_faults_idx(NUMA_MEM
, nid
, 0)] +
1237 p
->numa_faults
[task_faults_idx(NUMA_MEM
, nid
, 1)];
1240 static inline unsigned long group_faults(struct task_struct
*p
, int nid
)
1245 return p
->numa_group
->faults
[task_faults_idx(NUMA_MEM
, nid
, 0)] +
1246 p
->numa_group
->faults
[task_faults_idx(NUMA_MEM
, nid
, 1)];
1249 static inline unsigned long group_faults_cpu(struct numa_group
*group
, int nid
)
1251 return group
->faults_cpu
[task_faults_idx(NUMA_MEM
, nid
, 0)] +
1252 group
->faults_cpu
[task_faults_idx(NUMA_MEM
, nid
, 1)];
1255 static inline unsigned long group_faults_priv(struct numa_group
*ng
)
1257 unsigned long faults
= 0;
1260 for_each_online_node(node
) {
1261 faults
+= ng
->faults
[task_faults_idx(NUMA_MEM
, node
, 1)];
1267 static inline unsigned long group_faults_shared(struct numa_group
*ng
)
1269 unsigned long faults
= 0;
1272 for_each_online_node(node
) {
1273 faults
+= ng
->faults
[task_faults_idx(NUMA_MEM
, node
, 0)];
1280 * A node triggering more than 1/3 as many NUMA faults as the maximum is
1281 * considered part of a numa group's pseudo-interleaving set. Migrations
1282 * between these nodes are slowed down, to allow things to settle down.
1284 #define ACTIVE_NODE_FRACTION 3
1286 static bool numa_is_active_node(int nid
, struct numa_group
*ng
)
1288 return group_faults_cpu(ng
, nid
) * ACTIVE_NODE_FRACTION
> ng
->max_faults_cpu
;
1291 /* Handle placement on systems where not all nodes are directly connected. */
1292 static unsigned long score_nearby_nodes(struct task_struct
*p
, int nid
,
1293 int maxdist
, bool task
)
1295 unsigned long score
= 0;
1299 * All nodes are directly connected, and the same distance
1300 * from each other. No need for fancy placement algorithms.
1302 if (sched_numa_topology_type
== NUMA_DIRECT
)
1306 * This code is called for each node, introducing N^2 complexity,
1307 * which should be ok given the number of nodes rarely exceeds 8.
1309 for_each_online_node(node
) {
1310 unsigned long faults
;
1311 int dist
= node_distance(nid
, node
);
1314 * The furthest away nodes in the system are not interesting
1315 * for placement; nid was already counted.
1317 if (dist
== sched_max_numa_distance
|| node
== nid
)
1321 * On systems with a backplane NUMA topology, compare groups
1322 * of nodes, and move tasks towards the group with the most
1323 * memory accesses. When comparing two nodes at distance
1324 * "hoplimit", only nodes closer by than "hoplimit" are part
1325 * of each group. Skip other nodes.
1327 if (sched_numa_topology_type
== NUMA_BACKPLANE
&&
1331 /* Add up the faults from nearby nodes. */
1333 faults
= task_faults(p
, node
);
1335 faults
= group_faults(p
, node
);
1338 * On systems with a glueless mesh NUMA topology, there are
1339 * no fixed "groups of nodes". Instead, nodes that are not
1340 * directly connected bounce traffic through intermediate
1341 * nodes; a numa_group can occupy any set of nodes.
1342 * The further away a node is, the less the faults count.
1343 * This seems to result in good task placement.
1345 if (sched_numa_topology_type
== NUMA_GLUELESS_MESH
) {
1346 faults
*= (sched_max_numa_distance
- dist
);
1347 faults
/= (sched_max_numa_distance
- LOCAL_DISTANCE
);
1357 * These return the fraction of accesses done by a particular task, or
1358 * task group, on a particular numa node. The group weight is given a
1359 * larger multiplier, in order to group tasks together that are almost
1360 * evenly spread out between numa nodes.
1362 static inline unsigned long task_weight(struct task_struct
*p
, int nid
,
1365 unsigned long faults
, total_faults
;
1367 if (!p
->numa_faults
)
1370 total_faults
= p
->total_numa_faults
;
1375 faults
= task_faults(p
, nid
);
1376 faults
+= score_nearby_nodes(p
, nid
, dist
, true);
1378 return 1000 * faults
/ total_faults
;
1381 static inline unsigned long group_weight(struct task_struct
*p
, int nid
,
1384 unsigned long faults
, total_faults
;
1389 total_faults
= p
->numa_group
->total_faults
;
1394 faults
= group_faults(p
, nid
);
1395 faults
+= score_nearby_nodes(p
, nid
, dist
, false);
1397 return 1000 * faults
/ total_faults
;
1400 bool should_numa_migrate_memory(struct task_struct
*p
, struct page
* page
,
1401 int src_nid
, int dst_cpu
)
1403 struct numa_group
*ng
= p
->numa_group
;
1404 int dst_nid
= cpu_to_node(dst_cpu
);
1405 int last_cpupid
, this_cpupid
;
1407 this_cpupid
= cpu_pid_to_cpupid(dst_cpu
, current
->pid
);
1408 last_cpupid
= page_cpupid_xchg_last(page
, this_cpupid
);
1411 * Allow first faults or private faults to migrate immediately early in
1412 * the lifetime of a task. The magic number 4 is based on waiting for
1413 * two full passes of the "multi-stage node selection" test that is
1416 if ((p
->numa_preferred_nid
== NUMA_NO_NODE
|| p
->numa_scan_seq
<= 4) &&
1417 (cpupid_pid_unset(last_cpupid
) || cpupid_match_pid(p
, last_cpupid
)))
1421 * Multi-stage node selection is used in conjunction with a periodic
1422 * migration fault to build a temporal task<->page relation. By using
1423 * a two-stage filter we remove short/unlikely relations.
1425 * Using P(p) ~ n_p / n_t as per frequentist probability, we can equate
1426 * a task's usage of a particular page (n_p) per total usage of this
1427 * page (n_t) (in a given time-span) to a probability.
1429 * Our periodic faults will sample this probability and getting the
1430 * same result twice in a row, given these samples are fully
1431 * independent, is then given by P(n)^2, provided our sample period
1432 * is sufficiently short compared to the usage pattern.
1434 * This quadric squishes small probabilities, making it less likely we
1435 * act on an unlikely task<->page relation.
1437 if (!cpupid_pid_unset(last_cpupid
) &&
1438 cpupid_to_nid(last_cpupid
) != dst_nid
)
1441 /* Always allow migrate on private faults */
1442 if (cpupid_match_pid(p
, last_cpupid
))
1445 /* A shared fault, but p->numa_group has not been set up yet. */
1450 * Destination node is much more heavily used than the source
1451 * node? Allow migration.
1453 if (group_faults_cpu(ng
, dst_nid
) > group_faults_cpu(ng
, src_nid
) *
1454 ACTIVE_NODE_FRACTION
)
1458 * Distribute memory according to CPU & memory use on each node,
1459 * with 3/4 hysteresis to avoid unnecessary memory migrations:
1461 * faults_cpu(dst) 3 faults_cpu(src)
1462 * --------------- * - > ---------------
1463 * faults_mem(dst) 4 faults_mem(src)
1465 return group_faults_cpu(ng
, dst_nid
) * group_faults(p
, src_nid
) * 3 >
1466 group_faults_cpu(ng
, src_nid
) * group_faults(p
, dst_nid
) * 4;
1469 static unsigned long weighted_cpuload(struct rq
*rq
);
1470 static unsigned long source_load(int cpu
, int type
);
1471 static unsigned long target_load(int cpu
, int type
);
1473 /* Cached statistics for all CPUs within a node */
1477 /* Total compute capacity of CPUs on a node */
1478 unsigned long compute_capacity
;
1482 * XXX borrowed from update_sg_lb_stats
1484 static void update_numa_stats(struct numa_stats
*ns
, int nid
)
1488 memset(ns
, 0, sizeof(*ns
));
1489 for_each_cpu(cpu
, cpumask_of_node(nid
)) {
1490 struct rq
*rq
= cpu_rq(cpu
);
1492 ns
->load
+= weighted_cpuload(rq
);
1493 ns
->compute_capacity
+= capacity_of(cpu
);
1498 struct task_numa_env
{
1499 struct task_struct
*p
;
1501 int src_cpu
, src_nid
;
1502 int dst_cpu
, dst_nid
;
1504 struct numa_stats src_stats
, dst_stats
;
1509 struct task_struct
*best_task
;
1514 static void task_numa_assign(struct task_numa_env
*env
,
1515 struct task_struct
*p
, long imp
)
1517 struct rq
*rq
= cpu_rq(env
->dst_cpu
);
1519 /* Bail out if run-queue part of active NUMA balance. */
1520 if (xchg(&rq
->numa_migrate_on
, 1))
1524 * Clear previous best_cpu/rq numa-migrate flag, since task now
1525 * found a better CPU to move/swap.
1527 if (env
->best_cpu
!= -1) {
1528 rq
= cpu_rq(env
->best_cpu
);
1529 WRITE_ONCE(rq
->numa_migrate_on
, 0);
1533 put_task_struct(env
->best_task
);
1538 env
->best_imp
= imp
;
1539 env
->best_cpu
= env
->dst_cpu
;
1542 static bool load_too_imbalanced(long src_load
, long dst_load
,
1543 struct task_numa_env
*env
)
1546 long orig_src_load
, orig_dst_load
;
1547 long src_capacity
, dst_capacity
;
1550 * The load is corrected for the CPU capacity available on each node.
1553 * ------------ vs ---------
1554 * src_capacity dst_capacity
1556 src_capacity
= env
->src_stats
.compute_capacity
;
1557 dst_capacity
= env
->dst_stats
.compute_capacity
;
1559 imb
= abs(dst_load
* src_capacity
- src_load
* dst_capacity
);
1561 orig_src_load
= env
->src_stats
.load
;
1562 orig_dst_load
= env
->dst_stats
.load
;
1564 old_imb
= abs(orig_dst_load
* src_capacity
- orig_src_load
* dst_capacity
);
1566 /* Would this change make things worse? */
1567 return (imb
> old_imb
);
1571 * Maximum NUMA importance can be 1998 (2*999);
1572 * SMALLIMP @ 30 would be close to 1998/64.
1573 * Used to deter task migration.
1578 * This checks if the overall compute and NUMA accesses of the system would
1579 * be improved if the source tasks was migrated to the target dst_cpu taking
1580 * into account that it might be best if task running on the dst_cpu should
1581 * be exchanged with the source task
1583 static void task_numa_compare(struct task_numa_env
*env
,
1584 long taskimp
, long groupimp
, bool maymove
)
1586 struct rq
*dst_rq
= cpu_rq(env
->dst_cpu
);
1587 struct task_struct
*cur
;
1588 long src_load
, dst_load
;
1590 long imp
= env
->p
->numa_group
? groupimp
: taskimp
;
1592 int dist
= env
->dist
;
1594 if (READ_ONCE(dst_rq
->numa_migrate_on
))
1598 cur
= task_rcu_dereference(&dst_rq
->curr
);
1599 if (cur
&& ((cur
->flags
& PF_EXITING
) || is_idle_task(cur
)))
1603 * Because we have preemption enabled we can get migrated around and
1604 * end try selecting ourselves (current == env->p) as a swap candidate.
1610 if (maymove
&& moveimp
>= env
->best_imp
)
1617 * "imp" is the fault differential for the source task between the
1618 * source and destination node. Calculate the total differential for
1619 * the source task and potential destination task. The more negative
1620 * the value is, the more remote accesses that would be expected to
1621 * be incurred if the tasks were swapped.
1623 /* Skip this swap candidate if cannot move to the source cpu */
1624 if (!cpumask_test_cpu(env
->src_cpu
, &cur
->cpus_allowed
))
1628 * If dst and source tasks are in the same NUMA group, or not
1629 * in any group then look only at task weights.
1631 if (cur
->numa_group
== env
->p
->numa_group
) {
1632 imp
= taskimp
+ task_weight(cur
, env
->src_nid
, dist
) -
1633 task_weight(cur
, env
->dst_nid
, dist
);
1635 * Add some hysteresis to prevent swapping the
1636 * tasks within a group over tiny differences.
1638 if (cur
->numa_group
)
1642 * Compare the group weights. If a task is all by itself
1643 * (not part of a group), use the task weight instead.
1645 if (cur
->numa_group
&& env
->p
->numa_group
)
1646 imp
+= group_weight(cur
, env
->src_nid
, dist
) -
1647 group_weight(cur
, env
->dst_nid
, dist
);
1649 imp
+= task_weight(cur
, env
->src_nid
, dist
) -
1650 task_weight(cur
, env
->dst_nid
, dist
);
1653 if (maymove
&& moveimp
> imp
&& moveimp
> env
->best_imp
) {
1660 * If the NUMA importance is less than SMALLIMP,
1661 * task migration might only result in ping pong
1662 * of tasks and also hurt performance due to cache
1665 if (imp
< SMALLIMP
|| imp
<= env
->best_imp
+ SMALLIMP
/ 2)
1669 * In the overloaded case, try and keep the load balanced.
1671 load
= task_h_load(env
->p
) - task_h_load(cur
);
1675 dst_load
= env
->dst_stats
.load
+ load
;
1676 src_load
= env
->src_stats
.load
- load
;
1678 if (load_too_imbalanced(src_load
, dst_load
, env
))
1683 * One idle CPU per node is evaluated for a task numa move.
1684 * Call select_idle_sibling to maybe find a better one.
1688 * select_idle_siblings() uses an per-CPU cpumask that
1689 * can be used from IRQ context.
1691 local_irq_disable();
1692 env
->dst_cpu
= select_idle_sibling(env
->p
, env
->src_cpu
,
1697 task_numa_assign(env
, cur
, imp
);
1702 static void task_numa_find_cpu(struct task_numa_env
*env
,
1703 long taskimp
, long groupimp
)
1705 long src_load
, dst_load
, load
;
1706 bool maymove
= false;
1709 load
= task_h_load(env
->p
);
1710 dst_load
= env
->dst_stats
.load
+ load
;
1711 src_load
= env
->src_stats
.load
- load
;
1714 * If the improvement from just moving env->p direction is better
1715 * than swapping tasks around, check if a move is possible.
1717 maymove
= !load_too_imbalanced(src_load
, dst_load
, env
);
1719 for_each_cpu(cpu
, cpumask_of_node(env
->dst_nid
)) {
1720 /* Skip this CPU if the source task cannot migrate */
1721 if (!cpumask_test_cpu(cpu
, &env
->p
->cpus_allowed
))
1725 task_numa_compare(env
, taskimp
, groupimp
, maymove
);
1729 static int task_numa_migrate(struct task_struct
*p
)
1731 struct task_numa_env env
= {
1734 .src_cpu
= task_cpu(p
),
1735 .src_nid
= task_node(p
),
1737 .imbalance_pct
= 112,
1743 struct sched_domain
*sd
;
1745 unsigned long taskweight
, groupweight
;
1747 long taskimp
, groupimp
;
1750 * Pick the lowest SD_NUMA domain, as that would have the smallest
1751 * imbalance and would be the first to start moving tasks about.
1753 * And we want to avoid any moving of tasks about, as that would create
1754 * random movement of tasks -- counter the numa conditions we're trying
1758 sd
= rcu_dereference(per_cpu(sd_numa
, env
.src_cpu
));
1760 env
.imbalance_pct
= 100 + (sd
->imbalance_pct
- 100) / 2;
1764 * Cpusets can break the scheduler domain tree into smaller
1765 * balance domains, some of which do not cross NUMA boundaries.
1766 * Tasks that are "trapped" in such domains cannot be migrated
1767 * elsewhere, so there is no point in (re)trying.
1769 if (unlikely(!sd
)) {
1770 sched_setnuma(p
, task_node(p
));
1774 env
.dst_nid
= p
->numa_preferred_nid
;
1775 dist
= env
.dist
= node_distance(env
.src_nid
, env
.dst_nid
);
1776 taskweight
= task_weight(p
, env
.src_nid
, dist
);
1777 groupweight
= group_weight(p
, env
.src_nid
, dist
);
1778 update_numa_stats(&env
.src_stats
, env
.src_nid
);
1779 taskimp
= task_weight(p
, env
.dst_nid
, dist
) - taskweight
;
1780 groupimp
= group_weight(p
, env
.dst_nid
, dist
) - groupweight
;
1781 update_numa_stats(&env
.dst_stats
, env
.dst_nid
);
1783 /* Try to find a spot on the preferred nid. */
1784 task_numa_find_cpu(&env
, taskimp
, groupimp
);
1787 * Look at other nodes in these cases:
1788 * - there is no space available on the preferred_nid
1789 * - the task is part of a numa_group that is interleaved across
1790 * multiple NUMA nodes; in order to better consolidate the group,
1791 * we need to check other locations.
1793 if (env
.best_cpu
== -1 || (p
->numa_group
&& p
->numa_group
->active_nodes
> 1)) {
1794 for_each_online_node(nid
) {
1795 if (nid
== env
.src_nid
|| nid
== p
->numa_preferred_nid
)
1798 dist
= node_distance(env
.src_nid
, env
.dst_nid
);
1799 if (sched_numa_topology_type
== NUMA_BACKPLANE
&&
1801 taskweight
= task_weight(p
, env
.src_nid
, dist
);
1802 groupweight
= group_weight(p
, env
.src_nid
, dist
);
1805 /* Only consider nodes where both task and groups benefit */
1806 taskimp
= task_weight(p
, nid
, dist
) - taskweight
;
1807 groupimp
= group_weight(p
, nid
, dist
) - groupweight
;
1808 if (taskimp
< 0 && groupimp
< 0)
1813 update_numa_stats(&env
.dst_stats
, env
.dst_nid
);
1814 task_numa_find_cpu(&env
, taskimp
, groupimp
);
1819 * If the task is part of a workload that spans multiple NUMA nodes,
1820 * and is migrating into one of the workload's active nodes, remember
1821 * this node as the task's preferred numa node, so the workload can
1823 * A task that migrated to a second choice node will be better off
1824 * trying for a better one later. Do not set the preferred node here.
1826 if (p
->numa_group
) {
1827 if (env
.best_cpu
== -1)
1830 nid
= cpu_to_node(env
.best_cpu
);
1832 if (nid
!= p
->numa_preferred_nid
)
1833 sched_setnuma(p
, nid
);
1836 /* No better CPU than the current one was found. */
1837 if (env
.best_cpu
== -1)
1840 best_rq
= cpu_rq(env
.best_cpu
);
1841 if (env
.best_task
== NULL
) {
1842 ret
= migrate_task_to(p
, env
.best_cpu
);
1843 WRITE_ONCE(best_rq
->numa_migrate_on
, 0);
1845 trace_sched_stick_numa(p
, env
.src_cpu
, env
.best_cpu
);
1849 ret
= migrate_swap(p
, env
.best_task
, env
.best_cpu
, env
.src_cpu
);
1850 WRITE_ONCE(best_rq
->numa_migrate_on
, 0);
1853 trace_sched_stick_numa(p
, env
.src_cpu
, task_cpu(env
.best_task
));
1854 put_task_struct(env
.best_task
);
1858 /* Attempt to migrate a task to a CPU on the preferred node. */
1859 static void numa_migrate_preferred(struct task_struct
*p
)
1861 unsigned long interval
= HZ
;
1863 /* This task has no NUMA fault statistics yet */
1864 if (unlikely(p
->numa_preferred_nid
== NUMA_NO_NODE
|| !p
->numa_faults
))
1867 /* Periodically retry migrating the task to the preferred node */
1868 interval
= min(interval
, msecs_to_jiffies(p
->numa_scan_period
) / 16);
1869 p
->numa_migrate_retry
= jiffies
+ interval
;
1871 /* Success if task is already running on preferred CPU */
1872 if (task_node(p
) == p
->numa_preferred_nid
)
1875 /* Otherwise, try migrate to a CPU on the preferred node */
1876 task_numa_migrate(p
);
1880 * Find out how many nodes on the workload is actively running on. Do this by
1881 * tracking the nodes from which NUMA hinting faults are triggered. This can
1882 * be different from the set of nodes where the workload's memory is currently
1885 static void numa_group_count_active_nodes(struct numa_group
*numa_group
)
1887 unsigned long faults
, max_faults
= 0;
1888 int nid
, active_nodes
= 0;
1890 for_each_online_node(nid
) {
1891 faults
= group_faults_cpu(numa_group
, nid
);
1892 if (faults
> max_faults
)
1893 max_faults
= faults
;
1896 for_each_online_node(nid
) {
1897 faults
= group_faults_cpu(numa_group
, nid
);
1898 if (faults
* ACTIVE_NODE_FRACTION
> max_faults
)
1902 numa_group
->max_faults_cpu
= max_faults
;
1903 numa_group
->active_nodes
= active_nodes
;
1907 * When adapting the scan rate, the period is divided into NUMA_PERIOD_SLOTS
1908 * increments. The more local the fault statistics are, the higher the scan
1909 * period will be for the next scan window. If local/(local+remote) ratio is
1910 * below NUMA_PERIOD_THRESHOLD (where range of ratio is 1..NUMA_PERIOD_SLOTS)
1911 * the scan period will decrease. Aim for 70% local accesses.
1913 #define NUMA_PERIOD_SLOTS 10
1914 #define NUMA_PERIOD_THRESHOLD 7
1917 * Increase the scan period (slow down scanning) if the majority of
1918 * our memory is already on our local node, or if the majority of
1919 * the page accesses are shared with other processes.
1920 * Otherwise, decrease the scan period.
1922 static void update_task_scan_period(struct task_struct
*p
,
1923 unsigned long shared
, unsigned long private)
1925 unsigned int period_slot
;
1926 int lr_ratio
, ps_ratio
;
1929 unsigned long remote
= p
->numa_faults_locality
[0];
1930 unsigned long local
= p
->numa_faults_locality
[1];
1933 * If there were no record hinting faults then either the task is
1934 * completely idle or all activity is areas that are not of interest
1935 * to automatic numa balancing. Related to that, if there were failed
1936 * migration then it implies we are migrating too quickly or the local
1937 * node is overloaded. In either case, scan slower
1939 if (local
+ shared
== 0 || p
->numa_faults_locality
[2]) {
1940 p
->numa_scan_period
= min(p
->numa_scan_period_max
,
1941 p
->numa_scan_period
<< 1);
1943 p
->mm
->numa_next_scan
= jiffies
+
1944 msecs_to_jiffies(p
->numa_scan_period
);
1950 * Prepare to scale scan period relative to the current period.
1951 * == NUMA_PERIOD_THRESHOLD scan period stays the same
1952 * < NUMA_PERIOD_THRESHOLD scan period decreases (scan faster)
1953 * >= NUMA_PERIOD_THRESHOLD scan period increases (scan slower)
1955 period_slot
= DIV_ROUND_UP(p
->numa_scan_period
, NUMA_PERIOD_SLOTS
);
1956 lr_ratio
= (local
* NUMA_PERIOD_SLOTS
) / (local
+ remote
);
1957 ps_ratio
= (private * NUMA_PERIOD_SLOTS
) / (private + shared
);
1959 if (ps_ratio
>= NUMA_PERIOD_THRESHOLD
) {
1961 * Most memory accesses are local. There is no need to
1962 * do fast NUMA scanning, since memory is already local.
1964 int slot
= ps_ratio
- NUMA_PERIOD_THRESHOLD
;
1967 diff
= slot
* period_slot
;
1968 } else if (lr_ratio
>= NUMA_PERIOD_THRESHOLD
) {
1970 * Most memory accesses are shared with other tasks.
1971 * There is no point in continuing fast NUMA scanning,
1972 * since other tasks may just move the memory elsewhere.
1974 int slot
= lr_ratio
- NUMA_PERIOD_THRESHOLD
;
1977 diff
= slot
* period_slot
;
1980 * Private memory faults exceed (SLOTS-THRESHOLD)/SLOTS,
1981 * yet they are not on the local NUMA node. Speed up
1982 * NUMA scanning to get the memory moved over.
1984 int ratio
= max(lr_ratio
, ps_ratio
);
1985 diff
= -(NUMA_PERIOD_THRESHOLD
- ratio
) * period_slot
;
1988 p
->numa_scan_period
= clamp(p
->numa_scan_period
+ diff
,
1989 task_scan_min(p
), task_scan_max(p
));
1990 memset(p
->numa_faults_locality
, 0, sizeof(p
->numa_faults_locality
));
1994 * Get the fraction of time the task has been running since the last
1995 * NUMA placement cycle. The scheduler keeps similar statistics, but
1996 * decays those on a 32ms period, which is orders of magnitude off
1997 * from the dozens-of-seconds NUMA balancing period. Use the scheduler
1998 * stats only if the task is so new there are no NUMA statistics yet.
2000 static u64
numa_get_avg_runtime(struct task_struct
*p
, u64
*period
)
2002 u64 runtime
, delta
, now
;
2003 /* Use the start of this time slice to avoid calculations. */
2004 now
= p
->se
.exec_start
;
2005 runtime
= p
->se
.sum_exec_runtime
;
2007 if (p
->last_task_numa_placement
) {
2008 delta
= runtime
- p
->last_sum_exec_runtime
;
2009 *period
= now
- p
->last_task_numa_placement
;
2011 delta
= p
->se
.avg
.load_sum
;
2012 *period
= LOAD_AVG_MAX
;
2015 p
->last_sum_exec_runtime
= runtime
;
2016 p
->last_task_numa_placement
= now
;
2022 * Determine the preferred nid for a task in a numa_group. This needs to
2023 * be done in a way that produces consistent results with group_weight,
2024 * otherwise workloads might not converge.
2026 static int preferred_group_nid(struct task_struct
*p
, int nid
)
2031 /* Direct connections between all NUMA nodes. */
2032 if (sched_numa_topology_type
== NUMA_DIRECT
)
2036 * On a system with glueless mesh NUMA topology, group_weight
2037 * scores nodes according to the number of NUMA hinting faults on
2038 * both the node itself, and on nearby nodes.
2040 if (sched_numa_topology_type
== NUMA_GLUELESS_MESH
) {
2041 unsigned long score
, max_score
= 0;
2042 int node
, max_node
= nid
;
2044 dist
= sched_max_numa_distance
;
2046 for_each_online_node(node
) {
2047 score
= group_weight(p
, node
, dist
);
2048 if (score
> max_score
) {
2057 * Finding the preferred nid in a system with NUMA backplane
2058 * interconnect topology is more involved. The goal is to locate
2059 * tasks from numa_groups near each other in the system, and
2060 * untangle workloads from different sides of the system. This requires
2061 * searching down the hierarchy of node groups, recursively searching
2062 * inside the highest scoring group of nodes. The nodemask tricks
2063 * keep the complexity of the search down.
2065 nodes
= node_online_map
;
2066 for (dist
= sched_max_numa_distance
; dist
> LOCAL_DISTANCE
; dist
--) {
2067 unsigned long max_faults
= 0;
2068 nodemask_t max_group
= NODE_MASK_NONE
;
2071 /* Are there nodes at this distance from each other? */
2072 if (!find_numa_distance(dist
))
2075 for_each_node_mask(a
, nodes
) {
2076 unsigned long faults
= 0;
2077 nodemask_t this_group
;
2078 nodes_clear(this_group
);
2080 /* Sum group's NUMA faults; includes a==b case. */
2081 for_each_node_mask(b
, nodes
) {
2082 if (node_distance(a
, b
) < dist
) {
2083 faults
+= group_faults(p
, b
);
2084 node_set(b
, this_group
);
2085 node_clear(b
, nodes
);
2089 /* Remember the top group. */
2090 if (faults
> max_faults
) {
2091 max_faults
= faults
;
2092 max_group
= this_group
;
2094 * subtle: at the smallest distance there is
2095 * just one node left in each "group", the
2096 * winner is the preferred nid.
2101 /* Next round, evaluate the nodes within max_group. */
2109 static void task_numa_placement(struct task_struct
*p
)
2111 int seq
, nid
, max_nid
= NUMA_NO_NODE
;
2112 unsigned long max_faults
= 0;
2113 unsigned long fault_types
[2] = { 0, 0 };
2114 unsigned long total_faults
;
2115 u64 runtime
, period
;
2116 spinlock_t
*group_lock
= NULL
;
2119 * The p->mm->numa_scan_seq field gets updated without
2120 * exclusive access. Use READ_ONCE() here to ensure
2121 * that the field is read in a single access:
2123 seq
= READ_ONCE(p
->mm
->numa_scan_seq
);
2124 if (p
->numa_scan_seq
== seq
)
2126 p
->numa_scan_seq
= seq
;
2127 p
->numa_scan_period_max
= task_scan_max(p
);
2129 total_faults
= p
->numa_faults_locality
[0] +
2130 p
->numa_faults_locality
[1];
2131 runtime
= numa_get_avg_runtime(p
, &period
);
2133 /* If the task is part of a group prevent parallel updates to group stats */
2134 if (p
->numa_group
) {
2135 group_lock
= &p
->numa_group
->lock
;
2136 spin_lock_irq(group_lock
);
2139 /* Find the node with the highest number of faults */
2140 for_each_online_node(nid
) {
2141 /* Keep track of the offsets in numa_faults array */
2142 int mem_idx
, membuf_idx
, cpu_idx
, cpubuf_idx
;
2143 unsigned long faults
= 0, group_faults
= 0;
2146 for (priv
= 0; priv
< NR_NUMA_HINT_FAULT_TYPES
; priv
++) {
2147 long diff
, f_diff
, f_weight
;
2149 mem_idx
= task_faults_idx(NUMA_MEM
, nid
, priv
);
2150 membuf_idx
= task_faults_idx(NUMA_MEMBUF
, nid
, priv
);
2151 cpu_idx
= task_faults_idx(NUMA_CPU
, nid
, priv
);
2152 cpubuf_idx
= task_faults_idx(NUMA_CPUBUF
, nid
, priv
);
2154 /* Decay existing window, copy faults since last scan */
2155 diff
= p
->numa_faults
[membuf_idx
] - p
->numa_faults
[mem_idx
] / 2;
2156 fault_types
[priv
] += p
->numa_faults
[membuf_idx
];
2157 p
->numa_faults
[membuf_idx
] = 0;
2160 * Normalize the faults_from, so all tasks in a group
2161 * count according to CPU use, instead of by the raw
2162 * number of faults. Tasks with little runtime have
2163 * little over-all impact on throughput, and thus their
2164 * faults are less important.
2166 f_weight
= div64_u64(runtime
<< 16, period
+ 1);
2167 f_weight
= (f_weight
* p
->numa_faults
[cpubuf_idx
]) /
2169 f_diff
= f_weight
- p
->numa_faults
[cpu_idx
] / 2;
2170 p
->numa_faults
[cpubuf_idx
] = 0;
2172 p
->numa_faults
[mem_idx
] += diff
;
2173 p
->numa_faults
[cpu_idx
] += f_diff
;
2174 faults
+= p
->numa_faults
[mem_idx
];
2175 p
->total_numa_faults
+= diff
;
2176 if (p
->numa_group
) {
2178 * safe because we can only change our own group
2180 * mem_idx represents the offset for a given
2181 * nid and priv in a specific region because it
2182 * is at the beginning of the numa_faults array.
2184 p
->numa_group
->faults
[mem_idx
] += diff
;
2185 p
->numa_group
->faults_cpu
[mem_idx
] += f_diff
;
2186 p
->numa_group
->total_faults
+= diff
;
2187 group_faults
+= p
->numa_group
->faults
[mem_idx
];
2191 if (!p
->numa_group
) {
2192 if (faults
> max_faults
) {
2193 max_faults
= faults
;
2196 } else if (group_faults
> max_faults
) {
2197 max_faults
= group_faults
;
2202 if (p
->numa_group
) {
2203 numa_group_count_active_nodes(p
->numa_group
);
2204 spin_unlock_irq(group_lock
);
2205 max_nid
= preferred_group_nid(p
, max_nid
);
2209 /* Set the new preferred node */
2210 if (max_nid
!= p
->numa_preferred_nid
)
2211 sched_setnuma(p
, max_nid
);
2214 update_task_scan_period(p
, fault_types
[0], fault_types
[1]);
2217 static inline int get_numa_group(struct numa_group
*grp
)
2219 return refcount_inc_not_zero(&grp
->refcount
);
2222 static inline void put_numa_group(struct numa_group
*grp
)
2224 if (refcount_dec_and_test(&grp
->refcount
))
2225 kfree_rcu(grp
, rcu
);
2228 static void task_numa_group(struct task_struct
*p
, int cpupid
, int flags
,
2231 struct numa_group
*grp
, *my_grp
;
2232 struct task_struct
*tsk
;
2234 int cpu
= cpupid_to_cpu(cpupid
);
2237 if (unlikely(!p
->numa_group
)) {
2238 unsigned int size
= sizeof(struct numa_group
) +
2239 4*nr_node_ids
*sizeof(unsigned long);
2241 grp
= kzalloc(size
, GFP_KERNEL
| __GFP_NOWARN
);
2245 refcount_set(&grp
->refcount
, 1);
2246 grp
->active_nodes
= 1;
2247 grp
->max_faults_cpu
= 0;
2248 spin_lock_init(&grp
->lock
);
2250 /* Second half of the array tracks nids where faults happen */
2251 grp
->faults_cpu
= grp
->faults
+ NR_NUMA_HINT_FAULT_TYPES
*
2254 for (i
= 0; i
< NR_NUMA_HINT_FAULT_STATS
* nr_node_ids
; i
++)
2255 grp
->faults
[i
] = p
->numa_faults
[i
];
2257 grp
->total_faults
= p
->total_numa_faults
;
2260 rcu_assign_pointer(p
->numa_group
, grp
);
2264 tsk
= READ_ONCE(cpu_rq(cpu
)->curr
);
2266 if (!cpupid_match_pid(tsk
, cpupid
))
2269 grp
= rcu_dereference(tsk
->numa_group
);
2273 my_grp
= p
->numa_group
;
2278 * Only join the other group if its bigger; if we're the bigger group,
2279 * the other task will join us.
2281 if (my_grp
->nr_tasks
> grp
->nr_tasks
)
2285 * Tie-break on the grp address.
2287 if (my_grp
->nr_tasks
== grp
->nr_tasks
&& my_grp
> grp
)
2290 /* Always join threads in the same process. */
2291 if (tsk
->mm
== current
->mm
)
2294 /* Simple filter to avoid false positives due to PID collisions */
2295 if (flags
& TNF_SHARED
)
2298 /* Update priv based on whether false sharing was detected */
2301 if (join
&& !get_numa_group(grp
))
2309 BUG_ON(irqs_disabled());
2310 double_lock_irq(&my_grp
->lock
, &grp
->lock
);
2312 for (i
= 0; i
< NR_NUMA_HINT_FAULT_STATS
* nr_node_ids
; i
++) {
2313 my_grp
->faults
[i
] -= p
->numa_faults
[i
];
2314 grp
->faults
[i
] += p
->numa_faults
[i
];
2316 my_grp
->total_faults
-= p
->total_numa_faults
;
2317 grp
->total_faults
+= p
->total_numa_faults
;
2322 spin_unlock(&my_grp
->lock
);
2323 spin_unlock_irq(&grp
->lock
);
2325 rcu_assign_pointer(p
->numa_group
, grp
);
2327 put_numa_group(my_grp
);
2335 void task_numa_free(struct task_struct
*p
)
2337 struct numa_group
*grp
= p
->numa_group
;
2338 void *numa_faults
= p
->numa_faults
;
2339 unsigned long flags
;
2343 spin_lock_irqsave(&grp
->lock
, flags
);
2344 for (i
= 0; i
< NR_NUMA_HINT_FAULT_STATS
* nr_node_ids
; i
++)
2345 grp
->faults
[i
] -= p
->numa_faults
[i
];
2346 grp
->total_faults
-= p
->total_numa_faults
;
2349 spin_unlock_irqrestore(&grp
->lock
, flags
);
2350 RCU_INIT_POINTER(p
->numa_group
, NULL
);
2351 put_numa_group(grp
);
2354 p
->numa_faults
= NULL
;
2359 * Got a PROT_NONE fault for a page on @node.
2361 void task_numa_fault(int last_cpupid
, int mem_node
, int pages
, int flags
)
2363 struct task_struct
*p
= current
;
2364 bool migrated
= flags
& TNF_MIGRATED
;
2365 int cpu_node
= task_node(current
);
2366 int local
= !!(flags
& TNF_FAULT_LOCAL
);
2367 struct numa_group
*ng
;
2370 if (!static_branch_likely(&sched_numa_balancing
))
2373 /* for example, ksmd faulting in a user's mm */
2377 /* Allocate buffer to track faults on a per-node basis */
2378 if (unlikely(!p
->numa_faults
)) {
2379 int size
= sizeof(*p
->numa_faults
) *
2380 NR_NUMA_HINT_FAULT_BUCKETS
* nr_node_ids
;
2382 p
->numa_faults
= kzalloc(size
, GFP_KERNEL
|__GFP_NOWARN
);
2383 if (!p
->numa_faults
)
2386 p
->total_numa_faults
= 0;
2387 memset(p
->numa_faults_locality
, 0, sizeof(p
->numa_faults_locality
));
2391 * First accesses are treated as private, otherwise consider accesses
2392 * to be private if the accessing pid has not changed
2394 if (unlikely(last_cpupid
== (-1 & LAST_CPUPID_MASK
))) {
2397 priv
= cpupid_match_pid(p
, last_cpupid
);
2398 if (!priv
&& !(flags
& TNF_NO_GROUP
))
2399 task_numa_group(p
, last_cpupid
, flags
, &priv
);
2403 * If a workload spans multiple NUMA nodes, a shared fault that
2404 * occurs wholly within the set of nodes that the workload is
2405 * actively using should be counted as local. This allows the
2406 * scan rate to slow down when a workload has settled down.
2409 if (!priv
&& !local
&& ng
&& ng
->active_nodes
> 1 &&
2410 numa_is_active_node(cpu_node
, ng
) &&
2411 numa_is_active_node(mem_node
, ng
))
2415 * Retry to migrate task to preferred node periodically, in case it
2416 * previously failed, or the scheduler moved us.
2418 if (time_after(jiffies
, p
->numa_migrate_retry
)) {
2419 task_numa_placement(p
);
2420 numa_migrate_preferred(p
);
2424 p
->numa_pages_migrated
+= pages
;
2425 if (flags
& TNF_MIGRATE_FAIL
)
2426 p
->numa_faults_locality
[2] += pages
;
2428 p
->numa_faults
[task_faults_idx(NUMA_MEMBUF
, mem_node
, priv
)] += pages
;
2429 p
->numa_faults
[task_faults_idx(NUMA_CPUBUF
, cpu_node
, priv
)] += pages
;
2430 p
->numa_faults_locality
[local
] += pages
;
2433 static void reset_ptenuma_scan(struct task_struct
*p
)
2436 * We only did a read acquisition of the mmap sem, so
2437 * p->mm->numa_scan_seq is written to without exclusive access
2438 * and the update is not guaranteed to be atomic. That's not
2439 * much of an issue though, since this is just used for
2440 * statistical sampling. Use READ_ONCE/WRITE_ONCE, which are not
2441 * expensive, to avoid any form of compiler optimizations:
2443 WRITE_ONCE(p
->mm
->numa_scan_seq
, READ_ONCE(p
->mm
->numa_scan_seq
) + 1);
2444 p
->mm
->numa_scan_offset
= 0;
2448 * The expensive part of numa migration is done from task_work context.
2449 * Triggered from task_tick_numa().
2451 void task_numa_work(struct callback_head
*work
)
2453 unsigned long migrate
, next_scan
, now
= jiffies
;
2454 struct task_struct
*p
= current
;
2455 struct mm_struct
*mm
= p
->mm
;
2456 u64 runtime
= p
->se
.sum_exec_runtime
;
2457 struct vm_area_struct
*vma
;
2458 unsigned long start
, end
;
2459 unsigned long nr_pte_updates
= 0;
2460 long pages
, virtpages
;
2462 SCHED_WARN_ON(p
!= container_of(work
, struct task_struct
, numa_work
));
2464 work
->next
= work
; /* protect against double add */
2466 * Who cares about NUMA placement when they're dying.
2468 * NOTE: make sure not to dereference p->mm before this check,
2469 * exit_task_work() happens _after_ exit_mm() so we could be called
2470 * without p->mm even though we still had it when we enqueued this
2473 if (p
->flags
& PF_EXITING
)
2476 if (!mm
->numa_next_scan
) {
2477 mm
->numa_next_scan
= now
+
2478 msecs_to_jiffies(sysctl_numa_balancing_scan_delay
);
2482 * Enforce maximal scan/migration frequency..
2484 migrate
= mm
->numa_next_scan
;
2485 if (time_before(now
, migrate
))
2488 if (p
->numa_scan_period
== 0) {
2489 p
->numa_scan_period_max
= task_scan_max(p
);
2490 p
->numa_scan_period
= task_scan_start(p
);
2493 next_scan
= now
+ msecs_to_jiffies(p
->numa_scan_period
);
2494 if (cmpxchg(&mm
->numa_next_scan
, migrate
, next_scan
) != migrate
)
2498 * Delay this task enough that another task of this mm will likely win
2499 * the next time around.
2501 p
->node_stamp
+= 2 * TICK_NSEC
;
2503 start
= mm
->numa_scan_offset
;
2504 pages
= sysctl_numa_balancing_scan_size
;
2505 pages
<<= 20 - PAGE_SHIFT
; /* MB in pages */
2506 virtpages
= pages
* 8; /* Scan up to this much virtual space */
2511 if (!down_read_trylock(&mm
->mmap_sem
))
2513 vma
= find_vma(mm
, start
);
2515 reset_ptenuma_scan(p
);
2519 for (; vma
; vma
= vma
->vm_next
) {
2520 if (!vma_migratable(vma
) || !vma_policy_mof(vma
) ||
2521 is_vm_hugetlb_page(vma
) || (vma
->vm_flags
& VM_MIXEDMAP
)) {
2526 * Shared library pages mapped by multiple processes are not
2527 * migrated as it is expected they are cache replicated. Avoid
2528 * hinting faults in read-only file-backed mappings or the vdso
2529 * as migrating the pages will be of marginal benefit.
2532 (vma
->vm_file
&& (vma
->vm_flags
& (VM_READ
|VM_WRITE
)) == (VM_READ
)))
2536 * Skip inaccessible VMAs to avoid any confusion between
2537 * PROT_NONE and NUMA hinting ptes
2539 if (!(vma
->vm_flags
& (VM_READ
| VM_EXEC
| VM_WRITE
)))
2543 start
= max(start
, vma
->vm_start
);
2544 end
= ALIGN(start
+ (pages
<< PAGE_SHIFT
), HPAGE_SIZE
);
2545 end
= min(end
, vma
->vm_end
);
2546 nr_pte_updates
= change_prot_numa(vma
, start
, end
);
2549 * Try to scan sysctl_numa_balancing_size worth of
2550 * hpages that have at least one present PTE that
2551 * is not already pte-numa. If the VMA contains
2552 * areas that are unused or already full of prot_numa
2553 * PTEs, scan up to virtpages, to skip through those
2557 pages
-= (end
- start
) >> PAGE_SHIFT
;
2558 virtpages
-= (end
- start
) >> PAGE_SHIFT
;
2561 if (pages
<= 0 || virtpages
<= 0)
2565 } while (end
!= vma
->vm_end
);
2570 * It is possible to reach the end of the VMA list but the last few
2571 * VMAs are not guaranteed to the vma_migratable. If they are not, we
2572 * would find the !migratable VMA on the next scan but not reset the
2573 * scanner to the start so check it now.
2576 mm
->numa_scan_offset
= start
;
2578 reset_ptenuma_scan(p
);
2579 up_read(&mm
->mmap_sem
);
2582 * Make sure tasks use at least 32x as much time to run other code
2583 * than they used here, to limit NUMA PTE scanning overhead to 3% max.
2584 * Usually update_task_scan_period slows down scanning enough; on an
2585 * overloaded system we need to limit overhead on a per task basis.
2587 if (unlikely(p
->se
.sum_exec_runtime
!= runtime
)) {
2588 u64 diff
= p
->se
.sum_exec_runtime
- runtime
;
2589 p
->node_stamp
+= 32 * diff
;
2594 * Drive the periodic memory faults..
2596 void task_tick_numa(struct rq
*rq
, struct task_struct
*curr
)
2598 struct callback_head
*work
= &curr
->numa_work
;
2602 * We don't care about NUMA placement if we don't have memory.
2604 if (!curr
->mm
|| (curr
->flags
& PF_EXITING
) || work
->next
!= work
)
2608 * Using runtime rather than walltime has the dual advantage that
2609 * we (mostly) drive the selection from busy threads and that the
2610 * task needs to have done some actual work before we bother with
2613 now
= curr
->se
.sum_exec_runtime
;
2614 period
= (u64
)curr
->numa_scan_period
* NSEC_PER_MSEC
;
2616 if (now
> curr
->node_stamp
+ period
) {
2617 if (!curr
->node_stamp
)
2618 curr
->numa_scan_period
= task_scan_start(curr
);
2619 curr
->node_stamp
+= period
;
2621 if (!time_before(jiffies
, curr
->mm
->numa_next_scan
)) {
2622 init_task_work(work
, task_numa_work
); /* TODO: move this into sched_fork() */
2623 task_work_add(curr
, work
, true);
2628 static void update_scan_period(struct task_struct
*p
, int new_cpu
)
2630 int src_nid
= cpu_to_node(task_cpu(p
));
2631 int dst_nid
= cpu_to_node(new_cpu
);
2633 if (!static_branch_likely(&sched_numa_balancing
))
2636 if (!p
->mm
|| !p
->numa_faults
|| (p
->flags
& PF_EXITING
))
2639 if (src_nid
== dst_nid
)
2643 * Allow resets if faults have been trapped before one scan
2644 * has completed. This is most likely due to a new task that
2645 * is pulled cross-node due to wakeups or load balancing.
2647 if (p
->numa_scan_seq
) {
2649 * Avoid scan adjustments if moving to the preferred
2650 * node or if the task was not previously running on
2651 * the preferred node.
2653 if (dst_nid
== p
->numa_preferred_nid
||
2654 (p
->numa_preferred_nid
!= NUMA_NO_NODE
&&
2655 src_nid
!= p
->numa_preferred_nid
))
2659 p
->numa_scan_period
= task_scan_start(p
);
2663 static void task_tick_numa(struct rq
*rq
, struct task_struct
*curr
)
2667 static inline void account_numa_enqueue(struct rq
*rq
, struct task_struct
*p
)
2671 static inline void account_numa_dequeue(struct rq
*rq
, struct task_struct
*p
)
2675 static inline void update_scan_period(struct task_struct
*p
, int new_cpu
)
2679 #endif /* CONFIG_NUMA_BALANCING */
2682 account_entity_enqueue(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
2684 update_load_add(&cfs_rq
->load
, se
->load
.weight
);
2685 if (!parent_entity(se
))
2686 update_load_add(&rq_of(cfs_rq
)->load
, se
->load
.weight
);
2688 if (entity_is_task(se
)) {
2689 struct rq
*rq
= rq_of(cfs_rq
);
2691 account_numa_enqueue(rq
, task_of(se
));
2692 list_add(&se
->group_node
, &rq
->cfs_tasks
);
2695 cfs_rq
->nr_running
++;
2699 account_entity_dequeue(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
2701 update_load_sub(&cfs_rq
->load
, se
->load
.weight
);
2702 if (!parent_entity(se
))
2703 update_load_sub(&rq_of(cfs_rq
)->load
, se
->load
.weight
);
2705 if (entity_is_task(se
)) {
2706 account_numa_dequeue(rq_of(cfs_rq
), task_of(se
));
2707 list_del_init(&se
->group_node
);
2710 cfs_rq
->nr_running
--;
2714 * Signed add and clamp on underflow.
2716 * Explicitly do a load-store to ensure the intermediate value never hits
2717 * memory. This allows lockless observations without ever seeing the negative
2720 #define add_positive(_ptr, _val) do { \
2721 typeof(_ptr) ptr = (_ptr); \
2722 typeof(_val) val = (_val); \
2723 typeof(*ptr) res, var = READ_ONCE(*ptr); \
2727 if (val < 0 && res > var) \
2730 WRITE_ONCE(*ptr, res); \
2734 * Unsigned subtract and clamp on underflow.
2736 * Explicitly do a load-store to ensure the intermediate value never hits
2737 * memory. This allows lockless observations without ever seeing the negative
2740 #define sub_positive(_ptr, _val) do { \
2741 typeof(_ptr) ptr = (_ptr); \
2742 typeof(*ptr) val = (_val); \
2743 typeof(*ptr) res, var = READ_ONCE(*ptr); \
2747 WRITE_ONCE(*ptr, res); \
2751 * Remove and clamp on negative, from a local variable.
2753 * A variant of sub_positive(), which does not use explicit load-store
2754 * and is thus optimized for local variable updates.
2756 #define lsub_positive(_ptr, _val) do { \
2757 typeof(_ptr) ptr = (_ptr); \
2758 *ptr -= min_t(typeof(*ptr), *ptr, _val); \
2763 enqueue_runnable_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
2765 cfs_rq
->runnable_weight
+= se
->runnable_weight
;
2767 cfs_rq
->avg
.runnable_load_avg
+= se
->avg
.runnable_load_avg
;
2768 cfs_rq
->avg
.runnable_load_sum
+= se_runnable(se
) * se
->avg
.runnable_load_sum
;
2772 dequeue_runnable_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
2774 cfs_rq
->runnable_weight
-= se
->runnable_weight
;
2776 sub_positive(&cfs_rq
->avg
.runnable_load_avg
, se
->avg
.runnable_load_avg
);
2777 sub_positive(&cfs_rq
->avg
.runnable_load_sum
,
2778 se_runnable(se
) * se
->avg
.runnable_load_sum
);
2782 enqueue_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
2784 cfs_rq
->avg
.load_avg
+= se
->avg
.load_avg
;
2785 cfs_rq
->avg
.load_sum
+= se_weight(se
) * se
->avg
.load_sum
;
2789 dequeue_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
2791 sub_positive(&cfs_rq
->avg
.load_avg
, se
->avg
.load_avg
);
2792 sub_positive(&cfs_rq
->avg
.load_sum
, se_weight(se
) * se
->avg
.load_sum
);
2796 enqueue_runnable_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
) { }
2798 dequeue_runnable_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
) { }
2800 enqueue_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
) { }
2802 dequeue_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
) { }
2805 static void reweight_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
,
2806 unsigned long weight
, unsigned long runnable
)
2809 /* commit outstanding execution time */
2810 if (cfs_rq
->curr
== se
)
2811 update_curr(cfs_rq
);
2812 account_entity_dequeue(cfs_rq
, se
);
2813 dequeue_runnable_load_avg(cfs_rq
, se
);
2815 dequeue_load_avg(cfs_rq
, se
);
2817 se
->runnable_weight
= runnable
;
2818 update_load_set(&se
->load
, weight
);
2822 u32 divider
= LOAD_AVG_MAX
- 1024 + se
->avg
.period_contrib
;
2824 se
->avg
.load_avg
= div_u64(se_weight(se
) * se
->avg
.load_sum
, divider
);
2825 se
->avg
.runnable_load_avg
=
2826 div_u64(se_runnable(se
) * se
->avg
.runnable_load_sum
, divider
);
2830 enqueue_load_avg(cfs_rq
, se
);
2832 account_entity_enqueue(cfs_rq
, se
);
2833 enqueue_runnable_load_avg(cfs_rq
, se
);
2837 void reweight_task(struct task_struct
*p
, int prio
)
2839 struct sched_entity
*se
= &p
->se
;
2840 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
2841 struct load_weight
*load
= &se
->load
;
2842 unsigned long weight
= scale_load(sched_prio_to_weight
[prio
]);
2844 reweight_entity(cfs_rq
, se
, weight
, weight
);
2845 load
->inv_weight
= sched_prio_to_wmult
[prio
];
2848 #ifdef CONFIG_FAIR_GROUP_SCHED
2851 * All this does is approximate the hierarchical proportion which includes that
2852 * global sum we all love to hate.
2854 * That is, the weight of a group entity, is the proportional share of the
2855 * group weight based on the group runqueue weights. That is:
2857 * tg->weight * grq->load.weight
2858 * ge->load.weight = ----------------------------- (1)
2859 * \Sum grq->load.weight
2861 * Now, because computing that sum is prohibitively expensive to compute (been
2862 * there, done that) we approximate it with this average stuff. The average
2863 * moves slower and therefore the approximation is cheaper and more stable.
2865 * So instead of the above, we substitute:
2867 * grq->load.weight -> grq->avg.load_avg (2)
2869 * which yields the following:
2871 * tg->weight * grq->avg.load_avg
2872 * ge->load.weight = ------------------------------ (3)
2875 * Where: tg->load_avg ~= \Sum grq->avg.load_avg
2877 * That is shares_avg, and it is right (given the approximation (2)).
2879 * The problem with it is that because the average is slow -- it was designed
2880 * to be exactly that of course -- this leads to transients in boundary
2881 * conditions. In specific, the case where the group was idle and we start the
2882 * one task. It takes time for our CPU's grq->avg.load_avg to build up,
2883 * yielding bad latency etc..
2885 * Now, in that special case (1) reduces to:
2887 * tg->weight * grq->load.weight
2888 * ge->load.weight = ----------------------------- = tg->weight (4)
2891 * That is, the sum collapses because all other CPUs are idle; the UP scenario.
2893 * So what we do is modify our approximation (3) to approach (4) in the (near)
2898 * tg->weight * grq->load.weight
2899 * --------------------------------------------------- (5)
2900 * tg->load_avg - grq->avg.load_avg + grq->load.weight
2902 * But because grq->load.weight can drop to 0, resulting in a divide by zero,
2903 * we need to use grq->avg.load_avg as its lower bound, which then gives:
2906 * tg->weight * grq->load.weight
2907 * ge->load.weight = ----------------------------- (6)
2912 * tg_load_avg' = tg->load_avg - grq->avg.load_avg +
2913 * max(grq->load.weight, grq->avg.load_avg)
2915 * And that is shares_weight and is icky. In the (near) UP case it approaches
2916 * (4) while in the normal case it approaches (3). It consistently
2917 * overestimates the ge->load.weight and therefore:
2919 * \Sum ge->load.weight >= tg->weight
2923 static long calc_group_shares(struct cfs_rq
*cfs_rq
)
2925 long tg_weight
, tg_shares
, load
, shares
;
2926 struct task_group
*tg
= cfs_rq
->tg
;
2928 tg_shares
= READ_ONCE(tg
->shares
);
2930 load
= max(scale_load_down(cfs_rq
->load
.weight
), cfs_rq
->avg
.load_avg
);
2932 tg_weight
= atomic_long_read(&tg
->load_avg
);
2934 /* Ensure tg_weight >= load */
2935 tg_weight
-= cfs_rq
->tg_load_avg_contrib
;
2938 shares
= (tg_shares
* load
);
2940 shares
/= tg_weight
;
2943 * MIN_SHARES has to be unscaled here to support per-CPU partitioning
2944 * of a group with small tg->shares value. It is a floor value which is
2945 * assigned as a minimum load.weight to the sched_entity representing
2946 * the group on a CPU.
2948 * E.g. on 64-bit for a group with tg->shares of scale_load(15)=15*1024
2949 * on an 8-core system with 8 tasks each runnable on one CPU shares has
2950 * to be 15*1024*1/8=1920 instead of scale_load(MIN_SHARES)=2*1024. In
2951 * case no task is runnable on a CPU MIN_SHARES=2 should be returned
2954 return clamp_t(long, shares
, MIN_SHARES
, tg_shares
);
2958 * This calculates the effective runnable weight for a group entity based on
2959 * the group entity weight calculated above.
2961 * Because of the above approximation (2), our group entity weight is
2962 * an load_avg based ratio (3). This means that it includes blocked load and
2963 * does not represent the runnable weight.
2965 * Approximate the group entity's runnable weight per ratio from the group
2968 * grq->avg.runnable_load_avg
2969 * ge->runnable_weight = ge->load.weight * -------------------------- (7)
2972 * However, analogous to above, since the avg numbers are slow, this leads to
2973 * transients in the from-idle case. Instead we use:
2975 * ge->runnable_weight = ge->load.weight *
2977 * max(grq->avg.runnable_load_avg, grq->runnable_weight)
2978 * ----------------------------------------------------- (8)
2979 * max(grq->avg.load_avg, grq->load.weight)
2981 * Where these max() serve both to use the 'instant' values to fix the slow
2982 * from-idle and avoid the /0 on to-idle, similar to (6).
2984 static long calc_group_runnable(struct cfs_rq
*cfs_rq
, long shares
)
2986 long runnable
, load_avg
;
2988 load_avg
= max(cfs_rq
->avg
.load_avg
,
2989 scale_load_down(cfs_rq
->load
.weight
));
2991 runnable
= max(cfs_rq
->avg
.runnable_load_avg
,
2992 scale_load_down(cfs_rq
->runnable_weight
));
2996 runnable
/= load_avg
;
2998 return clamp_t(long, runnable
, MIN_SHARES
, shares
);
3000 #endif /* CONFIG_SMP */
3002 static inline int throttled_hierarchy(struct cfs_rq
*cfs_rq
);
3005 * Recomputes the group entity based on the current state of its group
3008 static void update_cfs_group(struct sched_entity
*se
)
3010 struct cfs_rq
*gcfs_rq
= group_cfs_rq(se
);
3011 long shares
, runnable
;
3016 if (throttled_hierarchy(gcfs_rq
))
3020 runnable
= shares
= READ_ONCE(gcfs_rq
->tg
->shares
);
3022 if (likely(se
->load
.weight
== shares
))
3025 shares
= calc_group_shares(gcfs_rq
);
3026 runnable
= calc_group_runnable(gcfs_rq
, shares
);
3029 reweight_entity(cfs_rq_of(se
), se
, shares
, runnable
);
3032 #else /* CONFIG_FAIR_GROUP_SCHED */
3033 static inline void update_cfs_group(struct sched_entity
*se
)
3036 #endif /* CONFIG_FAIR_GROUP_SCHED */
3038 static inline void cfs_rq_util_change(struct cfs_rq
*cfs_rq
, int flags
)
3040 struct rq
*rq
= rq_of(cfs_rq
);
3042 if (&rq
->cfs
== cfs_rq
|| (flags
& SCHED_CPUFREQ_MIGRATION
)) {
3044 * There are a few boundary cases this might miss but it should
3045 * get called often enough that that should (hopefully) not be
3048 * It will not get called when we go idle, because the idle
3049 * thread is a different class (!fair), nor will the utilization
3050 * number include things like RT tasks.
3052 * As is, the util number is not freq-invariant (we'd have to
3053 * implement arch_scale_freq_capacity() for that).
3057 cpufreq_update_util(rq
, flags
);
3062 #ifdef CONFIG_FAIR_GROUP_SCHED
3064 * update_tg_load_avg - update the tg's load avg
3065 * @cfs_rq: the cfs_rq whose avg changed
3066 * @force: update regardless of how small the difference
3068 * This function 'ensures': tg->load_avg := \Sum tg->cfs_rq[]->avg.load.
3069 * However, because tg->load_avg is a global value there are performance
3072 * In order to avoid having to look at the other cfs_rq's, we use a
3073 * differential update where we store the last value we propagated. This in
3074 * turn allows skipping updates if the differential is 'small'.
3076 * Updating tg's load_avg is necessary before update_cfs_share().
3078 static inline void update_tg_load_avg(struct cfs_rq
*cfs_rq
, int force
)
3080 long delta
= cfs_rq
->avg
.load_avg
- cfs_rq
->tg_load_avg_contrib
;
3083 * No need to update load_avg for root_task_group as it is not used.
3085 if (cfs_rq
->tg
== &root_task_group
)
3088 if (force
|| abs(delta
) > cfs_rq
->tg_load_avg_contrib
/ 64) {
3089 atomic_long_add(delta
, &cfs_rq
->tg
->load_avg
);
3090 cfs_rq
->tg_load_avg_contrib
= cfs_rq
->avg
.load_avg
;
3095 * Called within set_task_rq() right before setting a task's CPU. The
3096 * caller only guarantees p->pi_lock is held; no other assumptions,
3097 * including the state of rq->lock, should be made.
3099 void set_task_rq_fair(struct sched_entity
*se
,
3100 struct cfs_rq
*prev
, struct cfs_rq
*next
)
3102 u64 p_last_update_time
;
3103 u64 n_last_update_time
;
3105 if (!sched_feat(ATTACH_AGE_LOAD
))
3109 * We are supposed to update the task to "current" time, then its up to
3110 * date and ready to go to new CPU/cfs_rq. But we have difficulty in
3111 * getting what current time is, so simply throw away the out-of-date
3112 * time. This will result in the wakee task is less decayed, but giving
3113 * the wakee more load sounds not bad.
3115 if (!(se
->avg
.last_update_time
&& prev
))
3118 #ifndef CONFIG_64BIT
3120 u64 p_last_update_time_copy
;
3121 u64 n_last_update_time_copy
;
3124 p_last_update_time_copy
= prev
->load_last_update_time_copy
;
3125 n_last_update_time_copy
= next
->load_last_update_time_copy
;
3129 p_last_update_time
= prev
->avg
.last_update_time
;
3130 n_last_update_time
= next
->avg
.last_update_time
;
3132 } while (p_last_update_time
!= p_last_update_time_copy
||
3133 n_last_update_time
!= n_last_update_time_copy
);
3136 p_last_update_time
= prev
->avg
.last_update_time
;
3137 n_last_update_time
= next
->avg
.last_update_time
;
3139 __update_load_avg_blocked_se(p_last_update_time
, se
);
3140 se
->avg
.last_update_time
= n_last_update_time
;
3145 * When on migration a sched_entity joins/leaves the PELT hierarchy, we need to
3146 * propagate its contribution. The key to this propagation is the invariant
3147 * that for each group:
3149 * ge->avg == grq->avg (1)
3151 * _IFF_ we look at the pure running and runnable sums. Because they
3152 * represent the very same entity, just at different points in the hierarchy.
3154 * Per the above update_tg_cfs_util() is trivial and simply copies the running
3155 * sum over (but still wrong, because the group entity and group rq do not have
3156 * their PELT windows aligned).
3158 * However, update_tg_cfs_runnable() is more complex. So we have:
3160 * ge->avg.load_avg = ge->load.weight * ge->avg.runnable_avg (2)
3162 * And since, like util, the runnable part should be directly transferable,
3163 * the following would _appear_ to be the straight forward approach:
3165 * grq->avg.load_avg = grq->load.weight * grq->avg.runnable_avg (3)
3167 * And per (1) we have:
3169 * ge->avg.runnable_avg == grq->avg.runnable_avg
3173 * ge->load.weight * grq->avg.load_avg
3174 * ge->avg.load_avg = ----------------------------------- (4)
3177 * Except that is wrong!
3179 * Because while for entities historical weight is not important and we
3180 * really only care about our future and therefore can consider a pure
3181 * runnable sum, runqueues can NOT do this.
3183 * We specifically want runqueues to have a load_avg that includes
3184 * historical weights. Those represent the blocked load, the load we expect
3185 * to (shortly) return to us. This only works by keeping the weights as
3186 * integral part of the sum. We therefore cannot decompose as per (3).
3188 * Another reason this doesn't work is that runnable isn't a 0-sum entity.
3189 * Imagine a rq with 2 tasks that each are runnable 2/3 of the time. Then the
3190 * rq itself is runnable anywhere between 2/3 and 1 depending on how the
3191 * runnable section of these tasks overlap (or not). If they were to perfectly
3192 * align the rq as a whole would be runnable 2/3 of the time. If however we
3193 * always have at least 1 runnable task, the rq as a whole is always runnable.
3195 * So we'll have to approximate.. :/
3197 * Given the constraint:
3199 * ge->avg.running_sum <= ge->avg.runnable_sum <= LOAD_AVG_MAX
3201 * We can construct a rule that adds runnable to a rq by assuming minimal
3204 * On removal, we'll assume each task is equally runnable; which yields:
3206 * grq->avg.runnable_sum = grq->avg.load_sum / grq->load.weight
3208 * XXX: only do this for the part of runnable > running ?
3213 update_tg_cfs_util(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, struct cfs_rq
*gcfs_rq
)
3215 long delta
= gcfs_rq
->avg
.util_avg
- se
->avg
.util_avg
;
3217 /* Nothing to update */
3222 * The relation between sum and avg is:
3224 * LOAD_AVG_MAX - 1024 + sa->period_contrib
3226 * however, the PELT windows are not aligned between grq and gse.
3229 /* Set new sched_entity's utilization */
3230 se
->avg
.util_avg
= gcfs_rq
->avg
.util_avg
;
3231 se
->avg
.util_sum
= se
->avg
.util_avg
* LOAD_AVG_MAX
;
3233 /* Update parent cfs_rq utilization */
3234 add_positive(&cfs_rq
->avg
.util_avg
, delta
);
3235 cfs_rq
->avg
.util_sum
= cfs_rq
->avg
.util_avg
* LOAD_AVG_MAX
;
3239 update_tg_cfs_runnable(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, struct cfs_rq
*gcfs_rq
)
3241 long delta_avg
, running_sum
, runnable_sum
= gcfs_rq
->prop_runnable_sum
;
3242 unsigned long runnable_load_avg
, load_avg
;
3243 u64 runnable_load_sum
, load_sum
= 0;
3249 gcfs_rq
->prop_runnable_sum
= 0;
3251 if (runnable_sum
>= 0) {
3253 * Add runnable; clip at LOAD_AVG_MAX. Reflects that until
3254 * the CPU is saturated running == runnable.
3256 runnable_sum
+= se
->avg
.load_sum
;
3257 runnable_sum
= min(runnable_sum
, (long)LOAD_AVG_MAX
);
3260 * Estimate the new unweighted runnable_sum of the gcfs_rq by
3261 * assuming all tasks are equally runnable.
3263 if (scale_load_down(gcfs_rq
->load
.weight
)) {
3264 load_sum
= div_s64(gcfs_rq
->avg
.load_sum
,
3265 scale_load_down(gcfs_rq
->load
.weight
));
3268 /* But make sure to not inflate se's runnable */
3269 runnable_sum
= min(se
->avg
.load_sum
, load_sum
);
3273 * runnable_sum can't be lower than running_sum
3274 * Rescale running sum to be in the same range as runnable sum
3275 * running_sum is in [0 : LOAD_AVG_MAX << SCHED_CAPACITY_SHIFT]
3276 * runnable_sum is in [0 : LOAD_AVG_MAX]
3278 running_sum
= se
->avg
.util_sum
>> SCHED_CAPACITY_SHIFT
;
3279 runnable_sum
= max(runnable_sum
, running_sum
);
3281 load_sum
= (s64
)se_weight(se
) * runnable_sum
;
3282 load_avg
= div_s64(load_sum
, LOAD_AVG_MAX
);
3284 delta_sum
= load_sum
- (s64
)se_weight(se
) * se
->avg
.load_sum
;
3285 delta_avg
= load_avg
- se
->avg
.load_avg
;
3287 se
->avg
.load_sum
= runnable_sum
;
3288 se
->avg
.load_avg
= load_avg
;
3289 add_positive(&cfs_rq
->avg
.load_avg
, delta_avg
);
3290 add_positive(&cfs_rq
->avg
.load_sum
, delta_sum
);
3292 runnable_load_sum
= (s64
)se_runnable(se
) * runnable_sum
;
3293 runnable_load_avg
= div_s64(runnable_load_sum
, LOAD_AVG_MAX
);
3294 delta_sum
= runnable_load_sum
- se_weight(se
) * se
->avg
.runnable_load_sum
;
3295 delta_avg
= runnable_load_avg
- se
->avg
.runnable_load_avg
;
3297 se
->avg
.runnable_load_sum
= runnable_sum
;
3298 se
->avg
.runnable_load_avg
= runnable_load_avg
;
3301 add_positive(&cfs_rq
->avg
.runnable_load_avg
, delta_avg
);
3302 add_positive(&cfs_rq
->avg
.runnable_load_sum
, delta_sum
);
3306 static inline void add_tg_cfs_propagate(struct cfs_rq
*cfs_rq
, long runnable_sum
)
3308 cfs_rq
->propagate
= 1;
3309 cfs_rq
->prop_runnable_sum
+= runnable_sum
;
3312 /* Update task and its cfs_rq load average */
3313 static inline int propagate_entity_load_avg(struct sched_entity
*se
)
3315 struct cfs_rq
*cfs_rq
, *gcfs_rq
;
3317 if (entity_is_task(se
))
3320 gcfs_rq
= group_cfs_rq(se
);
3321 if (!gcfs_rq
->propagate
)
3324 gcfs_rq
->propagate
= 0;
3326 cfs_rq
= cfs_rq_of(se
);
3328 add_tg_cfs_propagate(cfs_rq
, gcfs_rq
->prop_runnable_sum
);
3330 update_tg_cfs_util(cfs_rq
, se
, gcfs_rq
);
3331 update_tg_cfs_runnable(cfs_rq
, se
, gcfs_rq
);
3337 * Check if we need to update the load and the utilization of a blocked
3340 static inline bool skip_blocked_update(struct sched_entity
*se
)
3342 struct cfs_rq
*gcfs_rq
= group_cfs_rq(se
);
3345 * If sched_entity still have not zero load or utilization, we have to
3348 if (se
->avg
.load_avg
|| se
->avg
.util_avg
)
3352 * If there is a pending propagation, we have to update the load and
3353 * the utilization of the sched_entity:
3355 if (gcfs_rq
->propagate
)
3359 * Otherwise, the load and the utilization of the sched_entity is
3360 * already zero and there is no pending propagation, so it will be a
3361 * waste of time to try to decay it:
3366 #else /* CONFIG_FAIR_GROUP_SCHED */
3368 static inline void update_tg_load_avg(struct cfs_rq
*cfs_rq
, int force
) {}
3370 static inline int propagate_entity_load_avg(struct sched_entity
*se
)
3375 static inline void add_tg_cfs_propagate(struct cfs_rq
*cfs_rq
, long runnable_sum
) {}
3377 #endif /* CONFIG_FAIR_GROUP_SCHED */
3380 * update_cfs_rq_load_avg - update the cfs_rq's load/util averages
3381 * @now: current time, as per cfs_rq_clock_pelt()
3382 * @cfs_rq: cfs_rq to update
3384 * The cfs_rq avg is the direct sum of all its entities (blocked and runnable)
3385 * avg. The immediate corollary is that all (fair) tasks must be attached, see
3386 * post_init_entity_util_avg().
3388 * cfs_rq->avg is used for task_h_load() and update_cfs_share() for example.
3390 * Returns true if the load decayed or we removed load.
3392 * Since both these conditions indicate a changed cfs_rq->avg.load we should
3393 * call update_tg_load_avg() when this function returns true.
3396 update_cfs_rq_load_avg(u64 now
, struct cfs_rq
*cfs_rq
)
3398 unsigned long removed_load
= 0, removed_util
= 0, removed_runnable_sum
= 0;
3399 struct sched_avg
*sa
= &cfs_rq
->avg
;
3402 if (cfs_rq
->removed
.nr
) {
3404 u32 divider
= LOAD_AVG_MAX
- 1024 + sa
->period_contrib
;
3406 raw_spin_lock(&cfs_rq
->removed
.lock
);
3407 swap(cfs_rq
->removed
.util_avg
, removed_util
);
3408 swap(cfs_rq
->removed
.load_avg
, removed_load
);
3409 swap(cfs_rq
->removed
.runnable_sum
, removed_runnable_sum
);
3410 cfs_rq
->removed
.nr
= 0;
3411 raw_spin_unlock(&cfs_rq
->removed
.lock
);
3414 sub_positive(&sa
->load_avg
, r
);
3415 sub_positive(&sa
->load_sum
, r
* divider
);
3418 sub_positive(&sa
->util_avg
, r
);
3419 sub_positive(&sa
->util_sum
, r
* divider
);
3421 add_tg_cfs_propagate(cfs_rq
, -(long)removed_runnable_sum
);
3426 decayed
|= __update_load_avg_cfs_rq(now
, cfs_rq
);
3428 #ifndef CONFIG_64BIT
3430 cfs_rq
->load_last_update_time_copy
= sa
->last_update_time
;
3434 cfs_rq_util_change(cfs_rq
, 0);
3440 * attach_entity_load_avg - attach this entity to its cfs_rq load avg
3441 * @cfs_rq: cfs_rq to attach to
3442 * @se: sched_entity to attach
3443 * @flags: migration hints
3445 * Must call update_cfs_rq_load_avg() before this, since we rely on
3446 * cfs_rq->avg.last_update_time being current.
3448 static void attach_entity_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int flags
)
3450 u32 divider
= LOAD_AVG_MAX
- 1024 + cfs_rq
->avg
.period_contrib
;
3453 * When we attach the @se to the @cfs_rq, we must align the decay
3454 * window because without that, really weird and wonderful things can
3459 se
->avg
.last_update_time
= cfs_rq
->avg
.last_update_time
;
3460 se
->avg
.period_contrib
= cfs_rq
->avg
.period_contrib
;
3463 * Hell(o) Nasty stuff.. we need to recompute _sum based on the new
3464 * period_contrib. This isn't strictly correct, but since we're
3465 * entirely outside of the PELT hierarchy, nobody cares if we truncate
3468 se
->avg
.util_sum
= se
->avg
.util_avg
* divider
;
3470 se
->avg
.load_sum
= divider
;
3471 if (se_weight(se
)) {
3473 div_u64(se
->avg
.load_avg
* se
->avg
.load_sum
, se_weight(se
));
3476 se
->avg
.runnable_load_sum
= se
->avg
.load_sum
;
3478 enqueue_load_avg(cfs_rq
, se
);
3479 cfs_rq
->avg
.util_avg
+= se
->avg
.util_avg
;
3480 cfs_rq
->avg
.util_sum
+= se
->avg
.util_sum
;
3482 add_tg_cfs_propagate(cfs_rq
, se
->avg
.load_sum
);
3484 cfs_rq_util_change(cfs_rq
, flags
);
3488 * detach_entity_load_avg - detach this entity from its cfs_rq load avg
3489 * @cfs_rq: cfs_rq to detach from
3490 * @se: sched_entity to detach
3492 * Must call update_cfs_rq_load_avg() before this, since we rely on
3493 * cfs_rq->avg.last_update_time being current.
3495 static void detach_entity_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
3497 dequeue_load_avg(cfs_rq
, se
);
3498 sub_positive(&cfs_rq
->avg
.util_avg
, se
->avg
.util_avg
);
3499 sub_positive(&cfs_rq
->avg
.util_sum
, se
->avg
.util_sum
);
3501 add_tg_cfs_propagate(cfs_rq
, -se
->avg
.load_sum
);
3503 cfs_rq_util_change(cfs_rq
, 0);
3507 * Optional action to be done while updating the load average
3509 #define UPDATE_TG 0x1
3510 #define SKIP_AGE_LOAD 0x2
3511 #define DO_ATTACH 0x4
3513 /* Update task and its cfs_rq load average */
3514 static inline void update_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int flags
)
3516 u64 now
= cfs_rq_clock_pelt(cfs_rq
);
3520 * Track task load average for carrying it to new CPU after migrated, and
3521 * track group sched_entity load average for task_h_load calc in migration
3523 if (se
->avg
.last_update_time
&& !(flags
& SKIP_AGE_LOAD
))
3524 __update_load_avg_se(now
, cfs_rq
, se
);
3526 decayed
= update_cfs_rq_load_avg(now
, cfs_rq
);
3527 decayed
|= propagate_entity_load_avg(se
);
3529 if (!se
->avg
.last_update_time
&& (flags
& DO_ATTACH
)) {
3532 * DO_ATTACH means we're here from enqueue_entity().
3533 * !last_update_time means we've passed through
3534 * migrate_task_rq_fair() indicating we migrated.
3536 * IOW we're enqueueing a task on a new CPU.
3538 attach_entity_load_avg(cfs_rq
, se
, SCHED_CPUFREQ_MIGRATION
);
3539 update_tg_load_avg(cfs_rq
, 0);
3541 } else if (decayed
&& (flags
& UPDATE_TG
))
3542 update_tg_load_avg(cfs_rq
, 0);
3545 #ifndef CONFIG_64BIT
3546 static inline u64
cfs_rq_last_update_time(struct cfs_rq
*cfs_rq
)
3548 u64 last_update_time_copy
;
3549 u64 last_update_time
;
3552 last_update_time_copy
= cfs_rq
->load_last_update_time_copy
;
3554 last_update_time
= cfs_rq
->avg
.last_update_time
;
3555 } while (last_update_time
!= last_update_time_copy
);
3557 return last_update_time
;
3560 static inline u64
cfs_rq_last_update_time(struct cfs_rq
*cfs_rq
)
3562 return cfs_rq
->avg
.last_update_time
;
3567 * Synchronize entity load avg of dequeued entity without locking
3570 void sync_entity_load_avg(struct sched_entity
*se
)
3572 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
3573 u64 last_update_time
;
3575 last_update_time
= cfs_rq_last_update_time(cfs_rq
);
3576 __update_load_avg_blocked_se(last_update_time
, se
);
3580 * Task first catches up with cfs_rq, and then subtract
3581 * itself from the cfs_rq (task must be off the queue now).
3583 void remove_entity_load_avg(struct sched_entity
*se
)
3585 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
3586 unsigned long flags
;
3589 * tasks cannot exit without having gone through wake_up_new_task() ->
3590 * post_init_entity_util_avg() which will have added things to the
3591 * cfs_rq, so we can remove unconditionally.
3594 sync_entity_load_avg(se
);
3596 raw_spin_lock_irqsave(&cfs_rq
->removed
.lock
, flags
);
3597 ++cfs_rq
->removed
.nr
;
3598 cfs_rq
->removed
.util_avg
+= se
->avg
.util_avg
;
3599 cfs_rq
->removed
.load_avg
+= se
->avg
.load_avg
;
3600 cfs_rq
->removed
.runnable_sum
+= se
->avg
.load_sum
; /* == runnable_sum */
3601 raw_spin_unlock_irqrestore(&cfs_rq
->removed
.lock
, flags
);
3604 static inline unsigned long cfs_rq_runnable_load_avg(struct cfs_rq
*cfs_rq
)
3606 return cfs_rq
->avg
.runnable_load_avg
;
3609 static inline unsigned long cfs_rq_load_avg(struct cfs_rq
*cfs_rq
)
3611 return cfs_rq
->avg
.load_avg
;
3614 static int idle_balance(struct rq
*this_rq
, struct rq_flags
*rf
);
3616 static inline unsigned long task_util(struct task_struct
*p
)
3618 return READ_ONCE(p
->se
.avg
.util_avg
);
3621 static inline unsigned long _task_util_est(struct task_struct
*p
)
3623 struct util_est ue
= READ_ONCE(p
->se
.avg
.util_est
);
3625 return (max(ue
.ewma
, ue
.enqueued
) | UTIL_AVG_UNCHANGED
);
3628 static inline unsigned long task_util_est(struct task_struct
*p
)
3630 return max(task_util(p
), _task_util_est(p
));
3633 static inline void util_est_enqueue(struct cfs_rq
*cfs_rq
,
3634 struct task_struct
*p
)
3636 unsigned int enqueued
;
3638 if (!sched_feat(UTIL_EST
))
3641 /* Update root cfs_rq's estimated utilization */
3642 enqueued
= cfs_rq
->avg
.util_est
.enqueued
;
3643 enqueued
+= _task_util_est(p
);
3644 WRITE_ONCE(cfs_rq
->avg
.util_est
.enqueued
, enqueued
);
3648 * Check if a (signed) value is within a specified (unsigned) margin,
3649 * based on the observation that:
3651 * abs(x) < y := (unsigned)(x + y - 1) < (2 * y - 1)
3653 * NOTE: this only works when value + maring < INT_MAX.
3655 static inline bool within_margin(int value
, int margin
)
3657 return ((unsigned int)(value
+ margin
- 1) < (2 * margin
- 1));
3661 util_est_dequeue(struct cfs_rq
*cfs_rq
, struct task_struct
*p
, bool task_sleep
)
3663 long last_ewma_diff
;
3667 if (!sched_feat(UTIL_EST
))
3670 /* Update root cfs_rq's estimated utilization */
3671 ue
.enqueued
= cfs_rq
->avg
.util_est
.enqueued
;
3672 ue
.enqueued
-= min_t(unsigned int, ue
.enqueued
, _task_util_est(p
));
3673 WRITE_ONCE(cfs_rq
->avg
.util_est
.enqueued
, ue
.enqueued
);
3676 * Skip update of task's estimated utilization when the task has not
3677 * yet completed an activation, e.g. being migrated.
3683 * If the PELT values haven't changed since enqueue time,
3684 * skip the util_est update.
3686 ue
= p
->se
.avg
.util_est
;
3687 if (ue
.enqueued
& UTIL_AVG_UNCHANGED
)
3691 * Skip update of task's estimated utilization when its EWMA is
3692 * already ~1% close to its last activation value.
3694 ue
.enqueued
= (task_util(p
) | UTIL_AVG_UNCHANGED
);
3695 last_ewma_diff
= ue
.enqueued
- ue
.ewma
;
3696 if (within_margin(last_ewma_diff
, (SCHED_CAPACITY_SCALE
/ 100)))
3700 * To avoid overestimation of actual task utilization, skip updates if
3701 * we cannot grant there is idle time in this CPU.
3703 cpu
= cpu_of(rq_of(cfs_rq
));
3704 if (task_util(p
) > capacity_orig_of(cpu
))
3708 * Update Task's estimated utilization
3710 * When *p completes an activation we can consolidate another sample
3711 * of the task size. This is done by storing the current PELT value
3712 * as ue.enqueued and by using this value to update the Exponential
3713 * Weighted Moving Average (EWMA):
3715 * ewma(t) = w * task_util(p) + (1-w) * ewma(t-1)
3716 * = w * task_util(p) + ewma(t-1) - w * ewma(t-1)
3717 * = w * (task_util(p) - ewma(t-1)) + ewma(t-1)
3718 * = w * ( last_ewma_diff ) + ewma(t-1)
3719 * = w * (last_ewma_diff + ewma(t-1) / w)
3721 * Where 'w' is the weight of new samples, which is configured to be
3722 * 0.25, thus making w=1/4 ( >>= UTIL_EST_WEIGHT_SHIFT)
3724 ue
.ewma
<<= UTIL_EST_WEIGHT_SHIFT
;
3725 ue
.ewma
+= last_ewma_diff
;
3726 ue
.ewma
>>= UTIL_EST_WEIGHT_SHIFT
;
3727 WRITE_ONCE(p
->se
.avg
.util_est
, ue
);
3730 static inline int task_fits_capacity(struct task_struct
*p
, long capacity
)
3732 return capacity
* 1024 > task_util_est(p
) * capacity_margin
;
3735 static inline void update_misfit_status(struct task_struct
*p
, struct rq
*rq
)
3737 if (!static_branch_unlikely(&sched_asym_cpucapacity
))
3741 rq
->misfit_task_load
= 0;
3745 if (task_fits_capacity(p
, capacity_of(cpu_of(rq
)))) {
3746 rq
->misfit_task_load
= 0;
3750 rq
->misfit_task_load
= task_h_load(p
);
3753 #else /* CONFIG_SMP */
3755 #define UPDATE_TG 0x0
3756 #define SKIP_AGE_LOAD 0x0
3757 #define DO_ATTACH 0x0
3759 static inline void update_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int not_used1
)
3761 cfs_rq_util_change(cfs_rq
, 0);
3764 static inline void remove_entity_load_avg(struct sched_entity
*se
) {}
3767 attach_entity_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int flags
) {}
3769 detach_entity_load_avg(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
) {}
3771 static inline int idle_balance(struct rq
*rq
, struct rq_flags
*rf
)
3777 util_est_enqueue(struct cfs_rq
*cfs_rq
, struct task_struct
*p
) {}
3780 util_est_dequeue(struct cfs_rq
*cfs_rq
, struct task_struct
*p
,
3782 static inline void update_misfit_status(struct task_struct
*p
, struct rq
*rq
) {}
3784 #endif /* CONFIG_SMP */
3786 static void check_spread(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
3788 #ifdef CONFIG_SCHED_DEBUG
3789 s64 d
= se
->vruntime
- cfs_rq
->min_vruntime
;
3794 if (d
> 3*sysctl_sched_latency
)
3795 schedstat_inc(cfs_rq
->nr_spread_over
);
3800 place_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int initial
)
3802 u64 vruntime
= cfs_rq
->min_vruntime
;
3805 * The 'current' period is already promised to the current tasks,
3806 * however the extra weight of the new task will slow them down a
3807 * little, place the new task so that it fits in the slot that
3808 * stays open at the end.
3810 if (initial
&& sched_feat(START_DEBIT
))
3811 vruntime
+= sched_vslice(cfs_rq
, se
);
3813 /* sleeps up to a single latency don't count. */
3815 unsigned long thresh
= sysctl_sched_latency
;
3818 * Halve their sleep time's effect, to allow
3819 * for a gentler effect of sleepers:
3821 if (sched_feat(GENTLE_FAIR_SLEEPERS
))
3827 /* ensure we never gain time by being placed backwards. */
3828 se
->vruntime
= max_vruntime(se
->vruntime
, vruntime
);
3831 static void check_enqueue_throttle(struct cfs_rq
*cfs_rq
);
3833 static inline void check_schedstat_required(void)
3835 #ifdef CONFIG_SCHEDSTATS
3836 if (schedstat_enabled())
3839 /* Force schedstat enabled if a dependent tracepoint is active */
3840 if (trace_sched_stat_wait_enabled() ||
3841 trace_sched_stat_sleep_enabled() ||
3842 trace_sched_stat_iowait_enabled() ||
3843 trace_sched_stat_blocked_enabled() ||
3844 trace_sched_stat_runtime_enabled()) {
3845 printk_deferred_once("Scheduler tracepoints stat_sleep, stat_iowait, "
3846 "stat_blocked and stat_runtime require the "
3847 "kernel parameter schedstats=enable or "
3848 "kernel.sched_schedstats=1\n");
3859 * update_min_vruntime()
3860 * vruntime -= min_vruntime
3864 * update_min_vruntime()
3865 * vruntime += min_vruntime
3867 * this way the vruntime transition between RQs is done when both
3868 * min_vruntime are up-to-date.
3872 * ->migrate_task_rq_fair() (p->state == TASK_WAKING)
3873 * vruntime -= min_vruntime
3877 * update_min_vruntime()
3878 * vruntime += min_vruntime
3880 * this way we don't have the most up-to-date min_vruntime on the originating
3881 * CPU and an up-to-date min_vruntime on the destination CPU.
3885 enqueue_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int flags
)
3887 bool renorm
= !(flags
& ENQUEUE_WAKEUP
) || (flags
& ENQUEUE_MIGRATED
);
3888 bool curr
= cfs_rq
->curr
== se
;
3891 * If we're the current task, we must renormalise before calling
3895 se
->vruntime
+= cfs_rq
->min_vruntime
;
3897 update_curr(cfs_rq
);
3900 * Otherwise, renormalise after, such that we're placed at the current
3901 * moment in time, instead of some random moment in the past. Being
3902 * placed in the past could significantly boost this task to the
3903 * fairness detriment of existing tasks.
3905 if (renorm
&& !curr
)
3906 se
->vruntime
+= cfs_rq
->min_vruntime
;
3909 * When enqueuing a sched_entity, we must:
3910 * - Update loads to have both entity and cfs_rq synced with now.
3911 * - Add its load to cfs_rq->runnable_avg
3912 * - For group_entity, update its weight to reflect the new share of
3914 * - Add its new weight to cfs_rq->load.weight
3916 update_load_avg(cfs_rq
, se
, UPDATE_TG
| DO_ATTACH
);
3917 update_cfs_group(se
);
3918 enqueue_runnable_load_avg(cfs_rq
, se
);
3919 account_entity_enqueue(cfs_rq
, se
);
3921 if (flags
& ENQUEUE_WAKEUP
)
3922 place_entity(cfs_rq
, se
, 0);
3924 check_schedstat_required();
3925 update_stats_enqueue(cfs_rq
, se
, flags
);
3926 check_spread(cfs_rq
, se
);
3928 __enqueue_entity(cfs_rq
, se
);
3931 if (cfs_rq
->nr_running
== 1) {
3932 list_add_leaf_cfs_rq(cfs_rq
);
3933 check_enqueue_throttle(cfs_rq
);
3937 static void __clear_buddies_last(struct sched_entity
*se
)
3939 for_each_sched_entity(se
) {
3940 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
3941 if (cfs_rq
->last
!= se
)
3944 cfs_rq
->last
= NULL
;
3948 static void __clear_buddies_next(struct sched_entity
*se
)
3950 for_each_sched_entity(se
) {
3951 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
3952 if (cfs_rq
->next
!= se
)
3955 cfs_rq
->next
= NULL
;
3959 static void __clear_buddies_skip(struct sched_entity
*se
)
3961 for_each_sched_entity(se
) {
3962 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
3963 if (cfs_rq
->skip
!= se
)
3966 cfs_rq
->skip
= NULL
;
3970 static void clear_buddies(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
3972 if (cfs_rq
->last
== se
)
3973 __clear_buddies_last(se
);
3975 if (cfs_rq
->next
== se
)
3976 __clear_buddies_next(se
);
3978 if (cfs_rq
->skip
== se
)
3979 __clear_buddies_skip(se
);
3982 static __always_inline
void return_cfs_rq_runtime(struct cfs_rq
*cfs_rq
);
3985 dequeue_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
, int flags
)
3988 * Update run-time statistics of the 'current'.
3990 update_curr(cfs_rq
);
3993 * When dequeuing a sched_entity, we must:
3994 * - Update loads to have both entity and cfs_rq synced with now.
3995 * - Subtract its load from the cfs_rq->runnable_avg.
3996 * - Subtract its previous weight from cfs_rq->load.weight.
3997 * - For group entity, update its weight to reflect the new share
3998 * of its group cfs_rq.
4000 update_load_avg(cfs_rq
, se
, UPDATE_TG
);
4001 dequeue_runnable_load_avg(cfs_rq
, se
);
4003 update_stats_dequeue(cfs_rq
, se
, flags
);
4005 clear_buddies(cfs_rq
, se
);
4007 if (se
!= cfs_rq
->curr
)
4008 __dequeue_entity(cfs_rq
, se
);
4010 account_entity_dequeue(cfs_rq
, se
);
4013 * Normalize after update_curr(); which will also have moved
4014 * min_vruntime if @se is the one holding it back. But before doing
4015 * update_min_vruntime() again, which will discount @se's position and
4016 * can move min_vruntime forward still more.
4018 if (!(flags
& DEQUEUE_SLEEP
))
4019 se
->vruntime
-= cfs_rq
->min_vruntime
;
4021 /* return excess runtime on last dequeue */
4022 return_cfs_rq_runtime(cfs_rq
);
4024 update_cfs_group(se
);
4027 * Now advance min_vruntime if @se was the entity holding it back,
4028 * except when: DEQUEUE_SAVE && !DEQUEUE_MOVE, in this case we'll be
4029 * put back on, and if we advance min_vruntime, we'll be placed back
4030 * further than we started -- ie. we'll be penalized.
4032 if ((flags
& (DEQUEUE_SAVE
| DEQUEUE_MOVE
)) != DEQUEUE_SAVE
)
4033 update_min_vruntime(cfs_rq
);
4037 * Preempt the current task with a newly woken task if needed:
4040 check_preempt_tick(struct cfs_rq
*cfs_rq
, struct sched_entity
*curr
)
4042 unsigned long ideal_runtime
, delta_exec
;
4043 struct sched_entity
*se
;
4046 ideal_runtime
= sched_slice(cfs_rq
, curr
);
4047 delta_exec
= curr
->sum_exec_runtime
- curr
->prev_sum_exec_runtime
;
4048 if (delta_exec
> ideal_runtime
) {
4049 resched_curr(rq_of(cfs_rq
));
4051 * The current task ran long enough, ensure it doesn't get
4052 * re-elected due to buddy favours.
4054 clear_buddies(cfs_rq
, curr
);
4059 * Ensure that a task that missed wakeup preemption by a
4060 * narrow margin doesn't have to wait for a full slice.
4061 * This also mitigates buddy induced latencies under load.
4063 if (delta_exec
< sysctl_sched_min_granularity
)
4066 se
= __pick_first_entity(cfs_rq
);
4067 delta
= curr
->vruntime
- se
->vruntime
;
4072 if (delta
> ideal_runtime
)
4073 resched_curr(rq_of(cfs_rq
));
4077 set_next_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*se
)
4079 /* 'current' is not kept within the tree. */
4082 * Any task has to be enqueued before it get to execute on
4083 * a CPU. So account for the time it spent waiting on the
4086 update_stats_wait_end(cfs_rq
, se
);
4087 __dequeue_entity(cfs_rq
, se
);
4088 update_load_avg(cfs_rq
, se
, UPDATE_TG
);
4091 update_stats_curr_start(cfs_rq
, se
);
4095 * Track our maximum slice length, if the CPU's load is at
4096 * least twice that of our own weight (i.e. dont track it
4097 * when there are only lesser-weight tasks around):
4099 if (schedstat_enabled() && rq_of(cfs_rq
)->load
.weight
>= 2*se
->load
.weight
) {
4100 schedstat_set(se
->statistics
.slice_max
,
4101 max((u64
)schedstat_val(se
->statistics
.slice_max
),
4102 se
->sum_exec_runtime
- se
->prev_sum_exec_runtime
));
4105 se
->prev_sum_exec_runtime
= se
->sum_exec_runtime
;
4109 wakeup_preempt_entity(struct sched_entity
*curr
, struct sched_entity
*se
);
4112 * Pick the next process, keeping these things in mind, in this order:
4113 * 1) keep things fair between processes/task groups
4114 * 2) pick the "next" process, since someone really wants that to run
4115 * 3) pick the "last" process, for cache locality
4116 * 4) do not run the "skip" process, if something else is available
4118 static struct sched_entity
*
4119 pick_next_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*curr
)
4121 struct sched_entity
*left
= __pick_first_entity(cfs_rq
);
4122 struct sched_entity
*se
;
4125 * If curr is set we have to see if its left of the leftmost entity
4126 * still in the tree, provided there was anything in the tree at all.
4128 if (!left
|| (curr
&& entity_before(curr
, left
)))
4131 se
= left
; /* ideally we run the leftmost entity */
4134 * Avoid running the skip buddy, if running something else can
4135 * be done without getting too unfair.
4137 if (cfs_rq
->skip
== se
) {
4138 struct sched_entity
*second
;
4141 second
= __pick_first_entity(cfs_rq
);
4143 second
= __pick_next_entity(se
);
4144 if (!second
|| (curr
&& entity_before(curr
, second
)))
4148 if (second
&& wakeup_preempt_entity(second
, left
) < 1)
4153 * Prefer last buddy, try to return the CPU to a preempted task.
4155 if (cfs_rq
->last
&& wakeup_preempt_entity(cfs_rq
->last
, left
) < 1)
4159 * Someone really wants this to run. If it's not unfair, run it.
4161 if (cfs_rq
->next
&& wakeup_preempt_entity(cfs_rq
->next
, left
) < 1)
4164 clear_buddies(cfs_rq
, se
);
4169 static bool check_cfs_rq_runtime(struct cfs_rq
*cfs_rq
);
4171 static void put_prev_entity(struct cfs_rq
*cfs_rq
, struct sched_entity
*prev
)
4174 * If still on the runqueue then deactivate_task()
4175 * was not called and update_curr() has to be done:
4178 update_curr(cfs_rq
);
4180 /* throttle cfs_rqs exceeding runtime */
4181 check_cfs_rq_runtime(cfs_rq
);
4183 check_spread(cfs_rq
, prev
);
4186 update_stats_wait_start(cfs_rq
, prev
);
4187 /* Put 'current' back into the tree. */
4188 __enqueue_entity(cfs_rq
, prev
);
4189 /* in !on_rq case, update occurred at dequeue */
4190 update_load_avg(cfs_rq
, prev
, 0);
4192 cfs_rq
->curr
= NULL
;
4196 entity_tick(struct cfs_rq
*cfs_rq
, struct sched_entity
*curr
, int queued
)
4199 * Update run-time statistics of the 'current'.
4201 update_curr(cfs_rq
);
4204 * Ensure that runnable average is periodically updated.
4206 update_load_avg(cfs_rq
, curr
, UPDATE_TG
);
4207 update_cfs_group(curr
);
4209 #ifdef CONFIG_SCHED_HRTICK
4211 * queued ticks are scheduled to match the slice, so don't bother
4212 * validating it and just reschedule.
4215 resched_curr(rq_of(cfs_rq
));
4219 * don't let the period tick interfere with the hrtick preemption
4221 if (!sched_feat(DOUBLE_TICK
) &&
4222 hrtimer_active(&rq_of(cfs_rq
)->hrtick_timer
))
4226 if (cfs_rq
->nr_running
> 1)
4227 check_preempt_tick(cfs_rq
, curr
);
4231 /**************************************************
4232 * CFS bandwidth control machinery
4235 #ifdef CONFIG_CFS_BANDWIDTH
4237 #ifdef CONFIG_JUMP_LABEL
4238 static struct static_key __cfs_bandwidth_used
;
4240 static inline bool cfs_bandwidth_used(void)
4242 return static_key_false(&__cfs_bandwidth_used
);
4245 void cfs_bandwidth_usage_inc(void)
4247 static_key_slow_inc_cpuslocked(&__cfs_bandwidth_used
);
4250 void cfs_bandwidth_usage_dec(void)
4252 static_key_slow_dec_cpuslocked(&__cfs_bandwidth_used
);
4254 #else /* CONFIG_JUMP_LABEL */
4255 static bool cfs_bandwidth_used(void)
4260 void cfs_bandwidth_usage_inc(void) {}
4261 void cfs_bandwidth_usage_dec(void) {}
4262 #endif /* CONFIG_JUMP_LABEL */
4265 * default period for cfs group bandwidth.
4266 * default: 0.1s, units: nanoseconds
4268 static inline u64
default_cfs_period(void)
4270 return 100000000ULL;
4273 static inline u64
sched_cfs_bandwidth_slice(void)
4275 return (u64
)sysctl_sched_cfs_bandwidth_slice
* NSEC_PER_USEC
;
4279 * Replenish runtime according to assigned quota and update expiration time.
4280 * We use sched_clock_cpu directly instead of rq->clock to avoid adding
4281 * additional synchronization around rq->lock.
4283 * requires cfs_b->lock
4285 void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth
*cfs_b
)
4289 if (cfs_b
->quota
== RUNTIME_INF
)
4292 now
= sched_clock_cpu(smp_processor_id());
4293 cfs_b
->runtime
= cfs_b
->quota
;
4294 cfs_b
->runtime_expires
= now
+ ktime_to_ns(cfs_b
->period
);
4295 cfs_b
->expires_seq
++;
4298 static inline struct cfs_bandwidth
*tg_cfs_bandwidth(struct task_group
*tg
)
4300 return &tg
->cfs_bandwidth
;
4303 /* rq->task_clock normalized against any time this cfs_rq has spent throttled */
4304 static inline u64
cfs_rq_clock_task(struct cfs_rq
*cfs_rq
)
4306 if (unlikely(cfs_rq
->throttle_count
))
4307 return cfs_rq
->throttled_clock_task
- cfs_rq
->throttled_clock_task_time
;
4309 return rq_clock_task(rq_of(cfs_rq
)) - cfs_rq
->throttled_clock_task_time
;
4312 /* returns 0 on failure to allocate runtime */
4313 static int assign_cfs_rq_runtime(struct cfs_rq
*cfs_rq
)
4315 struct task_group
*tg
= cfs_rq
->tg
;
4316 struct cfs_bandwidth
*cfs_b
= tg_cfs_bandwidth(tg
);
4317 u64 amount
= 0, min_amount
, expires
;
4320 /* note: this is a positive sum as runtime_remaining <= 0 */
4321 min_amount
= sched_cfs_bandwidth_slice() - cfs_rq
->runtime_remaining
;
4323 raw_spin_lock(&cfs_b
->lock
);
4324 if (cfs_b
->quota
== RUNTIME_INF
)
4325 amount
= min_amount
;
4327 start_cfs_bandwidth(cfs_b
);
4329 if (cfs_b
->runtime
> 0) {
4330 amount
= min(cfs_b
->runtime
, min_amount
);
4331 cfs_b
->runtime
-= amount
;
4335 expires_seq
= cfs_b
->expires_seq
;
4336 expires
= cfs_b
->runtime_expires
;
4337 raw_spin_unlock(&cfs_b
->lock
);
4339 cfs_rq
->runtime_remaining
+= amount
;
4341 * we may have advanced our local expiration to account for allowed
4342 * spread between our sched_clock and the one on which runtime was
4345 if (cfs_rq
->expires_seq
!= expires_seq
) {
4346 cfs_rq
->expires_seq
= expires_seq
;
4347 cfs_rq
->runtime_expires
= expires
;
4350 return cfs_rq
->runtime_remaining
> 0;
4354 * Note: This depends on the synchronization provided by sched_clock and the
4355 * fact that rq->clock snapshots this value.
4357 static void expire_cfs_rq_runtime(struct cfs_rq
*cfs_rq
)
4359 struct cfs_bandwidth
*cfs_b
= tg_cfs_bandwidth(cfs_rq
->tg
);
4361 /* if the deadline is ahead of our clock, nothing to do */
4362 if (likely((s64
)(rq_clock(rq_of(cfs_rq
)) - cfs_rq
->runtime_expires
) < 0))
4365 if (cfs_rq
->runtime_remaining
< 0)
4369 * If the local deadline has passed we have to consider the
4370 * possibility that our sched_clock is 'fast' and the global deadline
4371 * has not truly expired.
4373 * Fortunately we can check determine whether this the case by checking
4374 * whether the global deadline(cfs_b->expires_seq) has advanced.
4376 if (cfs_rq
->expires_seq
== cfs_b
->expires_seq
) {
4377 /* extend local deadline, drift is bounded above by 2 ticks */
4378 cfs_rq
->runtime_expires
+= TICK_NSEC
;
4380 /* global deadline is ahead, expiration has passed */
4381 cfs_rq
->runtime_remaining
= 0;
4385 static void __account_cfs_rq_runtime(struct cfs_rq
*cfs_rq
, u64 delta_exec
)
4387 /* dock delta_exec before expiring quota (as it could span periods) */
4388 cfs_rq
->runtime_remaining
-= delta_exec
;
4389 expire_cfs_rq_runtime(cfs_rq
);
4391 if (likely(cfs_rq
->runtime_remaining
> 0))
4395 * if we're unable to extend our runtime we resched so that the active
4396 * hierarchy can be throttled
4398 if (!assign_cfs_rq_runtime(cfs_rq
) && likely(cfs_rq
->curr
))
4399 resched_curr(rq_of(cfs_rq
));
4402 static __always_inline
4403 void account_cfs_rq_runtime(struct cfs_rq
*cfs_rq
, u64 delta_exec
)
4405 if (!cfs_bandwidth_used() || !cfs_rq
->runtime_enabled
)
4408 __account_cfs_rq_runtime(cfs_rq
, delta_exec
);
4411 static inline int cfs_rq_throttled(struct cfs_rq
*cfs_rq
)
4413 return cfs_bandwidth_used() && cfs_rq
->throttled
;
4416 /* check whether cfs_rq, or any parent, is throttled */
4417 static inline int throttled_hierarchy(struct cfs_rq
*cfs_rq
)
4419 return cfs_bandwidth_used() && cfs_rq
->throttle_count
;
4423 * Ensure that neither of the group entities corresponding to src_cpu or
4424 * dest_cpu are members of a throttled hierarchy when performing group
4425 * load-balance operations.
4427 static inline int throttled_lb_pair(struct task_group
*tg
,
4428 int src_cpu
, int dest_cpu
)
4430 struct cfs_rq
*src_cfs_rq
, *dest_cfs_rq
;
4432 src_cfs_rq
= tg
->cfs_rq
[src_cpu
];
4433 dest_cfs_rq
= tg
->cfs_rq
[dest_cpu
];
4435 return throttled_hierarchy(src_cfs_rq
) ||
4436 throttled_hierarchy(dest_cfs_rq
);
4439 static int tg_unthrottle_up(struct task_group
*tg
, void *data
)
4441 struct rq
*rq
= data
;
4442 struct cfs_rq
*cfs_rq
= tg
->cfs_rq
[cpu_of(rq
)];
4444 cfs_rq
->throttle_count
--;
4445 if (!cfs_rq
->throttle_count
) {
4446 /* adjust cfs_rq_clock_task() */
4447 cfs_rq
->throttled_clock_task_time
+= rq_clock_task(rq
) -
4448 cfs_rq
->throttled_clock_task
;
4450 /* Add cfs_rq with already running entity in the list */
4451 if (cfs_rq
->nr_running
>= 1)
4452 list_add_leaf_cfs_rq(cfs_rq
);
4458 static int tg_throttle_down(struct task_group
*tg
, void *data
)
4460 struct rq
*rq
= data
;
4461 struct cfs_rq
*cfs_rq
= tg
->cfs_rq
[cpu_of(rq
)];
4463 /* group is entering throttled state, stop time */
4464 if (!cfs_rq
->throttle_count
) {
4465 cfs_rq
->throttled_clock_task
= rq_clock_task(rq
);
4466 list_del_leaf_cfs_rq(cfs_rq
);
4468 cfs_rq
->throttle_count
++;
4473 static void throttle_cfs_rq(struct cfs_rq
*cfs_rq
)
4475 struct rq
*rq
= rq_of(cfs_rq
);
4476 struct cfs_bandwidth
*cfs_b
= tg_cfs_bandwidth(cfs_rq
->tg
);
4477 struct sched_entity
*se
;
4478 long task_delta
, dequeue
= 1;
4481 se
= cfs_rq
->tg
->se
[cpu_of(rq_of(cfs_rq
))];
4483 /* freeze hierarchy runnable averages while throttled */
4485 walk_tg_tree_from(cfs_rq
->tg
, tg_throttle_down
, tg_nop
, (void *)rq
);
4488 task_delta
= cfs_rq
->h_nr_running
;
4489 for_each_sched_entity(se
) {
4490 struct cfs_rq
*qcfs_rq
= cfs_rq_of(se
);
4491 /* throttled entity or throttle-on-deactivate */
4496 dequeue_entity(qcfs_rq
, se
, DEQUEUE_SLEEP
);
4497 qcfs_rq
->h_nr_running
-= task_delta
;
4499 if (qcfs_rq
->load
.weight
)
4504 sub_nr_running(rq
, task_delta
);
4506 cfs_rq
->throttled
= 1;
4507 cfs_rq
->throttled_clock
= rq_clock(rq
);
4508 raw_spin_lock(&cfs_b
->lock
);
4509 empty
= list_empty(&cfs_b
->throttled_cfs_rq
);
4512 * Add to the _head_ of the list, so that an already-started
4513 * distribute_cfs_runtime will not see us. If disribute_cfs_runtime is
4514 * not running add to the tail so that later runqueues don't get starved.
4516 if (cfs_b
->distribute_running
)
4517 list_add_rcu(&cfs_rq
->throttled_list
, &cfs_b
->throttled_cfs_rq
);
4519 list_add_tail_rcu(&cfs_rq
->throttled_list
, &cfs_b
->throttled_cfs_rq
);
4522 * If we're the first throttled task, make sure the bandwidth
4526 start_cfs_bandwidth(cfs_b
);
4528 raw_spin_unlock(&cfs_b
->lock
);
4531 void unthrottle_cfs_rq(struct cfs_rq
*cfs_rq
)
4533 struct rq
*rq
= rq_of(cfs_rq
);
4534 struct cfs_bandwidth
*cfs_b
= tg_cfs_bandwidth(cfs_rq
->tg
);
4535 struct sched_entity
*se
;
4539 se
= cfs_rq
->tg
->se
[cpu_of(rq
)];
4541 cfs_rq
->throttled
= 0;
4543 update_rq_clock(rq
);
4545 raw_spin_lock(&cfs_b
->lock
);
4546 cfs_b
->throttled_time
+= rq_clock(rq
) - cfs_rq
->throttled_clock
;
4547 list_del_rcu(&cfs_rq
->throttled_list
);
4548 raw_spin_unlock(&cfs_b
->lock
);
4550 /* update hierarchical throttle state */
4551 walk_tg_tree_from(cfs_rq
->tg
, tg_nop
, tg_unthrottle_up
, (void *)rq
);
4553 if (!cfs_rq
->load
.weight
)
4556 task_delta
= cfs_rq
->h_nr_running
;
4557 for_each_sched_entity(se
) {
4561 cfs_rq
= cfs_rq_of(se
);
4563 enqueue_entity(cfs_rq
, se
, ENQUEUE_WAKEUP
);
4564 cfs_rq
->h_nr_running
+= task_delta
;
4566 if (cfs_rq_throttled(cfs_rq
))
4570 assert_list_leaf_cfs_rq(rq
);
4573 add_nr_running(rq
, task_delta
);
4575 /* Determine whether we need to wake up potentially idle CPU: */
4576 if (rq
->curr
== rq
->idle
&& rq
->cfs
.nr_running
)
4580 static u64
distribute_cfs_runtime(struct cfs_bandwidth
*cfs_b
,
4581 u64 remaining
, u64 expires
)
4583 struct cfs_rq
*cfs_rq
;
4585 u64 starting_runtime
= remaining
;
4588 list_for_each_entry_rcu(cfs_rq
, &cfs_b
->throttled_cfs_rq
,
4590 struct rq
*rq
= rq_of(cfs_rq
);
4593 rq_lock_irqsave(rq
, &rf
);
4594 if (!cfs_rq_throttled(cfs_rq
))
4597 runtime
= -cfs_rq
->runtime_remaining
+ 1;
4598 if (runtime
> remaining
)
4599 runtime
= remaining
;
4600 remaining
-= runtime
;
4602 cfs_rq
->runtime_remaining
+= runtime
;
4603 cfs_rq
->runtime_expires
= expires
;
4605 /* we check whether we're throttled above */
4606 if (cfs_rq
->runtime_remaining
> 0)
4607 unthrottle_cfs_rq(cfs_rq
);
4610 rq_unlock_irqrestore(rq
, &rf
);
4617 return starting_runtime
- remaining
;
4621 * Responsible for refilling a task_group's bandwidth and unthrottling its
4622 * cfs_rqs as appropriate. If there has been no activity within the last
4623 * period the timer is deactivated until scheduling resumes; cfs_b->idle is
4624 * used to track this state.
4626 static int do_sched_cfs_period_timer(struct cfs_bandwidth
*cfs_b
, int overrun
, unsigned long flags
)
4628 u64 runtime
, runtime_expires
;
4631 /* no need to continue the timer with no bandwidth constraint */
4632 if (cfs_b
->quota
== RUNTIME_INF
)
4633 goto out_deactivate
;
4635 throttled
= !list_empty(&cfs_b
->throttled_cfs_rq
);
4636 cfs_b
->nr_periods
+= overrun
;
4639 * idle depends on !throttled (for the case of a large deficit), and if
4640 * we're going inactive then everything else can be deferred
4642 if (cfs_b
->idle
&& !throttled
)
4643 goto out_deactivate
;
4645 __refill_cfs_bandwidth_runtime(cfs_b
);
4648 /* mark as potentially idle for the upcoming period */
4653 /* account preceding periods in which throttling occurred */
4654 cfs_b
->nr_throttled
+= overrun
;
4656 runtime_expires
= cfs_b
->runtime_expires
;
4659 * This check is repeated as we are holding onto the new bandwidth while
4660 * we unthrottle. This can potentially race with an unthrottled group
4661 * trying to acquire new bandwidth from the global pool. This can result
4662 * in us over-using our runtime if it is all used during this loop, but
4663 * only by limited amounts in that extreme case.
4665 while (throttled
&& cfs_b
->runtime
> 0 && !cfs_b
->distribute_running
) {
4666 runtime
= cfs_b
->runtime
;
4667 cfs_b
->distribute_running
= 1;
4668 raw_spin_unlock_irqrestore(&cfs_b
->lock
, flags
);
4669 /* we can't nest cfs_b->lock while distributing bandwidth */
4670 runtime
= distribute_cfs_runtime(cfs_b
, runtime
,
4672 raw_spin_lock_irqsave(&cfs_b
->lock
, flags
);
4674 cfs_b
->distribute_running
= 0;
4675 throttled
= !list_empty(&cfs_b
->throttled_cfs_rq
);
4677 lsub_positive(&cfs_b
->runtime
, runtime
);
4681 * While we are ensured activity in the period following an
4682 * unthrottle, this also covers the case in which the new bandwidth is
4683 * insufficient to cover the existing bandwidth deficit. (Forcing the
4684 * timer to remain active while there are any throttled entities.)
4694 /* a cfs_rq won't donate quota below this amount */
4695 static const u64 min_cfs_rq_runtime
= 1 * NSEC_PER_MSEC
;
4696 /* minimum remaining period time to redistribute slack quota */
4697 static const u64 min_bandwidth_expiration
= 2 * NSEC_PER_MSEC
;
4698 /* how long we wait to gather additional slack before distributing */
4699 static const u64 cfs_bandwidth_slack_period
= 5 * NSEC_PER_MSEC
;
4702 * Are we near the end of the current quota period?
4704 * Requires cfs_b->lock for hrtimer_expires_remaining to be safe against the
4705 * hrtimer base being cleared by hrtimer_start. In the case of
4706 * migrate_hrtimers, base is never cleared, so we are fine.
4708 static int runtime_refresh_within(struct cfs_bandwidth
*cfs_b
, u64 min_expire
)
4710 struct hrtimer
*refresh_timer
= &cfs_b
->period_timer
;
4713 /* if the call-back is running a quota refresh is already occurring */
4714 if (hrtimer_callback_running(refresh_timer
))
4717 /* is a quota refresh about to occur? */
4718 remaining
= ktime_to_ns(hrtimer_expires_remaining(refresh_timer
));
4719 if (remaining
< min_expire
)
4725 static void start_cfs_slack_bandwidth(struct cfs_bandwidth
*cfs_b
)
4727 u64 min_left
= cfs_bandwidth_slack_period
+ min_bandwidth_expiration
;
4729 /* if there's a quota refresh soon don't bother with slack */
4730 if (runtime_refresh_within(cfs_b
, min_left
))
4733 hrtimer_start(&cfs_b
->slack_timer
,
4734 ns_to_ktime(cfs_bandwidth_slack_period
),
4738 /* we know any runtime found here is valid as update_curr() precedes return */
4739 static void __return_cfs_rq_runtime(struct cfs_rq
*cfs_rq
)
4741 struct cfs_bandwidth
*cfs_b
= tg_cfs_bandwidth(cfs_rq
->tg
);
4742 s64 slack_runtime
= cfs_rq
->runtime_remaining
- min_cfs_rq_runtime
;
4744 if (slack_runtime
<= 0)
4747 raw_spin_lock(&cfs_b
->lock
);
4748 if (cfs_b
->quota
!= RUNTIME_INF
&&
4749 cfs_rq
->runtime_expires
== cfs_b
->runtime_expires
) {
4750 cfs_b
->runtime
+= slack_runtime
;
4752 /* we are under rq->lock, defer unthrottling using a timer */
4753 if (cfs_b
->runtime
> sched_cfs_bandwidth_slice() &&
4754 !list_empty(&cfs_b
->throttled_cfs_rq
))
4755 start_cfs_slack_bandwidth(cfs_b
);
4757 raw_spin_unlock(&cfs_b
->lock
);
4759 /* even if it's not valid for return we don't want to try again */
4760 cfs_rq
->runtime_remaining
-= slack_runtime
;
4763 static __always_inline
void return_cfs_rq_runtime(struct cfs_rq
*cfs_rq
)
4765 if (!cfs_bandwidth_used())
4768 if (!cfs_rq
->runtime_enabled
|| cfs_rq
->nr_running
)
4771 __return_cfs_rq_runtime(cfs_rq
);
4775 * This is done with a timer (instead of inline with bandwidth return) since
4776 * it's necessary to juggle rq->locks to unthrottle their respective cfs_rqs.
4778 static void do_sched_cfs_slack_timer(struct cfs_bandwidth
*cfs_b
)
4780 u64 runtime
= 0, slice
= sched_cfs_bandwidth_slice();
4781 unsigned long flags
;
4784 /* confirm we're still not at a refresh boundary */
4785 raw_spin_lock_irqsave(&cfs_b
->lock
, flags
);
4786 if (cfs_b
->distribute_running
) {
4787 raw_spin_unlock_irqrestore(&cfs_b
->lock
, flags
);
4791 if (runtime_refresh_within(cfs_b
, min_bandwidth_expiration
)) {
4792 raw_spin_unlock_irqrestore(&cfs_b
->lock
, flags
);
4796 if (cfs_b
->quota
!= RUNTIME_INF
&& cfs_b
->runtime
> slice
)
4797 runtime
= cfs_b
->runtime
;
4799 expires
= cfs_b
->runtime_expires
;
4801 cfs_b
->distribute_running
= 1;
4803 raw_spin_unlock_irqrestore(&cfs_b
->lock
, flags
);
4808 runtime
= distribute_cfs_runtime(cfs_b
, runtime
, expires
);
4810 raw_spin_lock_irqsave(&cfs_b
->lock
, flags
);
4811 if (expires
== cfs_b
->runtime_expires
)
4812 lsub_positive(&cfs_b
->runtime
, runtime
);
4813 cfs_b
->distribute_running
= 0;
4814 raw_spin_unlock_irqrestore(&cfs_b
->lock
, flags
);
4818 * When a group wakes up we want to make sure that its quota is not already
4819 * expired/exceeded, otherwise it may be allowed to steal additional ticks of
4820 * runtime as update_curr() throttling can not not trigger until it's on-rq.
4822 static void check_enqueue_throttle(struct cfs_rq
*cfs_rq
)
4824 if (!cfs_bandwidth_used())
4827 /* an active group must be handled by the update_curr()->put() path */
4828 if (!cfs_rq
->runtime_enabled
|| cfs_rq
->curr
)
4831 /* ensure the group is not already throttled */
4832 if (cfs_rq_throttled(cfs_rq
))
4835 /* update runtime allocation */
4836 account_cfs_rq_runtime(cfs_rq
, 0);
4837 if (cfs_rq
->runtime_remaining
<= 0)
4838 throttle_cfs_rq(cfs_rq
);
4841 static void sync_throttle(struct task_group
*tg
, int cpu
)
4843 struct cfs_rq
*pcfs_rq
, *cfs_rq
;
4845 if (!cfs_bandwidth_used())
4851 cfs_rq
= tg
->cfs_rq
[cpu
];
4852 pcfs_rq
= tg
->parent
->cfs_rq
[cpu
];
4854 cfs_rq
->throttle_count
= pcfs_rq
->throttle_count
;
4855 cfs_rq
->throttled_clock_task
= rq_clock_task(cpu_rq(cpu
));
4858 /* conditionally throttle active cfs_rq's from put_prev_entity() */
4859 static bool check_cfs_rq_runtime(struct cfs_rq
*cfs_rq
)
4861 if (!cfs_bandwidth_used())
4864 if (likely(!cfs_rq
->runtime_enabled
|| cfs_rq
->runtime_remaining
> 0))
4868 * it's possible for a throttled entity to be forced into a running
4869 * state (e.g. set_curr_task), in this case we're finished.
4871 if (cfs_rq_throttled(cfs_rq
))
4874 throttle_cfs_rq(cfs_rq
);
4878 static enum hrtimer_restart
sched_cfs_slack_timer(struct hrtimer
*timer
)
4880 struct cfs_bandwidth
*cfs_b
=
4881 container_of(timer
, struct cfs_bandwidth
, slack_timer
);
4883 do_sched_cfs_slack_timer(cfs_b
);
4885 return HRTIMER_NORESTART
;
4888 static enum hrtimer_restart
sched_cfs_period_timer(struct hrtimer
*timer
)
4890 struct cfs_bandwidth
*cfs_b
=
4891 container_of(timer
, struct cfs_bandwidth
, period_timer
);
4892 unsigned long flags
;
4896 raw_spin_lock_irqsave(&cfs_b
->lock
, flags
);
4898 overrun
= hrtimer_forward_now(timer
, cfs_b
->period
);
4902 idle
= do_sched_cfs_period_timer(cfs_b
, overrun
, flags
);
4905 cfs_b
->period_active
= 0;
4906 raw_spin_unlock_irqrestore(&cfs_b
->lock
, flags
);
4908 return idle
? HRTIMER_NORESTART
: HRTIMER_RESTART
;
4911 void init_cfs_bandwidth(struct cfs_bandwidth
*cfs_b
)
4913 raw_spin_lock_init(&cfs_b
->lock
);
4915 cfs_b
->quota
= RUNTIME_INF
;
4916 cfs_b
->period
= ns_to_ktime(default_cfs_period());
4918 INIT_LIST_HEAD(&cfs_b
->throttled_cfs_rq
);
4919 hrtimer_init(&cfs_b
->period_timer
, CLOCK_MONOTONIC
, HRTIMER_MODE_ABS_PINNED
);
4920 cfs_b
->period_timer
.function
= sched_cfs_period_timer
;
4921 hrtimer_init(&cfs_b
->slack_timer
, CLOCK_MONOTONIC
, HRTIMER_MODE_REL
);
4922 cfs_b
->slack_timer
.function
= sched_cfs_slack_timer
;
4923 cfs_b
->distribute_running
= 0;
4926 static void init_cfs_rq_runtime(struct cfs_rq
*cfs_rq
)
4928 cfs_rq
->runtime_enabled
= 0;
4929 INIT_LIST_HEAD(&cfs_rq
->throttled_list
);
4932 void start_cfs_bandwidth(struct cfs_bandwidth
*cfs_b
)
4936 lockdep_assert_held(&cfs_b
->lock
);
4938 if (cfs_b
->period_active
)
4941 cfs_b
->period_active
= 1;
4942 overrun
= hrtimer_forward_now(&cfs_b
->period_timer
, cfs_b
->period
);
4943 cfs_b
->runtime_expires
+= (overrun
+ 1) * ktime_to_ns(cfs_b
->period
);
4944 cfs_b
->expires_seq
++;
4945 hrtimer_start_expires(&cfs_b
->period_timer
, HRTIMER_MODE_ABS_PINNED
);
4948 static void destroy_cfs_bandwidth(struct cfs_bandwidth
*cfs_b
)
4950 /* init_cfs_bandwidth() was not called */
4951 if (!cfs_b
->throttled_cfs_rq
.next
)
4954 hrtimer_cancel(&cfs_b
->period_timer
);
4955 hrtimer_cancel(&cfs_b
->slack_timer
);
4959 * Both these CPU hotplug callbacks race against unregister_fair_sched_group()
4961 * The race is harmless, since modifying bandwidth settings of unhooked group
4962 * bits doesn't do much.
4965 /* cpu online calback */
4966 static void __maybe_unused
update_runtime_enabled(struct rq
*rq
)
4968 struct task_group
*tg
;
4970 lockdep_assert_held(&rq
->lock
);
4973 list_for_each_entry_rcu(tg
, &task_groups
, list
) {
4974 struct cfs_bandwidth
*cfs_b
= &tg
->cfs_bandwidth
;
4975 struct cfs_rq
*cfs_rq
= tg
->cfs_rq
[cpu_of(rq
)];
4977 raw_spin_lock(&cfs_b
->lock
);
4978 cfs_rq
->runtime_enabled
= cfs_b
->quota
!= RUNTIME_INF
;
4979 raw_spin_unlock(&cfs_b
->lock
);
4984 /* cpu offline callback */
4985 static void __maybe_unused
unthrottle_offline_cfs_rqs(struct rq
*rq
)
4987 struct task_group
*tg
;
4989 lockdep_assert_held(&rq
->lock
);
4992 list_for_each_entry_rcu(tg
, &task_groups
, list
) {
4993 struct cfs_rq
*cfs_rq
= tg
->cfs_rq
[cpu_of(rq
)];
4995 if (!cfs_rq
->runtime_enabled
)
4999 * clock_task is not advancing so we just need to make sure
5000 * there's some valid quota amount
5002 cfs_rq
->runtime_remaining
= 1;
5004 * Offline rq is schedulable till CPU is completely disabled
5005 * in take_cpu_down(), so we prevent new cfs throttling here.
5007 cfs_rq
->runtime_enabled
= 0;
5009 if (cfs_rq_throttled(cfs_rq
))
5010 unthrottle_cfs_rq(cfs_rq
);
5015 #else /* CONFIG_CFS_BANDWIDTH */
5017 static inline bool cfs_bandwidth_used(void)
5022 static inline u64
cfs_rq_clock_task(struct cfs_rq
*cfs_rq
)
5024 return rq_clock_task(rq_of(cfs_rq
));
5027 static void account_cfs_rq_runtime(struct cfs_rq
*cfs_rq
, u64 delta_exec
) {}
5028 static bool check_cfs_rq_runtime(struct cfs_rq
*cfs_rq
) { return false; }
5029 static void check_enqueue_throttle(struct cfs_rq
*cfs_rq
) {}
5030 static inline void sync_throttle(struct task_group
*tg
, int cpu
) {}
5031 static __always_inline
void return_cfs_rq_runtime(struct cfs_rq
*cfs_rq
) {}
5033 static inline int cfs_rq_throttled(struct cfs_rq
*cfs_rq
)
5038 static inline int throttled_hierarchy(struct cfs_rq
*cfs_rq
)
5043 static inline int throttled_lb_pair(struct task_group
*tg
,
5044 int src_cpu
, int dest_cpu
)
5049 void init_cfs_bandwidth(struct cfs_bandwidth
*cfs_b
) {}
5051 #ifdef CONFIG_FAIR_GROUP_SCHED
5052 static void init_cfs_rq_runtime(struct cfs_rq
*cfs_rq
) {}
5055 static inline struct cfs_bandwidth
*tg_cfs_bandwidth(struct task_group
*tg
)
5059 static inline void destroy_cfs_bandwidth(struct cfs_bandwidth
*cfs_b
) {}
5060 static inline void update_runtime_enabled(struct rq
*rq
) {}
5061 static inline void unthrottle_offline_cfs_rqs(struct rq
*rq
) {}
5063 #endif /* CONFIG_CFS_BANDWIDTH */
5065 /**************************************************
5066 * CFS operations on tasks:
5069 #ifdef CONFIG_SCHED_HRTICK
5070 static void hrtick_start_fair(struct rq
*rq
, struct task_struct
*p
)
5072 struct sched_entity
*se
= &p
->se
;
5073 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
5075 SCHED_WARN_ON(task_rq(p
) != rq
);
5077 if (rq
->cfs
.h_nr_running
> 1) {
5078 u64 slice
= sched_slice(cfs_rq
, se
);
5079 u64 ran
= se
->sum_exec_runtime
- se
->prev_sum_exec_runtime
;
5080 s64 delta
= slice
- ran
;
5087 hrtick_start(rq
, delta
);
5092 * called from enqueue/dequeue and updates the hrtick when the
5093 * current task is from our class and nr_running is low enough
5096 static void hrtick_update(struct rq
*rq
)
5098 struct task_struct
*curr
= rq
->curr
;
5100 if (!hrtick_enabled(rq
) || curr
->sched_class
!= &fair_sched_class
)
5103 if (cfs_rq_of(&curr
->se
)->nr_running
< sched_nr_latency
)
5104 hrtick_start_fair(rq
, curr
);
5106 #else /* !CONFIG_SCHED_HRTICK */
5108 hrtick_start_fair(struct rq
*rq
, struct task_struct
*p
)
5112 static inline void hrtick_update(struct rq
*rq
)
5118 static inline unsigned long cpu_util(int cpu
);
5119 static unsigned long capacity_of(int cpu
);
5121 static inline bool cpu_overutilized(int cpu
)
5123 return (capacity_of(cpu
) * 1024) < (cpu_util(cpu
) * capacity_margin
);
5126 static inline void update_overutilized_status(struct rq
*rq
)
5128 if (!READ_ONCE(rq
->rd
->overutilized
) && cpu_overutilized(rq
->cpu
))
5129 WRITE_ONCE(rq
->rd
->overutilized
, SG_OVERUTILIZED
);
5132 static inline void update_overutilized_status(struct rq
*rq
) { }
5136 * The enqueue_task method is called before nr_running is
5137 * increased. Here we update the fair scheduling stats and
5138 * then put the task into the rbtree:
5141 enqueue_task_fair(struct rq
*rq
, struct task_struct
*p
, int flags
)
5143 struct cfs_rq
*cfs_rq
;
5144 struct sched_entity
*se
= &p
->se
;
5147 * The code below (indirectly) updates schedutil which looks at
5148 * the cfs_rq utilization to select a frequency.
5149 * Let's add the task's estimated utilization to the cfs_rq's
5150 * estimated utilization, before we update schedutil.
5152 util_est_enqueue(&rq
->cfs
, p
);
5155 * If in_iowait is set, the code below may not trigger any cpufreq
5156 * utilization updates, so do it here explicitly with the IOWAIT flag
5160 cpufreq_update_util(rq
, SCHED_CPUFREQ_IOWAIT
);
5162 for_each_sched_entity(se
) {
5165 cfs_rq
= cfs_rq_of(se
);
5166 enqueue_entity(cfs_rq
, se
, flags
);
5169 * end evaluation on encountering a throttled cfs_rq
5171 * note: in the case of encountering a throttled cfs_rq we will
5172 * post the final h_nr_running increment below.
5174 if (cfs_rq_throttled(cfs_rq
))
5176 cfs_rq
->h_nr_running
++;
5178 flags
= ENQUEUE_WAKEUP
;
5181 for_each_sched_entity(se
) {
5182 cfs_rq
= cfs_rq_of(se
);
5183 cfs_rq
->h_nr_running
++;
5185 if (cfs_rq_throttled(cfs_rq
))
5188 update_load_avg(cfs_rq
, se
, UPDATE_TG
);
5189 update_cfs_group(se
);
5193 add_nr_running(rq
, 1);
5195 * Since new tasks are assigned an initial util_avg equal to
5196 * half of the spare capacity of their CPU, tiny tasks have the
5197 * ability to cross the overutilized threshold, which will
5198 * result in the load balancer ruining all the task placement
5199 * done by EAS. As a way to mitigate that effect, do not account
5200 * for the first enqueue operation of new tasks during the
5201 * overutilized flag detection.
5203 * A better way of solving this problem would be to wait for
5204 * the PELT signals of tasks to converge before taking them
5205 * into account, but that is not straightforward to implement,
5206 * and the following generally works well enough in practice.
5208 if (flags
& ENQUEUE_WAKEUP
)
5209 update_overutilized_status(rq
);
5213 if (cfs_bandwidth_used()) {
5215 * When bandwidth control is enabled; the cfs_rq_throttled()
5216 * breaks in the above iteration can result in incomplete
5217 * leaf list maintenance, resulting in triggering the assertion
5220 for_each_sched_entity(se
) {
5221 cfs_rq
= cfs_rq_of(se
);
5223 if (list_add_leaf_cfs_rq(cfs_rq
))
5228 assert_list_leaf_cfs_rq(rq
);
5233 static void set_next_buddy(struct sched_entity
*se
);
5236 * The dequeue_task method is called before nr_running is
5237 * decreased. We remove the task from the rbtree and
5238 * update the fair scheduling stats:
5240 static void dequeue_task_fair(struct rq
*rq
, struct task_struct
*p
, int flags
)
5242 struct cfs_rq
*cfs_rq
;
5243 struct sched_entity
*se
= &p
->se
;
5244 int task_sleep
= flags
& DEQUEUE_SLEEP
;
5246 for_each_sched_entity(se
) {
5247 cfs_rq
= cfs_rq_of(se
);
5248 dequeue_entity(cfs_rq
, se
, flags
);
5251 * end evaluation on encountering a throttled cfs_rq
5253 * note: in the case of encountering a throttled cfs_rq we will
5254 * post the final h_nr_running decrement below.
5256 if (cfs_rq_throttled(cfs_rq
))
5258 cfs_rq
->h_nr_running
--;
5260 /* Don't dequeue parent if it has other entities besides us */
5261 if (cfs_rq
->load
.weight
) {
5262 /* Avoid re-evaluating load for this entity: */
5263 se
= parent_entity(se
);
5265 * Bias pick_next to pick a task from this cfs_rq, as
5266 * p is sleeping when it is within its sched_slice.
5268 if (task_sleep
&& se
&& !throttled_hierarchy(cfs_rq
))
5272 flags
|= DEQUEUE_SLEEP
;
5275 for_each_sched_entity(se
) {
5276 cfs_rq
= cfs_rq_of(se
);
5277 cfs_rq
->h_nr_running
--;
5279 if (cfs_rq_throttled(cfs_rq
))
5282 update_load_avg(cfs_rq
, se
, UPDATE_TG
);
5283 update_cfs_group(se
);
5287 sub_nr_running(rq
, 1);
5289 util_est_dequeue(&rq
->cfs
, p
, task_sleep
);
5295 /* Working cpumask for: load_balance, load_balance_newidle. */
5296 DEFINE_PER_CPU(cpumask_var_t
, load_balance_mask
);
5297 DEFINE_PER_CPU(cpumask_var_t
, select_idle_mask
);
5299 #ifdef CONFIG_NO_HZ_COMMON
5301 * per rq 'load' arrray crap; XXX kill this.
5305 * The exact cpuload calculated at every tick would be:
5307 * load' = (1 - 1/2^i) * load + (1/2^i) * cur_load
5309 * If a CPU misses updates for n ticks (as it was idle) and update gets
5310 * called on the n+1-th tick when CPU may be busy, then we have:
5312 * load_n = (1 - 1/2^i)^n * load_0
5313 * load_n+1 = (1 - 1/2^i) * load_n + (1/2^i) * cur_load
5315 * decay_load_missed() below does efficient calculation of
5317 * load' = (1 - 1/2^i)^n * load
5319 * Because x^(n+m) := x^n * x^m we can decompose any x^n in power-of-2 factors.
5320 * This allows us to precompute the above in said factors, thereby allowing the
5321 * reduction of an arbitrary n in O(log_2 n) steps. (See also
5322 * fixed_power_int())
5324 * The calculation is approximated on a 128 point scale.
5326 #define DEGRADE_SHIFT 7
5328 static const u8 degrade_zero_ticks
[CPU_LOAD_IDX_MAX
] = {0, 8, 32, 64, 128};
5329 static const u8 degrade_factor
[CPU_LOAD_IDX_MAX
][DEGRADE_SHIFT
+ 1] = {
5330 { 0, 0, 0, 0, 0, 0, 0, 0 },
5331 { 64, 32, 8, 0, 0, 0, 0, 0 },
5332 { 96, 72, 40, 12, 1, 0, 0, 0 },
5333 { 112, 98, 75, 43, 15, 1, 0, 0 },
5334 { 120, 112, 98, 76, 45, 16, 2, 0 }
5338 * Update cpu_load for any missed ticks, due to tickless idle. The backlog
5339 * would be when CPU is idle and so we just decay the old load without
5340 * adding any new load.
5342 static unsigned long
5343 decay_load_missed(unsigned long load
, unsigned long missed_updates
, int idx
)
5347 if (!missed_updates
)
5350 if (missed_updates
>= degrade_zero_ticks
[idx
])
5354 return load
>> missed_updates
;
5356 while (missed_updates
) {
5357 if (missed_updates
% 2)
5358 load
= (load
* degrade_factor
[idx
][j
]) >> DEGRADE_SHIFT
;
5360 missed_updates
>>= 1;
5367 cpumask_var_t idle_cpus_mask
;
5369 int has_blocked
; /* Idle CPUS has blocked load */
5370 unsigned long next_balance
; /* in jiffy units */
5371 unsigned long next_blocked
; /* Next update of blocked load in jiffies */
5372 } nohz ____cacheline_aligned
;
5374 #endif /* CONFIG_NO_HZ_COMMON */
5377 * __cpu_load_update - update the rq->cpu_load[] statistics
5378 * @this_rq: The rq to update statistics for
5379 * @this_load: The current load
5380 * @pending_updates: The number of missed updates
5382 * Update rq->cpu_load[] statistics. This function is usually called every
5383 * scheduler tick (TICK_NSEC).
5385 * This function computes a decaying average:
5387 * load[i]' = (1 - 1/2^i) * load[i] + (1/2^i) * load
5389 * Because of NOHZ it might not get called on every tick which gives need for
5390 * the @pending_updates argument.
5392 * load[i]_n = (1 - 1/2^i) * load[i]_n-1 + (1/2^i) * load_n-1
5393 * = A * load[i]_n-1 + B ; A := (1 - 1/2^i), B := (1/2^i) * load
5394 * = A * (A * load[i]_n-2 + B) + B
5395 * = A * (A * (A * load[i]_n-3 + B) + B) + B
5396 * = A^3 * load[i]_n-3 + (A^2 + A + 1) * B
5397 * = A^n * load[i]_0 + (A^(n-1) + A^(n-2) + ... + 1) * B
5398 * = A^n * load[i]_0 + ((1 - A^n) / (1 - A)) * B
5399 * = (1 - 1/2^i)^n * (load[i]_0 - load) + load
5401 * In the above we've assumed load_n := load, which is true for NOHZ_FULL as
5402 * any change in load would have resulted in the tick being turned back on.
5404 * For regular NOHZ, this reduces to:
5406 * load[i]_n = (1 - 1/2^i)^n * load[i]_0
5408 * see decay_load_misses(). For NOHZ_FULL we get to subtract and add the extra
5411 static void cpu_load_update(struct rq
*this_rq
, unsigned long this_load
,
5412 unsigned long pending_updates
)
5414 unsigned long __maybe_unused tickless_load
= this_rq
->cpu_load
[0];
5417 this_rq
->nr_load_updates
++;
5419 /* Update our load: */
5420 this_rq
->cpu_load
[0] = this_load
; /* Fasttrack for idx 0 */
5421 for (i
= 1, scale
= 2; i
< CPU_LOAD_IDX_MAX
; i
++, scale
+= scale
) {
5422 unsigned long old_load
, new_load
;
5424 /* scale is effectively 1 << i now, and >> i divides by scale */
5426 old_load
= this_rq
->cpu_load
[i
];
5427 #ifdef CONFIG_NO_HZ_COMMON
5428 old_load
= decay_load_missed(old_load
, pending_updates
- 1, i
);
5429 if (tickless_load
) {
5430 old_load
-= decay_load_missed(tickless_load
, pending_updates
- 1, i
);
5432 * old_load can never be a negative value because a
5433 * decayed tickless_load cannot be greater than the
5434 * original tickless_load.
5436 old_load
+= tickless_load
;
5439 new_load
= this_load
;
5441 * Round up the averaging division if load is increasing. This
5442 * prevents us from getting stuck on 9 if the load is 10, for
5445 if (new_load
> old_load
)
5446 new_load
+= scale
- 1;
5448 this_rq
->cpu_load
[i
] = (old_load
* (scale
- 1) + new_load
) >> i
;
5452 /* Used instead of source_load when we know the type == 0 */
5453 static unsigned long weighted_cpuload(struct rq
*rq
)
5455 return cfs_rq_runnable_load_avg(&rq
->cfs
);
5458 #ifdef CONFIG_NO_HZ_COMMON
5460 * There is no sane way to deal with nohz on smp when using jiffies because the
5461 * CPU doing the jiffies update might drift wrt the CPU doing the jiffy reading
5462 * causing off-by-one errors in observed deltas; {0,2} instead of {1,1}.
5464 * Therefore we need to avoid the delta approach from the regular tick when
5465 * possible since that would seriously skew the load calculation. This is why we
5466 * use cpu_load_update_periodic() for CPUs out of nohz. However we'll rely on
5467 * jiffies deltas for updates happening while in nohz mode (idle ticks, idle
5468 * loop exit, nohz_idle_balance, nohz full exit...)
5470 * This means we might still be one tick off for nohz periods.
5473 static void cpu_load_update_nohz(struct rq
*this_rq
,
5474 unsigned long curr_jiffies
,
5477 unsigned long pending_updates
;
5479 pending_updates
= curr_jiffies
- this_rq
->last_load_update_tick
;
5480 if (pending_updates
) {
5481 this_rq
->last_load_update_tick
= curr_jiffies
;
5483 * In the regular NOHZ case, we were idle, this means load 0.
5484 * In the NOHZ_FULL case, we were non-idle, we should consider
5485 * its weighted load.
5487 cpu_load_update(this_rq
, load
, pending_updates
);
5492 * Called from nohz_idle_balance() to update the load ratings before doing the
5495 static void cpu_load_update_idle(struct rq
*this_rq
)
5498 * bail if there's load or we're actually up-to-date.
5500 if (weighted_cpuload(this_rq
))
5503 cpu_load_update_nohz(this_rq
, READ_ONCE(jiffies
), 0);
5507 * Record CPU load on nohz entry so we know the tickless load to account
5508 * on nohz exit. cpu_load[0] happens then to be updated more frequently
5509 * than other cpu_load[idx] but it should be fine as cpu_load readers
5510 * shouldn't rely into synchronized cpu_load[*] updates.
5512 void cpu_load_update_nohz_start(void)
5514 struct rq
*this_rq
= this_rq();
5517 * This is all lockless but should be fine. If weighted_cpuload changes
5518 * concurrently we'll exit nohz. And cpu_load write can race with
5519 * cpu_load_update_idle() but both updater would be writing the same.
5521 this_rq
->cpu_load
[0] = weighted_cpuload(this_rq
);
5525 * Account the tickless load in the end of a nohz frame.
5527 void cpu_load_update_nohz_stop(void)
5529 unsigned long curr_jiffies
= READ_ONCE(jiffies
);
5530 struct rq
*this_rq
= this_rq();
5534 if (curr_jiffies
== this_rq
->last_load_update_tick
)
5537 load
= weighted_cpuload(this_rq
);
5538 rq_lock(this_rq
, &rf
);
5539 update_rq_clock(this_rq
);
5540 cpu_load_update_nohz(this_rq
, curr_jiffies
, load
);
5541 rq_unlock(this_rq
, &rf
);
5543 #else /* !CONFIG_NO_HZ_COMMON */
5544 static inline void cpu_load_update_nohz(struct rq
*this_rq
,
5545 unsigned long curr_jiffies
,
5546 unsigned long load
) { }
5547 #endif /* CONFIG_NO_HZ_COMMON */
5549 static void cpu_load_update_periodic(struct rq
*this_rq
, unsigned long load
)
5551 #ifdef CONFIG_NO_HZ_COMMON
5552 /* See the mess around cpu_load_update_nohz(). */
5553 this_rq
->last_load_update_tick
= READ_ONCE(jiffies
);
5555 cpu_load_update(this_rq
, load
, 1);
5559 * Called from scheduler_tick()
5561 void cpu_load_update_active(struct rq
*this_rq
)
5563 unsigned long load
= weighted_cpuload(this_rq
);
5565 if (tick_nohz_tick_stopped())
5566 cpu_load_update_nohz(this_rq
, READ_ONCE(jiffies
), load
);
5568 cpu_load_update_periodic(this_rq
, load
);
5572 * Return a low guess at the load of a migration-source CPU weighted
5573 * according to the scheduling class and "nice" value.
5575 * We want to under-estimate the load of migration sources, to
5576 * balance conservatively.
5578 static unsigned long source_load(int cpu
, int type
)
5580 struct rq
*rq
= cpu_rq(cpu
);
5581 unsigned long total
= weighted_cpuload(rq
);
5583 if (type
== 0 || !sched_feat(LB_BIAS
))
5586 return min(rq
->cpu_load
[type
-1], total
);
5590 * Return a high guess at the load of a migration-target CPU weighted
5591 * according to the scheduling class and "nice" value.
5593 static unsigned long target_load(int cpu
, int type
)
5595 struct rq
*rq
= cpu_rq(cpu
);
5596 unsigned long total
= weighted_cpuload(rq
);
5598 if (type
== 0 || !sched_feat(LB_BIAS
))
5601 return max(rq
->cpu_load
[type
-1], total
);
5604 static unsigned long capacity_of(int cpu
)
5606 return cpu_rq(cpu
)->cpu_capacity
;
5609 static unsigned long cpu_avg_load_per_task(int cpu
)
5611 struct rq
*rq
= cpu_rq(cpu
);
5612 unsigned long nr_running
= READ_ONCE(rq
->cfs
.h_nr_running
);
5613 unsigned long load_avg
= weighted_cpuload(rq
);
5616 return load_avg
/ nr_running
;
5621 static void record_wakee(struct task_struct
*p
)
5624 * Only decay a single time; tasks that have less then 1 wakeup per
5625 * jiffy will not have built up many flips.
5627 if (time_after(jiffies
, current
->wakee_flip_decay_ts
+ HZ
)) {
5628 current
->wakee_flips
>>= 1;
5629 current
->wakee_flip_decay_ts
= jiffies
;
5632 if (current
->last_wakee
!= p
) {
5633 current
->last_wakee
= p
;
5634 current
->wakee_flips
++;
5639 * Detect M:N waker/wakee relationships via a switching-frequency heuristic.
5641 * A waker of many should wake a different task than the one last awakened
5642 * at a frequency roughly N times higher than one of its wakees.
5644 * In order to determine whether we should let the load spread vs consolidating
5645 * to shared cache, we look for a minimum 'flip' frequency of llc_size in one
5646 * partner, and a factor of lls_size higher frequency in the other.
5648 * With both conditions met, we can be relatively sure that the relationship is
5649 * non-monogamous, with partner count exceeding socket size.
5651 * Waker/wakee being client/server, worker/dispatcher, interrupt source or
5652 * whatever is irrelevant, spread criteria is apparent partner count exceeds
5655 static int wake_wide(struct task_struct
*p
)
5657 unsigned int master
= current
->wakee_flips
;
5658 unsigned int slave
= p
->wakee_flips
;
5659 int factor
= this_cpu_read(sd_llc_size
);
5662 swap(master
, slave
);
5663 if (slave
< factor
|| master
< slave
* factor
)
5669 * The purpose of wake_affine() is to quickly determine on which CPU we can run
5670 * soonest. For the purpose of speed we only consider the waking and previous
5673 * wake_affine_idle() - only considers 'now', it check if the waking CPU is
5674 * cache-affine and is (or will be) idle.
5676 * wake_affine_weight() - considers the weight to reflect the average
5677 * scheduling latency of the CPUs. This seems to work
5678 * for the overloaded case.
5681 wake_affine_idle(int this_cpu
, int prev_cpu
, int sync
)
5684 * If this_cpu is idle, it implies the wakeup is from interrupt
5685 * context. Only allow the move if cache is shared. Otherwise an
5686 * interrupt intensive workload could force all tasks onto one
5687 * node depending on the IO topology or IRQ affinity settings.
5689 * If the prev_cpu is idle and cache affine then avoid a migration.
5690 * There is no guarantee that the cache hot data from an interrupt
5691 * is more important than cache hot data on the prev_cpu and from
5692 * a cpufreq perspective, it's better to have higher utilisation
5695 if (available_idle_cpu(this_cpu
) && cpus_share_cache(this_cpu
, prev_cpu
))
5696 return available_idle_cpu(prev_cpu
) ? prev_cpu
: this_cpu
;
5698 if (sync
&& cpu_rq(this_cpu
)->nr_running
== 1)
5701 return nr_cpumask_bits
;
5705 wake_affine_weight(struct sched_domain
*sd
, struct task_struct
*p
,
5706 int this_cpu
, int prev_cpu
, int sync
)
5708 s64 this_eff_load
, prev_eff_load
;
5709 unsigned long task_load
;
5711 this_eff_load
= target_load(this_cpu
, sd
->wake_idx
);
5714 unsigned long current_load
= task_h_load(current
);
5716 if (current_load
> this_eff_load
)
5719 this_eff_load
-= current_load
;
5722 task_load
= task_h_load(p
);
5724 this_eff_load
+= task_load
;
5725 if (sched_feat(WA_BIAS
))
5726 this_eff_load
*= 100;
5727 this_eff_load
*= capacity_of(prev_cpu
);
5729 prev_eff_load
= source_load(prev_cpu
, sd
->wake_idx
);
5730 prev_eff_load
-= task_load
;
5731 if (sched_feat(WA_BIAS
))
5732 prev_eff_load
*= 100 + (sd
->imbalance_pct
- 100) / 2;
5733 prev_eff_load
*= capacity_of(this_cpu
);
5736 * If sync, adjust the weight of prev_eff_load such that if
5737 * prev_eff == this_eff that select_idle_sibling() will consider
5738 * stacking the wakee on top of the waker if no other CPU is
5744 return this_eff_load
< prev_eff_load
? this_cpu
: nr_cpumask_bits
;
5747 static int wake_affine(struct sched_domain
*sd
, struct task_struct
*p
,
5748 int this_cpu
, int prev_cpu
, int sync
)
5750 int target
= nr_cpumask_bits
;
5752 if (sched_feat(WA_IDLE
))
5753 target
= wake_affine_idle(this_cpu
, prev_cpu
, sync
);
5755 if (sched_feat(WA_WEIGHT
) && target
== nr_cpumask_bits
)
5756 target
= wake_affine_weight(sd
, p
, this_cpu
, prev_cpu
, sync
);
5758 schedstat_inc(p
->se
.statistics
.nr_wakeups_affine_attempts
);
5759 if (target
== nr_cpumask_bits
)
5762 schedstat_inc(sd
->ttwu_move_affine
);
5763 schedstat_inc(p
->se
.statistics
.nr_wakeups_affine
);
5767 static unsigned long cpu_util_without(int cpu
, struct task_struct
*p
);
5769 static unsigned long capacity_spare_without(int cpu
, struct task_struct
*p
)
5771 return max_t(long, capacity_of(cpu
) - cpu_util_without(cpu
, p
), 0);
5775 * find_idlest_group finds and returns the least busy CPU group within the
5778 * Assumes p is allowed on at least one CPU in sd.
5780 static struct sched_group
*
5781 find_idlest_group(struct sched_domain
*sd
, struct task_struct
*p
,
5782 int this_cpu
, int sd_flag
)
5784 struct sched_group
*idlest
= NULL
, *group
= sd
->groups
;
5785 struct sched_group
*most_spare_sg
= NULL
;
5786 unsigned long min_runnable_load
= ULONG_MAX
;
5787 unsigned long this_runnable_load
= ULONG_MAX
;
5788 unsigned long min_avg_load
= ULONG_MAX
, this_avg_load
= ULONG_MAX
;
5789 unsigned long most_spare
= 0, this_spare
= 0;
5790 int load_idx
= sd
->forkexec_idx
;
5791 int imbalance_scale
= 100 + (sd
->imbalance_pct
-100)/2;
5792 unsigned long imbalance
= scale_load_down(NICE_0_LOAD
) *
5793 (sd
->imbalance_pct
-100) / 100;
5795 if (sd_flag
& SD_BALANCE_WAKE
)
5796 load_idx
= sd
->wake_idx
;
5799 unsigned long load
, avg_load
, runnable_load
;
5800 unsigned long spare_cap
, max_spare_cap
;
5804 /* Skip over this group if it has no CPUs allowed */
5805 if (!cpumask_intersects(sched_group_span(group
),
5809 local_group
= cpumask_test_cpu(this_cpu
,
5810 sched_group_span(group
));
5813 * Tally up the load of all CPUs in the group and find
5814 * the group containing the CPU with most spare capacity.
5820 for_each_cpu(i
, sched_group_span(group
)) {
5821 /* Bias balancing toward CPUs of our domain */
5823 load
= source_load(i
, load_idx
);
5825 load
= target_load(i
, load_idx
);
5827 runnable_load
+= load
;
5829 avg_load
+= cfs_rq_load_avg(&cpu_rq(i
)->cfs
);
5831 spare_cap
= capacity_spare_without(i
, p
);
5833 if (spare_cap
> max_spare_cap
)
5834 max_spare_cap
= spare_cap
;
5837 /* Adjust by relative CPU capacity of the group */
5838 avg_load
= (avg_load
* SCHED_CAPACITY_SCALE
) /
5839 group
->sgc
->capacity
;
5840 runnable_load
= (runnable_load
* SCHED_CAPACITY_SCALE
) /
5841 group
->sgc
->capacity
;
5844 this_runnable_load
= runnable_load
;
5845 this_avg_load
= avg_load
;
5846 this_spare
= max_spare_cap
;
5848 if (min_runnable_load
> (runnable_load
+ imbalance
)) {
5850 * The runnable load is significantly smaller
5851 * so we can pick this new CPU:
5853 min_runnable_load
= runnable_load
;
5854 min_avg_load
= avg_load
;
5856 } else if ((runnable_load
< (min_runnable_load
+ imbalance
)) &&
5857 (100*min_avg_load
> imbalance_scale
*avg_load
)) {
5859 * The runnable loads are close so take the
5860 * blocked load into account through avg_load:
5862 min_avg_load
= avg_load
;
5866 if (most_spare
< max_spare_cap
) {
5867 most_spare
= max_spare_cap
;
5868 most_spare_sg
= group
;
5871 } while (group
= group
->next
, group
!= sd
->groups
);
5874 * The cross-over point between using spare capacity or least load
5875 * is too conservative for high utilization tasks on partially
5876 * utilized systems if we require spare_capacity > task_util(p),
5877 * so we allow for some task stuffing by using
5878 * spare_capacity > task_util(p)/2.
5880 * Spare capacity can't be used for fork because the utilization has
5881 * not been set yet, we must first select a rq to compute the initial
5884 if (sd_flag
& SD_BALANCE_FORK
)
5887 if (this_spare
> task_util(p
) / 2 &&
5888 imbalance_scale
*this_spare
> 100*most_spare
)
5891 if (most_spare
> task_util(p
) / 2)
5892 return most_spare_sg
;
5899 * When comparing groups across NUMA domains, it's possible for the
5900 * local domain to be very lightly loaded relative to the remote
5901 * domains but "imbalance" skews the comparison making remote CPUs
5902 * look much more favourable. When considering cross-domain, add
5903 * imbalance to the runnable load on the remote node and consider
5906 if ((sd
->flags
& SD_NUMA
) &&
5907 min_runnable_load
+ imbalance
>= this_runnable_load
)
5910 if (min_runnable_load
> (this_runnable_load
+ imbalance
))
5913 if ((this_runnable_load
< (min_runnable_load
+ imbalance
)) &&
5914 (100*this_avg_load
< imbalance_scale
*min_avg_load
))
5921 * find_idlest_group_cpu - find the idlest CPU among the CPUs in the group.
5924 find_idlest_group_cpu(struct sched_group
*group
, struct task_struct
*p
, int this_cpu
)
5926 unsigned long load
, min_load
= ULONG_MAX
;
5927 unsigned int min_exit_latency
= UINT_MAX
;
5928 u64 latest_idle_timestamp
= 0;
5929 int least_loaded_cpu
= this_cpu
;
5930 int shallowest_idle_cpu
= -1;
5933 /* Check if we have any choice: */
5934 if (group
->group_weight
== 1)
5935 return cpumask_first(sched_group_span(group
));
5937 /* Traverse only the allowed CPUs */
5938 for_each_cpu_and(i
, sched_group_span(group
), &p
->cpus_allowed
) {
5939 if (available_idle_cpu(i
)) {
5940 struct rq
*rq
= cpu_rq(i
);
5941 struct cpuidle_state
*idle
= idle_get_state(rq
);
5942 if (idle
&& idle
->exit_latency
< min_exit_latency
) {
5944 * We give priority to a CPU whose idle state
5945 * has the smallest exit latency irrespective
5946 * of any idle timestamp.
5948 min_exit_latency
= idle
->exit_latency
;
5949 latest_idle_timestamp
= rq
->idle_stamp
;
5950 shallowest_idle_cpu
= i
;
5951 } else if ((!idle
|| idle
->exit_latency
== min_exit_latency
) &&
5952 rq
->idle_stamp
> latest_idle_timestamp
) {
5954 * If equal or no active idle state, then
5955 * the most recently idled CPU might have
5958 latest_idle_timestamp
= rq
->idle_stamp
;
5959 shallowest_idle_cpu
= i
;
5961 } else if (shallowest_idle_cpu
== -1) {
5962 load
= weighted_cpuload(cpu_rq(i
));
5963 if (load
< min_load
) {
5965 least_loaded_cpu
= i
;
5970 return shallowest_idle_cpu
!= -1 ? shallowest_idle_cpu
: least_loaded_cpu
;
5973 static inline int find_idlest_cpu(struct sched_domain
*sd
, struct task_struct
*p
,
5974 int cpu
, int prev_cpu
, int sd_flag
)
5978 if (!cpumask_intersects(sched_domain_span(sd
), &p
->cpus_allowed
))
5982 * We need task's util for capacity_spare_without, sync it up to
5983 * prev_cpu's last_update_time.
5985 if (!(sd_flag
& SD_BALANCE_FORK
))
5986 sync_entity_load_avg(&p
->se
);
5989 struct sched_group
*group
;
5990 struct sched_domain
*tmp
;
5993 if (!(sd
->flags
& sd_flag
)) {
5998 group
= find_idlest_group(sd
, p
, cpu
, sd_flag
);
6004 new_cpu
= find_idlest_group_cpu(group
, p
, cpu
);
6005 if (new_cpu
== cpu
) {
6006 /* Now try balancing at a lower domain level of 'cpu': */
6011 /* Now try balancing at a lower domain level of 'new_cpu': */
6013 weight
= sd
->span_weight
;
6015 for_each_domain(cpu
, tmp
) {
6016 if (weight
<= tmp
->span_weight
)
6018 if (tmp
->flags
& sd_flag
)
6026 #ifdef CONFIG_SCHED_SMT
6027 DEFINE_STATIC_KEY_FALSE(sched_smt_present
);
6028 EXPORT_SYMBOL_GPL(sched_smt_present
);
6030 static inline void set_idle_cores(int cpu
, int val
)
6032 struct sched_domain_shared
*sds
;
6034 sds
= rcu_dereference(per_cpu(sd_llc_shared
, cpu
));
6036 WRITE_ONCE(sds
->has_idle_cores
, val
);
6039 static inline bool test_idle_cores(int cpu
, bool def
)
6041 struct sched_domain_shared
*sds
;
6043 sds
= rcu_dereference(per_cpu(sd_llc_shared
, cpu
));
6045 return READ_ONCE(sds
->has_idle_cores
);
6051 * Scans the local SMT mask to see if the entire core is idle, and records this
6052 * information in sd_llc_shared->has_idle_cores.
6054 * Since SMT siblings share all cache levels, inspecting this limited remote
6055 * state should be fairly cheap.
6057 void __update_idle_core(struct rq
*rq
)
6059 int core
= cpu_of(rq
);
6063 if (test_idle_cores(core
, true))
6066 for_each_cpu(cpu
, cpu_smt_mask(core
)) {
6070 if (!available_idle_cpu(cpu
))
6074 set_idle_cores(core
, 1);
6080 * Scan the entire LLC domain for idle cores; this dynamically switches off if
6081 * there are no idle cores left in the system; tracked through
6082 * sd_llc->shared->has_idle_cores and enabled through update_idle_core() above.
6084 static int select_idle_core(struct task_struct
*p
, struct sched_domain
*sd
, int target
)
6086 struct cpumask
*cpus
= this_cpu_cpumask_var_ptr(select_idle_mask
);
6089 if (!static_branch_likely(&sched_smt_present
))
6092 if (!test_idle_cores(target
, false))
6095 cpumask_and(cpus
, sched_domain_span(sd
), &p
->cpus_allowed
);
6097 for_each_cpu_wrap(core
, cpus
, target
) {
6100 for_each_cpu(cpu
, cpu_smt_mask(core
)) {
6101 __cpumask_clear_cpu(cpu
, cpus
);
6102 if (!available_idle_cpu(cpu
))
6111 * Failed to find an idle core; stop looking for one.
6113 set_idle_cores(target
, 0);
6119 * Scan the local SMT mask for idle CPUs.
6121 static int select_idle_smt(struct task_struct
*p
, int target
)
6125 if (!static_branch_likely(&sched_smt_present
))
6128 for_each_cpu(cpu
, cpu_smt_mask(target
)) {
6129 if (!cpumask_test_cpu(cpu
, &p
->cpus_allowed
))
6131 if (available_idle_cpu(cpu
))
6138 #else /* CONFIG_SCHED_SMT */
6140 static inline int select_idle_core(struct task_struct
*p
, struct sched_domain
*sd
, int target
)
6145 static inline int select_idle_smt(struct task_struct
*p
, int target
)
6150 #endif /* CONFIG_SCHED_SMT */
6153 * Scan the LLC domain for idle CPUs; this is dynamically regulated by
6154 * comparing the average scan cost (tracked in sd->avg_scan_cost) against the
6155 * average idle time for this rq (as found in rq->avg_idle).
6157 static int select_idle_cpu(struct task_struct
*p
, struct sched_domain
*sd
, int target
)
6159 struct sched_domain
*this_sd
;
6160 u64 avg_cost
, avg_idle
;
6163 int cpu
, nr
= INT_MAX
;
6165 this_sd
= rcu_dereference(*this_cpu_ptr(&sd_llc
));
6170 * Due to large variance we need a large fuzz factor; hackbench in
6171 * particularly is sensitive here.
6173 avg_idle
= this_rq()->avg_idle
/ 512;
6174 avg_cost
= this_sd
->avg_scan_cost
+ 1;
6176 if (sched_feat(SIS_AVG_CPU
) && avg_idle
< avg_cost
)
6179 if (sched_feat(SIS_PROP
)) {
6180 u64 span_avg
= sd
->span_weight
* avg_idle
;
6181 if (span_avg
> 4*avg_cost
)
6182 nr
= div_u64(span_avg
, avg_cost
);
6187 time
= local_clock();
6189 for_each_cpu_wrap(cpu
, sched_domain_span(sd
), target
) {
6192 if (!cpumask_test_cpu(cpu
, &p
->cpus_allowed
))
6194 if (available_idle_cpu(cpu
))
6198 time
= local_clock() - time
;
6199 cost
= this_sd
->avg_scan_cost
;
6200 delta
= (s64
)(time
- cost
) / 8;
6201 this_sd
->avg_scan_cost
+= delta
;
6207 * Try and locate an idle core/thread in the LLC cache domain.
6209 static int select_idle_sibling(struct task_struct
*p
, int prev
, int target
)
6211 struct sched_domain
*sd
;
6212 int i
, recent_used_cpu
;
6214 if (available_idle_cpu(target
))
6218 * If the previous CPU is cache affine and idle, don't be stupid:
6220 if (prev
!= target
&& cpus_share_cache(prev
, target
) && available_idle_cpu(prev
))
6223 /* Check a recently used CPU as a potential idle candidate: */
6224 recent_used_cpu
= p
->recent_used_cpu
;
6225 if (recent_used_cpu
!= prev
&&
6226 recent_used_cpu
!= target
&&
6227 cpus_share_cache(recent_used_cpu
, target
) &&
6228 available_idle_cpu(recent_used_cpu
) &&
6229 cpumask_test_cpu(p
->recent_used_cpu
, &p
->cpus_allowed
)) {
6231 * Replace recent_used_cpu with prev as it is a potential
6232 * candidate for the next wake:
6234 p
->recent_used_cpu
= prev
;
6235 return recent_used_cpu
;
6238 sd
= rcu_dereference(per_cpu(sd_llc
, target
));
6242 i
= select_idle_core(p
, sd
, target
);
6243 if ((unsigned)i
< nr_cpumask_bits
)
6246 i
= select_idle_cpu(p
, sd
, target
);
6247 if ((unsigned)i
< nr_cpumask_bits
)
6250 i
= select_idle_smt(p
, target
);
6251 if ((unsigned)i
< nr_cpumask_bits
)
6258 * Amount of capacity of a CPU that is (estimated to be) used by CFS tasks
6259 * @cpu: the CPU to get the utilization of
6261 * The unit of the return value must be the one of capacity so we can compare
6262 * the utilization with the capacity of the CPU that is available for CFS task
6263 * (ie cpu_capacity).
6265 * cfs_rq.avg.util_avg is the sum of running time of runnable tasks plus the
6266 * recent utilization of currently non-runnable tasks on a CPU. It represents
6267 * the amount of utilization of a CPU in the range [0..capacity_orig] where
6268 * capacity_orig is the cpu_capacity available at the highest frequency
6269 * (arch_scale_freq_capacity()).
6270 * The utilization of a CPU converges towards a sum equal to or less than the
6271 * current capacity (capacity_curr <= capacity_orig) of the CPU because it is
6272 * the running time on this CPU scaled by capacity_curr.
6274 * The estimated utilization of a CPU is defined to be the maximum between its
6275 * cfs_rq.avg.util_avg and the sum of the estimated utilization of the tasks
6276 * currently RUNNABLE on that CPU.
6277 * This allows to properly represent the expected utilization of a CPU which
6278 * has just got a big task running since a long sleep period. At the same time
6279 * however it preserves the benefits of the "blocked utilization" in
6280 * describing the potential for other tasks waking up on the same CPU.
6282 * Nevertheless, cfs_rq.avg.util_avg can be higher than capacity_curr or even
6283 * higher than capacity_orig because of unfortunate rounding in
6284 * cfs.avg.util_avg or just after migrating tasks and new task wakeups until
6285 * the average stabilizes with the new running time. We need to check that the
6286 * utilization stays within the range of [0..capacity_orig] and cap it if
6287 * necessary. Without utilization capping, a group could be seen as overloaded
6288 * (CPU0 utilization at 121% + CPU1 utilization at 80%) whereas CPU1 has 20% of
6289 * available capacity. We allow utilization to overshoot capacity_curr (but not
6290 * capacity_orig) as it useful for predicting the capacity required after task
6291 * migrations (scheduler-driven DVFS).
6293 * Return: the (estimated) utilization for the specified CPU
6295 static inline unsigned long cpu_util(int cpu
)
6297 struct cfs_rq
*cfs_rq
;
6300 cfs_rq
= &cpu_rq(cpu
)->cfs
;
6301 util
= READ_ONCE(cfs_rq
->avg
.util_avg
);
6303 if (sched_feat(UTIL_EST
))
6304 util
= max(util
, READ_ONCE(cfs_rq
->avg
.util_est
.enqueued
));
6306 return min_t(unsigned long, util
, capacity_orig_of(cpu
));
6310 * cpu_util_without: compute cpu utilization without any contributions from *p
6311 * @cpu: the CPU which utilization is requested
6312 * @p: the task which utilization should be discounted
6314 * The utilization of a CPU is defined by the utilization of tasks currently
6315 * enqueued on that CPU as well as tasks which are currently sleeping after an
6316 * execution on that CPU.
6318 * This method returns the utilization of the specified CPU by discounting the
6319 * utilization of the specified task, whenever the task is currently
6320 * contributing to the CPU utilization.
6322 static unsigned long cpu_util_without(int cpu
, struct task_struct
*p
)
6324 struct cfs_rq
*cfs_rq
;
6327 /* Task has no contribution or is new */
6328 if (cpu
!= task_cpu(p
) || !READ_ONCE(p
->se
.avg
.last_update_time
))
6329 return cpu_util(cpu
);
6331 cfs_rq
= &cpu_rq(cpu
)->cfs
;
6332 util
= READ_ONCE(cfs_rq
->avg
.util_avg
);
6334 /* Discount task's util from CPU's util */
6335 lsub_positive(&util
, task_util(p
));
6340 * a) if *p is the only task sleeping on this CPU, then:
6341 * cpu_util (== task_util) > util_est (== 0)
6342 * and thus we return:
6343 * cpu_util_without = (cpu_util - task_util) = 0
6345 * b) if other tasks are SLEEPING on this CPU, which is now exiting
6347 * cpu_util >= task_util
6348 * cpu_util > util_est (== 0)
6349 * and thus we discount *p's blocked utilization to return:
6350 * cpu_util_without = (cpu_util - task_util) >= 0
6352 * c) if other tasks are RUNNABLE on that CPU and
6353 * util_est > cpu_util
6354 * then we use util_est since it returns a more restrictive
6355 * estimation of the spare capacity on that CPU, by just
6356 * considering the expected utilization of tasks already
6357 * runnable on that CPU.
6359 * Cases a) and b) are covered by the above code, while case c) is
6360 * covered by the following code when estimated utilization is
6363 if (sched_feat(UTIL_EST
)) {
6364 unsigned int estimated
=
6365 READ_ONCE(cfs_rq
->avg
.util_est
.enqueued
);
6368 * Despite the following checks we still have a small window
6369 * for a possible race, when an execl's select_task_rq_fair()
6370 * races with LB's detach_task():
6373 * p->on_rq = TASK_ON_RQ_MIGRATING;
6374 * ---------------------------------- A
6375 * deactivate_task() \
6376 * dequeue_task() + RaceTime
6377 * util_est_dequeue() /
6378 * ---------------------------------- B
6380 * The additional check on "current == p" it's required to
6381 * properly fix the execl regression and it helps in further
6382 * reducing the chances for the above race.
6384 if (unlikely(task_on_rq_queued(p
) || current
== p
))
6385 lsub_positive(&estimated
, _task_util_est(p
));
6387 util
= max(util
, estimated
);
6391 * Utilization (estimated) can exceed the CPU capacity, thus let's
6392 * clamp to the maximum CPU capacity to ensure consistency with
6393 * the cpu_util call.
6395 return min_t(unsigned long, util
, capacity_orig_of(cpu
));
6399 * Disable WAKE_AFFINE in the case where task @p doesn't fit in the
6400 * capacity of either the waking CPU @cpu or the previous CPU @prev_cpu.
6402 * In that case WAKE_AFFINE doesn't make sense and we'll let
6403 * BALANCE_WAKE sort things out.
6405 static int wake_cap(struct task_struct
*p
, int cpu
, int prev_cpu
)
6407 long min_cap
, max_cap
;
6409 if (!static_branch_unlikely(&sched_asym_cpucapacity
))
6412 min_cap
= min(capacity_orig_of(prev_cpu
), capacity_orig_of(cpu
));
6413 max_cap
= cpu_rq(cpu
)->rd
->max_cpu_capacity
;
6415 /* Minimum capacity is close to max, no need to abort wake_affine */
6416 if (max_cap
- min_cap
< max_cap
>> 3)
6419 /* Bring task utilization in sync with prev_cpu */
6420 sync_entity_load_avg(&p
->se
);
6422 return !task_fits_capacity(p
, min_cap
);
6426 * Predicts what cpu_util(@cpu) would return if @p was migrated (and enqueued)
6429 static unsigned long cpu_util_next(int cpu
, struct task_struct
*p
, int dst_cpu
)
6431 struct cfs_rq
*cfs_rq
= &cpu_rq(cpu
)->cfs
;
6432 unsigned long util_est
, util
= READ_ONCE(cfs_rq
->avg
.util_avg
);
6435 * If @p migrates from @cpu to another, remove its contribution. Or,
6436 * if @p migrates from another CPU to @cpu, add its contribution. In
6437 * the other cases, @cpu is not impacted by the migration, so the
6438 * util_avg should already be correct.
6440 if (task_cpu(p
) == cpu
&& dst_cpu
!= cpu
)
6441 sub_positive(&util
, task_util(p
));
6442 else if (task_cpu(p
) != cpu
&& dst_cpu
== cpu
)
6443 util
+= task_util(p
);
6445 if (sched_feat(UTIL_EST
)) {
6446 util_est
= READ_ONCE(cfs_rq
->avg
.util_est
.enqueued
);
6449 * During wake-up, the task isn't enqueued yet and doesn't
6450 * appear in the cfs_rq->avg.util_est.enqueued of any rq,
6451 * so just add it (if needed) to "simulate" what will be
6452 * cpu_util() after the task has been enqueued.
6455 util_est
+= _task_util_est(p
);
6457 util
= max(util
, util_est
);
6460 return min(util
, capacity_orig_of(cpu
));
6464 * compute_energy(): Estimates the energy that would be consumed if @p was
6465 * migrated to @dst_cpu. compute_energy() predicts what will be the utilization
6466 * landscape of the * CPUs after the task migration, and uses the Energy Model
6467 * to compute what would be the energy if we decided to actually migrate that
6471 compute_energy(struct task_struct
*p
, int dst_cpu
, struct perf_domain
*pd
)
6473 long util
, max_util
, sum_util
, energy
= 0;
6476 for (; pd
; pd
= pd
->next
) {
6477 max_util
= sum_util
= 0;
6479 * The capacity state of CPUs of the current rd can be driven by
6480 * CPUs of another rd if they belong to the same performance
6481 * domain. So, account for the utilization of these CPUs too
6482 * by masking pd with cpu_online_mask instead of the rd span.
6484 * If an entire performance domain is outside of the current rd,
6485 * it will not appear in its pd list and will not be accounted
6486 * by compute_energy().
6488 for_each_cpu_and(cpu
, perf_domain_span(pd
), cpu_online_mask
) {
6489 util
= cpu_util_next(cpu
, p
, dst_cpu
);
6490 util
= schedutil_energy_util(cpu
, util
);
6491 max_util
= max(util
, max_util
);
6495 energy
+= em_pd_energy(pd
->em_pd
, max_util
, sum_util
);
6502 * find_energy_efficient_cpu(): Find most energy-efficient target CPU for the
6503 * waking task. find_energy_efficient_cpu() looks for the CPU with maximum
6504 * spare capacity in each performance domain and uses it as a potential
6505 * candidate to execute the task. Then, it uses the Energy Model to figure
6506 * out which of the CPU candidates is the most energy-efficient.
6508 * The rationale for this heuristic is as follows. In a performance domain,
6509 * all the most energy efficient CPU candidates (according to the Energy
6510 * Model) are those for which we'll request a low frequency. When there are
6511 * several CPUs for which the frequency request will be the same, we don't
6512 * have enough data to break the tie between them, because the Energy Model
6513 * only includes active power costs. With this model, if we assume that
6514 * frequency requests follow utilization (e.g. using schedutil), the CPU with
6515 * the maximum spare capacity in a performance domain is guaranteed to be among
6516 * the best candidates of the performance domain.
6518 * In practice, it could be preferable from an energy standpoint to pack
6519 * small tasks on a CPU in order to let other CPUs go in deeper idle states,
6520 * but that could also hurt our chances to go cluster idle, and we have no
6521 * ways to tell with the current Energy Model if this is actually a good
6522 * idea or not. So, find_energy_efficient_cpu() basically favors
6523 * cluster-packing, and spreading inside a cluster. That should at least be
6524 * a good thing for latency, and this is consistent with the idea that most
6525 * of the energy savings of EAS come from the asymmetry of the system, and
6526 * not so much from breaking the tie between identical CPUs. That's also the
6527 * reason why EAS is enabled in the topology code only for systems where
6528 * SD_ASYM_CPUCAPACITY is set.
6530 * NOTE: Forkees are not accepted in the energy-aware wake-up path because
6531 * they don't have any useful utilization data yet and it's not possible to
6532 * forecast their impact on energy consumption. Consequently, they will be
6533 * placed by find_idlest_cpu() on the least loaded CPU, which might turn out
6534 * to be energy-inefficient in some use-cases. The alternative would be to
6535 * bias new tasks towards specific types of CPUs first, or to try to infer
6536 * their util_avg from the parent task, but those heuristics could hurt
6537 * other use-cases too. So, until someone finds a better way to solve this,
6538 * let's keep things simple by re-using the existing slow path.
6541 static int find_energy_efficient_cpu(struct task_struct
*p
, int prev_cpu
)
6543 unsigned long prev_energy
= ULONG_MAX
, best_energy
= ULONG_MAX
;
6544 struct root_domain
*rd
= cpu_rq(smp_processor_id())->rd
;
6545 int cpu
, best_energy_cpu
= prev_cpu
;
6546 struct perf_domain
*head
, *pd
;
6547 unsigned long cpu_cap
, util
;
6548 struct sched_domain
*sd
;
6551 pd
= rcu_dereference(rd
->pd
);
6552 if (!pd
|| READ_ONCE(rd
->overutilized
))
6557 * Energy-aware wake-up happens on the lowest sched_domain starting
6558 * from sd_asym_cpucapacity spanning over this_cpu and prev_cpu.
6560 sd
= rcu_dereference(*this_cpu_ptr(&sd_asym_cpucapacity
));
6561 while (sd
&& !cpumask_test_cpu(prev_cpu
, sched_domain_span(sd
)))
6566 sync_entity_load_avg(&p
->se
);
6567 if (!task_util_est(p
))
6570 for (; pd
; pd
= pd
->next
) {
6571 unsigned long cur_energy
, spare_cap
, max_spare_cap
= 0;
6572 int max_spare_cap_cpu
= -1;
6574 for_each_cpu_and(cpu
, perf_domain_span(pd
), sched_domain_span(sd
)) {
6575 if (!cpumask_test_cpu(cpu
, &p
->cpus_allowed
))
6578 /* Skip CPUs that will be overutilized. */
6579 util
= cpu_util_next(cpu
, p
, cpu
);
6580 cpu_cap
= capacity_of(cpu
);
6581 if (cpu_cap
* 1024 < util
* capacity_margin
)
6584 /* Always use prev_cpu as a candidate. */
6585 if (cpu
== prev_cpu
) {
6586 prev_energy
= compute_energy(p
, prev_cpu
, head
);
6587 best_energy
= min(best_energy
, prev_energy
);
6592 * Find the CPU with the maximum spare capacity in
6593 * the performance domain
6595 spare_cap
= cpu_cap
- util
;
6596 if (spare_cap
> max_spare_cap
) {
6597 max_spare_cap
= spare_cap
;
6598 max_spare_cap_cpu
= cpu
;
6602 /* Evaluate the energy impact of using this CPU. */
6603 if (max_spare_cap_cpu
>= 0) {
6604 cur_energy
= compute_energy(p
, max_spare_cap_cpu
, head
);
6605 if (cur_energy
< best_energy
) {
6606 best_energy
= cur_energy
;
6607 best_energy_cpu
= max_spare_cap_cpu
;
6615 * Pick the best CPU if prev_cpu cannot be used, or if it saves at
6616 * least 6% of the energy used by prev_cpu.
6618 if (prev_energy
== ULONG_MAX
)
6619 return best_energy_cpu
;
6621 if ((prev_energy
- best_energy
) > (prev_energy
>> 4))
6622 return best_energy_cpu
;
6633 * select_task_rq_fair: Select target runqueue for the waking task in domains
6634 * that have the 'sd_flag' flag set. In practice, this is SD_BALANCE_WAKE,
6635 * SD_BALANCE_FORK, or SD_BALANCE_EXEC.
6637 * Balances load by selecting the idlest CPU in the idlest group, or under
6638 * certain conditions an idle sibling CPU if the domain has SD_WAKE_AFFINE set.
6640 * Returns the target CPU number.
6642 * preempt must be disabled.
6645 select_task_rq_fair(struct task_struct
*p
, int prev_cpu
, int sd_flag
, int wake_flags
)
6647 struct sched_domain
*tmp
, *sd
= NULL
;
6648 int cpu
= smp_processor_id();
6649 int new_cpu
= prev_cpu
;
6650 int want_affine
= 0;
6651 int sync
= (wake_flags
& WF_SYNC
) && !(current
->flags
& PF_EXITING
);
6653 if (sd_flag
& SD_BALANCE_WAKE
) {
6656 if (sched_energy_enabled()) {
6657 new_cpu
= find_energy_efficient_cpu(p
, prev_cpu
);
6663 want_affine
= !wake_wide(p
) && !wake_cap(p
, cpu
, prev_cpu
) &&
6664 cpumask_test_cpu(cpu
, &p
->cpus_allowed
);
6668 for_each_domain(cpu
, tmp
) {
6669 if (!(tmp
->flags
& SD_LOAD_BALANCE
))
6673 * If both 'cpu' and 'prev_cpu' are part of this domain,
6674 * cpu is a valid SD_WAKE_AFFINE target.
6676 if (want_affine
&& (tmp
->flags
& SD_WAKE_AFFINE
) &&
6677 cpumask_test_cpu(prev_cpu
, sched_domain_span(tmp
))) {
6678 if (cpu
!= prev_cpu
)
6679 new_cpu
= wake_affine(tmp
, p
, cpu
, prev_cpu
, sync
);
6681 sd
= NULL
; /* Prefer wake_affine over balance flags */
6685 if (tmp
->flags
& sd_flag
)
6687 else if (!want_affine
)
6693 new_cpu
= find_idlest_cpu(sd
, p
, cpu
, prev_cpu
, sd_flag
);
6694 } else if (sd_flag
& SD_BALANCE_WAKE
) { /* XXX always ? */
6697 new_cpu
= select_idle_sibling(p
, prev_cpu
, new_cpu
);
6700 current
->recent_used_cpu
= cpu
;
6707 static void detach_entity_cfs_rq(struct sched_entity
*se
);
6710 * Called immediately before a task is migrated to a new CPU; task_cpu(p) and
6711 * cfs_rq_of(p) references at time of call are still valid and identify the
6712 * previous CPU. The caller guarantees p->pi_lock or task_rq(p)->lock is held.
6714 static void migrate_task_rq_fair(struct task_struct
*p
, int new_cpu
)
6717 * As blocked tasks retain absolute vruntime the migration needs to
6718 * deal with this by subtracting the old and adding the new
6719 * min_vruntime -- the latter is done by enqueue_entity() when placing
6720 * the task on the new runqueue.
6722 if (p
->state
== TASK_WAKING
) {
6723 struct sched_entity
*se
= &p
->se
;
6724 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
6727 #ifndef CONFIG_64BIT
6728 u64 min_vruntime_copy
;
6731 min_vruntime_copy
= cfs_rq
->min_vruntime_copy
;
6733 min_vruntime
= cfs_rq
->min_vruntime
;
6734 } while (min_vruntime
!= min_vruntime_copy
);
6736 min_vruntime
= cfs_rq
->min_vruntime
;
6739 se
->vruntime
-= min_vruntime
;
6742 if (p
->on_rq
== TASK_ON_RQ_MIGRATING
) {
6744 * In case of TASK_ON_RQ_MIGRATING we in fact hold the 'old'
6745 * rq->lock and can modify state directly.
6747 lockdep_assert_held(&task_rq(p
)->lock
);
6748 detach_entity_cfs_rq(&p
->se
);
6752 * We are supposed to update the task to "current" time, then
6753 * its up to date and ready to go to new CPU/cfs_rq. But we
6754 * have difficulty in getting what current time is, so simply
6755 * throw away the out-of-date time. This will result in the
6756 * wakee task is less decayed, but giving the wakee more load
6759 remove_entity_load_avg(&p
->se
);
6762 /* Tell new CPU we are migrated */
6763 p
->se
.avg
.last_update_time
= 0;
6765 /* We have migrated, no longer consider this task hot */
6766 p
->se
.exec_start
= 0;
6768 update_scan_period(p
, new_cpu
);
6771 static void task_dead_fair(struct task_struct
*p
)
6773 remove_entity_load_avg(&p
->se
);
6775 #endif /* CONFIG_SMP */
6777 static unsigned long wakeup_gran(struct sched_entity
*se
)
6779 unsigned long gran
= sysctl_sched_wakeup_granularity
;
6782 * Since its curr running now, convert the gran from real-time
6783 * to virtual-time in his units.
6785 * By using 'se' instead of 'curr' we penalize light tasks, so
6786 * they get preempted easier. That is, if 'se' < 'curr' then
6787 * the resulting gran will be larger, therefore penalizing the
6788 * lighter, if otoh 'se' > 'curr' then the resulting gran will
6789 * be smaller, again penalizing the lighter task.
6791 * This is especially important for buddies when the leftmost
6792 * task is higher priority than the buddy.
6794 return calc_delta_fair(gran
, se
);
6798 * Should 'se' preempt 'curr'.
6812 wakeup_preempt_entity(struct sched_entity
*curr
, struct sched_entity
*se
)
6814 s64 gran
, vdiff
= curr
->vruntime
- se
->vruntime
;
6819 gran
= wakeup_gran(se
);
6826 static void set_last_buddy(struct sched_entity
*se
)
6828 if (entity_is_task(se
) && unlikely(task_has_idle_policy(task_of(se
))))
6831 for_each_sched_entity(se
) {
6832 if (SCHED_WARN_ON(!se
->on_rq
))
6834 cfs_rq_of(se
)->last
= se
;
6838 static void set_next_buddy(struct sched_entity
*se
)
6840 if (entity_is_task(se
) && unlikely(task_has_idle_policy(task_of(se
))))
6843 for_each_sched_entity(se
) {
6844 if (SCHED_WARN_ON(!se
->on_rq
))
6846 cfs_rq_of(se
)->next
= se
;
6850 static void set_skip_buddy(struct sched_entity
*se
)
6852 for_each_sched_entity(se
)
6853 cfs_rq_of(se
)->skip
= se
;
6857 * Preempt the current task with a newly woken task if needed:
6859 static void check_preempt_wakeup(struct rq
*rq
, struct task_struct
*p
, int wake_flags
)
6861 struct task_struct
*curr
= rq
->curr
;
6862 struct sched_entity
*se
= &curr
->se
, *pse
= &p
->se
;
6863 struct cfs_rq
*cfs_rq
= task_cfs_rq(curr
);
6864 int scale
= cfs_rq
->nr_running
>= sched_nr_latency
;
6865 int next_buddy_marked
= 0;
6867 if (unlikely(se
== pse
))
6871 * This is possible from callers such as attach_tasks(), in which we
6872 * unconditionally check_prempt_curr() after an enqueue (which may have
6873 * lead to a throttle). This both saves work and prevents false
6874 * next-buddy nomination below.
6876 if (unlikely(throttled_hierarchy(cfs_rq_of(pse
))))
6879 if (sched_feat(NEXT_BUDDY
) && scale
&& !(wake_flags
& WF_FORK
)) {
6880 set_next_buddy(pse
);
6881 next_buddy_marked
= 1;
6885 * We can come here with TIF_NEED_RESCHED already set from new task
6888 * Note: this also catches the edge-case of curr being in a throttled
6889 * group (e.g. via set_curr_task), since update_curr() (in the
6890 * enqueue of curr) will have resulted in resched being set. This
6891 * prevents us from potentially nominating it as a false LAST_BUDDY
6894 if (test_tsk_need_resched(curr
))
6897 /* Idle tasks are by definition preempted by non-idle tasks. */
6898 if (unlikely(task_has_idle_policy(curr
)) &&
6899 likely(!task_has_idle_policy(p
)))
6903 * Batch and idle tasks do not preempt non-idle tasks (their preemption
6904 * is driven by the tick):
6906 if (unlikely(p
->policy
!= SCHED_NORMAL
) || !sched_feat(WAKEUP_PREEMPTION
))
6909 find_matching_se(&se
, &pse
);
6910 update_curr(cfs_rq_of(se
));
6912 if (wakeup_preempt_entity(se
, pse
) == 1) {
6914 * Bias pick_next to pick the sched entity that is
6915 * triggering this preemption.
6917 if (!next_buddy_marked
)
6918 set_next_buddy(pse
);
6927 * Only set the backward buddy when the current task is still
6928 * on the rq. This can happen when a wakeup gets interleaved
6929 * with schedule on the ->pre_schedule() or idle_balance()
6930 * point, either of which can * drop the rq lock.
6932 * Also, during early boot the idle thread is in the fair class,
6933 * for obvious reasons its a bad idea to schedule back to it.
6935 if (unlikely(!se
->on_rq
|| curr
== rq
->idle
))
6938 if (sched_feat(LAST_BUDDY
) && scale
&& entity_is_task(se
))
6942 static struct task_struct
*
6943 pick_next_task_fair(struct rq
*rq
, struct task_struct
*prev
, struct rq_flags
*rf
)
6945 struct cfs_rq
*cfs_rq
= &rq
->cfs
;
6946 struct sched_entity
*se
;
6947 struct task_struct
*p
;
6951 if (!cfs_rq
->nr_running
)
6954 #ifdef CONFIG_FAIR_GROUP_SCHED
6955 if (prev
->sched_class
!= &fair_sched_class
)
6959 * Because of the set_next_buddy() in dequeue_task_fair() it is rather
6960 * likely that a next task is from the same cgroup as the current.
6962 * Therefore attempt to avoid putting and setting the entire cgroup
6963 * hierarchy, only change the part that actually changes.
6967 struct sched_entity
*curr
= cfs_rq
->curr
;
6970 * Since we got here without doing put_prev_entity() we also
6971 * have to consider cfs_rq->curr. If it is still a runnable
6972 * entity, update_curr() will update its vruntime, otherwise
6973 * forget we've ever seen it.
6977 update_curr(cfs_rq
);
6982 * This call to check_cfs_rq_runtime() will do the
6983 * throttle and dequeue its entity in the parent(s).
6984 * Therefore the nr_running test will indeed
6987 if (unlikely(check_cfs_rq_runtime(cfs_rq
))) {
6990 if (!cfs_rq
->nr_running
)
6997 se
= pick_next_entity(cfs_rq
, curr
);
6998 cfs_rq
= group_cfs_rq(se
);
7004 * Since we haven't yet done put_prev_entity and if the selected task
7005 * is a different task than we started out with, try and touch the
7006 * least amount of cfs_rqs.
7009 struct sched_entity
*pse
= &prev
->se
;
7011 while (!(cfs_rq
= is_same_group(se
, pse
))) {
7012 int se_depth
= se
->depth
;
7013 int pse_depth
= pse
->depth
;
7015 if (se_depth
<= pse_depth
) {
7016 put_prev_entity(cfs_rq_of(pse
), pse
);
7017 pse
= parent_entity(pse
);
7019 if (se_depth
>= pse_depth
) {
7020 set_next_entity(cfs_rq_of(se
), se
);
7021 se
= parent_entity(se
);
7025 put_prev_entity(cfs_rq
, pse
);
7026 set_next_entity(cfs_rq
, se
);
7033 put_prev_task(rq
, prev
);
7036 se
= pick_next_entity(cfs_rq
, NULL
);
7037 set_next_entity(cfs_rq
, se
);
7038 cfs_rq
= group_cfs_rq(se
);
7043 done
: __maybe_unused
;
7046 * Move the next running task to the front of
7047 * the list, so our cfs_tasks list becomes MRU
7050 list_move(&p
->se
.group_node
, &rq
->cfs_tasks
);
7053 if (hrtick_enabled(rq
))
7054 hrtick_start_fair(rq
, p
);
7056 update_misfit_status(p
, rq
);
7061 update_misfit_status(NULL
, rq
);
7062 new_tasks
= idle_balance(rq
, rf
);
7065 * Because idle_balance() releases (and re-acquires) rq->lock, it is
7066 * possible for any higher priority task to appear. In that case we
7067 * must re-start the pick_next_entity() loop.
7076 * rq is about to be idle, check if we need to update the
7077 * lost_idle_time of clock_pelt
7079 update_idle_rq_clock_pelt(rq
);
7085 * Account for a descheduled task:
7087 static void put_prev_task_fair(struct rq
*rq
, struct task_struct
*prev
)
7089 struct sched_entity
*se
= &prev
->se
;
7090 struct cfs_rq
*cfs_rq
;
7092 for_each_sched_entity(se
) {
7093 cfs_rq
= cfs_rq_of(se
);
7094 put_prev_entity(cfs_rq
, se
);
7099 * sched_yield() is very simple
7101 * The magic of dealing with the ->skip buddy is in pick_next_entity.
7103 static void yield_task_fair(struct rq
*rq
)
7105 struct task_struct
*curr
= rq
->curr
;
7106 struct cfs_rq
*cfs_rq
= task_cfs_rq(curr
);
7107 struct sched_entity
*se
= &curr
->se
;
7110 * Are we the only task in the tree?
7112 if (unlikely(rq
->nr_running
== 1))
7115 clear_buddies(cfs_rq
, se
);
7117 if (curr
->policy
!= SCHED_BATCH
) {
7118 update_rq_clock(rq
);
7120 * Update run-time statistics of the 'current'.
7122 update_curr(cfs_rq
);
7124 * Tell update_rq_clock() that we've just updated,
7125 * so we don't do microscopic update in schedule()
7126 * and double the fastpath cost.
7128 rq_clock_skip_update(rq
);
7134 static bool yield_to_task_fair(struct rq
*rq
, struct task_struct
*p
, bool preempt
)
7136 struct sched_entity
*se
= &p
->se
;
7138 /* throttled hierarchies are not runnable */
7139 if (!se
->on_rq
|| throttled_hierarchy(cfs_rq_of(se
)))
7142 /* Tell the scheduler that we'd really like pse to run next. */
7145 yield_task_fair(rq
);
7151 /**************************************************
7152 * Fair scheduling class load-balancing methods.
7156 * The purpose of load-balancing is to achieve the same basic fairness the
7157 * per-CPU scheduler provides, namely provide a proportional amount of compute
7158 * time to each task. This is expressed in the following equation:
7160 * W_i,n/P_i == W_j,n/P_j for all i,j (1)
7162 * Where W_i,n is the n-th weight average for CPU i. The instantaneous weight
7163 * W_i,0 is defined as:
7165 * W_i,0 = \Sum_j w_i,j (2)
7167 * Where w_i,j is the weight of the j-th runnable task on CPU i. This weight
7168 * is derived from the nice value as per sched_prio_to_weight[].
7170 * The weight average is an exponential decay average of the instantaneous
7173 * W'_i,n = (2^n - 1) / 2^n * W_i,n + 1 / 2^n * W_i,0 (3)
7175 * C_i is the compute capacity of CPU i, typically it is the
7176 * fraction of 'recent' time available for SCHED_OTHER task execution. But it
7177 * can also include other factors [XXX].
7179 * To achieve this balance we define a measure of imbalance which follows
7180 * directly from (1):
7182 * imb_i,j = max{ avg(W/C), W_i/C_i } - min{ avg(W/C), W_j/C_j } (4)
7184 * We them move tasks around to minimize the imbalance. In the continuous
7185 * function space it is obvious this converges, in the discrete case we get
7186 * a few fun cases generally called infeasible weight scenarios.
7189 * - infeasible weights;
7190 * - local vs global optima in the discrete case. ]
7195 * In order to solve the imbalance equation (4), and avoid the obvious O(n^2)
7196 * for all i,j solution, we create a tree of CPUs that follows the hardware
7197 * topology where each level pairs two lower groups (or better). This results
7198 * in O(log n) layers. Furthermore we reduce the number of CPUs going up the
7199 * tree to only the first of the previous level and we decrease the frequency
7200 * of load-balance at each level inv. proportional to the number of CPUs in
7206 * \Sum { --- * --- * 2^i } = O(n) (5)
7208 * `- size of each group
7209 * | | `- number of CPUs doing load-balance
7211 * `- sum over all levels
7213 * Coupled with a limit on how many tasks we can migrate every balance pass,
7214 * this makes (5) the runtime complexity of the balancer.
7216 * An important property here is that each CPU is still (indirectly) connected
7217 * to every other CPU in at most O(log n) steps:
7219 * The adjacency matrix of the resulting graph is given by:
7222 * A_i,j = \Union (i % 2^k == 0) && i / 2^(k+1) == j / 2^(k+1) (6)
7225 * And you'll find that:
7227 * A^(log_2 n)_i,j != 0 for all i,j (7)
7229 * Showing there's indeed a path between every CPU in at most O(log n) steps.
7230 * The task movement gives a factor of O(m), giving a convergence complexity
7233 * O(nm log n), n := nr_cpus, m := nr_tasks (8)
7238 * In order to avoid CPUs going idle while there's still work to do, new idle
7239 * balancing is more aggressive and has the newly idle CPU iterate up the domain
7240 * tree itself instead of relying on other CPUs to bring it work.
7242 * This adds some complexity to both (5) and (8) but it reduces the total idle
7250 * Cgroups make a horror show out of (2), instead of a simple sum we get:
7253 * W_i,0 = \Sum_j \Prod_k w_k * ----- (9)
7258 * s_k,i = \Sum_j w_i,j,k and S_k = \Sum_i s_k,i (10)
7260 * w_i,j,k is the weight of the j-th runnable task in the k-th cgroup on CPU i.
7262 * The big problem is S_k, its a global sum needed to compute a local (W_i)
7265 * [XXX write more on how we solve this.. _after_ merging pjt's patches that
7266 * rewrite all of this once again.]
7269 static unsigned long __read_mostly max_load_balance_interval
= HZ
/10;
7271 enum fbq_type
{ regular
, remote
, all
};
7280 #define LBF_ALL_PINNED 0x01
7281 #define LBF_NEED_BREAK 0x02
7282 #define LBF_DST_PINNED 0x04
7283 #define LBF_SOME_PINNED 0x08
7284 #define LBF_NOHZ_STATS 0x10
7285 #define LBF_NOHZ_AGAIN 0x20
7288 struct sched_domain
*sd
;
7296 struct cpumask
*dst_grpmask
;
7298 enum cpu_idle_type idle
;
7300 /* The set of CPUs under consideration for load-balancing */
7301 struct cpumask
*cpus
;
7306 unsigned int loop_break
;
7307 unsigned int loop_max
;
7309 enum fbq_type fbq_type
;
7310 enum group_type src_grp_type
;
7311 struct list_head tasks
;
7315 * Is this task likely cache-hot:
7317 static int task_hot(struct task_struct
*p
, struct lb_env
*env
)
7321 lockdep_assert_held(&env
->src_rq
->lock
);
7323 if (p
->sched_class
!= &fair_sched_class
)
7326 if (unlikely(task_has_idle_policy(p
)))
7330 * Buddy candidates are cache hot:
7332 if (sched_feat(CACHE_HOT_BUDDY
) && env
->dst_rq
->nr_running
&&
7333 (&p
->se
== cfs_rq_of(&p
->se
)->next
||
7334 &p
->se
== cfs_rq_of(&p
->se
)->last
))
7337 if (sysctl_sched_migration_cost
== -1)
7339 if (sysctl_sched_migration_cost
== 0)
7342 delta
= rq_clock_task(env
->src_rq
) - p
->se
.exec_start
;
7344 return delta
< (s64
)sysctl_sched_migration_cost
;
7347 #ifdef CONFIG_NUMA_BALANCING
7349 * Returns 1, if task migration degrades locality
7350 * Returns 0, if task migration improves locality i.e migration preferred.
7351 * Returns -1, if task migration is not affected by locality.
7353 static int migrate_degrades_locality(struct task_struct
*p
, struct lb_env
*env
)
7355 struct numa_group
*numa_group
= rcu_dereference(p
->numa_group
);
7356 unsigned long src_weight
, dst_weight
;
7357 int src_nid
, dst_nid
, dist
;
7359 if (!static_branch_likely(&sched_numa_balancing
))
7362 if (!p
->numa_faults
|| !(env
->sd
->flags
& SD_NUMA
))
7365 src_nid
= cpu_to_node(env
->src_cpu
);
7366 dst_nid
= cpu_to_node(env
->dst_cpu
);
7368 if (src_nid
== dst_nid
)
7371 /* Migrating away from the preferred node is always bad. */
7372 if (src_nid
== p
->numa_preferred_nid
) {
7373 if (env
->src_rq
->nr_running
> env
->src_rq
->nr_preferred_running
)
7379 /* Encourage migration to the preferred node. */
7380 if (dst_nid
== p
->numa_preferred_nid
)
7383 /* Leaving a core idle is often worse than degrading locality. */
7384 if (env
->idle
== CPU_IDLE
)
7387 dist
= node_distance(src_nid
, dst_nid
);
7389 src_weight
= group_weight(p
, src_nid
, dist
);
7390 dst_weight
= group_weight(p
, dst_nid
, dist
);
7392 src_weight
= task_weight(p
, src_nid
, dist
);
7393 dst_weight
= task_weight(p
, dst_nid
, dist
);
7396 return dst_weight
< src_weight
;
7400 static inline int migrate_degrades_locality(struct task_struct
*p
,
7408 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
7411 int can_migrate_task(struct task_struct
*p
, struct lb_env
*env
)
7415 lockdep_assert_held(&env
->src_rq
->lock
);
7418 * We do not migrate tasks that are:
7419 * 1) throttled_lb_pair, or
7420 * 2) cannot be migrated to this CPU due to cpus_allowed, or
7421 * 3) running (obviously), or
7422 * 4) are cache-hot on their current CPU.
7424 if (throttled_lb_pair(task_group(p
), env
->src_cpu
, env
->dst_cpu
))
7427 if (!cpumask_test_cpu(env
->dst_cpu
, &p
->cpus_allowed
)) {
7430 schedstat_inc(p
->se
.statistics
.nr_failed_migrations_affine
);
7432 env
->flags
|= LBF_SOME_PINNED
;
7435 * Remember if this task can be migrated to any other CPU in
7436 * our sched_group. We may want to revisit it if we couldn't
7437 * meet load balance goals by pulling other tasks on src_cpu.
7439 * Avoid computing new_dst_cpu for NEWLY_IDLE or if we have
7440 * already computed one in current iteration.
7442 if (env
->idle
== CPU_NEWLY_IDLE
|| (env
->flags
& LBF_DST_PINNED
))
7445 /* Prevent to re-select dst_cpu via env's CPUs: */
7446 for_each_cpu_and(cpu
, env
->dst_grpmask
, env
->cpus
) {
7447 if (cpumask_test_cpu(cpu
, &p
->cpus_allowed
)) {
7448 env
->flags
|= LBF_DST_PINNED
;
7449 env
->new_dst_cpu
= cpu
;
7457 /* Record that we found atleast one task that could run on dst_cpu */
7458 env
->flags
&= ~LBF_ALL_PINNED
;
7460 if (task_running(env
->src_rq
, p
)) {
7461 schedstat_inc(p
->se
.statistics
.nr_failed_migrations_running
);
7466 * Aggressive migration if:
7467 * 1) destination numa is preferred
7468 * 2) task is cache cold, or
7469 * 3) too many balance attempts have failed.
7471 tsk_cache_hot
= migrate_degrades_locality(p
, env
);
7472 if (tsk_cache_hot
== -1)
7473 tsk_cache_hot
= task_hot(p
, env
);
7475 if (tsk_cache_hot
<= 0 ||
7476 env
->sd
->nr_balance_failed
> env
->sd
->cache_nice_tries
) {
7477 if (tsk_cache_hot
== 1) {
7478 schedstat_inc(env
->sd
->lb_hot_gained
[env
->idle
]);
7479 schedstat_inc(p
->se
.statistics
.nr_forced_migrations
);
7484 schedstat_inc(p
->se
.statistics
.nr_failed_migrations_hot
);
7489 * detach_task() -- detach the task for the migration specified in env
7491 static void detach_task(struct task_struct
*p
, struct lb_env
*env
)
7493 lockdep_assert_held(&env
->src_rq
->lock
);
7495 p
->on_rq
= TASK_ON_RQ_MIGRATING
;
7496 deactivate_task(env
->src_rq
, p
, DEQUEUE_NOCLOCK
);
7497 set_task_cpu(p
, env
->dst_cpu
);
7501 * detach_one_task() -- tries to dequeue exactly one task from env->src_rq, as
7502 * part of active balancing operations within "domain".
7504 * Returns a task if successful and NULL otherwise.
7506 static struct task_struct
*detach_one_task(struct lb_env
*env
)
7508 struct task_struct
*p
;
7510 lockdep_assert_held(&env
->src_rq
->lock
);
7512 list_for_each_entry_reverse(p
,
7513 &env
->src_rq
->cfs_tasks
, se
.group_node
) {
7514 if (!can_migrate_task(p
, env
))
7517 detach_task(p
, env
);
7520 * Right now, this is only the second place where
7521 * lb_gained[env->idle] is updated (other is detach_tasks)
7522 * so we can safely collect stats here rather than
7523 * inside detach_tasks().
7525 schedstat_inc(env
->sd
->lb_gained
[env
->idle
]);
7531 static const unsigned int sched_nr_migrate_break
= 32;
7534 * detach_tasks() -- tries to detach up to imbalance weighted load from
7535 * busiest_rq, as part of a balancing operation within domain "sd".
7537 * Returns number of detached tasks if successful and 0 otherwise.
7539 static int detach_tasks(struct lb_env
*env
)
7541 struct list_head
*tasks
= &env
->src_rq
->cfs_tasks
;
7542 struct task_struct
*p
;
7546 lockdep_assert_held(&env
->src_rq
->lock
);
7548 if (env
->imbalance
<= 0)
7551 while (!list_empty(tasks
)) {
7553 * We don't want to steal all, otherwise we may be treated likewise,
7554 * which could at worst lead to a livelock crash.
7556 if (env
->idle
!= CPU_NOT_IDLE
&& env
->src_rq
->nr_running
<= 1)
7559 p
= list_last_entry(tasks
, struct task_struct
, se
.group_node
);
7562 /* We've more or less seen every task there is, call it quits */
7563 if (env
->loop
> env
->loop_max
)
7566 /* take a breather every nr_migrate tasks */
7567 if (env
->loop
> env
->loop_break
) {
7568 env
->loop_break
+= sched_nr_migrate_break
;
7569 env
->flags
|= LBF_NEED_BREAK
;
7573 if (!can_migrate_task(p
, env
))
7576 load
= task_h_load(p
);
7578 if (sched_feat(LB_MIN
) && load
< 16 && !env
->sd
->nr_balance_failed
)
7581 if ((load
/ 2) > env
->imbalance
)
7584 detach_task(p
, env
);
7585 list_add(&p
->se
.group_node
, &env
->tasks
);
7588 env
->imbalance
-= load
;
7590 #ifdef CONFIG_PREEMPT
7592 * NEWIDLE balancing is a source of latency, so preemptible
7593 * kernels will stop after the first task is detached to minimize
7594 * the critical section.
7596 if (env
->idle
== CPU_NEWLY_IDLE
)
7601 * We only want to steal up to the prescribed amount of
7604 if (env
->imbalance
<= 0)
7609 list_move(&p
->se
.group_node
, tasks
);
7613 * Right now, this is one of only two places we collect this stat
7614 * so we can safely collect detach_one_task() stats here rather
7615 * than inside detach_one_task().
7617 schedstat_add(env
->sd
->lb_gained
[env
->idle
], detached
);
7623 * attach_task() -- attach the task detached by detach_task() to its new rq.
7625 static void attach_task(struct rq
*rq
, struct task_struct
*p
)
7627 lockdep_assert_held(&rq
->lock
);
7629 BUG_ON(task_rq(p
) != rq
);
7630 activate_task(rq
, p
, ENQUEUE_NOCLOCK
);
7631 p
->on_rq
= TASK_ON_RQ_QUEUED
;
7632 check_preempt_curr(rq
, p
, 0);
7636 * attach_one_task() -- attaches the task returned from detach_one_task() to
7639 static void attach_one_task(struct rq
*rq
, struct task_struct
*p
)
7644 update_rq_clock(rq
);
7650 * attach_tasks() -- attaches all tasks detached by detach_tasks() to their
7653 static void attach_tasks(struct lb_env
*env
)
7655 struct list_head
*tasks
= &env
->tasks
;
7656 struct task_struct
*p
;
7659 rq_lock(env
->dst_rq
, &rf
);
7660 update_rq_clock(env
->dst_rq
);
7662 while (!list_empty(tasks
)) {
7663 p
= list_first_entry(tasks
, struct task_struct
, se
.group_node
);
7664 list_del_init(&p
->se
.group_node
);
7666 attach_task(env
->dst_rq
, p
);
7669 rq_unlock(env
->dst_rq
, &rf
);
7672 static inline bool cfs_rq_has_blocked(struct cfs_rq
*cfs_rq
)
7674 if (cfs_rq
->avg
.load_avg
)
7677 if (cfs_rq
->avg
.util_avg
)
7683 static inline bool others_have_blocked(struct rq
*rq
)
7685 if (READ_ONCE(rq
->avg_rt
.util_avg
))
7688 if (READ_ONCE(rq
->avg_dl
.util_avg
))
7691 #ifdef CONFIG_HAVE_SCHED_AVG_IRQ
7692 if (READ_ONCE(rq
->avg_irq
.util_avg
))
7699 #ifdef CONFIG_FAIR_GROUP_SCHED
7701 static inline bool cfs_rq_is_decayed(struct cfs_rq
*cfs_rq
)
7703 if (cfs_rq
->load
.weight
)
7706 if (cfs_rq
->avg
.load_sum
)
7709 if (cfs_rq
->avg
.util_sum
)
7712 if (cfs_rq
->avg
.runnable_load_sum
)
7718 static void update_blocked_averages(int cpu
)
7720 struct rq
*rq
= cpu_rq(cpu
);
7721 struct cfs_rq
*cfs_rq
, *pos
;
7722 const struct sched_class
*curr_class
;
7726 rq_lock_irqsave(rq
, &rf
);
7727 update_rq_clock(rq
);
7730 * Iterates the task_group tree in a bottom up fashion, see
7731 * list_add_leaf_cfs_rq() for details.
7733 for_each_leaf_cfs_rq_safe(rq
, cfs_rq
, pos
) {
7734 struct sched_entity
*se
;
7736 if (update_cfs_rq_load_avg(cfs_rq_clock_pelt(cfs_rq
), cfs_rq
))
7737 update_tg_load_avg(cfs_rq
, 0);
7739 /* Propagate pending load changes to the parent, if any: */
7740 se
= cfs_rq
->tg
->se
[cpu
];
7741 if (se
&& !skip_blocked_update(se
))
7742 update_load_avg(cfs_rq_of(se
), se
, 0);
7745 * There can be a lot of idle CPU cgroups. Don't let fully
7746 * decayed cfs_rqs linger on the list.
7748 if (cfs_rq_is_decayed(cfs_rq
))
7749 list_del_leaf_cfs_rq(cfs_rq
);
7751 /* Don't need periodic decay once load/util_avg are null */
7752 if (cfs_rq_has_blocked(cfs_rq
))
7756 curr_class
= rq
->curr
->sched_class
;
7757 update_rt_rq_load_avg(rq_clock_pelt(rq
), rq
, curr_class
== &rt_sched_class
);
7758 update_dl_rq_load_avg(rq_clock_pelt(rq
), rq
, curr_class
== &dl_sched_class
);
7759 update_irq_load_avg(rq
, 0);
7760 /* Don't need periodic decay once load/util_avg are null */
7761 if (others_have_blocked(rq
))
7764 #ifdef CONFIG_NO_HZ_COMMON
7765 rq
->last_blocked_load_update_tick
= jiffies
;
7767 rq
->has_blocked_load
= 0;
7769 rq_unlock_irqrestore(rq
, &rf
);
7773 * Compute the hierarchical load factor for cfs_rq and all its ascendants.
7774 * This needs to be done in a top-down fashion because the load of a child
7775 * group is a fraction of its parents load.
7777 static void update_cfs_rq_h_load(struct cfs_rq
*cfs_rq
)
7779 struct rq
*rq
= rq_of(cfs_rq
);
7780 struct sched_entity
*se
= cfs_rq
->tg
->se
[cpu_of(rq
)];
7781 unsigned long now
= jiffies
;
7784 if (cfs_rq
->last_h_load_update
== now
)
7787 cfs_rq
->h_load_next
= NULL
;
7788 for_each_sched_entity(se
) {
7789 cfs_rq
= cfs_rq_of(se
);
7790 cfs_rq
->h_load_next
= se
;
7791 if (cfs_rq
->last_h_load_update
== now
)
7796 cfs_rq
->h_load
= cfs_rq_load_avg(cfs_rq
);
7797 cfs_rq
->last_h_load_update
= now
;
7800 while ((se
= cfs_rq
->h_load_next
) != NULL
) {
7801 load
= cfs_rq
->h_load
;
7802 load
= div64_ul(load
* se
->avg
.load_avg
,
7803 cfs_rq_load_avg(cfs_rq
) + 1);
7804 cfs_rq
= group_cfs_rq(se
);
7805 cfs_rq
->h_load
= load
;
7806 cfs_rq
->last_h_load_update
= now
;
7810 static unsigned long task_h_load(struct task_struct
*p
)
7812 struct cfs_rq
*cfs_rq
= task_cfs_rq(p
);
7814 update_cfs_rq_h_load(cfs_rq
);
7815 return div64_ul(p
->se
.avg
.load_avg
* cfs_rq
->h_load
,
7816 cfs_rq_load_avg(cfs_rq
) + 1);
7819 static inline void update_blocked_averages(int cpu
)
7821 struct rq
*rq
= cpu_rq(cpu
);
7822 struct cfs_rq
*cfs_rq
= &rq
->cfs
;
7823 const struct sched_class
*curr_class
;
7826 rq_lock_irqsave(rq
, &rf
);
7827 update_rq_clock(rq
);
7828 update_cfs_rq_load_avg(cfs_rq_clock_pelt(cfs_rq
), cfs_rq
);
7830 curr_class
= rq
->curr
->sched_class
;
7831 update_rt_rq_load_avg(rq_clock_pelt(rq
), rq
, curr_class
== &rt_sched_class
);
7832 update_dl_rq_load_avg(rq_clock_pelt(rq
), rq
, curr_class
== &dl_sched_class
);
7833 update_irq_load_avg(rq
, 0);
7834 #ifdef CONFIG_NO_HZ_COMMON
7835 rq
->last_blocked_load_update_tick
= jiffies
;
7836 if (!cfs_rq_has_blocked(cfs_rq
) && !others_have_blocked(rq
))
7837 rq
->has_blocked_load
= 0;
7839 rq_unlock_irqrestore(rq
, &rf
);
7842 static unsigned long task_h_load(struct task_struct
*p
)
7844 return p
->se
.avg
.load_avg
;
7848 /********** Helpers for find_busiest_group ************************/
7851 * sg_lb_stats - stats of a sched_group required for load_balancing
7853 struct sg_lb_stats
{
7854 unsigned long avg_load
; /*Avg load across the CPUs of the group */
7855 unsigned long group_load
; /* Total load over the CPUs of the group */
7856 unsigned long sum_weighted_load
; /* Weighted load of group's tasks */
7857 unsigned long load_per_task
;
7858 unsigned long group_capacity
;
7859 unsigned long group_util
; /* Total utilization of the group */
7860 unsigned int sum_nr_running
; /* Nr tasks running in the group */
7861 unsigned int idle_cpus
;
7862 unsigned int group_weight
;
7863 enum group_type group_type
;
7864 int group_no_capacity
;
7865 unsigned long group_misfit_task_load
; /* A CPU has a task too big for its capacity */
7866 #ifdef CONFIG_NUMA_BALANCING
7867 unsigned int nr_numa_running
;
7868 unsigned int nr_preferred_running
;
7873 * sd_lb_stats - Structure to store the statistics of a sched_domain
7874 * during load balancing.
7876 struct sd_lb_stats
{
7877 struct sched_group
*busiest
; /* Busiest group in this sd */
7878 struct sched_group
*local
; /* Local group in this sd */
7879 unsigned long total_running
;
7880 unsigned long total_load
; /* Total load of all groups in sd */
7881 unsigned long total_capacity
; /* Total capacity of all groups in sd */
7882 unsigned long avg_load
; /* Average load across all groups in sd */
7884 struct sg_lb_stats busiest_stat
;/* Statistics of the busiest group */
7885 struct sg_lb_stats local_stat
; /* Statistics of the local group */
7888 static inline void init_sd_lb_stats(struct sd_lb_stats
*sds
)
7891 * Skimp on the clearing to avoid duplicate work. We can avoid clearing
7892 * local_stat because update_sg_lb_stats() does a full clear/assignment.
7893 * We must however clear busiest_stat::avg_load because
7894 * update_sd_pick_busiest() reads this before assignment.
7896 *sds
= (struct sd_lb_stats
){
7899 .total_running
= 0UL,
7901 .total_capacity
= 0UL,
7904 .sum_nr_running
= 0,
7905 .group_type
= group_other
,
7911 * get_sd_load_idx - Obtain the load index for a given sched domain.
7912 * @sd: The sched_domain whose load_idx is to be obtained.
7913 * @idle: The idle status of the CPU for whose sd load_idx is obtained.
7915 * Return: The load index.
7917 static inline int get_sd_load_idx(struct sched_domain
*sd
,
7918 enum cpu_idle_type idle
)
7924 load_idx
= sd
->busy_idx
;
7927 case CPU_NEWLY_IDLE
:
7928 load_idx
= sd
->newidle_idx
;
7931 load_idx
= sd
->idle_idx
;
7938 static unsigned long scale_rt_capacity(struct sched_domain
*sd
, int cpu
)
7940 struct rq
*rq
= cpu_rq(cpu
);
7941 unsigned long max
= arch_scale_cpu_capacity(sd
, cpu
);
7942 unsigned long used
, free
;
7945 irq
= cpu_util_irq(rq
);
7947 if (unlikely(irq
>= max
))
7950 used
= READ_ONCE(rq
->avg_rt
.util_avg
);
7951 used
+= READ_ONCE(rq
->avg_dl
.util_avg
);
7953 if (unlikely(used
>= max
))
7958 return scale_irq_capacity(free
, irq
, max
);
7961 static void update_cpu_capacity(struct sched_domain
*sd
, int cpu
)
7963 unsigned long capacity
= scale_rt_capacity(sd
, cpu
);
7964 struct sched_group
*sdg
= sd
->groups
;
7966 cpu_rq(cpu
)->cpu_capacity_orig
= arch_scale_cpu_capacity(sd
, cpu
);
7971 cpu_rq(cpu
)->cpu_capacity
= capacity
;
7972 sdg
->sgc
->capacity
= capacity
;
7973 sdg
->sgc
->min_capacity
= capacity
;
7974 sdg
->sgc
->max_capacity
= capacity
;
7977 void update_group_capacity(struct sched_domain
*sd
, int cpu
)
7979 struct sched_domain
*child
= sd
->child
;
7980 struct sched_group
*group
, *sdg
= sd
->groups
;
7981 unsigned long capacity
, min_capacity
, max_capacity
;
7982 unsigned long interval
;
7984 interval
= msecs_to_jiffies(sd
->balance_interval
);
7985 interval
= clamp(interval
, 1UL, max_load_balance_interval
);
7986 sdg
->sgc
->next_update
= jiffies
+ interval
;
7989 update_cpu_capacity(sd
, cpu
);
7994 min_capacity
= ULONG_MAX
;
7997 if (child
->flags
& SD_OVERLAP
) {
7999 * SD_OVERLAP domains cannot assume that child groups
8000 * span the current group.
8003 for_each_cpu(cpu
, sched_group_span(sdg
)) {
8004 struct sched_group_capacity
*sgc
;
8005 struct rq
*rq
= cpu_rq(cpu
);
8008 * build_sched_domains() -> init_sched_groups_capacity()
8009 * gets here before we've attached the domains to the
8012 * Use capacity_of(), which is set irrespective of domains
8013 * in update_cpu_capacity().
8015 * This avoids capacity from being 0 and
8016 * causing divide-by-zero issues on boot.
8018 if (unlikely(!rq
->sd
)) {
8019 capacity
+= capacity_of(cpu
);
8021 sgc
= rq
->sd
->groups
->sgc
;
8022 capacity
+= sgc
->capacity
;
8025 min_capacity
= min(capacity
, min_capacity
);
8026 max_capacity
= max(capacity
, max_capacity
);
8030 * !SD_OVERLAP domains can assume that child groups
8031 * span the current group.
8034 group
= child
->groups
;
8036 struct sched_group_capacity
*sgc
= group
->sgc
;
8038 capacity
+= sgc
->capacity
;
8039 min_capacity
= min(sgc
->min_capacity
, min_capacity
);
8040 max_capacity
= max(sgc
->max_capacity
, max_capacity
);
8041 group
= group
->next
;
8042 } while (group
!= child
->groups
);
8045 sdg
->sgc
->capacity
= capacity
;
8046 sdg
->sgc
->min_capacity
= min_capacity
;
8047 sdg
->sgc
->max_capacity
= max_capacity
;
8051 * Check whether the capacity of the rq has been noticeably reduced by side
8052 * activity. The imbalance_pct is used for the threshold.
8053 * Return true is the capacity is reduced
8056 check_cpu_capacity(struct rq
*rq
, struct sched_domain
*sd
)
8058 return ((rq
->cpu_capacity
* sd
->imbalance_pct
) <
8059 (rq
->cpu_capacity_orig
* 100));
8063 * Group imbalance indicates (and tries to solve) the problem where balancing
8064 * groups is inadequate due to ->cpus_allowed constraints.
8066 * Imagine a situation of two groups of 4 CPUs each and 4 tasks each with a
8067 * cpumask covering 1 CPU of the first group and 3 CPUs of the second group.
8070 * { 0 1 2 3 } { 4 5 6 7 }
8073 * If we were to balance group-wise we'd place two tasks in the first group and
8074 * two tasks in the second group. Clearly this is undesired as it will overload
8075 * cpu 3 and leave one of the CPUs in the second group unused.
8077 * The current solution to this issue is detecting the skew in the first group
8078 * by noticing the lower domain failed to reach balance and had difficulty
8079 * moving tasks due to affinity constraints.
8081 * When this is so detected; this group becomes a candidate for busiest; see
8082 * update_sd_pick_busiest(). And calculate_imbalance() and
8083 * find_busiest_group() avoid some of the usual balance conditions to allow it
8084 * to create an effective group imbalance.
8086 * This is a somewhat tricky proposition since the next run might not find the
8087 * group imbalance and decide the groups need to be balanced again. A most
8088 * subtle and fragile situation.
8091 static inline int sg_imbalanced(struct sched_group
*group
)
8093 return group
->sgc
->imbalance
;
8097 * group_has_capacity returns true if the group has spare capacity that could
8098 * be used by some tasks.
8099 * We consider that a group has spare capacity if the * number of task is
8100 * smaller than the number of CPUs or if the utilization is lower than the
8101 * available capacity for CFS tasks.
8102 * For the latter, we use a threshold to stabilize the state, to take into
8103 * account the variance of the tasks' load and to return true if the available
8104 * capacity in meaningful for the load balancer.
8105 * As an example, an available capacity of 1% can appear but it doesn't make
8106 * any benefit for the load balance.
8109 group_has_capacity(struct lb_env
*env
, struct sg_lb_stats
*sgs
)
8111 if (sgs
->sum_nr_running
< sgs
->group_weight
)
8114 if ((sgs
->group_capacity
* 100) >
8115 (sgs
->group_util
* env
->sd
->imbalance_pct
))
8122 * group_is_overloaded returns true if the group has more tasks than it can
8124 * group_is_overloaded is not equals to !group_has_capacity because a group
8125 * with the exact right number of tasks, has no more spare capacity but is not
8126 * overloaded so both group_has_capacity and group_is_overloaded return
8130 group_is_overloaded(struct lb_env
*env
, struct sg_lb_stats
*sgs
)
8132 if (sgs
->sum_nr_running
<= sgs
->group_weight
)
8135 if ((sgs
->group_capacity
* 100) <
8136 (sgs
->group_util
* env
->sd
->imbalance_pct
))
8143 * group_smaller_min_cpu_capacity: Returns true if sched_group sg has smaller
8144 * per-CPU capacity than sched_group ref.
8147 group_smaller_min_cpu_capacity(struct sched_group
*sg
, struct sched_group
*ref
)
8149 return sg
->sgc
->min_capacity
* capacity_margin
<
8150 ref
->sgc
->min_capacity
* 1024;
8154 * group_smaller_max_cpu_capacity: Returns true if sched_group sg has smaller
8155 * per-CPU capacity_orig than sched_group ref.
8158 group_smaller_max_cpu_capacity(struct sched_group
*sg
, struct sched_group
*ref
)
8160 return sg
->sgc
->max_capacity
* capacity_margin
<
8161 ref
->sgc
->max_capacity
* 1024;
8165 group_type
group_classify(struct sched_group
*group
,
8166 struct sg_lb_stats
*sgs
)
8168 if (sgs
->group_no_capacity
)
8169 return group_overloaded
;
8171 if (sg_imbalanced(group
))
8172 return group_imbalanced
;
8174 if (sgs
->group_misfit_task_load
)
8175 return group_misfit_task
;
8180 static bool update_nohz_stats(struct rq
*rq
, bool force
)
8182 #ifdef CONFIG_NO_HZ_COMMON
8183 unsigned int cpu
= rq
->cpu
;
8185 if (!rq
->has_blocked_load
)
8188 if (!cpumask_test_cpu(cpu
, nohz
.idle_cpus_mask
))
8191 if (!force
&& !time_after(jiffies
, rq
->last_blocked_load_update_tick
))
8194 update_blocked_averages(cpu
);
8196 return rq
->has_blocked_load
;
8203 * update_sg_lb_stats - Update sched_group's statistics for load balancing.
8204 * @env: The load balancing environment.
8205 * @group: sched_group whose statistics are to be updated.
8206 * @sgs: variable to hold the statistics for this group.
8207 * @sg_status: Holds flag indicating the status of the sched_group
8209 static inline void update_sg_lb_stats(struct lb_env
*env
,
8210 struct sched_group
*group
,
8211 struct sg_lb_stats
*sgs
,
8214 int local_group
= cpumask_test_cpu(env
->dst_cpu
, sched_group_span(group
));
8215 int load_idx
= get_sd_load_idx(env
->sd
, env
->idle
);
8219 memset(sgs
, 0, sizeof(*sgs
));
8221 for_each_cpu_and(i
, sched_group_span(group
), env
->cpus
) {
8222 struct rq
*rq
= cpu_rq(i
);
8224 if ((env
->flags
& LBF_NOHZ_STATS
) && update_nohz_stats(rq
, false))
8225 env
->flags
|= LBF_NOHZ_AGAIN
;
8227 /* Bias balancing toward CPUs of our domain: */
8229 load
= target_load(i
, load_idx
);
8231 load
= source_load(i
, load_idx
);
8233 sgs
->group_load
+= load
;
8234 sgs
->group_util
+= cpu_util(i
);
8235 sgs
->sum_nr_running
+= rq
->cfs
.h_nr_running
;
8237 nr_running
= rq
->nr_running
;
8239 *sg_status
|= SG_OVERLOAD
;
8241 if (cpu_overutilized(i
))
8242 *sg_status
|= SG_OVERUTILIZED
;
8244 #ifdef CONFIG_NUMA_BALANCING
8245 sgs
->nr_numa_running
+= rq
->nr_numa_running
;
8246 sgs
->nr_preferred_running
+= rq
->nr_preferred_running
;
8248 sgs
->sum_weighted_load
+= weighted_cpuload(rq
);
8250 * No need to call idle_cpu() if nr_running is not 0
8252 if (!nr_running
&& idle_cpu(i
))
8255 if (env
->sd
->flags
& SD_ASYM_CPUCAPACITY
&&
8256 sgs
->group_misfit_task_load
< rq
->misfit_task_load
) {
8257 sgs
->group_misfit_task_load
= rq
->misfit_task_load
;
8258 *sg_status
|= SG_OVERLOAD
;
8262 /* Adjust by relative CPU capacity of the group */
8263 sgs
->group_capacity
= group
->sgc
->capacity
;
8264 sgs
->avg_load
= (sgs
->group_load
*SCHED_CAPACITY_SCALE
) / sgs
->group_capacity
;
8266 if (sgs
->sum_nr_running
)
8267 sgs
->load_per_task
= sgs
->sum_weighted_load
/ sgs
->sum_nr_running
;
8269 sgs
->group_weight
= group
->group_weight
;
8271 sgs
->group_no_capacity
= group_is_overloaded(env
, sgs
);
8272 sgs
->group_type
= group_classify(group
, sgs
);
8276 * update_sd_pick_busiest - return 1 on busiest group
8277 * @env: The load balancing environment.
8278 * @sds: sched_domain statistics
8279 * @sg: sched_group candidate to be checked for being the busiest
8280 * @sgs: sched_group statistics
8282 * Determine if @sg is a busier group than the previously selected
8285 * Return: %true if @sg is a busier group than the previously selected
8286 * busiest group. %false otherwise.
8288 static bool update_sd_pick_busiest(struct lb_env
*env
,
8289 struct sd_lb_stats
*sds
,
8290 struct sched_group
*sg
,
8291 struct sg_lb_stats
*sgs
)
8293 struct sg_lb_stats
*busiest
= &sds
->busiest_stat
;
8296 * Don't try to pull misfit tasks we can't help.
8297 * We can use max_capacity here as reduction in capacity on some
8298 * CPUs in the group should either be possible to resolve
8299 * internally or be covered by avg_load imbalance (eventually).
8301 if (sgs
->group_type
== group_misfit_task
&&
8302 (!group_smaller_max_cpu_capacity(sg
, sds
->local
) ||
8303 !group_has_capacity(env
, &sds
->local_stat
)))
8306 if (sgs
->group_type
> busiest
->group_type
)
8309 if (sgs
->group_type
< busiest
->group_type
)
8312 if (sgs
->avg_load
<= busiest
->avg_load
)
8315 if (!(env
->sd
->flags
& SD_ASYM_CPUCAPACITY
))
8319 * Candidate sg has no more than one task per CPU and
8320 * has higher per-CPU capacity. Migrating tasks to less
8321 * capable CPUs may harm throughput. Maximize throughput,
8322 * power/energy consequences are not considered.
8324 if (sgs
->sum_nr_running
<= sgs
->group_weight
&&
8325 group_smaller_min_cpu_capacity(sds
->local
, sg
))
8329 * If we have more than one misfit sg go with the biggest misfit.
8331 if (sgs
->group_type
== group_misfit_task
&&
8332 sgs
->group_misfit_task_load
< busiest
->group_misfit_task_load
)
8336 /* This is the busiest node in its class. */
8337 if (!(env
->sd
->flags
& SD_ASYM_PACKING
))
8340 /* No ASYM_PACKING if target CPU is already busy */
8341 if (env
->idle
== CPU_NOT_IDLE
)
8344 * ASYM_PACKING needs to move all the work to the highest
8345 * prority CPUs in the group, therefore mark all groups
8346 * of lower priority than ourself as busy.
8348 if (sgs
->sum_nr_running
&&
8349 sched_asym_prefer(env
->dst_cpu
, sg
->asym_prefer_cpu
)) {
8353 /* Prefer to move from lowest priority CPU's work */
8354 if (sched_asym_prefer(sds
->busiest
->asym_prefer_cpu
,
8355 sg
->asym_prefer_cpu
))
8362 #ifdef CONFIG_NUMA_BALANCING
8363 static inline enum fbq_type
fbq_classify_group(struct sg_lb_stats
*sgs
)
8365 if (sgs
->sum_nr_running
> sgs
->nr_numa_running
)
8367 if (sgs
->sum_nr_running
> sgs
->nr_preferred_running
)
8372 static inline enum fbq_type
fbq_classify_rq(struct rq
*rq
)
8374 if (rq
->nr_running
> rq
->nr_numa_running
)
8376 if (rq
->nr_running
> rq
->nr_preferred_running
)
8381 static inline enum fbq_type
fbq_classify_group(struct sg_lb_stats
*sgs
)
8386 static inline enum fbq_type
fbq_classify_rq(struct rq
*rq
)
8390 #endif /* CONFIG_NUMA_BALANCING */
8393 * update_sd_lb_stats - Update sched_domain's statistics for load balancing.
8394 * @env: The load balancing environment.
8395 * @sds: variable to hold the statistics for this sched_domain.
8397 static inline void update_sd_lb_stats(struct lb_env
*env
, struct sd_lb_stats
*sds
)
8399 struct sched_domain
*child
= env
->sd
->child
;
8400 struct sched_group
*sg
= env
->sd
->groups
;
8401 struct sg_lb_stats
*local
= &sds
->local_stat
;
8402 struct sg_lb_stats tmp_sgs
;
8403 bool prefer_sibling
= child
&& child
->flags
& SD_PREFER_SIBLING
;
8406 #ifdef CONFIG_NO_HZ_COMMON
8407 if (env
->idle
== CPU_NEWLY_IDLE
&& READ_ONCE(nohz
.has_blocked
))
8408 env
->flags
|= LBF_NOHZ_STATS
;
8412 struct sg_lb_stats
*sgs
= &tmp_sgs
;
8415 local_group
= cpumask_test_cpu(env
->dst_cpu
, sched_group_span(sg
));
8420 if (env
->idle
!= CPU_NEWLY_IDLE
||
8421 time_after_eq(jiffies
, sg
->sgc
->next_update
))
8422 update_group_capacity(env
->sd
, env
->dst_cpu
);
8425 update_sg_lb_stats(env
, sg
, sgs
, &sg_status
);
8431 * In case the child domain prefers tasks go to siblings
8432 * first, lower the sg capacity so that we'll try
8433 * and move all the excess tasks away. We lower the capacity
8434 * of a group only if the local group has the capacity to fit
8435 * these excess tasks. The extra check prevents the case where
8436 * you always pull from the heaviest group when it is already
8437 * under-utilized (possible with a large weight task outweighs
8438 * the tasks on the system).
8440 if (prefer_sibling
&& sds
->local
&&
8441 group_has_capacity(env
, local
) &&
8442 (sgs
->sum_nr_running
> local
->sum_nr_running
+ 1)) {
8443 sgs
->group_no_capacity
= 1;
8444 sgs
->group_type
= group_classify(sg
, sgs
);
8447 if (update_sd_pick_busiest(env
, sds
, sg
, sgs
)) {
8449 sds
->busiest_stat
= *sgs
;
8453 /* Now, start updating sd_lb_stats */
8454 sds
->total_running
+= sgs
->sum_nr_running
;
8455 sds
->total_load
+= sgs
->group_load
;
8456 sds
->total_capacity
+= sgs
->group_capacity
;
8459 } while (sg
!= env
->sd
->groups
);
8461 #ifdef CONFIG_NO_HZ_COMMON
8462 if ((env
->flags
& LBF_NOHZ_AGAIN
) &&
8463 cpumask_subset(nohz
.idle_cpus_mask
, sched_domain_span(env
->sd
))) {
8465 WRITE_ONCE(nohz
.next_blocked
,
8466 jiffies
+ msecs_to_jiffies(LOAD_AVG_PERIOD
));
8470 if (env
->sd
->flags
& SD_NUMA
)
8471 env
->fbq_type
= fbq_classify_group(&sds
->busiest_stat
);
8473 if (!env
->sd
->parent
) {
8474 struct root_domain
*rd
= env
->dst_rq
->rd
;
8476 /* update overload indicator if we are at root domain */
8477 WRITE_ONCE(rd
->overload
, sg_status
& SG_OVERLOAD
);
8479 /* Update over-utilization (tipping point, U >= 0) indicator */
8480 WRITE_ONCE(rd
->overutilized
, sg_status
& SG_OVERUTILIZED
);
8481 } else if (sg_status
& SG_OVERUTILIZED
) {
8482 WRITE_ONCE(env
->dst_rq
->rd
->overutilized
, SG_OVERUTILIZED
);
8487 * check_asym_packing - Check to see if the group is packed into the
8490 * This is primarily intended to used at the sibling level. Some
8491 * cores like POWER7 prefer to use lower numbered SMT threads. In the
8492 * case of POWER7, it can move to lower SMT modes only when higher
8493 * threads are idle. When in lower SMT modes, the threads will
8494 * perform better since they share less core resources. Hence when we
8495 * have idle threads, we want them to be the higher ones.
8497 * This packing function is run on idle threads. It checks to see if
8498 * the busiest CPU in this domain (core in the P7 case) has a higher
8499 * CPU number than the packing function is being run on. Here we are
8500 * assuming lower CPU number will be equivalent to lower a SMT thread
8503 * Return: 1 when packing is required and a task should be moved to
8504 * this CPU. The amount of the imbalance is returned in env->imbalance.
8506 * @env: The load balancing environment.
8507 * @sds: Statistics of the sched_domain which is to be packed
8509 static int check_asym_packing(struct lb_env
*env
, struct sd_lb_stats
*sds
)
8513 if (!(env
->sd
->flags
& SD_ASYM_PACKING
))
8516 if (env
->idle
== CPU_NOT_IDLE
)
8522 busiest_cpu
= sds
->busiest
->asym_prefer_cpu
;
8523 if (sched_asym_prefer(busiest_cpu
, env
->dst_cpu
))
8526 env
->imbalance
= sds
->busiest_stat
.group_load
;
8532 * fix_small_imbalance - Calculate the minor imbalance that exists
8533 * amongst the groups of a sched_domain, during
8535 * @env: The load balancing environment.
8536 * @sds: Statistics of the sched_domain whose imbalance is to be calculated.
8539 void fix_small_imbalance(struct lb_env
*env
, struct sd_lb_stats
*sds
)
8541 unsigned long tmp
, capa_now
= 0, capa_move
= 0;
8542 unsigned int imbn
= 2;
8543 unsigned long scaled_busy_load_per_task
;
8544 struct sg_lb_stats
*local
, *busiest
;
8546 local
= &sds
->local_stat
;
8547 busiest
= &sds
->busiest_stat
;
8549 if (!local
->sum_nr_running
)
8550 local
->load_per_task
= cpu_avg_load_per_task(env
->dst_cpu
);
8551 else if (busiest
->load_per_task
> local
->load_per_task
)
8554 scaled_busy_load_per_task
=
8555 (busiest
->load_per_task
* SCHED_CAPACITY_SCALE
) /
8556 busiest
->group_capacity
;
8558 if (busiest
->avg_load
+ scaled_busy_load_per_task
>=
8559 local
->avg_load
+ (scaled_busy_load_per_task
* imbn
)) {
8560 env
->imbalance
= busiest
->load_per_task
;
8565 * OK, we don't have enough imbalance to justify moving tasks,
8566 * however we may be able to increase total CPU capacity used by
8570 capa_now
+= busiest
->group_capacity
*
8571 min(busiest
->load_per_task
, busiest
->avg_load
);
8572 capa_now
+= local
->group_capacity
*
8573 min(local
->load_per_task
, local
->avg_load
);
8574 capa_now
/= SCHED_CAPACITY_SCALE
;
8576 /* Amount of load we'd subtract */
8577 if (busiest
->avg_load
> scaled_busy_load_per_task
) {
8578 capa_move
+= busiest
->group_capacity
*
8579 min(busiest
->load_per_task
,
8580 busiest
->avg_load
- scaled_busy_load_per_task
);
8583 /* Amount of load we'd add */
8584 if (busiest
->avg_load
* busiest
->group_capacity
<
8585 busiest
->load_per_task
* SCHED_CAPACITY_SCALE
) {
8586 tmp
= (busiest
->avg_load
* busiest
->group_capacity
) /
8587 local
->group_capacity
;
8589 tmp
= (busiest
->load_per_task
* SCHED_CAPACITY_SCALE
) /
8590 local
->group_capacity
;
8592 capa_move
+= local
->group_capacity
*
8593 min(local
->load_per_task
, local
->avg_load
+ tmp
);
8594 capa_move
/= SCHED_CAPACITY_SCALE
;
8596 /* Move if we gain throughput */
8597 if (capa_move
> capa_now
)
8598 env
->imbalance
= busiest
->load_per_task
;
8602 * calculate_imbalance - Calculate the amount of imbalance present within the
8603 * groups of a given sched_domain during load balance.
8604 * @env: load balance environment
8605 * @sds: statistics of the sched_domain whose imbalance is to be calculated.
8607 static inline void calculate_imbalance(struct lb_env
*env
, struct sd_lb_stats
*sds
)
8609 unsigned long max_pull
, load_above_capacity
= ~0UL;
8610 struct sg_lb_stats
*local
, *busiest
;
8612 local
= &sds
->local_stat
;
8613 busiest
= &sds
->busiest_stat
;
8615 if (busiest
->group_type
== group_imbalanced
) {
8617 * In the group_imb case we cannot rely on group-wide averages
8618 * to ensure CPU-load equilibrium, look at wider averages. XXX
8620 busiest
->load_per_task
=
8621 min(busiest
->load_per_task
, sds
->avg_load
);
8625 * Avg load of busiest sg can be less and avg load of local sg can
8626 * be greater than avg load across all sgs of sd because avg load
8627 * factors in sg capacity and sgs with smaller group_type are
8628 * skipped when updating the busiest sg:
8630 if (busiest
->group_type
!= group_misfit_task
&&
8631 (busiest
->avg_load
<= sds
->avg_load
||
8632 local
->avg_load
>= sds
->avg_load
)) {
8634 return fix_small_imbalance(env
, sds
);
8638 * If there aren't any idle CPUs, avoid creating some.
8640 if (busiest
->group_type
== group_overloaded
&&
8641 local
->group_type
== group_overloaded
) {
8642 load_above_capacity
= busiest
->sum_nr_running
* SCHED_CAPACITY_SCALE
;
8643 if (load_above_capacity
> busiest
->group_capacity
) {
8644 load_above_capacity
-= busiest
->group_capacity
;
8645 load_above_capacity
*= scale_load_down(NICE_0_LOAD
);
8646 load_above_capacity
/= busiest
->group_capacity
;
8648 load_above_capacity
= ~0UL;
8652 * We're trying to get all the CPUs to the average_load, so we don't
8653 * want to push ourselves above the average load, nor do we wish to
8654 * reduce the max loaded CPU below the average load. At the same time,
8655 * we also don't want to reduce the group load below the group
8656 * capacity. Thus we look for the minimum possible imbalance.
8658 max_pull
= min(busiest
->avg_load
- sds
->avg_load
, load_above_capacity
);
8660 /* How much load to actually move to equalise the imbalance */
8661 env
->imbalance
= min(
8662 max_pull
* busiest
->group_capacity
,
8663 (sds
->avg_load
- local
->avg_load
) * local
->group_capacity
8664 ) / SCHED_CAPACITY_SCALE
;
8666 /* Boost imbalance to allow misfit task to be balanced. */
8667 if (busiest
->group_type
== group_misfit_task
) {
8668 env
->imbalance
= max_t(long, env
->imbalance
,
8669 busiest
->group_misfit_task_load
);
8673 * if *imbalance is less than the average load per runnable task
8674 * there is no guarantee that any tasks will be moved so we'll have
8675 * a think about bumping its value to force at least one task to be
8678 if (env
->imbalance
< busiest
->load_per_task
)
8679 return fix_small_imbalance(env
, sds
);
8682 /******* find_busiest_group() helpers end here *********************/
8685 * find_busiest_group - Returns the busiest group within the sched_domain
8686 * if there is an imbalance.
8688 * Also calculates the amount of weighted load which should be moved
8689 * to restore balance.
8691 * @env: The load balancing environment.
8693 * Return: - The busiest group if imbalance exists.
8695 static struct sched_group
*find_busiest_group(struct lb_env
*env
)
8697 struct sg_lb_stats
*local
, *busiest
;
8698 struct sd_lb_stats sds
;
8700 init_sd_lb_stats(&sds
);
8703 * Compute the various statistics relavent for load balancing at
8706 update_sd_lb_stats(env
, &sds
);
8708 if (sched_energy_enabled()) {
8709 struct root_domain
*rd
= env
->dst_rq
->rd
;
8711 if (rcu_dereference(rd
->pd
) && !READ_ONCE(rd
->overutilized
))
8715 local
= &sds
.local_stat
;
8716 busiest
= &sds
.busiest_stat
;
8718 /* ASYM feature bypasses nice load balance check */
8719 if (check_asym_packing(env
, &sds
))
8722 /* There is no busy sibling group to pull tasks from */
8723 if (!sds
.busiest
|| busiest
->sum_nr_running
== 0)
8726 /* XXX broken for overlapping NUMA groups */
8727 sds
.avg_load
= (SCHED_CAPACITY_SCALE
* sds
.total_load
)
8728 / sds
.total_capacity
;
8731 * If the busiest group is imbalanced the below checks don't
8732 * work because they assume all things are equal, which typically
8733 * isn't true due to cpus_allowed constraints and the like.
8735 if (busiest
->group_type
== group_imbalanced
)
8739 * When dst_cpu is idle, prevent SMP nice and/or asymmetric group
8740 * capacities from resulting in underutilization due to avg_load.
8742 if (env
->idle
!= CPU_NOT_IDLE
&& group_has_capacity(env
, local
) &&
8743 busiest
->group_no_capacity
)
8746 /* Misfit tasks should be dealt with regardless of the avg load */
8747 if (busiest
->group_type
== group_misfit_task
)
8751 * If the local group is busier than the selected busiest group
8752 * don't try and pull any tasks.
8754 if (local
->avg_load
>= busiest
->avg_load
)
8758 * Don't pull any tasks if this group is already above the domain
8761 if (local
->avg_load
>= sds
.avg_load
)
8764 if (env
->idle
== CPU_IDLE
) {
8766 * This CPU is idle. If the busiest group is not overloaded
8767 * and there is no imbalance between this and busiest group
8768 * wrt idle CPUs, it is balanced. The imbalance becomes
8769 * significant if the diff is greater than 1 otherwise we
8770 * might end up to just move the imbalance on another group
8772 if ((busiest
->group_type
!= group_overloaded
) &&
8773 (local
->idle_cpus
<= (busiest
->idle_cpus
+ 1)))
8777 * In the CPU_NEWLY_IDLE, CPU_NOT_IDLE cases, use
8778 * imbalance_pct to be conservative.
8780 if (100 * busiest
->avg_load
<=
8781 env
->sd
->imbalance_pct
* local
->avg_load
)
8786 /* Looks like there is an imbalance. Compute it */
8787 env
->src_grp_type
= busiest
->group_type
;
8788 calculate_imbalance(env
, &sds
);
8789 return env
->imbalance
? sds
.busiest
: NULL
;
8797 * find_busiest_queue - find the busiest runqueue among the CPUs in the group.
8799 static struct rq
*find_busiest_queue(struct lb_env
*env
,
8800 struct sched_group
*group
)
8802 struct rq
*busiest
= NULL
, *rq
;
8803 unsigned long busiest_load
= 0, busiest_capacity
= 1;
8806 for_each_cpu_and(i
, sched_group_span(group
), env
->cpus
) {
8807 unsigned long capacity
, wl
;
8811 rt
= fbq_classify_rq(rq
);
8814 * We classify groups/runqueues into three groups:
8815 * - regular: there are !numa tasks
8816 * - remote: there are numa tasks that run on the 'wrong' node
8817 * - all: there is no distinction
8819 * In order to avoid migrating ideally placed numa tasks,
8820 * ignore those when there's better options.
8822 * If we ignore the actual busiest queue to migrate another
8823 * task, the next balance pass can still reduce the busiest
8824 * queue by moving tasks around inside the node.
8826 * If we cannot move enough load due to this classification
8827 * the next pass will adjust the group classification and
8828 * allow migration of more tasks.
8830 * Both cases only affect the total convergence complexity.
8832 if (rt
> env
->fbq_type
)
8836 * For ASYM_CPUCAPACITY domains with misfit tasks we simply
8837 * seek the "biggest" misfit task.
8839 if (env
->src_grp_type
== group_misfit_task
) {
8840 if (rq
->misfit_task_load
> busiest_load
) {
8841 busiest_load
= rq
->misfit_task_load
;
8848 capacity
= capacity_of(i
);
8851 * For ASYM_CPUCAPACITY domains, don't pick a CPU that could
8852 * eventually lead to active_balancing high->low capacity.
8853 * Higher per-CPU capacity is considered better than balancing
8856 if (env
->sd
->flags
& SD_ASYM_CPUCAPACITY
&&
8857 capacity_of(env
->dst_cpu
) < capacity
&&
8858 rq
->nr_running
== 1)
8861 wl
= weighted_cpuload(rq
);
8864 * When comparing with imbalance, use weighted_cpuload()
8865 * which is not scaled with the CPU capacity.
8868 if (rq
->nr_running
== 1 && wl
> env
->imbalance
&&
8869 !check_cpu_capacity(rq
, env
->sd
))
8873 * For the load comparisons with the other CPU's, consider
8874 * the weighted_cpuload() scaled with the CPU capacity, so
8875 * that the load can be moved away from the CPU that is
8876 * potentially running at a lower capacity.
8878 * Thus we're looking for max(wl_i / capacity_i), crosswise
8879 * multiplication to rid ourselves of the division works out
8880 * to: wl_i * capacity_j > wl_j * capacity_i; where j is
8881 * our previous maximum.
8883 if (wl
* busiest_capacity
> busiest_load
* capacity
) {
8885 busiest_capacity
= capacity
;
8894 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
8895 * so long as it is large enough.
8897 #define MAX_PINNED_INTERVAL 512
8900 asym_active_balance(struct lb_env
*env
)
8903 * ASYM_PACKING needs to force migrate tasks from busy but
8904 * lower priority CPUs in order to pack all tasks in the
8905 * highest priority CPUs.
8907 return env
->idle
!= CPU_NOT_IDLE
&& (env
->sd
->flags
& SD_ASYM_PACKING
) &&
8908 sched_asym_prefer(env
->dst_cpu
, env
->src_cpu
);
8912 voluntary_active_balance(struct lb_env
*env
)
8914 struct sched_domain
*sd
= env
->sd
;
8916 if (asym_active_balance(env
))
8920 * The dst_cpu is idle and the src_cpu CPU has only 1 CFS task.
8921 * It's worth migrating the task if the src_cpu's capacity is reduced
8922 * because of other sched_class or IRQs if more capacity stays
8923 * available on dst_cpu.
8925 if ((env
->idle
!= CPU_NOT_IDLE
) &&
8926 (env
->src_rq
->cfs
.h_nr_running
== 1)) {
8927 if ((check_cpu_capacity(env
->src_rq
, sd
)) &&
8928 (capacity_of(env
->src_cpu
)*sd
->imbalance_pct
< capacity_of(env
->dst_cpu
)*100))
8932 if (env
->src_grp_type
== group_misfit_task
)
8938 static int need_active_balance(struct lb_env
*env
)
8940 struct sched_domain
*sd
= env
->sd
;
8942 if (voluntary_active_balance(env
))
8945 return unlikely(sd
->nr_balance_failed
> sd
->cache_nice_tries
+2);
8948 static int active_load_balance_cpu_stop(void *data
);
8950 static int should_we_balance(struct lb_env
*env
)
8952 struct sched_group
*sg
= env
->sd
->groups
;
8953 int cpu
, balance_cpu
= -1;
8956 * Ensure the balancing environment is consistent; can happen
8957 * when the softirq triggers 'during' hotplug.
8959 if (!cpumask_test_cpu(env
->dst_cpu
, env
->cpus
))
8963 * In the newly idle case, we will allow all the CPUs
8964 * to do the newly idle load balance.
8966 if (env
->idle
== CPU_NEWLY_IDLE
)
8969 /* Try to find first idle CPU */
8970 for_each_cpu_and(cpu
, group_balance_mask(sg
), env
->cpus
) {
8978 if (balance_cpu
== -1)
8979 balance_cpu
= group_balance_cpu(sg
);
8982 * First idle CPU or the first CPU(busiest) in this sched group
8983 * is eligible for doing load balancing at this and above domains.
8985 return balance_cpu
== env
->dst_cpu
;
8989 * Check this_cpu to ensure it is balanced within domain. Attempt to move
8990 * tasks if there is an imbalance.
8992 static int load_balance(int this_cpu
, struct rq
*this_rq
,
8993 struct sched_domain
*sd
, enum cpu_idle_type idle
,
8994 int *continue_balancing
)
8996 int ld_moved
, cur_ld_moved
, active_balance
= 0;
8997 struct sched_domain
*sd_parent
= sd
->parent
;
8998 struct sched_group
*group
;
9001 struct cpumask
*cpus
= this_cpu_cpumask_var_ptr(load_balance_mask
);
9003 struct lb_env env
= {
9005 .dst_cpu
= this_cpu
,
9007 .dst_grpmask
= sched_group_span(sd
->groups
),
9009 .loop_break
= sched_nr_migrate_break
,
9012 .tasks
= LIST_HEAD_INIT(env
.tasks
),
9015 cpumask_and(cpus
, sched_domain_span(sd
), cpu_active_mask
);
9017 schedstat_inc(sd
->lb_count
[idle
]);
9020 if (!should_we_balance(&env
)) {
9021 *continue_balancing
= 0;
9025 group
= find_busiest_group(&env
);
9027 schedstat_inc(sd
->lb_nobusyg
[idle
]);
9031 busiest
= find_busiest_queue(&env
, group
);
9033 schedstat_inc(sd
->lb_nobusyq
[idle
]);
9037 BUG_ON(busiest
== env
.dst_rq
);
9039 schedstat_add(sd
->lb_imbalance
[idle
], env
.imbalance
);
9041 env
.src_cpu
= busiest
->cpu
;
9042 env
.src_rq
= busiest
;
9045 if (busiest
->nr_running
> 1) {
9047 * Attempt to move tasks. If find_busiest_group has found
9048 * an imbalance but busiest->nr_running <= 1, the group is
9049 * still unbalanced. ld_moved simply stays zero, so it is
9050 * correctly treated as an imbalance.
9052 env
.flags
|= LBF_ALL_PINNED
;
9053 env
.loop_max
= min(sysctl_sched_nr_migrate
, busiest
->nr_running
);
9056 rq_lock_irqsave(busiest
, &rf
);
9057 update_rq_clock(busiest
);
9060 * cur_ld_moved - load moved in current iteration
9061 * ld_moved - cumulative load moved across iterations
9063 cur_ld_moved
= detach_tasks(&env
);
9066 * We've detached some tasks from busiest_rq. Every
9067 * task is masked "TASK_ON_RQ_MIGRATING", so we can safely
9068 * unlock busiest->lock, and we are able to be sure
9069 * that nobody can manipulate the tasks in parallel.
9070 * See task_rq_lock() family for the details.
9073 rq_unlock(busiest
, &rf
);
9077 ld_moved
+= cur_ld_moved
;
9080 local_irq_restore(rf
.flags
);
9082 if (env
.flags
& LBF_NEED_BREAK
) {
9083 env
.flags
&= ~LBF_NEED_BREAK
;
9088 * Revisit (affine) tasks on src_cpu that couldn't be moved to
9089 * us and move them to an alternate dst_cpu in our sched_group
9090 * where they can run. The upper limit on how many times we
9091 * iterate on same src_cpu is dependent on number of CPUs in our
9094 * This changes load balance semantics a bit on who can move
9095 * load to a given_cpu. In addition to the given_cpu itself
9096 * (or a ilb_cpu acting on its behalf where given_cpu is
9097 * nohz-idle), we now have balance_cpu in a position to move
9098 * load to given_cpu. In rare situations, this may cause
9099 * conflicts (balance_cpu and given_cpu/ilb_cpu deciding
9100 * _independently_ and at _same_ time to move some load to
9101 * given_cpu) causing exceess load to be moved to given_cpu.
9102 * This however should not happen so much in practice and
9103 * moreover subsequent load balance cycles should correct the
9104 * excess load moved.
9106 if ((env
.flags
& LBF_DST_PINNED
) && env
.imbalance
> 0) {
9108 /* Prevent to re-select dst_cpu via env's CPUs */
9109 __cpumask_clear_cpu(env
.dst_cpu
, env
.cpus
);
9111 env
.dst_rq
= cpu_rq(env
.new_dst_cpu
);
9112 env
.dst_cpu
= env
.new_dst_cpu
;
9113 env
.flags
&= ~LBF_DST_PINNED
;
9115 env
.loop_break
= sched_nr_migrate_break
;
9118 * Go back to "more_balance" rather than "redo" since we
9119 * need to continue with same src_cpu.
9125 * We failed to reach balance because of affinity.
9128 int *group_imbalance
= &sd_parent
->groups
->sgc
->imbalance
;
9130 if ((env
.flags
& LBF_SOME_PINNED
) && env
.imbalance
> 0)
9131 *group_imbalance
= 1;
9134 /* All tasks on this runqueue were pinned by CPU affinity */
9135 if (unlikely(env
.flags
& LBF_ALL_PINNED
)) {
9136 __cpumask_clear_cpu(cpu_of(busiest
), cpus
);
9138 * Attempting to continue load balancing at the current
9139 * sched_domain level only makes sense if there are
9140 * active CPUs remaining as possible busiest CPUs to
9141 * pull load from which are not contained within the
9142 * destination group that is receiving any migrated
9145 if (!cpumask_subset(cpus
, env
.dst_grpmask
)) {
9147 env
.loop_break
= sched_nr_migrate_break
;
9150 goto out_all_pinned
;
9155 schedstat_inc(sd
->lb_failed
[idle
]);
9157 * Increment the failure counter only on periodic balance.
9158 * We do not want newidle balance, which can be very
9159 * frequent, pollute the failure counter causing
9160 * excessive cache_hot migrations and active balances.
9162 if (idle
!= CPU_NEWLY_IDLE
)
9163 sd
->nr_balance_failed
++;
9165 if (need_active_balance(&env
)) {
9166 unsigned long flags
;
9168 raw_spin_lock_irqsave(&busiest
->lock
, flags
);
9171 * Don't kick the active_load_balance_cpu_stop,
9172 * if the curr task on busiest CPU can't be
9173 * moved to this_cpu:
9175 if (!cpumask_test_cpu(this_cpu
, &busiest
->curr
->cpus_allowed
)) {
9176 raw_spin_unlock_irqrestore(&busiest
->lock
,
9178 env
.flags
|= LBF_ALL_PINNED
;
9179 goto out_one_pinned
;
9183 * ->active_balance synchronizes accesses to
9184 * ->active_balance_work. Once set, it's cleared
9185 * only after active load balance is finished.
9187 if (!busiest
->active_balance
) {
9188 busiest
->active_balance
= 1;
9189 busiest
->push_cpu
= this_cpu
;
9192 raw_spin_unlock_irqrestore(&busiest
->lock
, flags
);
9194 if (active_balance
) {
9195 stop_one_cpu_nowait(cpu_of(busiest
),
9196 active_load_balance_cpu_stop
, busiest
,
9197 &busiest
->active_balance_work
);
9200 /* We've kicked active balancing, force task migration. */
9201 sd
->nr_balance_failed
= sd
->cache_nice_tries
+1;
9204 sd
->nr_balance_failed
= 0;
9206 if (likely(!active_balance
) || voluntary_active_balance(&env
)) {
9207 /* We were unbalanced, so reset the balancing interval */
9208 sd
->balance_interval
= sd
->min_interval
;
9211 * If we've begun active balancing, start to back off. This
9212 * case may not be covered by the all_pinned logic if there
9213 * is only 1 task on the busy runqueue (because we don't call
9216 if (sd
->balance_interval
< sd
->max_interval
)
9217 sd
->balance_interval
*= 2;
9224 * We reach balance although we may have faced some affinity
9225 * constraints. Clear the imbalance flag if it was set.
9228 int *group_imbalance
= &sd_parent
->groups
->sgc
->imbalance
;
9230 if (*group_imbalance
)
9231 *group_imbalance
= 0;
9236 * We reach balance because all tasks are pinned at this level so
9237 * we can't migrate them. Let the imbalance flag set so parent level
9238 * can try to migrate them.
9240 schedstat_inc(sd
->lb_balanced
[idle
]);
9242 sd
->nr_balance_failed
= 0;
9248 * idle_balance() disregards balance intervals, so we could repeatedly
9249 * reach this code, which would lead to balance_interval skyrocketting
9250 * in a short amount of time. Skip the balance_interval increase logic
9253 if (env
.idle
== CPU_NEWLY_IDLE
)
9256 /* tune up the balancing interval */
9257 if ((env
.flags
& LBF_ALL_PINNED
&&
9258 sd
->balance_interval
< MAX_PINNED_INTERVAL
) ||
9259 sd
->balance_interval
< sd
->max_interval
)
9260 sd
->balance_interval
*= 2;
9265 static inline unsigned long
9266 get_sd_balance_interval(struct sched_domain
*sd
, int cpu_busy
)
9268 unsigned long interval
= sd
->balance_interval
;
9271 interval
*= sd
->busy_factor
;
9273 /* scale ms to jiffies */
9274 interval
= msecs_to_jiffies(interval
);
9275 interval
= clamp(interval
, 1UL, max_load_balance_interval
);
9281 update_next_balance(struct sched_domain
*sd
, unsigned long *next_balance
)
9283 unsigned long interval
, next
;
9285 /* used by idle balance, so cpu_busy = 0 */
9286 interval
= get_sd_balance_interval(sd
, 0);
9287 next
= sd
->last_balance
+ interval
;
9289 if (time_after(*next_balance
, next
))
9290 *next_balance
= next
;
9294 * active_load_balance_cpu_stop is run by the CPU stopper. It pushes
9295 * running tasks off the busiest CPU onto idle CPUs. It requires at
9296 * least 1 task to be running on each physical CPU where possible, and
9297 * avoids physical / logical imbalances.
9299 static int active_load_balance_cpu_stop(void *data
)
9301 struct rq
*busiest_rq
= data
;
9302 int busiest_cpu
= cpu_of(busiest_rq
);
9303 int target_cpu
= busiest_rq
->push_cpu
;
9304 struct rq
*target_rq
= cpu_rq(target_cpu
);
9305 struct sched_domain
*sd
;
9306 struct task_struct
*p
= NULL
;
9309 rq_lock_irq(busiest_rq
, &rf
);
9311 * Between queueing the stop-work and running it is a hole in which
9312 * CPUs can become inactive. We should not move tasks from or to
9315 if (!cpu_active(busiest_cpu
) || !cpu_active(target_cpu
))
9318 /* Make sure the requested CPU hasn't gone down in the meantime: */
9319 if (unlikely(busiest_cpu
!= smp_processor_id() ||
9320 !busiest_rq
->active_balance
))
9323 /* Is there any task to move? */
9324 if (busiest_rq
->nr_running
<= 1)
9328 * This condition is "impossible", if it occurs
9329 * we need to fix it. Originally reported by
9330 * Bjorn Helgaas on a 128-CPU setup.
9332 BUG_ON(busiest_rq
== target_rq
);
9334 /* Search for an sd spanning us and the target CPU. */
9336 for_each_domain(target_cpu
, sd
) {
9337 if ((sd
->flags
& SD_LOAD_BALANCE
) &&
9338 cpumask_test_cpu(busiest_cpu
, sched_domain_span(sd
)))
9343 struct lb_env env
= {
9345 .dst_cpu
= target_cpu
,
9346 .dst_rq
= target_rq
,
9347 .src_cpu
= busiest_rq
->cpu
,
9348 .src_rq
= busiest_rq
,
9351 * can_migrate_task() doesn't need to compute new_dst_cpu
9352 * for active balancing. Since we have CPU_IDLE, but no
9353 * @dst_grpmask we need to make that test go away with lying
9356 .flags
= LBF_DST_PINNED
,
9359 schedstat_inc(sd
->alb_count
);
9360 update_rq_clock(busiest_rq
);
9362 p
= detach_one_task(&env
);
9364 schedstat_inc(sd
->alb_pushed
);
9365 /* Active balancing done, reset the failure counter. */
9366 sd
->nr_balance_failed
= 0;
9368 schedstat_inc(sd
->alb_failed
);
9373 busiest_rq
->active_balance
= 0;
9374 rq_unlock(busiest_rq
, &rf
);
9377 attach_one_task(target_rq
, p
);
9384 static DEFINE_SPINLOCK(balancing
);
9387 * Scale the max load_balance interval with the number of CPUs in the system.
9388 * This trades load-balance latency on larger machines for less cross talk.
9390 void update_max_interval(void)
9392 max_load_balance_interval
= HZ
*num_online_cpus()/10;
9396 * It checks each scheduling domain to see if it is due to be balanced,
9397 * and initiates a balancing operation if so.
9399 * Balancing parameters are set up in init_sched_domains.
9401 static void rebalance_domains(struct rq
*rq
, enum cpu_idle_type idle
)
9403 int continue_balancing
= 1;
9405 unsigned long interval
;
9406 struct sched_domain
*sd
;
9407 /* Earliest time when we have to do rebalance again */
9408 unsigned long next_balance
= jiffies
+ 60*HZ
;
9409 int update_next_balance
= 0;
9410 int need_serialize
, need_decay
= 0;
9414 for_each_domain(cpu
, sd
) {
9416 * Decay the newidle max times here because this is a regular
9417 * visit to all the domains. Decay ~1% per second.
9419 if (time_after(jiffies
, sd
->next_decay_max_lb_cost
)) {
9420 sd
->max_newidle_lb_cost
=
9421 (sd
->max_newidle_lb_cost
* 253) / 256;
9422 sd
->next_decay_max_lb_cost
= jiffies
+ HZ
;
9425 max_cost
+= sd
->max_newidle_lb_cost
;
9427 if (!(sd
->flags
& SD_LOAD_BALANCE
))
9431 * Stop the load balance at this level. There is another
9432 * CPU in our sched group which is doing load balancing more
9435 if (!continue_balancing
) {
9441 interval
= get_sd_balance_interval(sd
, idle
!= CPU_IDLE
);
9443 need_serialize
= sd
->flags
& SD_SERIALIZE
;
9444 if (need_serialize
) {
9445 if (!spin_trylock(&balancing
))
9449 if (time_after_eq(jiffies
, sd
->last_balance
+ interval
)) {
9450 if (load_balance(cpu
, rq
, sd
, idle
, &continue_balancing
)) {
9452 * The LBF_DST_PINNED logic could have changed
9453 * env->dst_cpu, so we can't know our idle
9454 * state even if we migrated tasks. Update it.
9456 idle
= idle_cpu(cpu
) ? CPU_IDLE
: CPU_NOT_IDLE
;
9458 sd
->last_balance
= jiffies
;
9459 interval
= get_sd_balance_interval(sd
, idle
!= CPU_IDLE
);
9462 spin_unlock(&balancing
);
9464 if (time_after(next_balance
, sd
->last_balance
+ interval
)) {
9465 next_balance
= sd
->last_balance
+ interval
;
9466 update_next_balance
= 1;
9471 * Ensure the rq-wide value also decays but keep it at a
9472 * reasonable floor to avoid funnies with rq->avg_idle.
9474 rq
->max_idle_balance_cost
=
9475 max((u64
)sysctl_sched_migration_cost
, max_cost
);
9480 * next_balance will be updated only when there is a need.
9481 * When the cpu is attached to null domain for ex, it will not be
9484 if (likely(update_next_balance
)) {
9485 rq
->next_balance
= next_balance
;
9487 #ifdef CONFIG_NO_HZ_COMMON
9489 * If this CPU has been elected to perform the nohz idle
9490 * balance. Other idle CPUs have already rebalanced with
9491 * nohz_idle_balance() and nohz.next_balance has been
9492 * updated accordingly. This CPU is now running the idle load
9493 * balance for itself and we need to update the
9494 * nohz.next_balance accordingly.
9496 if ((idle
== CPU_IDLE
) && time_after(nohz
.next_balance
, rq
->next_balance
))
9497 nohz
.next_balance
= rq
->next_balance
;
9502 static inline int on_null_domain(struct rq
*rq
)
9504 return unlikely(!rcu_dereference_sched(rq
->sd
));
9507 #ifdef CONFIG_NO_HZ_COMMON
9509 * idle load balancing details
9510 * - When one of the busy CPUs notice that there may be an idle rebalancing
9511 * needed, they will kick the idle load balancer, which then does idle
9512 * load balancing for all the idle CPUs.
9515 static inline int find_new_ilb(void)
9517 int ilb
= cpumask_first(nohz
.idle_cpus_mask
);
9519 if (ilb
< nr_cpu_ids
&& idle_cpu(ilb
))
9526 * Kick a CPU to do the nohz balancing, if it is time for it. We pick the
9527 * nohz_load_balancer CPU (if there is one) otherwise fallback to any idle
9528 * CPU (if there is one).
9530 static void kick_ilb(unsigned int flags
)
9534 nohz
.next_balance
++;
9536 ilb_cpu
= find_new_ilb();
9538 if (ilb_cpu
>= nr_cpu_ids
)
9541 flags
= atomic_fetch_or(flags
, nohz_flags(ilb_cpu
));
9542 if (flags
& NOHZ_KICK_MASK
)
9546 * Use smp_send_reschedule() instead of resched_cpu().
9547 * This way we generate a sched IPI on the target CPU which
9548 * is idle. And the softirq performing nohz idle load balance
9549 * will be run before returning from the IPI.
9551 smp_send_reschedule(ilb_cpu
);
9555 * Current decision point for kicking the idle load balancer in the presence
9556 * of idle CPUs in the system.
9558 static void nohz_balancer_kick(struct rq
*rq
)
9560 unsigned long now
= jiffies
;
9561 struct sched_domain_shared
*sds
;
9562 struct sched_domain
*sd
;
9563 int nr_busy
, i
, cpu
= rq
->cpu
;
9564 unsigned int flags
= 0;
9566 if (unlikely(rq
->idle_balance
))
9570 * We may be recently in ticked or tickless idle mode. At the first
9571 * busy tick after returning from idle, we will update the busy stats.
9573 nohz_balance_exit_idle(rq
);
9576 * None are in tickless mode and hence no need for NOHZ idle load
9579 if (likely(!atomic_read(&nohz
.nr_cpus
)))
9582 if (READ_ONCE(nohz
.has_blocked
) &&
9583 time_after(now
, READ_ONCE(nohz
.next_blocked
)))
9584 flags
= NOHZ_STATS_KICK
;
9586 if (time_before(now
, nohz
.next_balance
))
9589 if (rq
->nr_running
>= 2 || rq
->misfit_task_load
) {
9590 flags
= NOHZ_KICK_MASK
;
9595 sds
= rcu_dereference(per_cpu(sd_llc_shared
, cpu
));
9598 * If there is an imbalance between LLC domains (IOW we could
9599 * increase the overall cache use), we need some less-loaded LLC
9600 * domain to pull some load. Likewise, we may need to spread
9601 * load within the current LLC domain (e.g. packed SMT cores but
9602 * other CPUs are idle). We can't really know from here how busy
9603 * the others are - so just get a nohz balance going if it looks
9604 * like this LLC domain has tasks we could move.
9606 nr_busy
= atomic_read(&sds
->nr_busy_cpus
);
9608 flags
= NOHZ_KICK_MASK
;
9614 sd
= rcu_dereference(rq
->sd
);
9616 if ((rq
->cfs
.h_nr_running
>= 1) &&
9617 check_cpu_capacity(rq
, sd
)) {
9618 flags
= NOHZ_KICK_MASK
;
9623 sd
= rcu_dereference(per_cpu(sd_asym_packing
, cpu
));
9625 for_each_cpu_and(i
, sched_domain_span(sd
), nohz
.idle_cpus_mask
) {
9626 if (sched_asym_prefer(i
, cpu
)) {
9627 flags
= NOHZ_KICK_MASK
;
9639 static void set_cpu_sd_state_busy(int cpu
)
9641 struct sched_domain
*sd
;
9644 sd
= rcu_dereference(per_cpu(sd_llc
, cpu
));
9646 if (!sd
|| !sd
->nohz_idle
)
9650 atomic_inc(&sd
->shared
->nr_busy_cpus
);
9655 void nohz_balance_exit_idle(struct rq
*rq
)
9657 SCHED_WARN_ON(rq
!= this_rq());
9659 if (likely(!rq
->nohz_tick_stopped
))
9662 rq
->nohz_tick_stopped
= 0;
9663 cpumask_clear_cpu(rq
->cpu
, nohz
.idle_cpus_mask
);
9664 atomic_dec(&nohz
.nr_cpus
);
9666 set_cpu_sd_state_busy(rq
->cpu
);
9669 static void set_cpu_sd_state_idle(int cpu
)
9671 struct sched_domain
*sd
;
9674 sd
= rcu_dereference(per_cpu(sd_llc
, cpu
));
9676 if (!sd
|| sd
->nohz_idle
)
9680 atomic_dec(&sd
->shared
->nr_busy_cpus
);
9686 * This routine will record that the CPU is going idle with tick stopped.
9687 * This info will be used in performing idle load balancing in the future.
9689 void nohz_balance_enter_idle(int cpu
)
9691 struct rq
*rq
= cpu_rq(cpu
);
9693 SCHED_WARN_ON(cpu
!= smp_processor_id());
9695 /* If this CPU is going down, then nothing needs to be done: */
9696 if (!cpu_active(cpu
))
9699 /* Spare idle load balancing on CPUs that don't want to be disturbed: */
9700 if (!housekeeping_cpu(cpu
, HK_FLAG_SCHED
))
9704 * Can be set safely without rq->lock held
9705 * If a clear happens, it will have evaluated last additions because
9706 * rq->lock is held during the check and the clear
9708 rq
->has_blocked_load
= 1;
9711 * The tick is still stopped but load could have been added in the
9712 * meantime. We set the nohz.has_blocked flag to trig a check of the
9713 * *_avg. The CPU is already part of nohz.idle_cpus_mask so the clear
9714 * of nohz.has_blocked can only happen after checking the new load
9716 if (rq
->nohz_tick_stopped
)
9719 /* If we're a completely isolated CPU, we don't play: */
9720 if (on_null_domain(rq
))
9723 rq
->nohz_tick_stopped
= 1;
9725 cpumask_set_cpu(cpu
, nohz
.idle_cpus_mask
);
9726 atomic_inc(&nohz
.nr_cpus
);
9729 * Ensures that if nohz_idle_balance() fails to observe our
9730 * @idle_cpus_mask store, it must observe the @has_blocked
9733 smp_mb__after_atomic();
9735 set_cpu_sd_state_idle(cpu
);
9739 * Each time a cpu enter idle, we assume that it has blocked load and
9740 * enable the periodic update of the load of idle cpus
9742 WRITE_ONCE(nohz
.has_blocked
, 1);
9746 * Internal function that runs load balance for all idle cpus. The load balance
9747 * can be a simple update of blocked load or a complete load balance with
9748 * tasks movement depending of flags.
9749 * The function returns false if the loop has stopped before running
9750 * through all idle CPUs.
9752 static bool _nohz_idle_balance(struct rq
*this_rq
, unsigned int flags
,
9753 enum cpu_idle_type idle
)
9755 /* Earliest time when we have to do rebalance again */
9756 unsigned long now
= jiffies
;
9757 unsigned long next_balance
= now
+ 60*HZ
;
9758 bool has_blocked_load
= false;
9759 int update_next_balance
= 0;
9760 int this_cpu
= this_rq
->cpu
;
9765 SCHED_WARN_ON((flags
& NOHZ_KICK_MASK
) == NOHZ_BALANCE_KICK
);
9768 * We assume there will be no idle load after this update and clear
9769 * the has_blocked flag. If a cpu enters idle in the mean time, it will
9770 * set the has_blocked flag and trig another update of idle load.
9771 * Because a cpu that becomes idle, is added to idle_cpus_mask before
9772 * setting the flag, we are sure to not clear the state and not
9773 * check the load of an idle cpu.
9775 WRITE_ONCE(nohz
.has_blocked
, 0);
9778 * Ensures that if we miss the CPU, we must see the has_blocked
9779 * store from nohz_balance_enter_idle().
9783 for_each_cpu(balance_cpu
, nohz
.idle_cpus_mask
) {
9784 if (balance_cpu
== this_cpu
|| !idle_cpu(balance_cpu
))
9788 * If this CPU gets work to do, stop the load balancing
9789 * work being done for other CPUs. Next load
9790 * balancing owner will pick it up.
9792 if (need_resched()) {
9793 has_blocked_load
= true;
9797 rq
= cpu_rq(balance_cpu
);
9799 has_blocked_load
|= update_nohz_stats(rq
, true);
9802 * If time for next balance is due,
9805 if (time_after_eq(jiffies
, rq
->next_balance
)) {
9808 rq_lock_irqsave(rq
, &rf
);
9809 update_rq_clock(rq
);
9810 cpu_load_update_idle(rq
);
9811 rq_unlock_irqrestore(rq
, &rf
);
9813 if (flags
& NOHZ_BALANCE_KICK
)
9814 rebalance_domains(rq
, CPU_IDLE
);
9817 if (time_after(next_balance
, rq
->next_balance
)) {
9818 next_balance
= rq
->next_balance
;
9819 update_next_balance
= 1;
9823 /* Newly idle CPU doesn't need an update */
9824 if (idle
!= CPU_NEWLY_IDLE
) {
9825 update_blocked_averages(this_cpu
);
9826 has_blocked_load
|= this_rq
->has_blocked_load
;
9829 if (flags
& NOHZ_BALANCE_KICK
)
9830 rebalance_domains(this_rq
, CPU_IDLE
);
9832 WRITE_ONCE(nohz
.next_blocked
,
9833 now
+ msecs_to_jiffies(LOAD_AVG_PERIOD
));
9835 /* The full idle balance loop has been done */
9839 /* There is still blocked load, enable periodic update */
9840 if (has_blocked_load
)
9841 WRITE_ONCE(nohz
.has_blocked
, 1);
9844 * next_balance will be updated only when there is a need.
9845 * When the CPU is attached to null domain for ex, it will not be
9848 if (likely(update_next_balance
))
9849 nohz
.next_balance
= next_balance
;
9855 * In CONFIG_NO_HZ_COMMON case, the idle balance kickee will do the
9856 * rebalancing for all the cpus for whom scheduler ticks are stopped.
9858 static bool nohz_idle_balance(struct rq
*this_rq
, enum cpu_idle_type idle
)
9860 int this_cpu
= this_rq
->cpu
;
9863 if (!(atomic_read(nohz_flags(this_cpu
)) & NOHZ_KICK_MASK
))
9866 if (idle
!= CPU_IDLE
) {
9867 atomic_andnot(NOHZ_KICK_MASK
, nohz_flags(this_cpu
));
9871 /* could be _relaxed() */
9872 flags
= atomic_fetch_andnot(NOHZ_KICK_MASK
, nohz_flags(this_cpu
));
9873 if (!(flags
& NOHZ_KICK_MASK
))
9876 _nohz_idle_balance(this_rq
, flags
, idle
);
9881 static void nohz_newidle_balance(struct rq
*this_rq
)
9883 int this_cpu
= this_rq
->cpu
;
9886 * This CPU doesn't want to be disturbed by scheduler
9889 if (!housekeeping_cpu(this_cpu
, HK_FLAG_SCHED
))
9892 /* Will wake up very soon. No time for doing anything else*/
9893 if (this_rq
->avg_idle
< sysctl_sched_migration_cost
)
9896 /* Don't need to update blocked load of idle CPUs*/
9897 if (!READ_ONCE(nohz
.has_blocked
) ||
9898 time_before(jiffies
, READ_ONCE(nohz
.next_blocked
)))
9901 raw_spin_unlock(&this_rq
->lock
);
9903 * This CPU is going to be idle and blocked load of idle CPUs
9904 * need to be updated. Run the ilb locally as it is a good
9905 * candidate for ilb instead of waking up another idle CPU.
9906 * Kick an normal ilb if we failed to do the update.
9908 if (!_nohz_idle_balance(this_rq
, NOHZ_STATS_KICK
, CPU_NEWLY_IDLE
))
9909 kick_ilb(NOHZ_STATS_KICK
);
9910 raw_spin_lock(&this_rq
->lock
);
9913 #else /* !CONFIG_NO_HZ_COMMON */
9914 static inline void nohz_balancer_kick(struct rq
*rq
) { }
9916 static inline bool nohz_idle_balance(struct rq
*this_rq
, enum cpu_idle_type idle
)
9921 static inline void nohz_newidle_balance(struct rq
*this_rq
) { }
9922 #endif /* CONFIG_NO_HZ_COMMON */
9925 * idle_balance is called by schedule() if this_cpu is about to become
9926 * idle. Attempts to pull tasks from other CPUs.
9928 static int idle_balance(struct rq
*this_rq
, struct rq_flags
*rf
)
9930 unsigned long next_balance
= jiffies
+ HZ
;
9931 int this_cpu
= this_rq
->cpu
;
9932 struct sched_domain
*sd
;
9933 int pulled_task
= 0;
9937 * We must set idle_stamp _before_ calling idle_balance(), such that we
9938 * measure the duration of idle_balance() as idle time.
9940 this_rq
->idle_stamp
= rq_clock(this_rq
);
9943 * Do not pull tasks towards !active CPUs...
9945 if (!cpu_active(this_cpu
))
9949 * This is OK, because current is on_cpu, which avoids it being picked
9950 * for load-balance and preemption/IRQs are still disabled avoiding
9951 * further scheduler activity on it and we're being very careful to
9952 * re-start the picking loop.
9954 rq_unpin_lock(this_rq
, rf
);
9956 if (this_rq
->avg_idle
< sysctl_sched_migration_cost
||
9957 !READ_ONCE(this_rq
->rd
->overload
)) {
9960 sd
= rcu_dereference_check_sched_domain(this_rq
->sd
);
9962 update_next_balance(sd
, &next_balance
);
9965 nohz_newidle_balance(this_rq
);
9970 raw_spin_unlock(&this_rq
->lock
);
9972 update_blocked_averages(this_cpu
);
9974 for_each_domain(this_cpu
, sd
) {
9975 int continue_balancing
= 1;
9976 u64 t0
, domain_cost
;
9978 if (!(sd
->flags
& SD_LOAD_BALANCE
))
9981 if (this_rq
->avg_idle
< curr_cost
+ sd
->max_newidle_lb_cost
) {
9982 update_next_balance(sd
, &next_balance
);
9986 if (sd
->flags
& SD_BALANCE_NEWIDLE
) {
9987 t0
= sched_clock_cpu(this_cpu
);
9989 pulled_task
= load_balance(this_cpu
, this_rq
,
9991 &continue_balancing
);
9993 domain_cost
= sched_clock_cpu(this_cpu
) - t0
;
9994 if (domain_cost
> sd
->max_newidle_lb_cost
)
9995 sd
->max_newidle_lb_cost
= domain_cost
;
9997 curr_cost
+= domain_cost
;
10000 update_next_balance(sd
, &next_balance
);
10003 * Stop searching for tasks to pull if there are
10004 * now runnable tasks on this rq.
10006 if (pulled_task
|| this_rq
->nr_running
> 0)
10011 raw_spin_lock(&this_rq
->lock
);
10013 if (curr_cost
> this_rq
->max_idle_balance_cost
)
10014 this_rq
->max_idle_balance_cost
= curr_cost
;
10018 * While browsing the domains, we released the rq lock, a task could
10019 * have been enqueued in the meantime. Since we're not going idle,
10020 * pretend we pulled a task.
10022 if (this_rq
->cfs
.h_nr_running
&& !pulled_task
)
10025 /* Move the next balance forward */
10026 if (time_after(this_rq
->next_balance
, next_balance
))
10027 this_rq
->next_balance
= next_balance
;
10029 /* Is there a task of a high priority class? */
10030 if (this_rq
->nr_running
!= this_rq
->cfs
.h_nr_running
)
10034 this_rq
->idle_stamp
= 0;
10036 rq_repin_lock(this_rq
, rf
);
10038 return pulled_task
;
10042 * run_rebalance_domains is triggered when needed from the scheduler tick.
10043 * Also triggered for nohz idle balancing (with nohz_balancing_kick set).
10045 static __latent_entropy
void run_rebalance_domains(struct softirq_action
*h
)
10047 struct rq
*this_rq
= this_rq();
10048 enum cpu_idle_type idle
= this_rq
->idle_balance
?
10049 CPU_IDLE
: CPU_NOT_IDLE
;
10052 * If this CPU has a pending nohz_balance_kick, then do the
10053 * balancing on behalf of the other idle CPUs whose ticks are
10054 * stopped. Do nohz_idle_balance *before* rebalance_domains to
10055 * give the idle CPUs a chance to load balance. Else we may
10056 * load balance only within the local sched_domain hierarchy
10057 * and abort nohz_idle_balance altogether if we pull some load.
10059 if (nohz_idle_balance(this_rq
, idle
))
10062 /* normal load balance */
10063 update_blocked_averages(this_rq
->cpu
);
10064 rebalance_domains(this_rq
, idle
);
10068 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
10070 void trigger_load_balance(struct rq
*rq
)
10072 /* Don't need to rebalance while attached to NULL domain */
10073 if (unlikely(on_null_domain(rq
)))
10076 if (time_after_eq(jiffies
, rq
->next_balance
))
10077 raise_softirq(SCHED_SOFTIRQ
);
10079 nohz_balancer_kick(rq
);
10082 static void rq_online_fair(struct rq
*rq
)
10086 update_runtime_enabled(rq
);
10089 static void rq_offline_fair(struct rq
*rq
)
10093 /* Ensure any throttled groups are reachable by pick_next_task */
10094 unthrottle_offline_cfs_rqs(rq
);
10097 #endif /* CONFIG_SMP */
10100 * scheduler tick hitting a task of our scheduling class.
10102 * NOTE: This function can be called remotely by the tick offload that
10103 * goes along full dynticks. Therefore no local assumption can be made
10104 * and everything must be accessed through the @rq and @curr passed in
10107 static void task_tick_fair(struct rq
*rq
, struct task_struct
*curr
, int queued
)
10109 struct cfs_rq
*cfs_rq
;
10110 struct sched_entity
*se
= &curr
->se
;
10112 for_each_sched_entity(se
) {
10113 cfs_rq
= cfs_rq_of(se
);
10114 entity_tick(cfs_rq
, se
, queued
);
10117 if (static_branch_unlikely(&sched_numa_balancing
))
10118 task_tick_numa(rq
, curr
);
10120 update_misfit_status(curr
, rq
);
10121 update_overutilized_status(task_rq(curr
));
10125 * called on fork with the child task as argument from the parent's context
10126 * - child not yet on the tasklist
10127 * - preemption disabled
10129 static void task_fork_fair(struct task_struct
*p
)
10131 struct cfs_rq
*cfs_rq
;
10132 struct sched_entity
*se
= &p
->se
, *curr
;
10133 struct rq
*rq
= this_rq();
10134 struct rq_flags rf
;
10137 update_rq_clock(rq
);
10139 cfs_rq
= task_cfs_rq(current
);
10140 curr
= cfs_rq
->curr
;
10142 update_curr(cfs_rq
);
10143 se
->vruntime
= curr
->vruntime
;
10145 place_entity(cfs_rq
, se
, 1);
10147 if (sysctl_sched_child_runs_first
&& curr
&& entity_before(curr
, se
)) {
10149 * Upon rescheduling, sched_class::put_prev_task() will place
10150 * 'current' within the tree based on its new key value.
10152 swap(curr
->vruntime
, se
->vruntime
);
10156 se
->vruntime
-= cfs_rq
->min_vruntime
;
10157 rq_unlock(rq
, &rf
);
10161 * Priority of the task has changed. Check to see if we preempt
10162 * the current task.
10165 prio_changed_fair(struct rq
*rq
, struct task_struct
*p
, int oldprio
)
10167 if (!task_on_rq_queued(p
))
10171 * Reschedule if we are currently running on this runqueue and
10172 * our priority decreased, or if we are not currently running on
10173 * this runqueue and our priority is higher than the current's
10175 if (rq
->curr
== p
) {
10176 if (p
->prio
> oldprio
)
10179 check_preempt_curr(rq
, p
, 0);
10182 static inline bool vruntime_normalized(struct task_struct
*p
)
10184 struct sched_entity
*se
= &p
->se
;
10187 * In both the TASK_ON_RQ_QUEUED and TASK_ON_RQ_MIGRATING cases,
10188 * the dequeue_entity(.flags=0) will already have normalized the
10195 * When !on_rq, vruntime of the task has usually NOT been normalized.
10196 * But there are some cases where it has already been normalized:
10198 * - A forked child which is waiting for being woken up by
10199 * wake_up_new_task().
10200 * - A task which has been woken up by try_to_wake_up() and
10201 * waiting for actually being woken up by sched_ttwu_pending().
10203 if (!se
->sum_exec_runtime
||
10204 (p
->state
== TASK_WAKING
&& p
->sched_remote_wakeup
))
10210 #ifdef CONFIG_FAIR_GROUP_SCHED
10212 * Propagate the changes of the sched_entity across the tg tree to make it
10213 * visible to the root
10215 static void propagate_entity_cfs_rq(struct sched_entity
*se
)
10217 struct cfs_rq
*cfs_rq
;
10219 /* Start to propagate at parent */
10222 for_each_sched_entity(se
) {
10223 cfs_rq
= cfs_rq_of(se
);
10225 if (cfs_rq_throttled(cfs_rq
))
10228 update_load_avg(cfs_rq
, se
, UPDATE_TG
);
10232 static void propagate_entity_cfs_rq(struct sched_entity
*se
) { }
10235 static void detach_entity_cfs_rq(struct sched_entity
*se
)
10237 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
10239 /* Catch up with the cfs_rq and remove our load when we leave */
10240 update_load_avg(cfs_rq
, se
, 0);
10241 detach_entity_load_avg(cfs_rq
, se
);
10242 update_tg_load_avg(cfs_rq
, false);
10243 propagate_entity_cfs_rq(se
);
10246 static void attach_entity_cfs_rq(struct sched_entity
*se
)
10248 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
10250 #ifdef CONFIG_FAIR_GROUP_SCHED
10252 * Since the real-depth could have been changed (only FAIR
10253 * class maintain depth value), reset depth properly.
10255 se
->depth
= se
->parent
? se
->parent
->depth
+ 1 : 0;
10258 /* Synchronize entity with its cfs_rq */
10259 update_load_avg(cfs_rq
, se
, sched_feat(ATTACH_AGE_LOAD
) ? 0 : SKIP_AGE_LOAD
);
10260 attach_entity_load_avg(cfs_rq
, se
, 0);
10261 update_tg_load_avg(cfs_rq
, false);
10262 propagate_entity_cfs_rq(se
);
10265 static void detach_task_cfs_rq(struct task_struct
*p
)
10267 struct sched_entity
*se
= &p
->se
;
10268 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
10270 if (!vruntime_normalized(p
)) {
10272 * Fix up our vruntime so that the current sleep doesn't
10273 * cause 'unlimited' sleep bonus.
10275 place_entity(cfs_rq
, se
, 0);
10276 se
->vruntime
-= cfs_rq
->min_vruntime
;
10279 detach_entity_cfs_rq(se
);
10282 static void attach_task_cfs_rq(struct task_struct
*p
)
10284 struct sched_entity
*se
= &p
->se
;
10285 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
10287 attach_entity_cfs_rq(se
);
10289 if (!vruntime_normalized(p
))
10290 se
->vruntime
+= cfs_rq
->min_vruntime
;
10293 static void switched_from_fair(struct rq
*rq
, struct task_struct
*p
)
10295 detach_task_cfs_rq(p
);
10298 static void switched_to_fair(struct rq
*rq
, struct task_struct
*p
)
10300 attach_task_cfs_rq(p
);
10302 if (task_on_rq_queued(p
)) {
10304 * We were most likely switched from sched_rt, so
10305 * kick off the schedule if running, otherwise just see
10306 * if we can still preempt the current task.
10311 check_preempt_curr(rq
, p
, 0);
10315 /* Account for a task changing its policy or group.
10317 * This routine is mostly called to set cfs_rq->curr field when a task
10318 * migrates between groups/classes.
10320 static void set_curr_task_fair(struct rq
*rq
)
10322 struct sched_entity
*se
= &rq
->curr
->se
;
10324 for_each_sched_entity(se
) {
10325 struct cfs_rq
*cfs_rq
= cfs_rq_of(se
);
10327 set_next_entity(cfs_rq
, se
);
10328 /* ensure bandwidth has been allocated on our new cfs_rq */
10329 account_cfs_rq_runtime(cfs_rq
, 0);
10333 void init_cfs_rq(struct cfs_rq
*cfs_rq
)
10335 cfs_rq
->tasks_timeline
= RB_ROOT_CACHED
;
10336 cfs_rq
->min_vruntime
= (u64
)(-(1LL << 20));
10337 #ifndef CONFIG_64BIT
10338 cfs_rq
->min_vruntime_copy
= cfs_rq
->min_vruntime
;
10341 raw_spin_lock_init(&cfs_rq
->removed
.lock
);
10345 #ifdef CONFIG_FAIR_GROUP_SCHED
10346 static void task_set_group_fair(struct task_struct
*p
)
10348 struct sched_entity
*se
= &p
->se
;
10350 set_task_rq(p
, task_cpu(p
));
10351 se
->depth
= se
->parent
? se
->parent
->depth
+ 1 : 0;
10354 static void task_move_group_fair(struct task_struct
*p
)
10356 detach_task_cfs_rq(p
);
10357 set_task_rq(p
, task_cpu(p
));
10360 /* Tell se's cfs_rq has been changed -- migrated */
10361 p
->se
.avg
.last_update_time
= 0;
10363 attach_task_cfs_rq(p
);
10366 static void task_change_group_fair(struct task_struct
*p
, int type
)
10369 case TASK_SET_GROUP
:
10370 task_set_group_fair(p
);
10373 case TASK_MOVE_GROUP
:
10374 task_move_group_fair(p
);
10379 void free_fair_sched_group(struct task_group
*tg
)
10383 destroy_cfs_bandwidth(tg_cfs_bandwidth(tg
));
10385 for_each_possible_cpu(i
) {
10387 kfree(tg
->cfs_rq
[i
]);
10396 int alloc_fair_sched_group(struct task_group
*tg
, struct task_group
*parent
)
10398 struct sched_entity
*se
;
10399 struct cfs_rq
*cfs_rq
;
10402 tg
->cfs_rq
= kcalloc(nr_cpu_ids
, sizeof(cfs_rq
), GFP_KERNEL
);
10405 tg
->se
= kcalloc(nr_cpu_ids
, sizeof(se
), GFP_KERNEL
);
10409 tg
->shares
= NICE_0_LOAD
;
10411 init_cfs_bandwidth(tg_cfs_bandwidth(tg
));
10413 for_each_possible_cpu(i
) {
10414 cfs_rq
= kzalloc_node(sizeof(struct cfs_rq
),
10415 GFP_KERNEL
, cpu_to_node(i
));
10419 se
= kzalloc_node(sizeof(struct sched_entity
),
10420 GFP_KERNEL
, cpu_to_node(i
));
10424 init_cfs_rq(cfs_rq
);
10425 init_tg_cfs_entry(tg
, cfs_rq
, se
, i
, parent
->se
[i
]);
10426 init_entity_runnable_average(se
);
10437 void online_fair_sched_group(struct task_group
*tg
)
10439 struct sched_entity
*se
;
10443 for_each_possible_cpu(i
) {
10447 raw_spin_lock_irq(&rq
->lock
);
10448 update_rq_clock(rq
);
10449 attach_entity_cfs_rq(se
);
10450 sync_throttle(tg
, i
);
10451 raw_spin_unlock_irq(&rq
->lock
);
10455 void unregister_fair_sched_group(struct task_group
*tg
)
10457 unsigned long flags
;
10461 for_each_possible_cpu(cpu
) {
10463 remove_entity_load_avg(tg
->se
[cpu
]);
10466 * Only empty task groups can be destroyed; so we can speculatively
10467 * check on_list without danger of it being re-added.
10469 if (!tg
->cfs_rq
[cpu
]->on_list
)
10474 raw_spin_lock_irqsave(&rq
->lock
, flags
);
10475 list_del_leaf_cfs_rq(tg
->cfs_rq
[cpu
]);
10476 raw_spin_unlock_irqrestore(&rq
->lock
, flags
);
10480 void init_tg_cfs_entry(struct task_group
*tg
, struct cfs_rq
*cfs_rq
,
10481 struct sched_entity
*se
, int cpu
,
10482 struct sched_entity
*parent
)
10484 struct rq
*rq
= cpu_rq(cpu
);
10488 init_cfs_rq_runtime(cfs_rq
);
10490 tg
->cfs_rq
[cpu
] = cfs_rq
;
10493 /* se could be NULL for root_task_group */
10498 se
->cfs_rq
= &rq
->cfs
;
10501 se
->cfs_rq
= parent
->my_q
;
10502 se
->depth
= parent
->depth
+ 1;
10506 /* guarantee group entities always have weight */
10507 update_load_set(&se
->load
, NICE_0_LOAD
);
10508 se
->parent
= parent
;
10511 static DEFINE_MUTEX(shares_mutex
);
10513 int sched_group_set_shares(struct task_group
*tg
, unsigned long shares
)
10518 * We can't change the weight of the root cgroup.
10523 shares
= clamp(shares
, scale_load(MIN_SHARES
), scale_load(MAX_SHARES
));
10525 mutex_lock(&shares_mutex
);
10526 if (tg
->shares
== shares
)
10529 tg
->shares
= shares
;
10530 for_each_possible_cpu(i
) {
10531 struct rq
*rq
= cpu_rq(i
);
10532 struct sched_entity
*se
= tg
->se
[i
];
10533 struct rq_flags rf
;
10535 /* Propagate contribution to hierarchy */
10536 rq_lock_irqsave(rq
, &rf
);
10537 update_rq_clock(rq
);
10538 for_each_sched_entity(se
) {
10539 update_load_avg(cfs_rq_of(se
), se
, UPDATE_TG
);
10540 update_cfs_group(se
);
10542 rq_unlock_irqrestore(rq
, &rf
);
10546 mutex_unlock(&shares_mutex
);
10549 #else /* CONFIG_FAIR_GROUP_SCHED */
10551 void free_fair_sched_group(struct task_group
*tg
) { }
10553 int alloc_fair_sched_group(struct task_group
*tg
, struct task_group
*parent
)
10558 void online_fair_sched_group(struct task_group
*tg
) { }
10560 void unregister_fair_sched_group(struct task_group
*tg
) { }
10562 #endif /* CONFIG_FAIR_GROUP_SCHED */
10565 static unsigned int get_rr_interval_fair(struct rq
*rq
, struct task_struct
*task
)
10567 struct sched_entity
*se
= &task
->se
;
10568 unsigned int rr_interval
= 0;
10571 * Time slice is 0 for SCHED_OTHER tasks that are on an otherwise
10574 if (rq
->cfs
.load
.weight
)
10575 rr_interval
= NS_TO_JIFFIES(sched_slice(cfs_rq_of(se
), se
));
10577 return rr_interval
;
10581 * All the scheduling class methods:
10583 const struct sched_class fair_sched_class
= {
10584 .next
= &idle_sched_class
,
10585 .enqueue_task
= enqueue_task_fair
,
10586 .dequeue_task
= dequeue_task_fair
,
10587 .yield_task
= yield_task_fair
,
10588 .yield_to_task
= yield_to_task_fair
,
10590 .check_preempt_curr
= check_preempt_wakeup
,
10592 .pick_next_task
= pick_next_task_fair
,
10593 .put_prev_task
= put_prev_task_fair
,
10596 .select_task_rq
= select_task_rq_fair
,
10597 .migrate_task_rq
= migrate_task_rq_fair
,
10599 .rq_online
= rq_online_fair
,
10600 .rq_offline
= rq_offline_fair
,
10602 .task_dead
= task_dead_fair
,
10603 .set_cpus_allowed
= set_cpus_allowed_common
,
10606 .set_curr_task
= set_curr_task_fair
,
10607 .task_tick
= task_tick_fair
,
10608 .task_fork
= task_fork_fair
,
10610 .prio_changed
= prio_changed_fair
,
10611 .switched_from
= switched_from_fair
,
10612 .switched_to
= switched_to_fair
,
10614 .get_rr_interval
= get_rr_interval_fair
,
10616 .update_curr
= update_curr_fair
,
10618 #ifdef CONFIG_FAIR_GROUP_SCHED
10619 .task_change_group
= task_change_group_fair
,
10623 #ifdef CONFIG_SCHED_DEBUG
10624 void print_cfs_stats(struct seq_file
*m
, int cpu
)
10626 struct cfs_rq
*cfs_rq
, *pos
;
10629 for_each_leaf_cfs_rq_safe(cpu_rq(cpu
), cfs_rq
, pos
)
10630 print_cfs_rq(m
, cpu
, cfs_rq
);
10634 #ifdef CONFIG_NUMA_BALANCING
10635 void show_numa_stats(struct task_struct
*p
, struct seq_file
*m
)
10638 unsigned long tsf
= 0, tpf
= 0, gsf
= 0, gpf
= 0;
10640 for_each_online_node(node
) {
10641 if (p
->numa_faults
) {
10642 tsf
= p
->numa_faults
[task_faults_idx(NUMA_MEM
, node
, 0)];
10643 tpf
= p
->numa_faults
[task_faults_idx(NUMA_MEM
, node
, 1)];
10645 if (p
->numa_group
) {
10646 gsf
= p
->numa_group
->faults
[task_faults_idx(NUMA_MEM
, node
, 0)],
10647 gpf
= p
->numa_group
->faults
[task_faults_idx(NUMA_MEM
, node
, 1)];
10649 print_numa_stats(m
, node
, tsf
, tpf
, gsf
, gpf
);
10652 #endif /* CONFIG_NUMA_BALANCING */
10653 #endif /* CONFIG_SCHED_DEBUG */
10655 __init
void init_sched_fair_class(void)
10658 open_softirq(SCHED_SOFTIRQ
, run_rebalance_domains
);
10660 #ifdef CONFIG_NO_HZ_COMMON
10661 nohz
.next_balance
= jiffies
;
10662 nohz
.next_blocked
= jiffies
;
10663 zalloc_cpumask_var(&nohz
.idle_cpus_mask
, GFP_NOWAIT
);