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
23 #include <linux/energy_model.h>
24 #include <linux/mmap_lock.h>
25 #include <linux/hugetlb_inline.h>
26 #include <linux/jiffies.h>
27 #include <linux/mm_api.h>
28 #include <linux/highmem.h>
29 #include <linux/spinlock_api.h>
30 #include <linux/cpumask_api.h>
31 #include <linux/lockdep_api.h>
32 #include <linux/softirq.h>
33 #include <linux/refcount_api.h>
34 #include <linux/topology.h>
35 #include <linux/sched/clock.h>
36 #include <linux/sched/cond_resched.h>
37 #include <linux/sched/cputime.h>
38 #include <linux/sched/isolation.h>
39 #include <linux/sched/nohz.h>
41 #include <linux/cpuidle.h>
42 #include <linux/interrupt.h>
43 #include <linux/memory-tiers.h>
44 #include <linux/mempolicy.h>
45 #include <linux/mutex_api.h>
46 #include <linux/profile.h>
47 #include <linux/psi.h>
48 #include <linux/ratelimit.h>
49 #include <linux/task_work.h>
51 #include <asm/switch_to.h>
53 #include <linux/sched/cond_resched.h>
57 #include "autogroup.h"
60 * Targeted preemption latency for CPU-bound tasks:
62 * NOTE: this latency value is not the same as the concept of
63 * 'timeslice length' - timeslices in CFS are of variable length
64 * and have no persistent notion like in traditional, time-slice
65 * based scheduling concepts.
67 * (to see the precise effective timeslice length of your workload,
68 * run vmstat and monitor the context-switches (cs) field)
70 * (default: 6ms * (1 + ilog(ncpus)), units: nanoseconds)
72 unsigned int sysctl_sched_latency = 6000000ULL;
73 static unsigned int normalized_sysctl_sched_latency = 6000000ULL;
76 * The initial- and re-scaling of tunables is configurable
80 * SCHED_TUNABLESCALING_NONE - unscaled, always *1
81 * SCHED_TUNABLESCALING_LOG - scaled logarithmical, *1+ilog(ncpus)
82 * SCHED_TUNABLESCALING_LINEAR - scaled linear, *ncpus
84 * (default SCHED_TUNABLESCALING_LOG = *(1+ilog(ncpus))
86 unsigned int sysctl_sched_tunable_scaling = SCHED_TUNABLESCALING_LOG;
89 * Minimal preemption granularity for CPU-bound tasks:
91 * (default: 0.75 msec * (1 + ilog(ncpus)), units: nanoseconds)
93 unsigned int sysctl_sched_min_granularity = 750000ULL;
94 static unsigned int normalized_sysctl_sched_min_granularity = 750000ULL;
97 * Minimal preemption granularity for CPU-bound SCHED_IDLE tasks.
98 * Applies only when SCHED_IDLE tasks compete with normal tasks.
100 * (default: 0.75 msec)
102 unsigned int sysctl_sched_idle_min_granularity = 750000ULL;
105 * This value is kept at sysctl_sched_latency/sysctl_sched_min_granularity
107 static unsigned int sched_nr_latency = 8;
110 * After fork, child runs first. If set to 0 (default) then
111 * parent will (try to) run first.
113 unsigned int sysctl_sched_child_runs_first __read_mostly;
116 * SCHED_OTHER wake-up granularity.
118 * This option delays the preemption effects of decoupled workloads
119 * and reduces their over-scheduling. Synchronous workloads will still
120 * have immediate wakeup/sleep latencies.
122 * (default: 1 msec * (1 + ilog(ncpus)), units: nanoseconds)
124 unsigned int sysctl_sched_wakeup_granularity = 1000000UL;
125 static unsigned int normalized_sysctl_sched_wakeup_granularity = 1000000UL;
127 const_debug unsigned int sysctl_sched_migration_cost = 500000UL;
129 int sched_thermal_decay_shift;
130 static int __init setup_sched_thermal_decay_shift(char *str)
134 if (kstrtoint(str, 0, &_shift))
135 pr_warn("Unable to set scheduler thermal pressure decay shift parameter\n");
137 sched_thermal_decay_shift = clamp(_shift, 0, 10);
140 __setup("sched_thermal_decay_shift=", setup_sched_thermal_decay_shift);
144 * For asym packing, by default the lower numbered CPU has higher priority.
146 int __weak arch_asym_cpu_priority(int cpu)
152 * The margin used when comparing utilization with CPU capacity.
156 #define fits_capacity(cap, max) ((cap) * 1280 < (max) * 1024)
159 * The margin used when comparing CPU capacities.
160 * is 'cap1' noticeably greater than 'cap2'
164 #define capacity_greater(cap1, cap2) ((cap1) * 1024 > (cap2) * 1078)
167 #ifdef CONFIG_CFS_BANDWIDTH
169 * Amount of runtime to allocate from global (tg) to local (per-cfs_rq) pool
170 * each time a cfs_rq requests quota.
172 * Note: in the case that the slice exceeds the runtime remaining (either due
173 * to consumption or the quota being specified to be smaller than the slice)
174 * we will always only issue the remaining available time.
176 * (default: 5 msec, units: microseconds)
178 static unsigned int sysctl_sched_cfs_bandwidth_slice = 5000UL;
182 static struct ctl_table sched_fair_sysctls[] = {
184 .procname = "sched_child_runs_first",
185 .data = &sysctl_sched_child_runs_first,
186 .maxlen = sizeof(unsigned int),
188 .proc_handler = proc_dointvec,
190 #ifdef CONFIG_CFS_BANDWIDTH
192 .procname = "sched_cfs_bandwidth_slice_us",
193 .data = &sysctl_sched_cfs_bandwidth_slice,
194 .maxlen = sizeof(unsigned int),
196 .proc_handler = proc_dointvec_minmax,
197 .extra1 = SYSCTL_ONE,
203 static int __init sched_fair_sysctl_init(void)
205 register_sysctl_init("kernel", sched_fair_sysctls);
208 late_initcall(sched_fair_sysctl_init);
211 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
217 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
223 static inline void update_load_set(struct load_weight *lw, unsigned long w)
230 * Increase the granularity value when there are more CPUs,
231 * because with more CPUs the 'effective latency' as visible
232 * to users decreases. But the relationship is not linear,
233 * so pick a second-best guess by going with the log2 of the
236 * This idea comes from the SD scheduler of Con Kolivas:
238 static unsigned int get_update_sysctl_factor(void)
240 unsigned int cpus = min_t(unsigned int, num_online_cpus(), 8);
243 switch (sysctl_sched_tunable_scaling) {
244 case SCHED_TUNABLESCALING_NONE:
247 case SCHED_TUNABLESCALING_LINEAR:
250 case SCHED_TUNABLESCALING_LOG:
252 factor = 1 + ilog2(cpus);
259 static void update_sysctl(void)
261 unsigned int factor = get_update_sysctl_factor();
263 #define SET_SYSCTL(name) \
264 (sysctl_##name = (factor) * normalized_sysctl_##name)
265 SET_SYSCTL(sched_min_granularity);
266 SET_SYSCTL(sched_latency);
267 SET_SYSCTL(sched_wakeup_granularity);
271 void __init sched_init_granularity(void)
276 #define WMULT_CONST (~0U)
277 #define WMULT_SHIFT 32
279 static void __update_inv_weight(struct load_weight *lw)
283 if (likely(lw->inv_weight))
286 w = scale_load_down(lw->weight);
288 if (BITS_PER_LONG > 32 && unlikely(w >= WMULT_CONST))
290 else if (unlikely(!w))
291 lw->inv_weight = WMULT_CONST;
293 lw->inv_weight = WMULT_CONST / w;
297 * delta_exec * weight / lw.weight
299 * (delta_exec * (weight * lw->inv_weight)) >> WMULT_SHIFT
301 * Either weight := NICE_0_LOAD and lw \e sched_prio_to_wmult[], in which case
302 * we're guaranteed shift stays positive because inv_weight is guaranteed to
303 * fit 32 bits, and NICE_0_LOAD gives another 10 bits; therefore shift >= 22.
305 * Or, weight =< lw.weight (because lw.weight is the runqueue weight), thus
306 * weight/lw.weight <= 1, and therefore our shift will also be positive.
308 static u64 __calc_delta(u64 delta_exec, unsigned long weight, struct load_weight *lw)
310 u64 fact = scale_load_down(weight);
311 u32 fact_hi = (u32)(fact >> 32);
312 int shift = WMULT_SHIFT;
315 __update_inv_weight(lw);
317 if (unlikely(fact_hi)) {
323 fact = mul_u32_u32(fact, lw->inv_weight);
325 fact_hi = (u32)(fact >> 32);
332 return mul_u64_u32_shr(delta_exec, fact, shift);
336 const struct sched_class fair_sched_class;
338 /**************************************************************
339 * CFS operations on generic schedulable entities:
342 #ifdef CONFIG_FAIR_GROUP_SCHED
344 /* Walk up scheduling entities hierarchy */
345 #define for_each_sched_entity(se) \
346 for (; se; se = se->parent)
348 static inline bool list_add_leaf_cfs_rq(struct cfs_rq *cfs_rq)
350 struct rq *rq = rq_of(cfs_rq);
351 int cpu = cpu_of(rq);
354 return rq->tmp_alone_branch == &rq->leaf_cfs_rq_list;
359 * Ensure we either appear before our parent (if already
360 * enqueued) or force our parent to appear after us when it is
361 * enqueued. The fact that we always enqueue bottom-up
362 * reduces this to two cases and a special case for the root
363 * cfs_rq. Furthermore, it also means that we will always reset
364 * tmp_alone_branch either when the branch is connected
365 * to a tree or when we reach the top of the tree
367 if (cfs_rq->tg->parent &&
368 cfs_rq->tg->parent->cfs_rq[cpu]->on_list) {
370 * If parent is already on the list, we add the child
371 * just before. Thanks to circular linked property of
372 * the list, this means to put the child at the tail
373 * of the list that starts by parent.
375 list_add_tail_rcu(&cfs_rq->leaf_cfs_rq_list,
376 &(cfs_rq->tg->parent->cfs_rq[cpu]->leaf_cfs_rq_list));
378 * The branch is now connected to its tree so we can
379 * reset tmp_alone_branch to the beginning of the
382 rq->tmp_alone_branch = &rq->leaf_cfs_rq_list;
386 if (!cfs_rq->tg->parent) {
388 * cfs rq without parent should be put
389 * at the tail of the list.
391 list_add_tail_rcu(&cfs_rq->leaf_cfs_rq_list,
392 &rq->leaf_cfs_rq_list);
394 * We have reach the top of a tree so we can reset
395 * tmp_alone_branch to the beginning of the list.
397 rq->tmp_alone_branch = &rq->leaf_cfs_rq_list;
402 * The parent has not already been added so we want to
403 * make sure that it will be put after us.
404 * tmp_alone_branch points to the begin of the branch
405 * where we will add parent.
407 list_add_rcu(&cfs_rq->leaf_cfs_rq_list, rq->tmp_alone_branch);
409 * update tmp_alone_branch to points to the new begin
412 rq->tmp_alone_branch = &cfs_rq->leaf_cfs_rq_list;
416 static inline void list_del_leaf_cfs_rq(struct cfs_rq *cfs_rq)
418 if (cfs_rq->on_list) {
419 struct rq *rq = rq_of(cfs_rq);
422 * With cfs_rq being unthrottled/throttled during an enqueue,
423 * it can happen the tmp_alone_branch points the a leaf that
424 * we finally want to del. In this case, tmp_alone_branch moves
425 * to the prev element but it will point to rq->leaf_cfs_rq_list
426 * at the end of the enqueue.
428 if (rq->tmp_alone_branch == &cfs_rq->leaf_cfs_rq_list)
429 rq->tmp_alone_branch = cfs_rq->leaf_cfs_rq_list.prev;
431 list_del_rcu(&cfs_rq->leaf_cfs_rq_list);
436 static inline void assert_list_leaf_cfs_rq(struct rq *rq)
438 SCHED_WARN_ON(rq->tmp_alone_branch != &rq->leaf_cfs_rq_list);
441 /* Iterate thr' all leaf cfs_rq's on a runqueue */
442 #define for_each_leaf_cfs_rq_safe(rq, cfs_rq, pos) \
443 list_for_each_entry_safe(cfs_rq, pos, &rq->leaf_cfs_rq_list, \
446 /* Do the two (enqueued) entities belong to the same group ? */
447 static inline struct cfs_rq *
448 is_same_group(struct sched_entity *se, struct sched_entity *pse)
450 if (se->cfs_rq == pse->cfs_rq)
456 static inline struct sched_entity *parent_entity(struct sched_entity *se)
462 find_matching_se(struct sched_entity **se, struct sched_entity **pse)
464 int se_depth, pse_depth;
467 * preemption test can be made between sibling entities who are in the
468 * same cfs_rq i.e who have a common parent. Walk up the hierarchy of
469 * both tasks until we find their ancestors who are siblings of common
473 /* First walk up until both entities are at same depth */
474 se_depth = (*se)->depth;
475 pse_depth = (*pse)->depth;
477 while (se_depth > pse_depth) {
479 *se = parent_entity(*se);
482 while (pse_depth > se_depth) {
484 *pse = parent_entity(*pse);
487 while (!is_same_group(*se, *pse)) {
488 *se = parent_entity(*se);
489 *pse = parent_entity(*pse);
493 static int tg_is_idle(struct task_group *tg)
498 static int cfs_rq_is_idle(struct cfs_rq *cfs_rq)
500 return cfs_rq->idle > 0;
503 static int se_is_idle(struct sched_entity *se)
505 if (entity_is_task(se))
506 return task_has_idle_policy(task_of(se));
507 return cfs_rq_is_idle(group_cfs_rq(se));
510 #else /* !CONFIG_FAIR_GROUP_SCHED */
512 #define for_each_sched_entity(se) \
513 for (; se; se = NULL)
515 static inline bool list_add_leaf_cfs_rq(struct cfs_rq *cfs_rq)
520 static inline void list_del_leaf_cfs_rq(struct cfs_rq *cfs_rq)
524 static inline void assert_list_leaf_cfs_rq(struct rq *rq)
528 #define for_each_leaf_cfs_rq_safe(rq, cfs_rq, pos) \
529 for (cfs_rq = &rq->cfs, pos = NULL; cfs_rq; cfs_rq = pos)
531 static inline struct sched_entity *parent_entity(struct sched_entity *se)
537 find_matching_se(struct sched_entity **se, struct sched_entity **pse)
541 static inline int tg_is_idle(struct task_group *tg)
546 static int cfs_rq_is_idle(struct cfs_rq *cfs_rq)
551 static int se_is_idle(struct sched_entity *se)
556 #endif /* CONFIG_FAIR_GROUP_SCHED */
558 static __always_inline
559 void account_cfs_rq_runtime(struct cfs_rq *cfs_rq, u64 delta_exec);
561 /**************************************************************
562 * Scheduling class tree data structure manipulation methods:
565 static inline u64 max_vruntime(u64 max_vruntime, u64 vruntime)
567 s64 delta = (s64)(vruntime - max_vruntime);
569 max_vruntime = vruntime;
574 static inline u64 min_vruntime(u64 min_vruntime, u64 vruntime)
576 s64 delta = (s64)(vruntime - min_vruntime);
578 min_vruntime = vruntime;
583 static inline bool entity_before(struct sched_entity *a,
584 struct sched_entity *b)
586 return (s64)(a->vruntime - b->vruntime) < 0;
589 #define __node_2_se(node) \
590 rb_entry((node), struct sched_entity, run_node)
592 static void update_min_vruntime(struct cfs_rq *cfs_rq)
594 struct sched_entity *curr = cfs_rq->curr;
595 struct rb_node *leftmost = rb_first_cached(&cfs_rq->tasks_timeline);
597 u64 vruntime = cfs_rq->min_vruntime;
601 vruntime = curr->vruntime;
606 if (leftmost) { /* non-empty tree */
607 struct sched_entity *se = __node_2_se(leftmost);
610 vruntime = se->vruntime;
612 vruntime = min_vruntime(vruntime, se->vruntime);
615 /* ensure we never gain time by being placed backwards. */
616 u64_u32_store(cfs_rq->min_vruntime,
617 max_vruntime(cfs_rq->min_vruntime, vruntime));
620 static inline bool __entity_less(struct rb_node *a, const struct rb_node *b)
622 return entity_before(__node_2_se(a), __node_2_se(b));
626 * Enqueue an entity into the rb-tree:
628 static void __enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
630 rb_add_cached(&se->run_node, &cfs_rq->tasks_timeline, __entity_less);
633 static void __dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
635 rb_erase_cached(&se->run_node, &cfs_rq->tasks_timeline);
638 struct sched_entity *__pick_first_entity(struct cfs_rq *cfs_rq)
640 struct rb_node *left = rb_first_cached(&cfs_rq->tasks_timeline);
645 return __node_2_se(left);
648 static struct sched_entity *__pick_next_entity(struct sched_entity *se)
650 struct rb_node *next = rb_next(&se->run_node);
655 return __node_2_se(next);
658 #ifdef CONFIG_SCHED_DEBUG
659 struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq)
661 struct rb_node *last = rb_last(&cfs_rq->tasks_timeline.rb_root);
666 return __node_2_se(last);
669 /**************************************************************
670 * Scheduling class statistics methods:
673 int sched_update_scaling(void)
675 unsigned int factor = get_update_sysctl_factor();
677 sched_nr_latency = DIV_ROUND_UP(sysctl_sched_latency,
678 sysctl_sched_min_granularity);
680 #define WRT_SYSCTL(name) \
681 (normalized_sysctl_##name = sysctl_##name / (factor))
682 WRT_SYSCTL(sched_min_granularity);
683 WRT_SYSCTL(sched_latency);
684 WRT_SYSCTL(sched_wakeup_granularity);
694 static inline u64 calc_delta_fair(u64 delta, struct sched_entity *se)
696 if (unlikely(se->load.weight != NICE_0_LOAD))
697 delta = __calc_delta(delta, NICE_0_LOAD, &se->load);
703 * The idea is to set a period in which each task runs once.
705 * When there are too many tasks (sched_nr_latency) we have to stretch
706 * this period because otherwise the slices get too small.
708 * p = (nr <= nl) ? l : l*nr/nl
710 static u64 __sched_period(unsigned long nr_running)
712 if (unlikely(nr_running > sched_nr_latency))
713 return nr_running * sysctl_sched_min_granularity;
715 return sysctl_sched_latency;
718 static bool sched_idle_cfs_rq(struct cfs_rq *cfs_rq);
721 * We calculate the wall-time slice from the period by taking a part
722 * proportional to the weight.
726 static u64 sched_slice(struct cfs_rq *cfs_rq, struct sched_entity *se)
728 unsigned int nr_running = cfs_rq->nr_running;
729 struct sched_entity *init_se = se;
730 unsigned int min_gran;
733 if (sched_feat(ALT_PERIOD))
734 nr_running = rq_of(cfs_rq)->cfs.h_nr_running;
736 slice = __sched_period(nr_running + !se->on_rq);
738 for_each_sched_entity(se) {
739 struct load_weight *load;
740 struct load_weight lw;
741 struct cfs_rq *qcfs_rq;
743 qcfs_rq = cfs_rq_of(se);
744 load = &qcfs_rq->load;
746 if (unlikely(!se->on_rq)) {
749 update_load_add(&lw, se->load.weight);
752 slice = __calc_delta(slice, se->load.weight, load);
755 if (sched_feat(BASE_SLICE)) {
756 if (se_is_idle(init_se) && !sched_idle_cfs_rq(cfs_rq))
757 min_gran = sysctl_sched_idle_min_granularity;
759 min_gran = sysctl_sched_min_granularity;
761 slice = max_t(u64, slice, min_gran);
768 * We calculate the vruntime slice of a to-be-inserted task.
772 static u64 sched_vslice(struct cfs_rq *cfs_rq, struct sched_entity *se)
774 return calc_delta_fair(sched_slice(cfs_rq, se), se);
780 static int select_idle_sibling(struct task_struct *p, int prev_cpu, int cpu);
781 static unsigned long task_h_load(struct task_struct *p);
782 static unsigned long capacity_of(int cpu);
784 /* Give new sched_entity start runnable values to heavy its load in infant time */
785 void init_entity_runnable_average(struct sched_entity *se)
787 struct sched_avg *sa = &se->avg;
789 memset(sa, 0, sizeof(*sa));
792 * Tasks are initialized with full load to be seen as heavy tasks until
793 * they get a chance to stabilize to their real load level.
794 * Group entities are initialized with zero load to reflect the fact that
795 * nothing has been attached to the task group yet.
797 if (entity_is_task(se))
798 sa->load_avg = scale_load_down(se->load.weight);
800 /* when this task enqueue'ed, it will contribute to its cfs_rq's load_avg */
804 * With new tasks being created, their initial util_avgs are extrapolated
805 * based on the cfs_rq's current util_avg:
807 * util_avg = cfs_rq->util_avg / (cfs_rq->load_avg + 1) * se.load.weight
809 * However, in many cases, the above util_avg does not give a desired
810 * value. Moreover, the sum of the util_avgs may be divergent, such
811 * as when the series is a harmonic series.
813 * To solve this problem, we also cap the util_avg of successive tasks to
814 * only 1/2 of the left utilization budget:
816 * util_avg_cap = (cpu_scale - cfs_rq->avg.util_avg) / 2^n
818 * where n denotes the nth task and cpu_scale the CPU capacity.
820 * For example, for a CPU with 1024 of capacity, a simplest series from
821 * the beginning would be like:
823 * task util_avg: 512, 256, 128, 64, 32, 16, 8, ...
824 * cfs_rq util_avg: 512, 768, 896, 960, 992, 1008, 1016, ...
826 * Finally, that extrapolated util_avg is clamped to the cap (util_avg_cap)
827 * if util_avg > util_avg_cap.
829 void post_init_entity_util_avg(struct task_struct *p)
831 struct sched_entity *se = &p->se;
832 struct cfs_rq *cfs_rq = cfs_rq_of(se);
833 struct sched_avg *sa = &se->avg;
834 long cpu_scale = arch_scale_cpu_capacity(cpu_of(rq_of(cfs_rq)));
835 long cap = (long)(cpu_scale - cfs_rq->avg.util_avg) / 2;
837 if (p->sched_class != &fair_sched_class) {
839 * For !fair tasks do:
841 update_cfs_rq_load_avg(now, cfs_rq);
842 attach_entity_load_avg(cfs_rq, se);
843 switched_from_fair(rq, p);
845 * such that the next switched_to_fair() has the
848 se->avg.last_update_time = cfs_rq_clock_pelt(cfs_rq);
853 if (cfs_rq->avg.util_avg != 0) {
854 sa->util_avg = cfs_rq->avg.util_avg * se->load.weight;
855 sa->util_avg /= (cfs_rq->avg.load_avg + 1);
857 if (sa->util_avg > cap)
864 sa->runnable_avg = sa->util_avg;
867 #else /* !CONFIG_SMP */
868 void init_entity_runnable_average(struct sched_entity *se)
871 void post_init_entity_util_avg(struct task_struct *p)
874 static void update_tg_load_avg(struct cfs_rq *cfs_rq)
877 #endif /* CONFIG_SMP */
880 * Update the current task's runtime statistics.
882 static void update_curr(struct cfs_rq *cfs_rq)
884 struct sched_entity *curr = cfs_rq->curr;
885 u64 now = rq_clock_task(rq_of(cfs_rq));
891 delta_exec = now - curr->exec_start;
892 if (unlikely((s64)delta_exec <= 0))
895 curr->exec_start = now;
897 if (schedstat_enabled()) {
898 struct sched_statistics *stats;
900 stats = __schedstats_from_se(curr);
901 __schedstat_set(stats->exec_max,
902 max(delta_exec, stats->exec_max));
905 curr->sum_exec_runtime += delta_exec;
906 schedstat_add(cfs_rq->exec_clock, delta_exec);
908 curr->vruntime += calc_delta_fair(delta_exec, curr);
909 update_min_vruntime(cfs_rq);
911 if (entity_is_task(curr)) {
912 struct task_struct *curtask = task_of(curr);
914 trace_sched_stat_runtime(curtask, delta_exec, curr->vruntime);
915 cgroup_account_cputime(curtask, delta_exec);
916 account_group_exec_runtime(curtask, delta_exec);
919 account_cfs_rq_runtime(cfs_rq, delta_exec);
922 static void update_curr_fair(struct rq *rq)
924 update_curr(cfs_rq_of(&rq->curr->se));
928 update_stats_wait_start_fair(struct cfs_rq *cfs_rq, struct sched_entity *se)
930 struct sched_statistics *stats;
931 struct task_struct *p = NULL;
933 if (!schedstat_enabled())
936 stats = __schedstats_from_se(se);
938 if (entity_is_task(se))
941 __update_stats_wait_start(rq_of(cfs_rq), p, stats);
945 update_stats_wait_end_fair(struct cfs_rq *cfs_rq, struct sched_entity *se)
947 struct sched_statistics *stats;
948 struct task_struct *p = NULL;
950 if (!schedstat_enabled())
953 stats = __schedstats_from_se(se);
956 * When the sched_schedstat changes from 0 to 1, some sched se
957 * maybe already in the runqueue, the se->statistics.wait_start
958 * will be 0.So it will let the delta wrong. We need to avoid this
961 if (unlikely(!schedstat_val(stats->wait_start)))
964 if (entity_is_task(se))
967 __update_stats_wait_end(rq_of(cfs_rq), p, stats);
971 update_stats_enqueue_sleeper_fair(struct cfs_rq *cfs_rq, struct sched_entity *se)
973 struct sched_statistics *stats;
974 struct task_struct *tsk = NULL;
976 if (!schedstat_enabled())
979 stats = __schedstats_from_se(se);
981 if (entity_is_task(se))
984 __update_stats_enqueue_sleeper(rq_of(cfs_rq), tsk, stats);
988 * Task is being enqueued - update stats:
991 update_stats_enqueue_fair(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
993 if (!schedstat_enabled())
997 * Are we enqueueing a waiting task? (for current tasks
998 * a dequeue/enqueue event is a NOP)
1000 if (se != cfs_rq->curr)
1001 update_stats_wait_start_fair(cfs_rq, se);
1003 if (flags & ENQUEUE_WAKEUP)
1004 update_stats_enqueue_sleeper_fair(cfs_rq, se);
1008 update_stats_dequeue_fair(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
1011 if (!schedstat_enabled())
1015 * Mark the end of the wait period if dequeueing a
1018 if (se != cfs_rq->curr)
1019 update_stats_wait_end_fair(cfs_rq, se);
1021 if ((flags & DEQUEUE_SLEEP) && entity_is_task(se)) {
1022 struct task_struct *tsk = task_of(se);
1025 /* XXX racy against TTWU */
1026 state = READ_ONCE(tsk->__state);
1027 if (state & TASK_INTERRUPTIBLE)
1028 __schedstat_set(tsk->stats.sleep_start,
1029 rq_clock(rq_of(cfs_rq)));
1030 if (state & TASK_UNINTERRUPTIBLE)
1031 __schedstat_set(tsk->stats.block_start,
1032 rq_clock(rq_of(cfs_rq)));
1037 * We are picking a new current task - update its stats:
1040 update_stats_curr_start(struct cfs_rq *cfs_rq, struct sched_entity *se)
1043 * We are starting a new run period:
1045 se->exec_start = rq_clock_task(rq_of(cfs_rq));
1048 /**************************************************
1049 * Scheduling class queueing methods:
1053 #define NUMA_IMBALANCE_MIN 2
1056 adjust_numa_imbalance(int imbalance, int dst_running, int imb_numa_nr)
1059 * Allow a NUMA imbalance if busy CPUs is less than the maximum
1060 * threshold. Above this threshold, individual tasks may be contending
1061 * for both memory bandwidth and any shared HT resources. This is an
1062 * approximation as the number of running tasks may not be related to
1063 * the number of busy CPUs due to sched_setaffinity.
1065 if (dst_running > imb_numa_nr)
1069 * Allow a small imbalance based on a simple pair of communicating
1070 * tasks that remain local when the destination is lightly loaded.
1072 if (imbalance <= NUMA_IMBALANCE_MIN)
1077 #endif /* CONFIG_NUMA */
1079 #ifdef CONFIG_NUMA_BALANCING
1081 * Approximate time to scan a full NUMA task in ms. The task scan period is
1082 * calculated based on the tasks virtual memory size and
1083 * numa_balancing_scan_size.
1085 unsigned int sysctl_numa_balancing_scan_period_min = 1000;
1086 unsigned int sysctl_numa_balancing_scan_period_max = 60000;
1088 /* Portion of address space to scan in MB */
1089 unsigned int sysctl_numa_balancing_scan_size = 256;
1091 /* Scan @scan_size MB every @scan_period after an initial @scan_delay in ms */
1092 unsigned int sysctl_numa_balancing_scan_delay = 1000;
1094 /* The page with hint page fault latency < threshold in ms is considered hot */
1095 unsigned int sysctl_numa_balancing_hot_threshold = MSEC_PER_SEC;
1097 /* Restrict the NUMA promotion throughput (MB/s) for each target node. */
1098 unsigned int sysctl_numa_balancing_promote_rate_limit = 65536;
1101 refcount_t refcount;
1103 spinlock_t lock; /* nr_tasks, tasks */
1108 struct rcu_head rcu;
1109 unsigned long total_faults;
1110 unsigned long max_faults_cpu;
1112 * faults[] array is split into two regions: faults_mem and faults_cpu.
1114 * Faults_cpu is used to decide whether memory should move
1115 * towards the CPU. As a consequence, these stats are weighted
1116 * more by CPU use than by memory faults.
1118 unsigned long faults[];
1122 * For functions that can be called in multiple contexts that permit reading
1123 * ->numa_group (see struct task_struct for locking rules).
1125 static struct numa_group *deref_task_numa_group(struct task_struct *p)
1127 return rcu_dereference_check(p->numa_group, p == current ||
1128 (lockdep_is_held(__rq_lockp(task_rq(p))) && !READ_ONCE(p->on_cpu)));
1131 static struct numa_group *deref_curr_numa_group(struct task_struct *p)
1133 return rcu_dereference_protected(p->numa_group, p == current);
1136 static inline unsigned long group_faults_priv(struct numa_group *ng);
1137 static inline unsigned long group_faults_shared(struct numa_group *ng);
1139 static unsigned int task_nr_scan_windows(struct task_struct *p)
1141 unsigned long rss = 0;
1142 unsigned long nr_scan_pages;
1145 * Calculations based on RSS as non-present and empty pages are skipped
1146 * by the PTE scanner and NUMA hinting faults should be trapped based
1149 nr_scan_pages = sysctl_numa_balancing_scan_size << (20 - PAGE_SHIFT);
1150 rss = get_mm_rss(p->mm);
1152 rss = nr_scan_pages;
1154 rss = round_up(rss, nr_scan_pages);
1155 return rss / nr_scan_pages;
1158 /* For sanity's sake, never scan more PTEs than MAX_SCAN_WINDOW MB/sec. */
1159 #define MAX_SCAN_WINDOW 2560
1161 static unsigned int task_scan_min(struct task_struct *p)
1163 unsigned int scan_size = READ_ONCE(sysctl_numa_balancing_scan_size);
1164 unsigned int scan, floor;
1165 unsigned int windows = 1;
1167 if (scan_size < MAX_SCAN_WINDOW)
1168 windows = MAX_SCAN_WINDOW / scan_size;
1169 floor = 1000 / windows;
1171 scan = sysctl_numa_balancing_scan_period_min / task_nr_scan_windows(p);
1172 return max_t(unsigned int, floor, scan);
1175 static unsigned int task_scan_start(struct task_struct *p)
1177 unsigned long smin = task_scan_min(p);
1178 unsigned long period = smin;
1179 struct numa_group *ng;
1181 /* Scale the maximum scan period with the amount of shared memory. */
1183 ng = rcu_dereference(p->numa_group);
1185 unsigned long shared = group_faults_shared(ng);
1186 unsigned long private = group_faults_priv(ng);
1188 period *= refcount_read(&ng->refcount);
1189 period *= shared + 1;
1190 period /= private + shared + 1;
1194 return max(smin, period);
1197 static unsigned int task_scan_max(struct task_struct *p)
1199 unsigned long smin = task_scan_min(p);
1201 struct numa_group *ng;
1203 /* Watch for min being lower than max due to floor calculations */
1204 smax = sysctl_numa_balancing_scan_period_max / task_nr_scan_windows(p);
1206 /* Scale the maximum scan period with the amount of shared memory. */
1207 ng = deref_curr_numa_group(p);
1209 unsigned long shared = group_faults_shared(ng);
1210 unsigned long private = group_faults_priv(ng);
1211 unsigned long period = smax;
1213 period *= refcount_read(&ng->refcount);
1214 period *= shared + 1;
1215 period /= private + shared + 1;
1217 smax = max(smax, period);
1220 return max(smin, smax);
1223 static void account_numa_enqueue(struct rq *rq, struct task_struct *p)
1225 rq->nr_numa_running += (p->numa_preferred_nid != NUMA_NO_NODE);
1226 rq->nr_preferred_running += (p->numa_preferred_nid == task_node(p));
1229 static void account_numa_dequeue(struct rq *rq, struct task_struct *p)
1231 rq->nr_numa_running -= (p->numa_preferred_nid != NUMA_NO_NODE);
1232 rq->nr_preferred_running -= (p->numa_preferred_nid == task_node(p));
1235 /* Shared or private faults. */
1236 #define NR_NUMA_HINT_FAULT_TYPES 2
1238 /* Memory and CPU locality */
1239 #define NR_NUMA_HINT_FAULT_STATS (NR_NUMA_HINT_FAULT_TYPES * 2)
1241 /* Averaged statistics, and temporary buffers. */
1242 #define NR_NUMA_HINT_FAULT_BUCKETS (NR_NUMA_HINT_FAULT_STATS * 2)
1244 pid_t task_numa_group_id(struct task_struct *p)
1246 struct numa_group *ng;
1250 ng = rcu_dereference(p->numa_group);
1259 * The averaged statistics, shared & private, memory & CPU,
1260 * occupy the first half of the array. The second half of the
1261 * array is for current counters, which are averaged into the
1262 * first set by task_numa_placement.
1264 static inline int task_faults_idx(enum numa_faults_stats s, int nid, int priv)
1266 return NR_NUMA_HINT_FAULT_TYPES * (s * nr_node_ids + nid) + priv;
1269 static inline unsigned long task_faults(struct task_struct *p, int nid)
1271 if (!p->numa_faults)
1274 return p->numa_faults[task_faults_idx(NUMA_MEM, nid, 0)] +
1275 p->numa_faults[task_faults_idx(NUMA_MEM, nid, 1)];
1278 static inline unsigned long group_faults(struct task_struct *p, int nid)
1280 struct numa_group *ng = deref_task_numa_group(p);
1285 return ng->faults[task_faults_idx(NUMA_MEM, nid, 0)] +
1286 ng->faults[task_faults_idx(NUMA_MEM, nid, 1)];
1289 static inline unsigned long group_faults_cpu(struct numa_group *group, int nid)
1291 return group->faults[task_faults_idx(NUMA_CPU, nid, 0)] +
1292 group->faults[task_faults_idx(NUMA_CPU, nid, 1)];
1295 static inline unsigned long group_faults_priv(struct numa_group *ng)
1297 unsigned long faults = 0;
1300 for_each_online_node(node) {
1301 faults += ng->faults[task_faults_idx(NUMA_MEM, node, 1)];
1307 static inline unsigned long group_faults_shared(struct numa_group *ng)
1309 unsigned long faults = 0;
1312 for_each_online_node(node) {
1313 faults += ng->faults[task_faults_idx(NUMA_MEM, node, 0)];
1320 * A node triggering more than 1/3 as many NUMA faults as the maximum is
1321 * considered part of a numa group's pseudo-interleaving set. Migrations
1322 * between these nodes are slowed down, to allow things to settle down.
1324 #define ACTIVE_NODE_FRACTION 3
1326 static bool numa_is_active_node(int nid, struct numa_group *ng)
1328 return group_faults_cpu(ng, nid) * ACTIVE_NODE_FRACTION > ng->max_faults_cpu;
1331 /* Handle placement on systems where not all nodes are directly connected. */
1332 static unsigned long score_nearby_nodes(struct task_struct *p, int nid,
1333 int lim_dist, bool task)
1335 unsigned long score = 0;
1339 * All nodes are directly connected, and the same distance
1340 * from each other. No need for fancy placement algorithms.
1342 if (sched_numa_topology_type == NUMA_DIRECT)
1345 /* sched_max_numa_distance may be changed in parallel. */
1346 max_dist = READ_ONCE(sched_max_numa_distance);
1348 * This code is called for each node, introducing N^2 complexity,
1349 * which should be ok given the number of nodes rarely exceeds 8.
1351 for_each_online_node(node) {
1352 unsigned long faults;
1353 int dist = node_distance(nid, node);
1356 * The furthest away nodes in the system are not interesting
1357 * for placement; nid was already counted.
1359 if (dist >= max_dist || node == nid)
1363 * On systems with a backplane NUMA topology, compare groups
1364 * of nodes, and move tasks towards the group with the most
1365 * memory accesses. When comparing two nodes at distance
1366 * "hoplimit", only nodes closer by than "hoplimit" are part
1367 * of each group. Skip other nodes.
1369 if (sched_numa_topology_type == NUMA_BACKPLANE && dist >= lim_dist)
1372 /* Add up the faults from nearby nodes. */
1374 faults = task_faults(p, node);
1376 faults = group_faults(p, node);
1379 * On systems with a glueless mesh NUMA topology, there are
1380 * no fixed "groups of nodes". Instead, nodes that are not
1381 * directly connected bounce traffic through intermediate
1382 * nodes; a numa_group can occupy any set of nodes.
1383 * The further away a node is, the less the faults count.
1384 * This seems to result in good task placement.
1386 if (sched_numa_topology_type == NUMA_GLUELESS_MESH) {
1387 faults *= (max_dist - dist);
1388 faults /= (max_dist - LOCAL_DISTANCE);
1398 * These return the fraction of accesses done by a particular task, or
1399 * task group, on a particular numa node. The group weight is given a
1400 * larger multiplier, in order to group tasks together that are almost
1401 * evenly spread out between numa nodes.
1403 static inline unsigned long task_weight(struct task_struct *p, int nid,
1406 unsigned long faults, total_faults;
1408 if (!p->numa_faults)
1411 total_faults = p->total_numa_faults;
1416 faults = task_faults(p, nid);
1417 faults += score_nearby_nodes(p, nid, dist, true);
1419 return 1000 * faults / total_faults;
1422 static inline unsigned long group_weight(struct task_struct *p, int nid,
1425 struct numa_group *ng = deref_task_numa_group(p);
1426 unsigned long faults, total_faults;
1431 total_faults = ng->total_faults;
1436 faults = group_faults(p, nid);
1437 faults += score_nearby_nodes(p, nid, dist, false);
1439 return 1000 * faults / total_faults;
1443 * If memory tiering mode is enabled, cpupid of slow memory page is
1444 * used to record scan time instead of CPU and PID. When tiering mode
1445 * is disabled at run time, the scan time (in cpupid) will be
1446 * interpreted as CPU and PID. So CPU needs to be checked to avoid to
1447 * access out of array bound.
1449 static inline bool cpupid_valid(int cpupid)
1451 return cpupid_to_cpu(cpupid) < nr_cpu_ids;
1455 * For memory tiering mode, if there are enough free pages (more than
1456 * enough watermark defined here) in fast memory node, to take full
1457 * advantage of fast memory capacity, all recently accessed slow
1458 * memory pages will be migrated to fast memory node without
1459 * considering hot threshold.
1461 static bool pgdat_free_space_enough(struct pglist_data *pgdat)
1464 unsigned long enough_wmark;
1466 enough_wmark = max(1UL * 1024 * 1024 * 1024 >> PAGE_SHIFT,
1467 pgdat->node_present_pages >> 4);
1468 for (z = pgdat->nr_zones - 1; z >= 0; z--) {
1469 struct zone *zone = pgdat->node_zones + z;
1471 if (!populated_zone(zone))
1474 if (zone_watermark_ok(zone, 0,
1475 wmark_pages(zone, WMARK_PROMO) + enough_wmark,
1483 * For memory tiering mode, when page tables are scanned, the scan
1484 * time will be recorded in struct page in addition to make page
1485 * PROT_NONE for slow memory page. So when the page is accessed, in
1486 * hint page fault handler, the hint page fault latency is calculated
1489 * hint page fault latency = hint page fault time - scan time
1491 * The smaller the hint page fault latency, the higher the possibility
1492 * for the page to be hot.
1494 static int numa_hint_fault_latency(struct page *page)
1496 int last_time, time;
1498 time = jiffies_to_msecs(jiffies);
1499 last_time = xchg_page_access_time(page, time);
1501 return (time - last_time) & PAGE_ACCESS_TIME_MASK;
1505 * For memory tiering mode, too high promotion/demotion throughput may
1506 * hurt application latency. So we provide a mechanism to rate limit
1507 * the number of pages that are tried to be promoted.
1509 static bool numa_promotion_rate_limit(struct pglist_data *pgdat,
1510 unsigned long rate_limit, int nr)
1512 unsigned long nr_cand;
1513 unsigned int now, start;
1515 now = jiffies_to_msecs(jiffies);
1516 mod_node_page_state(pgdat, PGPROMOTE_CANDIDATE, nr);
1517 nr_cand = node_page_state(pgdat, PGPROMOTE_CANDIDATE);
1518 start = pgdat->nbp_rl_start;
1519 if (now - start > MSEC_PER_SEC &&
1520 cmpxchg(&pgdat->nbp_rl_start, start, now) == start)
1521 pgdat->nbp_rl_nr_cand = nr_cand;
1522 if (nr_cand - pgdat->nbp_rl_nr_cand >= rate_limit)
1527 #define NUMA_MIGRATION_ADJUST_STEPS 16
1529 static void numa_promotion_adjust_threshold(struct pglist_data *pgdat,
1530 unsigned long rate_limit,
1531 unsigned int ref_th)
1533 unsigned int now, start, th_period, unit_th, th;
1534 unsigned long nr_cand, ref_cand, diff_cand;
1536 now = jiffies_to_msecs(jiffies);
1537 th_period = sysctl_numa_balancing_scan_period_max;
1538 start = pgdat->nbp_th_start;
1539 if (now - start > th_period &&
1540 cmpxchg(&pgdat->nbp_th_start, start, now) == start) {
1541 ref_cand = rate_limit *
1542 sysctl_numa_balancing_scan_period_max / MSEC_PER_SEC;
1543 nr_cand = node_page_state(pgdat, PGPROMOTE_CANDIDATE);
1544 diff_cand = nr_cand - pgdat->nbp_th_nr_cand;
1545 unit_th = ref_th * 2 / NUMA_MIGRATION_ADJUST_STEPS;
1546 th = pgdat->nbp_threshold ? : ref_th;
1547 if (diff_cand > ref_cand * 11 / 10)
1548 th = max(th - unit_th, unit_th);
1549 else if (diff_cand < ref_cand * 9 / 10)
1550 th = min(th + unit_th, ref_th * 2);
1551 pgdat->nbp_th_nr_cand = nr_cand;
1552 pgdat->nbp_threshold = th;
1556 bool should_numa_migrate_memory(struct task_struct *p, struct page * page,
1557 int src_nid, int dst_cpu)
1559 struct numa_group *ng = deref_curr_numa_group(p);
1560 int dst_nid = cpu_to_node(dst_cpu);
1561 int last_cpupid, this_cpupid;
1564 * The pages in slow memory node should be migrated according
1565 * to hot/cold instead of private/shared.
1567 if (sysctl_numa_balancing_mode & NUMA_BALANCING_MEMORY_TIERING &&
1568 !node_is_toptier(src_nid)) {
1569 struct pglist_data *pgdat;
1570 unsigned long rate_limit;
1571 unsigned int latency, th, def_th;
1573 pgdat = NODE_DATA(dst_nid);
1574 if (pgdat_free_space_enough(pgdat)) {
1575 /* workload changed, reset hot threshold */
1576 pgdat->nbp_threshold = 0;
1580 def_th = sysctl_numa_balancing_hot_threshold;
1581 rate_limit = sysctl_numa_balancing_promote_rate_limit << \
1583 numa_promotion_adjust_threshold(pgdat, rate_limit, def_th);
1585 th = pgdat->nbp_threshold ? : def_th;
1586 latency = numa_hint_fault_latency(page);
1590 return !numa_promotion_rate_limit(pgdat, rate_limit,
1591 thp_nr_pages(page));
1594 this_cpupid = cpu_pid_to_cpupid(dst_cpu, current->pid);
1595 last_cpupid = page_cpupid_xchg_last(page, this_cpupid);
1597 if (!(sysctl_numa_balancing_mode & NUMA_BALANCING_MEMORY_TIERING) &&
1598 !node_is_toptier(src_nid) && !cpupid_valid(last_cpupid))
1602 * Allow first faults or private faults to migrate immediately early in
1603 * the lifetime of a task. The magic number 4 is based on waiting for
1604 * two full passes of the "multi-stage node selection" test that is
1607 if ((p->numa_preferred_nid == NUMA_NO_NODE || p->numa_scan_seq <= 4) &&
1608 (cpupid_pid_unset(last_cpupid) || cpupid_match_pid(p, last_cpupid)))
1612 * Multi-stage node selection is used in conjunction with a periodic
1613 * migration fault to build a temporal task<->page relation. By using
1614 * a two-stage filter we remove short/unlikely relations.
1616 * Using P(p) ~ n_p / n_t as per frequentist probability, we can equate
1617 * a task's usage of a particular page (n_p) per total usage of this
1618 * page (n_t) (in a given time-span) to a probability.
1620 * Our periodic faults will sample this probability and getting the
1621 * same result twice in a row, given these samples are fully
1622 * independent, is then given by P(n)^2, provided our sample period
1623 * is sufficiently short compared to the usage pattern.
1625 * This quadric squishes small probabilities, making it less likely we
1626 * act on an unlikely task<->page relation.
1628 if (!cpupid_pid_unset(last_cpupid) &&
1629 cpupid_to_nid(last_cpupid) != dst_nid)
1632 /* Always allow migrate on private faults */
1633 if (cpupid_match_pid(p, last_cpupid))
1636 /* A shared fault, but p->numa_group has not been set up yet. */
1641 * Destination node is much more heavily used than the source
1642 * node? Allow migration.
1644 if (group_faults_cpu(ng, dst_nid) > group_faults_cpu(ng, src_nid) *
1645 ACTIVE_NODE_FRACTION)
1649 * Distribute memory according to CPU & memory use on each node,
1650 * with 3/4 hysteresis to avoid unnecessary memory migrations:
1652 * faults_cpu(dst) 3 faults_cpu(src)
1653 * --------------- * - > ---------------
1654 * faults_mem(dst) 4 faults_mem(src)
1656 return group_faults_cpu(ng, dst_nid) * group_faults(p, src_nid) * 3 >
1657 group_faults_cpu(ng, src_nid) * group_faults(p, dst_nid) * 4;
1661 * 'numa_type' describes the node at the moment of load balancing.
1664 /* The node has spare capacity that can be used to run more tasks. */
1667 * The node is fully used and the tasks don't compete for more CPU
1668 * cycles. Nevertheless, some tasks might wait before running.
1672 * The node is overloaded and can't provide expected CPU cycles to all
1678 /* Cached statistics for all CPUs within a node */
1681 unsigned long runnable;
1683 /* Total compute capacity of CPUs on a node */
1684 unsigned long compute_capacity;
1685 unsigned int nr_running;
1686 unsigned int weight;
1687 enum numa_type node_type;
1691 static inline bool is_core_idle(int cpu)
1693 #ifdef CONFIG_SCHED_SMT
1696 for_each_cpu(sibling, cpu_smt_mask(cpu)) {
1700 if (!idle_cpu(sibling))
1708 struct task_numa_env {
1709 struct task_struct *p;
1711 int src_cpu, src_nid;
1712 int dst_cpu, dst_nid;
1715 struct numa_stats src_stats, dst_stats;
1720 struct task_struct *best_task;
1725 static unsigned long cpu_load(struct rq *rq);
1726 static unsigned long cpu_runnable(struct rq *rq);
1729 numa_type numa_classify(unsigned int imbalance_pct,
1730 struct numa_stats *ns)
1732 if ((ns->nr_running > ns->weight) &&
1733 (((ns->compute_capacity * 100) < (ns->util * imbalance_pct)) ||
1734 ((ns->compute_capacity * imbalance_pct) < (ns->runnable * 100))))
1735 return node_overloaded;
1737 if ((ns->nr_running < ns->weight) ||
1738 (((ns->compute_capacity * 100) > (ns->util * imbalance_pct)) &&
1739 ((ns->compute_capacity * imbalance_pct) > (ns->runnable * 100))))
1740 return node_has_spare;
1742 return node_fully_busy;
1745 #ifdef CONFIG_SCHED_SMT
1746 /* Forward declarations of select_idle_sibling helpers */
1747 static inline bool test_idle_cores(int cpu);
1748 static inline int numa_idle_core(int idle_core, int cpu)
1750 if (!static_branch_likely(&sched_smt_present) ||
1751 idle_core >= 0 || !test_idle_cores(cpu))
1755 * Prefer cores instead of packing HT siblings
1756 * and triggering future load balancing.
1758 if (is_core_idle(cpu))
1764 static inline int numa_idle_core(int idle_core, int cpu)
1771 * Gather all necessary information to make NUMA balancing placement
1772 * decisions that are compatible with standard load balancer. This
1773 * borrows code and logic from update_sg_lb_stats but sharing a
1774 * common implementation is impractical.
1776 static void update_numa_stats(struct task_numa_env *env,
1777 struct numa_stats *ns, int nid,
1780 int cpu, idle_core = -1;
1782 memset(ns, 0, sizeof(*ns));
1786 for_each_cpu(cpu, cpumask_of_node(nid)) {
1787 struct rq *rq = cpu_rq(cpu);
1789 ns->load += cpu_load(rq);
1790 ns->runnable += cpu_runnable(rq);
1791 ns->util += cpu_util_cfs(cpu);
1792 ns->nr_running += rq->cfs.h_nr_running;
1793 ns->compute_capacity += capacity_of(cpu);
1795 if (find_idle && !rq->nr_running && idle_cpu(cpu)) {
1796 if (READ_ONCE(rq->numa_migrate_on) ||
1797 !cpumask_test_cpu(cpu, env->p->cpus_ptr))
1800 if (ns->idle_cpu == -1)
1803 idle_core = numa_idle_core(idle_core, cpu);
1808 ns->weight = cpumask_weight(cpumask_of_node(nid));
1810 ns->node_type = numa_classify(env->imbalance_pct, ns);
1813 ns->idle_cpu = idle_core;
1816 static void task_numa_assign(struct task_numa_env *env,
1817 struct task_struct *p, long imp)
1819 struct rq *rq = cpu_rq(env->dst_cpu);
1821 /* Check if run-queue part of active NUMA balance. */
1822 if (env->best_cpu != env->dst_cpu && xchg(&rq->numa_migrate_on, 1)) {
1824 int start = env->dst_cpu;
1826 /* Find alternative idle CPU. */
1827 for_each_cpu_wrap(cpu, cpumask_of_node(env->dst_nid), start) {
1828 if (cpu == env->best_cpu || !idle_cpu(cpu) ||
1829 !cpumask_test_cpu(cpu, env->p->cpus_ptr)) {
1834 rq = cpu_rq(env->dst_cpu);
1835 if (!xchg(&rq->numa_migrate_on, 1))
1839 /* Failed to find an alternative idle CPU */
1845 * Clear previous best_cpu/rq numa-migrate flag, since task now
1846 * found a better CPU to move/swap.
1848 if (env->best_cpu != -1 && env->best_cpu != env->dst_cpu) {
1849 rq = cpu_rq(env->best_cpu);
1850 WRITE_ONCE(rq->numa_migrate_on, 0);
1854 put_task_struct(env->best_task);
1859 env->best_imp = imp;
1860 env->best_cpu = env->dst_cpu;
1863 static bool load_too_imbalanced(long src_load, long dst_load,
1864 struct task_numa_env *env)
1867 long orig_src_load, orig_dst_load;
1868 long src_capacity, dst_capacity;
1871 * The load is corrected for the CPU capacity available on each node.
1874 * ------------ vs ---------
1875 * src_capacity dst_capacity
1877 src_capacity = env->src_stats.compute_capacity;
1878 dst_capacity = env->dst_stats.compute_capacity;
1880 imb = abs(dst_load * src_capacity - src_load * dst_capacity);
1882 orig_src_load = env->src_stats.load;
1883 orig_dst_load = env->dst_stats.load;
1885 old_imb = abs(orig_dst_load * src_capacity - orig_src_load * dst_capacity);
1887 /* Would this change make things worse? */
1888 return (imb > old_imb);
1892 * Maximum NUMA importance can be 1998 (2*999);
1893 * SMALLIMP @ 30 would be close to 1998/64.
1894 * Used to deter task migration.
1899 * This checks if the overall compute and NUMA accesses of the system would
1900 * be improved if the source tasks was migrated to the target dst_cpu taking
1901 * into account that it might be best if task running on the dst_cpu should
1902 * be exchanged with the source task
1904 static bool task_numa_compare(struct task_numa_env *env,
1905 long taskimp, long groupimp, bool maymove)
1907 struct numa_group *cur_ng, *p_ng = deref_curr_numa_group(env->p);
1908 struct rq *dst_rq = cpu_rq(env->dst_cpu);
1909 long imp = p_ng ? groupimp : taskimp;
1910 struct task_struct *cur;
1911 long src_load, dst_load;
1912 int dist = env->dist;
1915 bool stopsearch = false;
1917 if (READ_ONCE(dst_rq->numa_migrate_on))
1921 cur = rcu_dereference(dst_rq->curr);
1922 if (cur && ((cur->flags & PF_EXITING) || is_idle_task(cur)))
1926 * Because we have preemption enabled we can get migrated around and
1927 * end try selecting ourselves (current == env->p) as a swap candidate.
1929 if (cur == env->p) {
1935 if (maymove && moveimp >= env->best_imp)
1941 /* Skip this swap candidate if cannot move to the source cpu. */
1942 if (!cpumask_test_cpu(env->src_cpu, cur->cpus_ptr))
1946 * Skip this swap candidate if it is not moving to its preferred
1947 * node and the best task is.
1949 if (env->best_task &&
1950 env->best_task->numa_preferred_nid == env->src_nid &&
1951 cur->numa_preferred_nid != env->src_nid) {
1956 * "imp" is the fault differential for the source task between the
1957 * source and destination node. Calculate the total differential for
1958 * the source task and potential destination task. The more negative
1959 * the value is, the more remote accesses that would be expected to
1960 * be incurred if the tasks were swapped.
1962 * If dst and source tasks are in the same NUMA group, or not
1963 * in any group then look only at task weights.
1965 cur_ng = rcu_dereference(cur->numa_group);
1966 if (cur_ng == p_ng) {
1968 * Do not swap within a group or between tasks that have
1969 * no group if there is spare capacity. Swapping does
1970 * not address the load imbalance and helps one task at
1971 * the cost of punishing another.
1973 if (env->dst_stats.node_type == node_has_spare)
1976 imp = taskimp + task_weight(cur, env->src_nid, dist) -
1977 task_weight(cur, env->dst_nid, dist);
1979 * Add some hysteresis to prevent swapping the
1980 * tasks within a group over tiny differences.
1986 * Compare the group weights. If a task is all by itself
1987 * (not part of a group), use the task weight instead.
1990 imp += group_weight(cur, env->src_nid, dist) -
1991 group_weight(cur, env->dst_nid, dist);
1993 imp += task_weight(cur, env->src_nid, dist) -
1994 task_weight(cur, env->dst_nid, dist);
1997 /* Discourage picking a task already on its preferred node */
1998 if (cur->numa_preferred_nid == env->dst_nid)
2002 * Encourage picking a task that moves to its preferred node.
2003 * This potentially makes imp larger than it's maximum of
2004 * 1998 (see SMALLIMP and task_weight for why) but in this
2005 * case, it does not matter.
2007 if (cur->numa_preferred_nid == env->src_nid)
2010 if (maymove && moveimp > imp && moveimp > env->best_imp) {
2017 * Prefer swapping with a task moving to its preferred node over a
2020 if (env->best_task && cur->numa_preferred_nid == env->src_nid &&
2021 env->best_task->numa_preferred_nid != env->src_nid) {
2026 * If the NUMA importance is less than SMALLIMP,
2027 * task migration might only result in ping pong
2028 * of tasks and also hurt performance due to cache
2031 if (imp < SMALLIMP || imp <= env->best_imp + SMALLIMP / 2)
2035 * In the overloaded case, try and keep the load balanced.
2037 load = task_h_load(env->p) - task_h_load(cur);
2041 dst_load = env->dst_stats.load + load;
2042 src_load = env->src_stats.load - load;
2044 if (load_too_imbalanced(src_load, dst_load, env))
2048 /* Evaluate an idle CPU for a task numa move. */
2050 int cpu = env->dst_stats.idle_cpu;
2052 /* Nothing cached so current CPU went idle since the search. */
2057 * If the CPU is no longer truly idle and the previous best CPU
2058 * is, keep using it.
2060 if (!idle_cpu(cpu) && env->best_cpu >= 0 &&
2061 idle_cpu(env->best_cpu)) {
2062 cpu = env->best_cpu;
2068 task_numa_assign(env, cur, imp);
2071 * If a move to idle is allowed because there is capacity or load
2072 * balance improves then stop the search. While a better swap
2073 * candidate may exist, a search is not free.
2075 if (maymove && !cur && env->best_cpu >= 0 && idle_cpu(env->best_cpu))
2079 * If a swap candidate must be identified and the current best task
2080 * moves its preferred node then stop the search.
2082 if (!maymove && env->best_task &&
2083 env->best_task->numa_preferred_nid == env->src_nid) {
2092 static void task_numa_find_cpu(struct task_numa_env *env,
2093 long taskimp, long groupimp)
2095 bool maymove = false;
2099 * If dst node has spare capacity, then check if there is an
2100 * imbalance that would be overruled by the load balancer.
2102 if (env->dst_stats.node_type == node_has_spare) {
2103 unsigned int imbalance;
2104 int src_running, dst_running;
2107 * Would movement cause an imbalance? Note that if src has
2108 * more running tasks that the imbalance is ignored as the
2109 * move improves the imbalance from the perspective of the
2110 * CPU load balancer.
2112 src_running = env->src_stats.nr_running - 1;
2113 dst_running = env->dst_stats.nr_running + 1;
2114 imbalance = max(0, dst_running - src_running);
2115 imbalance = adjust_numa_imbalance(imbalance, dst_running,
2118 /* Use idle CPU if there is no imbalance */
2121 if (env->dst_stats.idle_cpu >= 0) {
2122 env->dst_cpu = env->dst_stats.idle_cpu;
2123 task_numa_assign(env, NULL, 0);
2128 long src_load, dst_load, load;
2130 * If the improvement from just moving env->p direction is better
2131 * than swapping tasks around, check if a move is possible.
2133 load = task_h_load(env->p);
2134 dst_load = env->dst_stats.load + load;
2135 src_load = env->src_stats.load - load;
2136 maymove = !load_too_imbalanced(src_load, dst_load, env);
2139 for_each_cpu(cpu, cpumask_of_node(env->dst_nid)) {
2140 /* Skip this CPU if the source task cannot migrate */
2141 if (!cpumask_test_cpu(cpu, env->p->cpus_ptr))
2145 if (task_numa_compare(env, taskimp, groupimp, maymove))
2150 static int task_numa_migrate(struct task_struct *p)
2152 struct task_numa_env env = {
2155 .src_cpu = task_cpu(p),
2156 .src_nid = task_node(p),
2158 .imbalance_pct = 112,
2164 unsigned long taskweight, groupweight;
2165 struct sched_domain *sd;
2166 long taskimp, groupimp;
2167 struct numa_group *ng;
2172 * Pick the lowest SD_NUMA domain, as that would have the smallest
2173 * imbalance and would be the first to start moving tasks about.
2175 * And we want to avoid any moving of tasks about, as that would create
2176 * random movement of tasks -- counter the numa conditions we're trying
2180 sd = rcu_dereference(per_cpu(sd_numa, env.src_cpu));
2182 env.imbalance_pct = 100 + (sd->imbalance_pct - 100) / 2;
2183 env.imb_numa_nr = sd->imb_numa_nr;
2188 * Cpusets can break the scheduler domain tree into smaller
2189 * balance domains, some of which do not cross NUMA boundaries.
2190 * Tasks that are "trapped" in such domains cannot be migrated
2191 * elsewhere, so there is no point in (re)trying.
2193 if (unlikely(!sd)) {
2194 sched_setnuma(p, task_node(p));
2198 env.dst_nid = p->numa_preferred_nid;
2199 dist = env.dist = node_distance(env.src_nid, env.dst_nid);
2200 taskweight = task_weight(p, env.src_nid, dist);
2201 groupweight = group_weight(p, env.src_nid, dist);
2202 update_numa_stats(&env, &env.src_stats, env.src_nid, false);
2203 taskimp = task_weight(p, env.dst_nid, dist) - taskweight;
2204 groupimp = group_weight(p, env.dst_nid, dist) - groupweight;
2205 update_numa_stats(&env, &env.dst_stats, env.dst_nid, true);
2207 /* Try to find a spot on the preferred nid. */
2208 task_numa_find_cpu(&env, taskimp, groupimp);
2211 * Look at other nodes in these cases:
2212 * - there is no space available on the preferred_nid
2213 * - the task is part of a numa_group that is interleaved across
2214 * multiple NUMA nodes; in order to better consolidate the group,
2215 * we need to check other locations.
2217 ng = deref_curr_numa_group(p);
2218 if (env.best_cpu == -1 || (ng && ng->active_nodes > 1)) {
2219 for_each_node_state(nid, N_CPU) {
2220 if (nid == env.src_nid || nid == p->numa_preferred_nid)
2223 dist = node_distance(env.src_nid, env.dst_nid);
2224 if (sched_numa_topology_type == NUMA_BACKPLANE &&
2226 taskweight = task_weight(p, env.src_nid, dist);
2227 groupweight = group_weight(p, env.src_nid, dist);
2230 /* Only consider nodes where both task and groups benefit */
2231 taskimp = task_weight(p, nid, dist) - taskweight;
2232 groupimp = group_weight(p, nid, dist) - groupweight;
2233 if (taskimp < 0 && groupimp < 0)
2238 update_numa_stats(&env, &env.dst_stats, env.dst_nid, true);
2239 task_numa_find_cpu(&env, taskimp, groupimp);
2244 * If the task is part of a workload that spans multiple NUMA nodes,
2245 * and is migrating into one of the workload's active nodes, remember
2246 * this node as the task's preferred numa node, so the workload can
2248 * A task that migrated to a second choice node will be better off
2249 * trying for a better one later. Do not set the preferred node here.
2252 if (env.best_cpu == -1)
2255 nid = cpu_to_node(env.best_cpu);
2257 if (nid != p->numa_preferred_nid)
2258 sched_setnuma(p, nid);
2261 /* No better CPU than the current one was found. */
2262 if (env.best_cpu == -1) {
2263 trace_sched_stick_numa(p, env.src_cpu, NULL, -1);
2267 best_rq = cpu_rq(env.best_cpu);
2268 if (env.best_task == NULL) {
2269 ret = migrate_task_to(p, env.best_cpu);
2270 WRITE_ONCE(best_rq->numa_migrate_on, 0);
2272 trace_sched_stick_numa(p, env.src_cpu, NULL, env.best_cpu);
2276 ret = migrate_swap(p, env.best_task, env.best_cpu, env.src_cpu);
2277 WRITE_ONCE(best_rq->numa_migrate_on, 0);
2280 trace_sched_stick_numa(p, env.src_cpu, env.best_task, env.best_cpu);
2281 put_task_struct(env.best_task);
2285 /* Attempt to migrate a task to a CPU on the preferred node. */
2286 static void numa_migrate_preferred(struct task_struct *p)
2288 unsigned long interval = HZ;
2290 /* This task has no NUMA fault statistics yet */
2291 if (unlikely(p->numa_preferred_nid == NUMA_NO_NODE || !p->numa_faults))
2294 /* Periodically retry migrating the task to the preferred node */
2295 interval = min(interval, msecs_to_jiffies(p->numa_scan_period) / 16);
2296 p->numa_migrate_retry = jiffies + interval;
2298 /* Success if task is already running on preferred CPU */
2299 if (task_node(p) == p->numa_preferred_nid)
2302 /* Otherwise, try migrate to a CPU on the preferred node */
2303 task_numa_migrate(p);
2307 * Find out how many nodes the workload is actively running on. Do this by
2308 * tracking the nodes from which NUMA hinting faults are triggered. This can
2309 * be different from the set of nodes where the workload's memory is currently
2312 static void numa_group_count_active_nodes(struct numa_group *numa_group)
2314 unsigned long faults, max_faults = 0;
2315 int nid, active_nodes = 0;
2317 for_each_node_state(nid, N_CPU) {
2318 faults = group_faults_cpu(numa_group, nid);
2319 if (faults > max_faults)
2320 max_faults = faults;
2323 for_each_node_state(nid, N_CPU) {
2324 faults = group_faults_cpu(numa_group, nid);
2325 if (faults * ACTIVE_NODE_FRACTION > max_faults)
2329 numa_group->max_faults_cpu = max_faults;
2330 numa_group->active_nodes = active_nodes;
2334 * When adapting the scan rate, the period is divided into NUMA_PERIOD_SLOTS
2335 * increments. The more local the fault statistics are, the higher the scan
2336 * period will be for the next scan window. If local/(local+remote) ratio is
2337 * below NUMA_PERIOD_THRESHOLD (where range of ratio is 1..NUMA_PERIOD_SLOTS)
2338 * the scan period will decrease. Aim for 70% local accesses.
2340 #define NUMA_PERIOD_SLOTS 10
2341 #define NUMA_PERIOD_THRESHOLD 7
2344 * Increase the scan period (slow down scanning) if the majority of
2345 * our memory is already on our local node, or if the majority of
2346 * the page accesses are shared with other processes.
2347 * Otherwise, decrease the scan period.
2349 static void update_task_scan_period(struct task_struct *p,
2350 unsigned long shared, unsigned long private)
2352 unsigned int period_slot;
2353 int lr_ratio, ps_ratio;
2356 unsigned long remote = p->numa_faults_locality[0];
2357 unsigned long local = p->numa_faults_locality[1];
2360 * If there were no record hinting faults then either the task is
2361 * completely idle or all activity is in areas that are not of interest
2362 * to automatic numa balancing. Related to that, if there were failed
2363 * migration then it implies we are migrating too quickly or the local
2364 * node is overloaded. In either case, scan slower
2366 if (local + shared == 0 || p->numa_faults_locality[2]) {
2367 p->numa_scan_period = min(p->numa_scan_period_max,
2368 p->numa_scan_period << 1);
2370 p->mm->numa_next_scan = jiffies +
2371 msecs_to_jiffies(p->numa_scan_period);
2377 * Prepare to scale scan period relative to the current period.
2378 * == NUMA_PERIOD_THRESHOLD scan period stays the same
2379 * < NUMA_PERIOD_THRESHOLD scan period decreases (scan faster)
2380 * >= NUMA_PERIOD_THRESHOLD scan period increases (scan slower)
2382 period_slot = DIV_ROUND_UP(p->numa_scan_period, NUMA_PERIOD_SLOTS);
2383 lr_ratio = (local * NUMA_PERIOD_SLOTS) / (local + remote);
2384 ps_ratio = (private * NUMA_PERIOD_SLOTS) / (private + shared);
2386 if (ps_ratio >= NUMA_PERIOD_THRESHOLD) {
2388 * Most memory accesses are local. There is no need to
2389 * do fast NUMA scanning, since memory is already local.
2391 int slot = ps_ratio - NUMA_PERIOD_THRESHOLD;
2394 diff = slot * period_slot;
2395 } else if (lr_ratio >= NUMA_PERIOD_THRESHOLD) {
2397 * Most memory accesses are shared with other tasks.
2398 * There is no point in continuing fast NUMA scanning,
2399 * since other tasks may just move the memory elsewhere.
2401 int slot = lr_ratio - NUMA_PERIOD_THRESHOLD;
2404 diff = slot * period_slot;
2407 * Private memory faults exceed (SLOTS-THRESHOLD)/SLOTS,
2408 * yet they are not on the local NUMA node. Speed up
2409 * NUMA scanning to get the memory moved over.
2411 int ratio = max(lr_ratio, ps_ratio);
2412 diff = -(NUMA_PERIOD_THRESHOLD - ratio) * period_slot;
2415 p->numa_scan_period = clamp(p->numa_scan_period + diff,
2416 task_scan_min(p), task_scan_max(p));
2417 memset(p->numa_faults_locality, 0, sizeof(p->numa_faults_locality));
2421 * Get the fraction of time the task has been running since the last
2422 * NUMA placement cycle. The scheduler keeps similar statistics, but
2423 * decays those on a 32ms period, which is orders of magnitude off
2424 * from the dozens-of-seconds NUMA balancing period. Use the scheduler
2425 * stats only if the task is so new there are no NUMA statistics yet.
2427 static u64 numa_get_avg_runtime(struct task_struct *p, u64 *period)
2429 u64 runtime, delta, now;
2430 /* Use the start of this time slice to avoid calculations. */
2431 now = p->se.exec_start;
2432 runtime = p->se.sum_exec_runtime;
2434 if (p->last_task_numa_placement) {
2435 delta = runtime - p->last_sum_exec_runtime;
2436 *period = now - p->last_task_numa_placement;
2438 /* Avoid time going backwards, prevent potential divide error: */
2439 if (unlikely((s64)*period < 0))
2442 delta = p->se.avg.load_sum;
2443 *period = LOAD_AVG_MAX;
2446 p->last_sum_exec_runtime = runtime;
2447 p->last_task_numa_placement = now;
2453 * Determine the preferred nid for a task in a numa_group. This needs to
2454 * be done in a way that produces consistent results with group_weight,
2455 * otherwise workloads might not converge.
2457 static int preferred_group_nid(struct task_struct *p, int nid)
2462 /* Direct connections between all NUMA nodes. */
2463 if (sched_numa_topology_type == NUMA_DIRECT)
2467 * On a system with glueless mesh NUMA topology, group_weight
2468 * scores nodes according to the number of NUMA hinting faults on
2469 * both the node itself, and on nearby nodes.
2471 if (sched_numa_topology_type == NUMA_GLUELESS_MESH) {
2472 unsigned long score, max_score = 0;
2473 int node, max_node = nid;
2475 dist = sched_max_numa_distance;
2477 for_each_node_state(node, N_CPU) {
2478 score = group_weight(p, node, dist);
2479 if (score > max_score) {
2488 * Finding the preferred nid in a system with NUMA backplane
2489 * interconnect topology is more involved. The goal is to locate
2490 * tasks from numa_groups near each other in the system, and
2491 * untangle workloads from different sides of the system. This requires
2492 * searching down the hierarchy of node groups, recursively searching
2493 * inside the highest scoring group of nodes. The nodemask tricks
2494 * keep the complexity of the search down.
2496 nodes = node_states[N_CPU];
2497 for (dist = sched_max_numa_distance; dist > LOCAL_DISTANCE; dist--) {
2498 unsigned long max_faults = 0;
2499 nodemask_t max_group = NODE_MASK_NONE;
2502 /* Are there nodes at this distance from each other? */
2503 if (!find_numa_distance(dist))
2506 for_each_node_mask(a, nodes) {
2507 unsigned long faults = 0;
2508 nodemask_t this_group;
2509 nodes_clear(this_group);
2511 /* Sum group's NUMA faults; includes a==b case. */
2512 for_each_node_mask(b, nodes) {
2513 if (node_distance(a, b) < dist) {
2514 faults += group_faults(p, b);
2515 node_set(b, this_group);
2516 node_clear(b, nodes);
2520 /* Remember the top group. */
2521 if (faults > max_faults) {
2522 max_faults = faults;
2523 max_group = this_group;
2525 * subtle: at the smallest distance there is
2526 * just one node left in each "group", the
2527 * winner is the preferred nid.
2532 /* Next round, evaluate the nodes within max_group. */
2540 static void task_numa_placement(struct task_struct *p)
2542 int seq, nid, max_nid = NUMA_NO_NODE;
2543 unsigned long max_faults = 0;
2544 unsigned long fault_types[2] = { 0, 0 };
2545 unsigned long total_faults;
2546 u64 runtime, period;
2547 spinlock_t *group_lock = NULL;
2548 struct numa_group *ng;
2551 * The p->mm->numa_scan_seq field gets updated without
2552 * exclusive access. Use READ_ONCE() here to ensure
2553 * that the field is read in a single access:
2555 seq = READ_ONCE(p->mm->numa_scan_seq);
2556 if (p->numa_scan_seq == seq)
2558 p->numa_scan_seq = seq;
2559 p->numa_scan_period_max = task_scan_max(p);
2561 total_faults = p->numa_faults_locality[0] +
2562 p->numa_faults_locality[1];
2563 runtime = numa_get_avg_runtime(p, &period);
2565 /* If the task is part of a group prevent parallel updates to group stats */
2566 ng = deref_curr_numa_group(p);
2568 group_lock = &ng->lock;
2569 spin_lock_irq(group_lock);
2572 /* Find the node with the highest number of faults */
2573 for_each_online_node(nid) {
2574 /* Keep track of the offsets in numa_faults array */
2575 int mem_idx, membuf_idx, cpu_idx, cpubuf_idx;
2576 unsigned long faults = 0, group_faults = 0;
2579 for (priv = 0; priv < NR_NUMA_HINT_FAULT_TYPES; priv++) {
2580 long diff, f_diff, f_weight;
2582 mem_idx = task_faults_idx(NUMA_MEM, nid, priv);
2583 membuf_idx = task_faults_idx(NUMA_MEMBUF, nid, priv);
2584 cpu_idx = task_faults_idx(NUMA_CPU, nid, priv);
2585 cpubuf_idx = task_faults_idx(NUMA_CPUBUF, nid, priv);
2587 /* Decay existing window, copy faults since last scan */
2588 diff = p->numa_faults[membuf_idx] - p->numa_faults[mem_idx] / 2;
2589 fault_types[priv] += p->numa_faults[membuf_idx];
2590 p->numa_faults[membuf_idx] = 0;
2593 * Normalize the faults_from, so all tasks in a group
2594 * count according to CPU use, instead of by the raw
2595 * number of faults. Tasks with little runtime have
2596 * little over-all impact on throughput, and thus their
2597 * faults are less important.
2599 f_weight = div64_u64(runtime << 16, period + 1);
2600 f_weight = (f_weight * p->numa_faults[cpubuf_idx]) /
2602 f_diff = f_weight - p->numa_faults[cpu_idx] / 2;
2603 p->numa_faults[cpubuf_idx] = 0;
2605 p->numa_faults[mem_idx] += diff;
2606 p->numa_faults[cpu_idx] += f_diff;
2607 faults += p->numa_faults[mem_idx];
2608 p->total_numa_faults += diff;
2611 * safe because we can only change our own group
2613 * mem_idx represents the offset for a given
2614 * nid and priv in a specific region because it
2615 * is at the beginning of the numa_faults array.
2617 ng->faults[mem_idx] += diff;
2618 ng->faults[cpu_idx] += f_diff;
2619 ng->total_faults += diff;
2620 group_faults += ng->faults[mem_idx];
2625 if (faults > max_faults) {
2626 max_faults = faults;
2629 } else if (group_faults > max_faults) {
2630 max_faults = group_faults;
2635 /* Cannot migrate task to CPU-less node */
2636 if (max_nid != NUMA_NO_NODE && !node_state(max_nid, N_CPU)) {
2637 int near_nid = max_nid;
2638 int distance, near_distance = INT_MAX;
2640 for_each_node_state(nid, N_CPU) {
2641 distance = node_distance(max_nid, nid);
2642 if (distance < near_distance) {
2644 near_distance = distance;
2651 numa_group_count_active_nodes(ng);
2652 spin_unlock_irq(group_lock);
2653 max_nid = preferred_group_nid(p, max_nid);
2657 /* Set the new preferred node */
2658 if (max_nid != p->numa_preferred_nid)
2659 sched_setnuma(p, max_nid);
2662 update_task_scan_period(p, fault_types[0], fault_types[1]);
2665 static inline int get_numa_group(struct numa_group *grp)
2667 return refcount_inc_not_zero(&grp->refcount);
2670 static inline void put_numa_group(struct numa_group *grp)
2672 if (refcount_dec_and_test(&grp->refcount))
2673 kfree_rcu(grp, rcu);
2676 static void task_numa_group(struct task_struct *p, int cpupid, int flags,
2679 struct numa_group *grp, *my_grp;
2680 struct task_struct *tsk;
2682 int cpu = cpupid_to_cpu(cpupid);
2685 if (unlikely(!deref_curr_numa_group(p))) {
2686 unsigned int size = sizeof(struct numa_group) +
2687 NR_NUMA_HINT_FAULT_STATS *
2688 nr_node_ids * sizeof(unsigned long);
2690 grp = kzalloc(size, GFP_KERNEL | __GFP_NOWARN);
2694 refcount_set(&grp->refcount, 1);
2695 grp->active_nodes = 1;
2696 grp->max_faults_cpu = 0;
2697 spin_lock_init(&grp->lock);
2700 for (i = 0; i < NR_NUMA_HINT_FAULT_STATS * nr_node_ids; i++)
2701 grp->faults[i] = p->numa_faults[i];
2703 grp->total_faults = p->total_numa_faults;
2706 rcu_assign_pointer(p->numa_group, grp);
2710 tsk = READ_ONCE(cpu_rq(cpu)->curr);
2712 if (!cpupid_match_pid(tsk, cpupid))
2715 grp = rcu_dereference(tsk->numa_group);
2719 my_grp = deref_curr_numa_group(p);
2724 * Only join the other group if its bigger; if we're the bigger group,
2725 * the other task will join us.
2727 if (my_grp->nr_tasks > grp->nr_tasks)
2731 * Tie-break on the grp address.
2733 if (my_grp->nr_tasks == grp->nr_tasks && my_grp > grp)
2736 /* Always join threads in the same process. */
2737 if (tsk->mm == current->mm)
2740 /* Simple filter to avoid false positives due to PID collisions */
2741 if (flags & TNF_SHARED)
2744 /* Update priv based on whether false sharing was detected */
2747 if (join && !get_numa_group(grp))
2755 WARN_ON_ONCE(irqs_disabled());
2756 double_lock_irq(&my_grp->lock, &grp->lock);
2758 for (i = 0; i < NR_NUMA_HINT_FAULT_STATS * nr_node_ids; i++) {
2759 my_grp->faults[i] -= p->numa_faults[i];
2760 grp->faults[i] += p->numa_faults[i];
2762 my_grp->total_faults -= p->total_numa_faults;
2763 grp->total_faults += p->total_numa_faults;
2768 spin_unlock(&my_grp->lock);
2769 spin_unlock_irq(&grp->lock);
2771 rcu_assign_pointer(p->numa_group, grp);
2773 put_numa_group(my_grp);
2782 * Get rid of NUMA statistics associated with a task (either current or dead).
2783 * If @final is set, the task is dead and has reached refcount zero, so we can
2784 * safely free all relevant data structures. Otherwise, there might be
2785 * concurrent reads from places like load balancing and procfs, and we should
2786 * reset the data back to default state without freeing ->numa_faults.
2788 void task_numa_free(struct task_struct *p, bool final)
2790 /* safe: p either is current or is being freed by current */
2791 struct numa_group *grp = rcu_dereference_raw(p->numa_group);
2792 unsigned long *numa_faults = p->numa_faults;
2793 unsigned long flags;
2800 spin_lock_irqsave(&grp->lock, flags);
2801 for (i = 0; i < NR_NUMA_HINT_FAULT_STATS * nr_node_ids; i++)
2802 grp->faults[i] -= p->numa_faults[i];
2803 grp->total_faults -= p->total_numa_faults;
2806 spin_unlock_irqrestore(&grp->lock, flags);
2807 RCU_INIT_POINTER(p->numa_group, NULL);
2808 put_numa_group(grp);
2812 p->numa_faults = NULL;
2815 p->total_numa_faults = 0;
2816 for (i = 0; i < NR_NUMA_HINT_FAULT_STATS * nr_node_ids; i++)
2822 * Got a PROT_NONE fault for a page on @node.
2824 void task_numa_fault(int last_cpupid, int mem_node, int pages, int flags)
2826 struct task_struct *p = current;
2827 bool migrated = flags & TNF_MIGRATED;
2828 int cpu_node = task_node(current);
2829 int local = !!(flags & TNF_FAULT_LOCAL);
2830 struct numa_group *ng;
2833 if (!static_branch_likely(&sched_numa_balancing))
2836 /* for example, ksmd faulting in a user's mm */
2841 * NUMA faults statistics are unnecessary for the slow memory
2842 * node for memory tiering mode.
2844 if (!node_is_toptier(mem_node) &&
2845 (sysctl_numa_balancing_mode & NUMA_BALANCING_MEMORY_TIERING ||
2846 !cpupid_valid(last_cpupid)))
2849 /* Allocate buffer to track faults on a per-node basis */
2850 if (unlikely(!p->numa_faults)) {
2851 int size = sizeof(*p->numa_faults) *
2852 NR_NUMA_HINT_FAULT_BUCKETS * nr_node_ids;
2854 p->numa_faults = kzalloc(size, GFP_KERNEL|__GFP_NOWARN);
2855 if (!p->numa_faults)
2858 p->total_numa_faults = 0;
2859 memset(p->numa_faults_locality, 0, sizeof(p->numa_faults_locality));
2863 * First accesses are treated as private, otherwise consider accesses
2864 * to be private if the accessing pid has not changed
2866 if (unlikely(last_cpupid == (-1 & LAST_CPUPID_MASK))) {
2869 priv = cpupid_match_pid(p, last_cpupid);
2870 if (!priv && !(flags & TNF_NO_GROUP))
2871 task_numa_group(p, last_cpupid, flags, &priv);
2875 * If a workload spans multiple NUMA nodes, a shared fault that
2876 * occurs wholly within the set of nodes that the workload is
2877 * actively using should be counted as local. This allows the
2878 * scan rate to slow down when a workload has settled down.
2880 ng = deref_curr_numa_group(p);
2881 if (!priv && !local && ng && ng->active_nodes > 1 &&
2882 numa_is_active_node(cpu_node, ng) &&
2883 numa_is_active_node(mem_node, ng))
2887 * Retry to migrate task to preferred node periodically, in case it
2888 * previously failed, or the scheduler moved us.
2890 if (time_after(jiffies, p->numa_migrate_retry)) {
2891 task_numa_placement(p);
2892 numa_migrate_preferred(p);
2896 p->numa_pages_migrated += pages;
2897 if (flags & TNF_MIGRATE_FAIL)
2898 p->numa_faults_locality[2] += pages;
2900 p->numa_faults[task_faults_idx(NUMA_MEMBUF, mem_node, priv)] += pages;
2901 p->numa_faults[task_faults_idx(NUMA_CPUBUF, cpu_node, priv)] += pages;
2902 p->numa_faults_locality[local] += pages;
2905 static void reset_ptenuma_scan(struct task_struct *p)
2908 * We only did a read acquisition of the mmap sem, so
2909 * p->mm->numa_scan_seq is written to without exclusive access
2910 * and the update is not guaranteed to be atomic. That's not
2911 * much of an issue though, since this is just used for
2912 * statistical sampling. Use READ_ONCE/WRITE_ONCE, which are not
2913 * expensive, to avoid any form of compiler optimizations:
2915 WRITE_ONCE(p->mm->numa_scan_seq, READ_ONCE(p->mm->numa_scan_seq) + 1);
2916 p->mm->numa_scan_offset = 0;
2920 * The expensive part of numa migration is done from task_work context.
2921 * Triggered from task_tick_numa().
2923 static void task_numa_work(struct callback_head *work)
2925 unsigned long migrate, next_scan, now = jiffies;
2926 struct task_struct *p = current;
2927 struct mm_struct *mm = p->mm;
2928 u64 runtime = p->se.sum_exec_runtime;
2929 MA_STATE(mas, &mm->mm_mt, 0, 0);
2930 struct vm_area_struct *vma;
2931 unsigned long start, end;
2932 unsigned long nr_pte_updates = 0;
2933 long pages, virtpages;
2935 SCHED_WARN_ON(p != container_of(work, struct task_struct, numa_work));
2939 * Who cares about NUMA placement when they're dying.
2941 * NOTE: make sure not to dereference p->mm before this check,
2942 * exit_task_work() happens _after_ exit_mm() so we could be called
2943 * without p->mm even though we still had it when we enqueued this
2946 if (p->flags & PF_EXITING)
2949 if (!mm->numa_next_scan) {
2950 mm->numa_next_scan = now +
2951 msecs_to_jiffies(sysctl_numa_balancing_scan_delay);
2955 * Enforce maximal scan/migration frequency..
2957 migrate = mm->numa_next_scan;
2958 if (time_before(now, migrate))
2961 if (p->numa_scan_period == 0) {
2962 p->numa_scan_period_max = task_scan_max(p);
2963 p->numa_scan_period = task_scan_start(p);
2966 next_scan = now + msecs_to_jiffies(p->numa_scan_period);
2967 if (cmpxchg(&mm->numa_next_scan, migrate, next_scan) != migrate)
2971 * Delay this task enough that another task of this mm will likely win
2972 * the next time around.
2974 p->node_stamp += 2 * TICK_NSEC;
2976 start = mm->numa_scan_offset;
2977 pages = sysctl_numa_balancing_scan_size;
2978 pages <<= 20 - PAGE_SHIFT; /* MB in pages */
2979 virtpages = pages * 8; /* Scan up to this much virtual space */
2984 if (!mmap_read_trylock(mm))
2986 mas_set(&mas, start);
2987 vma = mas_find(&mas, ULONG_MAX);
2989 reset_ptenuma_scan(p);
2991 mas_set(&mas, start);
2992 vma = mas_find(&mas, ULONG_MAX);
2995 for (; vma; vma = mas_find(&mas, ULONG_MAX)) {
2996 if (!vma_migratable(vma) || !vma_policy_mof(vma) ||
2997 is_vm_hugetlb_page(vma) || (vma->vm_flags & VM_MIXEDMAP)) {
3002 * Shared library pages mapped by multiple processes are not
3003 * migrated as it is expected they are cache replicated. Avoid
3004 * hinting faults in read-only file-backed mappings or the vdso
3005 * as migrating the pages will be of marginal benefit.
3008 (vma->vm_file && (vma->vm_flags & (VM_READ|VM_WRITE)) == (VM_READ)))
3012 * Skip inaccessible VMAs to avoid any confusion between
3013 * PROT_NONE and NUMA hinting ptes
3015 if (!vma_is_accessible(vma))
3019 start = max(start, vma->vm_start);
3020 end = ALIGN(start + (pages << PAGE_SHIFT), HPAGE_SIZE);
3021 end = min(end, vma->vm_end);
3022 nr_pte_updates = change_prot_numa(vma, start, end);
3025 * Try to scan sysctl_numa_balancing_size worth of
3026 * hpages that have at least one present PTE that
3027 * is not already pte-numa. If the VMA contains
3028 * areas that are unused or already full of prot_numa
3029 * PTEs, scan up to virtpages, to skip through those
3033 pages -= (end - start) >> PAGE_SHIFT;
3034 virtpages -= (end - start) >> PAGE_SHIFT;
3037 if (pages <= 0 || virtpages <= 0)
3041 } while (end != vma->vm_end);
3046 * It is possible to reach the end of the VMA list but the last few
3047 * VMAs are not guaranteed to the vma_migratable. If they are not, we
3048 * would find the !migratable VMA on the next scan but not reset the
3049 * scanner to the start so check it now.
3052 mm->numa_scan_offset = start;
3054 reset_ptenuma_scan(p);
3055 mmap_read_unlock(mm);
3058 * Make sure tasks use at least 32x as much time to run other code
3059 * than they used here, to limit NUMA PTE scanning overhead to 3% max.
3060 * Usually update_task_scan_period slows down scanning enough; on an
3061 * overloaded system we need to limit overhead on a per task basis.
3063 if (unlikely(p->se.sum_exec_runtime != runtime)) {
3064 u64 diff = p->se.sum_exec_runtime - runtime;
3065 p->node_stamp += 32 * diff;
3069 void init_numa_balancing(unsigned long clone_flags, struct task_struct *p)
3072 struct mm_struct *mm = p->mm;
3075 mm_users = atomic_read(&mm->mm_users);
3076 if (mm_users == 1) {
3077 mm->numa_next_scan = jiffies + msecs_to_jiffies(sysctl_numa_balancing_scan_delay);
3078 mm->numa_scan_seq = 0;
3082 p->numa_scan_seq = mm ? mm->numa_scan_seq : 0;
3083 p->numa_scan_period = sysctl_numa_balancing_scan_delay;
3084 p->numa_migrate_retry = 0;
3085 /* Protect against double add, see task_tick_numa and task_numa_work */
3086 p->numa_work.next = &p->numa_work;
3087 p->numa_faults = NULL;
3088 p->numa_pages_migrated = 0;
3089 p->total_numa_faults = 0;
3090 RCU_INIT_POINTER(p->numa_group, NULL);
3091 p->last_task_numa_placement = 0;
3092 p->last_sum_exec_runtime = 0;
3094 init_task_work(&p->numa_work, task_numa_work);
3096 /* New address space, reset the preferred nid */
3097 if (!(clone_flags & CLONE_VM)) {
3098 p->numa_preferred_nid = NUMA_NO_NODE;
3103 * New thread, keep existing numa_preferred_nid which should be copied
3104 * already by arch_dup_task_struct but stagger when scans start.
3109 delay = min_t(unsigned int, task_scan_max(current),
3110 current->numa_scan_period * mm_users * NSEC_PER_MSEC);
3111 delay += 2 * TICK_NSEC;
3112 p->node_stamp = delay;
3117 * Drive the periodic memory faults..
3119 static void task_tick_numa(struct rq *rq, struct task_struct *curr)
3121 struct callback_head *work = &curr->numa_work;
3125 * We don't care about NUMA placement if we don't have memory.
3127 if (!curr->mm || (curr->flags & (PF_EXITING | PF_KTHREAD)) || work->next != work)
3131 * Using runtime rather than walltime has the dual advantage that
3132 * we (mostly) drive the selection from busy threads and that the
3133 * task needs to have done some actual work before we bother with
3136 now = curr->se.sum_exec_runtime;
3137 period = (u64)curr->numa_scan_period * NSEC_PER_MSEC;
3139 if (now > curr->node_stamp + period) {
3140 if (!curr->node_stamp)
3141 curr->numa_scan_period = task_scan_start(curr);
3142 curr->node_stamp += period;
3144 if (!time_before(jiffies, curr->mm->numa_next_scan))
3145 task_work_add(curr, work, TWA_RESUME);
3149 static void update_scan_period(struct task_struct *p, int new_cpu)
3151 int src_nid = cpu_to_node(task_cpu(p));
3152 int dst_nid = cpu_to_node(new_cpu);
3154 if (!static_branch_likely(&sched_numa_balancing))
3157 if (!p->mm || !p->numa_faults || (p->flags & PF_EXITING))
3160 if (src_nid == dst_nid)
3164 * Allow resets if faults have been trapped before one scan
3165 * has completed. This is most likely due to a new task that
3166 * is pulled cross-node due to wakeups or load balancing.
3168 if (p->numa_scan_seq) {
3170 * Avoid scan adjustments if moving to the preferred
3171 * node or if the task was not previously running on
3172 * the preferred node.
3174 if (dst_nid == p->numa_preferred_nid ||
3175 (p->numa_preferred_nid != NUMA_NO_NODE &&
3176 src_nid != p->numa_preferred_nid))
3180 p->numa_scan_period = task_scan_start(p);
3184 static void task_tick_numa(struct rq *rq, struct task_struct *curr)
3188 static inline void account_numa_enqueue(struct rq *rq, struct task_struct *p)
3192 static inline void account_numa_dequeue(struct rq *rq, struct task_struct *p)
3196 static inline void update_scan_period(struct task_struct *p, int new_cpu)
3200 #endif /* CONFIG_NUMA_BALANCING */
3203 account_entity_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se)
3205 update_load_add(&cfs_rq->load, se->load.weight);
3207 if (entity_is_task(se)) {
3208 struct rq *rq = rq_of(cfs_rq);
3210 account_numa_enqueue(rq, task_of(se));
3211 list_add(&se->group_node, &rq->cfs_tasks);
3214 cfs_rq->nr_running++;
3216 cfs_rq->idle_nr_running++;
3220 account_entity_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se)
3222 update_load_sub(&cfs_rq->load, se->load.weight);
3224 if (entity_is_task(se)) {
3225 account_numa_dequeue(rq_of(cfs_rq), task_of(se));
3226 list_del_init(&se->group_node);
3229 cfs_rq->nr_running--;
3231 cfs_rq->idle_nr_running--;
3235 * Signed add and clamp on underflow.
3237 * Explicitly do a load-store to ensure the intermediate value never hits
3238 * memory. This allows lockless observations without ever seeing the negative
3241 #define add_positive(_ptr, _val) do { \
3242 typeof(_ptr) ptr = (_ptr); \
3243 typeof(_val) val = (_val); \
3244 typeof(*ptr) res, var = READ_ONCE(*ptr); \
3248 if (val < 0 && res > var) \
3251 WRITE_ONCE(*ptr, res); \
3255 * Unsigned subtract and clamp on underflow.
3257 * Explicitly do a load-store to ensure the intermediate value never hits
3258 * memory. This allows lockless observations without ever seeing the negative
3261 #define sub_positive(_ptr, _val) do { \
3262 typeof(_ptr) ptr = (_ptr); \
3263 typeof(*ptr) val = (_val); \
3264 typeof(*ptr) res, var = READ_ONCE(*ptr); \
3268 WRITE_ONCE(*ptr, res); \
3272 * Remove and clamp on negative, from a local variable.
3274 * A variant of sub_positive(), which does not use explicit load-store
3275 * and is thus optimized for local variable updates.
3277 #define lsub_positive(_ptr, _val) do { \
3278 typeof(_ptr) ptr = (_ptr); \
3279 *ptr -= min_t(typeof(*ptr), *ptr, _val); \
3284 enqueue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
3286 cfs_rq->avg.load_avg += se->avg.load_avg;
3287 cfs_rq->avg.load_sum += se_weight(se) * se->avg.load_sum;
3291 dequeue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
3293 sub_positive(&cfs_rq->avg.load_avg, se->avg.load_avg);
3294 sub_positive(&cfs_rq->avg.load_sum, se_weight(se) * se->avg.load_sum);
3295 /* See update_cfs_rq_load_avg() */
3296 cfs_rq->avg.load_sum = max_t(u32, cfs_rq->avg.load_sum,
3297 cfs_rq->avg.load_avg * PELT_MIN_DIVIDER);
3301 enqueue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) { }
3303 dequeue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) { }
3306 static void reweight_entity(struct cfs_rq *cfs_rq, struct sched_entity *se,
3307 unsigned long weight)
3310 /* commit outstanding execution time */
3311 if (cfs_rq->curr == se)
3312 update_curr(cfs_rq);
3313 update_load_sub(&cfs_rq->load, se->load.weight);
3315 dequeue_load_avg(cfs_rq, se);
3317 update_load_set(&se->load, weight);
3321 u32 divider = get_pelt_divider(&se->avg);
3323 se->avg.load_avg = div_u64(se_weight(se) * se->avg.load_sum, divider);
3327 enqueue_load_avg(cfs_rq, se);
3329 update_load_add(&cfs_rq->load, se->load.weight);
3333 void reweight_task(struct task_struct *p, int prio)
3335 struct sched_entity *se = &p->se;
3336 struct cfs_rq *cfs_rq = cfs_rq_of(se);
3337 struct load_weight *load = &se->load;
3338 unsigned long weight = scale_load(sched_prio_to_weight[prio]);
3340 reweight_entity(cfs_rq, se, weight);
3341 load->inv_weight = sched_prio_to_wmult[prio];
3344 static inline int throttled_hierarchy(struct cfs_rq *cfs_rq);
3346 #ifdef CONFIG_FAIR_GROUP_SCHED
3349 * All this does is approximate the hierarchical proportion which includes that
3350 * global sum we all love to hate.
3352 * That is, the weight of a group entity, is the proportional share of the
3353 * group weight based on the group runqueue weights. That is:
3355 * tg->weight * grq->load.weight
3356 * ge->load.weight = ----------------------------- (1)
3357 * \Sum grq->load.weight
3359 * Now, because computing that sum is prohibitively expensive to compute (been
3360 * there, done that) we approximate it with this average stuff. The average
3361 * moves slower and therefore the approximation is cheaper and more stable.
3363 * So instead of the above, we substitute:
3365 * grq->load.weight -> grq->avg.load_avg (2)
3367 * which yields the following:
3369 * tg->weight * grq->avg.load_avg
3370 * ge->load.weight = ------------------------------ (3)
3373 * Where: tg->load_avg ~= \Sum grq->avg.load_avg
3375 * That is shares_avg, and it is right (given the approximation (2)).
3377 * The problem with it is that because the average is slow -- it was designed
3378 * to be exactly that of course -- this leads to transients in boundary
3379 * conditions. In specific, the case where the group was idle and we start the
3380 * one task. It takes time for our CPU's grq->avg.load_avg to build up,
3381 * yielding bad latency etc..
3383 * Now, in that special case (1) reduces to:
3385 * tg->weight * grq->load.weight
3386 * ge->load.weight = ----------------------------- = tg->weight (4)
3389 * That is, the sum collapses because all other CPUs are idle; the UP scenario.
3391 * So what we do is modify our approximation (3) to approach (4) in the (near)
3396 * tg->weight * grq->load.weight
3397 * --------------------------------------------------- (5)
3398 * tg->load_avg - grq->avg.load_avg + grq->load.weight
3400 * But because grq->load.weight can drop to 0, resulting in a divide by zero,
3401 * we need to use grq->avg.load_avg as its lower bound, which then gives:
3404 * tg->weight * grq->load.weight
3405 * ge->load.weight = ----------------------------- (6)
3410 * tg_load_avg' = tg->load_avg - grq->avg.load_avg +
3411 * max(grq->load.weight, grq->avg.load_avg)
3413 * And that is shares_weight and is icky. In the (near) UP case it approaches
3414 * (4) while in the normal case it approaches (3). It consistently
3415 * overestimates the ge->load.weight and therefore:
3417 * \Sum ge->load.weight >= tg->weight
3421 static long calc_group_shares(struct cfs_rq *cfs_rq)
3423 long tg_weight, tg_shares, load, shares;
3424 struct task_group *tg = cfs_rq->tg;
3426 tg_shares = READ_ONCE(tg->shares);
3428 load = max(scale_load_down(cfs_rq->load.weight), cfs_rq->avg.load_avg);
3430 tg_weight = atomic_long_read(&tg->load_avg);
3432 /* Ensure tg_weight >= load */
3433 tg_weight -= cfs_rq->tg_load_avg_contrib;
3436 shares = (tg_shares * load);
3438 shares /= tg_weight;
3441 * MIN_SHARES has to be unscaled here to support per-CPU partitioning
3442 * of a group with small tg->shares value. It is a floor value which is
3443 * assigned as a minimum load.weight to the sched_entity representing
3444 * the group on a CPU.
3446 * E.g. on 64-bit for a group with tg->shares of scale_load(15)=15*1024
3447 * on an 8-core system with 8 tasks each runnable on one CPU shares has
3448 * to be 15*1024*1/8=1920 instead of scale_load(MIN_SHARES)=2*1024. In
3449 * case no task is runnable on a CPU MIN_SHARES=2 should be returned
3452 return clamp_t(long, shares, MIN_SHARES, tg_shares);
3454 #endif /* CONFIG_SMP */
3457 * Recomputes the group entity based on the current state of its group
3460 static void update_cfs_group(struct sched_entity *se)
3462 struct cfs_rq *gcfs_rq = group_cfs_rq(se);
3468 if (throttled_hierarchy(gcfs_rq))
3472 shares = READ_ONCE(gcfs_rq->tg->shares);
3474 if (likely(se->load.weight == shares))
3477 shares = calc_group_shares(gcfs_rq);
3480 reweight_entity(cfs_rq_of(se), se, shares);
3483 #else /* CONFIG_FAIR_GROUP_SCHED */
3484 static inline void update_cfs_group(struct sched_entity *se)
3487 #endif /* CONFIG_FAIR_GROUP_SCHED */
3489 static inline void cfs_rq_util_change(struct cfs_rq *cfs_rq, int flags)
3491 struct rq *rq = rq_of(cfs_rq);
3493 if (&rq->cfs == cfs_rq) {
3495 * There are a few boundary cases this might miss but it should
3496 * get called often enough that that should (hopefully) not be
3499 * It will not get called when we go idle, because the idle
3500 * thread is a different class (!fair), nor will the utilization
3501 * number include things like RT tasks.
3503 * As is, the util number is not freq-invariant (we'd have to
3504 * implement arch_scale_freq_capacity() for that).
3506 * See cpu_util_cfs().
3508 cpufreq_update_util(rq, flags);
3513 static inline bool load_avg_is_decayed(struct sched_avg *sa)
3521 if (sa->runnable_sum)
3525 * _avg must be null when _sum are null because _avg = _sum / divider
3526 * Make sure that rounding and/or propagation of PELT values never
3529 SCHED_WARN_ON(sa->load_avg ||
3536 static inline u64 cfs_rq_last_update_time(struct cfs_rq *cfs_rq)
3538 return u64_u32_load_copy(cfs_rq->avg.last_update_time,
3539 cfs_rq->last_update_time_copy);
3541 #ifdef CONFIG_FAIR_GROUP_SCHED
3543 * Because list_add_leaf_cfs_rq always places a child cfs_rq on the list
3544 * immediately before a parent cfs_rq, and cfs_rqs are removed from the list
3545 * bottom-up, we only have to test whether the cfs_rq before us on the list
3547 * If cfs_rq is not on the list, test whether a child needs its to be added to
3548 * connect a branch to the tree * (see list_add_leaf_cfs_rq() for details).
3550 static inline bool child_cfs_rq_on_list(struct cfs_rq *cfs_rq)
3552 struct cfs_rq *prev_cfs_rq;
3553 struct list_head *prev;
3555 if (cfs_rq->on_list) {
3556 prev = cfs_rq->leaf_cfs_rq_list.prev;
3558 struct rq *rq = rq_of(cfs_rq);
3560 prev = rq->tmp_alone_branch;
3563 prev_cfs_rq = container_of(prev, struct cfs_rq, leaf_cfs_rq_list);
3565 return (prev_cfs_rq->tg->parent == cfs_rq->tg);
3568 static inline bool cfs_rq_is_decayed(struct cfs_rq *cfs_rq)
3570 if (cfs_rq->load.weight)
3573 if (!load_avg_is_decayed(&cfs_rq->avg))
3576 if (child_cfs_rq_on_list(cfs_rq))
3583 * update_tg_load_avg - update the tg's load avg
3584 * @cfs_rq: the cfs_rq whose avg changed
3586 * This function 'ensures': tg->load_avg := \Sum tg->cfs_rq[]->avg.load.
3587 * However, because tg->load_avg is a global value there are performance
3590 * In order to avoid having to look at the other cfs_rq's, we use a
3591 * differential update where we store the last value we propagated. This in
3592 * turn allows skipping updates if the differential is 'small'.
3594 * Updating tg's load_avg is necessary before update_cfs_share().
3596 static inline void update_tg_load_avg(struct cfs_rq *cfs_rq)
3598 long delta = cfs_rq->avg.load_avg - cfs_rq->tg_load_avg_contrib;
3601 * No need to update load_avg for root_task_group as it is not used.
3603 if (cfs_rq->tg == &root_task_group)
3606 if (abs(delta) > cfs_rq->tg_load_avg_contrib / 64) {
3607 atomic_long_add(delta, &cfs_rq->tg->load_avg);
3608 cfs_rq->tg_load_avg_contrib = cfs_rq->avg.load_avg;
3613 * Called within set_task_rq() right before setting a task's CPU. The
3614 * caller only guarantees p->pi_lock is held; no other assumptions,
3615 * including the state of rq->lock, should be made.
3617 void set_task_rq_fair(struct sched_entity *se,
3618 struct cfs_rq *prev, struct cfs_rq *next)
3620 u64 p_last_update_time;
3621 u64 n_last_update_time;
3623 if (!sched_feat(ATTACH_AGE_LOAD))
3627 * We are supposed to update the task to "current" time, then its up to
3628 * date and ready to go to new CPU/cfs_rq. But we have difficulty in
3629 * getting what current time is, so simply throw away the out-of-date
3630 * time. This will result in the wakee task is less decayed, but giving
3631 * the wakee more load sounds not bad.
3633 if (!(se->avg.last_update_time && prev))
3636 p_last_update_time = cfs_rq_last_update_time(prev);
3637 n_last_update_time = cfs_rq_last_update_time(next);
3639 __update_load_avg_blocked_se(p_last_update_time, se);
3640 se->avg.last_update_time = n_last_update_time;
3644 * When on migration a sched_entity joins/leaves the PELT hierarchy, we need to
3645 * propagate its contribution. The key to this propagation is the invariant
3646 * that for each group:
3648 * ge->avg == grq->avg (1)
3650 * _IFF_ we look at the pure running and runnable sums. Because they
3651 * represent the very same entity, just at different points in the hierarchy.
3653 * Per the above update_tg_cfs_util() and update_tg_cfs_runnable() are trivial
3654 * and simply copies the running/runnable sum over (but still wrong, because
3655 * the group entity and group rq do not have their PELT windows aligned).
3657 * However, update_tg_cfs_load() is more complex. So we have:
3659 * ge->avg.load_avg = ge->load.weight * ge->avg.runnable_avg (2)
3661 * And since, like util, the runnable part should be directly transferable,
3662 * the following would _appear_ to be the straight forward approach:
3664 * grq->avg.load_avg = grq->load.weight * grq->avg.runnable_avg (3)
3666 * And per (1) we have:
3668 * ge->avg.runnable_avg == grq->avg.runnable_avg
3672 * ge->load.weight * grq->avg.load_avg
3673 * ge->avg.load_avg = ----------------------------------- (4)
3676 * Except that is wrong!
3678 * Because while for entities historical weight is not important and we
3679 * really only care about our future and therefore can consider a pure
3680 * runnable sum, runqueues can NOT do this.
3682 * We specifically want runqueues to have a load_avg that includes
3683 * historical weights. Those represent the blocked load, the load we expect
3684 * to (shortly) return to us. This only works by keeping the weights as
3685 * integral part of the sum. We therefore cannot decompose as per (3).
3687 * Another reason this doesn't work is that runnable isn't a 0-sum entity.
3688 * Imagine a rq with 2 tasks that each are runnable 2/3 of the time. Then the
3689 * rq itself is runnable anywhere between 2/3 and 1 depending on how the
3690 * runnable section of these tasks overlap (or not). If they were to perfectly
3691 * align the rq as a whole would be runnable 2/3 of the time. If however we
3692 * always have at least 1 runnable task, the rq as a whole is always runnable.
3694 * So we'll have to approximate.. :/
3696 * Given the constraint:
3698 * ge->avg.running_sum <= ge->avg.runnable_sum <= LOAD_AVG_MAX
3700 * We can construct a rule that adds runnable to a rq by assuming minimal
3703 * On removal, we'll assume each task is equally runnable; which yields:
3705 * grq->avg.runnable_sum = grq->avg.load_sum / grq->load.weight
3707 * XXX: only do this for the part of runnable > running ?
3711 update_tg_cfs_util(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq)
3713 long delta_sum, delta_avg = gcfs_rq->avg.util_avg - se->avg.util_avg;
3714 u32 new_sum, divider;
3716 /* Nothing to update */
3721 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se.
3722 * See ___update_load_avg() for details.
3724 divider = get_pelt_divider(&cfs_rq->avg);
3727 /* Set new sched_entity's utilization */
3728 se->avg.util_avg = gcfs_rq->avg.util_avg;
3729 new_sum = se->avg.util_avg * divider;
3730 delta_sum = (long)new_sum - (long)se->avg.util_sum;
3731 se->avg.util_sum = new_sum;
3733 /* Update parent cfs_rq utilization */
3734 add_positive(&cfs_rq->avg.util_avg, delta_avg);
3735 add_positive(&cfs_rq->avg.util_sum, delta_sum);
3737 /* See update_cfs_rq_load_avg() */
3738 cfs_rq->avg.util_sum = max_t(u32, cfs_rq->avg.util_sum,
3739 cfs_rq->avg.util_avg * PELT_MIN_DIVIDER);
3743 update_tg_cfs_runnable(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq)
3745 long delta_sum, delta_avg = gcfs_rq->avg.runnable_avg - se->avg.runnable_avg;
3746 u32 new_sum, divider;
3748 /* Nothing to update */
3753 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se.
3754 * See ___update_load_avg() for details.
3756 divider = get_pelt_divider(&cfs_rq->avg);
3758 /* Set new sched_entity's runnable */
3759 se->avg.runnable_avg = gcfs_rq->avg.runnable_avg;
3760 new_sum = se->avg.runnable_avg * divider;
3761 delta_sum = (long)new_sum - (long)se->avg.runnable_sum;
3762 se->avg.runnable_sum = new_sum;
3764 /* Update parent cfs_rq runnable */
3765 add_positive(&cfs_rq->avg.runnable_avg, delta_avg);
3766 add_positive(&cfs_rq->avg.runnable_sum, delta_sum);
3767 /* See update_cfs_rq_load_avg() */
3768 cfs_rq->avg.runnable_sum = max_t(u32, cfs_rq->avg.runnable_sum,
3769 cfs_rq->avg.runnable_avg * PELT_MIN_DIVIDER);
3773 update_tg_cfs_load(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq)
3775 long delta_avg, running_sum, runnable_sum = gcfs_rq->prop_runnable_sum;
3776 unsigned long load_avg;
3784 gcfs_rq->prop_runnable_sum = 0;
3787 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se.
3788 * See ___update_load_avg() for details.
3790 divider = get_pelt_divider(&cfs_rq->avg);
3792 if (runnable_sum >= 0) {
3794 * Add runnable; clip at LOAD_AVG_MAX. Reflects that until
3795 * the CPU is saturated running == runnable.
3797 runnable_sum += se->avg.load_sum;
3798 runnable_sum = min_t(long, runnable_sum, divider);
3801 * Estimate the new unweighted runnable_sum of the gcfs_rq by
3802 * assuming all tasks are equally runnable.
3804 if (scale_load_down(gcfs_rq->load.weight)) {
3805 load_sum = div_u64(gcfs_rq->avg.load_sum,
3806 scale_load_down(gcfs_rq->load.weight));
3809 /* But make sure to not inflate se's runnable */
3810 runnable_sum = min(se->avg.load_sum, load_sum);
3814 * runnable_sum can't be lower than running_sum
3815 * Rescale running sum to be in the same range as runnable sum
3816 * running_sum is in [0 : LOAD_AVG_MAX << SCHED_CAPACITY_SHIFT]
3817 * runnable_sum is in [0 : LOAD_AVG_MAX]
3819 running_sum = se->avg.util_sum >> SCHED_CAPACITY_SHIFT;
3820 runnable_sum = max(runnable_sum, running_sum);
3822 load_sum = se_weight(se) * runnable_sum;
3823 load_avg = div_u64(load_sum, divider);
3825 delta_avg = load_avg - se->avg.load_avg;
3829 delta_sum = load_sum - (s64)se_weight(se) * se->avg.load_sum;
3831 se->avg.load_sum = runnable_sum;
3832 se->avg.load_avg = load_avg;
3833 add_positive(&cfs_rq->avg.load_avg, delta_avg);
3834 add_positive(&cfs_rq->avg.load_sum, delta_sum);
3835 /* See update_cfs_rq_load_avg() */
3836 cfs_rq->avg.load_sum = max_t(u32, cfs_rq->avg.load_sum,
3837 cfs_rq->avg.load_avg * PELT_MIN_DIVIDER);
3840 static inline void add_tg_cfs_propagate(struct cfs_rq *cfs_rq, long runnable_sum)
3842 cfs_rq->propagate = 1;
3843 cfs_rq->prop_runnable_sum += runnable_sum;
3846 /* Update task and its cfs_rq load average */
3847 static inline int propagate_entity_load_avg(struct sched_entity *se)
3849 struct cfs_rq *cfs_rq, *gcfs_rq;
3851 if (entity_is_task(se))
3854 gcfs_rq = group_cfs_rq(se);
3855 if (!gcfs_rq->propagate)
3858 gcfs_rq->propagate = 0;
3860 cfs_rq = cfs_rq_of(se);
3862 add_tg_cfs_propagate(cfs_rq, gcfs_rq->prop_runnable_sum);
3864 update_tg_cfs_util(cfs_rq, se, gcfs_rq);
3865 update_tg_cfs_runnable(cfs_rq, se, gcfs_rq);
3866 update_tg_cfs_load(cfs_rq, se, gcfs_rq);
3868 trace_pelt_cfs_tp(cfs_rq);
3869 trace_pelt_se_tp(se);
3875 * Check if we need to update the load and the utilization of a blocked
3878 static inline bool skip_blocked_update(struct sched_entity *se)
3880 struct cfs_rq *gcfs_rq = group_cfs_rq(se);
3883 * If sched_entity still have not zero load or utilization, we have to
3886 if (se->avg.load_avg || se->avg.util_avg)
3890 * If there is a pending propagation, we have to update the load and
3891 * the utilization of the sched_entity:
3893 if (gcfs_rq->propagate)
3897 * Otherwise, the load and the utilization of the sched_entity is
3898 * already zero and there is no pending propagation, so it will be a
3899 * waste of time to try to decay it:
3904 #else /* CONFIG_FAIR_GROUP_SCHED */
3906 static inline void update_tg_load_avg(struct cfs_rq *cfs_rq) {}
3908 static inline int propagate_entity_load_avg(struct sched_entity *se)
3913 static inline void add_tg_cfs_propagate(struct cfs_rq *cfs_rq, long runnable_sum) {}
3915 #endif /* CONFIG_FAIR_GROUP_SCHED */
3917 #ifdef CONFIG_NO_HZ_COMMON
3918 static inline void migrate_se_pelt_lag(struct sched_entity *se)
3920 u64 throttled = 0, now, lut;
3921 struct cfs_rq *cfs_rq;
3925 if (load_avg_is_decayed(&se->avg))
3928 cfs_rq = cfs_rq_of(se);
3932 is_idle = is_idle_task(rcu_dereference(rq->curr));
3936 * The lag estimation comes with a cost we don't want to pay all the
3937 * time. Hence, limiting to the case where the source CPU is idle and
3938 * we know we are at the greatest risk to have an outdated clock.
3944 * Estimated "now" is: last_update_time + cfs_idle_lag + rq_idle_lag, where:
3946 * last_update_time (the cfs_rq's last_update_time)
3947 * = cfs_rq_clock_pelt()@cfs_rq_idle
3948 * = rq_clock_pelt()@cfs_rq_idle
3949 * - cfs->throttled_clock_pelt_time@cfs_rq_idle
3951 * cfs_idle_lag (delta between rq's update and cfs_rq's update)
3952 * = rq_clock_pelt()@rq_idle - rq_clock_pelt()@cfs_rq_idle
3954 * rq_idle_lag (delta between now and rq's update)
3955 * = sched_clock_cpu() - rq_clock()@rq_idle
3957 * We can then write:
3959 * now = rq_clock_pelt()@rq_idle - cfs->throttled_clock_pelt_time +
3960 * sched_clock_cpu() - rq_clock()@rq_idle
3962 * rq_clock_pelt()@rq_idle is rq->clock_pelt_idle
3963 * rq_clock()@rq_idle is rq->clock_idle
3964 * cfs->throttled_clock_pelt_time@cfs_rq_idle
3965 * is cfs_rq->throttled_pelt_idle
3968 #ifdef CONFIG_CFS_BANDWIDTH
3969 throttled = u64_u32_load(cfs_rq->throttled_pelt_idle);
3970 /* The clock has been stopped for throttling */
3971 if (throttled == U64_MAX)
3974 now = u64_u32_load(rq->clock_pelt_idle);
3976 * Paired with _update_idle_rq_clock_pelt(). It ensures at the worst case
3977 * is observed the old clock_pelt_idle value and the new clock_idle,
3978 * which lead to an underestimation. The opposite would lead to an
3982 lut = cfs_rq_last_update_time(cfs_rq);
3987 * cfs_rq->avg.last_update_time is more recent than our
3988 * estimation, let's use it.
3992 now += sched_clock_cpu(cpu_of(rq)) - u64_u32_load(rq->clock_idle);
3994 __update_load_avg_blocked_se(now, se);
3997 static void migrate_se_pelt_lag(struct sched_entity *se) {}
4001 * update_cfs_rq_load_avg - update the cfs_rq's load/util averages
4002 * @now: current time, as per cfs_rq_clock_pelt()
4003 * @cfs_rq: cfs_rq to update
4005 * The cfs_rq avg is the direct sum of all its entities (blocked and runnable)
4006 * avg. The immediate corollary is that all (fair) tasks must be attached.
4008 * cfs_rq->avg is used for task_h_load() and update_cfs_share() for example.
4010 * Return: true if the load decayed or we removed load.
4012 * Since both these conditions indicate a changed cfs_rq->avg.load we should
4013 * call update_tg_load_avg() when this function returns true.
4016 update_cfs_rq_load_avg(u64 now, struct cfs_rq *cfs_rq)
4018 unsigned long removed_load = 0, removed_util = 0, removed_runnable = 0;
4019 struct sched_avg *sa = &cfs_rq->avg;
4022 if (cfs_rq->removed.nr) {
4024 u32 divider = get_pelt_divider(&cfs_rq->avg);
4026 raw_spin_lock(&cfs_rq->removed.lock);
4027 swap(cfs_rq->removed.util_avg, removed_util);
4028 swap(cfs_rq->removed.load_avg, removed_load);
4029 swap(cfs_rq->removed.runnable_avg, removed_runnable);
4030 cfs_rq->removed.nr = 0;
4031 raw_spin_unlock(&cfs_rq->removed.lock);
4034 sub_positive(&sa->load_avg, r);
4035 sub_positive(&sa->load_sum, r * divider);
4036 /* See sa->util_sum below */
4037 sa->load_sum = max_t(u32, sa->load_sum, sa->load_avg * PELT_MIN_DIVIDER);
4040 sub_positive(&sa->util_avg, r);
4041 sub_positive(&sa->util_sum, r * divider);
4043 * Because of rounding, se->util_sum might ends up being +1 more than
4044 * cfs->util_sum. Although this is not a problem by itself, detaching
4045 * a lot of tasks with the rounding problem between 2 updates of
4046 * util_avg (~1ms) can make cfs->util_sum becoming null whereas
4047 * cfs_util_avg is not.
4048 * Check that util_sum is still above its lower bound for the new
4049 * util_avg. Given that period_contrib might have moved since the last
4050 * sync, we are only sure that util_sum must be above or equal to
4051 * util_avg * minimum possible divider
4053 sa->util_sum = max_t(u32, sa->util_sum, sa->util_avg * PELT_MIN_DIVIDER);
4055 r = removed_runnable;
4056 sub_positive(&sa->runnable_avg, r);
4057 sub_positive(&sa->runnable_sum, r * divider);
4058 /* See sa->util_sum above */
4059 sa->runnable_sum = max_t(u32, sa->runnable_sum,
4060 sa->runnable_avg * PELT_MIN_DIVIDER);
4063 * removed_runnable is the unweighted version of removed_load so we
4064 * can use it to estimate removed_load_sum.
4066 add_tg_cfs_propagate(cfs_rq,
4067 -(long)(removed_runnable * divider) >> SCHED_CAPACITY_SHIFT);
4072 decayed |= __update_load_avg_cfs_rq(now, cfs_rq);
4073 u64_u32_store_copy(sa->last_update_time,
4074 cfs_rq->last_update_time_copy,
4075 sa->last_update_time);
4080 * attach_entity_load_avg - attach this entity to its cfs_rq load avg
4081 * @cfs_rq: cfs_rq to attach to
4082 * @se: sched_entity to attach
4084 * Must call update_cfs_rq_load_avg() before this, since we rely on
4085 * cfs_rq->avg.last_update_time being current.
4087 static void attach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
4090 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se.
4091 * See ___update_load_avg() for details.
4093 u32 divider = get_pelt_divider(&cfs_rq->avg);
4096 * When we attach the @se to the @cfs_rq, we must align the decay
4097 * window because without that, really weird and wonderful things can
4102 se->avg.last_update_time = cfs_rq->avg.last_update_time;
4103 se->avg.period_contrib = cfs_rq->avg.period_contrib;
4106 * Hell(o) Nasty stuff.. we need to recompute _sum based on the new
4107 * period_contrib. This isn't strictly correct, but since we're
4108 * entirely outside of the PELT hierarchy, nobody cares if we truncate
4111 se->avg.util_sum = se->avg.util_avg * divider;
4113 se->avg.runnable_sum = se->avg.runnable_avg * divider;
4115 se->avg.load_sum = se->avg.load_avg * divider;
4116 if (se_weight(se) < se->avg.load_sum)
4117 se->avg.load_sum = div_u64(se->avg.load_sum, se_weight(se));
4119 se->avg.load_sum = 1;
4121 enqueue_load_avg(cfs_rq, se);
4122 cfs_rq->avg.util_avg += se->avg.util_avg;
4123 cfs_rq->avg.util_sum += se->avg.util_sum;
4124 cfs_rq->avg.runnable_avg += se->avg.runnable_avg;
4125 cfs_rq->avg.runnable_sum += se->avg.runnable_sum;
4127 add_tg_cfs_propagate(cfs_rq, se->avg.load_sum);
4129 cfs_rq_util_change(cfs_rq, 0);
4131 trace_pelt_cfs_tp(cfs_rq);
4135 * detach_entity_load_avg - detach this entity from its cfs_rq load avg
4136 * @cfs_rq: cfs_rq to detach from
4137 * @se: sched_entity to detach
4139 * Must call update_cfs_rq_load_avg() before this, since we rely on
4140 * cfs_rq->avg.last_update_time being current.
4142 static void detach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se)
4144 dequeue_load_avg(cfs_rq, se);
4145 sub_positive(&cfs_rq->avg.util_avg, se->avg.util_avg);
4146 sub_positive(&cfs_rq->avg.util_sum, se->avg.util_sum);
4147 /* See update_cfs_rq_load_avg() */
4148 cfs_rq->avg.util_sum = max_t(u32, cfs_rq->avg.util_sum,
4149 cfs_rq->avg.util_avg * PELT_MIN_DIVIDER);
4151 sub_positive(&cfs_rq->avg.runnable_avg, se->avg.runnable_avg);
4152 sub_positive(&cfs_rq->avg.runnable_sum, se->avg.runnable_sum);
4153 /* See update_cfs_rq_load_avg() */
4154 cfs_rq->avg.runnable_sum = max_t(u32, cfs_rq->avg.runnable_sum,
4155 cfs_rq->avg.runnable_avg * PELT_MIN_DIVIDER);
4157 add_tg_cfs_propagate(cfs_rq, -se->avg.load_sum);
4159 cfs_rq_util_change(cfs_rq, 0);
4161 trace_pelt_cfs_tp(cfs_rq);
4165 * Optional action to be done while updating the load average
4167 #define UPDATE_TG 0x1
4168 #define SKIP_AGE_LOAD 0x2
4169 #define DO_ATTACH 0x4
4170 #define DO_DETACH 0x8
4172 /* Update task and its cfs_rq load average */
4173 static inline void update_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
4175 u64 now = cfs_rq_clock_pelt(cfs_rq);
4179 * Track task load average for carrying it to new CPU after migrated, and
4180 * track group sched_entity load average for task_h_load calc in migration
4182 if (se->avg.last_update_time && !(flags & SKIP_AGE_LOAD))
4183 __update_load_avg_se(now, cfs_rq, se);
4185 decayed = update_cfs_rq_load_avg(now, cfs_rq);
4186 decayed |= propagate_entity_load_avg(se);
4188 if (!se->avg.last_update_time && (flags & DO_ATTACH)) {
4191 * DO_ATTACH means we're here from enqueue_entity().
4192 * !last_update_time means we've passed through
4193 * migrate_task_rq_fair() indicating we migrated.
4195 * IOW we're enqueueing a task on a new CPU.
4197 attach_entity_load_avg(cfs_rq, se);
4198 update_tg_load_avg(cfs_rq);
4200 } else if (flags & DO_DETACH) {
4202 * DO_DETACH means we're here from dequeue_entity()
4203 * and we are migrating task out of the CPU.
4205 detach_entity_load_avg(cfs_rq, se);
4206 update_tg_load_avg(cfs_rq);
4207 } else if (decayed) {
4208 cfs_rq_util_change(cfs_rq, 0);
4210 if (flags & UPDATE_TG)
4211 update_tg_load_avg(cfs_rq);
4216 * Synchronize entity load avg of dequeued entity without locking
4219 static void sync_entity_load_avg(struct sched_entity *se)
4221 struct cfs_rq *cfs_rq = cfs_rq_of(se);
4222 u64 last_update_time;
4224 last_update_time = cfs_rq_last_update_time(cfs_rq);
4225 __update_load_avg_blocked_se(last_update_time, se);
4229 * Task first catches up with cfs_rq, and then subtract
4230 * itself from the cfs_rq (task must be off the queue now).
4232 static void remove_entity_load_avg(struct sched_entity *se)
4234 struct cfs_rq *cfs_rq = cfs_rq_of(se);
4235 unsigned long flags;
4238 * tasks cannot exit without having gone through wake_up_new_task() ->
4239 * enqueue_task_fair() which will have added things to the cfs_rq,
4240 * so we can remove unconditionally.
4243 sync_entity_load_avg(se);
4245 raw_spin_lock_irqsave(&cfs_rq->removed.lock, flags);
4246 ++cfs_rq->removed.nr;
4247 cfs_rq->removed.util_avg += se->avg.util_avg;
4248 cfs_rq->removed.load_avg += se->avg.load_avg;
4249 cfs_rq->removed.runnable_avg += se->avg.runnable_avg;
4250 raw_spin_unlock_irqrestore(&cfs_rq->removed.lock, flags);
4253 static inline unsigned long cfs_rq_runnable_avg(struct cfs_rq *cfs_rq)
4255 return cfs_rq->avg.runnable_avg;
4258 static inline unsigned long cfs_rq_load_avg(struct cfs_rq *cfs_rq)
4260 return cfs_rq->avg.load_avg;
4263 static int newidle_balance(struct rq *this_rq, struct rq_flags *rf);
4265 static inline unsigned long task_util(struct task_struct *p)
4267 return READ_ONCE(p->se.avg.util_avg);
4270 static inline unsigned long _task_util_est(struct task_struct *p)
4272 struct util_est ue = READ_ONCE(p->se.avg.util_est);
4274 return max(ue.ewma, (ue.enqueued & ~UTIL_AVG_UNCHANGED));
4277 static inline unsigned long task_util_est(struct task_struct *p)
4279 return max(task_util(p), _task_util_est(p));
4282 #ifdef CONFIG_UCLAMP_TASK
4283 static inline unsigned long uclamp_task_util(struct task_struct *p)
4285 return clamp(task_util_est(p),
4286 uclamp_eff_value(p, UCLAMP_MIN),
4287 uclamp_eff_value(p, UCLAMP_MAX));
4290 static inline unsigned long uclamp_task_util(struct task_struct *p)
4292 return task_util_est(p);
4296 static inline void util_est_enqueue(struct cfs_rq *cfs_rq,
4297 struct task_struct *p)
4299 unsigned int enqueued;
4301 if (!sched_feat(UTIL_EST))
4304 /* Update root cfs_rq's estimated utilization */
4305 enqueued = cfs_rq->avg.util_est.enqueued;
4306 enqueued += _task_util_est(p);
4307 WRITE_ONCE(cfs_rq->avg.util_est.enqueued, enqueued);
4309 trace_sched_util_est_cfs_tp(cfs_rq);
4312 static inline void util_est_dequeue(struct cfs_rq *cfs_rq,
4313 struct task_struct *p)
4315 unsigned int enqueued;
4317 if (!sched_feat(UTIL_EST))
4320 /* Update root cfs_rq's estimated utilization */
4321 enqueued = cfs_rq->avg.util_est.enqueued;
4322 enqueued -= min_t(unsigned int, enqueued, _task_util_est(p));
4323 WRITE_ONCE(cfs_rq->avg.util_est.enqueued, enqueued);
4325 trace_sched_util_est_cfs_tp(cfs_rq);
4328 #define UTIL_EST_MARGIN (SCHED_CAPACITY_SCALE / 100)
4331 * Check if a (signed) value is within a specified (unsigned) margin,
4332 * based on the observation that:
4334 * abs(x) < y := (unsigned)(x + y - 1) < (2 * y - 1)
4336 * NOTE: this only works when value + margin < INT_MAX.
4338 static inline bool within_margin(int value, int margin)
4340 return ((unsigned int)(value + margin - 1) < (2 * margin - 1));
4343 static inline void util_est_update(struct cfs_rq *cfs_rq,
4344 struct task_struct *p,
4347 long last_ewma_diff, last_enqueued_diff;
4350 if (!sched_feat(UTIL_EST))
4354 * Skip update of task's estimated utilization when the task has not
4355 * yet completed an activation, e.g. being migrated.
4361 * If the PELT values haven't changed since enqueue time,
4362 * skip the util_est update.
4364 ue = p->se.avg.util_est;
4365 if (ue.enqueued & UTIL_AVG_UNCHANGED)
4368 last_enqueued_diff = ue.enqueued;
4371 * Reset EWMA on utilization increases, the moving average is used only
4372 * to smooth utilization decreases.
4374 ue.enqueued = task_util(p);
4375 if (sched_feat(UTIL_EST_FASTUP)) {
4376 if (ue.ewma < ue.enqueued) {
4377 ue.ewma = ue.enqueued;
4383 * Skip update of task's estimated utilization when its members are
4384 * already ~1% close to its last activation value.
4386 last_ewma_diff = ue.enqueued - ue.ewma;
4387 last_enqueued_diff -= ue.enqueued;
4388 if (within_margin(last_ewma_diff, UTIL_EST_MARGIN)) {
4389 if (!within_margin(last_enqueued_diff, UTIL_EST_MARGIN))
4396 * To avoid overestimation of actual task utilization, skip updates if
4397 * we cannot grant there is idle time in this CPU.
4399 if (task_util(p) > capacity_orig_of(cpu_of(rq_of(cfs_rq))))
4403 * Update Task's estimated utilization
4405 * When *p completes an activation we can consolidate another sample
4406 * of the task size. This is done by storing the current PELT value
4407 * as ue.enqueued and by using this value to update the Exponential
4408 * Weighted Moving Average (EWMA):
4410 * ewma(t) = w * task_util(p) + (1-w) * ewma(t-1)
4411 * = w * task_util(p) + ewma(t-1) - w * ewma(t-1)
4412 * = w * (task_util(p) - ewma(t-1)) + ewma(t-1)
4413 * = w * ( last_ewma_diff ) + ewma(t-1)
4414 * = w * (last_ewma_diff + ewma(t-1) / w)
4416 * Where 'w' is the weight of new samples, which is configured to be
4417 * 0.25, thus making w=1/4 ( >>= UTIL_EST_WEIGHT_SHIFT)
4419 ue.ewma <<= UTIL_EST_WEIGHT_SHIFT;
4420 ue.ewma += last_ewma_diff;
4421 ue.ewma >>= UTIL_EST_WEIGHT_SHIFT;
4423 ue.enqueued |= UTIL_AVG_UNCHANGED;
4424 WRITE_ONCE(p->se.avg.util_est, ue);
4426 trace_sched_util_est_se_tp(&p->se);
4429 static inline int util_fits_cpu(unsigned long util,
4430 unsigned long uclamp_min,
4431 unsigned long uclamp_max,
4434 unsigned long capacity_orig, capacity_orig_thermal;
4435 unsigned long capacity = capacity_of(cpu);
4436 bool fits, uclamp_max_fits;
4439 * Check if the real util fits without any uclamp boost/cap applied.
4441 fits = fits_capacity(util, capacity);
4443 if (!uclamp_is_used())
4447 * We must use capacity_orig_of() for comparing against uclamp_min and
4448 * uclamp_max. We only care about capacity pressure (by using
4449 * capacity_of()) for comparing against the real util.
4451 * If a task is boosted to 1024 for example, we don't want a tiny
4452 * pressure to skew the check whether it fits a CPU or not.
4454 * Similarly if a task is capped to capacity_orig_of(little_cpu), it
4455 * should fit a little cpu even if there's some pressure.
4457 * Only exception is for thermal pressure since it has a direct impact
4458 * on available OPP of the system.
4460 * We honour it for uclamp_min only as a drop in performance level
4461 * could result in not getting the requested minimum performance level.
4463 * For uclamp_max, we can tolerate a drop in performance level as the
4464 * goal is to cap the task. So it's okay if it's getting less.
4466 * In case of capacity inversion, which is not handled yet, we should
4467 * honour the inverted capacity for both uclamp_min and uclamp_max all
4470 capacity_orig = capacity_orig_of(cpu);
4471 capacity_orig_thermal = capacity_orig - arch_scale_thermal_pressure(cpu);
4474 * We want to force a task to fit a cpu as implied by uclamp_max.
4475 * But we do have some corner cases to cater for..
4481 * |_ _ _ _ _ _ _ _ _ ___ _ _ _ | _ | _ _ _ _ _ uclamp_max
4484 * | | | | | | | (util somewhere in this region)
4487 * +----------------------------------------
4490 * In the above example if a task is capped to a specific performance
4491 * point, y, then when:
4493 * * util = 80% of x then it does not fit on cpu0 and should migrate
4495 * * util = 80% of y then it is forced to fit on cpu1 to honour
4496 * uclamp_max request.
4498 * which is what we're enforcing here. A task always fits if
4499 * uclamp_max <= capacity_orig. But when uclamp_max > capacity_orig,
4500 * the normal upmigration rules should withhold still.
4502 * Only exception is when we are on max capacity, then we need to be
4503 * careful not to block overutilized state. This is so because:
4505 * 1. There's no concept of capping at max_capacity! We can't go
4506 * beyond this performance level anyway.
4507 * 2. The system is being saturated when we're operating near
4508 * max capacity, it doesn't make sense to block overutilized.
4510 uclamp_max_fits = (capacity_orig == SCHED_CAPACITY_SCALE) && (uclamp_max == SCHED_CAPACITY_SCALE);
4511 uclamp_max_fits = !uclamp_max_fits && (uclamp_max <= capacity_orig);
4512 fits = fits || uclamp_max_fits;
4517 * | ___ (region a, capped, util >= uclamp_max)
4519 * |_ _ _ _ _ _ _ _ _ ___ _ _ _ | _ | _ _ _ _ _ uclamp_max
4521 * | ___ | | | | (region b, uclamp_min <= util <= uclamp_max)
4522 * |_ _ _|_ _|_ _ _ _| _ | _ _ _| _ | _ _ _ _ _ uclamp_min
4524 * | | | | | | | (region c, boosted, util < uclamp_min)
4525 * +----------------------------------------
4528 * a) If util > uclamp_max, then we're capped, we don't care about
4529 * actual fitness value here. We only care if uclamp_max fits
4530 * capacity without taking margin/pressure into account.
4531 * See comment above.
4533 * b) If uclamp_min <= util <= uclamp_max, then the normal
4534 * fits_capacity() rules apply. Except we need to ensure that we
4535 * enforce we remain within uclamp_max, see comment above.
4537 * c) If util < uclamp_min, then we are boosted. Same as (b) but we
4538 * need to take into account the boosted value fits the CPU without
4539 * taking margin/pressure into account.
4541 * Cases (a) and (b) are handled in the 'fits' variable already. We
4542 * just need to consider an extra check for case (c) after ensuring we
4543 * handle the case uclamp_min > uclamp_max.
4545 uclamp_min = min(uclamp_min, uclamp_max);
4546 if (util < uclamp_min && capacity_orig != SCHED_CAPACITY_SCALE)
4547 fits = fits && (uclamp_min <= capacity_orig_thermal);
4552 static inline int task_fits_cpu(struct task_struct *p, int cpu)
4554 unsigned long uclamp_min = uclamp_eff_value(p, UCLAMP_MIN);
4555 unsigned long uclamp_max = uclamp_eff_value(p, UCLAMP_MAX);
4556 unsigned long util = task_util_est(p);
4557 return util_fits_cpu(util, uclamp_min, uclamp_max, cpu);
4560 static inline void update_misfit_status(struct task_struct *p, struct rq *rq)
4562 if (!sched_asym_cpucap_active())
4565 if (!p || p->nr_cpus_allowed == 1) {
4566 rq->misfit_task_load = 0;
4570 if (task_fits_cpu(p, cpu_of(rq))) {
4571 rq->misfit_task_load = 0;
4576 * Make sure that misfit_task_load will not be null even if
4577 * task_h_load() returns 0.
4579 rq->misfit_task_load = max_t(unsigned long, task_h_load(p), 1);
4582 #else /* CONFIG_SMP */
4584 static inline bool cfs_rq_is_decayed(struct cfs_rq *cfs_rq)
4589 #define UPDATE_TG 0x0
4590 #define SKIP_AGE_LOAD 0x0
4591 #define DO_ATTACH 0x0
4592 #define DO_DETACH 0x0
4594 static inline void update_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se, int not_used1)
4596 cfs_rq_util_change(cfs_rq, 0);
4599 static inline void remove_entity_load_avg(struct sched_entity *se) {}
4602 attach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) {}
4604 detach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) {}
4606 static inline int newidle_balance(struct rq *rq, struct rq_flags *rf)
4612 util_est_enqueue(struct cfs_rq *cfs_rq, struct task_struct *p) {}
4615 util_est_dequeue(struct cfs_rq *cfs_rq, struct task_struct *p) {}
4618 util_est_update(struct cfs_rq *cfs_rq, struct task_struct *p,
4620 static inline void update_misfit_status(struct task_struct *p, struct rq *rq) {}
4622 #endif /* CONFIG_SMP */
4624 static void check_spread(struct cfs_rq *cfs_rq, struct sched_entity *se)
4626 #ifdef CONFIG_SCHED_DEBUG
4627 s64 d = se->vruntime - cfs_rq->min_vruntime;
4632 if (d > 3*sysctl_sched_latency)
4633 schedstat_inc(cfs_rq->nr_spread_over);
4638 place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int initial)
4640 u64 vruntime = cfs_rq->min_vruntime;
4643 * The 'current' period is already promised to the current tasks,
4644 * however the extra weight of the new task will slow them down a
4645 * little, place the new task so that it fits in the slot that
4646 * stays open at the end.
4648 if (initial && sched_feat(START_DEBIT))
4649 vruntime += sched_vslice(cfs_rq, se);
4651 /* sleeps up to a single latency don't count. */
4653 unsigned long thresh;
4656 thresh = sysctl_sched_min_granularity;
4658 thresh = sysctl_sched_latency;
4661 * Halve their sleep time's effect, to allow
4662 * for a gentler effect of sleepers:
4664 if (sched_feat(GENTLE_FAIR_SLEEPERS))
4670 /* ensure we never gain time by being placed backwards. */
4671 se->vruntime = max_vruntime(se->vruntime, vruntime);
4674 static void check_enqueue_throttle(struct cfs_rq *cfs_rq);
4676 static inline bool cfs_bandwidth_used(void);
4683 * update_min_vruntime()
4684 * vruntime -= min_vruntime
4688 * update_min_vruntime()
4689 * vruntime += min_vruntime
4691 * this way the vruntime transition between RQs is done when both
4692 * min_vruntime are up-to-date.
4696 * ->migrate_task_rq_fair() (p->state == TASK_WAKING)
4697 * vruntime -= min_vruntime
4701 * update_min_vruntime()
4702 * vruntime += min_vruntime
4704 * this way we don't have the most up-to-date min_vruntime on the originating
4705 * CPU and an up-to-date min_vruntime on the destination CPU.
4709 enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
4711 bool renorm = !(flags & ENQUEUE_WAKEUP) || (flags & ENQUEUE_MIGRATED);
4712 bool curr = cfs_rq->curr == se;
4715 * If we're the current task, we must renormalise before calling
4719 se->vruntime += cfs_rq->min_vruntime;
4721 update_curr(cfs_rq);
4724 * Otherwise, renormalise after, such that we're placed at the current
4725 * moment in time, instead of some random moment in the past. Being
4726 * placed in the past could significantly boost this task to the
4727 * fairness detriment of existing tasks.
4729 if (renorm && !curr)
4730 se->vruntime += cfs_rq->min_vruntime;
4733 * When enqueuing a sched_entity, we must:
4734 * - Update loads to have both entity and cfs_rq synced with now.
4735 * - For group_entity, update its runnable_weight to reflect the new
4736 * h_nr_running of its group cfs_rq.
4737 * - For group_entity, update its weight to reflect the new share of
4739 * - Add its new weight to cfs_rq->load.weight
4741 update_load_avg(cfs_rq, se, UPDATE_TG | DO_ATTACH);
4742 se_update_runnable(se);
4743 update_cfs_group(se);
4744 account_entity_enqueue(cfs_rq, se);
4746 if (flags & ENQUEUE_WAKEUP)
4747 place_entity(cfs_rq, se, 0);
4749 check_schedstat_required();
4750 update_stats_enqueue_fair(cfs_rq, se, flags);
4751 check_spread(cfs_rq, se);
4753 __enqueue_entity(cfs_rq, se);
4756 if (cfs_rq->nr_running == 1) {
4757 check_enqueue_throttle(cfs_rq);
4758 if (!throttled_hierarchy(cfs_rq))
4759 list_add_leaf_cfs_rq(cfs_rq);
4763 static void __clear_buddies_last(struct sched_entity *se)
4765 for_each_sched_entity(se) {
4766 struct cfs_rq *cfs_rq = cfs_rq_of(se);
4767 if (cfs_rq->last != se)
4770 cfs_rq->last = NULL;
4774 static void __clear_buddies_next(struct sched_entity *se)
4776 for_each_sched_entity(se) {
4777 struct cfs_rq *cfs_rq = cfs_rq_of(se);
4778 if (cfs_rq->next != se)
4781 cfs_rq->next = NULL;
4785 static void __clear_buddies_skip(struct sched_entity *se)
4787 for_each_sched_entity(se) {
4788 struct cfs_rq *cfs_rq = cfs_rq_of(se);
4789 if (cfs_rq->skip != se)
4792 cfs_rq->skip = NULL;
4796 static void clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se)
4798 if (cfs_rq->last == se)
4799 __clear_buddies_last(se);
4801 if (cfs_rq->next == se)
4802 __clear_buddies_next(se);
4804 if (cfs_rq->skip == se)
4805 __clear_buddies_skip(se);
4808 static __always_inline void return_cfs_rq_runtime(struct cfs_rq *cfs_rq);
4811 dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags)
4813 int action = UPDATE_TG;
4815 if (entity_is_task(se) && task_on_rq_migrating(task_of(se)))
4816 action |= DO_DETACH;
4819 * Update run-time statistics of the 'current'.
4821 update_curr(cfs_rq);
4824 * When dequeuing a sched_entity, we must:
4825 * - Update loads to have both entity and cfs_rq synced with now.
4826 * - For group_entity, update its runnable_weight to reflect the new
4827 * h_nr_running of its group cfs_rq.
4828 * - Subtract its previous weight from cfs_rq->load.weight.
4829 * - For group entity, update its weight to reflect the new share
4830 * of its group cfs_rq.
4832 update_load_avg(cfs_rq, se, action);
4833 se_update_runnable(se);
4835 update_stats_dequeue_fair(cfs_rq, se, flags);
4837 clear_buddies(cfs_rq, se);
4839 if (se != cfs_rq->curr)
4840 __dequeue_entity(cfs_rq, se);
4842 account_entity_dequeue(cfs_rq, se);
4845 * Normalize after update_curr(); which will also have moved
4846 * min_vruntime if @se is the one holding it back. But before doing
4847 * update_min_vruntime() again, which will discount @se's position and
4848 * can move min_vruntime forward still more.
4850 if (!(flags & DEQUEUE_SLEEP))
4851 se->vruntime -= cfs_rq->min_vruntime;
4853 /* return excess runtime on last dequeue */
4854 return_cfs_rq_runtime(cfs_rq);
4856 update_cfs_group(se);
4859 * Now advance min_vruntime if @se was the entity holding it back,
4860 * except when: DEQUEUE_SAVE && !DEQUEUE_MOVE, in this case we'll be
4861 * put back on, and if we advance min_vruntime, we'll be placed back
4862 * further than we started -- ie. we'll be penalized.
4864 if ((flags & (DEQUEUE_SAVE | DEQUEUE_MOVE)) != DEQUEUE_SAVE)
4865 update_min_vruntime(cfs_rq);
4867 if (cfs_rq->nr_running == 0)
4868 update_idle_cfs_rq_clock_pelt(cfs_rq);
4872 * Preempt the current task with a newly woken task if needed:
4875 check_preempt_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr)
4877 unsigned long ideal_runtime, delta_exec;
4878 struct sched_entity *se;
4881 ideal_runtime = sched_slice(cfs_rq, curr);
4882 delta_exec = curr->sum_exec_runtime - curr->prev_sum_exec_runtime;
4883 if (delta_exec > ideal_runtime) {
4884 resched_curr(rq_of(cfs_rq));
4886 * The current task ran long enough, ensure it doesn't get
4887 * re-elected due to buddy favours.
4889 clear_buddies(cfs_rq, curr);
4894 * Ensure that a task that missed wakeup preemption by a
4895 * narrow margin doesn't have to wait for a full slice.
4896 * This also mitigates buddy induced latencies under load.
4898 if (delta_exec < sysctl_sched_min_granularity)
4901 se = __pick_first_entity(cfs_rq);
4902 delta = curr->vruntime - se->vruntime;
4907 if (delta > ideal_runtime)
4908 resched_curr(rq_of(cfs_rq));
4912 set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
4914 clear_buddies(cfs_rq, se);
4916 /* 'current' is not kept within the tree. */
4919 * Any task has to be enqueued before it get to execute on
4920 * a CPU. So account for the time it spent waiting on the
4923 update_stats_wait_end_fair(cfs_rq, se);
4924 __dequeue_entity(cfs_rq, se);
4925 update_load_avg(cfs_rq, se, UPDATE_TG);
4928 update_stats_curr_start(cfs_rq, se);
4932 * Track our maximum slice length, if the CPU's load is at
4933 * least twice that of our own weight (i.e. dont track it
4934 * when there are only lesser-weight tasks around):
4936 if (schedstat_enabled() &&
4937 rq_of(cfs_rq)->cfs.load.weight >= 2*se->load.weight) {
4938 struct sched_statistics *stats;
4940 stats = __schedstats_from_se(se);
4941 __schedstat_set(stats->slice_max,
4942 max((u64)stats->slice_max,
4943 se->sum_exec_runtime - se->prev_sum_exec_runtime));
4946 se->prev_sum_exec_runtime = se->sum_exec_runtime;
4950 wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se);
4953 * Pick the next process, keeping these things in mind, in this order:
4954 * 1) keep things fair between processes/task groups
4955 * 2) pick the "next" process, since someone really wants that to run
4956 * 3) pick the "last" process, for cache locality
4957 * 4) do not run the "skip" process, if something else is available
4959 static struct sched_entity *
4960 pick_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *curr)
4962 struct sched_entity *left = __pick_first_entity(cfs_rq);
4963 struct sched_entity *se;
4966 * If curr is set we have to see if its left of the leftmost entity
4967 * still in the tree, provided there was anything in the tree at all.
4969 if (!left || (curr && entity_before(curr, left)))
4972 se = left; /* ideally we run the leftmost entity */
4975 * Avoid running the skip buddy, if running something else can
4976 * be done without getting too unfair.
4978 if (cfs_rq->skip && cfs_rq->skip == se) {
4979 struct sched_entity *second;
4982 second = __pick_first_entity(cfs_rq);
4984 second = __pick_next_entity(se);
4985 if (!second || (curr && entity_before(curr, second)))
4989 if (second && wakeup_preempt_entity(second, left) < 1)
4993 if (cfs_rq->next && wakeup_preempt_entity(cfs_rq->next, left) < 1) {
4995 * Someone really wants this to run. If it's not unfair, run it.
4998 } else if (cfs_rq->last && wakeup_preempt_entity(cfs_rq->last, left) < 1) {
5000 * Prefer last buddy, try to return the CPU to a preempted task.
5008 static bool check_cfs_rq_runtime(struct cfs_rq *cfs_rq);
5010 static void put_prev_entity(struct cfs_rq *cfs_rq, struct sched_entity *prev)
5013 * If still on the runqueue then deactivate_task()
5014 * was not called and update_curr() has to be done:
5017 update_curr(cfs_rq);
5019 /* throttle cfs_rqs exceeding runtime */
5020 check_cfs_rq_runtime(cfs_rq);
5022 check_spread(cfs_rq, prev);
5025 update_stats_wait_start_fair(cfs_rq, prev);
5026 /* Put 'current' back into the tree. */
5027 __enqueue_entity(cfs_rq, prev);
5028 /* in !on_rq case, update occurred at dequeue */
5029 update_load_avg(cfs_rq, prev, 0);
5031 cfs_rq->curr = NULL;
5035 entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr, int queued)
5038 * Update run-time statistics of the 'current'.
5040 update_curr(cfs_rq);
5043 * Ensure that runnable average is periodically updated.
5045 update_load_avg(cfs_rq, curr, UPDATE_TG);
5046 update_cfs_group(curr);
5048 #ifdef CONFIG_SCHED_HRTICK
5050 * queued ticks are scheduled to match the slice, so don't bother
5051 * validating it and just reschedule.
5054 resched_curr(rq_of(cfs_rq));
5058 * don't let the period tick interfere with the hrtick preemption
5060 if (!sched_feat(DOUBLE_TICK) &&
5061 hrtimer_active(&rq_of(cfs_rq)->hrtick_timer))
5065 if (cfs_rq->nr_running > 1)
5066 check_preempt_tick(cfs_rq, curr);
5070 /**************************************************
5071 * CFS bandwidth control machinery
5074 #ifdef CONFIG_CFS_BANDWIDTH
5076 #ifdef CONFIG_JUMP_LABEL
5077 static struct static_key __cfs_bandwidth_used;
5079 static inline bool cfs_bandwidth_used(void)
5081 return static_key_false(&__cfs_bandwidth_used);
5084 void cfs_bandwidth_usage_inc(void)
5086 static_key_slow_inc_cpuslocked(&__cfs_bandwidth_used);
5089 void cfs_bandwidth_usage_dec(void)
5091 static_key_slow_dec_cpuslocked(&__cfs_bandwidth_used);
5093 #else /* CONFIG_JUMP_LABEL */
5094 static bool cfs_bandwidth_used(void)
5099 void cfs_bandwidth_usage_inc(void) {}
5100 void cfs_bandwidth_usage_dec(void) {}
5101 #endif /* CONFIG_JUMP_LABEL */
5104 * default period for cfs group bandwidth.
5105 * default: 0.1s, units: nanoseconds
5107 static inline u64 default_cfs_period(void)
5109 return 100000000ULL;
5112 static inline u64 sched_cfs_bandwidth_slice(void)
5114 return (u64)sysctl_sched_cfs_bandwidth_slice * NSEC_PER_USEC;
5118 * Replenish runtime according to assigned quota. We use sched_clock_cpu
5119 * directly instead of rq->clock to avoid adding additional synchronization
5122 * requires cfs_b->lock
5124 void __refill_cfs_bandwidth_runtime(struct cfs_bandwidth *cfs_b)
5128 if (unlikely(cfs_b->quota == RUNTIME_INF))
5131 cfs_b->runtime += cfs_b->quota;
5132 runtime = cfs_b->runtime_snap - cfs_b->runtime;
5134 cfs_b->burst_time += runtime;
5138 cfs_b->runtime = min(cfs_b->runtime, cfs_b->quota + cfs_b->burst);
5139 cfs_b->runtime_snap = cfs_b->runtime;
5142 static inline struct cfs_bandwidth *tg_cfs_bandwidth(struct task_group *tg)
5144 return &tg->cfs_bandwidth;
5147 /* returns 0 on failure to allocate runtime */
5148 static int __assign_cfs_rq_runtime(struct cfs_bandwidth *cfs_b,
5149 struct cfs_rq *cfs_rq, u64 target_runtime)
5151 u64 min_amount, amount = 0;
5153 lockdep_assert_held(&cfs_b->lock);
5155 /* note: this is a positive sum as runtime_remaining <= 0 */
5156 min_amount = target_runtime - cfs_rq->runtime_remaining;
5158 if (cfs_b->quota == RUNTIME_INF)
5159 amount = min_amount;
5161 start_cfs_bandwidth(cfs_b);
5163 if (cfs_b->runtime > 0) {
5164 amount = min(cfs_b->runtime, min_amount);
5165 cfs_b->runtime -= amount;
5170 cfs_rq->runtime_remaining += amount;
5172 return cfs_rq->runtime_remaining > 0;
5175 /* returns 0 on failure to allocate runtime */
5176 static int assign_cfs_rq_runtime(struct cfs_rq *cfs_rq)
5178 struct cfs_bandwidth *cfs_b = tg_cfs_bandwidth(cfs_rq->tg);
5181 raw_spin_lock(&cfs_b->lock);
5182 ret = __assign_cfs_rq_runtime(cfs_b, cfs_rq, sched_cfs_bandwidth_slice());
5183 raw_spin_unlock(&cfs_b->lock);
5188 static void __account_cfs_rq_runtime(struct cfs_rq *cfs_rq, u64 delta_exec)
5190 /* dock delta_exec before expiring quota (as it could span periods) */
5191 cfs_rq->runtime_remaining -= delta_exec;
5193 if (likely(cfs_rq->runtime_remaining > 0))
5196 if (cfs_rq->throttled)
5199 * if we're unable to extend our runtime we resched so that the active
5200 * hierarchy can be throttled
5202 if (!assign_cfs_rq_runtime(cfs_rq) && likely(cfs_rq->curr))
5203 resched_curr(rq_of(cfs_rq));
5206 static __always_inline
5207 void account_cfs_rq_runtime(struct cfs_rq *cfs_rq, u64 delta_exec)
5209 if (!cfs_bandwidth_used() || !cfs_rq->runtime_enabled)
5212 __account_cfs_rq_runtime(cfs_rq, delta_exec);
5215 static inline int cfs_rq_throttled(struct cfs_rq *cfs_rq)
5217 return cfs_bandwidth_used() && cfs_rq->throttled;
5220 /* check whether cfs_rq, or any parent, is throttled */
5221 static inline int throttled_hierarchy(struct cfs_rq *cfs_rq)
5223 return cfs_bandwidth_used() && cfs_rq->throttle_count;
5227 * Ensure that neither of the group entities corresponding to src_cpu or
5228 * dest_cpu are members of a throttled hierarchy when performing group
5229 * load-balance operations.
5231 static inline int throttled_lb_pair(struct task_group *tg,
5232 int src_cpu, int dest_cpu)
5234 struct cfs_rq *src_cfs_rq, *dest_cfs_rq;
5236 src_cfs_rq = tg->cfs_rq[src_cpu];
5237 dest_cfs_rq = tg->cfs_rq[dest_cpu];
5239 return throttled_hierarchy(src_cfs_rq) ||
5240 throttled_hierarchy(dest_cfs_rq);
5243 static int tg_unthrottle_up(struct task_group *tg, void *data)
5245 struct rq *rq = data;
5246 struct cfs_rq *cfs_rq = tg->cfs_rq[cpu_of(rq)];
5248 cfs_rq->throttle_count--;
5249 if (!cfs_rq->throttle_count) {
5250 cfs_rq->throttled_clock_pelt_time += rq_clock_pelt(rq) -
5251 cfs_rq->throttled_clock_pelt;
5253 /* Add cfs_rq with load or one or more already running entities to the list */
5254 if (!cfs_rq_is_decayed(cfs_rq))
5255 list_add_leaf_cfs_rq(cfs_rq);
5261 static int tg_throttle_down(struct task_group *tg, void *data)
5263 struct rq *rq = data;
5264 struct cfs_rq *cfs_rq = tg->cfs_rq[cpu_of(rq)];
5266 /* group is entering throttled state, stop time */
5267 if (!cfs_rq->throttle_count) {
5268 cfs_rq->throttled_clock_pelt = rq_clock_pelt(rq);
5269 list_del_leaf_cfs_rq(cfs_rq);
5271 cfs_rq->throttle_count++;
5276 static bool throttle_cfs_rq(struct cfs_rq *cfs_rq)
5278 struct rq *rq = rq_of(cfs_rq);
5279 struct cfs_bandwidth *cfs_b = tg_cfs_bandwidth(cfs_rq->tg);
5280 struct sched_entity *se;
5281 long task_delta, idle_task_delta, dequeue = 1;
5283 raw_spin_lock(&cfs_b->lock);
5284 /* This will start the period timer if necessary */
5285 if (__assign_cfs_rq_runtime(cfs_b, cfs_rq, 1)) {
5287 * We have raced with bandwidth becoming available, and if we
5288 * actually throttled the timer might not unthrottle us for an
5289 * entire period. We additionally needed to make sure that any
5290 * subsequent check_cfs_rq_runtime calls agree not to throttle
5291 * us, as we may commit to do cfs put_prev+pick_next, so we ask
5292 * for 1ns of runtime rather than just check cfs_b.
5296 list_add_tail_rcu(&cfs_rq->throttled_list,
5297 &cfs_b->throttled_cfs_rq);
5299 raw_spin_unlock(&cfs_b->lock);
5302 return false; /* Throttle no longer required. */
5304 se = cfs_rq->tg->se[cpu_of(rq_of(cfs_rq))];
5306 /* freeze hierarchy runnable averages while throttled */
5308 walk_tg_tree_from(cfs_rq->tg, tg_throttle_down, tg_nop, (void *)rq);
5311 task_delta = cfs_rq->h_nr_running;
5312 idle_task_delta = cfs_rq->idle_h_nr_running;
5313 for_each_sched_entity(se) {
5314 struct cfs_rq *qcfs_rq = cfs_rq_of(se);
5315 /* throttled entity or throttle-on-deactivate */
5319 dequeue_entity(qcfs_rq, se, DEQUEUE_SLEEP);
5321 if (cfs_rq_is_idle(group_cfs_rq(se)))
5322 idle_task_delta = cfs_rq->h_nr_running;
5324 qcfs_rq->h_nr_running -= task_delta;
5325 qcfs_rq->idle_h_nr_running -= idle_task_delta;
5327 if (qcfs_rq->load.weight) {
5328 /* Avoid re-evaluating load for this entity: */
5329 se = parent_entity(se);
5334 for_each_sched_entity(se) {
5335 struct cfs_rq *qcfs_rq = cfs_rq_of(se);
5336 /* throttled entity or throttle-on-deactivate */
5340 update_load_avg(qcfs_rq, se, 0);
5341 se_update_runnable(se);
5343 if (cfs_rq_is_idle(group_cfs_rq(se)))
5344 idle_task_delta = cfs_rq->h_nr_running;
5346 qcfs_rq->h_nr_running -= task_delta;
5347 qcfs_rq->idle_h_nr_running -= idle_task_delta;
5350 /* At this point se is NULL and we are at root level*/
5351 sub_nr_running(rq, task_delta);
5355 * Note: distribution will already see us throttled via the
5356 * throttled-list. rq->lock protects completion.
5358 cfs_rq->throttled = 1;
5359 cfs_rq->throttled_clock = rq_clock(rq);
5363 void unthrottle_cfs_rq(struct cfs_rq *cfs_rq)
5365 struct rq *rq = rq_of(cfs_rq);
5366 struct cfs_bandwidth *cfs_b = tg_cfs_bandwidth(cfs_rq->tg);
5367 struct sched_entity *se;
5368 long task_delta, idle_task_delta;
5370 se = cfs_rq->tg->se[cpu_of(rq)];
5372 cfs_rq->throttled = 0;
5374 update_rq_clock(rq);
5376 raw_spin_lock(&cfs_b->lock);
5377 cfs_b->throttled_time += rq_clock(rq) - cfs_rq->throttled_clock;
5378 list_del_rcu(&cfs_rq->throttled_list);
5379 raw_spin_unlock(&cfs_b->lock);
5381 /* update hierarchical throttle state */
5382 walk_tg_tree_from(cfs_rq->tg, tg_nop, tg_unthrottle_up, (void *)rq);
5384 if (!cfs_rq->load.weight) {
5385 if (!cfs_rq->on_list)
5388 * Nothing to run but something to decay (on_list)?
5389 * Complete the branch.
5391 for_each_sched_entity(se) {
5392 if (list_add_leaf_cfs_rq(cfs_rq_of(se)))
5395 goto unthrottle_throttle;
5398 task_delta = cfs_rq->h_nr_running;
5399 idle_task_delta = cfs_rq->idle_h_nr_running;
5400 for_each_sched_entity(se) {
5401 struct cfs_rq *qcfs_rq = cfs_rq_of(se);
5405 enqueue_entity(qcfs_rq, se, ENQUEUE_WAKEUP);
5407 if (cfs_rq_is_idle(group_cfs_rq(se)))
5408 idle_task_delta = cfs_rq->h_nr_running;
5410 qcfs_rq->h_nr_running += task_delta;
5411 qcfs_rq->idle_h_nr_running += idle_task_delta;
5413 /* end evaluation on encountering a throttled cfs_rq */
5414 if (cfs_rq_throttled(qcfs_rq))
5415 goto unthrottle_throttle;
5418 for_each_sched_entity(se) {
5419 struct cfs_rq *qcfs_rq = cfs_rq_of(se);
5421 update_load_avg(qcfs_rq, se, UPDATE_TG);
5422 se_update_runnable(se);
5424 if (cfs_rq_is_idle(group_cfs_rq(se)))
5425 idle_task_delta = cfs_rq->h_nr_running;
5427 qcfs_rq->h_nr_running += task_delta;
5428 qcfs_rq->idle_h_nr_running += idle_task_delta;
5430 /* end evaluation on encountering a throttled cfs_rq */
5431 if (cfs_rq_throttled(qcfs_rq))
5432 goto unthrottle_throttle;
5435 /* At this point se is NULL and we are at root level*/
5436 add_nr_running(rq, task_delta);
5438 unthrottle_throttle:
5439 assert_list_leaf_cfs_rq(rq);
5441 /* Determine whether we need to wake up potentially idle CPU: */
5442 if (rq->curr == rq->idle && rq->cfs.nr_running)
5446 static void distribute_cfs_runtime(struct cfs_bandwidth *cfs_b)
5448 struct cfs_rq *cfs_rq;
5449 u64 runtime, remaining = 1;
5452 list_for_each_entry_rcu(cfs_rq, &cfs_b->throttled_cfs_rq,
5454 struct rq *rq = rq_of(cfs_rq);
5457 rq_lock_irqsave(rq, &rf);
5458 if (!cfs_rq_throttled(cfs_rq))
5461 /* By the above check, this should never be true */
5462 SCHED_WARN_ON(cfs_rq->runtime_remaining > 0);
5464 raw_spin_lock(&cfs_b->lock);
5465 runtime = -cfs_rq->runtime_remaining + 1;
5466 if (runtime > cfs_b->runtime)
5467 runtime = cfs_b->runtime;
5468 cfs_b->runtime -= runtime;
5469 remaining = cfs_b->runtime;
5470 raw_spin_unlock(&cfs_b->lock);
5472 cfs_rq->runtime_remaining += runtime;
5474 /* we check whether we're throttled above */
5475 if (cfs_rq->runtime_remaining > 0)
5476 unthrottle_cfs_rq(cfs_rq);
5479 rq_unlock_irqrestore(rq, &rf);
5488 * Responsible for refilling a task_group's bandwidth and unthrottling its
5489 * cfs_rqs as appropriate. If there has been no activity within the last
5490 * period the timer is deactivated until scheduling resumes; cfs_b->idle is
5491 * used to track this state.
5493 static int do_sched_cfs_period_timer(struct cfs_bandwidth *cfs_b, int overrun, unsigned long flags)
5497 /* no need to continue the timer with no bandwidth constraint */
5498 if (cfs_b->quota == RUNTIME_INF)
5499 goto out_deactivate;
5501 throttled = !list_empty(&cfs_b->throttled_cfs_rq);
5502 cfs_b->nr_periods += overrun;
5504 /* Refill extra burst quota even if cfs_b->idle */
5505 __refill_cfs_bandwidth_runtime(cfs_b);
5508 * idle depends on !throttled (for the case of a large deficit), and if
5509 * we're going inactive then everything else can be deferred
5511 if (cfs_b->idle && !throttled)
5512 goto out_deactivate;
5515 /* mark as potentially idle for the upcoming period */
5520 /* account preceding periods in which throttling occurred */
5521 cfs_b->nr_throttled += overrun;
5524 * This check is repeated as we release cfs_b->lock while we unthrottle.
5526 while (throttled && cfs_b->runtime > 0) {
5527 raw_spin_unlock_irqrestore(&cfs_b->lock, flags);
5528 /* we can't nest cfs_b->lock while distributing bandwidth */
5529 distribute_cfs_runtime(cfs_b);
5530 raw_spin_lock_irqsave(&cfs_b->lock, flags);
5532 throttled = !list_empty(&cfs_b->throttled_cfs_rq);
5536 * While we are ensured activity in the period following an
5537 * unthrottle, this also covers the case in which the new bandwidth is
5538 * insufficient to cover the existing bandwidth deficit. (Forcing the
5539 * timer to remain active while there are any throttled entities.)
5549 /* a cfs_rq won't donate quota below this amount */
5550 static const u64 min_cfs_rq_runtime = 1 * NSEC_PER_MSEC;
5551 /* minimum remaining period time to redistribute slack quota */
5552 static const u64 min_bandwidth_expiration = 2 * NSEC_PER_MSEC;
5553 /* how long we wait to gather additional slack before distributing */
5554 static const u64 cfs_bandwidth_slack_period = 5 * NSEC_PER_MSEC;
5557 * Are we near the end of the current quota period?
5559 * Requires cfs_b->lock for hrtimer_expires_remaining to be safe against the
5560 * hrtimer base being cleared by hrtimer_start. In the case of
5561 * migrate_hrtimers, base is never cleared, so we are fine.
5563 static int runtime_refresh_within(struct cfs_bandwidth *cfs_b, u64 min_expire)
5565 struct hrtimer *refresh_timer = &cfs_b->period_timer;
5568 /* if the call-back is running a quota refresh is already occurring */
5569 if (hrtimer_callback_running(refresh_timer))
5572 /* is a quota refresh about to occur? */
5573 remaining = ktime_to_ns(hrtimer_expires_remaining(refresh_timer));
5574 if (remaining < (s64)min_expire)
5580 static void start_cfs_slack_bandwidth(struct cfs_bandwidth *cfs_b)
5582 u64 min_left = cfs_bandwidth_slack_period + min_bandwidth_expiration;
5584 /* if there's a quota refresh soon don't bother with slack */
5585 if (runtime_refresh_within(cfs_b, min_left))
5588 /* don't push forwards an existing deferred unthrottle */
5589 if (cfs_b->slack_started)
5591 cfs_b->slack_started = true;
5593 hrtimer_start(&cfs_b->slack_timer,
5594 ns_to_ktime(cfs_bandwidth_slack_period),
5598 /* we know any runtime found here is valid as update_curr() precedes return */
5599 static void __return_cfs_rq_runtime(struct cfs_rq *cfs_rq)
5601 struct cfs_bandwidth *cfs_b = tg_cfs_bandwidth(cfs_rq->tg);
5602 s64 slack_runtime = cfs_rq->runtime_remaining - min_cfs_rq_runtime;
5604 if (slack_runtime <= 0)
5607 raw_spin_lock(&cfs_b->lock);
5608 if (cfs_b->quota != RUNTIME_INF) {
5609 cfs_b->runtime += slack_runtime;
5611 /* we are under rq->lock, defer unthrottling using a timer */
5612 if (cfs_b->runtime > sched_cfs_bandwidth_slice() &&
5613 !list_empty(&cfs_b->throttled_cfs_rq))
5614 start_cfs_slack_bandwidth(cfs_b);
5616 raw_spin_unlock(&cfs_b->lock);
5618 /* even if it's not valid for return we don't want to try again */
5619 cfs_rq->runtime_remaining -= slack_runtime;
5622 static __always_inline void return_cfs_rq_runtime(struct cfs_rq *cfs_rq)
5624 if (!cfs_bandwidth_used())
5627 if (!cfs_rq->runtime_enabled || cfs_rq->nr_running)
5630 __return_cfs_rq_runtime(cfs_rq);
5634 * This is done with a timer (instead of inline with bandwidth return) since
5635 * it's necessary to juggle rq->locks to unthrottle their respective cfs_rqs.
5637 static void do_sched_cfs_slack_timer(struct cfs_bandwidth *cfs_b)
5639 u64 runtime = 0, slice = sched_cfs_bandwidth_slice();
5640 unsigned long flags;
5642 /* confirm we're still not at a refresh boundary */
5643 raw_spin_lock_irqsave(&cfs_b->lock, flags);
5644 cfs_b->slack_started = false;
5646 if (runtime_refresh_within(cfs_b, min_bandwidth_expiration)) {
5647 raw_spin_unlock_irqrestore(&cfs_b->lock, flags);
5651 if (cfs_b->quota != RUNTIME_INF && cfs_b->runtime > slice)
5652 runtime = cfs_b->runtime;
5654 raw_spin_unlock_irqrestore(&cfs_b->lock, flags);
5659 distribute_cfs_runtime(cfs_b);
5663 * When a group wakes up we want to make sure that its quota is not already
5664 * expired/exceeded, otherwise it may be allowed to steal additional ticks of
5665 * runtime as update_curr() throttling can not trigger until it's on-rq.
5667 static void check_enqueue_throttle(struct cfs_rq *cfs_rq)
5669 if (!cfs_bandwidth_used())
5672 /* an active group must be handled by the update_curr()->put() path */
5673 if (!cfs_rq->runtime_enabled || cfs_rq->curr)
5676 /* ensure the group is not already throttled */
5677 if (cfs_rq_throttled(cfs_rq))
5680 /* update runtime allocation */
5681 account_cfs_rq_runtime(cfs_rq, 0);
5682 if (cfs_rq->runtime_remaining <= 0)
5683 throttle_cfs_rq(cfs_rq);
5686 static void sync_throttle(struct task_group *tg, int cpu)
5688 struct cfs_rq *pcfs_rq, *cfs_rq;
5690 if (!cfs_bandwidth_used())
5696 cfs_rq = tg->cfs_rq[cpu];
5697 pcfs_rq = tg->parent->cfs_rq[cpu];
5699 cfs_rq->throttle_count = pcfs_rq->throttle_count;
5700 cfs_rq->throttled_clock_pelt = rq_clock_pelt(cpu_rq(cpu));
5703 /* conditionally throttle active cfs_rq's from put_prev_entity() */
5704 static bool check_cfs_rq_runtime(struct cfs_rq *cfs_rq)
5706 if (!cfs_bandwidth_used())
5709 if (likely(!cfs_rq->runtime_enabled || cfs_rq->runtime_remaining > 0))
5713 * it's possible for a throttled entity to be forced into a running
5714 * state (e.g. set_curr_task), in this case we're finished.
5716 if (cfs_rq_throttled(cfs_rq))
5719 return throttle_cfs_rq(cfs_rq);
5722 static enum hrtimer_restart sched_cfs_slack_timer(struct hrtimer *timer)
5724 struct cfs_bandwidth *cfs_b =
5725 container_of(timer, struct cfs_bandwidth, slack_timer);
5727 do_sched_cfs_slack_timer(cfs_b);
5729 return HRTIMER_NORESTART;
5732 extern const u64 max_cfs_quota_period;
5734 static enum hrtimer_restart sched_cfs_period_timer(struct hrtimer *timer)
5736 struct cfs_bandwidth *cfs_b =
5737 container_of(timer, struct cfs_bandwidth, period_timer);
5738 unsigned long flags;
5743 raw_spin_lock_irqsave(&cfs_b->lock, flags);
5745 overrun = hrtimer_forward_now(timer, cfs_b->period);
5749 idle = do_sched_cfs_period_timer(cfs_b, overrun, flags);
5752 u64 new, old = ktime_to_ns(cfs_b->period);
5755 * Grow period by a factor of 2 to avoid losing precision.
5756 * Precision loss in the quota/period ratio can cause __cfs_schedulable
5760 if (new < max_cfs_quota_period) {
5761 cfs_b->period = ns_to_ktime(new);
5765 pr_warn_ratelimited(
5766 "cfs_period_timer[cpu%d]: period too short, scaling up (new cfs_period_us = %lld, cfs_quota_us = %lld)\n",
5768 div_u64(new, NSEC_PER_USEC),
5769 div_u64(cfs_b->quota, NSEC_PER_USEC));
5771 pr_warn_ratelimited(
5772 "cfs_period_timer[cpu%d]: period too short, but cannot scale up without losing precision (cfs_period_us = %lld, cfs_quota_us = %lld)\n",
5774 div_u64(old, NSEC_PER_USEC),
5775 div_u64(cfs_b->quota, NSEC_PER_USEC));
5778 /* reset count so we don't come right back in here */
5783 cfs_b->period_active = 0;
5784 raw_spin_unlock_irqrestore(&cfs_b->lock, flags);
5786 return idle ? HRTIMER_NORESTART : HRTIMER_RESTART;
5789 void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b)
5791 raw_spin_lock_init(&cfs_b->lock);
5793 cfs_b->quota = RUNTIME_INF;
5794 cfs_b->period = ns_to_ktime(default_cfs_period());
5797 INIT_LIST_HEAD(&cfs_b->throttled_cfs_rq);
5798 hrtimer_init(&cfs_b->period_timer, CLOCK_MONOTONIC, HRTIMER_MODE_ABS_PINNED);
5799 cfs_b->period_timer.function = sched_cfs_period_timer;
5800 hrtimer_init(&cfs_b->slack_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
5801 cfs_b->slack_timer.function = sched_cfs_slack_timer;
5802 cfs_b->slack_started = false;
5805 static void init_cfs_rq_runtime(struct cfs_rq *cfs_rq)
5807 cfs_rq->runtime_enabled = 0;
5808 INIT_LIST_HEAD(&cfs_rq->throttled_list);
5811 void start_cfs_bandwidth(struct cfs_bandwidth *cfs_b)
5813 lockdep_assert_held(&cfs_b->lock);
5815 if (cfs_b->period_active)
5818 cfs_b->period_active = 1;
5819 hrtimer_forward_now(&cfs_b->period_timer, cfs_b->period);
5820 hrtimer_start_expires(&cfs_b->period_timer, HRTIMER_MODE_ABS_PINNED);
5823 static void destroy_cfs_bandwidth(struct cfs_bandwidth *cfs_b)
5825 /* init_cfs_bandwidth() was not called */
5826 if (!cfs_b->throttled_cfs_rq.next)
5829 hrtimer_cancel(&cfs_b->period_timer);
5830 hrtimer_cancel(&cfs_b->slack_timer);
5834 * Both these CPU hotplug callbacks race against unregister_fair_sched_group()
5836 * The race is harmless, since modifying bandwidth settings of unhooked group
5837 * bits doesn't do much.
5840 /* cpu online callback */
5841 static void __maybe_unused update_runtime_enabled(struct rq *rq)
5843 struct task_group *tg;
5845 lockdep_assert_rq_held(rq);
5848 list_for_each_entry_rcu(tg, &task_groups, list) {
5849 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
5850 struct cfs_rq *cfs_rq = tg->cfs_rq[cpu_of(rq)];
5852 raw_spin_lock(&cfs_b->lock);
5853 cfs_rq->runtime_enabled = cfs_b->quota != RUNTIME_INF;
5854 raw_spin_unlock(&cfs_b->lock);
5859 /* cpu offline callback */
5860 static void __maybe_unused unthrottle_offline_cfs_rqs(struct rq *rq)
5862 struct task_group *tg;
5864 lockdep_assert_rq_held(rq);
5867 list_for_each_entry_rcu(tg, &task_groups, list) {
5868 struct cfs_rq *cfs_rq = tg->cfs_rq[cpu_of(rq)];
5870 if (!cfs_rq->runtime_enabled)
5874 * clock_task is not advancing so we just need to make sure
5875 * there's some valid quota amount
5877 cfs_rq->runtime_remaining = 1;
5879 * Offline rq is schedulable till CPU is completely disabled
5880 * in take_cpu_down(), so we prevent new cfs throttling here.
5882 cfs_rq->runtime_enabled = 0;
5884 if (cfs_rq_throttled(cfs_rq))
5885 unthrottle_cfs_rq(cfs_rq);
5890 #else /* CONFIG_CFS_BANDWIDTH */
5892 static inline bool cfs_bandwidth_used(void)
5897 static void account_cfs_rq_runtime(struct cfs_rq *cfs_rq, u64 delta_exec) {}
5898 static bool check_cfs_rq_runtime(struct cfs_rq *cfs_rq) { return false; }
5899 static void check_enqueue_throttle(struct cfs_rq *cfs_rq) {}
5900 static inline void sync_throttle(struct task_group *tg, int cpu) {}
5901 static __always_inline void return_cfs_rq_runtime(struct cfs_rq *cfs_rq) {}
5903 static inline int cfs_rq_throttled(struct cfs_rq *cfs_rq)
5908 static inline int throttled_hierarchy(struct cfs_rq *cfs_rq)
5913 static inline int throttled_lb_pair(struct task_group *tg,
5914 int src_cpu, int dest_cpu)
5919 void init_cfs_bandwidth(struct cfs_bandwidth *cfs_b) {}
5921 #ifdef CONFIG_FAIR_GROUP_SCHED
5922 static void init_cfs_rq_runtime(struct cfs_rq *cfs_rq) {}
5925 static inline struct cfs_bandwidth *tg_cfs_bandwidth(struct task_group *tg)
5929 static inline void destroy_cfs_bandwidth(struct cfs_bandwidth *cfs_b) {}
5930 static inline void update_runtime_enabled(struct rq *rq) {}
5931 static inline void unthrottle_offline_cfs_rqs(struct rq *rq) {}
5933 #endif /* CONFIG_CFS_BANDWIDTH */
5935 /**************************************************
5936 * CFS operations on tasks:
5939 #ifdef CONFIG_SCHED_HRTICK
5940 static void hrtick_start_fair(struct rq *rq, struct task_struct *p)
5942 struct sched_entity *se = &p->se;
5943 struct cfs_rq *cfs_rq = cfs_rq_of(se);
5945 SCHED_WARN_ON(task_rq(p) != rq);
5947 if (rq->cfs.h_nr_running > 1) {
5948 u64 slice = sched_slice(cfs_rq, se);
5949 u64 ran = se->sum_exec_runtime - se->prev_sum_exec_runtime;
5950 s64 delta = slice - ran;
5953 if (task_current(rq, p))
5957 hrtick_start(rq, delta);
5962 * called from enqueue/dequeue and updates the hrtick when the
5963 * current task is from our class and nr_running is low enough
5966 static void hrtick_update(struct rq *rq)
5968 struct task_struct *curr = rq->curr;
5970 if (!hrtick_enabled_fair(rq) || curr->sched_class != &fair_sched_class)
5973 if (cfs_rq_of(&curr->se)->nr_running < sched_nr_latency)
5974 hrtick_start_fair(rq, curr);
5976 #else /* !CONFIG_SCHED_HRTICK */
5978 hrtick_start_fair(struct rq *rq, struct task_struct *p)
5982 static inline void hrtick_update(struct rq *rq)
5988 static inline bool cpu_overutilized(int cpu)
5990 return !fits_capacity(cpu_util_cfs(cpu), capacity_of(cpu));
5993 static inline void update_overutilized_status(struct rq *rq)
5995 if (!READ_ONCE(rq->rd->overutilized) && cpu_overutilized(rq->cpu)) {
5996 WRITE_ONCE(rq->rd->overutilized, SG_OVERUTILIZED);
5997 trace_sched_overutilized_tp(rq->rd, SG_OVERUTILIZED);
6001 static inline void update_overutilized_status(struct rq *rq) { }
6004 /* Runqueue only has SCHED_IDLE tasks enqueued */
6005 static int sched_idle_rq(struct rq *rq)
6007 return unlikely(rq->nr_running == rq->cfs.idle_h_nr_running &&
6012 * Returns true if cfs_rq only has SCHED_IDLE entities enqueued. Note the use
6013 * of idle_nr_running, which does not consider idle descendants of normal
6016 static bool sched_idle_cfs_rq(struct cfs_rq *cfs_rq)
6018 return cfs_rq->nr_running &&
6019 cfs_rq->nr_running == cfs_rq->idle_nr_running;
6023 static int sched_idle_cpu(int cpu)
6025 return sched_idle_rq(cpu_rq(cpu));
6030 * The enqueue_task method is called before nr_running is
6031 * increased. Here we update the fair scheduling stats and
6032 * then put the task into the rbtree:
6035 enqueue_task_fair(struct rq *rq, struct task_struct *p, int flags)
6037 struct cfs_rq *cfs_rq;
6038 struct sched_entity *se = &p->se;
6039 int idle_h_nr_running = task_has_idle_policy(p);
6040 int task_new = !(flags & ENQUEUE_WAKEUP);
6043 * The code below (indirectly) updates schedutil which looks at
6044 * the cfs_rq utilization to select a frequency.
6045 * Let's add the task's estimated utilization to the cfs_rq's
6046 * estimated utilization, before we update schedutil.
6048 util_est_enqueue(&rq->cfs, p);
6051 * If in_iowait is set, the code below may not trigger any cpufreq
6052 * utilization updates, so do it here explicitly with the IOWAIT flag
6056 cpufreq_update_util(rq, SCHED_CPUFREQ_IOWAIT);
6058 for_each_sched_entity(se) {
6061 cfs_rq = cfs_rq_of(se);
6062 enqueue_entity(cfs_rq, se, flags);
6064 cfs_rq->h_nr_running++;
6065 cfs_rq->idle_h_nr_running += idle_h_nr_running;
6067 if (cfs_rq_is_idle(cfs_rq))
6068 idle_h_nr_running = 1;
6070 /* end evaluation on encountering a throttled cfs_rq */
6071 if (cfs_rq_throttled(cfs_rq))
6072 goto enqueue_throttle;
6074 flags = ENQUEUE_WAKEUP;
6077 for_each_sched_entity(se) {
6078 cfs_rq = cfs_rq_of(se);
6080 update_load_avg(cfs_rq, se, UPDATE_TG);
6081 se_update_runnable(se);
6082 update_cfs_group(se);
6084 cfs_rq->h_nr_running++;
6085 cfs_rq->idle_h_nr_running += idle_h_nr_running;
6087 if (cfs_rq_is_idle(cfs_rq))
6088 idle_h_nr_running = 1;
6090 /* end evaluation on encountering a throttled cfs_rq */
6091 if (cfs_rq_throttled(cfs_rq))
6092 goto enqueue_throttle;
6095 /* At this point se is NULL and we are at root level*/
6096 add_nr_running(rq, 1);
6099 * Since new tasks are assigned an initial util_avg equal to
6100 * half of the spare capacity of their CPU, tiny tasks have the
6101 * ability to cross the overutilized threshold, which will
6102 * result in the load balancer ruining all the task placement
6103 * done by EAS. As a way to mitigate that effect, do not account
6104 * for the first enqueue operation of new tasks during the
6105 * overutilized flag detection.
6107 * A better way of solving this problem would be to wait for
6108 * the PELT signals of tasks to converge before taking them
6109 * into account, but that is not straightforward to implement,
6110 * and the following generally works well enough in practice.
6113 update_overutilized_status(rq);
6116 assert_list_leaf_cfs_rq(rq);
6121 static void set_next_buddy(struct sched_entity *se);
6124 * The dequeue_task method is called before nr_running is
6125 * decreased. We remove the task from the rbtree and
6126 * update the fair scheduling stats:
6128 static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int flags)
6130 struct cfs_rq *cfs_rq;
6131 struct sched_entity *se = &p->se;
6132 int task_sleep = flags & DEQUEUE_SLEEP;
6133 int idle_h_nr_running = task_has_idle_policy(p);
6134 bool was_sched_idle = sched_idle_rq(rq);
6136 util_est_dequeue(&rq->cfs, p);
6138 for_each_sched_entity(se) {
6139 cfs_rq = cfs_rq_of(se);
6140 dequeue_entity(cfs_rq, se, flags);
6142 cfs_rq->h_nr_running--;
6143 cfs_rq->idle_h_nr_running -= idle_h_nr_running;
6145 if (cfs_rq_is_idle(cfs_rq))
6146 idle_h_nr_running = 1;
6148 /* end evaluation on encountering a throttled cfs_rq */
6149 if (cfs_rq_throttled(cfs_rq))
6150 goto dequeue_throttle;
6152 /* Don't dequeue parent if it has other entities besides us */
6153 if (cfs_rq->load.weight) {
6154 /* Avoid re-evaluating load for this entity: */
6155 se = parent_entity(se);
6157 * Bias pick_next to pick a task from this cfs_rq, as
6158 * p is sleeping when it is within its sched_slice.
6160 if (task_sleep && se && !throttled_hierarchy(cfs_rq))
6164 flags |= DEQUEUE_SLEEP;
6167 for_each_sched_entity(se) {
6168 cfs_rq = cfs_rq_of(se);
6170 update_load_avg(cfs_rq, se, UPDATE_TG);
6171 se_update_runnable(se);
6172 update_cfs_group(se);
6174 cfs_rq->h_nr_running--;
6175 cfs_rq->idle_h_nr_running -= idle_h_nr_running;
6177 if (cfs_rq_is_idle(cfs_rq))
6178 idle_h_nr_running = 1;
6180 /* end evaluation on encountering a throttled cfs_rq */
6181 if (cfs_rq_throttled(cfs_rq))
6182 goto dequeue_throttle;
6186 /* At this point se is NULL and we are at root level*/
6187 sub_nr_running(rq, 1);
6189 /* balance early to pull high priority tasks */
6190 if (unlikely(!was_sched_idle && sched_idle_rq(rq)))
6191 rq->next_balance = jiffies;
6194 util_est_update(&rq->cfs, p, task_sleep);
6200 /* Working cpumask for: load_balance, load_balance_newidle. */
6201 static DEFINE_PER_CPU(cpumask_var_t, load_balance_mask);
6202 static DEFINE_PER_CPU(cpumask_var_t, select_rq_mask);
6204 #ifdef CONFIG_NO_HZ_COMMON
6207 cpumask_var_t idle_cpus_mask;
6209 int has_blocked; /* Idle CPUS has blocked load */
6210 int needs_update; /* Newly idle CPUs need their next_balance collated */
6211 unsigned long next_balance; /* in jiffy units */
6212 unsigned long next_blocked; /* Next update of blocked load in jiffies */
6213 } nohz ____cacheline_aligned;
6215 #endif /* CONFIG_NO_HZ_COMMON */
6217 static unsigned long cpu_load(struct rq *rq)
6219 return cfs_rq_load_avg(&rq->cfs);
6223 * cpu_load_without - compute CPU load without any contributions from *p
6224 * @cpu: the CPU which load is requested
6225 * @p: the task which load should be discounted
6227 * The load of a CPU is defined by the load of tasks currently enqueued on that
6228 * CPU as well as tasks which are currently sleeping after an execution on that
6231 * This method returns the load of the specified CPU by discounting the load of
6232 * the specified task, whenever the task is currently contributing to the CPU
6235 static unsigned long cpu_load_without(struct rq *rq, struct task_struct *p)
6237 struct cfs_rq *cfs_rq;
6240 /* Task has no contribution or is new */
6241 if (cpu_of(rq) != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time))
6242 return cpu_load(rq);
6245 load = READ_ONCE(cfs_rq->avg.load_avg);
6247 /* Discount task's util from CPU's util */
6248 lsub_positive(&load, task_h_load(p));
6253 static unsigned long cpu_runnable(struct rq *rq)
6255 return cfs_rq_runnable_avg(&rq->cfs);
6258 static unsigned long cpu_runnable_without(struct rq *rq, struct task_struct *p)
6260 struct cfs_rq *cfs_rq;
6261 unsigned int runnable;
6263 /* Task has no contribution or is new */
6264 if (cpu_of(rq) != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time))
6265 return cpu_runnable(rq);
6268 runnable = READ_ONCE(cfs_rq->avg.runnable_avg);
6270 /* Discount task's runnable from CPU's runnable */
6271 lsub_positive(&runnable, p->se.avg.runnable_avg);
6276 static unsigned long capacity_of(int cpu)
6278 return cpu_rq(cpu)->cpu_capacity;
6281 static void record_wakee(struct task_struct *p)
6284 * Only decay a single time; tasks that have less then 1 wakeup per
6285 * jiffy will not have built up many flips.
6287 if (time_after(jiffies, current->wakee_flip_decay_ts + HZ)) {
6288 current->wakee_flips >>= 1;
6289 current->wakee_flip_decay_ts = jiffies;
6292 if (current->last_wakee != p) {
6293 current->last_wakee = p;
6294 current->wakee_flips++;
6299 * Detect M:N waker/wakee relationships via a switching-frequency heuristic.
6301 * A waker of many should wake a different task than the one last awakened
6302 * at a frequency roughly N times higher than one of its wakees.
6304 * In order to determine whether we should let the load spread vs consolidating
6305 * to shared cache, we look for a minimum 'flip' frequency of llc_size in one
6306 * partner, and a factor of lls_size higher frequency in the other.
6308 * With both conditions met, we can be relatively sure that the relationship is
6309 * non-monogamous, with partner count exceeding socket size.
6311 * Waker/wakee being client/server, worker/dispatcher, interrupt source or
6312 * whatever is irrelevant, spread criteria is apparent partner count exceeds
6315 static int wake_wide(struct task_struct *p)
6317 unsigned int master = current->wakee_flips;
6318 unsigned int slave = p->wakee_flips;
6319 int factor = __this_cpu_read(sd_llc_size);
6322 swap(master, slave);
6323 if (slave < factor || master < slave * factor)
6329 * The purpose of wake_affine() is to quickly determine on which CPU we can run
6330 * soonest. For the purpose of speed we only consider the waking and previous
6333 * wake_affine_idle() - only considers 'now', it check if the waking CPU is
6334 * cache-affine and is (or will be) idle.
6336 * wake_affine_weight() - considers the weight to reflect the average
6337 * scheduling latency of the CPUs. This seems to work
6338 * for the overloaded case.
6341 wake_affine_idle(int this_cpu, int prev_cpu, int sync)
6344 * If this_cpu is idle, it implies the wakeup is from interrupt
6345 * context. Only allow the move if cache is shared. Otherwise an
6346 * interrupt intensive workload could force all tasks onto one
6347 * node depending on the IO topology or IRQ affinity settings.
6349 * If the prev_cpu is idle and cache affine then avoid a migration.
6350 * There is no guarantee that the cache hot data from an interrupt
6351 * is more important than cache hot data on the prev_cpu and from
6352 * a cpufreq perspective, it's better to have higher utilisation
6355 if (available_idle_cpu(this_cpu) && cpus_share_cache(this_cpu, prev_cpu))
6356 return available_idle_cpu(prev_cpu) ? prev_cpu : this_cpu;
6358 if (sync && cpu_rq(this_cpu)->nr_running == 1)
6361 if (available_idle_cpu(prev_cpu))
6364 return nr_cpumask_bits;
6368 wake_affine_weight(struct sched_domain *sd, struct task_struct *p,
6369 int this_cpu, int prev_cpu, int sync)
6371 s64 this_eff_load, prev_eff_load;
6372 unsigned long task_load;
6374 this_eff_load = cpu_load(cpu_rq(this_cpu));
6377 unsigned long current_load = task_h_load(current);
6379 if (current_load > this_eff_load)
6382 this_eff_load -= current_load;
6385 task_load = task_h_load(p);
6387 this_eff_load += task_load;
6388 if (sched_feat(WA_BIAS))
6389 this_eff_load *= 100;
6390 this_eff_load *= capacity_of(prev_cpu);
6392 prev_eff_load = cpu_load(cpu_rq(prev_cpu));
6393 prev_eff_load -= task_load;
6394 if (sched_feat(WA_BIAS))
6395 prev_eff_load *= 100 + (sd->imbalance_pct - 100) / 2;
6396 prev_eff_load *= capacity_of(this_cpu);
6399 * If sync, adjust the weight of prev_eff_load such that if
6400 * prev_eff == this_eff that select_idle_sibling() will consider
6401 * stacking the wakee on top of the waker if no other CPU is
6407 return this_eff_load < prev_eff_load ? this_cpu : nr_cpumask_bits;
6410 static int wake_affine(struct sched_domain *sd, struct task_struct *p,
6411 int this_cpu, int prev_cpu, int sync)
6413 int target = nr_cpumask_bits;
6415 if (sched_feat(WA_IDLE))
6416 target = wake_affine_idle(this_cpu, prev_cpu, sync);
6418 if (sched_feat(WA_WEIGHT) && target == nr_cpumask_bits)
6419 target = wake_affine_weight(sd, p, this_cpu, prev_cpu, sync);
6421 schedstat_inc(p->stats.nr_wakeups_affine_attempts);
6422 if (target == nr_cpumask_bits)
6425 schedstat_inc(sd->ttwu_move_affine);
6426 schedstat_inc(p->stats.nr_wakeups_affine);
6430 static struct sched_group *
6431 find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu);
6434 * find_idlest_group_cpu - find the idlest CPU among the CPUs in the group.
6437 find_idlest_group_cpu(struct sched_group *group, struct task_struct *p, int this_cpu)
6439 unsigned long load, min_load = ULONG_MAX;
6440 unsigned int min_exit_latency = UINT_MAX;
6441 u64 latest_idle_timestamp = 0;
6442 int least_loaded_cpu = this_cpu;
6443 int shallowest_idle_cpu = -1;
6446 /* Check if we have any choice: */
6447 if (group->group_weight == 1)
6448 return cpumask_first(sched_group_span(group));
6450 /* Traverse only the allowed CPUs */
6451 for_each_cpu_and(i, sched_group_span(group), p->cpus_ptr) {
6452 struct rq *rq = cpu_rq(i);
6454 if (!sched_core_cookie_match(rq, p))
6457 if (sched_idle_cpu(i))
6460 if (available_idle_cpu(i)) {
6461 struct cpuidle_state *idle = idle_get_state(rq);
6462 if (idle && idle->exit_latency < min_exit_latency) {
6464 * We give priority to a CPU whose idle state
6465 * has the smallest exit latency irrespective
6466 * of any idle timestamp.
6468 min_exit_latency = idle->exit_latency;
6469 latest_idle_timestamp = rq->idle_stamp;
6470 shallowest_idle_cpu = i;
6471 } else if ((!idle || idle->exit_latency == min_exit_latency) &&
6472 rq->idle_stamp > latest_idle_timestamp) {
6474 * If equal or no active idle state, then
6475 * the most recently idled CPU might have
6478 latest_idle_timestamp = rq->idle_stamp;
6479 shallowest_idle_cpu = i;
6481 } else if (shallowest_idle_cpu == -1) {
6482 load = cpu_load(cpu_rq(i));
6483 if (load < min_load) {
6485 least_loaded_cpu = i;
6490 return shallowest_idle_cpu != -1 ? shallowest_idle_cpu : least_loaded_cpu;
6493 static inline int find_idlest_cpu(struct sched_domain *sd, struct task_struct *p,
6494 int cpu, int prev_cpu, int sd_flag)
6498 if (!cpumask_intersects(sched_domain_span(sd), p->cpus_ptr))
6502 * We need task's util for cpu_util_without, sync it up to
6503 * prev_cpu's last_update_time.
6505 if (!(sd_flag & SD_BALANCE_FORK))
6506 sync_entity_load_avg(&p->se);
6509 struct sched_group *group;
6510 struct sched_domain *tmp;
6513 if (!(sd->flags & sd_flag)) {
6518 group = find_idlest_group(sd, p, cpu);
6524 new_cpu = find_idlest_group_cpu(group, p, cpu);
6525 if (new_cpu == cpu) {
6526 /* Now try balancing at a lower domain level of 'cpu': */
6531 /* Now try balancing at a lower domain level of 'new_cpu': */
6533 weight = sd->span_weight;
6535 for_each_domain(cpu, tmp) {
6536 if (weight <= tmp->span_weight)
6538 if (tmp->flags & sd_flag)
6546 static inline int __select_idle_cpu(int cpu, struct task_struct *p)
6548 if ((available_idle_cpu(cpu) || sched_idle_cpu(cpu)) &&
6549 sched_cpu_cookie_match(cpu_rq(cpu), p))
6555 #ifdef CONFIG_SCHED_SMT
6556 DEFINE_STATIC_KEY_FALSE(sched_smt_present);
6557 EXPORT_SYMBOL_GPL(sched_smt_present);
6559 static inline void set_idle_cores(int cpu, int val)
6561 struct sched_domain_shared *sds;
6563 sds = rcu_dereference(per_cpu(sd_llc_shared, cpu));
6565 WRITE_ONCE(sds->has_idle_cores, val);
6568 static inline bool test_idle_cores(int cpu)
6570 struct sched_domain_shared *sds;
6572 sds = rcu_dereference(per_cpu(sd_llc_shared, cpu));
6574 return READ_ONCE(sds->has_idle_cores);
6580 * Scans the local SMT mask to see if the entire core is idle, and records this
6581 * information in sd_llc_shared->has_idle_cores.
6583 * Since SMT siblings share all cache levels, inspecting this limited remote
6584 * state should be fairly cheap.
6586 void __update_idle_core(struct rq *rq)
6588 int core = cpu_of(rq);
6592 if (test_idle_cores(core))
6595 for_each_cpu(cpu, cpu_smt_mask(core)) {
6599 if (!available_idle_cpu(cpu))
6603 set_idle_cores(core, 1);
6609 * Scan the entire LLC domain for idle cores; this dynamically switches off if
6610 * there are no idle cores left in the system; tracked through
6611 * sd_llc->shared->has_idle_cores and enabled through update_idle_core() above.
6613 static int select_idle_core(struct task_struct *p, int core, struct cpumask *cpus, int *idle_cpu)
6618 for_each_cpu(cpu, cpu_smt_mask(core)) {
6619 if (!available_idle_cpu(cpu)) {
6621 if (*idle_cpu == -1) {
6622 if (sched_idle_cpu(cpu) && cpumask_test_cpu(cpu, p->cpus_ptr)) {
6630 if (*idle_cpu == -1 && cpumask_test_cpu(cpu, p->cpus_ptr))
6637 cpumask_andnot(cpus, cpus, cpu_smt_mask(core));
6642 * Scan the local SMT mask for idle CPUs.
6644 static int select_idle_smt(struct task_struct *p, int target)
6648 for_each_cpu_and(cpu, cpu_smt_mask(target), p->cpus_ptr) {
6651 if (available_idle_cpu(cpu) || sched_idle_cpu(cpu))
6658 #else /* CONFIG_SCHED_SMT */
6660 static inline void set_idle_cores(int cpu, int val)
6664 static inline bool test_idle_cores(int cpu)
6669 static inline int select_idle_core(struct task_struct *p, int core, struct cpumask *cpus, int *idle_cpu)
6671 return __select_idle_cpu(core, p);
6674 static inline int select_idle_smt(struct task_struct *p, int target)
6679 #endif /* CONFIG_SCHED_SMT */
6682 * Scan the LLC domain for idle CPUs; this is dynamically regulated by
6683 * comparing the average scan cost (tracked in sd->avg_scan_cost) against the
6684 * average idle time for this rq (as found in rq->avg_idle).
6686 static int select_idle_cpu(struct task_struct *p, struct sched_domain *sd, bool has_idle_core, int target)
6688 struct cpumask *cpus = this_cpu_cpumask_var_ptr(select_rq_mask);
6689 int i, cpu, idle_cpu = -1, nr = INT_MAX;
6690 struct sched_domain_shared *sd_share;
6691 struct rq *this_rq = this_rq();
6692 int this = smp_processor_id();
6693 struct sched_domain *this_sd = NULL;
6696 cpumask_and(cpus, sched_domain_span(sd), p->cpus_ptr);
6698 if (sched_feat(SIS_PROP) && !has_idle_core) {
6699 u64 avg_cost, avg_idle, span_avg;
6700 unsigned long now = jiffies;
6702 this_sd = rcu_dereference(*this_cpu_ptr(&sd_llc));
6707 * If we're busy, the assumption that the last idle period
6708 * predicts the future is flawed; age away the remaining
6709 * predicted idle time.
6711 if (unlikely(this_rq->wake_stamp < now)) {
6712 while (this_rq->wake_stamp < now && this_rq->wake_avg_idle) {
6713 this_rq->wake_stamp++;
6714 this_rq->wake_avg_idle >>= 1;
6718 avg_idle = this_rq->wake_avg_idle;
6719 avg_cost = this_sd->avg_scan_cost + 1;
6721 span_avg = sd->span_weight * avg_idle;
6722 if (span_avg > 4*avg_cost)
6723 nr = div_u64(span_avg, avg_cost);
6727 time = cpu_clock(this);
6730 if (sched_feat(SIS_UTIL)) {
6731 sd_share = rcu_dereference(per_cpu(sd_llc_shared, target));
6733 /* because !--nr is the condition to stop scan */
6734 nr = READ_ONCE(sd_share->nr_idle_scan) + 1;
6735 /* overloaded LLC is unlikely to have idle cpu/core */
6741 for_each_cpu_wrap(cpu, cpus, target + 1) {
6742 if (has_idle_core) {
6743 i = select_idle_core(p, cpu, cpus, &idle_cpu);
6744 if ((unsigned int)i < nr_cpumask_bits)
6750 idle_cpu = __select_idle_cpu(cpu, p);
6751 if ((unsigned int)idle_cpu < nr_cpumask_bits)
6757 set_idle_cores(target, false);
6759 if (sched_feat(SIS_PROP) && this_sd && !has_idle_core) {
6760 time = cpu_clock(this) - time;
6763 * Account for the scan cost of wakeups against the average
6766 this_rq->wake_avg_idle -= min(this_rq->wake_avg_idle, time);
6768 update_avg(&this_sd->avg_scan_cost, time);
6775 * Scan the asym_capacity domain for idle CPUs; pick the first idle one on which
6776 * the task fits. If no CPU is big enough, but there are idle ones, try to
6777 * maximize capacity.
6780 select_idle_capacity(struct task_struct *p, struct sched_domain *sd, int target)
6782 unsigned long task_util, best_cap = 0;
6783 int cpu, best_cpu = -1;
6784 struct cpumask *cpus;
6786 cpus = this_cpu_cpumask_var_ptr(select_rq_mask);
6787 cpumask_and(cpus, sched_domain_span(sd), p->cpus_ptr);
6789 task_util = uclamp_task_util(p);
6791 for_each_cpu_wrap(cpu, cpus, target) {
6792 unsigned long cpu_cap = capacity_of(cpu);
6794 if (!available_idle_cpu(cpu) && !sched_idle_cpu(cpu))
6796 if (fits_capacity(task_util, cpu_cap))
6799 if (cpu_cap > best_cap) {
6808 static inline bool asym_fits_capacity(unsigned long task_util, int cpu)
6810 if (sched_asym_cpucap_active())
6811 return fits_capacity(task_util, capacity_of(cpu));
6817 * Try and locate an idle core/thread in the LLC cache domain.
6819 static int select_idle_sibling(struct task_struct *p, int prev, int target)
6821 bool has_idle_core = false;
6822 struct sched_domain *sd;
6823 unsigned long task_util;
6824 int i, recent_used_cpu;
6827 * On asymmetric system, update task utilization because we will check
6828 * that the task fits with cpu's capacity.
6830 if (sched_asym_cpucap_active()) {
6831 sync_entity_load_avg(&p->se);
6832 task_util = uclamp_task_util(p);
6836 * per-cpu select_rq_mask usage
6838 lockdep_assert_irqs_disabled();
6840 if ((available_idle_cpu(target) || sched_idle_cpu(target)) &&
6841 asym_fits_capacity(task_util, target))
6845 * If the previous CPU is cache affine and idle, don't be stupid:
6847 if (prev != target && cpus_share_cache(prev, target) &&
6848 (available_idle_cpu(prev) || sched_idle_cpu(prev)) &&
6849 asym_fits_capacity(task_util, prev))
6853 * Allow a per-cpu kthread to stack with the wakee if the
6854 * kworker thread and the tasks previous CPUs are the same.
6855 * The assumption is that the wakee queued work for the
6856 * per-cpu kthread that is now complete and the wakeup is
6857 * essentially a sync wakeup. An obvious example of this
6858 * pattern is IO completions.
6860 if (is_per_cpu_kthread(current) &&
6862 prev == smp_processor_id() &&
6863 this_rq()->nr_running <= 1 &&
6864 asym_fits_capacity(task_util, prev)) {
6868 /* Check a recently used CPU as a potential idle candidate: */
6869 recent_used_cpu = p->recent_used_cpu;
6870 p->recent_used_cpu = prev;
6871 if (recent_used_cpu != prev &&
6872 recent_used_cpu != target &&
6873 cpus_share_cache(recent_used_cpu, target) &&
6874 (available_idle_cpu(recent_used_cpu) || sched_idle_cpu(recent_used_cpu)) &&
6875 cpumask_test_cpu(p->recent_used_cpu, p->cpus_ptr) &&
6876 asym_fits_capacity(task_util, recent_used_cpu)) {
6877 return recent_used_cpu;
6881 * For asymmetric CPU capacity systems, our domain of interest is
6882 * sd_asym_cpucapacity rather than sd_llc.
6884 if (sched_asym_cpucap_active()) {
6885 sd = rcu_dereference(per_cpu(sd_asym_cpucapacity, target));
6887 * On an asymmetric CPU capacity system where an exclusive
6888 * cpuset defines a symmetric island (i.e. one unique
6889 * capacity_orig value through the cpuset), the key will be set
6890 * but the CPUs within that cpuset will not have a domain with
6891 * SD_ASYM_CPUCAPACITY. These should follow the usual symmetric
6895 i = select_idle_capacity(p, sd, target);
6896 return ((unsigned)i < nr_cpumask_bits) ? i : target;
6900 sd = rcu_dereference(per_cpu(sd_llc, target));
6904 if (sched_smt_active()) {
6905 has_idle_core = test_idle_cores(target);
6907 if (!has_idle_core && cpus_share_cache(prev, target)) {
6908 i = select_idle_smt(p, prev);
6909 if ((unsigned int)i < nr_cpumask_bits)
6914 i = select_idle_cpu(p, sd, has_idle_core, target);
6915 if ((unsigned)i < nr_cpumask_bits)
6922 * Predicts what cpu_util(@cpu) would return if @p was removed from @cpu
6923 * (@dst_cpu = -1) or migrated to @dst_cpu.
6925 static unsigned long cpu_util_next(int cpu, struct task_struct *p, int dst_cpu)
6927 struct cfs_rq *cfs_rq = &cpu_rq(cpu)->cfs;
6928 unsigned long util = READ_ONCE(cfs_rq->avg.util_avg);
6931 * If @dst_cpu is -1 or @p migrates from @cpu to @dst_cpu remove its
6932 * contribution. If @p migrates from another CPU to @cpu add its
6933 * contribution. In all the other cases @cpu is not impacted by the
6934 * migration so its util_avg is already correct.
6936 if (task_cpu(p) == cpu && dst_cpu != cpu)
6937 lsub_positive(&util, task_util(p));
6938 else if (task_cpu(p) != cpu && dst_cpu == cpu)
6939 util += task_util(p);
6941 if (sched_feat(UTIL_EST)) {
6942 unsigned long util_est;
6944 util_est = READ_ONCE(cfs_rq->avg.util_est.enqueued);
6947 * During wake-up @p isn't enqueued yet and doesn't contribute
6948 * to any cpu_rq(cpu)->cfs.avg.util_est.enqueued.
6949 * If @dst_cpu == @cpu add it to "simulate" cpu_util after @p
6950 * has been enqueued.
6952 * During exec (@dst_cpu = -1) @p is enqueued and does
6953 * contribute to cpu_rq(cpu)->cfs.util_est.enqueued.
6954 * Remove it to "simulate" cpu_util without @p's contribution.
6956 * Despite the task_on_rq_queued(@p) check there is still a
6957 * small window for a possible race when an exec
6958 * select_task_rq_fair() races with LB's detach_task().
6962 * p->on_rq = TASK_ON_RQ_MIGRATING;
6963 * -------------------------------- A
6965 * dequeue_task_fair() + Race Time
6966 * util_est_dequeue() /
6967 * -------------------------------- B
6969 * The additional check "current == p" is required to further
6970 * reduce the race window.
6973 util_est += _task_util_est(p);
6974 else if (unlikely(task_on_rq_queued(p) || current == p))
6975 lsub_positive(&util_est, _task_util_est(p));
6977 util = max(util, util_est);
6980 return min(util, capacity_orig_of(cpu));
6984 * cpu_util_without: compute cpu utilization without any contributions from *p
6985 * @cpu: the CPU which utilization is requested
6986 * @p: the task which utilization should be discounted
6988 * The utilization of a CPU is defined by the utilization of tasks currently
6989 * enqueued on that CPU as well as tasks which are currently sleeping after an
6990 * execution on that CPU.
6992 * This method returns the utilization of the specified CPU by discounting the
6993 * utilization of the specified task, whenever the task is currently
6994 * contributing to the CPU utilization.
6996 static unsigned long cpu_util_without(int cpu, struct task_struct *p)
6998 /* Task has no contribution or is new */
6999 if (cpu != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time))
7000 return cpu_util_cfs(cpu);
7002 return cpu_util_next(cpu, p, -1);
7006 * energy_env - Utilization landscape for energy estimation.
7007 * @task_busy_time: Utilization contribution by the task for which we test the
7008 * placement. Given by eenv_task_busy_time().
7009 * @pd_busy_time: Utilization of the whole perf domain without the task
7010 * contribution. Given by eenv_pd_busy_time().
7011 * @cpu_cap: Maximum CPU capacity for the perf domain.
7012 * @pd_cap: Entire perf domain capacity. (pd->nr_cpus * cpu_cap).
7015 unsigned long task_busy_time;
7016 unsigned long pd_busy_time;
7017 unsigned long cpu_cap;
7018 unsigned long pd_cap;
7022 * Compute the task busy time for compute_energy(). This time cannot be
7023 * injected directly into effective_cpu_util() because of the IRQ scaling.
7024 * The latter only makes sense with the most recent CPUs where the task has
7027 static inline void eenv_task_busy_time(struct energy_env *eenv,
7028 struct task_struct *p, int prev_cpu)
7030 unsigned long busy_time, max_cap = arch_scale_cpu_capacity(prev_cpu);
7031 unsigned long irq = cpu_util_irq(cpu_rq(prev_cpu));
7033 if (unlikely(irq >= max_cap))
7034 busy_time = max_cap;
7036 busy_time = scale_irq_capacity(task_util_est(p), irq, max_cap);
7038 eenv->task_busy_time = busy_time;
7042 * Compute the perf_domain (PD) busy time for compute_energy(). Based on the
7043 * utilization for each @pd_cpus, it however doesn't take into account
7044 * clamping since the ratio (utilization / cpu_capacity) is already enough to
7045 * scale the EM reported power consumption at the (eventually clamped)
7048 * The contribution of the task @p for which we want to estimate the
7049 * energy cost is removed (by cpu_util_next()) and must be calculated
7050 * separately (see eenv_task_busy_time). This ensures:
7052 * - A stable PD utilization, no matter which CPU of that PD we want to place
7055 * - A fair comparison between CPUs as the task contribution (task_util())
7056 * will always be the same no matter which CPU utilization we rely on
7057 * (util_avg or util_est).
7059 * Set @eenv busy time for the PD that spans @pd_cpus. This busy time can't
7060 * exceed @eenv->pd_cap.
7062 static inline void eenv_pd_busy_time(struct energy_env *eenv,
7063 struct cpumask *pd_cpus,
7064 struct task_struct *p)
7066 unsigned long busy_time = 0;
7069 for_each_cpu(cpu, pd_cpus) {
7070 unsigned long util = cpu_util_next(cpu, p, -1);
7072 busy_time += effective_cpu_util(cpu, util, ENERGY_UTIL, NULL);
7075 eenv->pd_busy_time = min(eenv->pd_cap, busy_time);
7079 * Compute the maximum utilization for compute_energy() when the task @p
7080 * is placed on the cpu @dst_cpu.
7082 * Returns the maximum utilization among @eenv->cpus. This utilization can't
7083 * exceed @eenv->cpu_cap.
7085 static inline unsigned long
7086 eenv_pd_max_util(struct energy_env *eenv, struct cpumask *pd_cpus,
7087 struct task_struct *p, int dst_cpu)
7089 unsigned long max_util = 0;
7092 for_each_cpu(cpu, pd_cpus) {
7093 struct task_struct *tsk = (cpu == dst_cpu) ? p : NULL;
7094 unsigned long util = cpu_util_next(cpu, p, dst_cpu);
7095 unsigned long cpu_util;
7098 * Performance domain frequency: utilization clamping
7099 * must be considered since it affects the selection
7100 * of the performance domain frequency.
7101 * NOTE: in case RT tasks are running, by default the
7102 * FREQUENCY_UTIL's utilization can be max OPP.
7104 cpu_util = effective_cpu_util(cpu, util, FREQUENCY_UTIL, tsk);
7105 max_util = max(max_util, cpu_util);
7108 return min(max_util, eenv->cpu_cap);
7112 * compute_energy(): Use the Energy Model to estimate the energy that @pd would
7113 * consume for a given utilization landscape @eenv. When @dst_cpu < 0, the task
7114 * contribution is ignored.
7116 static inline unsigned long
7117 compute_energy(struct energy_env *eenv, struct perf_domain *pd,
7118 struct cpumask *pd_cpus, struct task_struct *p, int dst_cpu)
7120 unsigned long max_util = eenv_pd_max_util(eenv, pd_cpus, p, dst_cpu);
7121 unsigned long busy_time = eenv->pd_busy_time;
7124 busy_time = min(eenv->pd_cap, busy_time + eenv->task_busy_time);
7126 return em_cpu_energy(pd->em_pd, max_util, busy_time, eenv->cpu_cap);
7130 * find_energy_efficient_cpu(): Find most energy-efficient target CPU for the
7131 * waking task. find_energy_efficient_cpu() looks for the CPU with maximum
7132 * spare capacity in each performance domain and uses it as a potential
7133 * candidate to execute the task. Then, it uses the Energy Model to figure
7134 * out which of the CPU candidates is the most energy-efficient.
7136 * The rationale for this heuristic is as follows. In a performance domain,
7137 * all the most energy efficient CPU candidates (according to the Energy
7138 * Model) are those for which we'll request a low frequency. When there are
7139 * several CPUs for which the frequency request will be the same, we don't
7140 * have enough data to break the tie between them, because the Energy Model
7141 * only includes active power costs. With this model, if we assume that
7142 * frequency requests follow utilization (e.g. using schedutil), the CPU with
7143 * the maximum spare capacity in a performance domain is guaranteed to be among
7144 * the best candidates of the performance domain.
7146 * In practice, it could be preferable from an energy standpoint to pack
7147 * small tasks on a CPU in order to let other CPUs go in deeper idle states,
7148 * but that could also hurt our chances to go cluster idle, and we have no
7149 * ways to tell with the current Energy Model if this is actually a good
7150 * idea or not. So, find_energy_efficient_cpu() basically favors
7151 * cluster-packing, and spreading inside a cluster. That should at least be
7152 * a good thing for latency, and this is consistent with the idea that most
7153 * of the energy savings of EAS come from the asymmetry of the system, and
7154 * not so much from breaking the tie between identical CPUs. That's also the
7155 * reason why EAS is enabled in the topology code only for systems where
7156 * SD_ASYM_CPUCAPACITY is set.
7158 * NOTE: Forkees are not accepted in the energy-aware wake-up path because
7159 * they don't have any useful utilization data yet and it's not possible to
7160 * forecast their impact on energy consumption. Consequently, they will be
7161 * placed by find_idlest_cpu() on the least loaded CPU, which might turn out
7162 * to be energy-inefficient in some use-cases. The alternative would be to
7163 * bias new tasks towards specific types of CPUs first, or to try to infer
7164 * their util_avg from the parent task, but those heuristics could hurt
7165 * other use-cases too. So, until someone finds a better way to solve this,
7166 * let's keep things simple by re-using the existing slow path.
7168 static int find_energy_efficient_cpu(struct task_struct *p, int prev_cpu)
7170 struct cpumask *cpus = this_cpu_cpumask_var_ptr(select_rq_mask);
7171 unsigned long prev_delta = ULONG_MAX, best_delta = ULONG_MAX;
7172 struct root_domain *rd = this_rq()->rd;
7173 int cpu, best_energy_cpu, target = -1;
7174 struct sched_domain *sd;
7175 struct perf_domain *pd;
7176 struct energy_env eenv;
7179 pd = rcu_dereference(rd->pd);
7180 if (!pd || READ_ONCE(rd->overutilized))
7184 * Energy-aware wake-up happens on the lowest sched_domain starting
7185 * from sd_asym_cpucapacity spanning over this_cpu and prev_cpu.
7187 sd = rcu_dereference(*this_cpu_ptr(&sd_asym_cpucapacity));
7188 while (sd && !cpumask_test_cpu(prev_cpu, sched_domain_span(sd)))
7195 sync_entity_load_avg(&p->se);
7196 if (!task_util_est(p))
7199 eenv_task_busy_time(&eenv, p, prev_cpu);
7201 for (; pd; pd = pd->next) {
7202 unsigned long cpu_cap, cpu_thermal_cap, util;
7203 unsigned long cur_delta, max_spare_cap = 0;
7204 bool compute_prev_delta = false;
7205 int max_spare_cap_cpu = -1;
7206 unsigned long base_energy;
7208 cpumask_and(cpus, perf_domain_span(pd), cpu_online_mask);
7210 if (cpumask_empty(cpus))
7213 /* Account thermal pressure for the energy estimation */
7214 cpu = cpumask_first(cpus);
7215 cpu_thermal_cap = arch_scale_cpu_capacity(cpu);
7216 cpu_thermal_cap -= arch_scale_thermal_pressure(cpu);
7218 eenv.cpu_cap = cpu_thermal_cap;
7221 for_each_cpu(cpu, cpus) {
7222 eenv.pd_cap += cpu_thermal_cap;
7224 if (!cpumask_test_cpu(cpu, sched_domain_span(sd)))
7227 if (!cpumask_test_cpu(cpu, p->cpus_ptr))
7230 util = cpu_util_next(cpu, p, cpu);
7231 cpu_cap = capacity_of(cpu);
7234 * Skip CPUs that cannot satisfy the capacity request.
7235 * IOW, placing the task there would make the CPU
7236 * overutilized. Take uclamp into account to see how
7237 * much capacity we can get out of the CPU; this is
7238 * aligned with sched_cpu_util().
7240 util = uclamp_rq_util_with(cpu_rq(cpu), util, p);
7241 if (!fits_capacity(util, cpu_cap))
7244 lsub_positive(&cpu_cap, util);
7246 if (cpu == prev_cpu) {
7247 /* Always use prev_cpu as a candidate. */
7248 compute_prev_delta = true;
7249 } else if (cpu_cap > max_spare_cap) {
7251 * Find the CPU with the maximum spare capacity
7252 * in the performance domain.
7254 max_spare_cap = cpu_cap;
7255 max_spare_cap_cpu = cpu;
7259 if (max_spare_cap_cpu < 0 && !compute_prev_delta)
7262 eenv_pd_busy_time(&eenv, cpus, p);
7263 /* Compute the 'base' energy of the pd, without @p */
7264 base_energy = compute_energy(&eenv, pd, cpus, p, -1);
7266 /* Evaluate the energy impact of using prev_cpu. */
7267 if (compute_prev_delta) {
7268 prev_delta = compute_energy(&eenv, pd, cpus, p,
7270 /* CPU utilization has changed */
7271 if (prev_delta < base_energy)
7273 prev_delta -= base_energy;
7274 best_delta = min(best_delta, prev_delta);
7277 /* Evaluate the energy impact of using max_spare_cap_cpu. */
7278 if (max_spare_cap_cpu >= 0) {
7279 cur_delta = compute_energy(&eenv, pd, cpus, p,
7281 /* CPU utilization has changed */
7282 if (cur_delta < base_energy)
7284 cur_delta -= base_energy;
7285 if (cur_delta < best_delta) {
7286 best_delta = cur_delta;
7287 best_energy_cpu = max_spare_cap_cpu;
7293 if (best_delta < prev_delta)
7294 target = best_energy_cpu;
7305 * select_task_rq_fair: Select target runqueue for the waking task in domains
7306 * that have the relevant SD flag set. In practice, this is SD_BALANCE_WAKE,
7307 * SD_BALANCE_FORK, or SD_BALANCE_EXEC.
7309 * Balances load by selecting the idlest CPU in the idlest group, or under
7310 * certain conditions an idle sibling CPU if the domain has SD_WAKE_AFFINE set.
7312 * Returns the target CPU number.
7315 select_task_rq_fair(struct task_struct *p, int prev_cpu, int wake_flags)
7317 int sync = (wake_flags & WF_SYNC) && !(current->flags & PF_EXITING);
7318 struct sched_domain *tmp, *sd = NULL;
7319 int cpu = smp_processor_id();
7320 int new_cpu = prev_cpu;
7321 int want_affine = 0;
7322 /* SD_flags and WF_flags share the first nibble */
7323 int sd_flag = wake_flags & 0xF;
7326 * required for stable ->cpus_allowed
7328 lockdep_assert_held(&p->pi_lock);
7329 if (wake_flags & WF_TTWU) {
7332 if (sched_energy_enabled()) {
7333 new_cpu = find_energy_efficient_cpu(p, prev_cpu);
7339 want_affine = !wake_wide(p) && cpumask_test_cpu(cpu, p->cpus_ptr);
7343 for_each_domain(cpu, tmp) {
7345 * If both 'cpu' and 'prev_cpu' are part of this domain,
7346 * cpu is a valid SD_WAKE_AFFINE target.
7348 if (want_affine && (tmp->flags & SD_WAKE_AFFINE) &&
7349 cpumask_test_cpu(prev_cpu, sched_domain_span(tmp))) {
7350 if (cpu != prev_cpu)
7351 new_cpu = wake_affine(tmp, p, cpu, prev_cpu, sync);
7353 sd = NULL; /* Prefer wake_affine over balance flags */
7358 * Usually only true for WF_EXEC and WF_FORK, as sched_domains
7359 * usually do not have SD_BALANCE_WAKE set. That means wakeup
7360 * will usually go to the fast path.
7362 if (tmp->flags & sd_flag)
7364 else if (!want_affine)
7370 new_cpu = find_idlest_cpu(sd, p, cpu, prev_cpu, sd_flag);
7371 } else if (wake_flags & WF_TTWU) { /* XXX always ? */
7373 new_cpu = select_idle_sibling(p, prev_cpu, new_cpu);
7381 * Called immediately before a task is migrated to a new CPU; task_cpu(p) and
7382 * cfs_rq_of(p) references at time of call are still valid and identify the
7383 * previous CPU. The caller guarantees p->pi_lock or task_rq(p)->lock is held.
7385 static void migrate_task_rq_fair(struct task_struct *p, int new_cpu)
7387 struct sched_entity *se = &p->se;
7390 * As blocked tasks retain absolute vruntime the migration needs to
7391 * deal with this by subtracting the old and adding the new
7392 * min_vruntime -- the latter is done by enqueue_entity() when placing
7393 * the task on the new runqueue.
7395 if (READ_ONCE(p->__state) == TASK_WAKING) {
7396 struct cfs_rq *cfs_rq = cfs_rq_of(se);
7398 se->vruntime -= u64_u32_load(cfs_rq->min_vruntime);
7401 if (!task_on_rq_migrating(p)) {
7402 remove_entity_load_avg(se);
7405 * Here, the task's PELT values have been updated according to
7406 * the current rq's clock. But if that clock hasn't been
7407 * updated in a while, a substantial idle time will be missed,
7408 * leading to an inflation after wake-up on the new rq.
7410 * Estimate the missing time from the cfs_rq last_update_time
7411 * and update sched_avg to improve the PELT continuity after
7414 migrate_se_pelt_lag(se);
7417 /* Tell new CPU we are migrated */
7418 se->avg.last_update_time = 0;
7420 /* We have migrated, no longer consider this task hot */
7423 update_scan_period(p, new_cpu);
7426 static void task_dead_fair(struct task_struct *p)
7428 remove_entity_load_avg(&p->se);
7432 balance_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
7437 return newidle_balance(rq, rf) != 0;
7439 #endif /* CONFIG_SMP */
7441 static unsigned long wakeup_gran(struct sched_entity *se)
7443 unsigned long gran = sysctl_sched_wakeup_granularity;
7446 * Since its curr running now, convert the gran from real-time
7447 * to virtual-time in his units.
7449 * By using 'se' instead of 'curr' we penalize light tasks, so
7450 * they get preempted easier. That is, if 'se' < 'curr' then
7451 * the resulting gran will be larger, therefore penalizing the
7452 * lighter, if otoh 'se' > 'curr' then the resulting gran will
7453 * be smaller, again penalizing the lighter task.
7455 * This is especially important for buddies when the leftmost
7456 * task is higher priority than the buddy.
7458 return calc_delta_fair(gran, se);
7462 * Should 'se' preempt 'curr'.
7476 wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se)
7478 s64 gran, vdiff = curr->vruntime - se->vruntime;
7483 gran = wakeup_gran(se);
7490 static void set_last_buddy(struct sched_entity *se)
7492 for_each_sched_entity(se) {
7493 if (SCHED_WARN_ON(!se->on_rq))
7497 cfs_rq_of(se)->last = se;
7501 static void set_next_buddy(struct sched_entity *se)
7503 for_each_sched_entity(se) {
7504 if (SCHED_WARN_ON(!se->on_rq))
7508 cfs_rq_of(se)->next = se;
7512 static void set_skip_buddy(struct sched_entity *se)
7514 for_each_sched_entity(se)
7515 cfs_rq_of(se)->skip = se;
7519 * Preempt the current task with a newly woken task if needed:
7521 static void check_preempt_wakeup(struct rq *rq, struct task_struct *p, int wake_flags)
7523 struct task_struct *curr = rq->curr;
7524 struct sched_entity *se = &curr->se, *pse = &p->se;
7525 struct cfs_rq *cfs_rq = task_cfs_rq(curr);
7526 int scale = cfs_rq->nr_running >= sched_nr_latency;
7527 int next_buddy_marked = 0;
7528 int cse_is_idle, pse_is_idle;
7530 if (unlikely(se == pse))
7534 * This is possible from callers such as attach_tasks(), in which we
7535 * unconditionally check_preempt_curr() after an enqueue (which may have
7536 * lead to a throttle). This both saves work and prevents false
7537 * next-buddy nomination below.
7539 if (unlikely(throttled_hierarchy(cfs_rq_of(pse))))
7542 if (sched_feat(NEXT_BUDDY) && scale && !(wake_flags & WF_FORK)) {
7543 set_next_buddy(pse);
7544 next_buddy_marked = 1;
7548 * We can come here with TIF_NEED_RESCHED already set from new task
7551 * Note: this also catches the edge-case of curr being in a throttled
7552 * group (e.g. via set_curr_task), since update_curr() (in the
7553 * enqueue of curr) will have resulted in resched being set. This
7554 * prevents us from potentially nominating it as a false LAST_BUDDY
7557 if (test_tsk_need_resched(curr))
7560 /* Idle tasks are by definition preempted by non-idle tasks. */
7561 if (unlikely(task_has_idle_policy(curr)) &&
7562 likely(!task_has_idle_policy(p)))
7566 * Batch and idle tasks do not preempt non-idle tasks (their preemption
7567 * is driven by the tick):
7569 if (unlikely(p->policy != SCHED_NORMAL) || !sched_feat(WAKEUP_PREEMPTION))
7572 find_matching_se(&se, &pse);
7575 cse_is_idle = se_is_idle(se);
7576 pse_is_idle = se_is_idle(pse);
7579 * Preempt an idle group in favor of a non-idle group (and don't preempt
7580 * in the inverse case).
7582 if (cse_is_idle && !pse_is_idle)
7584 if (cse_is_idle != pse_is_idle)
7587 update_curr(cfs_rq_of(se));
7588 if (wakeup_preempt_entity(se, pse) == 1) {
7590 * Bias pick_next to pick the sched entity that is
7591 * triggering this preemption.
7593 if (!next_buddy_marked)
7594 set_next_buddy(pse);
7603 * Only set the backward buddy when the current task is still
7604 * on the rq. This can happen when a wakeup gets interleaved
7605 * with schedule on the ->pre_schedule() or idle_balance()
7606 * point, either of which can * drop the rq lock.
7608 * Also, during early boot the idle thread is in the fair class,
7609 * for obvious reasons its a bad idea to schedule back to it.
7611 if (unlikely(!se->on_rq || curr == rq->idle))
7614 if (sched_feat(LAST_BUDDY) && scale && entity_is_task(se))
7619 static struct task_struct *pick_task_fair(struct rq *rq)
7621 struct sched_entity *se;
7622 struct cfs_rq *cfs_rq;
7626 if (!cfs_rq->nr_running)
7630 struct sched_entity *curr = cfs_rq->curr;
7632 /* When we pick for a remote RQ, we'll not have done put_prev_entity() */
7635 update_curr(cfs_rq);
7639 if (unlikely(check_cfs_rq_runtime(cfs_rq)))
7643 se = pick_next_entity(cfs_rq, curr);
7644 cfs_rq = group_cfs_rq(se);
7651 struct task_struct *
7652 pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
7654 struct cfs_rq *cfs_rq = &rq->cfs;
7655 struct sched_entity *se;
7656 struct task_struct *p;
7660 if (!sched_fair_runnable(rq))
7663 #ifdef CONFIG_FAIR_GROUP_SCHED
7664 if (!prev || prev->sched_class != &fair_sched_class)
7668 * Because of the set_next_buddy() in dequeue_task_fair() it is rather
7669 * likely that a next task is from the same cgroup as the current.
7671 * Therefore attempt to avoid putting and setting the entire cgroup
7672 * hierarchy, only change the part that actually changes.
7676 struct sched_entity *curr = cfs_rq->curr;
7679 * Since we got here without doing put_prev_entity() we also
7680 * have to consider cfs_rq->curr. If it is still a runnable
7681 * entity, update_curr() will update its vruntime, otherwise
7682 * forget we've ever seen it.
7686 update_curr(cfs_rq);
7691 * This call to check_cfs_rq_runtime() will do the
7692 * throttle and dequeue its entity in the parent(s).
7693 * Therefore the nr_running test will indeed
7696 if (unlikely(check_cfs_rq_runtime(cfs_rq))) {
7699 if (!cfs_rq->nr_running)
7706 se = pick_next_entity(cfs_rq, curr);
7707 cfs_rq = group_cfs_rq(se);
7713 * Since we haven't yet done put_prev_entity and if the selected task
7714 * is a different task than we started out with, try and touch the
7715 * least amount of cfs_rqs.
7718 struct sched_entity *pse = &prev->se;
7720 while (!(cfs_rq = is_same_group(se, pse))) {
7721 int se_depth = se->depth;
7722 int pse_depth = pse->depth;
7724 if (se_depth <= pse_depth) {
7725 put_prev_entity(cfs_rq_of(pse), pse);
7726 pse = parent_entity(pse);
7728 if (se_depth >= pse_depth) {
7729 set_next_entity(cfs_rq_of(se), se);
7730 se = parent_entity(se);
7734 put_prev_entity(cfs_rq, pse);
7735 set_next_entity(cfs_rq, se);
7742 put_prev_task(rq, prev);
7745 se = pick_next_entity(cfs_rq, NULL);
7746 set_next_entity(cfs_rq, se);
7747 cfs_rq = group_cfs_rq(se);
7752 done: __maybe_unused;
7755 * Move the next running task to the front of
7756 * the list, so our cfs_tasks list becomes MRU
7759 list_move(&p->se.group_node, &rq->cfs_tasks);
7762 if (hrtick_enabled_fair(rq))
7763 hrtick_start_fair(rq, p);
7765 update_misfit_status(p, rq);
7773 new_tasks = newidle_balance(rq, rf);
7776 * Because newidle_balance() releases (and re-acquires) rq->lock, it is
7777 * possible for any higher priority task to appear. In that case we
7778 * must re-start the pick_next_entity() loop.
7787 * rq is about to be idle, check if we need to update the
7788 * lost_idle_time of clock_pelt
7790 update_idle_rq_clock_pelt(rq);
7795 static struct task_struct *__pick_next_task_fair(struct rq *rq)
7797 return pick_next_task_fair(rq, NULL, NULL);
7801 * Account for a descheduled task:
7803 static void put_prev_task_fair(struct rq *rq, struct task_struct *prev)
7805 struct sched_entity *se = &prev->se;
7806 struct cfs_rq *cfs_rq;
7808 for_each_sched_entity(se) {
7809 cfs_rq = cfs_rq_of(se);
7810 put_prev_entity(cfs_rq, se);
7815 * sched_yield() is very simple
7817 * The magic of dealing with the ->skip buddy is in pick_next_entity.
7819 static void yield_task_fair(struct rq *rq)
7821 struct task_struct *curr = rq->curr;
7822 struct cfs_rq *cfs_rq = task_cfs_rq(curr);
7823 struct sched_entity *se = &curr->se;
7826 * Are we the only task in the tree?
7828 if (unlikely(rq->nr_running == 1))
7831 clear_buddies(cfs_rq, se);
7833 if (curr->policy != SCHED_BATCH) {
7834 update_rq_clock(rq);
7836 * Update run-time statistics of the 'current'.
7838 update_curr(cfs_rq);
7840 * Tell update_rq_clock() that we've just updated,
7841 * so we don't do microscopic update in schedule()
7842 * and double the fastpath cost.
7844 rq_clock_skip_update(rq);
7850 static bool yield_to_task_fair(struct rq *rq, struct task_struct *p)
7852 struct sched_entity *se = &p->se;
7854 /* throttled hierarchies are not runnable */
7855 if (!se->on_rq || throttled_hierarchy(cfs_rq_of(se)))
7858 /* Tell the scheduler that we'd really like pse to run next. */
7861 yield_task_fair(rq);
7867 /**************************************************
7868 * Fair scheduling class load-balancing methods.
7872 * The purpose of load-balancing is to achieve the same basic fairness the
7873 * per-CPU scheduler provides, namely provide a proportional amount of compute
7874 * time to each task. This is expressed in the following equation:
7876 * W_i,n/P_i == W_j,n/P_j for all i,j (1)
7878 * Where W_i,n is the n-th weight average for CPU i. The instantaneous weight
7879 * W_i,0 is defined as:
7881 * W_i,0 = \Sum_j w_i,j (2)
7883 * Where w_i,j is the weight of the j-th runnable task on CPU i. This weight
7884 * is derived from the nice value as per sched_prio_to_weight[].
7886 * The weight average is an exponential decay average of the instantaneous
7889 * W'_i,n = (2^n - 1) / 2^n * W_i,n + 1 / 2^n * W_i,0 (3)
7891 * C_i is the compute capacity of CPU i, typically it is the
7892 * fraction of 'recent' time available for SCHED_OTHER task execution. But it
7893 * can also include other factors [XXX].
7895 * To achieve this balance we define a measure of imbalance which follows
7896 * directly from (1):
7898 * imb_i,j = max{ avg(W/C), W_i/C_i } - min{ avg(W/C), W_j/C_j } (4)
7900 * We them move tasks around to minimize the imbalance. In the continuous
7901 * function space it is obvious this converges, in the discrete case we get
7902 * a few fun cases generally called infeasible weight scenarios.
7905 * - infeasible weights;
7906 * - local vs global optima in the discrete case. ]
7911 * In order to solve the imbalance equation (4), and avoid the obvious O(n^2)
7912 * for all i,j solution, we create a tree of CPUs that follows the hardware
7913 * topology where each level pairs two lower groups (or better). This results
7914 * in O(log n) layers. Furthermore we reduce the number of CPUs going up the
7915 * tree to only the first of the previous level and we decrease the frequency
7916 * of load-balance at each level inv. proportional to the number of CPUs in
7922 * \Sum { --- * --- * 2^i } = O(n) (5)
7924 * `- size of each group
7925 * | | `- number of CPUs doing load-balance
7927 * `- sum over all levels
7929 * Coupled with a limit on how many tasks we can migrate every balance pass,
7930 * this makes (5) the runtime complexity of the balancer.
7932 * An important property here is that each CPU is still (indirectly) connected
7933 * to every other CPU in at most O(log n) steps:
7935 * The adjacency matrix of the resulting graph is given by:
7938 * A_i,j = \Union (i % 2^k == 0) && i / 2^(k+1) == j / 2^(k+1) (6)
7941 * And you'll find that:
7943 * A^(log_2 n)_i,j != 0 for all i,j (7)
7945 * Showing there's indeed a path between every CPU in at most O(log n) steps.
7946 * The task movement gives a factor of O(m), giving a convergence complexity
7949 * O(nm log n), n := nr_cpus, m := nr_tasks (8)
7954 * In order to avoid CPUs going idle while there's still work to do, new idle
7955 * balancing is more aggressive and has the newly idle CPU iterate up the domain
7956 * tree itself instead of relying on other CPUs to bring it work.
7958 * This adds some complexity to both (5) and (8) but it reduces the total idle
7966 * Cgroups make a horror show out of (2), instead of a simple sum we get:
7969 * W_i,0 = \Sum_j \Prod_k w_k * ----- (9)
7974 * s_k,i = \Sum_j w_i,j,k and S_k = \Sum_i s_k,i (10)
7976 * w_i,j,k is the weight of the j-th runnable task in the k-th cgroup on CPU i.
7978 * The big problem is S_k, its a global sum needed to compute a local (W_i)
7981 * [XXX write more on how we solve this.. _after_ merging pjt's patches that
7982 * rewrite all of this once again.]
7985 static unsigned long __read_mostly max_load_balance_interval = HZ/10;
7987 enum fbq_type { regular, remote, all };
7990 * 'group_type' describes the group of CPUs at the moment of load balancing.
7992 * The enum is ordered by pulling priority, with the group with lowest priority
7993 * first so the group_type can simply be compared when selecting the busiest
7994 * group. See update_sd_pick_busiest().
7997 /* The group has spare capacity that can be used to run more tasks. */
7998 group_has_spare = 0,
8000 * The group is fully used and the tasks don't compete for more CPU
8001 * cycles. Nevertheless, some tasks might wait before running.
8005 * One task doesn't fit with CPU's capacity and must be migrated to a
8006 * more powerful CPU.
8010 * SD_ASYM_PACKING only: One local CPU with higher capacity is available,
8011 * and the task should be migrated to it instead of running on the
8016 * The tasks' affinity constraints previously prevented the scheduler
8017 * from balancing the load across the system.
8021 * The CPU is overloaded and can't provide expected CPU cycles to all
8027 enum migration_type {
8034 #define LBF_ALL_PINNED 0x01
8035 #define LBF_NEED_BREAK 0x02
8036 #define LBF_DST_PINNED 0x04
8037 #define LBF_SOME_PINNED 0x08
8038 #define LBF_ACTIVE_LB 0x10
8041 struct sched_domain *sd;
8049 struct cpumask *dst_grpmask;
8051 enum cpu_idle_type idle;
8053 /* The set of CPUs under consideration for load-balancing */
8054 struct cpumask *cpus;
8059 unsigned int loop_break;
8060 unsigned int loop_max;
8062 enum fbq_type fbq_type;
8063 enum migration_type migration_type;
8064 struct list_head tasks;
8068 * Is this task likely cache-hot:
8070 static int task_hot(struct task_struct *p, struct lb_env *env)
8074 lockdep_assert_rq_held(env->src_rq);
8076 if (p->sched_class != &fair_sched_class)
8079 if (unlikely(task_has_idle_policy(p)))
8082 /* SMT siblings share cache */
8083 if (env->sd->flags & SD_SHARE_CPUCAPACITY)
8087 * Buddy candidates are cache hot:
8089 if (sched_feat(CACHE_HOT_BUDDY) && env->dst_rq->nr_running &&
8090 (&p->se == cfs_rq_of(&p->se)->next ||
8091 &p->se == cfs_rq_of(&p->se)->last))
8094 if (sysctl_sched_migration_cost == -1)
8098 * Don't migrate task if the task's cookie does not match
8099 * with the destination CPU's core cookie.
8101 if (!sched_core_cookie_match(cpu_rq(env->dst_cpu), p))
8104 if (sysctl_sched_migration_cost == 0)
8107 delta = rq_clock_task(env->src_rq) - p->se.exec_start;
8109 return delta < (s64)sysctl_sched_migration_cost;
8112 #ifdef CONFIG_NUMA_BALANCING
8114 * Returns 1, if task migration degrades locality
8115 * Returns 0, if task migration improves locality i.e migration preferred.
8116 * Returns -1, if task migration is not affected by locality.
8118 static int migrate_degrades_locality(struct task_struct *p, struct lb_env *env)
8120 struct numa_group *numa_group = rcu_dereference(p->numa_group);
8121 unsigned long src_weight, dst_weight;
8122 int src_nid, dst_nid, dist;
8124 if (!static_branch_likely(&sched_numa_balancing))
8127 if (!p->numa_faults || !(env->sd->flags & SD_NUMA))
8130 src_nid = cpu_to_node(env->src_cpu);
8131 dst_nid = cpu_to_node(env->dst_cpu);
8133 if (src_nid == dst_nid)
8136 /* Migrating away from the preferred node is always bad. */
8137 if (src_nid == p->numa_preferred_nid) {
8138 if (env->src_rq->nr_running > env->src_rq->nr_preferred_running)
8144 /* Encourage migration to the preferred node. */
8145 if (dst_nid == p->numa_preferred_nid)
8148 /* Leaving a core idle is often worse than degrading locality. */
8149 if (env->idle == CPU_IDLE)
8152 dist = node_distance(src_nid, dst_nid);
8154 src_weight = group_weight(p, src_nid, dist);
8155 dst_weight = group_weight(p, dst_nid, dist);
8157 src_weight = task_weight(p, src_nid, dist);
8158 dst_weight = task_weight(p, dst_nid, dist);
8161 return dst_weight < src_weight;
8165 static inline int migrate_degrades_locality(struct task_struct *p,
8173 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
8176 int can_migrate_task(struct task_struct *p, struct lb_env *env)
8180 lockdep_assert_rq_held(env->src_rq);
8183 * We do not migrate tasks that are:
8184 * 1) throttled_lb_pair, or
8185 * 2) cannot be migrated to this CPU due to cpus_ptr, or
8186 * 3) running (obviously), or
8187 * 4) are cache-hot on their current CPU.
8189 if (throttled_lb_pair(task_group(p), env->src_cpu, env->dst_cpu))
8192 /* Disregard pcpu kthreads; they are where they need to be. */
8193 if (kthread_is_per_cpu(p))
8196 if (!cpumask_test_cpu(env->dst_cpu, p->cpus_ptr)) {
8199 schedstat_inc(p->stats.nr_failed_migrations_affine);
8201 env->flags |= LBF_SOME_PINNED;
8204 * Remember if this task can be migrated to any other CPU in
8205 * our sched_group. We may want to revisit it if we couldn't
8206 * meet load balance goals by pulling other tasks on src_cpu.
8208 * Avoid computing new_dst_cpu
8210 * - if we have already computed one in current iteration
8211 * - if it's an active balance
8213 if (env->idle == CPU_NEWLY_IDLE ||
8214 env->flags & (LBF_DST_PINNED | LBF_ACTIVE_LB))
8217 /* Prevent to re-select dst_cpu via env's CPUs: */
8218 for_each_cpu_and(cpu, env->dst_grpmask, env->cpus) {
8219 if (cpumask_test_cpu(cpu, p->cpus_ptr)) {
8220 env->flags |= LBF_DST_PINNED;
8221 env->new_dst_cpu = cpu;
8229 /* Record that we found at least one task that could run on dst_cpu */
8230 env->flags &= ~LBF_ALL_PINNED;
8232 if (task_on_cpu(env->src_rq, p)) {
8233 schedstat_inc(p->stats.nr_failed_migrations_running);
8238 * Aggressive migration if:
8240 * 2) destination numa is preferred
8241 * 3) task is cache cold, or
8242 * 4) too many balance attempts have failed.
8244 if (env->flags & LBF_ACTIVE_LB)
8247 tsk_cache_hot = migrate_degrades_locality(p, env);
8248 if (tsk_cache_hot == -1)
8249 tsk_cache_hot = task_hot(p, env);
8251 if (tsk_cache_hot <= 0 ||
8252 env->sd->nr_balance_failed > env->sd->cache_nice_tries) {
8253 if (tsk_cache_hot == 1) {
8254 schedstat_inc(env->sd->lb_hot_gained[env->idle]);
8255 schedstat_inc(p->stats.nr_forced_migrations);
8260 schedstat_inc(p->stats.nr_failed_migrations_hot);
8265 * detach_task() -- detach the task for the migration specified in env
8267 static void detach_task(struct task_struct *p, struct lb_env *env)
8269 lockdep_assert_rq_held(env->src_rq);
8271 deactivate_task(env->src_rq, p, DEQUEUE_NOCLOCK);
8272 set_task_cpu(p, env->dst_cpu);
8276 * detach_one_task() -- tries to dequeue exactly one task from env->src_rq, as
8277 * part of active balancing operations within "domain".
8279 * Returns a task if successful and NULL otherwise.
8281 static struct task_struct *detach_one_task(struct lb_env *env)
8283 struct task_struct *p;
8285 lockdep_assert_rq_held(env->src_rq);
8287 list_for_each_entry_reverse(p,
8288 &env->src_rq->cfs_tasks, se.group_node) {
8289 if (!can_migrate_task(p, env))
8292 detach_task(p, env);
8295 * Right now, this is only the second place where
8296 * lb_gained[env->idle] is updated (other is detach_tasks)
8297 * so we can safely collect stats here rather than
8298 * inside detach_tasks().
8300 schedstat_inc(env->sd->lb_gained[env->idle]);
8307 * detach_tasks() -- tries to detach up to imbalance load/util/tasks from
8308 * busiest_rq, as part of a balancing operation within domain "sd".
8310 * Returns number of detached tasks if successful and 0 otherwise.
8312 static int detach_tasks(struct lb_env *env)
8314 struct list_head *tasks = &env->src_rq->cfs_tasks;
8315 unsigned long util, load;
8316 struct task_struct *p;
8319 lockdep_assert_rq_held(env->src_rq);
8322 * Source run queue has been emptied by another CPU, clear
8323 * LBF_ALL_PINNED flag as we will not test any task.
8325 if (env->src_rq->nr_running <= 1) {
8326 env->flags &= ~LBF_ALL_PINNED;
8330 if (env->imbalance <= 0)
8333 while (!list_empty(tasks)) {
8335 * We don't want to steal all, otherwise we may be treated likewise,
8336 * which could at worst lead to a livelock crash.
8338 if (env->idle != CPU_NOT_IDLE && env->src_rq->nr_running <= 1)
8343 * We've more or less seen every task there is, call it quits
8344 * unless we haven't found any movable task yet.
8346 if (env->loop > env->loop_max &&
8347 !(env->flags & LBF_ALL_PINNED))
8350 /* take a breather every nr_migrate tasks */
8351 if (env->loop > env->loop_break) {
8352 env->loop_break += SCHED_NR_MIGRATE_BREAK;
8353 env->flags |= LBF_NEED_BREAK;
8357 p = list_last_entry(tasks, struct task_struct, se.group_node);
8359 if (!can_migrate_task(p, env))
8362 switch (env->migration_type) {
8365 * Depending of the number of CPUs and tasks and the
8366 * cgroup hierarchy, task_h_load() can return a null
8367 * value. Make sure that env->imbalance decreases
8368 * otherwise detach_tasks() will stop only after
8369 * detaching up to loop_max tasks.
8371 load = max_t(unsigned long, task_h_load(p), 1);
8373 if (sched_feat(LB_MIN) &&
8374 load < 16 && !env->sd->nr_balance_failed)
8378 * Make sure that we don't migrate too much load.
8379 * Nevertheless, let relax the constraint if
8380 * scheduler fails to find a good waiting task to
8383 if (shr_bound(load, env->sd->nr_balance_failed) > env->imbalance)
8386 env->imbalance -= load;
8390 util = task_util_est(p);
8392 if (util > env->imbalance)
8395 env->imbalance -= util;
8402 case migrate_misfit:
8403 /* This is not a misfit task */
8404 if (task_fits_cpu(p, env->src_cpu))
8411 detach_task(p, env);
8412 list_add(&p->se.group_node, &env->tasks);
8416 #ifdef CONFIG_PREEMPTION
8418 * NEWIDLE balancing is a source of latency, so preemptible
8419 * kernels will stop after the first task is detached to minimize
8420 * the critical section.
8422 if (env->idle == CPU_NEWLY_IDLE)
8427 * We only want to steal up to the prescribed amount of
8430 if (env->imbalance <= 0)
8435 list_move(&p->se.group_node, tasks);
8439 * Right now, this is one of only two places we collect this stat
8440 * so we can safely collect detach_one_task() stats here rather
8441 * than inside detach_one_task().
8443 schedstat_add(env->sd->lb_gained[env->idle], detached);
8449 * attach_task() -- attach the task detached by detach_task() to its new rq.
8451 static void attach_task(struct rq *rq, struct task_struct *p)
8453 lockdep_assert_rq_held(rq);
8455 WARN_ON_ONCE(task_rq(p) != rq);
8456 activate_task(rq, p, ENQUEUE_NOCLOCK);
8457 check_preempt_curr(rq, p, 0);
8461 * attach_one_task() -- attaches the task returned from detach_one_task() to
8464 static void attach_one_task(struct rq *rq, struct task_struct *p)
8469 update_rq_clock(rq);
8475 * attach_tasks() -- attaches all tasks detached by detach_tasks() to their
8478 static void attach_tasks(struct lb_env *env)
8480 struct list_head *tasks = &env->tasks;
8481 struct task_struct *p;
8484 rq_lock(env->dst_rq, &rf);
8485 update_rq_clock(env->dst_rq);
8487 while (!list_empty(tasks)) {
8488 p = list_first_entry(tasks, struct task_struct, se.group_node);
8489 list_del_init(&p->se.group_node);
8491 attach_task(env->dst_rq, p);
8494 rq_unlock(env->dst_rq, &rf);
8497 #ifdef CONFIG_NO_HZ_COMMON
8498 static inline bool cfs_rq_has_blocked(struct cfs_rq *cfs_rq)
8500 if (cfs_rq->avg.load_avg)
8503 if (cfs_rq->avg.util_avg)
8509 static inline bool others_have_blocked(struct rq *rq)
8511 if (READ_ONCE(rq->avg_rt.util_avg))
8514 if (READ_ONCE(rq->avg_dl.util_avg))
8517 if (thermal_load_avg(rq))
8520 #ifdef CONFIG_HAVE_SCHED_AVG_IRQ
8521 if (READ_ONCE(rq->avg_irq.util_avg))
8528 static inline void update_blocked_load_tick(struct rq *rq)
8530 WRITE_ONCE(rq->last_blocked_load_update_tick, jiffies);
8533 static inline void update_blocked_load_status(struct rq *rq, bool has_blocked)
8536 rq->has_blocked_load = 0;
8539 static inline bool cfs_rq_has_blocked(struct cfs_rq *cfs_rq) { return false; }
8540 static inline bool others_have_blocked(struct rq *rq) { return false; }
8541 static inline void update_blocked_load_tick(struct rq *rq) {}
8542 static inline void update_blocked_load_status(struct rq *rq, bool has_blocked) {}
8545 static bool __update_blocked_others(struct rq *rq, bool *done)
8547 const struct sched_class *curr_class;
8548 u64 now = rq_clock_pelt(rq);
8549 unsigned long thermal_pressure;
8553 * update_load_avg() can call cpufreq_update_util(). Make sure that RT,
8554 * DL and IRQ signals have been updated before updating CFS.
8556 curr_class = rq->curr->sched_class;
8558 thermal_pressure = arch_scale_thermal_pressure(cpu_of(rq));
8560 decayed = update_rt_rq_load_avg(now, rq, curr_class == &rt_sched_class) |
8561 update_dl_rq_load_avg(now, rq, curr_class == &dl_sched_class) |
8562 update_thermal_load_avg(rq_clock_thermal(rq), rq, thermal_pressure) |
8563 update_irq_load_avg(rq, 0);
8565 if (others_have_blocked(rq))
8571 #ifdef CONFIG_FAIR_GROUP_SCHED
8573 static bool __update_blocked_fair(struct rq *rq, bool *done)
8575 struct cfs_rq *cfs_rq, *pos;
8576 bool decayed = false;
8577 int cpu = cpu_of(rq);
8580 * Iterates the task_group tree in a bottom up fashion, see
8581 * list_add_leaf_cfs_rq() for details.
8583 for_each_leaf_cfs_rq_safe(rq, cfs_rq, pos) {
8584 struct sched_entity *se;
8586 if (update_cfs_rq_load_avg(cfs_rq_clock_pelt(cfs_rq), cfs_rq)) {
8587 update_tg_load_avg(cfs_rq);
8589 if (cfs_rq->nr_running == 0)
8590 update_idle_cfs_rq_clock_pelt(cfs_rq);
8592 if (cfs_rq == &rq->cfs)
8596 /* Propagate pending load changes to the parent, if any: */
8597 se = cfs_rq->tg->se[cpu];
8598 if (se && !skip_blocked_update(se))
8599 update_load_avg(cfs_rq_of(se), se, UPDATE_TG);
8602 * There can be a lot of idle CPU cgroups. Don't let fully
8603 * decayed cfs_rqs linger on the list.
8605 if (cfs_rq_is_decayed(cfs_rq))
8606 list_del_leaf_cfs_rq(cfs_rq);
8608 /* Don't need periodic decay once load/util_avg are null */
8609 if (cfs_rq_has_blocked(cfs_rq))
8617 * Compute the hierarchical load factor for cfs_rq and all its ascendants.
8618 * This needs to be done in a top-down fashion because the load of a child
8619 * group is a fraction of its parents load.
8621 static void update_cfs_rq_h_load(struct cfs_rq *cfs_rq)
8623 struct rq *rq = rq_of(cfs_rq);
8624 struct sched_entity *se = cfs_rq->tg->se[cpu_of(rq)];
8625 unsigned long now = jiffies;
8628 if (cfs_rq->last_h_load_update == now)
8631 WRITE_ONCE(cfs_rq->h_load_next, NULL);
8632 for_each_sched_entity(se) {
8633 cfs_rq = cfs_rq_of(se);
8634 WRITE_ONCE(cfs_rq->h_load_next, se);
8635 if (cfs_rq->last_h_load_update == now)
8640 cfs_rq->h_load = cfs_rq_load_avg(cfs_rq);
8641 cfs_rq->last_h_load_update = now;
8644 while ((se = READ_ONCE(cfs_rq->h_load_next)) != NULL) {
8645 load = cfs_rq->h_load;
8646 load = div64_ul(load * se->avg.load_avg,
8647 cfs_rq_load_avg(cfs_rq) + 1);
8648 cfs_rq = group_cfs_rq(se);
8649 cfs_rq->h_load = load;
8650 cfs_rq->last_h_load_update = now;
8654 static unsigned long task_h_load(struct task_struct *p)
8656 struct cfs_rq *cfs_rq = task_cfs_rq(p);
8658 update_cfs_rq_h_load(cfs_rq);
8659 return div64_ul(p->se.avg.load_avg * cfs_rq->h_load,
8660 cfs_rq_load_avg(cfs_rq) + 1);
8663 static bool __update_blocked_fair(struct rq *rq, bool *done)
8665 struct cfs_rq *cfs_rq = &rq->cfs;
8668 decayed = update_cfs_rq_load_avg(cfs_rq_clock_pelt(cfs_rq), cfs_rq);
8669 if (cfs_rq_has_blocked(cfs_rq))
8675 static unsigned long task_h_load(struct task_struct *p)
8677 return p->se.avg.load_avg;
8681 static void update_blocked_averages(int cpu)
8683 bool decayed = false, done = true;
8684 struct rq *rq = cpu_rq(cpu);
8687 rq_lock_irqsave(rq, &rf);
8688 update_blocked_load_tick(rq);
8689 update_rq_clock(rq);
8691 decayed |= __update_blocked_others(rq, &done);
8692 decayed |= __update_blocked_fair(rq, &done);
8694 update_blocked_load_status(rq, !done);
8696 cpufreq_update_util(rq, 0);
8697 rq_unlock_irqrestore(rq, &rf);
8700 /********** Helpers for find_busiest_group ************************/
8703 * sg_lb_stats - stats of a sched_group required for load_balancing
8705 struct sg_lb_stats {
8706 unsigned long avg_load; /*Avg load across the CPUs of the group */
8707 unsigned long group_load; /* Total load over the CPUs of the group */
8708 unsigned long group_capacity;
8709 unsigned long group_util; /* Total utilization over the CPUs of the group */
8710 unsigned long group_runnable; /* Total runnable time over the CPUs of the group */
8711 unsigned int sum_nr_running; /* Nr of tasks running in the group */
8712 unsigned int sum_h_nr_running; /* Nr of CFS tasks running in the group */
8713 unsigned int idle_cpus;
8714 unsigned int group_weight;
8715 enum group_type group_type;
8716 unsigned int group_asym_packing; /* Tasks should be moved to preferred CPU */
8717 unsigned long group_misfit_task_load; /* A CPU has a task too big for its capacity */
8718 #ifdef CONFIG_NUMA_BALANCING
8719 unsigned int nr_numa_running;
8720 unsigned int nr_preferred_running;
8725 * sd_lb_stats - Structure to store the statistics of a sched_domain
8726 * during load balancing.
8728 struct sd_lb_stats {
8729 struct sched_group *busiest; /* Busiest group in this sd */
8730 struct sched_group *local; /* Local group in this sd */
8731 unsigned long total_load; /* Total load of all groups in sd */
8732 unsigned long total_capacity; /* Total capacity of all groups in sd */
8733 unsigned long avg_load; /* Average load across all groups in sd */
8734 unsigned int prefer_sibling; /* tasks should go to sibling first */
8736 struct sg_lb_stats busiest_stat;/* Statistics of the busiest group */
8737 struct sg_lb_stats local_stat; /* Statistics of the local group */
8740 static inline void init_sd_lb_stats(struct sd_lb_stats *sds)
8743 * Skimp on the clearing to avoid duplicate work. We can avoid clearing
8744 * local_stat because update_sg_lb_stats() does a full clear/assignment.
8745 * We must however set busiest_stat::group_type and
8746 * busiest_stat::idle_cpus to the worst busiest group because
8747 * update_sd_pick_busiest() reads these before assignment.
8749 *sds = (struct sd_lb_stats){
8753 .total_capacity = 0UL,
8755 .idle_cpus = UINT_MAX,
8756 .group_type = group_has_spare,
8761 static unsigned long scale_rt_capacity(int cpu)
8763 struct rq *rq = cpu_rq(cpu);
8764 unsigned long max = arch_scale_cpu_capacity(cpu);
8765 unsigned long used, free;
8768 irq = cpu_util_irq(rq);
8770 if (unlikely(irq >= max))
8774 * avg_rt.util_avg and avg_dl.util_avg track binary signals
8775 * (running and not running) with weights 0 and 1024 respectively.
8776 * avg_thermal.load_avg tracks thermal pressure and the weighted
8777 * average uses the actual delta max capacity(load).
8779 used = READ_ONCE(rq->avg_rt.util_avg);
8780 used += READ_ONCE(rq->avg_dl.util_avg);
8781 used += thermal_load_avg(rq);
8783 if (unlikely(used >= max))
8788 return scale_irq_capacity(free, irq, max);
8791 static void update_cpu_capacity(struct sched_domain *sd, int cpu)
8793 unsigned long capacity = scale_rt_capacity(cpu);
8794 struct sched_group *sdg = sd->groups;
8796 cpu_rq(cpu)->cpu_capacity_orig = arch_scale_cpu_capacity(cpu);
8801 cpu_rq(cpu)->cpu_capacity = capacity;
8802 trace_sched_cpu_capacity_tp(cpu_rq(cpu));
8804 sdg->sgc->capacity = capacity;
8805 sdg->sgc->min_capacity = capacity;
8806 sdg->sgc->max_capacity = capacity;
8809 void update_group_capacity(struct sched_domain *sd, int cpu)
8811 struct sched_domain *child = sd->child;
8812 struct sched_group *group, *sdg = sd->groups;
8813 unsigned long capacity, min_capacity, max_capacity;
8814 unsigned long interval;
8816 interval = msecs_to_jiffies(sd->balance_interval);
8817 interval = clamp(interval, 1UL, max_load_balance_interval);
8818 sdg->sgc->next_update = jiffies + interval;
8821 update_cpu_capacity(sd, cpu);
8826 min_capacity = ULONG_MAX;
8829 if (child->flags & SD_OVERLAP) {
8831 * SD_OVERLAP domains cannot assume that child groups
8832 * span the current group.
8835 for_each_cpu(cpu, sched_group_span(sdg)) {
8836 unsigned long cpu_cap = capacity_of(cpu);
8838 capacity += cpu_cap;
8839 min_capacity = min(cpu_cap, min_capacity);
8840 max_capacity = max(cpu_cap, max_capacity);
8844 * !SD_OVERLAP domains can assume that child groups
8845 * span the current group.
8848 group = child->groups;
8850 struct sched_group_capacity *sgc = group->sgc;
8852 capacity += sgc->capacity;
8853 min_capacity = min(sgc->min_capacity, min_capacity);
8854 max_capacity = max(sgc->max_capacity, max_capacity);
8855 group = group->next;
8856 } while (group != child->groups);
8859 sdg->sgc->capacity = capacity;
8860 sdg->sgc->min_capacity = min_capacity;
8861 sdg->sgc->max_capacity = max_capacity;
8865 * Check whether the capacity of the rq has been noticeably reduced by side
8866 * activity. The imbalance_pct is used for the threshold.
8867 * Return true is the capacity is reduced
8870 check_cpu_capacity(struct rq *rq, struct sched_domain *sd)
8872 return ((rq->cpu_capacity * sd->imbalance_pct) <
8873 (rq->cpu_capacity_orig * 100));
8877 * Check whether a rq has a misfit task and if it looks like we can actually
8878 * help that task: we can migrate the task to a CPU of higher capacity, or
8879 * the task's current CPU is heavily pressured.
8881 static inline int check_misfit_status(struct rq *rq, struct sched_domain *sd)
8883 return rq->misfit_task_load &&
8884 (rq->cpu_capacity_orig < rq->rd->max_cpu_capacity ||
8885 check_cpu_capacity(rq, sd));
8889 * Group imbalance indicates (and tries to solve) the problem where balancing
8890 * groups is inadequate due to ->cpus_ptr constraints.
8892 * Imagine a situation of two groups of 4 CPUs each and 4 tasks each with a
8893 * cpumask covering 1 CPU of the first group and 3 CPUs of the second group.
8896 * { 0 1 2 3 } { 4 5 6 7 }
8899 * If we were to balance group-wise we'd place two tasks in the first group and
8900 * two tasks in the second group. Clearly this is undesired as it will overload
8901 * cpu 3 and leave one of the CPUs in the second group unused.
8903 * The current solution to this issue is detecting the skew in the first group
8904 * by noticing the lower domain failed to reach balance and had difficulty
8905 * moving tasks due to affinity constraints.
8907 * When this is so detected; this group becomes a candidate for busiest; see
8908 * update_sd_pick_busiest(). And calculate_imbalance() and
8909 * find_busiest_group() avoid some of the usual balance conditions to allow it
8910 * to create an effective group imbalance.
8912 * This is a somewhat tricky proposition since the next run might not find the
8913 * group imbalance and decide the groups need to be balanced again. A most
8914 * subtle and fragile situation.
8917 static inline int sg_imbalanced(struct sched_group *group)
8919 return group->sgc->imbalance;
8923 * group_has_capacity returns true if the group has spare capacity that could
8924 * be used by some tasks.
8925 * We consider that a group has spare capacity if the number of task is
8926 * smaller than the number of CPUs or if the utilization is lower than the
8927 * available capacity for CFS tasks.
8928 * For the latter, we use a threshold to stabilize the state, to take into
8929 * account the variance of the tasks' load and to return true if the available
8930 * capacity in meaningful for the load balancer.
8931 * As an example, an available capacity of 1% can appear but it doesn't make
8932 * any benefit for the load balance.
8935 group_has_capacity(unsigned int imbalance_pct, struct sg_lb_stats *sgs)
8937 if (sgs->sum_nr_running < sgs->group_weight)
8940 if ((sgs->group_capacity * imbalance_pct) <
8941 (sgs->group_runnable * 100))
8944 if ((sgs->group_capacity * 100) >
8945 (sgs->group_util * imbalance_pct))
8952 * group_is_overloaded returns true if the group has more tasks than it can
8954 * group_is_overloaded is not equals to !group_has_capacity because a group
8955 * with the exact right number of tasks, has no more spare capacity but is not
8956 * overloaded so both group_has_capacity and group_is_overloaded return
8960 group_is_overloaded(unsigned int imbalance_pct, struct sg_lb_stats *sgs)
8962 if (sgs->sum_nr_running <= sgs->group_weight)
8965 if ((sgs->group_capacity * 100) <
8966 (sgs->group_util * imbalance_pct))
8969 if ((sgs->group_capacity * imbalance_pct) <
8970 (sgs->group_runnable * 100))
8977 group_type group_classify(unsigned int imbalance_pct,
8978 struct sched_group *group,
8979 struct sg_lb_stats *sgs)
8981 if (group_is_overloaded(imbalance_pct, sgs))
8982 return group_overloaded;
8984 if (sg_imbalanced(group))
8985 return group_imbalanced;
8987 if (sgs->group_asym_packing)
8988 return group_asym_packing;
8990 if (sgs->group_misfit_task_load)
8991 return group_misfit_task;
8993 if (!group_has_capacity(imbalance_pct, sgs))
8994 return group_fully_busy;
8996 return group_has_spare;
9000 * asym_smt_can_pull_tasks - Check whether the load balancing CPU can pull tasks
9001 * @dst_cpu: Destination CPU of the load balancing
9002 * @sds: Load-balancing data with statistics of the local group
9003 * @sgs: Load-balancing statistics of the candidate busiest group
9004 * @sg: The candidate busiest group
9006 * Check the state of the SMT siblings of both @sds::local and @sg and decide
9007 * if @dst_cpu can pull tasks.
9009 * If @dst_cpu does not have SMT siblings, it can pull tasks if two or more of
9010 * the SMT siblings of @sg are busy. If only one CPU in @sg is busy, pull tasks
9011 * only if @dst_cpu has higher priority.
9013 * If both @dst_cpu and @sg have SMT siblings, and @sg has exactly one more
9014 * busy CPU than @sds::local, let @dst_cpu pull tasks if it has higher priority.
9015 * Bigger imbalances in the number of busy CPUs will be dealt with in
9016 * update_sd_pick_busiest().
9018 * If @sg does not have SMT siblings, only pull tasks if all of the SMT siblings
9019 * of @dst_cpu are idle and @sg has lower priority.
9021 * Return: true if @dst_cpu can pull tasks, false otherwise.
9023 static bool asym_smt_can_pull_tasks(int dst_cpu, struct sd_lb_stats *sds,
9024 struct sg_lb_stats *sgs,
9025 struct sched_group *sg)
9027 #ifdef CONFIG_SCHED_SMT
9028 bool local_is_smt, sg_is_smt;
9031 local_is_smt = sds->local->flags & SD_SHARE_CPUCAPACITY;
9032 sg_is_smt = sg->flags & SD_SHARE_CPUCAPACITY;
9034 sg_busy_cpus = sgs->group_weight - sgs->idle_cpus;
9036 if (!local_is_smt) {
9038 * If we are here, @dst_cpu is idle and does not have SMT
9039 * siblings. Pull tasks if candidate group has two or more
9042 if (sg_busy_cpus >= 2) /* implies sg_is_smt */
9046 * @dst_cpu does not have SMT siblings. @sg may have SMT
9047 * siblings and only one is busy. In such case, @dst_cpu
9048 * can help if it has higher priority and is idle (i.e.,
9049 * it has no running tasks).
9051 return sched_asym_prefer(dst_cpu, sg->asym_prefer_cpu);
9054 /* @dst_cpu has SMT siblings. */
9057 int local_busy_cpus = sds->local->group_weight -
9058 sds->local_stat.idle_cpus;
9059 int busy_cpus_delta = sg_busy_cpus - local_busy_cpus;
9061 if (busy_cpus_delta == 1)
9062 return sched_asym_prefer(dst_cpu, sg->asym_prefer_cpu);
9068 * @sg does not have SMT siblings. Ensure that @sds::local does not end
9069 * up with more than one busy SMT sibling and only pull tasks if there
9070 * are not busy CPUs (i.e., no CPU has running tasks).
9072 if (!sds->local_stat.sum_nr_running)
9073 return sched_asym_prefer(dst_cpu, sg->asym_prefer_cpu);
9077 /* Always return false so that callers deal with non-SMT cases. */
9083 sched_asym(struct lb_env *env, struct sd_lb_stats *sds, struct sg_lb_stats *sgs,
9084 struct sched_group *group)
9086 /* Only do SMT checks if either local or candidate have SMT siblings */
9087 if ((sds->local->flags & SD_SHARE_CPUCAPACITY) ||
9088 (group->flags & SD_SHARE_CPUCAPACITY))
9089 return asym_smt_can_pull_tasks(env->dst_cpu, sds, sgs, group);
9091 return sched_asym_prefer(env->dst_cpu, group->asym_prefer_cpu);
9095 sched_reduced_capacity(struct rq *rq, struct sched_domain *sd)
9098 * When there is more than 1 task, the group_overloaded case already
9099 * takes care of cpu with reduced capacity
9101 if (rq->cfs.h_nr_running != 1)
9104 return check_cpu_capacity(rq, sd);
9108 * update_sg_lb_stats - Update sched_group's statistics for load balancing.
9109 * @env: The load balancing environment.
9110 * @sds: Load-balancing data with statistics of the local group.
9111 * @group: sched_group whose statistics are to be updated.
9112 * @sgs: variable to hold the statistics for this group.
9113 * @sg_status: Holds flag indicating the status of the sched_group
9115 static inline void update_sg_lb_stats(struct lb_env *env,
9116 struct sd_lb_stats *sds,
9117 struct sched_group *group,
9118 struct sg_lb_stats *sgs,
9121 int i, nr_running, local_group;
9123 memset(sgs, 0, sizeof(*sgs));
9125 local_group = group == sds->local;
9127 for_each_cpu_and(i, sched_group_span(group), env->cpus) {
9128 struct rq *rq = cpu_rq(i);
9129 unsigned long load = cpu_load(rq);
9131 sgs->group_load += load;
9132 sgs->group_util += cpu_util_cfs(i);
9133 sgs->group_runnable += cpu_runnable(rq);
9134 sgs->sum_h_nr_running += rq->cfs.h_nr_running;
9136 nr_running = rq->nr_running;
9137 sgs->sum_nr_running += nr_running;
9140 *sg_status |= SG_OVERLOAD;
9142 if (cpu_overutilized(i))
9143 *sg_status |= SG_OVERUTILIZED;
9145 #ifdef CONFIG_NUMA_BALANCING
9146 sgs->nr_numa_running += rq->nr_numa_running;
9147 sgs->nr_preferred_running += rq->nr_preferred_running;
9150 * No need to call idle_cpu() if nr_running is not 0
9152 if (!nr_running && idle_cpu(i)) {
9154 /* Idle cpu can't have misfit task */
9161 if (env->sd->flags & SD_ASYM_CPUCAPACITY) {
9162 /* Check for a misfit task on the cpu */
9163 if (sgs->group_misfit_task_load < rq->misfit_task_load) {
9164 sgs->group_misfit_task_load = rq->misfit_task_load;
9165 *sg_status |= SG_OVERLOAD;
9167 } else if ((env->idle != CPU_NOT_IDLE) &&
9168 sched_reduced_capacity(rq, env->sd)) {
9169 /* Check for a task running on a CPU with reduced capacity */
9170 if (sgs->group_misfit_task_load < load)
9171 sgs->group_misfit_task_load = load;
9175 sgs->group_capacity = group->sgc->capacity;
9177 sgs->group_weight = group->group_weight;
9179 /* Check if dst CPU is idle and preferred to this group */
9180 if (!local_group && env->sd->flags & SD_ASYM_PACKING &&
9181 env->idle != CPU_NOT_IDLE && sgs->sum_h_nr_running &&
9182 sched_asym(env, sds, sgs, group)) {
9183 sgs->group_asym_packing = 1;
9186 sgs->group_type = group_classify(env->sd->imbalance_pct, group, sgs);
9188 /* Computing avg_load makes sense only when group is overloaded */
9189 if (sgs->group_type == group_overloaded)
9190 sgs->avg_load = (sgs->group_load * SCHED_CAPACITY_SCALE) /
9191 sgs->group_capacity;
9195 * update_sd_pick_busiest - return 1 on busiest group
9196 * @env: The load balancing environment.
9197 * @sds: sched_domain statistics
9198 * @sg: sched_group candidate to be checked for being the busiest
9199 * @sgs: sched_group statistics
9201 * Determine if @sg is a busier group than the previously selected
9204 * Return: %true if @sg is a busier group than the previously selected
9205 * busiest group. %false otherwise.
9207 static bool update_sd_pick_busiest(struct lb_env *env,
9208 struct sd_lb_stats *sds,
9209 struct sched_group *sg,
9210 struct sg_lb_stats *sgs)
9212 struct sg_lb_stats *busiest = &sds->busiest_stat;
9214 /* Make sure that there is at least one task to pull */
9215 if (!sgs->sum_h_nr_running)
9219 * Don't try to pull misfit tasks we can't help.
9220 * We can use max_capacity here as reduction in capacity on some
9221 * CPUs in the group should either be possible to resolve
9222 * internally or be covered by avg_load imbalance (eventually).
9224 if ((env->sd->flags & SD_ASYM_CPUCAPACITY) &&
9225 (sgs->group_type == group_misfit_task) &&
9226 (!capacity_greater(capacity_of(env->dst_cpu), sg->sgc->max_capacity) ||
9227 sds->local_stat.group_type != group_has_spare))
9230 if (sgs->group_type > busiest->group_type)
9233 if (sgs->group_type < busiest->group_type)
9237 * The candidate and the current busiest group are the same type of
9238 * group. Let check which one is the busiest according to the type.
9241 switch (sgs->group_type) {
9242 case group_overloaded:
9243 /* Select the overloaded group with highest avg_load. */
9244 if (sgs->avg_load <= busiest->avg_load)
9248 case group_imbalanced:
9250 * Select the 1st imbalanced group as we don't have any way to
9251 * choose one more than another.
9255 case group_asym_packing:
9256 /* Prefer to move from lowest priority CPU's work */
9257 if (sched_asym_prefer(sg->asym_prefer_cpu, sds->busiest->asym_prefer_cpu))
9261 case group_misfit_task:
9263 * If we have more than one misfit sg go with the biggest
9266 if (sgs->group_misfit_task_load < busiest->group_misfit_task_load)
9270 case group_fully_busy:
9272 * Select the fully busy group with highest avg_load. In
9273 * theory, there is no need to pull task from such kind of
9274 * group because tasks have all compute capacity that they need
9275 * but we can still improve the overall throughput by reducing
9276 * contention when accessing shared HW resources.
9278 * XXX for now avg_load is not computed and always 0 so we
9279 * select the 1st one.
9281 if (sgs->avg_load <= busiest->avg_load)
9285 case group_has_spare:
9287 * Select not overloaded group with lowest number of idle cpus
9288 * and highest number of running tasks. We could also compare
9289 * the spare capacity which is more stable but it can end up
9290 * that the group has less spare capacity but finally more idle
9291 * CPUs which means less opportunity to pull tasks.
9293 if (sgs->idle_cpus > busiest->idle_cpus)
9295 else if ((sgs->idle_cpus == busiest->idle_cpus) &&
9296 (sgs->sum_nr_running <= busiest->sum_nr_running))
9303 * Candidate sg has no more than one task per CPU and has higher
9304 * per-CPU capacity. Migrating tasks to less capable CPUs may harm
9305 * throughput. Maximize throughput, power/energy consequences are not
9308 if ((env->sd->flags & SD_ASYM_CPUCAPACITY) &&
9309 (sgs->group_type <= group_fully_busy) &&
9310 (capacity_greater(sg->sgc->min_capacity, capacity_of(env->dst_cpu))))
9316 #ifdef CONFIG_NUMA_BALANCING
9317 static inline enum fbq_type fbq_classify_group(struct sg_lb_stats *sgs)
9319 if (sgs->sum_h_nr_running > sgs->nr_numa_running)
9321 if (sgs->sum_h_nr_running > sgs->nr_preferred_running)
9326 static inline enum fbq_type fbq_classify_rq(struct rq *rq)
9328 if (rq->nr_running > rq->nr_numa_running)
9330 if (rq->nr_running > rq->nr_preferred_running)
9335 static inline enum fbq_type fbq_classify_group(struct sg_lb_stats *sgs)
9340 static inline enum fbq_type fbq_classify_rq(struct rq *rq)
9344 #endif /* CONFIG_NUMA_BALANCING */
9350 * task_running_on_cpu - return 1 if @p is running on @cpu.
9353 static unsigned int task_running_on_cpu(int cpu, struct task_struct *p)
9355 /* Task has no contribution or is new */
9356 if (cpu != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time))
9359 if (task_on_rq_queued(p))
9366 * idle_cpu_without - would a given CPU be idle without p ?
9367 * @cpu: the processor on which idleness is tested.
9368 * @p: task which should be ignored.
9370 * Return: 1 if the CPU would be idle. 0 otherwise.
9372 static int idle_cpu_without(int cpu, struct task_struct *p)
9374 struct rq *rq = cpu_rq(cpu);
9376 if (rq->curr != rq->idle && rq->curr != p)
9380 * rq->nr_running can't be used but an updated version without the
9381 * impact of p on cpu must be used instead. The updated nr_running
9382 * be computed and tested before calling idle_cpu_without().
9386 if (rq->ttwu_pending)
9394 * update_sg_wakeup_stats - Update sched_group's statistics for wakeup.
9395 * @sd: The sched_domain level to look for idlest group.
9396 * @group: sched_group whose statistics are to be updated.
9397 * @sgs: variable to hold the statistics for this group.
9398 * @p: The task for which we look for the idlest group/CPU.
9400 static inline void update_sg_wakeup_stats(struct sched_domain *sd,
9401 struct sched_group *group,
9402 struct sg_lb_stats *sgs,
9403 struct task_struct *p)
9407 memset(sgs, 0, sizeof(*sgs));
9409 /* Assume that task can't fit any CPU of the group */
9410 if (sd->flags & SD_ASYM_CPUCAPACITY)
9411 sgs->group_misfit_task_load = 1;
9413 for_each_cpu(i, sched_group_span(group)) {
9414 struct rq *rq = cpu_rq(i);
9417 sgs->group_load += cpu_load_without(rq, p);
9418 sgs->group_util += cpu_util_without(i, p);
9419 sgs->group_runnable += cpu_runnable_without(rq, p);
9420 local = task_running_on_cpu(i, p);
9421 sgs->sum_h_nr_running += rq->cfs.h_nr_running - local;
9423 nr_running = rq->nr_running - local;
9424 sgs->sum_nr_running += nr_running;
9427 * No need to call idle_cpu_without() if nr_running is not 0
9429 if (!nr_running && idle_cpu_without(i, p))
9432 /* Check if task fits in the CPU */
9433 if (sd->flags & SD_ASYM_CPUCAPACITY &&
9434 sgs->group_misfit_task_load &&
9435 task_fits_cpu(p, i))
9436 sgs->group_misfit_task_load = 0;
9440 sgs->group_capacity = group->sgc->capacity;
9442 sgs->group_weight = group->group_weight;
9444 sgs->group_type = group_classify(sd->imbalance_pct, group, sgs);
9447 * Computing avg_load makes sense only when group is fully busy or
9450 if (sgs->group_type == group_fully_busy ||
9451 sgs->group_type == group_overloaded)
9452 sgs->avg_load = (sgs->group_load * SCHED_CAPACITY_SCALE) /
9453 sgs->group_capacity;
9456 static bool update_pick_idlest(struct sched_group *idlest,
9457 struct sg_lb_stats *idlest_sgs,
9458 struct sched_group *group,
9459 struct sg_lb_stats *sgs)
9461 if (sgs->group_type < idlest_sgs->group_type)
9464 if (sgs->group_type > idlest_sgs->group_type)
9468 * The candidate and the current idlest group are the same type of
9469 * group. Let check which one is the idlest according to the type.
9472 switch (sgs->group_type) {
9473 case group_overloaded:
9474 case group_fully_busy:
9475 /* Select the group with lowest avg_load. */
9476 if (idlest_sgs->avg_load <= sgs->avg_load)
9480 case group_imbalanced:
9481 case group_asym_packing:
9482 /* Those types are not used in the slow wakeup path */
9485 case group_misfit_task:
9486 /* Select group with the highest max capacity */
9487 if (idlest->sgc->max_capacity >= group->sgc->max_capacity)
9491 case group_has_spare:
9492 /* Select group with most idle CPUs */
9493 if (idlest_sgs->idle_cpus > sgs->idle_cpus)
9496 /* Select group with lowest group_util */
9497 if (idlest_sgs->idle_cpus == sgs->idle_cpus &&
9498 idlest_sgs->group_util <= sgs->group_util)
9508 * find_idlest_group() finds and returns the least busy CPU group within the
9511 * Assumes p is allowed on at least one CPU in sd.
9513 static struct sched_group *
9514 find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu)
9516 struct sched_group *idlest = NULL, *local = NULL, *group = sd->groups;
9517 struct sg_lb_stats local_sgs, tmp_sgs;
9518 struct sg_lb_stats *sgs;
9519 unsigned long imbalance;
9520 struct sg_lb_stats idlest_sgs = {
9521 .avg_load = UINT_MAX,
9522 .group_type = group_overloaded,
9528 /* Skip over this group if it has no CPUs allowed */
9529 if (!cpumask_intersects(sched_group_span(group),
9533 /* Skip over this group if no cookie matched */
9534 if (!sched_group_cookie_match(cpu_rq(this_cpu), p, group))
9537 local_group = cpumask_test_cpu(this_cpu,
9538 sched_group_span(group));
9547 update_sg_wakeup_stats(sd, group, sgs, p);
9549 if (!local_group && update_pick_idlest(idlest, &idlest_sgs, group, sgs)) {
9554 } while (group = group->next, group != sd->groups);
9557 /* There is no idlest group to push tasks to */
9561 /* The local group has been skipped because of CPU affinity */
9566 * If the local group is idler than the selected idlest group
9567 * don't try and push the task.
9569 if (local_sgs.group_type < idlest_sgs.group_type)
9573 * If the local group is busier than the selected idlest group
9574 * try and push the task.
9576 if (local_sgs.group_type > idlest_sgs.group_type)
9579 switch (local_sgs.group_type) {
9580 case group_overloaded:
9581 case group_fully_busy:
9583 /* Calculate allowed imbalance based on load */
9584 imbalance = scale_load_down(NICE_0_LOAD) *
9585 (sd->imbalance_pct-100) / 100;
9588 * When comparing groups across NUMA domains, it's possible for
9589 * the local domain to be very lightly loaded relative to the
9590 * remote domains but "imbalance" skews the comparison making
9591 * remote CPUs look much more favourable. When considering
9592 * cross-domain, add imbalance to the load on the remote node
9593 * and consider staying local.
9596 if ((sd->flags & SD_NUMA) &&
9597 ((idlest_sgs.avg_load + imbalance) >= local_sgs.avg_load))
9601 * If the local group is less loaded than the selected
9602 * idlest group don't try and push any tasks.
9604 if (idlest_sgs.avg_load >= (local_sgs.avg_load + imbalance))
9607 if (100 * local_sgs.avg_load <= sd->imbalance_pct * idlest_sgs.avg_load)
9611 case group_imbalanced:
9612 case group_asym_packing:
9613 /* Those type are not used in the slow wakeup path */
9616 case group_misfit_task:
9617 /* Select group with the highest max capacity */
9618 if (local->sgc->max_capacity >= idlest->sgc->max_capacity)
9622 case group_has_spare:
9624 if (sd->flags & SD_NUMA) {
9625 int imb_numa_nr = sd->imb_numa_nr;
9626 #ifdef CONFIG_NUMA_BALANCING
9629 * If there is spare capacity at NUMA, try to select
9630 * the preferred node
9632 if (cpu_to_node(this_cpu) == p->numa_preferred_nid)
9635 idlest_cpu = cpumask_first(sched_group_span(idlest));
9636 if (cpu_to_node(idlest_cpu) == p->numa_preferred_nid)
9638 #endif /* CONFIG_NUMA_BALANCING */
9640 * Otherwise, keep the task close to the wakeup source
9641 * and improve locality if the number of running tasks
9642 * would remain below threshold where an imbalance is
9643 * allowed while accounting for the possibility the
9644 * task is pinned to a subset of CPUs. If there is a
9645 * real need of migration, periodic load balance will
9648 if (p->nr_cpus_allowed != NR_CPUS) {
9649 struct cpumask *cpus = this_cpu_cpumask_var_ptr(select_rq_mask);
9651 cpumask_and(cpus, sched_group_span(local), p->cpus_ptr);
9652 imb_numa_nr = min(cpumask_weight(cpus), sd->imb_numa_nr);
9655 imbalance = abs(local_sgs.idle_cpus - idlest_sgs.idle_cpus);
9656 if (!adjust_numa_imbalance(imbalance,
9657 local_sgs.sum_nr_running + 1,
9662 #endif /* CONFIG_NUMA */
9665 * Select group with highest number of idle CPUs. We could also
9666 * compare the utilization which is more stable but it can end
9667 * up that the group has less spare capacity but finally more
9668 * idle CPUs which means more opportunity to run task.
9670 if (local_sgs.idle_cpus >= idlest_sgs.idle_cpus)
9678 static void update_idle_cpu_scan(struct lb_env *env,
9679 unsigned long sum_util)
9681 struct sched_domain_shared *sd_share;
9682 int llc_weight, pct;
9685 * Update the number of CPUs to scan in LLC domain, which could
9686 * be used as a hint in select_idle_cpu(). The update of sd_share
9687 * could be expensive because it is within a shared cache line.
9688 * So the write of this hint only occurs during periodic load
9689 * balancing, rather than CPU_NEWLY_IDLE, because the latter
9690 * can fire way more frequently than the former.
9692 if (!sched_feat(SIS_UTIL) || env->idle == CPU_NEWLY_IDLE)
9695 llc_weight = per_cpu(sd_llc_size, env->dst_cpu);
9696 if (env->sd->span_weight != llc_weight)
9699 sd_share = rcu_dereference(per_cpu(sd_llc_shared, env->dst_cpu));
9704 * The number of CPUs to search drops as sum_util increases, when
9705 * sum_util hits 85% or above, the scan stops.
9706 * The reason to choose 85% as the threshold is because this is the
9707 * imbalance_pct(117) when a LLC sched group is overloaded.
9709 * let y = SCHED_CAPACITY_SCALE - p * x^2 [1]
9710 * and y'= y / SCHED_CAPACITY_SCALE
9712 * x is the ratio of sum_util compared to the CPU capacity:
9713 * x = sum_util / (llc_weight * SCHED_CAPACITY_SCALE)
9714 * y' is the ratio of CPUs to be scanned in the LLC domain,
9715 * and the number of CPUs to scan is calculated by:
9717 * nr_scan = llc_weight * y' [2]
9719 * When x hits the threshold of overloaded, AKA, when
9720 * x = 100 / pct, y drops to 0. According to [1],
9721 * p should be SCHED_CAPACITY_SCALE * pct^2 / 10000
9723 * Scale x by SCHED_CAPACITY_SCALE:
9724 * x' = sum_util / llc_weight; [3]
9726 * and finally [1] becomes:
9727 * y = SCHED_CAPACITY_SCALE -
9728 * x'^2 * pct^2 / (10000 * SCHED_CAPACITY_SCALE) [4]
9733 do_div(x, llc_weight);
9736 pct = env->sd->imbalance_pct;
9737 tmp = x * x * pct * pct;
9738 do_div(tmp, 10000 * SCHED_CAPACITY_SCALE);
9739 tmp = min_t(long, tmp, SCHED_CAPACITY_SCALE);
9740 y = SCHED_CAPACITY_SCALE - tmp;
9744 do_div(y, SCHED_CAPACITY_SCALE);
9745 if ((int)y != sd_share->nr_idle_scan)
9746 WRITE_ONCE(sd_share->nr_idle_scan, (int)y);
9750 * update_sd_lb_stats - Update sched_domain's statistics for load balancing.
9751 * @env: The load balancing environment.
9752 * @sds: variable to hold the statistics for this sched_domain.
9755 static inline void update_sd_lb_stats(struct lb_env *env, struct sd_lb_stats *sds)
9757 struct sched_domain *child = env->sd->child;
9758 struct sched_group *sg = env->sd->groups;
9759 struct sg_lb_stats *local = &sds->local_stat;
9760 struct sg_lb_stats tmp_sgs;
9761 unsigned long sum_util = 0;
9765 struct sg_lb_stats *sgs = &tmp_sgs;
9768 local_group = cpumask_test_cpu(env->dst_cpu, sched_group_span(sg));
9773 if (env->idle != CPU_NEWLY_IDLE ||
9774 time_after_eq(jiffies, sg->sgc->next_update))
9775 update_group_capacity(env->sd, env->dst_cpu);
9778 update_sg_lb_stats(env, sds, sg, sgs, &sg_status);
9784 if (update_sd_pick_busiest(env, sds, sg, sgs)) {
9786 sds->busiest_stat = *sgs;
9790 /* Now, start updating sd_lb_stats */
9791 sds->total_load += sgs->group_load;
9792 sds->total_capacity += sgs->group_capacity;
9794 sum_util += sgs->group_util;
9796 } while (sg != env->sd->groups);
9798 /* Tag domain that child domain prefers tasks go to siblings first */
9799 sds->prefer_sibling = child && child->flags & SD_PREFER_SIBLING;
9802 if (env->sd->flags & SD_NUMA)
9803 env->fbq_type = fbq_classify_group(&sds->busiest_stat);
9805 if (!env->sd->parent) {
9806 struct root_domain *rd = env->dst_rq->rd;
9808 /* update overload indicator if we are at root domain */
9809 WRITE_ONCE(rd->overload, sg_status & SG_OVERLOAD);
9811 /* Update over-utilization (tipping point, U >= 0) indicator */
9812 WRITE_ONCE(rd->overutilized, sg_status & SG_OVERUTILIZED);
9813 trace_sched_overutilized_tp(rd, sg_status & SG_OVERUTILIZED);
9814 } else if (sg_status & SG_OVERUTILIZED) {
9815 struct root_domain *rd = env->dst_rq->rd;
9817 WRITE_ONCE(rd->overutilized, SG_OVERUTILIZED);
9818 trace_sched_overutilized_tp(rd, SG_OVERUTILIZED);
9821 update_idle_cpu_scan(env, sum_util);
9825 * calculate_imbalance - Calculate the amount of imbalance present within the
9826 * groups of a given sched_domain during load balance.
9827 * @env: load balance environment
9828 * @sds: statistics of the sched_domain whose imbalance is to be calculated.
9830 static inline void calculate_imbalance(struct lb_env *env, struct sd_lb_stats *sds)
9832 struct sg_lb_stats *local, *busiest;
9834 local = &sds->local_stat;
9835 busiest = &sds->busiest_stat;
9837 if (busiest->group_type == group_misfit_task) {
9838 if (env->sd->flags & SD_ASYM_CPUCAPACITY) {
9839 /* Set imbalance to allow misfit tasks to be balanced. */
9840 env->migration_type = migrate_misfit;
9844 * Set load imbalance to allow moving task from cpu
9845 * with reduced capacity.
9847 env->migration_type = migrate_load;
9848 env->imbalance = busiest->group_misfit_task_load;
9853 if (busiest->group_type == group_asym_packing) {
9855 * In case of asym capacity, we will try to migrate all load to
9856 * the preferred CPU.
9858 env->migration_type = migrate_task;
9859 env->imbalance = busiest->sum_h_nr_running;
9863 if (busiest->group_type == group_imbalanced) {
9865 * In the group_imb case we cannot rely on group-wide averages
9866 * to ensure CPU-load equilibrium, try to move any task to fix
9867 * the imbalance. The next load balance will take care of
9868 * balancing back the system.
9870 env->migration_type = migrate_task;
9876 * Try to use spare capacity of local group without overloading it or
9879 if (local->group_type == group_has_spare) {
9880 if ((busiest->group_type > group_fully_busy) &&
9881 !(env->sd->flags & SD_SHARE_PKG_RESOURCES)) {
9883 * If busiest is overloaded, try to fill spare
9884 * capacity. This might end up creating spare capacity
9885 * in busiest or busiest still being overloaded but
9886 * there is no simple way to directly compute the
9887 * amount of load to migrate in order to balance the
9890 env->migration_type = migrate_util;
9891 env->imbalance = max(local->group_capacity, local->group_util) -
9895 * In some cases, the group's utilization is max or even
9896 * higher than capacity because of migrations but the
9897 * local CPU is (newly) idle. There is at least one
9898 * waiting task in this overloaded busiest group. Let's
9901 if (env->idle != CPU_NOT_IDLE && env->imbalance == 0) {
9902 env->migration_type = migrate_task;
9909 if (busiest->group_weight == 1 || sds->prefer_sibling) {
9910 unsigned int nr_diff = busiest->sum_nr_running;
9912 * When prefer sibling, evenly spread running tasks on
9915 env->migration_type = migrate_task;
9916 lsub_positive(&nr_diff, local->sum_nr_running);
9917 env->imbalance = nr_diff;
9921 * If there is no overload, we just want to even the number of
9924 env->migration_type = migrate_task;
9925 env->imbalance = max_t(long, 0,
9926 (local->idle_cpus - busiest->idle_cpus));
9930 /* Consider allowing a small imbalance between NUMA groups */
9931 if (env->sd->flags & SD_NUMA) {
9932 env->imbalance = adjust_numa_imbalance(env->imbalance,
9933 local->sum_nr_running + 1,
9934 env->sd->imb_numa_nr);
9938 /* Number of tasks to move to restore balance */
9939 env->imbalance >>= 1;
9945 * Local is fully busy but has to take more load to relieve the
9948 if (local->group_type < group_overloaded) {
9950 * Local will become overloaded so the avg_load metrics are
9954 local->avg_load = (local->group_load * SCHED_CAPACITY_SCALE) /
9955 local->group_capacity;
9958 * If the local group is more loaded than the selected
9959 * busiest group don't try to pull any tasks.
9961 if (local->avg_load >= busiest->avg_load) {
9966 sds->avg_load = (sds->total_load * SCHED_CAPACITY_SCALE) /
9967 sds->total_capacity;
9971 * Both group are or will become overloaded and we're trying to get all
9972 * the CPUs to the average_load, so we don't want to push ourselves
9973 * above the average load, nor do we wish to reduce the max loaded CPU
9974 * below the average load. At the same time, we also don't want to
9975 * reduce the group load below the group capacity. Thus we look for
9976 * the minimum possible imbalance.
9978 env->migration_type = migrate_load;
9979 env->imbalance = min(
9980 (busiest->avg_load - sds->avg_load) * busiest->group_capacity,
9981 (sds->avg_load - local->avg_load) * local->group_capacity
9982 ) / SCHED_CAPACITY_SCALE;
9985 /******* find_busiest_group() helpers end here *********************/
9988 * Decision matrix according to the local and busiest group type:
9990 * busiest \ local has_spare fully_busy misfit asym imbalanced overloaded
9991 * has_spare nr_idle balanced N/A N/A balanced balanced
9992 * fully_busy nr_idle nr_idle N/A N/A balanced balanced
9993 * misfit_task force N/A N/A N/A N/A N/A
9994 * asym_packing force force N/A N/A force force
9995 * imbalanced force force N/A N/A force force
9996 * overloaded force force N/A N/A force avg_load
9998 * N/A : Not Applicable because already filtered while updating
10000 * balanced : The system is balanced for these 2 groups.
10001 * force : Calculate the imbalance as load migration is probably needed.
10002 * avg_load : Only if imbalance is significant enough.
10003 * nr_idle : dst_cpu is not busy and the number of idle CPUs is quite
10004 * different in groups.
10008 * find_busiest_group - Returns the busiest group within the sched_domain
10009 * if there is an imbalance.
10010 * @env: The load balancing environment.
10012 * Also calculates the amount of runnable load which should be moved
10013 * to restore balance.
10015 * Return: - The busiest group if imbalance exists.
10017 static struct sched_group *find_busiest_group(struct lb_env *env)
10019 struct sg_lb_stats *local, *busiest;
10020 struct sd_lb_stats sds;
10022 init_sd_lb_stats(&sds);
10025 * Compute the various statistics relevant for load balancing at
10028 update_sd_lb_stats(env, &sds);
10030 if (sched_energy_enabled()) {
10031 struct root_domain *rd = env->dst_rq->rd;
10033 if (rcu_dereference(rd->pd) && !READ_ONCE(rd->overutilized))
10037 local = &sds.local_stat;
10038 busiest = &sds.busiest_stat;
10040 /* There is no busy sibling group to pull tasks from */
10044 /* Misfit tasks should be dealt with regardless of the avg load */
10045 if (busiest->group_type == group_misfit_task)
10046 goto force_balance;
10048 /* ASYM feature bypasses nice load balance check */
10049 if (busiest->group_type == group_asym_packing)
10050 goto force_balance;
10053 * If the busiest group is imbalanced the below checks don't
10054 * work because they assume all things are equal, which typically
10055 * isn't true due to cpus_ptr constraints and the like.
10057 if (busiest->group_type == group_imbalanced)
10058 goto force_balance;
10061 * If the local group is busier than the selected busiest group
10062 * don't try and pull any tasks.
10064 if (local->group_type > busiest->group_type)
10068 * When groups are overloaded, use the avg_load to ensure fairness
10071 if (local->group_type == group_overloaded) {
10073 * If the local group is more loaded than the selected
10074 * busiest group don't try to pull any tasks.
10076 if (local->avg_load >= busiest->avg_load)
10079 /* XXX broken for overlapping NUMA groups */
10080 sds.avg_load = (sds.total_load * SCHED_CAPACITY_SCALE) /
10081 sds.total_capacity;
10084 * Don't pull any tasks if this group is already above the
10085 * domain average load.
10087 if (local->avg_load >= sds.avg_load)
10091 * If the busiest group is more loaded, use imbalance_pct to be
10094 if (100 * busiest->avg_load <=
10095 env->sd->imbalance_pct * local->avg_load)
10099 /* Try to move all excess tasks to child's sibling domain */
10100 if (sds.prefer_sibling && local->group_type == group_has_spare &&
10101 busiest->sum_nr_running > local->sum_nr_running + 1)
10102 goto force_balance;
10104 if (busiest->group_type != group_overloaded) {
10105 if (env->idle == CPU_NOT_IDLE)
10107 * If the busiest group is not overloaded (and as a
10108 * result the local one too) but this CPU is already
10109 * busy, let another idle CPU try to pull task.
10113 if (busiest->group_weight > 1 &&
10114 local->idle_cpus <= (busiest->idle_cpus + 1))
10116 * If the busiest group is not overloaded
10117 * and there is no imbalance between this and busiest
10118 * group wrt idle CPUs, it is balanced. The imbalance
10119 * becomes significant if the diff is greater than 1
10120 * otherwise we might end up to just move the imbalance
10121 * on another group. Of course this applies only if
10122 * there is more than 1 CPU per group.
10126 if (busiest->sum_h_nr_running == 1)
10128 * busiest doesn't have any tasks waiting to run
10134 /* Looks like there is an imbalance. Compute it */
10135 calculate_imbalance(env, &sds);
10136 return env->imbalance ? sds.busiest : NULL;
10139 env->imbalance = 0;
10144 * find_busiest_queue - find the busiest runqueue among the CPUs in the group.
10146 static struct rq *find_busiest_queue(struct lb_env *env,
10147 struct sched_group *group)
10149 struct rq *busiest = NULL, *rq;
10150 unsigned long busiest_util = 0, busiest_load = 0, busiest_capacity = 1;
10151 unsigned int busiest_nr = 0;
10154 for_each_cpu_and(i, sched_group_span(group), env->cpus) {
10155 unsigned long capacity, load, util;
10156 unsigned int nr_running;
10160 rt = fbq_classify_rq(rq);
10163 * We classify groups/runqueues into three groups:
10164 * - regular: there are !numa tasks
10165 * - remote: there are numa tasks that run on the 'wrong' node
10166 * - all: there is no distinction
10168 * In order to avoid migrating ideally placed numa tasks,
10169 * ignore those when there's better options.
10171 * If we ignore the actual busiest queue to migrate another
10172 * task, the next balance pass can still reduce the busiest
10173 * queue by moving tasks around inside the node.
10175 * If we cannot move enough load due to this classification
10176 * the next pass will adjust the group classification and
10177 * allow migration of more tasks.
10179 * Both cases only affect the total convergence complexity.
10181 if (rt > env->fbq_type)
10184 nr_running = rq->cfs.h_nr_running;
10188 capacity = capacity_of(i);
10191 * For ASYM_CPUCAPACITY domains, don't pick a CPU that could
10192 * eventually lead to active_balancing high->low capacity.
10193 * Higher per-CPU capacity is considered better than balancing
10196 if (env->sd->flags & SD_ASYM_CPUCAPACITY &&
10197 !capacity_greater(capacity_of(env->dst_cpu), capacity) &&
10201 /* Make sure we only pull tasks from a CPU of lower priority */
10202 if ((env->sd->flags & SD_ASYM_PACKING) &&
10203 sched_asym_prefer(i, env->dst_cpu) &&
10207 switch (env->migration_type) {
10210 * When comparing with load imbalance, use cpu_load()
10211 * which is not scaled with the CPU capacity.
10213 load = cpu_load(rq);
10215 if (nr_running == 1 && load > env->imbalance &&
10216 !check_cpu_capacity(rq, env->sd))
10220 * For the load comparisons with the other CPUs,
10221 * consider the cpu_load() scaled with the CPU
10222 * capacity, so that the load can be moved away
10223 * from the CPU that is potentially running at a
10226 * Thus we're looking for max(load_i / capacity_i),
10227 * crosswise multiplication to rid ourselves of the
10228 * division works out to:
10229 * load_i * capacity_j > load_j * capacity_i;
10230 * where j is our previous maximum.
10232 if (load * busiest_capacity > busiest_load * capacity) {
10233 busiest_load = load;
10234 busiest_capacity = capacity;
10240 util = cpu_util_cfs(i);
10243 * Don't try to pull utilization from a CPU with one
10244 * running task. Whatever its utilization, we will fail
10247 if (nr_running <= 1)
10250 if (busiest_util < util) {
10251 busiest_util = util;
10257 if (busiest_nr < nr_running) {
10258 busiest_nr = nr_running;
10263 case migrate_misfit:
10265 * For ASYM_CPUCAPACITY domains with misfit tasks we
10266 * simply seek the "biggest" misfit task.
10268 if (rq->misfit_task_load > busiest_load) {
10269 busiest_load = rq->misfit_task_load;
10282 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
10283 * so long as it is large enough.
10285 #define MAX_PINNED_INTERVAL 512
10288 asym_active_balance(struct lb_env *env)
10291 * ASYM_PACKING needs to force migrate tasks from busy but
10292 * lower priority CPUs in order to pack all tasks in the
10293 * highest priority CPUs.
10295 return env->idle != CPU_NOT_IDLE && (env->sd->flags & SD_ASYM_PACKING) &&
10296 sched_asym_prefer(env->dst_cpu, env->src_cpu);
10300 imbalanced_active_balance(struct lb_env *env)
10302 struct sched_domain *sd = env->sd;
10305 * The imbalanced case includes the case of pinned tasks preventing a fair
10306 * distribution of the load on the system but also the even distribution of the
10307 * threads on a system with spare capacity
10309 if ((env->migration_type == migrate_task) &&
10310 (sd->nr_balance_failed > sd->cache_nice_tries+2))
10316 static int need_active_balance(struct lb_env *env)
10318 struct sched_domain *sd = env->sd;
10320 if (asym_active_balance(env))
10323 if (imbalanced_active_balance(env))
10327 * The dst_cpu is idle and the src_cpu CPU has only 1 CFS task.
10328 * It's worth migrating the task if the src_cpu's capacity is reduced
10329 * because of other sched_class or IRQs if more capacity stays
10330 * available on dst_cpu.
10332 if ((env->idle != CPU_NOT_IDLE) &&
10333 (env->src_rq->cfs.h_nr_running == 1)) {
10334 if ((check_cpu_capacity(env->src_rq, sd)) &&
10335 (capacity_of(env->src_cpu)*sd->imbalance_pct < capacity_of(env->dst_cpu)*100))
10339 if (env->migration_type == migrate_misfit)
10345 static int active_load_balance_cpu_stop(void *data);
10347 static int should_we_balance(struct lb_env *env)
10349 struct sched_group *sg = env->sd->groups;
10353 * Ensure the balancing environment is consistent; can happen
10354 * when the softirq triggers 'during' hotplug.
10356 if (!cpumask_test_cpu(env->dst_cpu, env->cpus))
10360 * In the newly idle case, we will allow all the CPUs
10361 * to do the newly idle load balance.
10363 * However, we bail out if we already have tasks or a wakeup pending,
10364 * to optimize wakeup latency.
10366 if (env->idle == CPU_NEWLY_IDLE) {
10367 if (env->dst_rq->nr_running > 0 || env->dst_rq->ttwu_pending)
10372 /* Try to find first idle CPU */
10373 for_each_cpu_and(cpu, group_balance_mask(sg), env->cpus) {
10374 if (!idle_cpu(cpu))
10377 /* Are we the first idle CPU? */
10378 return cpu == env->dst_cpu;
10381 /* Are we the first CPU of this group ? */
10382 return group_balance_cpu(sg) == env->dst_cpu;
10386 * Check this_cpu to ensure it is balanced within domain. Attempt to move
10387 * tasks if there is an imbalance.
10389 static int load_balance(int this_cpu, struct rq *this_rq,
10390 struct sched_domain *sd, enum cpu_idle_type idle,
10391 int *continue_balancing)
10393 int ld_moved, cur_ld_moved, active_balance = 0;
10394 struct sched_domain *sd_parent = sd->parent;
10395 struct sched_group *group;
10396 struct rq *busiest;
10397 struct rq_flags rf;
10398 struct cpumask *cpus = this_cpu_cpumask_var_ptr(load_balance_mask);
10399 struct lb_env env = {
10401 .dst_cpu = this_cpu,
10403 .dst_grpmask = sched_group_span(sd->groups),
10405 .loop_break = SCHED_NR_MIGRATE_BREAK,
10408 .tasks = LIST_HEAD_INIT(env.tasks),
10411 cpumask_and(cpus, sched_domain_span(sd), cpu_active_mask);
10413 schedstat_inc(sd->lb_count[idle]);
10416 if (!should_we_balance(&env)) {
10417 *continue_balancing = 0;
10421 group = find_busiest_group(&env);
10423 schedstat_inc(sd->lb_nobusyg[idle]);
10427 busiest = find_busiest_queue(&env, group);
10429 schedstat_inc(sd->lb_nobusyq[idle]);
10433 WARN_ON_ONCE(busiest == env.dst_rq);
10435 schedstat_add(sd->lb_imbalance[idle], env.imbalance);
10437 env.src_cpu = busiest->cpu;
10438 env.src_rq = busiest;
10441 /* Clear this flag as soon as we find a pullable task */
10442 env.flags |= LBF_ALL_PINNED;
10443 if (busiest->nr_running > 1) {
10445 * Attempt to move tasks. If find_busiest_group has found
10446 * an imbalance but busiest->nr_running <= 1, the group is
10447 * still unbalanced. ld_moved simply stays zero, so it is
10448 * correctly treated as an imbalance.
10450 env.loop_max = min(sysctl_sched_nr_migrate, busiest->nr_running);
10453 rq_lock_irqsave(busiest, &rf);
10454 update_rq_clock(busiest);
10457 * cur_ld_moved - load moved in current iteration
10458 * ld_moved - cumulative load moved across iterations
10460 cur_ld_moved = detach_tasks(&env);
10463 * We've detached some tasks from busiest_rq. Every
10464 * task is masked "TASK_ON_RQ_MIGRATING", so we can safely
10465 * unlock busiest->lock, and we are able to be sure
10466 * that nobody can manipulate the tasks in parallel.
10467 * See task_rq_lock() family for the details.
10470 rq_unlock(busiest, &rf);
10472 if (cur_ld_moved) {
10473 attach_tasks(&env);
10474 ld_moved += cur_ld_moved;
10477 local_irq_restore(rf.flags);
10479 if (env.flags & LBF_NEED_BREAK) {
10480 env.flags &= ~LBF_NEED_BREAK;
10481 /* Stop if we tried all running tasks */
10482 if (env.loop < busiest->nr_running)
10487 * Revisit (affine) tasks on src_cpu that couldn't be moved to
10488 * us and move them to an alternate dst_cpu in our sched_group
10489 * where they can run. The upper limit on how many times we
10490 * iterate on same src_cpu is dependent on number of CPUs in our
10493 * This changes load balance semantics a bit on who can move
10494 * load to a given_cpu. In addition to the given_cpu itself
10495 * (or a ilb_cpu acting on its behalf where given_cpu is
10496 * nohz-idle), we now have balance_cpu in a position to move
10497 * load to given_cpu. In rare situations, this may cause
10498 * conflicts (balance_cpu and given_cpu/ilb_cpu deciding
10499 * _independently_ and at _same_ time to move some load to
10500 * given_cpu) causing excess load to be moved to given_cpu.
10501 * This however should not happen so much in practice and
10502 * moreover subsequent load balance cycles should correct the
10503 * excess load moved.
10505 if ((env.flags & LBF_DST_PINNED) && env.imbalance > 0) {
10507 /* Prevent to re-select dst_cpu via env's CPUs */
10508 __cpumask_clear_cpu(env.dst_cpu, env.cpus);
10510 env.dst_rq = cpu_rq(env.new_dst_cpu);
10511 env.dst_cpu = env.new_dst_cpu;
10512 env.flags &= ~LBF_DST_PINNED;
10514 env.loop_break = SCHED_NR_MIGRATE_BREAK;
10517 * Go back to "more_balance" rather than "redo" since we
10518 * need to continue with same src_cpu.
10524 * We failed to reach balance because of affinity.
10527 int *group_imbalance = &sd_parent->groups->sgc->imbalance;
10529 if ((env.flags & LBF_SOME_PINNED) && env.imbalance > 0)
10530 *group_imbalance = 1;
10533 /* All tasks on this runqueue were pinned by CPU affinity */
10534 if (unlikely(env.flags & LBF_ALL_PINNED)) {
10535 __cpumask_clear_cpu(cpu_of(busiest), cpus);
10537 * Attempting to continue load balancing at the current
10538 * sched_domain level only makes sense if there are
10539 * active CPUs remaining as possible busiest CPUs to
10540 * pull load from which are not contained within the
10541 * destination group that is receiving any migrated
10544 if (!cpumask_subset(cpus, env.dst_grpmask)) {
10546 env.loop_break = SCHED_NR_MIGRATE_BREAK;
10549 goto out_all_pinned;
10554 schedstat_inc(sd->lb_failed[idle]);
10556 * Increment the failure counter only on periodic balance.
10557 * We do not want newidle balance, which can be very
10558 * frequent, pollute the failure counter causing
10559 * excessive cache_hot migrations and active balances.
10561 if (idle != CPU_NEWLY_IDLE)
10562 sd->nr_balance_failed++;
10564 if (need_active_balance(&env)) {
10565 unsigned long flags;
10567 raw_spin_rq_lock_irqsave(busiest, flags);
10570 * Don't kick the active_load_balance_cpu_stop,
10571 * if the curr task on busiest CPU can't be
10572 * moved to this_cpu:
10574 if (!cpumask_test_cpu(this_cpu, busiest->curr->cpus_ptr)) {
10575 raw_spin_rq_unlock_irqrestore(busiest, flags);
10576 goto out_one_pinned;
10579 /* Record that we found at least one task that could run on this_cpu */
10580 env.flags &= ~LBF_ALL_PINNED;
10583 * ->active_balance synchronizes accesses to
10584 * ->active_balance_work. Once set, it's cleared
10585 * only after active load balance is finished.
10587 if (!busiest->active_balance) {
10588 busiest->active_balance = 1;
10589 busiest->push_cpu = this_cpu;
10590 active_balance = 1;
10592 raw_spin_rq_unlock_irqrestore(busiest, flags);
10594 if (active_balance) {
10595 stop_one_cpu_nowait(cpu_of(busiest),
10596 active_load_balance_cpu_stop, busiest,
10597 &busiest->active_balance_work);
10601 sd->nr_balance_failed = 0;
10604 if (likely(!active_balance) || need_active_balance(&env)) {
10605 /* We were unbalanced, so reset the balancing interval */
10606 sd->balance_interval = sd->min_interval;
10613 * We reach balance although we may have faced some affinity
10614 * constraints. Clear the imbalance flag only if other tasks got
10615 * a chance to move and fix the imbalance.
10617 if (sd_parent && !(env.flags & LBF_ALL_PINNED)) {
10618 int *group_imbalance = &sd_parent->groups->sgc->imbalance;
10620 if (*group_imbalance)
10621 *group_imbalance = 0;
10626 * We reach balance because all tasks are pinned at this level so
10627 * we can't migrate them. Let the imbalance flag set so parent level
10628 * can try to migrate them.
10630 schedstat_inc(sd->lb_balanced[idle]);
10632 sd->nr_balance_failed = 0;
10638 * newidle_balance() disregards balance intervals, so we could
10639 * repeatedly reach this code, which would lead to balance_interval
10640 * skyrocketing in a short amount of time. Skip the balance_interval
10641 * increase logic to avoid that.
10643 if (env.idle == CPU_NEWLY_IDLE)
10646 /* tune up the balancing interval */
10647 if ((env.flags & LBF_ALL_PINNED &&
10648 sd->balance_interval < MAX_PINNED_INTERVAL) ||
10649 sd->balance_interval < sd->max_interval)
10650 sd->balance_interval *= 2;
10655 static inline unsigned long
10656 get_sd_balance_interval(struct sched_domain *sd, int cpu_busy)
10658 unsigned long interval = sd->balance_interval;
10661 interval *= sd->busy_factor;
10663 /* scale ms to jiffies */
10664 interval = msecs_to_jiffies(interval);
10667 * Reduce likelihood of busy balancing at higher domains racing with
10668 * balancing at lower domains by preventing their balancing periods
10669 * from being multiples of each other.
10674 interval = clamp(interval, 1UL, max_load_balance_interval);
10680 update_next_balance(struct sched_domain *sd, unsigned long *next_balance)
10682 unsigned long interval, next;
10684 /* used by idle balance, so cpu_busy = 0 */
10685 interval = get_sd_balance_interval(sd, 0);
10686 next = sd->last_balance + interval;
10688 if (time_after(*next_balance, next))
10689 *next_balance = next;
10693 * active_load_balance_cpu_stop is run by the CPU stopper. It pushes
10694 * running tasks off the busiest CPU onto idle CPUs. It requires at
10695 * least 1 task to be running on each physical CPU where possible, and
10696 * avoids physical / logical imbalances.
10698 static int active_load_balance_cpu_stop(void *data)
10700 struct rq *busiest_rq = data;
10701 int busiest_cpu = cpu_of(busiest_rq);
10702 int target_cpu = busiest_rq->push_cpu;
10703 struct rq *target_rq = cpu_rq(target_cpu);
10704 struct sched_domain *sd;
10705 struct task_struct *p = NULL;
10706 struct rq_flags rf;
10708 rq_lock_irq(busiest_rq, &rf);
10710 * Between queueing the stop-work and running it is a hole in which
10711 * CPUs can become inactive. We should not move tasks from or to
10714 if (!cpu_active(busiest_cpu) || !cpu_active(target_cpu))
10717 /* Make sure the requested CPU hasn't gone down in the meantime: */
10718 if (unlikely(busiest_cpu != smp_processor_id() ||
10719 !busiest_rq->active_balance))
10722 /* Is there any task to move? */
10723 if (busiest_rq->nr_running <= 1)
10727 * This condition is "impossible", if it occurs
10728 * we need to fix it. Originally reported by
10729 * Bjorn Helgaas on a 128-CPU setup.
10731 WARN_ON_ONCE(busiest_rq == target_rq);
10733 /* Search for an sd spanning us and the target CPU. */
10735 for_each_domain(target_cpu, sd) {
10736 if (cpumask_test_cpu(busiest_cpu, sched_domain_span(sd)))
10741 struct lb_env env = {
10743 .dst_cpu = target_cpu,
10744 .dst_rq = target_rq,
10745 .src_cpu = busiest_rq->cpu,
10746 .src_rq = busiest_rq,
10748 .flags = LBF_ACTIVE_LB,
10751 schedstat_inc(sd->alb_count);
10752 update_rq_clock(busiest_rq);
10754 p = detach_one_task(&env);
10756 schedstat_inc(sd->alb_pushed);
10757 /* Active balancing done, reset the failure counter. */
10758 sd->nr_balance_failed = 0;
10760 schedstat_inc(sd->alb_failed);
10765 busiest_rq->active_balance = 0;
10766 rq_unlock(busiest_rq, &rf);
10769 attach_one_task(target_rq, p);
10771 local_irq_enable();
10776 static DEFINE_SPINLOCK(balancing);
10779 * Scale the max load_balance interval with the number of CPUs in the system.
10780 * This trades load-balance latency on larger machines for less cross talk.
10782 void update_max_interval(void)
10784 max_load_balance_interval = HZ*num_online_cpus()/10;
10787 static inline bool update_newidle_cost(struct sched_domain *sd, u64 cost)
10789 if (cost > sd->max_newidle_lb_cost) {
10791 * Track max cost of a domain to make sure to not delay the
10792 * next wakeup on the CPU.
10794 sd->max_newidle_lb_cost = cost;
10795 sd->last_decay_max_lb_cost = jiffies;
10796 } else if (time_after(jiffies, sd->last_decay_max_lb_cost + HZ)) {
10798 * Decay the newidle max times by ~1% per second to ensure that
10799 * it is not outdated and the current max cost is actually
10802 sd->max_newidle_lb_cost = (sd->max_newidle_lb_cost * 253) / 256;
10803 sd->last_decay_max_lb_cost = jiffies;
10812 * It checks each scheduling domain to see if it is due to be balanced,
10813 * and initiates a balancing operation if so.
10815 * Balancing parameters are set up in init_sched_domains.
10817 static void rebalance_domains(struct rq *rq, enum cpu_idle_type idle)
10819 int continue_balancing = 1;
10821 int busy = idle != CPU_IDLE && !sched_idle_cpu(cpu);
10822 unsigned long interval;
10823 struct sched_domain *sd;
10824 /* Earliest time when we have to do rebalance again */
10825 unsigned long next_balance = jiffies + 60*HZ;
10826 int update_next_balance = 0;
10827 int need_serialize, need_decay = 0;
10831 for_each_domain(cpu, sd) {
10833 * Decay the newidle max times here because this is a regular
10834 * visit to all the domains.
10836 need_decay = update_newidle_cost(sd, 0);
10837 max_cost += sd->max_newidle_lb_cost;
10840 * Stop the load balance at this level. There is another
10841 * CPU in our sched group which is doing load balancing more
10844 if (!continue_balancing) {
10850 interval = get_sd_balance_interval(sd, busy);
10852 need_serialize = sd->flags & SD_SERIALIZE;
10853 if (need_serialize) {
10854 if (!spin_trylock(&balancing))
10858 if (time_after_eq(jiffies, sd->last_balance + interval)) {
10859 if (load_balance(cpu, rq, sd, idle, &continue_balancing)) {
10861 * The LBF_DST_PINNED logic could have changed
10862 * env->dst_cpu, so we can't know our idle
10863 * state even if we migrated tasks. Update it.
10865 idle = idle_cpu(cpu) ? CPU_IDLE : CPU_NOT_IDLE;
10866 busy = idle != CPU_IDLE && !sched_idle_cpu(cpu);
10868 sd->last_balance = jiffies;
10869 interval = get_sd_balance_interval(sd, busy);
10871 if (need_serialize)
10872 spin_unlock(&balancing);
10874 if (time_after(next_balance, sd->last_balance + interval)) {
10875 next_balance = sd->last_balance + interval;
10876 update_next_balance = 1;
10881 * Ensure the rq-wide value also decays but keep it at a
10882 * reasonable floor to avoid funnies with rq->avg_idle.
10884 rq->max_idle_balance_cost =
10885 max((u64)sysctl_sched_migration_cost, max_cost);
10890 * next_balance will be updated only when there is a need.
10891 * When the cpu is attached to null domain for ex, it will not be
10894 if (likely(update_next_balance))
10895 rq->next_balance = next_balance;
10899 static inline int on_null_domain(struct rq *rq)
10901 return unlikely(!rcu_dereference_sched(rq->sd));
10904 #ifdef CONFIG_NO_HZ_COMMON
10906 * idle load balancing details
10907 * - When one of the busy CPUs notice that there may be an idle rebalancing
10908 * needed, they will kick the idle load balancer, which then does idle
10909 * load balancing for all the idle CPUs.
10910 * - HK_TYPE_MISC CPUs are used for this task, because HK_TYPE_SCHED not set
10914 static inline int find_new_ilb(void)
10917 const struct cpumask *hk_mask;
10919 hk_mask = housekeeping_cpumask(HK_TYPE_MISC);
10921 for_each_cpu_and(ilb, nohz.idle_cpus_mask, hk_mask) {
10923 if (ilb == smp_processor_id())
10934 * Kick a CPU to do the nohz balancing, if it is time for it. We pick any
10935 * idle CPU in the HK_TYPE_MISC housekeeping set (if there is one).
10937 static void kick_ilb(unsigned int flags)
10942 * Increase nohz.next_balance only when if full ilb is triggered but
10943 * not if we only update stats.
10945 if (flags & NOHZ_BALANCE_KICK)
10946 nohz.next_balance = jiffies+1;
10948 ilb_cpu = find_new_ilb();
10950 if (ilb_cpu >= nr_cpu_ids)
10954 * Access to rq::nohz_csd is serialized by NOHZ_KICK_MASK; he who sets
10955 * the first flag owns it; cleared by nohz_csd_func().
10957 flags = atomic_fetch_or(flags, nohz_flags(ilb_cpu));
10958 if (flags & NOHZ_KICK_MASK)
10962 * This way we generate an IPI on the target CPU which
10963 * is idle. And the softirq performing nohz idle load balance
10964 * will be run before returning from the IPI.
10966 smp_call_function_single_async(ilb_cpu, &cpu_rq(ilb_cpu)->nohz_csd);
10970 * Current decision point for kicking the idle load balancer in the presence
10971 * of idle CPUs in the system.
10973 static void nohz_balancer_kick(struct rq *rq)
10975 unsigned long now = jiffies;
10976 struct sched_domain_shared *sds;
10977 struct sched_domain *sd;
10978 int nr_busy, i, cpu = rq->cpu;
10979 unsigned int flags = 0;
10981 if (unlikely(rq->idle_balance))
10985 * We may be recently in ticked or tickless idle mode. At the first
10986 * busy tick after returning from idle, we will update the busy stats.
10988 nohz_balance_exit_idle(rq);
10991 * None are in tickless mode and hence no need for NOHZ idle load
10994 if (likely(!atomic_read(&nohz.nr_cpus)))
10997 if (READ_ONCE(nohz.has_blocked) &&
10998 time_after(now, READ_ONCE(nohz.next_blocked)))
10999 flags = NOHZ_STATS_KICK;
11001 if (time_before(now, nohz.next_balance))
11004 if (rq->nr_running >= 2) {
11005 flags = NOHZ_STATS_KICK | NOHZ_BALANCE_KICK;
11011 sd = rcu_dereference(rq->sd);
11014 * If there's a CFS task and the current CPU has reduced
11015 * capacity; kick the ILB to see if there's a better CPU to run
11018 if (rq->cfs.h_nr_running >= 1 && check_cpu_capacity(rq, sd)) {
11019 flags = NOHZ_STATS_KICK | NOHZ_BALANCE_KICK;
11024 sd = rcu_dereference(per_cpu(sd_asym_packing, cpu));
11027 * When ASYM_PACKING; see if there's a more preferred CPU
11028 * currently idle; in which case, kick the ILB to move tasks
11031 for_each_cpu_and(i, sched_domain_span(sd), nohz.idle_cpus_mask) {
11032 if (sched_asym_prefer(i, cpu)) {
11033 flags = NOHZ_STATS_KICK | NOHZ_BALANCE_KICK;
11039 sd = rcu_dereference(per_cpu(sd_asym_cpucapacity, cpu));
11042 * When ASYM_CPUCAPACITY; see if there's a higher capacity CPU
11043 * to run the misfit task on.
11045 if (check_misfit_status(rq, sd)) {
11046 flags = NOHZ_STATS_KICK | NOHZ_BALANCE_KICK;
11051 * For asymmetric systems, we do not want to nicely balance
11052 * cache use, instead we want to embrace asymmetry and only
11053 * ensure tasks have enough CPU capacity.
11055 * Skip the LLC logic because it's not relevant in that case.
11060 sds = rcu_dereference(per_cpu(sd_llc_shared, cpu));
11063 * If there is an imbalance between LLC domains (IOW we could
11064 * increase the overall cache use), we need some less-loaded LLC
11065 * domain to pull some load. Likewise, we may need to spread
11066 * load within the current LLC domain (e.g. packed SMT cores but
11067 * other CPUs are idle). We can't really know from here how busy
11068 * the others are - so just get a nohz balance going if it looks
11069 * like this LLC domain has tasks we could move.
11071 nr_busy = atomic_read(&sds->nr_busy_cpus);
11073 flags = NOHZ_STATS_KICK | NOHZ_BALANCE_KICK;
11080 if (READ_ONCE(nohz.needs_update))
11081 flags |= NOHZ_NEXT_KICK;
11087 static void set_cpu_sd_state_busy(int cpu)
11089 struct sched_domain *sd;
11092 sd = rcu_dereference(per_cpu(sd_llc, cpu));
11094 if (!sd || !sd->nohz_idle)
11098 atomic_inc(&sd->shared->nr_busy_cpus);
11103 void nohz_balance_exit_idle(struct rq *rq)
11105 SCHED_WARN_ON(rq != this_rq());
11107 if (likely(!rq->nohz_tick_stopped))
11110 rq->nohz_tick_stopped = 0;
11111 cpumask_clear_cpu(rq->cpu, nohz.idle_cpus_mask);
11112 atomic_dec(&nohz.nr_cpus);
11114 set_cpu_sd_state_busy(rq->cpu);
11117 static void set_cpu_sd_state_idle(int cpu)
11119 struct sched_domain *sd;
11122 sd = rcu_dereference(per_cpu(sd_llc, cpu));
11124 if (!sd || sd->nohz_idle)
11128 atomic_dec(&sd->shared->nr_busy_cpus);
11134 * This routine will record that the CPU is going idle with tick stopped.
11135 * This info will be used in performing idle load balancing in the future.
11137 void nohz_balance_enter_idle(int cpu)
11139 struct rq *rq = cpu_rq(cpu);
11141 SCHED_WARN_ON(cpu != smp_processor_id());
11143 /* If this CPU is going down, then nothing needs to be done: */
11144 if (!cpu_active(cpu))
11147 /* Spare idle load balancing on CPUs that don't want to be disturbed: */
11148 if (!housekeeping_cpu(cpu, HK_TYPE_SCHED))
11152 * Can be set safely without rq->lock held
11153 * If a clear happens, it will have evaluated last additions because
11154 * rq->lock is held during the check and the clear
11156 rq->has_blocked_load = 1;
11159 * The tick is still stopped but load could have been added in the
11160 * meantime. We set the nohz.has_blocked flag to trig a check of the
11161 * *_avg. The CPU is already part of nohz.idle_cpus_mask so the clear
11162 * of nohz.has_blocked can only happen after checking the new load
11164 if (rq->nohz_tick_stopped)
11167 /* If we're a completely isolated CPU, we don't play: */
11168 if (on_null_domain(rq))
11171 rq->nohz_tick_stopped = 1;
11173 cpumask_set_cpu(cpu, nohz.idle_cpus_mask);
11174 atomic_inc(&nohz.nr_cpus);
11177 * Ensures that if nohz_idle_balance() fails to observe our
11178 * @idle_cpus_mask store, it must observe the @has_blocked
11179 * and @needs_update stores.
11181 smp_mb__after_atomic();
11183 set_cpu_sd_state_idle(cpu);
11185 WRITE_ONCE(nohz.needs_update, 1);
11188 * Each time a cpu enter idle, we assume that it has blocked load and
11189 * enable the periodic update of the load of idle cpus
11191 WRITE_ONCE(nohz.has_blocked, 1);
11194 static bool update_nohz_stats(struct rq *rq)
11196 unsigned int cpu = rq->cpu;
11198 if (!rq->has_blocked_load)
11201 if (!cpumask_test_cpu(cpu, nohz.idle_cpus_mask))
11204 if (!time_after(jiffies, READ_ONCE(rq->last_blocked_load_update_tick)))
11207 update_blocked_averages(cpu);
11209 return rq->has_blocked_load;
11213 * Internal function that runs load balance for all idle cpus. The load balance
11214 * can be a simple update of blocked load or a complete load balance with
11215 * tasks movement depending of flags.
11217 static void _nohz_idle_balance(struct rq *this_rq, unsigned int flags)
11219 /* Earliest time when we have to do rebalance again */
11220 unsigned long now = jiffies;
11221 unsigned long next_balance = now + 60*HZ;
11222 bool has_blocked_load = false;
11223 int update_next_balance = 0;
11224 int this_cpu = this_rq->cpu;
11228 SCHED_WARN_ON((flags & NOHZ_KICK_MASK) == NOHZ_BALANCE_KICK);
11231 * We assume there will be no idle load after this update and clear
11232 * the has_blocked flag. If a cpu enters idle in the mean time, it will
11233 * set the has_blocked flag and trigger another update of idle load.
11234 * Because a cpu that becomes idle, is added to idle_cpus_mask before
11235 * setting the flag, we are sure to not clear the state and not
11236 * check the load of an idle cpu.
11238 * Same applies to idle_cpus_mask vs needs_update.
11240 if (flags & NOHZ_STATS_KICK)
11241 WRITE_ONCE(nohz.has_blocked, 0);
11242 if (flags & NOHZ_NEXT_KICK)
11243 WRITE_ONCE(nohz.needs_update, 0);
11246 * Ensures that if we miss the CPU, we must see the has_blocked
11247 * store from nohz_balance_enter_idle().
11252 * Start with the next CPU after this_cpu so we will end with this_cpu and let a
11253 * chance for other idle cpu to pull load.
11255 for_each_cpu_wrap(balance_cpu, nohz.idle_cpus_mask, this_cpu+1) {
11256 if (!idle_cpu(balance_cpu))
11260 * If this CPU gets work to do, stop the load balancing
11261 * work being done for other CPUs. Next load
11262 * balancing owner will pick it up.
11264 if (need_resched()) {
11265 if (flags & NOHZ_STATS_KICK)
11266 has_blocked_load = true;
11267 if (flags & NOHZ_NEXT_KICK)
11268 WRITE_ONCE(nohz.needs_update, 1);
11272 rq = cpu_rq(balance_cpu);
11274 if (flags & NOHZ_STATS_KICK)
11275 has_blocked_load |= update_nohz_stats(rq);
11278 * If time for next balance is due,
11281 if (time_after_eq(jiffies, rq->next_balance)) {
11282 struct rq_flags rf;
11284 rq_lock_irqsave(rq, &rf);
11285 update_rq_clock(rq);
11286 rq_unlock_irqrestore(rq, &rf);
11288 if (flags & NOHZ_BALANCE_KICK)
11289 rebalance_domains(rq, CPU_IDLE);
11292 if (time_after(next_balance, rq->next_balance)) {
11293 next_balance = rq->next_balance;
11294 update_next_balance = 1;
11299 * next_balance will be updated only when there is a need.
11300 * When the CPU is attached to null domain for ex, it will not be
11303 if (likely(update_next_balance))
11304 nohz.next_balance = next_balance;
11306 if (flags & NOHZ_STATS_KICK)
11307 WRITE_ONCE(nohz.next_blocked,
11308 now + msecs_to_jiffies(LOAD_AVG_PERIOD));
11311 /* There is still blocked load, enable periodic update */
11312 if (has_blocked_load)
11313 WRITE_ONCE(nohz.has_blocked, 1);
11317 * In CONFIG_NO_HZ_COMMON case, the idle balance kickee will do the
11318 * rebalancing for all the cpus for whom scheduler ticks are stopped.
11320 static bool nohz_idle_balance(struct rq *this_rq, enum cpu_idle_type idle)
11322 unsigned int flags = this_rq->nohz_idle_balance;
11327 this_rq->nohz_idle_balance = 0;
11329 if (idle != CPU_IDLE)
11332 _nohz_idle_balance(this_rq, flags);
11338 * Check if we need to run the ILB for updating blocked load before entering
11341 void nohz_run_idle_balance(int cpu)
11343 unsigned int flags;
11345 flags = atomic_fetch_andnot(NOHZ_NEWILB_KICK, nohz_flags(cpu));
11348 * Update the blocked load only if no SCHED_SOFTIRQ is about to happen
11349 * (ie NOHZ_STATS_KICK set) and will do the same.
11351 if ((flags == NOHZ_NEWILB_KICK) && !need_resched())
11352 _nohz_idle_balance(cpu_rq(cpu), NOHZ_STATS_KICK);
11355 static void nohz_newidle_balance(struct rq *this_rq)
11357 int this_cpu = this_rq->cpu;
11360 * This CPU doesn't want to be disturbed by scheduler
11363 if (!housekeeping_cpu(this_cpu, HK_TYPE_SCHED))
11366 /* Will wake up very soon. No time for doing anything else*/
11367 if (this_rq->avg_idle < sysctl_sched_migration_cost)
11370 /* Don't need to update blocked load of idle CPUs*/
11371 if (!READ_ONCE(nohz.has_blocked) ||
11372 time_before(jiffies, READ_ONCE(nohz.next_blocked)))
11376 * Set the need to trigger ILB in order to update blocked load
11377 * before entering idle state.
11379 atomic_or(NOHZ_NEWILB_KICK, nohz_flags(this_cpu));
11382 #else /* !CONFIG_NO_HZ_COMMON */
11383 static inline void nohz_balancer_kick(struct rq *rq) { }
11385 static inline bool nohz_idle_balance(struct rq *this_rq, enum cpu_idle_type idle)
11390 static inline void nohz_newidle_balance(struct rq *this_rq) { }
11391 #endif /* CONFIG_NO_HZ_COMMON */
11394 * newidle_balance is called by schedule() if this_cpu is about to become
11395 * idle. Attempts to pull tasks from other CPUs.
11398 * < 0 - we released the lock and there are !fair tasks present
11399 * 0 - failed, no new tasks
11400 * > 0 - success, new (fair) tasks present
11402 static int newidle_balance(struct rq *this_rq, struct rq_flags *rf)
11404 unsigned long next_balance = jiffies + HZ;
11405 int this_cpu = this_rq->cpu;
11406 u64 t0, t1, curr_cost = 0;
11407 struct sched_domain *sd;
11408 int pulled_task = 0;
11410 update_misfit_status(NULL, this_rq);
11413 * There is a task waiting to run. No need to search for one.
11414 * Return 0; the task will be enqueued when switching to idle.
11416 if (this_rq->ttwu_pending)
11420 * We must set idle_stamp _before_ calling idle_balance(), such that we
11421 * measure the duration of idle_balance() as idle time.
11423 this_rq->idle_stamp = rq_clock(this_rq);
11426 * Do not pull tasks towards !active CPUs...
11428 if (!cpu_active(this_cpu))
11432 * This is OK, because current is on_cpu, which avoids it being picked
11433 * for load-balance and preemption/IRQs are still disabled avoiding
11434 * further scheduler activity on it and we're being very careful to
11435 * re-start the picking loop.
11437 rq_unpin_lock(this_rq, rf);
11440 sd = rcu_dereference_check_sched_domain(this_rq->sd);
11442 if (!READ_ONCE(this_rq->rd->overload) ||
11443 (sd && this_rq->avg_idle < sd->max_newidle_lb_cost)) {
11446 update_next_balance(sd, &next_balance);
11453 raw_spin_rq_unlock(this_rq);
11455 t0 = sched_clock_cpu(this_cpu);
11456 update_blocked_averages(this_cpu);
11459 for_each_domain(this_cpu, sd) {
11460 int continue_balancing = 1;
11463 update_next_balance(sd, &next_balance);
11465 if (this_rq->avg_idle < curr_cost + sd->max_newidle_lb_cost)
11468 if (sd->flags & SD_BALANCE_NEWIDLE) {
11470 pulled_task = load_balance(this_cpu, this_rq,
11471 sd, CPU_NEWLY_IDLE,
11472 &continue_balancing);
11474 t1 = sched_clock_cpu(this_cpu);
11475 domain_cost = t1 - t0;
11476 update_newidle_cost(sd, domain_cost);
11478 curr_cost += domain_cost;
11483 * Stop searching for tasks to pull if there are
11484 * now runnable tasks on this rq.
11486 if (pulled_task || this_rq->nr_running > 0 ||
11487 this_rq->ttwu_pending)
11492 raw_spin_rq_lock(this_rq);
11494 if (curr_cost > this_rq->max_idle_balance_cost)
11495 this_rq->max_idle_balance_cost = curr_cost;
11498 * While browsing the domains, we released the rq lock, a task could
11499 * have been enqueued in the meantime. Since we're not going idle,
11500 * pretend we pulled a task.
11502 if (this_rq->cfs.h_nr_running && !pulled_task)
11505 /* Is there a task of a high priority class? */
11506 if (this_rq->nr_running != this_rq->cfs.h_nr_running)
11510 /* Move the next balance forward */
11511 if (time_after(this_rq->next_balance, next_balance))
11512 this_rq->next_balance = next_balance;
11515 this_rq->idle_stamp = 0;
11517 nohz_newidle_balance(this_rq);
11519 rq_repin_lock(this_rq, rf);
11521 return pulled_task;
11525 * run_rebalance_domains is triggered when needed from the scheduler tick.
11526 * Also triggered for nohz idle balancing (with nohz_balancing_kick set).
11528 static __latent_entropy void run_rebalance_domains(struct softirq_action *h)
11530 struct rq *this_rq = this_rq();
11531 enum cpu_idle_type idle = this_rq->idle_balance ?
11532 CPU_IDLE : CPU_NOT_IDLE;
11535 * If this CPU has a pending nohz_balance_kick, then do the
11536 * balancing on behalf of the other idle CPUs whose ticks are
11537 * stopped. Do nohz_idle_balance *before* rebalance_domains to
11538 * give the idle CPUs a chance to load balance. Else we may
11539 * load balance only within the local sched_domain hierarchy
11540 * and abort nohz_idle_balance altogether if we pull some load.
11542 if (nohz_idle_balance(this_rq, idle))
11545 /* normal load balance */
11546 update_blocked_averages(this_rq->cpu);
11547 rebalance_domains(this_rq, idle);
11551 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
11553 void trigger_load_balance(struct rq *rq)
11556 * Don't need to rebalance while attached to NULL domain or
11557 * runqueue CPU is not active
11559 if (unlikely(on_null_domain(rq) || !cpu_active(cpu_of(rq))))
11562 if (time_after_eq(jiffies, rq->next_balance))
11563 raise_softirq(SCHED_SOFTIRQ);
11565 nohz_balancer_kick(rq);
11568 static void rq_online_fair(struct rq *rq)
11572 update_runtime_enabled(rq);
11575 static void rq_offline_fair(struct rq *rq)
11579 /* Ensure any throttled groups are reachable by pick_next_task */
11580 unthrottle_offline_cfs_rqs(rq);
11583 #endif /* CONFIG_SMP */
11585 #ifdef CONFIG_SCHED_CORE
11587 __entity_slice_used(struct sched_entity *se, int min_nr_tasks)
11589 u64 slice = sched_slice(cfs_rq_of(se), se);
11590 u64 rtime = se->sum_exec_runtime - se->prev_sum_exec_runtime;
11592 return (rtime * min_nr_tasks > slice);
11595 #define MIN_NR_TASKS_DURING_FORCEIDLE 2
11596 static inline void task_tick_core(struct rq *rq, struct task_struct *curr)
11598 if (!sched_core_enabled(rq))
11602 * If runqueue has only one task which used up its slice and
11603 * if the sibling is forced idle, then trigger schedule to
11604 * give forced idle task a chance.
11606 * sched_slice() considers only this active rq and it gets the
11607 * whole slice. But during force idle, we have siblings acting
11608 * like a single runqueue and hence we need to consider runnable
11609 * tasks on this CPU and the forced idle CPU. Ideally, we should
11610 * go through the forced idle rq, but that would be a perf hit.
11611 * We can assume that the forced idle CPU has at least
11612 * MIN_NR_TASKS_DURING_FORCEIDLE - 1 tasks and use that to check
11613 * if we need to give up the CPU.
11615 if (rq->core->core_forceidle_count && rq->cfs.nr_running == 1 &&
11616 __entity_slice_used(&curr->se, MIN_NR_TASKS_DURING_FORCEIDLE))
11621 * se_fi_update - Update the cfs_rq->min_vruntime_fi in a CFS hierarchy if needed.
11623 static void se_fi_update(struct sched_entity *se, unsigned int fi_seq, bool forceidle)
11625 for_each_sched_entity(se) {
11626 struct cfs_rq *cfs_rq = cfs_rq_of(se);
11629 if (cfs_rq->forceidle_seq == fi_seq)
11631 cfs_rq->forceidle_seq = fi_seq;
11634 cfs_rq->min_vruntime_fi = cfs_rq->min_vruntime;
11638 void task_vruntime_update(struct rq *rq, struct task_struct *p, bool in_fi)
11640 struct sched_entity *se = &p->se;
11642 if (p->sched_class != &fair_sched_class)
11645 se_fi_update(se, rq->core->core_forceidle_seq, in_fi);
11648 bool cfs_prio_less(struct task_struct *a, struct task_struct *b, bool in_fi)
11650 struct rq *rq = task_rq(a);
11651 struct sched_entity *sea = &a->se;
11652 struct sched_entity *seb = &b->se;
11653 struct cfs_rq *cfs_rqa;
11654 struct cfs_rq *cfs_rqb;
11657 SCHED_WARN_ON(task_rq(b)->core != rq->core);
11659 #ifdef CONFIG_FAIR_GROUP_SCHED
11661 * Find an se in the hierarchy for tasks a and b, such that the se's
11662 * are immediate siblings.
11664 while (sea->cfs_rq->tg != seb->cfs_rq->tg) {
11665 int sea_depth = sea->depth;
11666 int seb_depth = seb->depth;
11668 if (sea_depth >= seb_depth)
11669 sea = parent_entity(sea);
11670 if (sea_depth <= seb_depth)
11671 seb = parent_entity(seb);
11674 se_fi_update(sea, rq->core->core_forceidle_seq, in_fi);
11675 se_fi_update(seb, rq->core->core_forceidle_seq, in_fi);
11677 cfs_rqa = sea->cfs_rq;
11678 cfs_rqb = seb->cfs_rq;
11680 cfs_rqa = &task_rq(a)->cfs;
11681 cfs_rqb = &task_rq(b)->cfs;
11685 * Find delta after normalizing se's vruntime with its cfs_rq's
11686 * min_vruntime_fi, which would have been updated in prior calls
11687 * to se_fi_update().
11689 delta = (s64)(sea->vruntime - seb->vruntime) +
11690 (s64)(cfs_rqb->min_vruntime_fi - cfs_rqa->min_vruntime_fi);
11695 static inline void task_tick_core(struct rq *rq, struct task_struct *curr) {}
11699 * scheduler tick hitting a task of our scheduling class.
11701 * NOTE: This function can be called remotely by the tick offload that
11702 * goes along full dynticks. Therefore no local assumption can be made
11703 * and everything must be accessed through the @rq and @curr passed in
11706 static void task_tick_fair(struct rq *rq, struct task_struct *curr, int queued)
11708 struct cfs_rq *cfs_rq;
11709 struct sched_entity *se = &curr->se;
11711 for_each_sched_entity(se) {
11712 cfs_rq = cfs_rq_of(se);
11713 entity_tick(cfs_rq, se, queued);
11716 if (static_branch_unlikely(&sched_numa_balancing))
11717 task_tick_numa(rq, curr);
11719 update_misfit_status(curr, rq);
11720 update_overutilized_status(task_rq(curr));
11722 task_tick_core(rq, curr);
11726 * called on fork with the child task as argument from the parent's context
11727 * - child not yet on the tasklist
11728 * - preemption disabled
11730 static void task_fork_fair(struct task_struct *p)
11732 struct cfs_rq *cfs_rq;
11733 struct sched_entity *se = &p->se, *curr;
11734 struct rq *rq = this_rq();
11735 struct rq_flags rf;
11738 update_rq_clock(rq);
11740 cfs_rq = task_cfs_rq(current);
11741 curr = cfs_rq->curr;
11743 update_curr(cfs_rq);
11744 se->vruntime = curr->vruntime;
11746 place_entity(cfs_rq, se, 1);
11748 if (sysctl_sched_child_runs_first && curr && entity_before(curr, se)) {
11750 * Upon rescheduling, sched_class::put_prev_task() will place
11751 * 'current' within the tree based on its new key value.
11753 swap(curr->vruntime, se->vruntime);
11757 se->vruntime -= cfs_rq->min_vruntime;
11758 rq_unlock(rq, &rf);
11762 * Priority of the task has changed. Check to see if we preempt
11763 * the current task.
11766 prio_changed_fair(struct rq *rq, struct task_struct *p, int oldprio)
11768 if (!task_on_rq_queued(p))
11771 if (rq->cfs.nr_running == 1)
11775 * Reschedule if we are currently running on this runqueue and
11776 * our priority decreased, or if we are not currently running on
11777 * this runqueue and our priority is higher than the current's
11779 if (task_current(rq, p)) {
11780 if (p->prio > oldprio)
11783 check_preempt_curr(rq, p, 0);
11786 static inline bool vruntime_normalized(struct task_struct *p)
11788 struct sched_entity *se = &p->se;
11791 * In both the TASK_ON_RQ_QUEUED and TASK_ON_RQ_MIGRATING cases,
11792 * the dequeue_entity(.flags=0) will already have normalized the
11799 * When !on_rq, vruntime of the task has usually NOT been normalized.
11800 * But there are some cases where it has already been normalized:
11802 * - A forked child which is waiting for being woken up by
11803 * wake_up_new_task().
11804 * - A task which has been woken up by try_to_wake_up() and
11805 * waiting for actually being woken up by sched_ttwu_pending().
11807 if (!se->sum_exec_runtime ||
11808 (READ_ONCE(p->__state) == TASK_WAKING && p->sched_remote_wakeup))
11814 #ifdef CONFIG_FAIR_GROUP_SCHED
11816 * Propagate the changes of the sched_entity across the tg tree to make it
11817 * visible to the root
11819 static void propagate_entity_cfs_rq(struct sched_entity *se)
11821 struct cfs_rq *cfs_rq = cfs_rq_of(se);
11823 if (cfs_rq_throttled(cfs_rq))
11826 if (!throttled_hierarchy(cfs_rq))
11827 list_add_leaf_cfs_rq(cfs_rq);
11829 /* Start to propagate at parent */
11832 for_each_sched_entity(se) {
11833 cfs_rq = cfs_rq_of(se);
11835 update_load_avg(cfs_rq, se, UPDATE_TG);
11837 if (cfs_rq_throttled(cfs_rq))
11840 if (!throttled_hierarchy(cfs_rq))
11841 list_add_leaf_cfs_rq(cfs_rq);
11845 static void propagate_entity_cfs_rq(struct sched_entity *se) { }
11848 static void detach_entity_cfs_rq(struct sched_entity *se)
11850 struct cfs_rq *cfs_rq = cfs_rq_of(se);
11854 * In case the task sched_avg hasn't been attached:
11855 * - A forked task which hasn't been woken up by wake_up_new_task().
11856 * - A task which has been woken up by try_to_wake_up() but is
11857 * waiting for actually being woken up by sched_ttwu_pending().
11859 if (!se->avg.last_update_time)
11863 /* Catch up with the cfs_rq and remove our load when we leave */
11864 update_load_avg(cfs_rq, se, 0);
11865 detach_entity_load_avg(cfs_rq, se);
11866 update_tg_load_avg(cfs_rq);
11867 propagate_entity_cfs_rq(se);
11870 static void attach_entity_cfs_rq(struct sched_entity *se)
11872 struct cfs_rq *cfs_rq = cfs_rq_of(se);
11874 /* Synchronize entity with its cfs_rq */
11875 update_load_avg(cfs_rq, se, sched_feat(ATTACH_AGE_LOAD) ? 0 : SKIP_AGE_LOAD);
11876 attach_entity_load_avg(cfs_rq, se);
11877 update_tg_load_avg(cfs_rq);
11878 propagate_entity_cfs_rq(se);
11881 static void detach_task_cfs_rq(struct task_struct *p)
11883 struct sched_entity *se = &p->se;
11884 struct cfs_rq *cfs_rq = cfs_rq_of(se);
11886 if (!vruntime_normalized(p)) {
11888 * Fix up our vruntime so that the current sleep doesn't
11889 * cause 'unlimited' sleep bonus.
11891 place_entity(cfs_rq, se, 0);
11892 se->vruntime -= cfs_rq->min_vruntime;
11895 detach_entity_cfs_rq(se);
11898 static void attach_task_cfs_rq(struct task_struct *p)
11900 struct sched_entity *se = &p->se;
11901 struct cfs_rq *cfs_rq = cfs_rq_of(se);
11903 attach_entity_cfs_rq(se);
11905 if (!vruntime_normalized(p))
11906 se->vruntime += cfs_rq->min_vruntime;
11909 static void switched_from_fair(struct rq *rq, struct task_struct *p)
11911 detach_task_cfs_rq(p);
11914 static void switched_to_fair(struct rq *rq, struct task_struct *p)
11916 attach_task_cfs_rq(p);
11918 if (task_on_rq_queued(p)) {
11920 * We were most likely switched from sched_rt, so
11921 * kick off the schedule if running, otherwise just see
11922 * if we can still preempt the current task.
11924 if (task_current(rq, p))
11927 check_preempt_curr(rq, p, 0);
11931 /* Account for a task changing its policy or group.
11933 * This routine is mostly called to set cfs_rq->curr field when a task
11934 * migrates between groups/classes.
11936 static void set_next_task_fair(struct rq *rq, struct task_struct *p, bool first)
11938 struct sched_entity *se = &p->se;
11941 if (task_on_rq_queued(p)) {
11943 * Move the next running task to the front of the list, so our
11944 * cfs_tasks list becomes MRU one.
11946 list_move(&se->group_node, &rq->cfs_tasks);
11950 for_each_sched_entity(se) {
11951 struct cfs_rq *cfs_rq = cfs_rq_of(se);
11953 set_next_entity(cfs_rq, se);
11954 /* ensure bandwidth has been allocated on our new cfs_rq */
11955 account_cfs_rq_runtime(cfs_rq, 0);
11959 void init_cfs_rq(struct cfs_rq *cfs_rq)
11961 cfs_rq->tasks_timeline = RB_ROOT_CACHED;
11962 u64_u32_store(cfs_rq->min_vruntime, (u64)(-(1LL << 20)));
11964 raw_spin_lock_init(&cfs_rq->removed.lock);
11968 #ifdef CONFIG_FAIR_GROUP_SCHED
11969 static void task_change_group_fair(struct task_struct *p)
11972 * We couldn't detach or attach a forked task which
11973 * hasn't been woken up by wake_up_new_task().
11975 if (READ_ONCE(p->__state) == TASK_NEW)
11978 detach_task_cfs_rq(p);
11981 /* Tell se's cfs_rq has been changed -- migrated */
11982 p->se.avg.last_update_time = 0;
11984 set_task_rq(p, task_cpu(p));
11985 attach_task_cfs_rq(p);
11988 void free_fair_sched_group(struct task_group *tg)
11992 for_each_possible_cpu(i) {
11994 kfree(tg->cfs_rq[i]);
12003 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
12005 struct sched_entity *se;
12006 struct cfs_rq *cfs_rq;
12009 tg->cfs_rq = kcalloc(nr_cpu_ids, sizeof(cfs_rq), GFP_KERNEL);
12012 tg->se = kcalloc(nr_cpu_ids, sizeof(se), GFP_KERNEL);
12016 tg->shares = NICE_0_LOAD;
12018 init_cfs_bandwidth(tg_cfs_bandwidth(tg));
12020 for_each_possible_cpu(i) {
12021 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
12022 GFP_KERNEL, cpu_to_node(i));
12026 se = kzalloc_node(sizeof(struct sched_entity_stats),
12027 GFP_KERNEL, cpu_to_node(i));
12031 init_cfs_rq(cfs_rq);
12032 init_tg_cfs_entry(tg, cfs_rq, se, i, parent->se[i]);
12033 init_entity_runnable_average(se);
12044 void online_fair_sched_group(struct task_group *tg)
12046 struct sched_entity *se;
12047 struct rq_flags rf;
12051 for_each_possible_cpu(i) {
12054 rq_lock_irq(rq, &rf);
12055 update_rq_clock(rq);
12056 attach_entity_cfs_rq(se);
12057 sync_throttle(tg, i);
12058 rq_unlock_irq(rq, &rf);
12062 void unregister_fair_sched_group(struct task_group *tg)
12064 unsigned long flags;
12068 destroy_cfs_bandwidth(tg_cfs_bandwidth(tg));
12070 for_each_possible_cpu(cpu) {
12072 remove_entity_load_avg(tg->se[cpu]);
12075 * Only empty task groups can be destroyed; so we can speculatively
12076 * check on_list without danger of it being re-added.
12078 if (!tg->cfs_rq[cpu]->on_list)
12083 raw_spin_rq_lock_irqsave(rq, flags);
12084 list_del_leaf_cfs_rq(tg->cfs_rq[cpu]);
12085 raw_spin_rq_unlock_irqrestore(rq, flags);
12089 void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
12090 struct sched_entity *se, int cpu,
12091 struct sched_entity *parent)
12093 struct rq *rq = cpu_rq(cpu);
12097 init_cfs_rq_runtime(cfs_rq);
12099 tg->cfs_rq[cpu] = cfs_rq;
12102 /* se could be NULL for root_task_group */
12107 se->cfs_rq = &rq->cfs;
12110 se->cfs_rq = parent->my_q;
12111 se->depth = parent->depth + 1;
12115 /* guarantee group entities always have weight */
12116 update_load_set(&se->load, NICE_0_LOAD);
12117 se->parent = parent;
12120 static DEFINE_MUTEX(shares_mutex);
12122 static int __sched_group_set_shares(struct task_group *tg, unsigned long shares)
12126 lockdep_assert_held(&shares_mutex);
12129 * We can't change the weight of the root cgroup.
12134 shares = clamp(shares, scale_load(MIN_SHARES), scale_load(MAX_SHARES));
12136 if (tg->shares == shares)
12139 tg->shares = shares;
12140 for_each_possible_cpu(i) {
12141 struct rq *rq = cpu_rq(i);
12142 struct sched_entity *se = tg->se[i];
12143 struct rq_flags rf;
12145 /* Propagate contribution to hierarchy */
12146 rq_lock_irqsave(rq, &rf);
12147 update_rq_clock(rq);
12148 for_each_sched_entity(se) {
12149 update_load_avg(cfs_rq_of(se), se, UPDATE_TG);
12150 update_cfs_group(se);
12152 rq_unlock_irqrestore(rq, &rf);
12158 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
12162 mutex_lock(&shares_mutex);
12163 if (tg_is_idle(tg))
12166 ret = __sched_group_set_shares(tg, shares);
12167 mutex_unlock(&shares_mutex);
12172 int sched_group_set_idle(struct task_group *tg, long idle)
12176 if (tg == &root_task_group)
12179 if (idle < 0 || idle > 1)
12182 mutex_lock(&shares_mutex);
12184 if (tg->idle == idle) {
12185 mutex_unlock(&shares_mutex);
12191 for_each_possible_cpu(i) {
12192 struct rq *rq = cpu_rq(i);
12193 struct sched_entity *se = tg->se[i];
12194 struct cfs_rq *parent_cfs_rq, *grp_cfs_rq = tg->cfs_rq[i];
12195 bool was_idle = cfs_rq_is_idle(grp_cfs_rq);
12196 long idle_task_delta;
12197 struct rq_flags rf;
12199 rq_lock_irqsave(rq, &rf);
12201 grp_cfs_rq->idle = idle;
12202 if (WARN_ON_ONCE(was_idle == cfs_rq_is_idle(grp_cfs_rq)))
12206 parent_cfs_rq = cfs_rq_of(se);
12207 if (cfs_rq_is_idle(grp_cfs_rq))
12208 parent_cfs_rq->idle_nr_running++;
12210 parent_cfs_rq->idle_nr_running--;
12213 idle_task_delta = grp_cfs_rq->h_nr_running -
12214 grp_cfs_rq->idle_h_nr_running;
12215 if (!cfs_rq_is_idle(grp_cfs_rq))
12216 idle_task_delta *= -1;
12218 for_each_sched_entity(se) {
12219 struct cfs_rq *cfs_rq = cfs_rq_of(se);
12224 cfs_rq->idle_h_nr_running += idle_task_delta;
12226 /* Already accounted at parent level and above. */
12227 if (cfs_rq_is_idle(cfs_rq))
12232 rq_unlock_irqrestore(rq, &rf);
12235 /* Idle groups have minimum weight. */
12236 if (tg_is_idle(tg))
12237 __sched_group_set_shares(tg, scale_load(WEIGHT_IDLEPRIO));
12239 __sched_group_set_shares(tg, NICE_0_LOAD);
12241 mutex_unlock(&shares_mutex);
12245 #else /* CONFIG_FAIR_GROUP_SCHED */
12247 void free_fair_sched_group(struct task_group *tg) { }
12249 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
12254 void online_fair_sched_group(struct task_group *tg) { }
12256 void unregister_fair_sched_group(struct task_group *tg) { }
12258 #endif /* CONFIG_FAIR_GROUP_SCHED */
12261 static unsigned int get_rr_interval_fair(struct rq *rq, struct task_struct *task)
12263 struct sched_entity *se = &task->se;
12264 unsigned int rr_interval = 0;
12267 * Time slice is 0 for SCHED_OTHER tasks that are on an otherwise
12270 if (rq->cfs.load.weight)
12271 rr_interval = NS_TO_JIFFIES(sched_slice(cfs_rq_of(se), se));
12273 return rr_interval;
12277 * All the scheduling class methods:
12279 DEFINE_SCHED_CLASS(fair) = {
12281 .enqueue_task = enqueue_task_fair,
12282 .dequeue_task = dequeue_task_fair,
12283 .yield_task = yield_task_fair,
12284 .yield_to_task = yield_to_task_fair,
12286 .check_preempt_curr = check_preempt_wakeup,
12288 .pick_next_task = __pick_next_task_fair,
12289 .put_prev_task = put_prev_task_fair,
12290 .set_next_task = set_next_task_fair,
12293 .balance = balance_fair,
12294 .pick_task = pick_task_fair,
12295 .select_task_rq = select_task_rq_fair,
12296 .migrate_task_rq = migrate_task_rq_fair,
12298 .rq_online = rq_online_fair,
12299 .rq_offline = rq_offline_fair,
12301 .task_dead = task_dead_fair,
12302 .set_cpus_allowed = set_cpus_allowed_common,
12305 .task_tick = task_tick_fair,
12306 .task_fork = task_fork_fair,
12308 .prio_changed = prio_changed_fair,
12309 .switched_from = switched_from_fair,
12310 .switched_to = switched_to_fair,
12312 .get_rr_interval = get_rr_interval_fair,
12314 .update_curr = update_curr_fair,
12316 #ifdef CONFIG_FAIR_GROUP_SCHED
12317 .task_change_group = task_change_group_fair,
12320 #ifdef CONFIG_UCLAMP_TASK
12321 .uclamp_enabled = 1,
12325 #ifdef CONFIG_SCHED_DEBUG
12326 void print_cfs_stats(struct seq_file *m, int cpu)
12328 struct cfs_rq *cfs_rq, *pos;
12331 for_each_leaf_cfs_rq_safe(cpu_rq(cpu), cfs_rq, pos)
12332 print_cfs_rq(m, cpu, cfs_rq);
12336 #ifdef CONFIG_NUMA_BALANCING
12337 void show_numa_stats(struct task_struct *p, struct seq_file *m)
12340 unsigned long tsf = 0, tpf = 0, gsf = 0, gpf = 0;
12341 struct numa_group *ng;
12344 ng = rcu_dereference(p->numa_group);
12345 for_each_online_node(node) {
12346 if (p->numa_faults) {
12347 tsf = p->numa_faults[task_faults_idx(NUMA_MEM, node, 0)];
12348 tpf = p->numa_faults[task_faults_idx(NUMA_MEM, node, 1)];
12351 gsf = ng->faults[task_faults_idx(NUMA_MEM, node, 0)],
12352 gpf = ng->faults[task_faults_idx(NUMA_MEM, node, 1)];
12354 print_numa_stats(m, node, tsf, tpf, gsf, gpf);
12358 #endif /* CONFIG_NUMA_BALANCING */
12359 #endif /* CONFIG_SCHED_DEBUG */
12361 __init void init_sched_fair_class(void)
12366 for_each_possible_cpu(i) {
12367 zalloc_cpumask_var_node(&per_cpu(load_balance_mask, i), GFP_KERNEL, cpu_to_node(i));
12368 zalloc_cpumask_var_node(&per_cpu(select_rq_mask, i), GFP_KERNEL, cpu_to_node(i));
12371 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
12373 #ifdef CONFIG_NO_HZ_COMMON
12374 nohz.next_balance = jiffies;
12375 nohz.next_blocked = jiffies;
12376 zalloc_cpumask_var(&nohz.idle_cpus_mask, GFP_NOWAIT);