2 * Completely Fair Scheduling (CFS) Class (SCHED_NORMAL/SCHED_BATCH)
4 * Copyright (C) 2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
6 * Interactivity improvements by Mike Galbraith
7 * (C) 2007 Mike Galbraith <efault@gmx.de>
9 * Various enhancements by Dmitry Adamushko.
10 * (C) 2007 Dmitry Adamushko <dmitry.adamushko@gmail.com>
12 * Group scheduling enhancements by Srivatsa Vaddagiri
13 * Copyright IBM Corporation, 2007
14 * Author: Srivatsa Vaddagiri <vatsa@linux.vnet.ibm.com>
16 * Scaled math optimizations by Thomas Gleixner
17 * Copyright (C) 2007, Thomas Gleixner <tglx@linutronix.de>
19 * Adaptive scheduling granularity, math enhancements by Peter Zijlstra
20 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
23 #include <linux/latencytop.h>
26 * Targeted preemption latency for CPU-bound tasks:
27 * (default: 20ms * (1 + ilog(ncpus)), units: nanoseconds)
29 * NOTE: this latency value is not the same as the concept of
30 * 'timeslice length' - timeslices in CFS are of variable length
31 * and have no persistent notion like in traditional, time-slice
32 * based scheduling concepts.
34 * (to see the precise effective timeslice length of your workload,
35 * run vmstat and monitor the context-switches (cs) field)
37 unsigned int sysctl_sched_latency = 20000000ULL;
40 * Minimal preemption granularity for CPU-bound tasks:
41 * (default: 4 msec * (1 + ilog(ncpus)), units: nanoseconds)
43 unsigned int sysctl_sched_min_granularity = 4000000ULL;
46 * is kept at sysctl_sched_latency / sysctl_sched_min_granularity
48 static unsigned int sched_nr_latency = 5;
51 * After fork, child runs first. (default) If set to 0 then
52 * parent will (try to) run first.
54 const_debug unsigned int sysctl_sched_child_runs_first = 1;
57 * sys_sched_yield() compat mode
59 * This option switches the agressive yield implementation of the
60 * old scheduler back on.
62 unsigned int __read_mostly sysctl_sched_compat_yield;
65 * SCHED_OTHER wake-up granularity.
66 * (default: 10 msec * (1 + ilog(ncpus)), units: nanoseconds)
68 * This option delays the preemption effects of decoupled workloads
69 * and reduces their over-scheduling. Synchronous workloads will still
70 * have immediate wakeup/sleep latencies.
72 unsigned int sysctl_sched_wakeup_granularity = 10000000UL;
74 const_debug unsigned int sysctl_sched_migration_cost = 500000UL;
76 /**************************************************************
77 * CFS operations on generic schedulable entities:
80 static inline struct task_struct *task_of(struct sched_entity *se)
82 return container_of(se, struct task_struct, se);
85 #ifdef CONFIG_FAIR_GROUP_SCHED
87 /* cpu runqueue to which this cfs_rq is attached */
88 static inline struct rq *rq_of(struct cfs_rq *cfs_rq)
93 /* An entity is a task if it doesn't "own" a runqueue */
94 #define entity_is_task(se) (!se->my_q)
96 /* Walk up scheduling entities hierarchy */
97 #define for_each_sched_entity(se) \
98 for (; se; se = se->parent)
100 static inline struct cfs_rq *task_cfs_rq(struct task_struct *p)
105 /* runqueue on which this entity is (to be) queued */
106 static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se)
111 /* runqueue "owned" by this group */
112 static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp)
117 /* Given a group's cfs_rq on one cpu, return its corresponding cfs_rq on
118 * another cpu ('this_cpu')
120 static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu)
122 return cfs_rq->tg->cfs_rq[this_cpu];
125 /* Iterate thr' all leaf cfs_rq's on a runqueue */
126 #define for_each_leaf_cfs_rq(rq, cfs_rq) \
127 list_for_each_entry_rcu(cfs_rq, &rq->leaf_cfs_rq_list, leaf_cfs_rq_list)
129 /* Do the two (enqueued) entities belong to the same group ? */
131 is_same_group(struct sched_entity *se, struct sched_entity *pse)
133 if (se->cfs_rq == pse->cfs_rq)
139 static inline struct sched_entity *parent_entity(struct sched_entity *se)
144 #else /* CONFIG_FAIR_GROUP_SCHED */
146 static inline struct rq *rq_of(struct cfs_rq *cfs_rq)
148 return container_of(cfs_rq, struct rq, cfs);
151 #define entity_is_task(se) 1
153 #define for_each_sched_entity(se) \
154 for (; se; se = NULL)
156 static inline struct cfs_rq *task_cfs_rq(struct task_struct *p)
158 return &task_rq(p)->cfs;
161 static inline struct cfs_rq *cfs_rq_of(struct sched_entity *se)
163 struct task_struct *p = task_of(se);
164 struct rq *rq = task_rq(p);
169 /* runqueue "owned" by this group */
170 static inline struct cfs_rq *group_cfs_rq(struct sched_entity *grp)
175 static inline struct cfs_rq *cpu_cfs_rq(struct cfs_rq *cfs_rq, int this_cpu)
177 return &cpu_rq(this_cpu)->cfs;
180 #define for_each_leaf_cfs_rq(rq, cfs_rq) \
181 for (cfs_rq = &rq->cfs; cfs_rq; cfs_rq = NULL)
184 is_same_group(struct sched_entity *se, struct sched_entity *pse)
189 static inline struct sched_entity *parent_entity(struct sched_entity *se)
194 #endif /* CONFIG_FAIR_GROUP_SCHED */
197 /**************************************************************
198 * Scheduling class tree data structure manipulation methods:
201 static inline u64 max_vruntime(u64 min_vruntime, u64 vruntime)
203 s64 delta = (s64)(vruntime - min_vruntime);
205 min_vruntime = vruntime;
210 static inline u64 min_vruntime(u64 min_vruntime, u64 vruntime)
212 s64 delta = (s64)(vruntime - min_vruntime);
214 min_vruntime = vruntime;
219 static inline s64 entity_key(struct cfs_rq *cfs_rq, struct sched_entity *se)
221 return se->vruntime - cfs_rq->min_vruntime;
225 * Enqueue an entity into the rb-tree:
227 static void __enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
229 struct rb_node **link = &cfs_rq->tasks_timeline.rb_node;
230 struct rb_node *parent = NULL;
231 struct sched_entity *entry;
232 s64 key = entity_key(cfs_rq, se);
236 * Find the right place in the rbtree:
240 entry = rb_entry(parent, struct sched_entity, run_node);
242 * We dont care about collisions. Nodes with
243 * the same key stay together.
245 if (key < entity_key(cfs_rq, entry)) {
246 link = &parent->rb_left;
248 link = &parent->rb_right;
254 * Maintain a cache of leftmost tree entries (it is frequently
258 cfs_rq->rb_leftmost = &se->run_node;
260 * maintain cfs_rq->min_vruntime to be a monotonic increasing
261 * value tracking the leftmost vruntime in the tree.
263 cfs_rq->min_vruntime =
264 max_vruntime(cfs_rq->min_vruntime, se->vruntime);
267 rb_link_node(&se->run_node, parent, link);
268 rb_insert_color(&se->run_node, &cfs_rq->tasks_timeline);
271 static void __dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
273 if (cfs_rq->rb_leftmost == &se->run_node) {
274 struct rb_node *next_node;
275 struct sched_entity *next;
277 next_node = rb_next(&se->run_node);
278 cfs_rq->rb_leftmost = next_node;
281 next = rb_entry(next_node,
282 struct sched_entity, run_node);
283 cfs_rq->min_vruntime =
284 max_vruntime(cfs_rq->min_vruntime,
289 if (cfs_rq->next == se)
292 rb_erase(&se->run_node, &cfs_rq->tasks_timeline);
295 static inline struct rb_node *first_fair(struct cfs_rq *cfs_rq)
297 return cfs_rq->rb_leftmost;
300 static struct sched_entity *__pick_next_entity(struct cfs_rq *cfs_rq)
302 return rb_entry(first_fair(cfs_rq), struct sched_entity, run_node);
305 static inline struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq)
307 struct rb_node *last = rb_last(&cfs_rq->tasks_timeline);
312 return rb_entry(last, struct sched_entity, run_node);
315 /**************************************************************
316 * Scheduling class statistics methods:
319 #ifdef CONFIG_SCHED_DEBUG
320 int sched_nr_latency_handler(struct ctl_table *table, int write,
321 struct file *filp, void __user *buffer, size_t *lenp,
324 int ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos);
329 sched_nr_latency = DIV_ROUND_UP(sysctl_sched_latency,
330 sysctl_sched_min_granularity);
339 static inline unsigned long
340 calc_delta_weight(unsigned long delta, struct sched_entity *se)
342 for_each_sched_entity(se) {
343 delta = calc_delta_mine(delta,
344 se->load.weight, &cfs_rq_of(se)->load);
353 static inline unsigned long
354 calc_delta_fair(unsigned long delta, struct sched_entity *se)
356 for_each_sched_entity(se) {
357 delta = calc_delta_mine(delta,
358 cfs_rq_of(se)->load.weight, &se->load);
365 * The idea is to set a period in which each task runs once.
367 * When there are too many tasks (sysctl_sched_nr_latency) we have to stretch
368 * this period because otherwise the slices get too small.
370 * p = (nr <= nl) ? l : l*nr/nl
372 static u64 __sched_period(unsigned long nr_running)
374 u64 period = sysctl_sched_latency;
375 unsigned long nr_latency = sched_nr_latency;
377 if (unlikely(nr_running > nr_latency)) {
378 period = sysctl_sched_min_granularity;
379 period *= nr_running;
386 * We calculate the wall-time slice from the period by taking a part
387 * proportional to the weight.
391 static u64 sched_slice(struct cfs_rq *cfs_rq, struct sched_entity *se)
393 return calc_delta_weight(__sched_period(cfs_rq->nr_running), se);
397 * We calculate the vruntime slice of a to be inserted task
401 static u64 sched_vslice_add(struct cfs_rq *cfs_rq, struct sched_entity *se)
403 unsigned long nr_running = cfs_rq->nr_running;
408 return __sched_period(nr_running);
412 * The goal of calc_delta_asym() is to be asymmetrically around NICE_0_LOAD, in
413 * that it favours >=0 over <0.
423 calc_delta_asym(unsigned long delta, struct sched_entity *se)
425 struct load_weight lw = {
426 .weight = NICE_0_LOAD,
427 .inv_weight = 1UL << (WMULT_SHIFT-NICE_0_SHIFT)
430 for_each_sched_entity(se) {
431 struct load_weight *se_lw = &se->load;
432 unsigned long rw = cfs_rq_of(se)->load.weight;
434 #ifdef CONFIG_FAIR_SCHED_GROUP
435 struct cfs_rq *cfs_rq = se->my_q;
436 struct task_group *tg = NULL
441 if (tg && tg->shares < NICE_0_LOAD) {
443 * scale shares to what it would have been had
444 * tg->weight been NICE_0_LOAD:
446 * weight = 1024 * shares / tg->weight
448 lw.weight *= se->load.weight;
449 lw.weight /= tg->shares;
454 rw += lw.weight - se->load.weight;
458 if (se->load.weight < NICE_0_LOAD) {
460 rw += NICE_0_LOAD - se->load.weight;
463 delta = calc_delta_mine(delta, rw, se_lw);
470 * Update the current task's runtime statistics. Skip current tasks that
471 * are not in our scheduling class.
474 __update_curr(struct cfs_rq *cfs_rq, struct sched_entity *curr,
475 unsigned long delta_exec)
477 unsigned long delta_exec_weighted;
479 schedstat_set(curr->exec_max, max((u64)delta_exec, curr->exec_max));
481 curr->sum_exec_runtime += delta_exec;
482 schedstat_add(cfs_rq, exec_clock, delta_exec);
483 delta_exec_weighted = calc_delta_fair(delta_exec, curr);
484 curr->vruntime += delta_exec_weighted;
487 static void update_curr(struct cfs_rq *cfs_rq)
489 struct sched_entity *curr = cfs_rq->curr;
490 u64 now = rq_of(cfs_rq)->clock;
491 unsigned long delta_exec;
497 * Get the amount of time the current task was running
498 * since the last time we changed load (this cannot
499 * overflow on 32 bits):
501 delta_exec = (unsigned long)(now - curr->exec_start);
503 __update_curr(cfs_rq, curr, delta_exec);
504 curr->exec_start = now;
506 if (entity_is_task(curr)) {
507 struct task_struct *curtask = task_of(curr);
509 cpuacct_charge(curtask, delta_exec);
514 update_stats_wait_start(struct cfs_rq *cfs_rq, struct sched_entity *se)
516 schedstat_set(se->wait_start, rq_of(cfs_rq)->clock);
520 * Task is being enqueued - update stats:
522 static void update_stats_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se)
525 * Are we enqueueing a waiting task? (for current tasks
526 * a dequeue/enqueue event is a NOP)
528 if (se != cfs_rq->curr)
529 update_stats_wait_start(cfs_rq, se);
533 update_stats_wait_end(struct cfs_rq *cfs_rq, struct sched_entity *se)
535 schedstat_set(se->wait_max, max(se->wait_max,
536 rq_of(cfs_rq)->clock - se->wait_start));
537 schedstat_set(se->wait_count, se->wait_count + 1);
538 schedstat_set(se->wait_sum, se->wait_sum +
539 rq_of(cfs_rq)->clock - se->wait_start);
540 schedstat_set(se->wait_start, 0);
544 update_stats_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se)
547 * Mark the end of the wait period if dequeueing a
550 if (se != cfs_rq->curr)
551 update_stats_wait_end(cfs_rq, se);
555 * We are picking a new current task - update its stats:
558 update_stats_curr_start(struct cfs_rq *cfs_rq, struct sched_entity *se)
561 * We are starting a new run period:
563 se->exec_start = rq_of(cfs_rq)->clock;
566 /**************************************************
567 * Scheduling class queueing methods:
570 #if defined CONFIG_SMP && defined CONFIG_FAIR_GROUP_SCHED
572 add_cfs_task_weight(struct cfs_rq *cfs_rq, unsigned long weight)
574 cfs_rq->task_weight += weight;
578 add_cfs_task_weight(struct cfs_rq *cfs_rq, unsigned long weight)
584 account_entity_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se)
586 update_load_add(&cfs_rq->load, se->load.weight);
587 if (!parent_entity(se))
588 inc_cpu_load(rq_of(cfs_rq), se->load.weight);
589 if (entity_is_task(se))
590 add_cfs_task_weight(cfs_rq, se->load.weight);
591 cfs_rq->nr_running++;
593 list_add(&se->group_node, &cfs_rq->tasks);
597 account_entity_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se)
599 update_load_sub(&cfs_rq->load, se->load.weight);
600 if (!parent_entity(se))
601 dec_cpu_load(rq_of(cfs_rq), se->load.weight);
602 if (entity_is_task(se))
603 add_cfs_task_weight(cfs_rq, -se->load.weight);
604 cfs_rq->nr_running--;
606 list_del_init(&se->group_node);
609 static void enqueue_sleeper(struct cfs_rq *cfs_rq, struct sched_entity *se)
611 #ifdef CONFIG_SCHEDSTATS
612 if (se->sleep_start) {
613 u64 delta = rq_of(cfs_rq)->clock - se->sleep_start;
614 struct task_struct *tsk = task_of(se);
619 if (unlikely(delta > se->sleep_max))
620 se->sleep_max = delta;
623 se->sum_sleep_runtime += delta;
625 account_scheduler_latency(tsk, delta >> 10, 1);
627 if (se->block_start) {
628 u64 delta = rq_of(cfs_rq)->clock - se->block_start;
629 struct task_struct *tsk = task_of(se);
634 if (unlikely(delta > se->block_max))
635 se->block_max = delta;
638 se->sum_sleep_runtime += delta;
641 * Blocking time is in units of nanosecs, so shift by 20 to
642 * get a milliseconds-range estimation of the amount of
643 * time that the task spent sleeping:
645 if (unlikely(prof_on == SLEEP_PROFILING)) {
647 profile_hits(SLEEP_PROFILING, (void *)get_wchan(tsk),
650 account_scheduler_latency(tsk, delta >> 10, 0);
655 static void check_spread(struct cfs_rq *cfs_rq, struct sched_entity *se)
657 #ifdef CONFIG_SCHED_DEBUG
658 s64 d = se->vruntime - cfs_rq->min_vruntime;
663 if (d > 3*sysctl_sched_latency)
664 schedstat_inc(cfs_rq, nr_spread_over);
669 place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int initial)
673 if (first_fair(cfs_rq)) {
674 vruntime = min_vruntime(cfs_rq->min_vruntime,
675 __pick_next_entity(cfs_rq)->vruntime);
677 vruntime = cfs_rq->min_vruntime;
680 * The 'current' period is already promised to the current tasks,
681 * however the extra weight of the new task will slow them down a
682 * little, place the new task so that it fits in the slot that
683 * stays open at the end.
685 if (initial && sched_feat(START_DEBIT))
686 vruntime += sched_vslice_add(cfs_rq, se);
689 /* sleeps upto a single latency don't count. */
690 if (sched_feat(NEW_FAIR_SLEEPERS)) {
691 unsigned long thresh = sysctl_sched_latency;
694 * convert the sleeper threshold into virtual time
696 if (sched_feat(NORMALIZED_SLEEPER))
697 thresh = calc_delta_fair(thresh, se);
702 /* ensure we never gain time by being placed backwards. */
703 vruntime = max_vruntime(se->vruntime, vruntime);
706 se->vruntime = vruntime;
710 enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int wakeup)
713 * Update run-time statistics of the 'current'.
716 account_entity_enqueue(cfs_rq, se);
719 place_entity(cfs_rq, se, 0);
720 enqueue_sleeper(cfs_rq, se);
723 update_stats_enqueue(cfs_rq, se);
724 check_spread(cfs_rq, se);
725 if (se != cfs_rq->curr)
726 __enqueue_entity(cfs_rq, se);
729 static void update_avg(u64 *avg, u64 sample)
731 s64 diff = sample - *avg;
735 static void update_avg_stats(struct cfs_rq *cfs_rq, struct sched_entity *se)
737 if (!se->last_wakeup)
740 update_avg(&se->avg_overlap, se->sum_exec_runtime - se->last_wakeup);
745 dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int sleep)
748 * Update run-time statistics of the 'current'.
752 update_stats_dequeue(cfs_rq, se);
754 update_avg_stats(cfs_rq, se);
755 #ifdef CONFIG_SCHEDSTATS
756 if (entity_is_task(se)) {
757 struct task_struct *tsk = task_of(se);
759 if (tsk->state & TASK_INTERRUPTIBLE)
760 se->sleep_start = rq_of(cfs_rq)->clock;
761 if (tsk->state & TASK_UNINTERRUPTIBLE)
762 se->block_start = rq_of(cfs_rq)->clock;
767 if (se != cfs_rq->curr)
768 __dequeue_entity(cfs_rq, se);
769 account_entity_dequeue(cfs_rq, se);
773 * Preempt the current task with a newly woken task if needed:
776 check_preempt_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr)
778 unsigned long ideal_runtime, delta_exec;
780 ideal_runtime = sched_slice(cfs_rq, curr);
781 delta_exec = curr->sum_exec_runtime - curr->prev_sum_exec_runtime;
782 if (delta_exec > ideal_runtime)
783 resched_task(rq_of(cfs_rq)->curr);
787 set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se)
789 /* 'current' is not kept within the tree. */
792 * Any task has to be enqueued before it get to execute on
793 * a CPU. So account for the time it spent waiting on the
796 update_stats_wait_end(cfs_rq, se);
797 __dequeue_entity(cfs_rq, se);
800 update_stats_curr_start(cfs_rq, se);
802 #ifdef CONFIG_SCHEDSTATS
804 * Track our maximum slice length, if the CPU's load is at
805 * least twice that of our own weight (i.e. dont track it
806 * when there are only lesser-weight tasks around):
808 if (rq_of(cfs_rq)->load.weight >= 2*se->load.weight) {
809 se->slice_max = max(se->slice_max,
810 se->sum_exec_runtime - se->prev_sum_exec_runtime);
813 se->prev_sum_exec_runtime = se->sum_exec_runtime;
817 wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se);
819 static struct sched_entity *
820 pick_next(struct cfs_rq *cfs_rq, struct sched_entity *se)
825 if (wakeup_preempt_entity(cfs_rq->next, se) != 0)
831 static struct sched_entity *pick_next_entity(struct cfs_rq *cfs_rq)
833 struct sched_entity *se = NULL;
835 if (first_fair(cfs_rq)) {
836 se = __pick_next_entity(cfs_rq);
837 se = pick_next(cfs_rq, se);
838 set_next_entity(cfs_rq, se);
844 static void put_prev_entity(struct cfs_rq *cfs_rq, struct sched_entity *prev)
847 * If still on the runqueue then deactivate_task()
848 * was not called and update_curr() has to be done:
853 check_spread(cfs_rq, prev);
855 update_stats_wait_start(cfs_rq, prev);
856 /* Put 'current' back into the tree. */
857 __enqueue_entity(cfs_rq, prev);
863 entity_tick(struct cfs_rq *cfs_rq, struct sched_entity *curr, int queued)
866 * Update run-time statistics of the 'current'.
870 #ifdef CONFIG_SCHED_HRTICK
872 * queued ticks are scheduled to match the slice, so don't bother
873 * validating it and just reschedule.
876 resched_task(rq_of(cfs_rq)->curr);
880 * don't let the period tick interfere with the hrtick preemption
882 if (!sched_feat(DOUBLE_TICK) &&
883 hrtimer_active(&rq_of(cfs_rq)->hrtick_timer))
887 if (cfs_rq->nr_running > 1 || !sched_feat(WAKEUP_PREEMPT))
888 check_preempt_tick(cfs_rq, curr);
891 /**************************************************
892 * CFS operations on tasks:
895 #ifdef CONFIG_SCHED_HRTICK
896 static void hrtick_start_fair(struct rq *rq, struct task_struct *p)
898 int requeue = rq->curr == p;
899 struct sched_entity *se = &p->se;
900 struct cfs_rq *cfs_rq = cfs_rq_of(se);
902 WARN_ON(task_rq(p) != rq);
904 if (hrtick_enabled(rq) && cfs_rq->nr_running > 1) {
905 u64 slice = sched_slice(cfs_rq, se);
906 u64 ran = se->sum_exec_runtime - se->prev_sum_exec_runtime;
907 s64 delta = slice - ran;
916 * Don't schedule slices shorter than 10000ns, that just
917 * doesn't make sense. Rely on vruntime for fairness.
920 delta = max(10000LL, delta);
922 hrtick_start(rq, delta, requeue);
927 hrtick_start_fair(struct rq *rq, struct task_struct *p)
933 * The enqueue_task method is called before nr_running is
934 * increased. Here we update the fair scheduling stats and
935 * then put the task into the rbtree:
937 static void enqueue_task_fair(struct rq *rq, struct task_struct *p, int wakeup)
939 struct cfs_rq *cfs_rq;
940 struct sched_entity *se = &p->se;
942 for_each_sched_entity(se) {
945 cfs_rq = cfs_rq_of(se);
946 enqueue_entity(cfs_rq, se, wakeup);
950 hrtick_start_fair(rq, rq->curr);
954 * The dequeue_task method is called before nr_running is
955 * decreased. We remove the task from the rbtree and
956 * update the fair scheduling stats:
958 static void dequeue_task_fair(struct rq *rq, struct task_struct *p, int sleep)
960 struct cfs_rq *cfs_rq;
961 struct sched_entity *se = &p->se;
963 for_each_sched_entity(se) {
964 cfs_rq = cfs_rq_of(se);
965 dequeue_entity(cfs_rq, se, sleep);
966 /* Don't dequeue parent if it has other entities besides us */
967 if (cfs_rq->load.weight)
972 hrtick_start_fair(rq, rq->curr);
976 * sched_yield() support is very simple - we dequeue and enqueue.
978 * If compat_yield is turned on then we requeue to the end of the tree.
980 static void yield_task_fair(struct rq *rq)
982 struct task_struct *curr = rq->curr;
983 struct cfs_rq *cfs_rq = task_cfs_rq(curr);
984 struct sched_entity *rightmost, *se = &curr->se;
987 * Are we the only task in the tree?
989 if (unlikely(cfs_rq->nr_running == 1))
992 if (likely(!sysctl_sched_compat_yield) && curr->policy != SCHED_BATCH) {
995 * Update run-time statistics of the 'current'.
1002 * Find the rightmost entry in the rbtree:
1004 rightmost = __pick_last_entity(cfs_rq);
1006 * Already in the rightmost position?
1008 if (unlikely(!rightmost || rightmost->vruntime < se->vruntime))
1012 * Minimally necessary key value to be last in the tree:
1013 * Upon rescheduling, sched_class::put_prev_task() will place
1014 * 'current' within the tree based on its new key value.
1016 se->vruntime = rightmost->vruntime + 1;
1020 * wake_idle() will wake a task on an idle cpu if task->cpu is
1021 * not idle and an idle cpu is available. The span of cpus to
1022 * search starts with cpus closest then further out as needed,
1023 * so we always favor a closer, idle cpu.
1025 * Returns the CPU we should wake onto.
1027 #if defined(ARCH_HAS_SCHED_WAKE_IDLE)
1028 static int wake_idle(int cpu, struct task_struct *p)
1031 struct sched_domain *sd;
1035 * If it is idle, then it is the best cpu to run this task.
1037 * This cpu is also the best, if it has more than one task already.
1038 * Siblings must be also busy(in most cases) as they didn't already
1039 * pickup the extra load from this cpu and hence we need not check
1040 * sibling runqueue info. This will avoid the checks and cache miss
1041 * penalities associated with that.
1043 if (idle_cpu(cpu) || cpu_rq(cpu)->cfs.nr_running > 1)
1046 for_each_domain(cpu, sd) {
1047 if ((sd->flags & SD_WAKE_IDLE)
1048 || ((sd->flags & SD_WAKE_IDLE_FAR)
1049 && !task_hot(p, task_rq(p)->clock, sd))) {
1050 cpus_and(tmp, sd->span, p->cpus_allowed);
1051 for_each_cpu_mask(i, tmp) {
1053 if (i != task_cpu(p)) {
1055 se.nr_wakeups_idle);
1067 static inline int wake_idle(int cpu, struct task_struct *p)
1075 static const struct sched_class fair_sched_class;
1078 wake_affine(struct rq *rq, struct sched_domain *this_sd, struct rq *this_rq,
1079 struct task_struct *p, int prev_cpu, int this_cpu, int sync,
1080 int idx, unsigned long load, unsigned long this_load,
1081 unsigned int imbalance)
1083 struct task_struct *curr = this_rq->curr;
1084 unsigned long tl = this_load;
1085 unsigned long tl_per_task;
1088 if (!(this_sd->flags & SD_WAKE_AFFINE) || !sched_feat(AFFINE_WAKEUPS))
1092 * If sync wakeup then subtract the (maximum possible)
1093 * effect of the currently running task from the load
1094 * of the current CPU:
1097 tl -= current->se.load.weight;
1099 balanced = 100*(tl + p->se.load.weight) <= imbalance*load;
1102 * If the currently running task will sleep within
1103 * a reasonable amount of time then attract this newly
1106 if (sync && balanced && curr->sched_class == &fair_sched_class) {
1107 if (curr->se.avg_overlap < sysctl_sched_migration_cost &&
1108 p->se.avg_overlap < sysctl_sched_migration_cost)
1112 schedstat_inc(p, se.nr_wakeups_affine_attempts);
1113 tl_per_task = cpu_avg_load_per_task(this_cpu);
1115 if ((tl <= load && tl + target_load(prev_cpu, idx) <= tl_per_task) ||
1118 * This domain has SD_WAKE_AFFINE and
1119 * p is cache cold in this domain, and
1120 * there is no bad imbalance.
1122 schedstat_inc(this_sd, ttwu_move_affine);
1123 schedstat_inc(p, se.nr_wakeups_affine);
1130 static int select_task_rq_fair(struct task_struct *p, int sync)
1132 struct sched_domain *sd, *this_sd = NULL;
1133 int prev_cpu, this_cpu, new_cpu;
1134 unsigned long load, this_load;
1135 struct rq *rq, *this_rq;
1136 unsigned int imbalance;
1139 prev_cpu = task_cpu(p);
1141 this_cpu = smp_processor_id();
1142 this_rq = cpu_rq(this_cpu);
1146 * 'this_sd' is the first domain that both
1147 * this_cpu and prev_cpu are present in:
1149 for_each_domain(this_cpu, sd) {
1150 if (cpu_isset(prev_cpu, sd->span)) {
1156 if (unlikely(!cpu_isset(this_cpu, p->cpus_allowed)))
1160 * Check for affine wakeup and passive balancing possibilities.
1165 idx = this_sd->wake_idx;
1167 imbalance = 100 + (this_sd->imbalance_pct - 100) / 2;
1169 load = source_load(prev_cpu, idx);
1170 this_load = target_load(this_cpu, idx);
1172 if (wake_affine(rq, this_sd, this_rq, p, prev_cpu, this_cpu, sync, idx,
1173 load, this_load, imbalance))
1176 if (prev_cpu == this_cpu)
1180 * Start passive balancing when half the imbalance_pct
1183 if (this_sd->flags & SD_WAKE_BALANCE) {
1184 if (imbalance*this_load <= 100*load) {
1185 schedstat_inc(this_sd, ttwu_move_balance);
1186 schedstat_inc(p, se.nr_wakeups_passive);
1192 return wake_idle(new_cpu, p);
1194 #endif /* CONFIG_SMP */
1196 static unsigned long wakeup_gran(struct sched_entity *se)
1198 unsigned long gran = sysctl_sched_wakeup_granularity;
1201 * More easily preempt - nice tasks, while not making it harder for
1204 if (sched_feat(ASYM_GRAN))
1205 gran = calc_delta_asym(sysctl_sched_wakeup_granularity, se);
1207 gran = calc_delta_fair(sysctl_sched_wakeup_granularity, se);
1213 * Should 'se' preempt 'curr'.
1227 wakeup_preempt_entity(struct sched_entity *curr, struct sched_entity *se)
1229 s64 gran, vdiff = curr->vruntime - se->vruntime;
1234 gran = wakeup_gran(curr);
1241 /* return depth at which a sched entity is present in the hierarchy */
1242 static inline int depth_se(struct sched_entity *se)
1246 for_each_sched_entity(se)
1253 * Preempt the current task with a newly woken task if needed:
1255 static void check_preempt_wakeup(struct rq *rq, struct task_struct *p)
1257 struct task_struct *curr = rq->curr;
1258 struct cfs_rq *cfs_rq = task_cfs_rq(curr);
1259 struct sched_entity *se = &curr->se, *pse = &p->se;
1260 int se_depth, pse_depth;
1262 if (unlikely(rt_prio(p->prio))) {
1263 update_rq_clock(rq);
1264 update_curr(cfs_rq);
1269 se->last_wakeup = se->sum_exec_runtime;
1270 if (unlikely(se == pse))
1273 cfs_rq_of(pse)->next = pse;
1276 * Batch tasks do not preempt (their preemption is driven by
1279 if (unlikely(p->policy == SCHED_BATCH))
1282 if (!sched_feat(WAKEUP_PREEMPT))
1286 * preemption test can be made between sibling entities who are in the
1287 * same cfs_rq i.e who have a common parent. Walk up the hierarchy of
1288 * both tasks until we find their ancestors who are siblings of common
1292 /* First walk up until both entities are at same depth */
1293 se_depth = depth_se(se);
1294 pse_depth = depth_se(pse);
1296 while (se_depth > pse_depth) {
1298 se = parent_entity(se);
1301 while (pse_depth > se_depth) {
1303 pse = parent_entity(pse);
1306 while (!is_same_group(se, pse)) {
1307 se = parent_entity(se);
1308 pse = parent_entity(pse);
1311 if (wakeup_preempt_entity(se, pse) == 1)
1315 static struct task_struct *pick_next_task_fair(struct rq *rq)
1317 struct task_struct *p;
1318 struct cfs_rq *cfs_rq = &rq->cfs;
1319 struct sched_entity *se;
1321 if (unlikely(!cfs_rq->nr_running))
1325 se = pick_next_entity(cfs_rq);
1326 cfs_rq = group_cfs_rq(se);
1330 hrtick_start_fair(rq, p);
1336 * Account for a descheduled task:
1338 static void put_prev_task_fair(struct rq *rq, struct task_struct *prev)
1340 struct sched_entity *se = &prev->se;
1341 struct cfs_rq *cfs_rq;
1343 for_each_sched_entity(se) {
1344 cfs_rq = cfs_rq_of(se);
1345 put_prev_entity(cfs_rq, se);
1350 /**************************************************
1351 * Fair scheduling class load-balancing methods:
1355 * Load-balancing iterator. Note: while the runqueue stays locked
1356 * during the whole iteration, the current task might be
1357 * dequeued so the iterator has to be dequeue-safe. Here we
1358 * achieve that by always pre-iterating before returning
1361 static struct task_struct *
1362 __load_balance_iterator(struct cfs_rq *cfs_rq, struct list_head *next)
1364 struct task_struct *p = NULL;
1365 struct sched_entity *se;
1367 while (next != &cfs_rq->tasks) {
1368 se = list_entry(next, struct sched_entity, group_node);
1371 /* Skip over entities that are not tasks */
1372 if (entity_is_task(se)) {
1378 cfs_rq->balance_iterator = next;
1382 static struct task_struct *load_balance_start_fair(void *arg)
1384 struct cfs_rq *cfs_rq = arg;
1386 return __load_balance_iterator(cfs_rq, cfs_rq->tasks.next);
1389 static struct task_struct *load_balance_next_fair(void *arg)
1391 struct cfs_rq *cfs_rq = arg;
1393 return __load_balance_iterator(cfs_rq, cfs_rq->balance_iterator);
1396 static unsigned long
1397 __load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest,
1398 unsigned long max_load_move, struct sched_domain *sd,
1399 enum cpu_idle_type idle, int *all_pinned, int *this_best_prio,
1400 struct cfs_rq *cfs_rq)
1402 struct rq_iterator cfs_rq_iterator;
1404 cfs_rq_iterator.start = load_balance_start_fair;
1405 cfs_rq_iterator.next = load_balance_next_fair;
1406 cfs_rq_iterator.arg = cfs_rq;
1408 return balance_tasks(this_rq, this_cpu, busiest,
1409 max_load_move, sd, idle, all_pinned,
1410 this_best_prio, &cfs_rq_iterator);
1413 #ifdef CONFIG_FAIR_GROUP_SCHED
1414 static unsigned long
1415 load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest,
1416 unsigned long max_load_move,
1417 struct sched_domain *sd, enum cpu_idle_type idle,
1418 int *all_pinned, int *this_best_prio)
1420 long rem_load_move = max_load_move;
1421 int busiest_cpu = cpu_of(busiest);
1422 struct task_group *tg;
1425 list_for_each_entry(tg, &task_groups, list) {
1427 unsigned long this_weight, busiest_weight;
1428 long rem_load, max_load, moved_load;
1433 if (!aggregate(tg, sd)->task_weight)
1436 rem_load = rem_load_move * aggregate(tg, sd)->rq_weight;
1437 rem_load /= aggregate(tg, sd)->load + 1;
1439 this_weight = tg->cfs_rq[this_cpu]->task_weight;
1440 busiest_weight = tg->cfs_rq[busiest_cpu]->task_weight;
1442 imbalance = (busiest_weight - this_weight) / 2;
1445 imbalance = busiest_weight;
1447 max_load = max(rem_load, imbalance);
1448 moved_load = __load_balance_fair(this_rq, this_cpu, busiest,
1449 max_load, sd, idle, all_pinned, this_best_prio,
1450 tg->cfs_rq[busiest_cpu]);
1455 move_group_shares(tg, sd, busiest_cpu, this_cpu);
1457 moved_load *= aggregate(tg, sd)->load;
1458 moved_load /= aggregate(tg, sd)->rq_weight + 1;
1460 rem_load_move -= moved_load;
1461 if (rem_load_move < 0)
1466 return max_load_move - rem_load_move;
1469 static unsigned long
1470 load_balance_fair(struct rq *this_rq, int this_cpu, struct rq *busiest,
1471 unsigned long max_load_move,
1472 struct sched_domain *sd, enum cpu_idle_type idle,
1473 int *all_pinned, int *this_best_prio)
1475 return __load_balance_fair(this_rq, this_cpu, busiest,
1476 max_load_move, sd, idle, all_pinned,
1477 this_best_prio, &busiest->cfs);
1482 move_one_task_fair(struct rq *this_rq, int this_cpu, struct rq *busiest,
1483 struct sched_domain *sd, enum cpu_idle_type idle)
1485 struct cfs_rq *busy_cfs_rq;
1486 struct rq_iterator cfs_rq_iterator;
1488 cfs_rq_iterator.start = load_balance_start_fair;
1489 cfs_rq_iterator.next = load_balance_next_fair;
1491 for_each_leaf_cfs_rq(busiest, busy_cfs_rq) {
1493 * pass busy_cfs_rq argument into
1494 * load_balance_[start|next]_fair iterators
1496 cfs_rq_iterator.arg = busy_cfs_rq;
1497 if (iter_move_one_task(this_rq, this_cpu, busiest, sd, idle,
1507 * scheduler tick hitting a task of our scheduling class:
1509 static void task_tick_fair(struct rq *rq, struct task_struct *curr, int queued)
1511 struct cfs_rq *cfs_rq;
1512 struct sched_entity *se = &curr->se;
1514 for_each_sched_entity(se) {
1515 cfs_rq = cfs_rq_of(se);
1516 entity_tick(cfs_rq, se, queued);
1520 #define swap(a, b) do { typeof(a) tmp = (a); (a) = (b); (b) = tmp; } while (0)
1523 * Share the fairness runtime between parent and child, thus the
1524 * total amount of pressure for CPU stays equal - new tasks
1525 * get a chance to run but frequent forkers are not allowed to
1526 * monopolize the CPU. Note: the parent runqueue is locked,
1527 * the child is not running yet.
1529 static void task_new_fair(struct rq *rq, struct task_struct *p)
1531 struct cfs_rq *cfs_rq = task_cfs_rq(p);
1532 struct sched_entity *se = &p->se, *curr = cfs_rq->curr;
1533 int this_cpu = smp_processor_id();
1535 sched_info_queued(p);
1537 update_curr(cfs_rq);
1538 place_entity(cfs_rq, se, 1);
1540 /* 'curr' will be NULL if the child belongs to a different group */
1541 if (sysctl_sched_child_runs_first && this_cpu == task_cpu(p) &&
1542 curr && curr->vruntime < se->vruntime) {
1544 * Upon rescheduling, sched_class::put_prev_task() will place
1545 * 'current' within the tree based on its new key value.
1547 swap(curr->vruntime, se->vruntime);
1550 enqueue_task_fair(rq, p, 0);
1551 resched_task(rq->curr);
1555 * Priority of the task has changed. Check to see if we preempt
1558 static void prio_changed_fair(struct rq *rq, struct task_struct *p,
1559 int oldprio, int running)
1562 * Reschedule if we are currently running on this runqueue and
1563 * our priority decreased, or if we are not currently running on
1564 * this runqueue and our priority is higher than the current's
1567 if (p->prio > oldprio)
1568 resched_task(rq->curr);
1570 check_preempt_curr(rq, p);
1574 * We switched to the sched_fair class.
1576 static void switched_to_fair(struct rq *rq, struct task_struct *p,
1580 * We were most likely switched from sched_rt, so
1581 * kick off the schedule if running, otherwise just see
1582 * if we can still preempt the current task.
1585 resched_task(rq->curr);
1587 check_preempt_curr(rq, p);
1590 /* Account for a task changing its policy or group.
1592 * This routine is mostly called to set cfs_rq->curr field when a task
1593 * migrates between groups/classes.
1595 static void set_curr_task_fair(struct rq *rq)
1597 struct sched_entity *se = &rq->curr->se;
1599 for_each_sched_entity(se)
1600 set_next_entity(cfs_rq_of(se), se);
1603 #ifdef CONFIG_FAIR_GROUP_SCHED
1604 static void moved_group_fair(struct task_struct *p)
1606 struct cfs_rq *cfs_rq = task_cfs_rq(p);
1608 update_curr(cfs_rq);
1609 place_entity(cfs_rq, &p->se, 1);
1614 * All the scheduling class methods:
1616 static const struct sched_class fair_sched_class = {
1617 .next = &idle_sched_class,
1618 .enqueue_task = enqueue_task_fair,
1619 .dequeue_task = dequeue_task_fair,
1620 .yield_task = yield_task_fair,
1622 .select_task_rq = select_task_rq_fair,
1623 #endif /* CONFIG_SMP */
1625 .check_preempt_curr = check_preempt_wakeup,
1627 .pick_next_task = pick_next_task_fair,
1628 .put_prev_task = put_prev_task_fair,
1631 .load_balance = load_balance_fair,
1632 .move_one_task = move_one_task_fair,
1635 .set_curr_task = set_curr_task_fair,
1636 .task_tick = task_tick_fair,
1637 .task_new = task_new_fair,
1639 .prio_changed = prio_changed_fair,
1640 .switched_to = switched_to_fair,
1642 #ifdef CONFIG_FAIR_GROUP_SCHED
1643 .moved_group = moved_group_fair,
1647 #ifdef CONFIG_SCHED_DEBUG
1648 static void print_cfs_stats(struct seq_file *m, int cpu)
1650 struct cfs_rq *cfs_rq;
1653 for_each_leaf_cfs_rq(cpu_rq(cpu), cfs_rq)
1654 print_cfs_rq(m, cpu, cfs_rq);