4 * Kernel scheduler and related syscalls
6 * Copyright (C) 1991-2002 Linus Torvalds
8 * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and
9 * make semaphores SMP safe
10 * 1998-11-19 Implemented schedule_timeout() and related stuff
12 * 2002-01-04 New ultra-scalable O(1) scheduler by Ingo Molnar:
13 * hybrid priority-list and round-robin design with
14 * an array-switch method of distributing timeslices
15 * and per-CPU runqueues. Cleanups and useful suggestions
16 * by Davide Libenzi, preemptible kernel bits by Robert Love.
17 * 2003-09-03 Interactivity tuning by Con Kolivas.
18 * 2004-04-02 Scheduler domains code by Nick Piggin
19 * 2007-04-15 Work begun on replacing all interactivity tuning with a
20 * fair scheduling design by Con Kolivas.
21 * 2007-05-05 Load balancing (smp-nice) and other improvements
23 * 2007-05-06 Interactivity improvements to CFS by Mike Galbraith
24 * 2007-07-01 Group scheduling enhancements by Srivatsa Vaddagiri
25 * 2007-11-29 RT balancing improvements by Steven Rostedt, Gregory Haskins,
26 * Thomas Gleixner, Mike Kravetz
30 #include <linux/module.h>
31 #include <linux/nmi.h>
32 #include <linux/init.h>
33 #include <linux/uaccess.h>
34 #include <linux/highmem.h>
35 #include <asm/mmu_context.h>
36 #include <linux/interrupt.h>
37 #include <linux/capability.h>
38 #include <linux/completion.h>
39 #include <linux/kernel_stat.h>
40 #include <linux/debug_locks.h>
41 #include <linux/perf_event.h>
42 #include <linux/security.h>
43 #include <linux/notifier.h>
44 #include <linux/profile.h>
45 #include <linux/freezer.h>
46 #include <linux/vmalloc.h>
47 #include <linux/blkdev.h>
48 #include <linux/delay.h>
49 #include <linux/pid_namespace.h>
50 #include <linux/smp.h>
51 #include <linux/threads.h>
52 #include <linux/timer.h>
53 #include <linux/rcupdate.h>
54 #include <linux/cpu.h>
55 #include <linux/cpuset.h>
56 #include <linux/percpu.h>
57 #include <linux/proc_fs.h>
58 #include <linux/seq_file.h>
59 #include <linux/sysctl.h>
60 #include <linux/syscalls.h>
61 #include <linux/times.h>
62 #include <linux/tsacct_kern.h>
63 #include <linux/kprobes.h>
64 #include <linux/delayacct.h>
65 #include <linux/unistd.h>
66 #include <linux/pagemap.h>
67 #include <linux/hrtimer.h>
68 #include <linux/tick.h>
69 #include <linux/debugfs.h>
70 #include <linux/ctype.h>
71 #include <linux/ftrace.h>
72 #include <linux/slab.h>
73 #include <linux/init_task.h>
74 #include <linux/binfmts.h>
75 #include <linux/context_tracking.h>
76 #include <linux/compiler.h>
78 #include <asm/switch_to.h>
80 #include <asm/irq_regs.h>
81 #include <asm/mutex.h>
82 #ifdef CONFIG_PARAVIRT
83 #include <asm/paravirt.h>
87 #include "../workqueue_internal.h"
88 #include "../smpboot.h"
90 #define CREATE_TRACE_POINTS
91 #include <trace/events/sched.h>
93 #ifdef smp_mb__before_atomic
94 void __smp_mb__before_atomic(void)
96 smp_mb__before_atomic();
98 EXPORT_SYMBOL(__smp_mb__before_atomic);
101 #ifdef smp_mb__after_atomic
102 void __smp_mb__after_atomic(void)
104 smp_mb__after_atomic();
106 EXPORT_SYMBOL(__smp_mb__after_atomic);
109 void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period)
112 ktime_t soft, hard, now;
115 if (hrtimer_active(period_timer))
118 now = hrtimer_cb_get_time(period_timer);
119 hrtimer_forward(period_timer, now, period);
121 soft = hrtimer_get_softexpires(period_timer);
122 hard = hrtimer_get_expires(period_timer);
123 delta = ktime_to_ns(ktime_sub(hard, soft));
124 __hrtimer_start_range_ns(period_timer, soft, delta,
125 HRTIMER_MODE_ABS_PINNED, 0);
129 DEFINE_MUTEX(sched_domains_mutex);
130 DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
132 static void update_rq_clock_task(struct rq *rq, s64 delta);
134 void update_rq_clock(struct rq *rq)
138 if (rq->skip_clock_update > 0)
141 delta = sched_clock_cpu(cpu_of(rq)) - rq->clock;
145 update_rq_clock_task(rq, delta);
149 * Debugging: various feature bits
152 #define SCHED_FEAT(name, enabled) \
153 (1UL << __SCHED_FEAT_##name) * enabled |
155 const_debug unsigned int sysctl_sched_features =
156 #include "features.h"
161 #ifdef CONFIG_SCHED_DEBUG
162 #define SCHED_FEAT(name, enabled) \
165 static const char * const sched_feat_names[] = {
166 #include "features.h"
171 static int sched_feat_show(struct seq_file *m, void *v)
175 for (i = 0; i < __SCHED_FEAT_NR; i++) {
176 if (!(sysctl_sched_features & (1UL << i)))
178 seq_printf(m, "%s ", sched_feat_names[i]);
185 #ifdef HAVE_JUMP_LABEL
187 #define jump_label_key__true STATIC_KEY_INIT_TRUE
188 #define jump_label_key__false STATIC_KEY_INIT_FALSE
190 #define SCHED_FEAT(name, enabled) \
191 jump_label_key__##enabled ,
193 struct static_key sched_feat_keys[__SCHED_FEAT_NR] = {
194 #include "features.h"
199 static void sched_feat_disable(int i)
201 if (static_key_enabled(&sched_feat_keys[i]))
202 static_key_slow_dec(&sched_feat_keys[i]);
205 static void sched_feat_enable(int i)
207 if (!static_key_enabled(&sched_feat_keys[i]))
208 static_key_slow_inc(&sched_feat_keys[i]);
211 static void sched_feat_disable(int i) { };
212 static void sched_feat_enable(int i) { };
213 #endif /* HAVE_JUMP_LABEL */
215 static int sched_feat_set(char *cmp)
220 if (strncmp(cmp, "NO_", 3) == 0) {
225 for (i = 0; i < __SCHED_FEAT_NR; i++) {
226 if (strcmp(cmp, sched_feat_names[i]) == 0) {
228 sysctl_sched_features &= ~(1UL << i);
229 sched_feat_disable(i);
231 sysctl_sched_features |= (1UL << i);
232 sched_feat_enable(i);
242 sched_feat_write(struct file *filp, const char __user *ubuf,
243 size_t cnt, loff_t *ppos)
253 if (copy_from_user(&buf, ubuf, cnt))
259 /* Ensure the static_key remains in a consistent state */
260 inode = file_inode(filp);
261 mutex_lock(&inode->i_mutex);
262 i = sched_feat_set(cmp);
263 mutex_unlock(&inode->i_mutex);
264 if (i == __SCHED_FEAT_NR)
272 static int sched_feat_open(struct inode *inode, struct file *filp)
274 return single_open(filp, sched_feat_show, NULL);
277 static const struct file_operations sched_feat_fops = {
278 .open = sched_feat_open,
279 .write = sched_feat_write,
282 .release = single_release,
285 static __init int sched_init_debug(void)
287 debugfs_create_file("sched_features", 0644, NULL, NULL,
292 late_initcall(sched_init_debug);
293 #endif /* CONFIG_SCHED_DEBUG */
296 * Number of tasks to iterate in a single balance run.
297 * Limited because this is done with IRQs disabled.
299 const_debug unsigned int sysctl_sched_nr_migrate = 32;
302 * period over which we average the RT time consumption, measured
307 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
310 * period over which we measure -rt task cpu usage in us.
313 unsigned int sysctl_sched_rt_period = 1000000;
315 __read_mostly int scheduler_running;
318 * part of the period that we allow rt tasks to run in us.
321 int sysctl_sched_rt_runtime = 950000;
324 * __task_rq_lock - lock the rq @p resides on.
326 static inline struct rq *__task_rq_lock(struct task_struct *p)
331 lockdep_assert_held(&p->pi_lock);
335 raw_spin_lock(&rq->lock);
336 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p)))
338 raw_spin_unlock(&rq->lock);
340 while (unlikely(task_on_rq_migrating(p)))
346 * task_rq_lock - lock p->pi_lock and lock the rq @p resides on.
348 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
349 __acquires(p->pi_lock)
355 raw_spin_lock_irqsave(&p->pi_lock, *flags);
357 raw_spin_lock(&rq->lock);
358 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p)))
360 raw_spin_unlock(&rq->lock);
361 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
363 while (unlikely(task_on_rq_migrating(p)))
368 static void __task_rq_unlock(struct rq *rq)
371 raw_spin_unlock(&rq->lock);
375 task_rq_unlock(struct rq *rq, struct task_struct *p, unsigned long *flags)
377 __releases(p->pi_lock)
379 raw_spin_unlock(&rq->lock);
380 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
384 * this_rq_lock - lock this runqueue and disable interrupts.
386 static struct rq *this_rq_lock(void)
393 raw_spin_lock(&rq->lock);
398 #ifdef CONFIG_SCHED_HRTICK
400 * Use HR-timers to deliver accurate preemption points.
403 static void hrtick_clear(struct rq *rq)
405 if (hrtimer_active(&rq->hrtick_timer))
406 hrtimer_cancel(&rq->hrtick_timer);
410 * High-resolution timer tick.
411 * Runs from hardirq context with interrupts disabled.
413 static enum hrtimer_restart hrtick(struct hrtimer *timer)
415 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
417 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
419 raw_spin_lock(&rq->lock);
421 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
422 raw_spin_unlock(&rq->lock);
424 return HRTIMER_NORESTART;
429 static int __hrtick_restart(struct rq *rq)
431 struct hrtimer *timer = &rq->hrtick_timer;
432 ktime_t time = hrtimer_get_softexpires(timer);
434 return __hrtimer_start_range_ns(timer, time, 0, HRTIMER_MODE_ABS_PINNED, 0);
438 * called from hardirq (IPI) context
440 static void __hrtick_start(void *arg)
444 raw_spin_lock(&rq->lock);
445 __hrtick_restart(rq);
446 rq->hrtick_csd_pending = 0;
447 raw_spin_unlock(&rq->lock);
451 * Called to set the hrtick timer state.
453 * called with rq->lock held and irqs disabled
455 void hrtick_start(struct rq *rq, u64 delay)
457 struct hrtimer *timer = &rq->hrtick_timer;
462 * Don't schedule slices shorter than 10000ns, that just
463 * doesn't make sense and can cause timer DoS.
465 delta = max_t(s64, delay, 10000LL);
466 time = ktime_add_ns(timer->base->get_time(), delta);
468 hrtimer_set_expires(timer, time);
470 if (rq == this_rq()) {
471 __hrtick_restart(rq);
472 } else if (!rq->hrtick_csd_pending) {
473 smp_call_function_single_async(cpu_of(rq), &rq->hrtick_csd);
474 rq->hrtick_csd_pending = 1;
479 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
481 int cpu = (int)(long)hcpu;
484 case CPU_UP_CANCELED:
485 case CPU_UP_CANCELED_FROZEN:
486 case CPU_DOWN_PREPARE:
487 case CPU_DOWN_PREPARE_FROZEN:
489 case CPU_DEAD_FROZEN:
490 hrtick_clear(cpu_rq(cpu));
497 static __init void init_hrtick(void)
499 hotcpu_notifier(hotplug_hrtick, 0);
503 * Called to set the hrtick timer state.
505 * called with rq->lock held and irqs disabled
507 void hrtick_start(struct rq *rq, u64 delay)
509 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
510 HRTIMER_MODE_REL_PINNED, 0);
513 static inline void init_hrtick(void)
516 #endif /* CONFIG_SMP */
518 static void init_rq_hrtick(struct rq *rq)
521 rq->hrtick_csd_pending = 0;
523 rq->hrtick_csd.flags = 0;
524 rq->hrtick_csd.func = __hrtick_start;
525 rq->hrtick_csd.info = rq;
528 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
529 rq->hrtick_timer.function = hrtick;
531 #else /* CONFIG_SCHED_HRTICK */
532 static inline void hrtick_clear(struct rq *rq)
536 static inline void init_rq_hrtick(struct rq *rq)
540 static inline void init_hrtick(void)
543 #endif /* CONFIG_SCHED_HRTICK */
546 * cmpxchg based fetch_or, macro so it works for different integer types
548 #define fetch_or(ptr, val) \
549 ({ typeof(*(ptr)) __old, __val = *(ptr); \
551 __old = cmpxchg((ptr), __val, __val | (val)); \
552 if (__old == __val) \
559 #if defined(CONFIG_SMP) && defined(TIF_POLLING_NRFLAG)
561 * Atomically set TIF_NEED_RESCHED and test for TIF_POLLING_NRFLAG,
562 * this avoids any races wrt polling state changes and thereby avoids
565 static bool set_nr_and_not_polling(struct task_struct *p)
567 struct thread_info *ti = task_thread_info(p);
568 return !(fetch_or(&ti->flags, _TIF_NEED_RESCHED) & _TIF_POLLING_NRFLAG);
572 * Atomically set TIF_NEED_RESCHED if TIF_POLLING_NRFLAG is set.
574 * If this returns true, then the idle task promises to call
575 * sched_ttwu_pending() and reschedule soon.
577 static bool set_nr_if_polling(struct task_struct *p)
579 struct thread_info *ti = task_thread_info(p);
580 typeof(ti->flags) old, val = ACCESS_ONCE(ti->flags);
583 if (!(val & _TIF_POLLING_NRFLAG))
585 if (val & _TIF_NEED_RESCHED)
587 old = cmpxchg(&ti->flags, val, val | _TIF_NEED_RESCHED);
596 static bool set_nr_and_not_polling(struct task_struct *p)
598 set_tsk_need_resched(p);
603 static bool set_nr_if_polling(struct task_struct *p)
611 * resched_curr - mark rq's current task 'to be rescheduled now'.
613 * On UP this means the setting of the need_resched flag, on SMP it
614 * might also involve a cross-CPU call to trigger the scheduler on
617 void resched_curr(struct rq *rq)
619 struct task_struct *curr = rq->curr;
622 lockdep_assert_held(&rq->lock);
624 if (test_tsk_need_resched(curr))
629 if (cpu == smp_processor_id()) {
630 set_tsk_need_resched(curr);
631 set_preempt_need_resched();
635 if (set_nr_and_not_polling(curr))
636 smp_send_reschedule(cpu);
638 trace_sched_wake_idle_without_ipi(cpu);
641 void resched_cpu(int cpu)
643 struct rq *rq = cpu_rq(cpu);
646 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
649 raw_spin_unlock_irqrestore(&rq->lock, flags);
653 #ifdef CONFIG_NO_HZ_COMMON
655 * In the semi idle case, use the nearest busy cpu for migrating timers
656 * from an idle cpu. This is good for power-savings.
658 * We don't do similar optimization for completely idle system, as
659 * selecting an idle cpu will add more delays to the timers than intended
660 * (as that cpu's timer base may not be uptodate wrt jiffies etc).
662 int get_nohz_timer_target(int pinned)
664 int cpu = smp_processor_id();
666 struct sched_domain *sd;
668 if (pinned || !get_sysctl_timer_migration() || !idle_cpu(cpu))
672 for_each_domain(cpu, sd) {
673 for_each_cpu(i, sched_domain_span(sd)) {
685 * When add_timer_on() enqueues a timer into the timer wheel of an
686 * idle CPU then this timer might expire before the next timer event
687 * which is scheduled to wake up that CPU. In case of a completely
688 * idle system the next event might even be infinite time into the
689 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
690 * leaves the inner idle loop so the newly added timer is taken into
691 * account when the CPU goes back to idle and evaluates the timer
692 * wheel for the next timer event.
694 static void wake_up_idle_cpu(int cpu)
696 struct rq *rq = cpu_rq(cpu);
698 if (cpu == smp_processor_id())
701 if (set_nr_and_not_polling(rq->idle))
702 smp_send_reschedule(cpu);
704 trace_sched_wake_idle_without_ipi(cpu);
707 static bool wake_up_full_nohz_cpu(int cpu)
710 * We just need the target to call irq_exit() and re-evaluate
711 * the next tick. The nohz full kick at least implies that.
712 * If needed we can still optimize that later with an
715 if (tick_nohz_full_cpu(cpu)) {
716 if (cpu != smp_processor_id() ||
717 tick_nohz_tick_stopped())
718 tick_nohz_full_kick_cpu(cpu);
725 void wake_up_nohz_cpu(int cpu)
727 if (!wake_up_full_nohz_cpu(cpu))
728 wake_up_idle_cpu(cpu);
731 static inline bool got_nohz_idle_kick(void)
733 int cpu = smp_processor_id();
735 if (!test_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu)))
738 if (idle_cpu(cpu) && !need_resched())
742 * We can't run Idle Load Balance on this CPU for this time so we
743 * cancel it and clear NOHZ_BALANCE_KICK
745 clear_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu));
749 #else /* CONFIG_NO_HZ_COMMON */
751 static inline bool got_nohz_idle_kick(void)
756 #endif /* CONFIG_NO_HZ_COMMON */
758 #ifdef CONFIG_NO_HZ_FULL
759 bool sched_can_stop_tick(void)
762 * More than one running task need preemption.
763 * nr_running update is assumed to be visible
764 * after IPI is sent from wakers.
766 if (this_rq()->nr_running > 1)
771 #endif /* CONFIG_NO_HZ_FULL */
773 void sched_avg_update(struct rq *rq)
775 s64 period = sched_avg_period();
777 while ((s64)(rq_clock(rq) - rq->age_stamp) > period) {
779 * Inline assembly required to prevent the compiler
780 * optimising this loop into a divmod call.
781 * See __iter_div_u64_rem() for another example of this.
783 asm("" : "+rm" (rq->age_stamp));
784 rq->age_stamp += period;
789 #endif /* CONFIG_SMP */
791 #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \
792 (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH)))
794 * Iterate task_group tree rooted at *from, calling @down when first entering a
795 * node and @up when leaving it for the final time.
797 * Caller must hold rcu_lock or sufficient equivalent.
799 int walk_tg_tree_from(struct task_group *from,
800 tg_visitor down, tg_visitor up, void *data)
802 struct task_group *parent, *child;
808 ret = (*down)(parent, data);
811 list_for_each_entry_rcu(child, &parent->children, siblings) {
818 ret = (*up)(parent, data);
819 if (ret || parent == from)
823 parent = parent->parent;
830 int tg_nop(struct task_group *tg, void *data)
836 static void set_load_weight(struct task_struct *p)
838 int prio = p->static_prio - MAX_RT_PRIO;
839 struct load_weight *load = &p->se.load;
842 * SCHED_IDLE tasks get minimal weight:
844 if (p->policy == SCHED_IDLE) {
845 load->weight = scale_load(WEIGHT_IDLEPRIO);
846 load->inv_weight = WMULT_IDLEPRIO;
850 load->weight = scale_load(prio_to_weight[prio]);
851 load->inv_weight = prio_to_wmult[prio];
854 static void enqueue_task(struct rq *rq, struct task_struct *p, int flags)
857 sched_info_queued(rq, p);
858 p->sched_class->enqueue_task(rq, p, flags);
861 static void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
864 sched_info_dequeued(rq, p);
865 p->sched_class->dequeue_task(rq, p, flags);
868 void activate_task(struct rq *rq, struct task_struct *p, int flags)
870 if (task_contributes_to_load(p))
871 rq->nr_uninterruptible--;
873 enqueue_task(rq, p, flags);
876 void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
878 if (task_contributes_to_load(p))
879 rq->nr_uninterruptible++;
881 dequeue_task(rq, p, flags);
884 static void update_rq_clock_task(struct rq *rq, s64 delta)
887 * In theory, the compile should just see 0 here, and optimize out the call
888 * to sched_rt_avg_update. But I don't trust it...
890 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
891 s64 steal = 0, irq_delta = 0;
893 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
894 irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time;
897 * Since irq_time is only updated on {soft,}irq_exit, we might run into
898 * this case when a previous update_rq_clock() happened inside a
901 * When this happens, we stop ->clock_task and only update the
902 * prev_irq_time stamp to account for the part that fit, so that a next
903 * update will consume the rest. This ensures ->clock_task is
906 * It does however cause some slight miss-attribution of {soft,}irq
907 * time, a more accurate solution would be to update the irq_time using
908 * the current rq->clock timestamp, except that would require using
911 if (irq_delta > delta)
914 rq->prev_irq_time += irq_delta;
917 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
918 if (static_key_false((¶virt_steal_rq_enabled))) {
919 steal = paravirt_steal_clock(cpu_of(rq));
920 steal -= rq->prev_steal_time_rq;
922 if (unlikely(steal > delta))
925 rq->prev_steal_time_rq += steal;
930 rq->clock_task += delta;
932 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
933 if ((irq_delta + steal) && sched_feat(NONTASK_CAPACITY))
934 sched_rt_avg_update(rq, irq_delta + steal);
938 void sched_set_stop_task(int cpu, struct task_struct *stop)
940 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
941 struct task_struct *old_stop = cpu_rq(cpu)->stop;
945 * Make it appear like a SCHED_FIFO task, its something
946 * userspace knows about and won't get confused about.
948 * Also, it will make PI more or less work without too
949 * much confusion -- but then, stop work should not
950 * rely on PI working anyway.
952 sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m);
954 stop->sched_class = &stop_sched_class;
957 cpu_rq(cpu)->stop = stop;
961 * Reset it back to a normal scheduling class so that
962 * it can die in pieces.
964 old_stop->sched_class = &rt_sched_class;
969 * __normal_prio - return the priority that is based on the static prio
971 static inline int __normal_prio(struct task_struct *p)
973 return p->static_prio;
977 * Calculate the expected normal priority: i.e. priority
978 * without taking RT-inheritance into account. Might be
979 * boosted by interactivity modifiers. Changes upon fork,
980 * setprio syscalls, and whenever the interactivity
981 * estimator recalculates.
983 static inline int normal_prio(struct task_struct *p)
987 if (task_has_dl_policy(p))
988 prio = MAX_DL_PRIO-1;
989 else if (task_has_rt_policy(p))
990 prio = MAX_RT_PRIO-1 - p->rt_priority;
992 prio = __normal_prio(p);
997 * Calculate the current priority, i.e. the priority
998 * taken into account by the scheduler. This value might
999 * be boosted by RT tasks, or might be boosted by
1000 * interactivity modifiers. Will be RT if the task got
1001 * RT-boosted. If not then it returns p->normal_prio.
1003 static int effective_prio(struct task_struct *p)
1005 p->normal_prio = normal_prio(p);
1007 * If we are RT tasks or we were boosted to RT priority,
1008 * keep the priority unchanged. Otherwise, update priority
1009 * to the normal priority:
1011 if (!rt_prio(p->prio))
1012 return p->normal_prio;
1017 * task_curr - is this task currently executing on a CPU?
1018 * @p: the task in question.
1020 * Return: 1 if the task is currently executing. 0 otherwise.
1022 inline int task_curr(const struct task_struct *p)
1024 return cpu_curr(task_cpu(p)) == p;
1027 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1028 const struct sched_class *prev_class,
1031 if (prev_class != p->sched_class) {
1032 if (prev_class->switched_from)
1033 prev_class->switched_from(rq, p);
1034 p->sched_class->switched_to(rq, p);
1035 } else if (oldprio != p->prio || dl_task(p))
1036 p->sched_class->prio_changed(rq, p, oldprio);
1039 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
1041 const struct sched_class *class;
1043 if (p->sched_class == rq->curr->sched_class) {
1044 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
1046 for_each_class(class) {
1047 if (class == rq->curr->sched_class)
1049 if (class == p->sched_class) {
1057 * A queue event has occurred, and we're going to schedule. In
1058 * this case, we can save a useless back to back clock update.
1060 if (task_on_rq_queued(rq->curr) && test_tsk_need_resched(rq->curr))
1061 rq->skip_clock_update = 1;
1065 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1067 #ifdef CONFIG_SCHED_DEBUG
1069 * We should never call set_task_cpu() on a blocked task,
1070 * ttwu() will sort out the placement.
1072 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
1073 !(task_preempt_count(p) & PREEMPT_ACTIVE));
1075 #ifdef CONFIG_LOCKDEP
1077 * The caller should hold either p->pi_lock or rq->lock, when changing
1078 * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks.
1080 * sched_move_task() holds both and thus holding either pins the cgroup,
1083 * Furthermore, all task_rq users should acquire both locks, see
1086 WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) ||
1087 lockdep_is_held(&task_rq(p)->lock)));
1091 trace_sched_migrate_task(p, new_cpu);
1093 if (task_cpu(p) != new_cpu) {
1094 if (p->sched_class->migrate_task_rq)
1095 p->sched_class->migrate_task_rq(p, new_cpu);
1096 p->se.nr_migrations++;
1097 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, NULL, 0);
1100 __set_task_cpu(p, new_cpu);
1103 static void __migrate_swap_task(struct task_struct *p, int cpu)
1105 if (task_on_rq_queued(p)) {
1106 struct rq *src_rq, *dst_rq;
1108 src_rq = task_rq(p);
1109 dst_rq = cpu_rq(cpu);
1111 deactivate_task(src_rq, p, 0);
1112 set_task_cpu(p, cpu);
1113 activate_task(dst_rq, p, 0);
1114 check_preempt_curr(dst_rq, p, 0);
1117 * Task isn't running anymore; make it appear like we migrated
1118 * it before it went to sleep. This means on wakeup we make the
1119 * previous cpu our targer instead of where it really is.
1125 struct migration_swap_arg {
1126 struct task_struct *src_task, *dst_task;
1127 int src_cpu, dst_cpu;
1130 static int migrate_swap_stop(void *data)
1132 struct migration_swap_arg *arg = data;
1133 struct rq *src_rq, *dst_rq;
1136 src_rq = cpu_rq(arg->src_cpu);
1137 dst_rq = cpu_rq(arg->dst_cpu);
1139 double_raw_lock(&arg->src_task->pi_lock,
1140 &arg->dst_task->pi_lock);
1141 double_rq_lock(src_rq, dst_rq);
1142 if (task_cpu(arg->dst_task) != arg->dst_cpu)
1145 if (task_cpu(arg->src_task) != arg->src_cpu)
1148 if (!cpumask_test_cpu(arg->dst_cpu, tsk_cpus_allowed(arg->src_task)))
1151 if (!cpumask_test_cpu(arg->src_cpu, tsk_cpus_allowed(arg->dst_task)))
1154 __migrate_swap_task(arg->src_task, arg->dst_cpu);
1155 __migrate_swap_task(arg->dst_task, arg->src_cpu);
1160 double_rq_unlock(src_rq, dst_rq);
1161 raw_spin_unlock(&arg->dst_task->pi_lock);
1162 raw_spin_unlock(&arg->src_task->pi_lock);
1168 * Cross migrate two tasks
1170 int migrate_swap(struct task_struct *cur, struct task_struct *p)
1172 struct migration_swap_arg arg;
1175 arg = (struct migration_swap_arg){
1177 .src_cpu = task_cpu(cur),
1179 .dst_cpu = task_cpu(p),
1182 if (arg.src_cpu == arg.dst_cpu)
1186 * These three tests are all lockless; this is OK since all of them
1187 * will be re-checked with proper locks held further down the line.
1189 if (!cpu_active(arg.src_cpu) || !cpu_active(arg.dst_cpu))
1192 if (!cpumask_test_cpu(arg.dst_cpu, tsk_cpus_allowed(arg.src_task)))
1195 if (!cpumask_test_cpu(arg.src_cpu, tsk_cpus_allowed(arg.dst_task)))
1198 trace_sched_swap_numa(cur, arg.src_cpu, p, arg.dst_cpu);
1199 ret = stop_two_cpus(arg.dst_cpu, arg.src_cpu, migrate_swap_stop, &arg);
1205 struct migration_arg {
1206 struct task_struct *task;
1210 static int migration_cpu_stop(void *data);
1213 * wait_task_inactive - wait for a thread to unschedule.
1215 * If @match_state is nonzero, it's the @p->state value just checked and
1216 * not expected to change. If it changes, i.e. @p might have woken up,
1217 * then return zero. When we succeed in waiting for @p to be off its CPU,
1218 * we return a positive number (its total switch count). If a second call
1219 * a short while later returns the same number, the caller can be sure that
1220 * @p has remained unscheduled the whole time.
1222 * The caller must ensure that the task *will* unschedule sometime soon,
1223 * else this function might spin for a *long* time. This function can't
1224 * be called with interrupts off, or it may introduce deadlock with
1225 * smp_call_function() if an IPI is sent by the same process we are
1226 * waiting to become inactive.
1228 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
1230 unsigned long flags;
1231 int running, queued;
1237 * We do the initial early heuristics without holding
1238 * any task-queue locks at all. We'll only try to get
1239 * the runqueue lock when things look like they will
1245 * If the task is actively running on another CPU
1246 * still, just relax and busy-wait without holding
1249 * NOTE! Since we don't hold any locks, it's not
1250 * even sure that "rq" stays as the right runqueue!
1251 * But we don't care, since "task_running()" will
1252 * return false if the runqueue has changed and p
1253 * is actually now running somewhere else!
1255 while (task_running(rq, p)) {
1256 if (match_state && unlikely(p->state != match_state))
1262 * Ok, time to look more closely! We need the rq
1263 * lock now, to be *sure*. If we're wrong, we'll
1264 * just go back and repeat.
1266 rq = task_rq_lock(p, &flags);
1267 trace_sched_wait_task(p);
1268 running = task_running(rq, p);
1269 queued = task_on_rq_queued(p);
1271 if (!match_state || p->state == match_state)
1272 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
1273 task_rq_unlock(rq, p, &flags);
1276 * If it changed from the expected state, bail out now.
1278 if (unlikely(!ncsw))
1282 * Was it really running after all now that we
1283 * checked with the proper locks actually held?
1285 * Oops. Go back and try again..
1287 if (unlikely(running)) {
1293 * It's not enough that it's not actively running,
1294 * it must be off the runqueue _entirely_, and not
1297 * So if it was still runnable (but just not actively
1298 * running right now), it's preempted, and we should
1299 * yield - it could be a while.
1301 if (unlikely(queued)) {
1302 ktime_t to = ktime_set(0, NSEC_PER_SEC/HZ);
1304 set_current_state(TASK_UNINTERRUPTIBLE);
1305 schedule_hrtimeout(&to, HRTIMER_MODE_REL);
1310 * Ahh, all good. It wasn't running, and it wasn't
1311 * runnable, which means that it will never become
1312 * running in the future either. We're all done!
1321 * kick_process - kick a running thread to enter/exit the kernel
1322 * @p: the to-be-kicked thread
1324 * Cause a process which is running on another CPU to enter
1325 * kernel-mode, without any delay. (to get signals handled.)
1327 * NOTE: this function doesn't have to take the runqueue lock,
1328 * because all it wants to ensure is that the remote task enters
1329 * the kernel. If the IPI races and the task has been migrated
1330 * to another CPU then no harm is done and the purpose has been
1333 void kick_process(struct task_struct *p)
1339 if ((cpu != smp_processor_id()) && task_curr(p))
1340 smp_send_reschedule(cpu);
1343 EXPORT_SYMBOL_GPL(kick_process);
1344 #endif /* CONFIG_SMP */
1348 * ->cpus_allowed is protected by both rq->lock and p->pi_lock
1350 static int select_fallback_rq(int cpu, struct task_struct *p)
1352 int nid = cpu_to_node(cpu);
1353 const struct cpumask *nodemask = NULL;
1354 enum { cpuset, possible, fail } state = cpuset;
1358 * If the node that the cpu is on has been offlined, cpu_to_node()
1359 * will return -1. There is no cpu on the node, and we should
1360 * select the cpu on the other node.
1363 nodemask = cpumask_of_node(nid);
1365 /* Look for allowed, online CPU in same node. */
1366 for_each_cpu(dest_cpu, nodemask) {
1367 if (!cpu_online(dest_cpu))
1369 if (!cpu_active(dest_cpu))
1371 if (cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
1377 /* Any allowed, online CPU? */
1378 for_each_cpu(dest_cpu, tsk_cpus_allowed(p)) {
1379 if (!cpu_online(dest_cpu))
1381 if (!cpu_active(dest_cpu))
1388 /* No more Mr. Nice Guy. */
1389 cpuset_cpus_allowed_fallback(p);
1394 do_set_cpus_allowed(p, cpu_possible_mask);
1405 if (state != cpuset) {
1407 * Don't tell them about moving exiting tasks or
1408 * kernel threads (both mm NULL), since they never
1411 if (p->mm && printk_ratelimit()) {
1412 printk_deferred("process %d (%s) no longer affine to cpu%d\n",
1413 task_pid_nr(p), p->comm, cpu);
1421 * The caller (fork, wakeup) owns p->pi_lock, ->cpus_allowed is stable.
1424 int select_task_rq(struct task_struct *p, int cpu, int sd_flags, int wake_flags)
1426 cpu = p->sched_class->select_task_rq(p, cpu, sd_flags, wake_flags);
1429 * In order not to call set_task_cpu() on a blocking task we need
1430 * to rely on ttwu() to place the task on a valid ->cpus_allowed
1433 * Since this is common to all placement strategies, this lives here.
1435 * [ this allows ->select_task() to simply return task_cpu(p) and
1436 * not worry about this generic constraint ]
1438 if (unlikely(!cpumask_test_cpu(cpu, tsk_cpus_allowed(p)) ||
1440 cpu = select_fallback_rq(task_cpu(p), p);
1445 static void update_avg(u64 *avg, u64 sample)
1447 s64 diff = sample - *avg;
1453 ttwu_stat(struct task_struct *p, int cpu, int wake_flags)
1455 #ifdef CONFIG_SCHEDSTATS
1456 struct rq *rq = this_rq();
1459 int this_cpu = smp_processor_id();
1461 if (cpu == this_cpu) {
1462 schedstat_inc(rq, ttwu_local);
1463 schedstat_inc(p, se.statistics.nr_wakeups_local);
1465 struct sched_domain *sd;
1467 schedstat_inc(p, se.statistics.nr_wakeups_remote);
1469 for_each_domain(this_cpu, sd) {
1470 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
1471 schedstat_inc(sd, ttwu_wake_remote);
1478 if (wake_flags & WF_MIGRATED)
1479 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
1481 #endif /* CONFIG_SMP */
1483 schedstat_inc(rq, ttwu_count);
1484 schedstat_inc(p, se.statistics.nr_wakeups);
1486 if (wake_flags & WF_SYNC)
1487 schedstat_inc(p, se.statistics.nr_wakeups_sync);
1489 #endif /* CONFIG_SCHEDSTATS */
1492 static void ttwu_activate(struct rq *rq, struct task_struct *p, int en_flags)
1494 activate_task(rq, p, en_flags);
1495 p->on_rq = TASK_ON_RQ_QUEUED;
1497 /* if a worker is waking up, notify workqueue */
1498 if (p->flags & PF_WQ_WORKER)
1499 wq_worker_waking_up(p, cpu_of(rq));
1503 * Mark the task runnable and perform wakeup-preemption.
1506 ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags)
1508 check_preempt_curr(rq, p, wake_flags);
1509 trace_sched_wakeup(p, true);
1511 p->state = TASK_RUNNING;
1513 if (p->sched_class->task_woken)
1514 p->sched_class->task_woken(rq, p);
1516 if (rq->idle_stamp) {
1517 u64 delta = rq_clock(rq) - rq->idle_stamp;
1518 u64 max = 2*rq->max_idle_balance_cost;
1520 update_avg(&rq->avg_idle, delta);
1522 if (rq->avg_idle > max)
1531 ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags)
1534 if (p->sched_contributes_to_load)
1535 rq->nr_uninterruptible--;
1538 ttwu_activate(rq, p, ENQUEUE_WAKEUP | ENQUEUE_WAKING);
1539 ttwu_do_wakeup(rq, p, wake_flags);
1543 * Called in case the task @p isn't fully descheduled from its runqueue,
1544 * in this case we must do a remote wakeup. Its a 'light' wakeup though,
1545 * since all we need to do is flip p->state to TASK_RUNNING, since
1546 * the task is still ->on_rq.
1548 static int ttwu_remote(struct task_struct *p, int wake_flags)
1553 rq = __task_rq_lock(p);
1554 if (task_on_rq_queued(p)) {
1555 /* check_preempt_curr() may use rq clock */
1556 update_rq_clock(rq);
1557 ttwu_do_wakeup(rq, p, wake_flags);
1560 __task_rq_unlock(rq);
1566 void sched_ttwu_pending(void)
1568 struct rq *rq = this_rq();
1569 struct llist_node *llist = llist_del_all(&rq->wake_list);
1570 struct task_struct *p;
1571 unsigned long flags;
1576 raw_spin_lock_irqsave(&rq->lock, flags);
1579 p = llist_entry(llist, struct task_struct, wake_entry);
1580 llist = llist_next(llist);
1581 ttwu_do_activate(rq, p, 0);
1584 raw_spin_unlock_irqrestore(&rq->lock, flags);
1587 void scheduler_ipi(void)
1590 * Fold TIF_NEED_RESCHED into the preempt_count; anybody setting
1591 * TIF_NEED_RESCHED remotely (for the first time) will also send
1594 preempt_fold_need_resched();
1596 if (llist_empty(&this_rq()->wake_list) && !got_nohz_idle_kick())
1600 * Not all reschedule IPI handlers call irq_enter/irq_exit, since
1601 * traditionally all their work was done from the interrupt return
1602 * path. Now that we actually do some work, we need to make sure
1605 * Some archs already do call them, luckily irq_enter/exit nest
1608 * Arguably we should visit all archs and update all handlers,
1609 * however a fair share of IPIs are still resched only so this would
1610 * somewhat pessimize the simple resched case.
1613 sched_ttwu_pending();
1616 * Check if someone kicked us for doing the nohz idle load balance.
1618 if (unlikely(got_nohz_idle_kick())) {
1619 this_rq()->idle_balance = 1;
1620 raise_softirq_irqoff(SCHED_SOFTIRQ);
1625 static void ttwu_queue_remote(struct task_struct *p, int cpu)
1627 struct rq *rq = cpu_rq(cpu);
1629 if (llist_add(&p->wake_entry, &cpu_rq(cpu)->wake_list)) {
1630 if (!set_nr_if_polling(rq->idle))
1631 smp_send_reschedule(cpu);
1633 trace_sched_wake_idle_without_ipi(cpu);
1637 void wake_up_if_idle(int cpu)
1639 struct rq *rq = cpu_rq(cpu);
1640 unsigned long flags;
1642 if (!is_idle_task(rq->curr))
1645 if (set_nr_if_polling(rq->idle)) {
1646 trace_sched_wake_idle_without_ipi(cpu);
1648 raw_spin_lock_irqsave(&rq->lock, flags);
1649 if (is_idle_task(rq->curr))
1650 smp_send_reschedule(cpu);
1651 /* Else cpu is not in idle, do nothing here */
1652 raw_spin_unlock_irqrestore(&rq->lock, flags);
1656 bool cpus_share_cache(int this_cpu, int that_cpu)
1658 return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu);
1660 #endif /* CONFIG_SMP */
1662 static void ttwu_queue(struct task_struct *p, int cpu)
1664 struct rq *rq = cpu_rq(cpu);
1666 #if defined(CONFIG_SMP)
1667 if (sched_feat(TTWU_QUEUE) && !cpus_share_cache(smp_processor_id(), cpu)) {
1668 sched_clock_cpu(cpu); /* sync clocks x-cpu */
1669 ttwu_queue_remote(p, cpu);
1674 raw_spin_lock(&rq->lock);
1675 ttwu_do_activate(rq, p, 0);
1676 raw_spin_unlock(&rq->lock);
1680 * try_to_wake_up - wake up a thread
1681 * @p: the thread to be awakened
1682 * @state: the mask of task states that can be woken
1683 * @wake_flags: wake modifier flags (WF_*)
1685 * Put it on the run-queue if it's not already there. The "current"
1686 * thread is always on the run-queue (except when the actual
1687 * re-schedule is in progress), and as such you're allowed to do
1688 * the simpler "current->state = TASK_RUNNING" to mark yourself
1689 * runnable without the overhead of this.
1691 * Return: %true if @p was woken up, %false if it was already running.
1692 * or @state didn't match @p's state.
1695 try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags)
1697 unsigned long flags;
1698 int cpu, success = 0;
1701 * If we are going to wake up a thread waiting for CONDITION we
1702 * need to ensure that CONDITION=1 done by the caller can not be
1703 * reordered with p->state check below. This pairs with mb() in
1704 * set_current_state() the waiting thread does.
1706 smp_mb__before_spinlock();
1707 raw_spin_lock_irqsave(&p->pi_lock, flags);
1708 if (!(p->state & state))
1711 success = 1; /* we're going to change ->state */
1714 if (p->on_rq && ttwu_remote(p, wake_flags))
1719 * If the owning (remote) cpu is still in the middle of schedule() with
1720 * this task as prev, wait until its done referencing the task.
1725 * Pairs with the smp_wmb() in finish_lock_switch().
1729 p->sched_contributes_to_load = !!task_contributes_to_load(p);
1730 p->state = TASK_WAKING;
1732 if (p->sched_class->task_waking)
1733 p->sched_class->task_waking(p);
1735 cpu = select_task_rq(p, p->wake_cpu, SD_BALANCE_WAKE, wake_flags);
1736 if (task_cpu(p) != cpu) {
1737 wake_flags |= WF_MIGRATED;
1738 set_task_cpu(p, cpu);
1740 #endif /* CONFIG_SMP */
1744 ttwu_stat(p, cpu, wake_flags);
1746 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1752 * try_to_wake_up_local - try to wake up a local task with rq lock held
1753 * @p: the thread to be awakened
1755 * Put @p on the run-queue if it's not already there. The caller must
1756 * ensure that this_rq() is locked, @p is bound to this_rq() and not
1759 static void try_to_wake_up_local(struct task_struct *p)
1761 struct rq *rq = task_rq(p);
1763 if (WARN_ON_ONCE(rq != this_rq()) ||
1764 WARN_ON_ONCE(p == current))
1767 lockdep_assert_held(&rq->lock);
1769 if (!raw_spin_trylock(&p->pi_lock)) {
1770 raw_spin_unlock(&rq->lock);
1771 raw_spin_lock(&p->pi_lock);
1772 raw_spin_lock(&rq->lock);
1775 if (!(p->state & TASK_NORMAL))
1778 if (!task_on_rq_queued(p))
1779 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1781 ttwu_do_wakeup(rq, p, 0);
1782 ttwu_stat(p, smp_processor_id(), 0);
1784 raw_spin_unlock(&p->pi_lock);
1788 * wake_up_process - Wake up a specific process
1789 * @p: The process to be woken up.
1791 * Attempt to wake up the nominated process and move it to the set of runnable
1794 * Return: 1 if the process was woken up, 0 if it was already running.
1796 * It may be assumed that this function implies a write memory barrier before
1797 * changing the task state if and only if any tasks are woken up.
1799 int wake_up_process(struct task_struct *p)
1801 WARN_ON(task_is_stopped_or_traced(p));
1802 return try_to_wake_up(p, TASK_NORMAL, 0);
1804 EXPORT_SYMBOL(wake_up_process);
1806 int wake_up_state(struct task_struct *p, unsigned int state)
1808 return try_to_wake_up(p, state, 0);
1812 * This function clears the sched_dl_entity static params.
1814 void __dl_clear_params(struct task_struct *p)
1816 struct sched_dl_entity *dl_se = &p->dl;
1818 dl_se->dl_runtime = 0;
1819 dl_se->dl_deadline = 0;
1820 dl_se->dl_period = 0;
1826 * Perform scheduler related setup for a newly forked process p.
1827 * p is forked by current.
1829 * __sched_fork() is basic setup used by init_idle() too:
1831 static void __sched_fork(unsigned long clone_flags, struct task_struct *p)
1836 p->se.exec_start = 0;
1837 p->se.sum_exec_runtime = 0;
1838 p->se.prev_sum_exec_runtime = 0;
1839 p->se.nr_migrations = 0;
1841 INIT_LIST_HEAD(&p->se.group_node);
1843 #ifdef CONFIG_SCHEDSTATS
1844 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
1847 RB_CLEAR_NODE(&p->dl.rb_node);
1848 hrtimer_init(&p->dl.dl_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1849 __dl_clear_params(p);
1851 INIT_LIST_HEAD(&p->rt.run_list);
1853 #ifdef CONFIG_PREEMPT_NOTIFIERS
1854 INIT_HLIST_HEAD(&p->preempt_notifiers);
1857 #ifdef CONFIG_NUMA_BALANCING
1858 if (p->mm && atomic_read(&p->mm->mm_users) == 1) {
1859 p->mm->numa_next_scan = jiffies + msecs_to_jiffies(sysctl_numa_balancing_scan_delay);
1860 p->mm->numa_scan_seq = 0;
1863 if (clone_flags & CLONE_VM)
1864 p->numa_preferred_nid = current->numa_preferred_nid;
1866 p->numa_preferred_nid = -1;
1868 p->node_stamp = 0ULL;
1869 p->numa_scan_seq = p->mm ? p->mm->numa_scan_seq : 0;
1870 p->numa_scan_period = sysctl_numa_balancing_scan_delay;
1871 p->numa_work.next = &p->numa_work;
1872 p->numa_faults_memory = NULL;
1873 p->numa_faults_buffer_memory = NULL;
1874 p->last_task_numa_placement = 0;
1875 p->last_sum_exec_runtime = 0;
1877 INIT_LIST_HEAD(&p->numa_entry);
1878 p->numa_group = NULL;
1879 #endif /* CONFIG_NUMA_BALANCING */
1882 #ifdef CONFIG_NUMA_BALANCING
1883 #ifdef CONFIG_SCHED_DEBUG
1884 void set_numabalancing_state(bool enabled)
1887 sched_feat_set("NUMA");
1889 sched_feat_set("NO_NUMA");
1892 __read_mostly bool numabalancing_enabled;
1894 void set_numabalancing_state(bool enabled)
1896 numabalancing_enabled = enabled;
1898 #endif /* CONFIG_SCHED_DEBUG */
1900 #ifdef CONFIG_PROC_SYSCTL
1901 int sysctl_numa_balancing(struct ctl_table *table, int write,
1902 void __user *buffer, size_t *lenp, loff_t *ppos)
1906 int state = numabalancing_enabled;
1908 if (write && !capable(CAP_SYS_ADMIN))
1913 err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
1917 set_numabalancing_state(state);
1924 * fork()/clone()-time setup:
1926 int sched_fork(unsigned long clone_flags, struct task_struct *p)
1928 unsigned long flags;
1929 int cpu = get_cpu();
1931 __sched_fork(clone_flags, p);
1933 * We mark the process as running here. This guarantees that
1934 * nobody will actually run it, and a signal or other external
1935 * event cannot wake it up and insert it on the runqueue either.
1937 p->state = TASK_RUNNING;
1940 * Make sure we do not leak PI boosting priority to the child.
1942 p->prio = current->normal_prio;
1945 * Revert to default priority/policy on fork if requested.
1947 if (unlikely(p->sched_reset_on_fork)) {
1948 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
1949 p->policy = SCHED_NORMAL;
1950 p->static_prio = NICE_TO_PRIO(0);
1952 } else if (PRIO_TO_NICE(p->static_prio) < 0)
1953 p->static_prio = NICE_TO_PRIO(0);
1955 p->prio = p->normal_prio = __normal_prio(p);
1959 * We don't need the reset flag anymore after the fork. It has
1960 * fulfilled its duty:
1962 p->sched_reset_on_fork = 0;
1965 if (dl_prio(p->prio)) {
1968 } else if (rt_prio(p->prio)) {
1969 p->sched_class = &rt_sched_class;
1971 p->sched_class = &fair_sched_class;
1974 if (p->sched_class->task_fork)
1975 p->sched_class->task_fork(p);
1978 * The child is not yet in the pid-hash so no cgroup attach races,
1979 * and the cgroup is pinned to this child due to cgroup_fork()
1980 * is ran before sched_fork().
1982 * Silence PROVE_RCU.
1984 raw_spin_lock_irqsave(&p->pi_lock, flags);
1985 set_task_cpu(p, cpu);
1986 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1988 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
1989 if (likely(sched_info_on()))
1990 memset(&p->sched_info, 0, sizeof(p->sched_info));
1992 #if defined(CONFIG_SMP)
1995 init_task_preempt_count(p);
1997 plist_node_init(&p->pushable_tasks, MAX_PRIO);
1998 RB_CLEAR_NODE(&p->pushable_dl_tasks);
2005 unsigned long to_ratio(u64 period, u64 runtime)
2007 if (runtime == RUNTIME_INF)
2011 * Doing this here saves a lot of checks in all
2012 * the calling paths, and returning zero seems
2013 * safe for them anyway.
2018 return div64_u64(runtime << 20, period);
2022 inline struct dl_bw *dl_bw_of(int i)
2024 return &cpu_rq(i)->rd->dl_bw;
2027 static inline int dl_bw_cpus(int i)
2029 struct root_domain *rd = cpu_rq(i)->rd;
2032 for_each_cpu_and(i, rd->span, cpu_active_mask)
2038 inline struct dl_bw *dl_bw_of(int i)
2040 return &cpu_rq(i)->dl.dl_bw;
2043 static inline int dl_bw_cpus(int i)
2050 void __dl_clear(struct dl_bw *dl_b, u64 tsk_bw)
2052 dl_b->total_bw -= tsk_bw;
2056 void __dl_add(struct dl_bw *dl_b, u64 tsk_bw)
2058 dl_b->total_bw += tsk_bw;
2062 bool __dl_overflow(struct dl_bw *dl_b, int cpus, u64 old_bw, u64 new_bw)
2064 return dl_b->bw != -1 &&
2065 dl_b->bw * cpus < dl_b->total_bw - old_bw + new_bw;
2069 * We must be sure that accepting a new task (or allowing changing the
2070 * parameters of an existing one) is consistent with the bandwidth
2071 * constraints. If yes, this function also accordingly updates the currently
2072 * allocated bandwidth to reflect the new situation.
2074 * This function is called while holding p's rq->lock.
2076 static int dl_overflow(struct task_struct *p, int policy,
2077 const struct sched_attr *attr)
2080 struct dl_bw *dl_b = dl_bw_of(task_cpu(p));
2081 u64 period = attr->sched_period ?: attr->sched_deadline;
2082 u64 runtime = attr->sched_runtime;
2083 u64 new_bw = dl_policy(policy) ? to_ratio(period, runtime) : 0;
2086 if (new_bw == p->dl.dl_bw)
2090 * Either if a task, enters, leave, or stays -deadline but changes
2091 * its parameters, we may need to update accordingly the total
2092 * allocated bandwidth of the container.
2094 raw_spin_lock(&dl_b->lock);
2095 cpus = dl_bw_cpus(task_cpu(p));
2096 if (dl_policy(policy) && !task_has_dl_policy(p) &&
2097 !__dl_overflow(dl_b, cpus, 0, new_bw)) {
2098 __dl_add(dl_b, new_bw);
2100 } else if (dl_policy(policy) && task_has_dl_policy(p) &&
2101 !__dl_overflow(dl_b, cpus, p->dl.dl_bw, new_bw)) {
2102 __dl_clear(dl_b, p->dl.dl_bw);
2103 __dl_add(dl_b, new_bw);
2105 } else if (!dl_policy(policy) && task_has_dl_policy(p)) {
2106 __dl_clear(dl_b, p->dl.dl_bw);
2109 raw_spin_unlock(&dl_b->lock);
2114 extern void init_dl_bw(struct dl_bw *dl_b);
2117 * wake_up_new_task - wake up a newly created task for the first time.
2119 * This function will do some initial scheduler statistics housekeeping
2120 * that must be done for every newly created context, then puts the task
2121 * on the runqueue and wakes it.
2123 void wake_up_new_task(struct task_struct *p)
2125 unsigned long flags;
2128 raw_spin_lock_irqsave(&p->pi_lock, flags);
2131 * Fork balancing, do it here and not earlier because:
2132 * - cpus_allowed can change in the fork path
2133 * - any previously selected cpu might disappear through hotplug
2135 set_task_cpu(p, select_task_rq(p, task_cpu(p), SD_BALANCE_FORK, 0));
2138 /* Initialize new task's runnable average */
2139 init_task_runnable_average(p);
2140 rq = __task_rq_lock(p);
2141 activate_task(rq, p, 0);
2142 p->on_rq = TASK_ON_RQ_QUEUED;
2143 trace_sched_wakeup_new(p, true);
2144 check_preempt_curr(rq, p, WF_FORK);
2146 if (p->sched_class->task_woken)
2147 p->sched_class->task_woken(rq, p);
2149 task_rq_unlock(rq, p, &flags);
2152 #ifdef CONFIG_PREEMPT_NOTIFIERS
2155 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2156 * @notifier: notifier struct to register
2158 void preempt_notifier_register(struct preempt_notifier *notifier)
2160 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2162 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2165 * preempt_notifier_unregister - no longer interested in preemption notifications
2166 * @notifier: notifier struct to unregister
2168 * This is safe to call from within a preemption notifier.
2170 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2172 hlist_del(¬ifier->link);
2174 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2176 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2178 struct preempt_notifier *notifier;
2180 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
2181 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2185 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2186 struct task_struct *next)
2188 struct preempt_notifier *notifier;
2190 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
2191 notifier->ops->sched_out(notifier, next);
2194 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2196 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2201 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2202 struct task_struct *next)
2206 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2209 * prepare_task_switch - prepare to switch tasks
2210 * @rq: the runqueue preparing to switch
2211 * @prev: the current task that is being switched out
2212 * @next: the task we are going to switch to.
2214 * This is called with the rq lock held and interrupts off. It must
2215 * be paired with a subsequent finish_task_switch after the context
2218 * prepare_task_switch sets up locking and calls architecture specific
2222 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2223 struct task_struct *next)
2225 trace_sched_switch(prev, next);
2226 sched_info_switch(rq, prev, next);
2227 perf_event_task_sched_out(prev, next);
2228 fire_sched_out_preempt_notifiers(prev, next);
2229 prepare_lock_switch(rq, next);
2230 prepare_arch_switch(next);
2234 * finish_task_switch - clean up after a task-switch
2235 * @rq: runqueue associated with task-switch
2236 * @prev: the thread we just switched away from.
2238 * finish_task_switch must be called after the context switch, paired
2239 * with a prepare_task_switch call before the context switch.
2240 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2241 * and do any other architecture-specific cleanup actions.
2243 * Note that we may have delayed dropping an mm in context_switch(). If
2244 * so, we finish that here outside of the runqueue lock. (Doing it
2245 * with the lock held can cause deadlocks; see schedule() for
2248 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2249 __releases(rq->lock)
2251 struct mm_struct *mm = rq->prev_mm;
2257 * A task struct has one reference for the use as "current".
2258 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2259 * schedule one last time. The schedule call will never return, and
2260 * the scheduled task must drop that reference.
2261 * The test for TASK_DEAD must occur while the runqueue locks are
2262 * still held, otherwise prev could be scheduled on another cpu, die
2263 * there before we look at prev->state, and then the reference would
2265 * Manfred Spraul <manfred@colorfullife.com>
2267 prev_state = prev->state;
2268 vtime_task_switch(prev);
2269 finish_arch_switch(prev);
2270 perf_event_task_sched_in(prev, current);
2271 finish_lock_switch(rq, prev);
2272 finish_arch_post_lock_switch();
2274 fire_sched_in_preempt_notifiers(current);
2277 if (unlikely(prev_state == TASK_DEAD)) {
2278 if (prev->sched_class->task_dead)
2279 prev->sched_class->task_dead(prev);
2282 * Remove function-return probe instances associated with this
2283 * task and put them back on the free list.
2285 kprobe_flush_task(prev);
2286 put_task_struct(prev);
2289 tick_nohz_task_switch(current);
2294 /* rq->lock is NOT held, but preemption is disabled */
2295 static inline void post_schedule(struct rq *rq)
2297 if (rq->post_schedule) {
2298 unsigned long flags;
2300 raw_spin_lock_irqsave(&rq->lock, flags);
2301 if (rq->curr->sched_class->post_schedule)
2302 rq->curr->sched_class->post_schedule(rq);
2303 raw_spin_unlock_irqrestore(&rq->lock, flags);
2305 rq->post_schedule = 0;
2311 static inline void post_schedule(struct rq *rq)
2318 * schedule_tail - first thing a freshly forked thread must call.
2319 * @prev: the thread we just switched away from.
2321 asmlinkage __visible void schedule_tail(struct task_struct *prev)
2322 __releases(rq->lock)
2324 struct rq *rq = this_rq();
2326 finish_task_switch(rq, prev);
2329 * FIXME: do we need to worry about rq being invalidated by the
2334 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2335 /* In this case, finish_task_switch does not reenable preemption */
2338 if (current->set_child_tid)
2339 put_user(task_pid_vnr(current), current->set_child_tid);
2343 * context_switch - switch to the new MM and the new
2344 * thread's register state.
2347 context_switch(struct rq *rq, struct task_struct *prev,
2348 struct task_struct *next)
2350 struct mm_struct *mm, *oldmm;
2352 prepare_task_switch(rq, prev, next);
2355 oldmm = prev->active_mm;
2357 * For paravirt, this is coupled with an exit in switch_to to
2358 * combine the page table reload and the switch backend into
2361 arch_start_context_switch(prev);
2364 next->active_mm = oldmm;
2365 atomic_inc(&oldmm->mm_count);
2366 enter_lazy_tlb(oldmm, next);
2368 switch_mm(oldmm, mm, next);
2371 prev->active_mm = NULL;
2372 rq->prev_mm = oldmm;
2375 * Since the runqueue lock will be released by the next
2376 * task (which is an invalid locking op but in the case
2377 * of the scheduler it's an obvious special-case), so we
2378 * do an early lockdep release here:
2380 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2381 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2384 context_tracking_task_switch(prev, next);
2385 /* Here we just switch the register state and the stack. */
2386 switch_to(prev, next, prev);
2390 * this_rq must be evaluated again because prev may have moved
2391 * CPUs since it called schedule(), thus the 'rq' on its stack
2392 * frame will be invalid.
2394 finish_task_switch(this_rq(), prev);
2398 * nr_running and nr_context_switches:
2400 * externally visible scheduler statistics: current number of runnable
2401 * threads, total number of context switches performed since bootup.
2403 unsigned long nr_running(void)
2405 unsigned long i, sum = 0;
2407 for_each_online_cpu(i)
2408 sum += cpu_rq(i)->nr_running;
2413 unsigned long long nr_context_switches(void)
2416 unsigned long long sum = 0;
2418 for_each_possible_cpu(i)
2419 sum += cpu_rq(i)->nr_switches;
2424 unsigned long nr_iowait(void)
2426 unsigned long i, sum = 0;
2428 for_each_possible_cpu(i)
2429 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2434 unsigned long nr_iowait_cpu(int cpu)
2436 struct rq *this = cpu_rq(cpu);
2437 return atomic_read(&this->nr_iowait);
2440 void get_iowait_load(unsigned long *nr_waiters, unsigned long *load)
2442 struct rq *this = this_rq();
2443 *nr_waiters = atomic_read(&this->nr_iowait);
2444 *load = this->cpu_load[0];
2450 * sched_exec - execve() is a valuable balancing opportunity, because at
2451 * this point the task has the smallest effective memory and cache footprint.
2453 void sched_exec(void)
2455 struct task_struct *p = current;
2456 unsigned long flags;
2459 raw_spin_lock_irqsave(&p->pi_lock, flags);
2460 dest_cpu = p->sched_class->select_task_rq(p, task_cpu(p), SD_BALANCE_EXEC, 0);
2461 if (dest_cpu == smp_processor_id())
2464 if (likely(cpu_active(dest_cpu))) {
2465 struct migration_arg arg = { p, dest_cpu };
2467 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2468 stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg);
2472 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2477 DEFINE_PER_CPU(struct kernel_stat, kstat);
2478 DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat);
2480 EXPORT_PER_CPU_SYMBOL(kstat);
2481 EXPORT_PER_CPU_SYMBOL(kernel_cpustat);
2484 * Return any ns on the sched_clock that have not yet been accounted in
2485 * @p in case that task is currently running.
2487 * Called with task_rq_lock() held on @rq.
2489 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
2494 * Must be ->curr _and_ ->on_rq. If dequeued, we would
2495 * project cycles that may never be accounted to this
2496 * thread, breaking clock_gettime().
2498 if (task_current(rq, p) && task_on_rq_queued(p)) {
2499 update_rq_clock(rq);
2500 ns = rq_clock_task(rq) - p->se.exec_start;
2508 unsigned long long task_delta_exec(struct task_struct *p)
2510 unsigned long flags;
2514 rq = task_rq_lock(p, &flags);
2515 ns = do_task_delta_exec(p, rq);
2516 task_rq_unlock(rq, p, &flags);
2522 * Return accounted runtime for the task.
2523 * In case the task is currently running, return the runtime plus current's
2524 * pending runtime that have not been accounted yet.
2526 unsigned long long task_sched_runtime(struct task_struct *p)
2528 unsigned long flags;
2532 #if defined(CONFIG_64BIT) && defined(CONFIG_SMP)
2534 * 64-bit doesn't need locks to atomically read a 64bit value.
2535 * So we have a optimization chance when the task's delta_exec is 0.
2536 * Reading ->on_cpu is racy, but this is ok.
2538 * If we race with it leaving cpu, we'll take a lock. So we're correct.
2539 * If we race with it entering cpu, unaccounted time is 0. This is
2540 * indistinguishable from the read occurring a few cycles earlier.
2541 * If we see ->on_cpu without ->on_rq, the task is leaving, and has
2542 * been accounted, so we're correct here as well.
2544 if (!p->on_cpu || !task_on_rq_queued(p))
2545 return p->se.sum_exec_runtime;
2548 rq = task_rq_lock(p, &flags);
2549 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
2550 task_rq_unlock(rq, p, &flags);
2556 * This function gets called by the timer code, with HZ frequency.
2557 * We call it with interrupts disabled.
2559 void scheduler_tick(void)
2561 int cpu = smp_processor_id();
2562 struct rq *rq = cpu_rq(cpu);
2563 struct task_struct *curr = rq->curr;
2567 raw_spin_lock(&rq->lock);
2568 update_rq_clock(rq);
2569 curr->sched_class->task_tick(rq, curr, 0);
2570 update_cpu_load_active(rq);
2571 raw_spin_unlock(&rq->lock);
2573 perf_event_task_tick();
2576 rq->idle_balance = idle_cpu(cpu);
2577 trigger_load_balance(rq);
2579 rq_last_tick_reset(rq);
2582 #ifdef CONFIG_NO_HZ_FULL
2584 * scheduler_tick_max_deferment
2586 * Keep at least one tick per second when a single
2587 * active task is running because the scheduler doesn't
2588 * yet completely support full dynticks environment.
2590 * This makes sure that uptime, CFS vruntime, load
2591 * balancing, etc... continue to move forward, even
2592 * with a very low granularity.
2594 * Return: Maximum deferment in nanoseconds.
2596 u64 scheduler_tick_max_deferment(void)
2598 struct rq *rq = this_rq();
2599 unsigned long next, now = ACCESS_ONCE(jiffies);
2601 next = rq->last_sched_tick + HZ;
2603 if (time_before_eq(next, now))
2606 return jiffies_to_nsecs(next - now);
2610 notrace unsigned long get_parent_ip(unsigned long addr)
2612 if (in_lock_functions(addr)) {
2613 addr = CALLER_ADDR2;
2614 if (in_lock_functions(addr))
2615 addr = CALLER_ADDR3;
2620 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
2621 defined(CONFIG_PREEMPT_TRACER))
2623 void preempt_count_add(int val)
2625 #ifdef CONFIG_DEBUG_PREEMPT
2629 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
2632 __preempt_count_add(val);
2633 #ifdef CONFIG_DEBUG_PREEMPT
2635 * Spinlock count overflowing soon?
2637 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
2640 if (preempt_count() == val) {
2641 unsigned long ip = get_parent_ip(CALLER_ADDR1);
2642 #ifdef CONFIG_DEBUG_PREEMPT
2643 current->preempt_disable_ip = ip;
2645 trace_preempt_off(CALLER_ADDR0, ip);
2648 EXPORT_SYMBOL(preempt_count_add);
2649 NOKPROBE_SYMBOL(preempt_count_add);
2651 void preempt_count_sub(int val)
2653 #ifdef CONFIG_DEBUG_PREEMPT
2657 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
2660 * Is the spinlock portion underflowing?
2662 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
2663 !(preempt_count() & PREEMPT_MASK)))
2667 if (preempt_count() == val)
2668 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
2669 __preempt_count_sub(val);
2671 EXPORT_SYMBOL(preempt_count_sub);
2672 NOKPROBE_SYMBOL(preempt_count_sub);
2677 * Print scheduling while atomic bug:
2679 static noinline void __schedule_bug(struct task_struct *prev)
2681 if (oops_in_progress)
2684 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
2685 prev->comm, prev->pid, preempt_count());
2687 debug_show_held_locks(prev);
2689 if (irqs_disabled())
2690 print_irqtrace_events(prev);
2691 #ifdef CONFIG_DEBUG_PREEMPT
2692 if (in_atomic_preempt_off()) {
2693 pr_err("Preemption disabled at:");
2694 print_ip_sym(current->preempt_disable_ip);
2699 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
2703 * Various schedule()-time debugging checks and statistics:
2705 static inline void schedule_debug(struct task_struct *prev)
2707 #ifdef CONFIG_SCHED_STACK_END_CHECK
2708 BUG_ON(unlikely(task_stack_end_corrupted(prev)));
2711 * Test if we are atomic. Since do_exit() needs to call into
2712 * schedule() atomically, we ignore that path. Otherwise whine
2713 * if we are scheduling when we should not.
2715 if (unlikely(in_atomic_preempt_off() && prev->state != TASK_DEAD))
2716 __schedule_bug(prev);
2719 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
2721 schedstat_inc(this_rq(), sched_count);
2725 * Pick up the highest-prio task:
2727 static inline struct task_struct *
2728 pick_next_task(struct rq *rq, struct task_struct *prev)
2730 const struct sched_class *class = &fair_sched_class;
2731 struct task_struct *p;
2734 * Optimization: we know that if all tasks are in
2735 * the fair class we can call that function directly:
2737 if (likely(prev->sched_class == class &&
2738 rq->nr_running == rq->cfs.h_nr_running)) {
2739 p = fair_sched_class.pick_next_task(rq, prev);
2740 if (unlikely(p == RETRY_TASK))
2743 /* assumes fair_sched_class->next == idle_sched_class */
2745 p = idle_sched_class.pick_next_task(rq, prev);
2751 for_each_class(class) {
2752 p = class->pick_next_task(rq, prev);
2754 if (unlikely(p == RETRY_TASK))
2760 BUG(); /* the idle class will always have a runnable task */
2764 * __schedule() is the main scheduler function.
2766 * The main means of driving the scheduler and thus entering this function are:
2768 * 1. Explicit blocking: mutex, semaphore, waitqueue, etc.
2770 * 2. TIF_NEED_RESCHED flag is checked on interrupt and userspace return
2771 * paths. For example, see arch/x86/entry_64.S.
2773 * To drive preemption between tasks, the scheduler sets the flag in timer
2774 * interrupt handler scheduler_tick().
2776 * 3. Wakeups don't really cause entry into schedule(). They add a
2777 * task to the run-queue and that's it.
2779 * Now, if the new task added to the run-queue preempts the current
2780 * task, then the wakeup sets TIF_NEED_RESCHED and schedule() gets
2781 * called on the nearest possible occasion:
2783 * - If the kernel is preemptible (CONFIG_PREEMPT=y):
2785 * - in syscall or exception context, at the next outmost
2786 * preempt_enable(). (this might be as soon as the wake_up()'s
2789 * - in IRQ context, return from interrupt-handler to
2790 * preemptible context
2792 * - If the kernel is not preemptible (CONFIG_PREEMPT is not set)
2795 * - cond_resched() call
2796 * - explicit schedule() call
2797 * - return from syscall or exception to user-space
2798 * - return from interrupt-handler to user-space
2800 static void __sched __schedule(void)
2802 struct task_struct *prev, *next;
2803 unsigned long *switch_count;
2809 cpu = smp_processor_id();
2811 rcu_note_context_switch(cpu);
2814 schedule_debug(prev);
2816 if (sched_feat(HRTICK))
2820 * Make sure that signal_pending_state()->signal_pending() below
2821 * can't be reordered with __set_current_state(TASK_INTERRUPTIBLE)
2822 * done by the caller to avoid the race with signal_wake_up().
2824 smp_mb__before_spinlock();
2825 raw_spin_lock_irq(&rq->lock);
2827 switch_count = &prev->nivcsw;
2828 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
2829 if (unlikely(signal_pending_state(prev->state, prev))) {
2830 prev->state = TASK_RUNNING;
2832 deactivate_task(rq, prev, DEQUEUE_SLEEP);
2836 * If a worker went to sleep, notify and ask workqueue
2837 * whether it wants to wake up a task to maintain
2840 if (prev->flags & PF_WQ_WORKER) {
2841 struct task_struct *to_wakeup;
2843 to_wakeup = wq_worker_sleeping(prev, cpu);
2845 try_to_wake_up_local(to_wakeup);
2848 switch_count = &prev->nvcsw;
2851 if (task_on_rq_queued(prev) || rq->skip_clock_update < 0)
2852 update_rq_clock(rq);
2854 next = pick_next_task(rq, prev);
2855 clear_tsk_need_resched(prev);
2856 clear_preempt_need_resched();
2857 rq->skip_clock_update = 0;
2859 if (likely(prev != next)) {
2864 context_switch(rq, prev, next); /* unlocks the rq */
2866 * The context switch have flipped the stack from under us
2867 * and restored the local variables which were saved when
2868 * this task called schedule() in the past. prev == current
2869 * is still correct, but it can be moved to another cpu/rq.
2871 cpu = smp_processor_id();
2874 raw_spin_unlock_irq(&rq->lock);
2878 sched_preempt_enable_no_resched();
2883 static inline void sched_submit_work(struct task_struct *tsk)
2885 if (!tsk->state || tsk_is_pi_blocked(tsk))
2888 * If we are going to sleep and we have plugged IO queued,
2889 * make sure to submit it to avoid deadlocks.
2891 if (blk_needs_flush_plug(tsk))
2892 blk_schedule_flush_plug(tsk);
2895 asmlinkage __visible void __sched schedule(void)
2897 struct task_struct *tsk = current;
2899 sched_submit_work(tsk);
2902 EXPORT_SYMBOL(schedule);
2904 #ifdef CONFIG_CONTEXT_TRACKING
2905 asmlinkage __visible void __sched schedule_user(void)
2908 * If we come here after a random call to set_need_resched(),
2909 * or we have been woken up remotely but the IPI has not yet arrived,
2910 * we haven't yet exited the RCU idle mode. Do it here manually until
2911 * we find a better solution.
2920 * schedule_preempt_disabled - called with preemption disabled
2922 * Returns with preemption disabled. Note: preempt_count must be 1
2924 void __sched schedule_preempt_disabled(void)
2926 sched_preempt_enable_no_resched();
2931 #ifdef CONFIG_PREEMPT
2933 * this is the entry point to schedule() from in-kernel preemption
2934 * off of preempt_enable. Kernel preemptions off return from interrupt
2935 * occur there and call schedule directly.
2937 asmlinkage __visible void __sched notrace preempt_schedule(void)
2940 * If there is a non-zero preempt_count or interrupts are disabled,
2941 * we do not want to preempt the current task. Just return..
2943 if (likely(!preemptible()))
2947 __preempt_count_add(PREEMPT_ACTIVE);
2949 __preempt_count_sub(PREEMPT_ACTIVE);
2952 * Check again in case we missed a preemption opportunity
2953 * between schedule and now.
2956 } while (need_resched());
2958 NOKPROBE_SYMBOL(preempt_schedule);
2959 EXPORT_SYMBOL(preempt_schedule);
2960 #endif /* CONFIG_PREEMPT */
2963 * this is the entry point to schedule() from kernel preemption
2964 * off of irq context.
2965 * Note, that this is called and return with irqs disabled. This will
2966 * protect us against recursive calling from irq.
2968 asmlinkage __visible void __sched preempt_schedule_irq(void)
2970 enum ctx_state prev_state;
2972 /* Catch callers which need to be fixed */
2973 BUG_ON(preempt_count() || !irqs_disabled());
2975 prev_state = exception_enter();
2978 __preempt_count_add(PREEMPT_ACTIVE);
2981 local_irq_disable();
2982 __preempt_count_sub(PREEMPT_ACTIVE);
2985 * Check again in case we missed a preemption opportunity
2986 * between schedule and now.
2989 } while (need_resched());
2991 exception_exit(prev_state);
2994 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
2997 return try_to_wake_up(curr->private, mode, wake_flags);
2999 EXPORT_SYMBOL(default_wake_function);
3001 #ifdef CONFIG_RT_MUTEXES
3004 * rt_mutex_setprio - set the current priority of a task
3006 * @prio: prio value (kernel-internal form)
3008 * This function changes the 'effective' priority of a task. It does
3009 * not touch ->normal_prio like __setscheduler().
3011 * Used by the rt_mutex code to implement priority inheritance
3012 * logic. Call site only calls if the priority of the task changed.
3014 void rt_mutex_setprio(struct task_struct *p, int prio)
3016 int oldprio, queued, running, enqueue_flag = 0;
3018 const struct sched_class *prev_class;
3020 BUG_ON(prio > MAX_PRIO);
3022 rq = __task_rq_lock(p);
3025 * Idle task boosting is a nono in general. There is one
3026 * exception, when PREEMPT_RT and NOHZ is active:
3028 * The idle task calls get_next_timer_interrupt() and holds
3029 * the timer wheel base->lock on the CPU and another CPU wants
3030 * to access the timer (probably to cancel it). We can safely
3031 * ignore the boosting request, as the idle CPU runs this code
3032 * with interrupts disabled and will complete the lock
3033 * protected section without being interrupted. So there is no
3034 * real need to boost.
3036 if (unlikely(p == rq->idle)) {
3037 WARN_ON(p != rq->curr);
3038 WARN_ON(p->pi_blocked_on);
3042 trace_sched_pi_setprio(p, prio);
3044 prev_class = p->sched_class;
3045 queued = task_on_rq_queued(p);
3046 running = task_current(rq, p);
3048 dequeue_task(rq, p, 0);
3050 put_prev_task(rq, p);
3053 * Boosting condition are:
3054 * 1. -rt task is running and holds mutex A
3055 * --> -dl task blocks on mutex A
3057 * 2. -dl task is running and holds mutex A
3058 * --> -dl task blocks on mutex A and could preempt the
3061 if (dl_prio(prio)) {
3062 struct task_struct *pi_task = rt_mutex_get_top_task(p);
3063 if (!dl_prio(p->normal_prio) ||
3064 (pi_task && dl_entity_preempt(&pi_task->dl, &p->dl))) {
3065 p->dl.dl_boosted = 1;
3066 p->dl.dl_throttled = 0;
3067 enqueue_flag = ENQUEUE_REPLENISH;
3069 p->dl.dl_boosted = 0;
3070 p->sched_class = &dl_sched_class;
3071 } else if (rt_prio(prio)) {
3072 if (dl_prio(oldprio))
3073 p->dl.dl_boosted = 0;
3075 enqueue_flag = ENQUEUE_HEAD;
3076 p->sched_class = &rt_sched_class;
3078 if (dl_prio(oldprio))
3079 p->dl.dl_boosted = 0;
3080 p->sched_class = &fair_sched_class;
3086 p->sched_class->set_curr_task(rq);
3088 enqueue_task(rq, p, enqueue_flag);
3090 check_class_changed(rq, p, prev_class, oldprio);
3092 __task_rq_unlock(rq);
3096 void set_user_nice(struct task_struct *p, long nice)
3098 int old_prio, delta, queued;
3099 unsigned long flags;
3102 if (task_nice(p) == nice || nice < MIN_NICE || nice > MAX_NICE)
3105 * We have to be careful, if called from sys_setpriority(),
3106 * the task might be in the middle of scheduling on another CPU.
3108 rq = task_rq_lock(p, &flags);
3110 * The RT priorities are set via sched_setscheduler(), but we still
3111 * allow the 'normal' nice value to be set - but as expected
3112 * it wont have any effect on scheduling until the task is
3113 * SCHED_DEADLINE, SCHED_FIFO or SCHED_RR:
3115 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
3116 p->static_prio = NICE_TO_PRIO(nice);
3119 queued = task_on_rq_queued(p);
3121 dequeue_task(rq, p, 0);
3123 p->static_prio = NICE_TO_PRIO(nice);
3126 p->prio = effective_prio(p);
3127 delta = p->prio - old_prio;
3130 enqueue_task(rq, p, 0);
3132 * If the task increased its priority or is running and
3133 * lowered its priority, then reschedule its CPU:
3135 if (delta < 0 || (delta > 0 && task_running(rq, p)))
3139 task_rq_unlock(rq, p, &flags);
3141 EXPORT_SYMBOL(set_user_nice);
3144 * can_nice - check if a task can reduce its nice value
3148 int can_nice(const struct task_struct *p, const int nice)
3150 /* convert nice value [19,-20] to rlimit style value [1,40] */
3151 int nice_rlim = nice_to_rlimit(nice);
3153 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
3154 capable(CAP_SYS_NICE));
3157 #ifdef __ARCH_WANT_SYS_NICE
3160 * sys_nice - change the priority of the current process.
3161 * @increment: priority increment
3163 * sys_setpriority is a more generic, but much slower function that
3164 * does similar things.
3166 SYSCALL_DEFINE1(nice, int, increment)
3171 * Setpriority might change our priority at the same moment.
3172 * We don't have to worry. Conceptually one call occurs first
3173 * and we have a single winner.
3175 increment = clamp(increment, -NICE_WIDTH, NICE_WIDTH);
3176 nice = task_nice(current) + increment;
3178 nice = clamp_val(nice, MIN_NICE, MAX_NICE);
3179 if (increment < 0 && !can_nice(current, nice))
3182 retval = security_task_setnice(current, nice);
3186 set_user_nice(current, nice);
3193 * task_prio - return the priority value of a given task.
3194 * @p: the task in question.
3196 * Return: The priority value as seen by users in /proc.
3197 * RT tasks are offset by -200. Normal tasks are centered
3198 * around 0, value goes from -16 to +15.
3200 int task_prio(const struct task_struct *p)
3202 return p->prio - MAX_RT_PRIO;
3206 * idle_cpu - is a given cpu idle currently?
3207 * @cpu: the processor in question.
3209 * Return: 1 if the CPU is currently idle. 0 otherwise.
3211 int idle_cpu(int cpu)
3213 struct rq *rq = cpu_rq(cpu);
3215 if (rq->curr != rq->idle)
3222 if (!llist_empty(&rq->wake_list))
3230 * idle_task - return the idle task for a given cpu.
3231 * @cpu: the processor in question.
3233 * Return: The idle task for the cpu @cpu.
3235 struct task_struct *idle_task(int cpu)
3237 return cpu_rq(cpu)->idle;
3241 * find_process_by_pid - find a process with a matching PID value.
3242 * @pid: the pid in question.
3244 * The task of @pid, if found. %NULL otherwise.
3246 static struct task_struct *find_process_by_pid(pid_t pid)
3248 return pid ? find_task_by_vpid(pid) : current;
3252 * This function initializes the sched_dl_entity of a newly becoming
3253 * SCHED_DEADLINE task.
3255 * Only the static values are considered here, the actual runtime and the
3256 * absolute deadline will be properly calculated when the task is enqueued
3257 * for the first time with its new policy.
3260 __setparam_dl(struct task_struct *p, const struct sched_attr *attr)
3262 struct sched_dl_entity *dl_se = &p->dl;
3264 init_dl_task_timer(dl_se);
3265 dl_se->dl_runtime = attr->sched_runtime;
3266 dl_se->dl_deadline = attr->sched_deadline;
3267 dl_se->dl_period = attr->sched_period ?: dl_se->dl_deadline;
3268 dl_se->flags = attr->sched_flags;
3269 dl_se->dl_bw = to_ratio(dl_se->dl_period, dl_se->dl_runtime);
3270 dl_se->dl_throttled = 0;
3272 dl_se->dl_yielded = 0;
3276 * sched_setparam() passes in -1 for its policy, to let the functions
3277 * it calls know not to change it.
3279 #define SETPARAM_POLICY -1
3281 static void __setscheduler_params(struct task_struct *p,
3282 const struct sched_attr *attr)
3284 int policy = attr->sched_policy;
3286 if (policy == SETPARAM_POLICY)
3291 if (dl_policy(policy))
3292 __setparam_dl(p, attr);
3293 else if (fair_policy(policy))
3294 p->static_prio = NICE_TO_PRIO(attr->sched_nice);
3297 * __sched_setscheduler() ensures attr->sched_priority == 0 when
3298 * !rt_policy. Always setting this ensures that things like
3299 * getparam()/getattr() don't report silly values for !rt tasks.
3301 p->rt_priority = attr->sched_priority;
3302 p->normal_prio = normal_prio(p);
3306 /* Actually do priority change: must hold pi & rq lock. */
3307 static void __setscheduler(struct rq *rq, struct task_struct *p,
3308 const struct sched_attr *attr)
3310 __setscheduler_params(p, attr);
3313 * If we get here, there was no pi waiters boosting the
3314 * task. It is safe to use the normal prio.
3316 p->prio = normal_prio(p);
3318 if (dl_prio(p->prio))
3319 p->sched_class = &dl_sched_class;
3320 else if (rt_prio(p->prio))
3321 p->sched_class = &rt_sched_class;
3323 p->sched_class = &fair_sched_class;
3327 __getparam_dl(struct task_struct *p, struct sched_attr *attr)
3329 struct sched_dl_entity *dl_se = &p->dl;
3331 attr->sched_priority = p->rt_priority;
3332 attr->sched_runtime = dl_se->dl_runtime;
3333 attr->sched_deadline = dl_se->dl_deadline;
3334 attr->sched_period = dl_se->dl_period;
3335 attr->sched_flags = dl_se->flags;
3339 * This function validates the new parameters of a -deadline task.
3340 * We ask for the deadline not being zero, and greater or equal
3341 * than the runtime, as well as the period of being zero or
3342 * greater than deadline. Furthermore, we have to be sure that
3343 * user parameters are above the internal resolution of 1us (we
3344 * check sched_runtime only since it is always the smaller one) and
3345 * below 2^63 ns (we have to check both sched_deadline and
3346 * sched_period, as the latter can be zero).
3349 __checkparam_dl(const struct sched_attr *attr)
3352 if (attr->sched_deadline == 0)
3356 * Since we truncate DL_SCALE bits, make sure we're at least
3359 if (attr->sched_runtime < (1ULL << DL_SCALE))
3363 * Since we use the MSB for wrap-around and sign issues, make
3364 * sure it's not set (mind that period can be equal to zero).
3366 if (attr->sched_deadline & (1ULL << 63) ||
3367 attr->sched_period & (1ULL << 63))
3370 /* runtime <= deadline <= period (if period != 0) */
3371 if ((attr->sched_period != 0 &&
3372 attr->sched_period < attr->sched_deadline) ||
3373 attr->sched_deadline < attr->sched_runtime)
3380 * check the target process has a UID that matches the current process's
3382 static bool check_same_owner(struct task_struct *p)
3384 const struct cred *cred = current_cred(), *pcred;
3388 pcred = __task_cred(p);
3389 match = (uid_eq(cred->euid, pcred->euid) ||
3390 uid_eq(cred->euid, pcred->uid));
3395 static int __sched_setscheduler(struct task_struct *p,
3396 const struct sched_attr *attr,
3399 int newprio = dl_policy(attr->sched_policy) ? MAX_DL_PRIO - 1 :
3400 MAX_RT_PRIO - 1 - attr->sched_priority;
3401 int retval, oldprio, oldpolicy = -1, queued, running;
3402 int policy = attr->sched_policy;
3403 unsigned long flags;
3404 const struct sched_class *prev_class;
3408 /* may grab non-irq protected spin_locks */
3409 BUG_ON(in_interrupt());
3411 /* double check policy once rq lock held */
3413 reset_on_fork = p->sched_reset_on_fork;
3414 policy = oldpolicy = p->policy;
3416 reset_on_fork = !!(attr->sched_flags & SCHED_FLAG_RESET_ON_FORK);
3418 if (policy != SCHED_DEADLINE &&
3419 policy != SCHED_FIFO && policy != SCHED_RR &&
3420 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
3421 policy != SCHED_IDLE)
3425 if (attr->sched_flags & ~(SCHED_FLAG_RESET_ON_FORK))
3429 * Valid priorities for SCHED_FIFO and SCHED_RR are
3430 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
3431 * SCHED_BATCH and SCHED_IDLE is 0.
3433 if ((p->mm && attr->sched_priority > MAX_USER_RT_PRIO-1) ||
3434 (!p->mm && attr->sched_priority > MAX_RT_PRIO-1))
3436 if ((dl_policy(policy) && !__checkparam_dl(attr)) ||
3437 (rt_policy(policy) != (attr->sched_priority != 0)))
3441 * Allow unprivileged RT tasks to decrease priority:
3443 if (user && !capable(CAP_SYS_NICE)) {
3444 if (fair_policy(policy)) {
3445 if (attr->sched_nice < task_nice(p) &&
3446 !can_nice(p, attr->sched_nice))
3450 if (rt_policy(policy)) {
3451 unsigned long rlim_rtprio =
3452 task_rlimit(p, RLIMIT_RTPRIO);
3454 /* can't set/change the rt policy */
3455 if (policy != p->policy && !rlim_rtprio)
3458 /* can't increase priority */
3459 if (attr->sched_priority > p->rt_priority &&
3460 attr->sched_priority > rlim_rtprio)
3465 * Can't set/change SCHED_DEADLINE policy at all for now
3466 * (safest behavior); in the future we would like to allow
3467 * unprivileged DL tasks to increase their relative deadline
3468 * or reduce their runtime (both ways reducing utilization)
3470 if (dl_policy(policy))
3474 * Treat SCHED_IDLE as nice 20. Only allow a switch to
3475 * SCHED_NORMAL if the RLIMIT_NICE would normally permit it.
3477 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) {
3478 if (!can_nice(p, task_nice(p)))
3482 /* can't change other user's priorities */
3483 if (!check_same_owner(p))
3486 /* Normal users shall not reset the sched_reset_on_fork flag */
3487 if (p->sched_reset_on_fork && !reset_on_fork)
3492 retval = security_task_setscheduler(p);
3498 * make sure no PI-waiters arrive (or leave) while we are
3499 * changing the priority of the task:
3501 * To be able to change p->policy safely, the appropriate
3502 * runqueue lock must be held.
3504 rq = task_rq_lock(p, &flags);
3507 * Changing the policy of the stop threads its a very bad idea
3509 if (p == rq->stop) {
3510 task_rq_unlock(rq, p, &flags);
3515 * If not changing anything there's no need to proceed further,
3516 * but store a possible modification of reset_on_fork.
3518 if (unlikely(policy == p->policy)) {
3519 if (fair_policy(policy) && attr->sched_nice != task_nice(p))
3521 if (rt_policy(policy) && attr->sched_priority != p->rt_priority)
3523 if (dl_policy(policy))
3526 p->sched_reset_on_fork = reset_on_fork;
3527 task_rq_unlock(rq, p, &flags);
3533 #ifdef CONFIG_RT_GROUP_SCHED
3535 * Do not allow realtime tasks into groups that have no runtime
3538 if (rt_bandwidth_enabled() && rt_policy(policy) &&
3539 task_group(p)->rt_bandwidth.rt_runtime == 0 &&
3540 !task_group_is_autogroup(task_group(p))) {
3541 task_rq_unlock(rq, p, &flags);
3546 if (dl_bandwidth_enabled() && dl_policy(policy)) {
3547 cpumask_t *span = rq->rd->span;
3550 * Don't allow tasks with an affinity mask smaller than
3551 * the entire root_domain to become SCHED_DEADLINE. We
3552 * will also fail if there's no bandwidth available.
3554 if (!cpumask_subset(span, &p->cpus_allowed) ||
3555 rq->rd->dl_bw.bw == 0) {
3556 task_rq_unlock(rq, p, &flags);
3563 /* recheck policy now with rq lock held */
3564 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
3565 policy = oldpolicy = -1;
3566 task_rq_unlock(rq, p, &flags);
3571 * If setscheduling to SCHED_DEADLINE (or changing the parameters
3572 * of a SCHED_DEADLINE task) we need to check if enough bandwidth
3575 if ((dl_policy(policy) || dl_task(p)) && dl_overflow(p, policy, attr)) {
3576 task_rq_unlock(rq, p, &flags);
3580 p->sched_reset_on_fork = reset_on_fork;
3584 * Special case for priority boosted tasks.
3586 * If the new priority is lower or equal (user space view)
3587 * than the current (boosted) priority, we just store the new
3588 * normal parameters and do not touch the scheduler class and
3589 * the runqueue. This will be done when the task deboost
3592 if (rt_mutex_check_prio(p, newprio)) {
3593 __setscheduler_params(p, attr);
3594 task_rq_unlock(rq, p, &flags);
3598 queued = task_on_rq_queued(p);
3599 running = task_current(rq, p);
3601 dequeue_task(rq, p, 0);
3603 put_prev_task(rq, p);
3605 prev_class = p->sched_class;
3606 __setscheduler(rq, p, attr);
3609 p->sched_class->set_curr_task(rq);
3612 * We enqueue to tail when the priority of a task is
3613 * increased (user space view).
3615 enqueue_task(rq, p, oldprio <= p->prio ? ENQUEUE_HEAD : 0);
3618 check_class_changed(rq, p, prev_class, oldprio);
3619 task_rq_unlock(rq, p, &flags);
3621 rt_mutex_adjust_pi(p);
3626 static int _sched_setscheduler(struct task_struct *p, int policy,
3627 const struct sched_param *param, bool check)
3629 struct sched_attr attr = {
3630 .sched_policy = policy,
3631 .sched_priority = param->sched_priority,
3632 .sched_nice = PRIO_TO_NICE(p->static_prio),
3635 /* Fixup the legacy SCHED_RESET_ON_FORK hack. */
3636 if ((policy != SETPARAM_POLICY) && (policy & SCHED_RESET_ON_FORK)) {
3637 attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
3638 policy &= ~SCHED_RESET_ON_FORK;
3639 attr.sched_policy = policy;
3642 return __sched_setscheduler(p, &attr, check);
3645 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
3646 * @p: the task in question.
3647 * @policy: new policy.
3648 * @param: structure containing the new RT priority.
3650 * Return: 0 on success. An error code otherwise.
3652 * NOTE that the task may be already dead.
3654 int sched_setscheduler(struct task_struct *p, int policy,
3655 const struct sched_param *param)
3657 return _sched_setscheduler(p, policy, param, true);
3659 EXPORT_SYMBOL_GPL(sched_setscheduler);
3661 int sched_setattr(struct task_struct *p, const struct sched_attr *attr)
3663 return __sched_setscheduler(p, attr, true);
3665 EXPORT_SYMBOL_GPL(sched_setattr);
3668 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
3669 * @p: the task in question.
3670 * @policy: new policy.
3671 * @param: structure containing the new RT priority.
3673 * Just like sched_setscheduler, only don't bother checking if the
3674 * current context has permission. For example, this is needed in
3675 * stop_machine(): we create temporary high priority worker threads,
3676 * but our caller might not have that capability.
3678 * Return: 0 on success. An error code otherwise.
3680 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
3681 const struct sched_param *param)
3683 return _sched_setscheduler(p, policy, param, false);
3687 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
3689 struct sched_param lparam;
3690 struct task_struct *p;
3693 if (!param || pid < 0)
3695 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
3700 p = find_process_by_pid(pid);
3702 retval = sched_setscheduler(p, policy, &lparam);
3709 * Mimics kernel/events/core.c perf_copy_attr().
3711 static int sched_copy_attr(struct sched_attr __user *uattr,
3712 struct sched_attr *attr)
3717 if (!access_ok(VERIFY_WRITE, uattr, SCHED_ATTR_SIZE_VER0))
3721 * zero the full structure, so that a short copy will be nice.
3723 memset(attr, 0, sizeof(*attr));
3725 ret = get_user(size, &uattr->size);
3729 if (size > PAGE_SIZE) /* silly large */
3732 if (!size) /* abi compat */
3733 size = SCHED_ATTR_SIZE_VER0;
3735 if (size < SCHED_ATTR_SIZE_VER0)
3739 * If we're handed a bigger struct than we know of,
3740 * ensure all the unknown bits are 0 - i.e. new
3741 * user-space does not rely on any kernel feature
3742 * extensions we dont know about yet.
3744 if (size > sizeof(*attr)) {
3745 unsigned char __user *addr;
3746 unsigned char __user *end;
3749 addr = (void __user *)uattr + sizeof(*attr);
3750 end = (void __user *)uattr + size;
3752 for (; addr < end; addr++) {
3753 ret = get_user(val, addr);
3759 size = sizeof(*attr);
3762 ret = copy_from_user(attr, uattr, size);
3767 * XXX: do we want to be lenient like existing syscalls; or do we want
3768 * to be strict and return an error on out-of-bounds values?
3770 attr->sched_nice = clamp(attr->sched_nice, MIN_NICE, MAX_NICE);
3775 put_user(sizeof(*attr), &uattr->size);
3780 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
3781 * @pid: the pid in question.
3782 * @policy: new policy.
3783 * @param: structure containing the new RT priority.
3785 * Return: 0 on success. An error code otherwise.
3787 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
3788 struct sched_param __user *, param)
3790 /* negative values for policy are not valid */
3794 return do_sched_setscheduler(pid, policy, param);
3798 * sys_sched_setparam - set/change the RT priority of a thread
3799 * @pid: the pid in question.
3800 * @param: structure containing the new RT priority.
3802 * Return: 0 on success. An error code otherwise.
3804 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
3806 return do_sched_setscheduler(pid, SETPARAM_POLICY, param);
3810 * sys_sched_setattr - same as above, but with extended sched_attr
3811 * @pid: the pid in question.
3812 * @uattr: structure containing the extended parameters.
3813 * @flags: for future extension.
3815 SYSCALL_DEFINE3(sched_setattr, pid_t, pid, struct sched_attr __user *, uattr,
3816 unsigned int, flags)
3818 struct sched_attr attr;
3819 struct task_struct *p;
3822 if (!uattr || pid < 0 || flags)
3825 retval = sched_copy_attr(uattr, &attr);
3829 if ((int)attr.sched_policy < 0)
3834 p = find_process_by_pid(pid);
3836 retval = sched_setattr(p, &attr);
3843 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
3844 * @pid: the pid in question.
3846 * Return: On success, the policy of the thread. Otherwise, a negative error
3849 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
3851 struct task_struct *p;
3859 p = find_process_by_pid(pid);
3861 retval = security_task_getscheduler(p);
3864 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
3871 * sys_sched_getparam - get the RT priority of a thread
3872 * @pid: the pid in question.
3873 * @param: structure containing the RT priority.
3875 * Return: On success, 0 and the RT priority is in @param. Otherwise, an error
3878 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
3880 struct sched_param lp = { .sched_priority = 0 };
3881 struct task_struct *p;
3884 if (!param || pid < 0)
3888 p = find_process_by_pid(pid);
3893 retval = security_task_getscheduler(p);
3897 if (task_has_rt_policy(p))
3898 lp.sched_priority = p->rt_priority;
3902 * This one might sleep, we cannot do it with a spinlock held ...
3904 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
3913 static int sched_read_attr(struct sched_attr __user *uattr,
3914 struct sched_attr *attr,
3919 if (!access_ok(VERIFY_WRITE, uattr, usize))
3923 * If we're handed a smaller struct than we know of,
3924 * ensure all the unknown bits are 0 - i.e. old
3925 * user-space does not get uncomplete information.
3927 if (usize < sizeof(*attr)) {
3928 unsigned char *addr;
3931 addr = (void *)attr + usize;
3932 end = (void *)attr + sizeof(*attr);
3934 for (; addr < end; addr++) {
3942 ret = copy_to_user(uattr, attr, attr->size);
3950 * sys_sched_getattr - similar to sched_getparam, but with sched_attr
3951 * @pid: the pid in question.
3952 * @uattr: structure containing the extended parameters.
3953 * @size: sizeof(attr) for fwd/bwd comp.
3954 * @flags: for future extension.
3956 SYSCALL_DEFINE4(sched_getattr, pid_t, pid, struct sched_attr __user *, uattr,
3957 unsigned int, size, unsigned int, flags)
3959 struct sched_attr attr = {
3960 .size = sizeof(struct sched_attr),
3962 struct task_struct *p;
3965 if (!uattr || pid < 0 || size > PAGE_SIZE ||
3966 size < SCHED_ATTR_SIZE_VER0 || flags)
3970 p = find_process_by_pid(pid);
3975 retval = security_task_getscheduler(p);
3979 attr.sched_policy = p->policy;
3980 if (p->sched_reset_on_fork)
3981 attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
3982 if (task_has_dl_policy(p))
3983 __getparam_dl(p, &attr);
3984 else if (task_has_rt_policy(p))
3985 attr.sched_priority = p->rt_priority;
3987 attr.sched_nice = task_nice(p);
3991 retval = sched_read_attr(uattr, &attr, size);
3999 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4001 cpumask_var_t cpus_allowed, new_mask;
4002 struct task_struct *p;
4007 p = find_process_by_pid(pid);
4013 /* Prevent p going away */
4017 if (p->flags & PF_NO_SETAFFINITY) {
4021 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4025 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4027 goto out_free_cpus_allowed;
4030 if (!check_same_owner(p)) {
4032 if (!ns_capable(__task_cred(p)->user_ns, CAP_SYS_NICE)) {
4039 retval = security_task_setscheduler(p);
4044 cpuset_cpus_allowed(p, cpus_allowed);
4045 cpumask_and(new_mask, in_mask, cpus_allowed);
4048 * Since bandwidth control happens on root_domain basis,
4049 * if admission test is enabled, we only admit -deadline
4050 * tasks allowed to run on all the CPUs in the task's
4054 if (task_has_dl_policy(p)) {
4055 const struct cpumask *span = task_rq(p)->rd->span;
4057 if (dl_bandwidth_enabled() && !cpumask_subset(span, new_mask)) {
4064 retval = set_cpus_allowed_ptr(p, new_mask);
4067 cpuset_cpus_allowed(p, cpus_allowed);
4068 if (!cpumask_subset(new_mask, cpus_allowed)) {
4070 * We must have raced with a concurrent cpuset
4071 * update. Just reset the cpus_allowed to the
4072 * cpuset's cpus_allowed
4074 cpumask_copy(new_mask, cpus_allowed);
4079 free_cpumask_var(new_mask);
4080 out_free_cpus_allowed:
4081 free_cpumask_var(cpus_allowed);
4087 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4088 struct cpumask *new_mask)
4090 if (len < cpumask_size())
4091 cpumask_clear(new_mask);
4092 else if (len > cpumask_size())
4093 len = cpumask_size();
4095 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4099 * sys_sched_setaffinity - set the cpu affinity of a process
4100 * @pid: pid of the process
4101 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4102 * @user_mask_ptr: user-space pointer to the new cpu mask
4104 * Return: 0 on success. An error code otherwise.
4106 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4107 unsigned long __user *, user_mask_ptr)
4109 cpumask_var_t new_mask;
4112 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4115 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4117 retval = sched_setaffinity(pid, new_mask);
4118 free_cpumask_var(new_mask);
4122 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4124 struct task_struct *p;
4125 unsigned long flags;
4131 p = find_process_by_pid(pid);
4135 retval = security_task_getscheduler(p);
4139 raw_spin_lock_irqsave(&p->pi_lock, flags);
4140 cpumask_and(mask, &p->cpus_allowed, cpu_active_mask);
4141 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4150 * sys_sched_getaffinity - get the cpu affinity of a process
4151 * @pid: pid of the process
4152 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4153 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4155 * Return: 0 on success. An error code otherwise.
4157 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4158 unsigned long __user *, user_mask_ptr)
4163 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
4165 if (len & (sizeof(unsigned long)-1))
4168 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4171 ret = sched_getaffinity(pid, mask);
4173 size_t retlen = min_t(size_t, len, cpumask_size());
4175 if (copy_to_user(user_mask_ptr, mask, retlen))
4180 free_cpumask_var(mask);
4186 * sys_sched_yield - yield the current processor to other threads.
4188 * This function yields the current CPU to other tasks. If there are no
4189 * other threads running on this CPU then this function will return.
4193 SYSCALL_DEFINE0(sched_yield)
4195 struct rq *rq = this_rq_lock();
4197 schedstat_inc(rq, yld_count);
4198 current->sched_class->yield_task(rq);
4201 * Since we are going to call schedule() anyway, there's
4202 * no need to preempt or enable interrupts:
4204 __release(rq->lock);
4205 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4206 do_raw_spin_unlock(&rq->lock);
4207 sched_preempt_enable_no_resched();
4214 static void __cond_resched(void)
4216 __preempt_count_add(PREEMPT_ACTIVE);
4218 __preempt_count_sub(PREEMPT_ACTIVE);
4221 int __sched _cond_resched(void)
4223 if (should_resched()) {
4229 EXPORT_SYMBOL(_cond_resched);
4232 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4233 * call schedule, and on return reacquire the lock.
4235 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4236 * operations here to prevent schedule() from being called twice (once via
4237 * spin_unlock(), once by hand).
4239 int __cond_resched_lock(spinlock_t *lock)
4241 int resched = should_resched();
4244 lockdep_assert_held(lock);
4246 if (spin_needbreak(lock) || resched) {
4257 EXPORT_SYMBOL(__cond_resched_lock);
4259 int __sched __cond_resched_softirq(void)
4261 BUG_ON(!in_softirq());
4263 if (should_resched()) {
4271 EXPORT_SYMBOL(__cond_resched_softirq);
4274 * yield - yield the current processor to other threads.
4276 * Do not ever use this function, there's a 99% chance you're doing it wrong.
4278 * The scheduler is at all times free to pick the calling task as the most
4279 * eligible task to run, if removing the yield() call from your code breaks
4280 * it, its already broken.
4282 * Typical broken usage is:
4287 * where one assumes that yield() will let 'the other' process run that will
4288 * make event true. If the current task is a SCHED_FIFO task that will never
4289 * happen. Never use yield() as a progress guarantee!!
4291 * If you want to use yield() to wait for something, use wait_event().
4292 * If you want to use yield() to be 'nice' for others, use cond_resched().
4293 * If you still want to use yield(), do not!
4295 void __sched yield(void)
4297 set_current_state(TASK_RUNNING);
4300 EXPORT_SYMBOL(yield);
4303 * yield_to - yield the current processor to another thread in
4304 * your thread group, or accelerate that thread toward the
4305 * processor it's on.
4307 * @preempt: whether task preemption is allowed or not
4309 * It's the caller's job to ensure that the target task struct
4310 * can't go away on us before we can do any checks.
4313 * true (>0) if we indeed boosted the target task.
4314 * false (0) if we failed to boost the target.
4315 * -ESRCH if there's no task to yield to.
4317 int __sched yield_to(struct task_struct *p, bool preempt)
4319 struct task_struct *curr = current;
4320 struct rq *rq, *p_rq;
4321 unsigned long flags;
4324 local_irq_save(flags);
4330 * If we're the only runnable task on the rq and target rq also
4331 * has only one task, there's absolutely no point in yielding.
4333 if (rq->nr_running == 1 && p_rq->nr_running == 1) {
4338 double_rq_lock(rq, p_rq);
4339 if (task_rq(p) != p_rq) {
4340 double_rq_unlock(rq, p_rq);
4344 if (!curr->sched_class->yield_to_task)
4347 if (curr->sched_class != p->sched_class)
4350 if (task_running(p_rq, p) || p->state)
4353 yielded = curr->sched_class->yield_to_task(rq, p, preempt);
4355 schedstat_inc(rq, yld_count);
4357 * Make p's CPU reschedule; pick_next_entity takes care of
4360 if (preempt && rq != p_rq)
4365 double_rq_unlock(rq, p_rq);
4367 local_irq_restore(flags);
4374 EXPORT_SYMBOL_GPL(yield_to);
4377 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
4378 * that process accounting knows that this is a task in IO wait state.
4380 void __sched io_schedule(void)
4382 struct rq *rq = raw_rq();
4384 delayacct_blkio_start();
4385 atomic_inc(&rq->nr_iowait);
4386 blk_flush_plug(current);
4387 current->in_iowait = 1;
4389 current->in_iowait = 0;
4390 atomic_dec(&rq->nr_iowait);
4391 delayacct_blkio_end();
4393 EXPORT_SYMBOL(io_schedule);
4395 long __sched io_schedule_timeout(long timeout)
4397 struct rq *rq = raw_rq();
4400 delayacct_blkio_start();
4401 atomic_inc(&rq->nr_iowait);
4402 blk_flush_plug(current);
4403 current->in_iowait = 1;
4404 ret = schedule_timeout(timeout);
4405 current->in_iowait = 0;
4406 atomic_dec(&rq->nr_iowait);
4407 delayacct_blkio_end();
4412 * sys_sched_get_priority_max - return maximum RT priority.
4413 * @policy: scheduling class.
4415 * Return: On success, this syscall returns the maximum
4416 * rt_priority that can be used by a given scheduling class.
4417 * On failure, a negative error code is returned.
4419 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
4426 ret = MAX_USER_RT_PRIO-1;
4428 case SCHED_DEADLINE:
4439 * sys_sched_get_priority_min - return minimum RT priority.
4440 * @policy: scheduling class.
4442 * Return: On success, this syscall returns the minimum
4443 * rt_priority that can be used by a given scheduling class.
4444 * On failure, a negative error code is returned.
4446 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
4455 case SCHED_DEADLINE:
4465 * sys_sched_rr_get_interval - return the default timeslice of a process.
4466 * @pid: pid of the process.
4467 * @interval: userspace pointer to the timeslice value.
4469 * this syscall writes the default timeslice value of a given process
4470 * into the user-space timespec buffer. A value of '0' means infinity.
4472 * Return: On success, 0 and the timeslice is in @interval. Otherwise,
4475 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
4476 struct timespec __user *, interval)
4478 struct task_struct *p;
4479 unsigned int time_slice;
4480 unsigned long flags;
4490 p = find_process_by_pid(pid);
4494 retval = security_task_getscheduler(p);
4498 rq = task_rq_lock(p, &flags);
4500 if (p->sched_class->get_rr_interval)
4501 time_slice = p->sched_class->get_rr_interval(rq, p);
4502 task_rq_unlock(rq, p, &flags);
4505 jiffies_to_timespec(time_slice, &t);
4506 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
4514 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
4516 void sched_show_task(struct task_struct *p)
4518 unsigned long free = 0;
4522 state = p->state ? __ffs(p->state) + 1 : 0;
4523 printk(KERN_INFO "%-15.15s %c", p->comm,
4524 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
4525 #if BITS_PER_LONG == 32
4526 if (state == TASK_RUNNING)
4527 printk(KERN_CONT " running ");
4529 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
4531 if (state == TASK_RUNNING)
4532 printk(KERN_CONT " running task ");
4534 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
4536 #ifdef CONFIG_DEBUG_STACK_USAGE
4537 free = stack_not_used(p);
4540 ppid = task_pid_nr(rcu_dereference(p->real_parent));
4542 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
4543 task_pid_nr(p), ppid,
4544 (unsigned long)task_thread_info(p)->flags);
4546 print_worker_info(KERN_INFO, p);
4547 show_stack(p, NULL);
4550 void show_state_filter(unsigned long state_filter)
4552 struct task_struct *g, *p;
4554 #if BITS_PER_LONG == 32
4556 " task PC stack pid father\n");
4559 " task PC stack pid father\n");
4562 for_each_process_thread(g, p) {
4564 * reset the NMI-timeout, listing all files on a slow
4565 * console might take a lot of time:
4567 touch_nmi_watchdog();
4568 if (!state_filter || (p->state & state_filter))
4572 touch_all_softlockup_watchdogs();
4574 #ifdef CONFIG_SCHED_DEBUG
4575 sysrq_sched_debug_show();
4579 * Only show locks if all tasks are dumped:
4582 debug_show_all_locks();
4585 void init_idle_bootup_task(struct task_struct *idle)
4587 idle->sched_class = &idle_sched_class;
4591 * init_idle - set up an idle thread for a given CPU
4592 * @idle: task in question
4593 * @cpu: cpu the idle task belongs to
4595 * NOTE: this function does not set the idle thread's NEED_RESCHED
4596 * flag, to make booting more robust.
4598 void init_idle(struct task_struct *idle, int cpu)
4600 struct rq *rq = cpu_rq(cpu);
4601 unsigned long flags;
4603 raw_spin_lock_irqsave(&rq->lock, flags);
4605 __sched_fork(0, idle);
4606 idle->state = TASK_RUNNING;
4607 idle->se.exec_start = sched_clock();
4609 do_set_cpus_allowed(idle, cpumask_of(cpu));
4611 * We're having a chicken and egg problem, even though we are
4612 * holding rq->lock, the cpu isn't yet set to this cpu so the
4613 * lockdep check in task_group() will fail.
4615 * Similar case to sched_fork(). / Alternatively we could
4616 * use task_rq_lock() here and obtain the other rq->lock.
4621 __set_task_cpu(idle, cpu);
4624 rq->curr = rq->idle = idle;
4625 idle->on_rq = TASK_ON_RQ_QUEUED;
4626 #if defined(CONFIG_SMP)
4629 raw_spin_unlock_irqrestore(&rq->lock, flags);
4631 /* Set the preempt count _outside_ the spinlocks! */
4632 init_idle_preempt_count(idle, cpu);
4635 * The idle tasks have their own, simple scheduling class:
4637 idle->sched_class = &idle_sched_class;
4638 ftrace_graph_init_idle_task(idle, cpu);
4639 vtime_init_idle(idle, cpu);
4640 #if defined(CONFIG_SMP)
4641 sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu);
4647 * move_queued_task - move a queued task to new rq.
4649 * Returns (locked) new rq. Old rq's lock is released.
4651 static struct rq *move_queued_task(struct task_struct *p, int new_cpu)
4653 struct rq *rq = task_rq(p);
4655 lockdep_assert_held(&rq->lock);
4657 dequeue_task(rq, p, 0);
4658 p->on_rq = TASK_ON_RQ_MIGRATING;
4659 set_task_cpu(p, new_cpu);
4660 raw_spin_unlock(&rq->lock);
4662 rq = cpu_rq(new_cpu);
4664 raw_spin_lock(&rq->lock);
4665 BUG_ON(task_cpu(p) != new_cpu);
4666 p->on_rq = TASK_ON_RQ_QUEUED;
4667 enqueue_task(rq, p, 0);
4668 check_preempt_curr(rq, p, 0);
4673 void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask)
4675 if (p->sched_class && p->sched_class->set_cpus_allowed)
4676 p->sched_class->set_cpus_allowed(p, new_mask);
4678 cpumask_copy(&p->cpus_allowed, new_mask);
4679 p->nr_cpus_allowed = cpumask_weight(new_mask);
4683 * This is how migration works:
4685 * 1) we invoke migration_cpu_stop() on the target CPU using
4687 * 2) stopper starts to run (implicitly forcing the migrated thread
4689 * 3) it checks whether the migrated task is still in the wrong runqueue.
4690 * 4) if it's in the wrong runqueue then the migration thread removes
4691 * it and puts it into the right queue.
4692 * 5) stopper completes and stop_one_cpu() returns and the migration
4697 * Change a given task's CPU affinity. Migrate the thread to a
4698 * proper CPU and schedule it away if the CPU it's executing on
4699 * is removed from the allowed bitmask.
4701 * NOTE: the caller must have a valid reference to the task, the
4702 * task must not exit() & deallocate itself prematurely. The
4703 * call is not atomic; no spinlocks may be held.
4705 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
4707 unsigned long flags;
4709 unsigned int dest_cpu;
4712 rq = task_rq_lock(p, &flags);
4714 if (cpumask_equal(&p->cpus_allowed, new_mask))
4717 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
4722 do_set_cpus_allowed(p, new_mask);
4724 /* Can the task run on the task's current CPU? If so, we're done */
4725 if (cpumask_test_cpu(task_cpu(p), new_mask))
4728 dest_cpu = cpumask_any_and(cpu_active_mask, new_mask);
4729 if (task_running(rq, p) || p->state == TASK_WAKING) {
4730 struct migration_arg arg = { p, dest_cpu };
4731 /* Need help from migration thread: drop lock and wait. */
4732 task_rq_unlock(rq, p, &flags);
4733 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
4734 tlb_migrate_finish(p->mm);
4736 } else if (task_on_rq_queued(p))
4737 rq = move_queued_task(p, dest_cpu);
4739 task_rq_unlock(rq, p, &flags);
4743 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
4746 * Move (not current) task off this cpu, onto dest cpu. We're doing
4747 * this because either it can't run here any more (set_cpus_allowed()
4748 * away from this CPU, or CPU going down), or because we're
4749 * attempting to rebalance this task on exec (sched_exec).
4751 * So we race with normal scheduler movements, but that's OK, as long
4752 * as the task is no longer on this CPU.
4754 * Returns non-zero if task was successfully migrated.
4756 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
4761 if (unlikely(!cpu_active(dest_cpu)))
4764 rq = cpu_rq(src_cpu);
4766 raw_spin_lock(&p->pi_lock);
4767 raw_spin_lock(&rq->lock);
4768 /* Already moved. */
4769 if (task_cpu(p) != src_cpu)
4772 /* Affinity changed (again). */
4773 if (!cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
4777 * If we're not on a rq, the next wake-up will ensure we're
4780 if (task_on_rq_queued(p))
4781 rq = move_queued_task(p, dest_cpu);
4785 raw_spin_unlock(&rq->lock);
4786 raw_spin_unlock(&p->pi_lock);
4790 #ifdef CONFIG_NUMA_BALANCING
4791 /* Migrate current task p to target_cpu */
4792 int migrate_task_to(struct task_struct *p, int target_cpu)
4794 struct migration_arg arg = { p, target_cpu };
4795 int curr_cpu = task_cpu(p);
4797 if (curr_cpu == target_cpu)
4800 if (!cpumask_test_cpu(target_cpu, tsk_cpus_allowed(p)))
4803 /* TODO: This is not properly updating schedstats */
4805 trace_sched_move_numa(p, curr_cpu, target_cpu);
4806 return stop_one_cpu(curr_cpu, migration_cpu_stop, &arg);
4810 * Requeue a task on a given node and accurately track the number of NUMA
4811 * tasks on the runqueues
4813 void sched_setnuma(struct task_struct *p, int nid)
4816 unsigned long flags;
4817 bool queued, running;
4819 rq = task_rq_lock(p, &flags);
4820 queued = task_on_rq_queued(p);
4821 running = task_current(rq, p);
4824 dequeue_task(rq, p, 0);
4826 put_prev_task(rq, p);
4828 p->numa_preferred_nid = nid;
4831 p->sched_class->set_curr_task(rq);
4833 enqueue_task(rq, p, 0);
4834 task_rq_unlock(rq, p, &flags);
4839 * migration_cpu_stop - this will be executed by a highprio stopper thread
4840 * and performs thread migration by bumping thread off CPU then
4841 * 'pushing' onto another runqueue.
4843 static int migration_cpu_stop(void *data)
4845 struct migration_arg *arg = data;
4848 * The original target cpu might have gone down and we might
4849 * be on another cpu but it doesn't matter.
4851 local_irq_disable();
4853 * We need to explicitly wake pending tasks before running
4854 * __migrate_task() such that we will not miss enforcing cpus_allowed
4855 * during wakeups, see set_cpus_allowed_ptr()'s TASK_WAKING test.
4857 sched_ttwu_pending();
4858 __migrate_task(arg->task, raw_smp_processor_id(), arg->dest_cpu);
4863 #ifdef CONFIG_HOTPLUG_CPU
4866 * Ensures that the idle task is using init_mm right before its cpu goes
4869 void idle_task_exit(void)
4871 struct mm_struct *mm = current->active_mm;
4873 BUG_ON(cpu_online(smp_processor_id()));
4875 if (mm != &init_mm) {
4876 switch_mm(mm, &init_mm, current);
4877 finish_arch_post_lock_switch();
4883 * Since this CPU is going 'away' for a while, fold any nr_active delta
4884 * we might have. Assumes we're called after migrate_tasks() so that the
4885 * nr_active count is stable.
4887 * Also see the comment "Global load-average calculations".
4889 static void calc_load_migrate(struct rq *rq)
4891 long delta = calc_load_fold_active(rq);
4893 atomic_long_add(delta, &calc_load_tasks);
4896 static void put_prev_task_fake(struct rq *rq, struct task_struct *prev)
4900 static const struct sched_class fake_sched_class = {
4901 .put_prev_task = put_prev_task_fake,
4904 static struct task_struct fake_task = {
4906 * Avoid pull_{rt,dl}_task()
4908 .prio = MAX_PRIO + 1,
4909 .sched_class = &fake_sched_class,
4913 * Migrate all tasks from the rq, sleeping tasks will be migrated by
4914 * try_to_wake_up()->select_task_rq().
4916 * Called with rq->lock held even though we'er in stop_machine() and
4917 * there's no concurrency possible, we hold the required locks anyway
4918 * because of lock validation efforts.
4920 static void migrate_tasks(unsigned int dead_cpu)
4922 struct rq *rq = cpu_rq(dead_cpu);
4923 struct task_struct *next, *stop = rq->stop;
4927 * Fudge the rq selection such that the below task selection loop
4928 * doesn't get stuck on the currently eligible stop task.
4930 * We're currently inside stop_machine() and the rq is either stuck
4931 * in the stop_machine_cpu_stop() loop, or we're executing this code,
4932 * either way we should never end up calling schedule() until we're
4938 * put_prev_task() and pick_next_task() sched
4939 * class method both need to have an up-to-date
4940 * value of rq->clock[_task]
4942 update_rq_clock(rq);
4946 * There's this thread running, bail when that's the only
4949 if (rq->nr_running == 1)
4952 next = pick_next_task(rq, &fake_task);
4954 next->sched_class->put_prev_task(rq, next);
4956 /* Find suitable destination for @next, with force if needed. */
4957 dest_cpu = select_fallback_rq(dead_cpu, next);
4958 raw_spin_unlock(&rq->lock);
4960 __migrate_task(next, dead_cpu, dest_cpu);
4962 raw_spin_lock(&rq->lock);
4968 #endif /* CONFIG_HOTPLUG_CPU */
4970 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
4972 static struct ctl_table sd_ctl_dir[] = {
4974 .procname = "sched_domain",
4980 static struct ctl_table sd_ctl_root[] = {
4982 .procname = "kernel",
4984 .child = sd_ctl_dir,
4989 static struct ctl_table *sd_alloc_ctl_entry(int n)
4991 struct ctl_table *entry =
4992 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
4997 static void sd_free_ctl_entry(struct ctl_table **tablep)
4999 struct ctl_table *entry;
5002 * In the intermediate directories, both the child directory and
5003 * procname are dynamically allocated and could fail but the mode
5004 * will always be set. In the lowest directory the names are
5005 * static strings and all have proc handlers.
5007 for (entry = *tablep; entry->mode; entry++) {
5009 sd_free_ctl_entry(&entry->child);
5010 if (entry->proc_handler == NULL)
5011 kfree(entry->procname);
5018 static int min_load_idx = 0;
5019 static int max_load_idx = CPU_LOAD_IDX_MAX-1;
5022 set_table_entry(struct ctl_table *entry,
5023 const char *procname, void *data, int maxlen,
5024 umode_t mode, proc_handler *proc_handler,
5027 entry->procname = procname;
5029 entry->maxlen = maxlen;
5031 entry->proc_handler = proc_handler;
5034 entry->extra1 = &min_load_idx;
5035 entry->extra2 = &max_load_idx;
5039 static struct ctl_table *
5040 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5042 struct ctl_table *table = sd_alloc_ctl_entry(14);
5047 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5048 sizeof(long), 0644, proc_doulongvec_minmax, false);
5049 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5050 sizeof(long), 0644, proc_doulongvec_minmax, false);
5051 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5052 sizeof(int), 0644, proc_dointvec_minmax, true);
5053 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5054 sizeof(int), 0644, proc_dointvec_minmax, true);
5055 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5056 sizeof(int), 0644, proc_dointvec_minmax, true);
5057 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5058 sizeof(int), 0644, proc_dointvec_minmax, true);
5059 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5060 sizeof(int), 0644, proc_dointvec_minmax, true);
5061 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5062 sizeof(int), 0644, proc_dointvec_minmax, false);
5063 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5064 sizeof(int), 0644, proc_dointvec_minmax, false);
5065 set_table_entry(&table[9], "cache_nice_tries",
5066 &sd->cache_nice_tries,
5067 sizeof(int), 0644, proc_dointvec_minmax, false);
5068 set_table_entry(&table[10], "flags", &sd->flags,
5069 sizeof(int), 0644, proc_dointvec_minmax, false);
5070 set_table_entry(&table[11], "max_newidle_lb_cost",
5071 &sd->max_newidle_lb_cost,
5072 sizeof(long), 0644, proc_doulongvec_minmax, false);
5073 set_table_entry(&table[12], "name", sd->name,
5074 CORENAME_MAX_SIZE, 0444, proc_dostring, false);
5075 /* &table[13] is terminator */
5080 static struct ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5082 struct ctl_table *entry, *table;
5083 struct sched_domain *sd;
5084 int domain_num = 0, i;
5087 for_each_domain(cpu, sd)
5089 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5094 for_each_domain(cpu, sd) {
5095 snprintf(buf, 32, "domain%d", i);
5096 entry->procname = kstrdup(buf, GFP_KERNEL);
5098 entry->child = sd_alloc_ctl_domain_table(sd);
5105 static struct ctl_table_header *sd_sysctl_header;
5106 static void register_sched_domain_sysctl(void)
5108 int i, cpu_num = num_possible_cpus();
5109 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5112 WARN_ON(sd_ctl_dir[0].child);
5113 sd_ctl_dir[0].child = entry;
5118 for_each_possible_cpu(i) {
5119 snprintf(buf, 32, "cpu%d", i);
5120 entry->procname = kstrdup(buf, GFP_KERNEL);
5122 entry->child = sd_alloc_ctl_cpu_table(i);
5126 WARN_ON(sd_sysctl_header);
5127 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5130 /* may be called multiple times per register */
5131 static void unregister_sched_domain_sysctl(void)
5133 if (sd_sysctl_header)
5134 unregister_sysctl_table(sd_sysctl_header);
5135 sd_sysctl_header = NULL;
5136 if (sd_ctl_dir[0].child)
5137 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5140 static void register_sched_domain_sysctl(void)
5143 static void unregister_sched_domain_sysctl(void)
5148 static void set_rq_online(struct rq *rq)
5151 const struct sched_class *class;
5153 cpumask_set_cpu(rq->cpu, rq->rd->online);
5156 for_each_class(class) {
5157 if (class->rq_online)
5158 class->rq_online(rq);
5163 static void set_rq_offline(struct rq *rq)
5166 const struct sched_class *class;
5168 for_each_class(class) {
5169 if (class->rq_offline)
5170 class->rq_offline(rq);
5173 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5179 * migration_call - callback that gets triggered when a CPU is added.
5180 * Here we can start up the necessary migration thread for the new CPU.
5183 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5185 int cpu = (long)hcpu;
5186 unsigned long flags;
5187 struct rq *rq = cpu_rq(cpu);
5189 switch (action & ~CPU_TASKS_FROZEN) {
5191 case CPU_UP_PREPARE:
5192 rq->calc_load_update = calc_load_update;
5196 /* Update our root-domain */
5197 raw_spin_lock_irqsave(&rq->lock, flags);
5199 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5203 raw_spin_unlock_irqrestore(&rq->lock, flags);
5206 #ifdef CONFIG_HOTPLUG_CPU
5208 sched_ttwu_pending();
5209 /* Update our root-domain */
5210 raw_spin_lock_irqsave(&rq->lock, flags);
5212 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5216 BUG_ON(rq->nr_running != 1); /* the migration thread */
5217 raw_spin_unlock_irqrestore(&rq->lock, flags);
5221 calc_load_migrate(rq);
5226 update_max_interval();
5232 * Register at high priority so that task migration (migrate_all_tasks)
5233 * happens before everything else. This has to be lower priority than
5234 * the notifier in the perf_event subsystem, though.
5236 static struct notifier_block migration_notifier = {
5237 .notifier_call = migration_call,
5238 .priority = CPU_PRI_MIGRATION,
5241 static void __cpuinit set_cpu_rq_start_time(void)
5243 int cpu = smp_processor_id();
5244 struct rq *rq = cpu_rq(cpu);
5245 rq->age_stamp = sched_clock_cpu(cpu);
5248 static int sched_cpu_active(struct notifier_block *nfb,
5249 unsigned long action, void *hcpu)
5251 switch (action & ~CPU_TASKS_FROZEN) {
5253 set_cpu_rq_start_time();
5255 case CPU_DOWN_FAILED:
5256 set_cpu_active((long)hcpu, true);
5263 static int sched_cpu_inactive(struct notifier_block *nfb,
5264 unsigned long action, void *hcpu)
5266 unsigned long flags;
5267 long cpu = (long)hcpu;
5269 switch (action & ~CPU_TASKS_FROZEN) {
5270 case CPU_DOWN_PREPARE:
5271 set_cpu_active(cpu, false);
5273 /* explicitly allow suspend */
5274 if (!(action & CPU_TASKS_FROZEN)) {
5275 struct dl_bw *dl_b = dl_bw_of(cpu);
5279 raw_spin_lock_irqsave(&dl_b->lock, flags);
5280 cpus = dl_bw_cpus(cpu);
5281 overflow = __dl_overflow(dl_b, cpus, 0, 0);
5282 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
5285 return notifier_from_errno(-EBUSY);
5293 static int __init migration_init(void)
5295 void *cpu = (void *)(long)smp_processor_id();
5298 /* Initialize migration for the boot CPU */
5299 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
5300 BUG_ON(err == NOTIFY_BAD);
5301 migration_call(&migration_notifier, CPU_ONLINE, cpu);
5302 register_cpu_notifier(&migration_notifier);
5304 /* Register cpu active notifiers */
5305 cpu_notifier(sched_cpu_active, CPU_PRI_SCHED_ACTIVE);
5306 cpu_notifier(sched_cpu_inactive, CPU_PRI_SCHED_INACTIVE);
5310 early_initcall(migration_init);
5315 static cpumask_var_t sched_domains_tmpmask; /* sched_domains_mutex */
5317 #ifdef CONFIG_SCHED_DEBUG
5319 static __read_mostly int sched_debug_enabled;
5321 static int __init sched_debug_setup(char *str)
5323 sched_debug_enabled = 1;
5327 early_param("sched_debug", sched_debug_setup);
5329 static inline bool sched_debug(void)
5331 return sched_debug_enabled;
5334 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5335 struct cpumask *groupmask)
5337 struct sched_group *group = sd->groups;
5340 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
5341 cpumask_clear(groupmask);
5343 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5345 if (!(sd->flags & SD_LOAD_BALANCE)) {
5346 printk("does not load-balance\n");
5348 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5353 printk(KERN_CONT "span %s level %s\n", str, sd->name);
5355 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5356 printk(KERN_ERR "ERROR: domain->span does not contain "
5359 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5360 printk(KERN_ERR "ERROR: domain->groups does not contain"
5364 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5368 printk(KERN_ERR "ERROR: group is NULL\n");
5373 * Even though we initialize ->capacity to something semi-sane,
5374 * we leave capacity_orig unset. This allows us to detect if
5375 * domain iteration is still funny without causing /0 traps.
5377 if (!group->sgc->capacity_orig) {
5378 printk(KERN_CONT "\n");
5379 printk(KERN_ERR "ERROR: domain->cpu_capacity not set\n");
5383 if (!cpumask_weight(sched_group_cpus(group))) {
5384 printk(KERN_CONT "\n");
5385 printk(KERN_ERR "ERROR: empty group\n");
5389 if (!(sd->flags & SD_OVERLAP) &&
5390 cpumask_intersects(groupmask, sched_group_cpus(group))) {
5391 printk(KERN_CONT "\n");
5392 printk(KERN_ERR "ERROR: repeated CPUs\n");
5396 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
5398 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
5400 printk(KERN_CONT " %s", str);
5401 if (group->sgc->capacity != SCHED_CAPACITY_SCALE) {
5402 printk(KERN_CONT " (cpu_capacity = %d)",
5403 group->sgc->capacity);
5406 group = group->next;
5407 } while (group != sd->groups);
5408 printk(KERN_CONT "\n");
5410 if (!cpumask_equal(sched_domain_span(sd), groupmask))
5411 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
5414 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
5415 printk(KERN_ERR "ERROR: parent span is not a superset "
5416 "of domain->span\n");
5420 static void sched_domain_debug(struct sched_domain *sd, int cpu)
5424 if (!sched_debug_enabled)
5428 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
5432 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
5435 if (sched_domain_debug_one(sd, cpu, level, sched_domains_tmpmask))
5443 #else /* !CONFIG_SCHED_DEBUG */
5444 # define sched_domain_debug(sd, cpu) do { } while (0)
5445 static inline bool sched_debug(void)
5449 #endif /* CONFIG_SCHED_DEBUG */
5451 static int sd_degenerate(struct sched_domain *sd)
5453 if (cpumask_weight(sched_domain_span(sd)) == 1)
5456 /* Following flags need at least 2 groups */
5457 if (sd->flags & (SD_LOAD_BALANCE |
5458 SD_BALANCE_NEWIDLE |
5461 SD_SHARE_CPUCAPACITY |
5462 SD_SHARE_PKG_RESOURCES |
5463 SD_SHARE_POWERDOMAIN)) {
5464 if (sd->groups != sd->groups->next)
5468 /* Following flags don't use groups */
5469 if (sd->flags & (SD_WAKE_AFFINE))
5476 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
5478 unsigned long cflags = sd->flags, pflags = parent->flags;
5480 if (sd_degenerate(parent))
5483 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
5486 /* Flags needing groups don't count if only 1 group in parent */
5487 if (parent->groups == parent->groups->next) {
5488 pflags &= ~(SD_LOAD_BALANCE |
5489 SD_BALANCE_NEWIDLE |
5492 SD_SHARE_CPUCAPACITY |
5493 SD_SHARE_PKG_RESOURCES |
5495 SD_SHARE_POWERDOMAIN);
5496 if (nr_node_ids == 1)
5497 pflags &= ~SD_SERIALIZE;
5499 if (~cflags & pflags)
5505 static void free_rootdomain(struct rcu_head *rcu)
5507 struct root_domain *rd = container_of(rcu, struct root_domain, rcu);
5509 cpupri_cleanup(&rd->cpupri);
5510 cpudl_cleanup(&rd->cpudl);
5511 free_cpumask_var(rd->dlo_mask);
5512 free_cpumask_var(rd->rto_mask);
5513 free_cpumask_var(rd->online);
5514 free_cpumask_var(rd->span);
5518 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
5520 struct root_domain *old_rd = NULL;
5521 unsigned long flags;
5523 raw_spin_lock_irqsave(&rq->lock, flags);
5528 if (cpumask_test_cpu(rq->cpu, old_rd->online))
5531 cpumask_clear_cpu(rq->cpu, old_rd->span);
5534 * If we dont want to free the old_rd yet then
5535 * set old_rd to NULL to skip the freeing later
5538 if (!atomic_dec_and_test(&old_rd->refcount))
5542 atomic_inc(&rd->refcount);
5545 cpumask_set_cpu(rq->cpu, rd->span);
5546 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
5549 raw_spin_unlock_irqrestore(&rq->lock, flags);
5552 call_rcu_sched(&old_rd->rcu, free_rootdomain);
5555 static int init_rootdomain(struct root_domain *rd)
5557 memset(rd, 0, sizeof(*rd));
5559 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
5561 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
5563 if (!alloc_cpumask_var(&rd->dlo_mask, GFP_KERNEL))
5565 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
5568 init_dl_bw(&rd->dl_bw);
5569 if (cpudl_init(&rd->cpudl) != 0)
5572 if (cpupri_init(&rd->cpupri) != 0)
5577 free_cpumask_var(rd->rto_mask);
5579 free_cpumask_var(rd->dlo_mask);
5581 free_cpumask_var(rd->online);
5583 free_cpumask_var(rd->span);
5589 * By default the system creates a single root-domain with all cpus as
5590 * members (mimicking the global state we have today).
5592 struct root_domain def_root_domain;
5594 static void init_defrootdomain(void)
5596 init_rootdomain(&def_root_domain);
5598 atomic_set(&def_root_domain.refcount, 1);
5601 static struct root_domain *alloc_rootdomain(void)
5603 struct root_domain *rd;
5605 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
5609 if (init_rootdomain(rd) != 0) {
5617 static void free_sched_groups(struct sched_group *sg, int free_sgc)
5619 struct sched_group *tmp, *first;
5628 if (free_sgc && atomic_dec_and_test(&sg->sgc->ref))
5633 } while (sg != first);
5636 static void free_sched_domain(struct rcu_head *rcu)
5638 struct sched_domain *sd = container_of(rcu, struct sched_domain, rcu);
5641 * If its an overlapping domain it has private groups, iterate and
5644 if (sd->flags & SD_OVERLAP) {
5645 free_sched_groups(sd->groups, 1);
5646 } else if (atomic_dec_and_test(&sd->groups->ref)) {
5647 kfree(sd->groups->sgc);
5653 static void destroy_sched_domain(struct sched_domain *sd, int cpu)
5655 call_rcu(&sd->rcu, free_sched_domain);
5658 static void destroy_sched_domains(struct sched_domain *sd, int cpu)
5660 for (; sd; sd = sd->parent)
5661 destroy_sched_domain(sd, cpu);
5665 * Keep a special pointer to the highest sched_domain that has
5666 * SD_SHARE_PKG_RESOURCE set (Last Level Cache Domain) for this
5667 * allows us to avoid some pointer chasing select_idle_sibling().
5669 * Also keep a unique ID per domain (we use the first cpu number in
5670 * the cpumask of the domain), this allows us to quickly tell if
5671 * two cpus are in the same cache domain, see cpus_share_cache().
5673 DEFINE_PER_CPU(struct sched_domain *, sd_llc);
5674 DEFINE_PER_CPU(int, sd_llc_size);
5675 DEFINE_PER_CPU(int, sd_llc_id);
5676 DEFINE_PER_CPU(struct sched_domain *, sd_numa);
5677 DEFINE_PER_CPU(struct sched_domain *, sd_busy);
5678 DEFINE_PER_CPU(struct sched_domain *, sd_asym);
5680 static void update_top_cache_domain(int cpu)
5682 struct sched_domain *sd;
5683 struct sched_domain *busy_sd = NULL;
5687 sd = highest_flag_domain(cpu, SD_SHARE_PKG_RESOURCES);
5689 id = cpumask_first(sched_domain_span(sd));
5690 size = cpumask_weight(sched_domain_span(sd));
5691 busy_sd = sd->parent; /* sd_busy */
5693 rcu_assign_pointer(per_cpu(sd_busy, cpu), busy_sd);
5695 rcu_assign_pointer(per_cpu(sd_llc, cpu), sd);
5696 per_cpu(sd_llc_size, cpu) = size;
5697 per_cpu(sd_llc_id, cpu) = id;
5699 sd = lowest_flag_domain(cpu, SD_NUMA);
5700 rcu_assign_pointer(per_cpu(sd_numa, cpu), sd);
5702 sd = highest_flag_domain(cpu, SD_ASYM_PACKING);
5703 rcu_assign_pointer(per_cpu(sd_asym, cpu), sd);
5707 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
5708 * hold the hotplug lock.
5711 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
5713 struct rq *rq = cpu_rq(cpu);
5714 struct sched_domain *tmp;
5716 /* Remove the sched domains which do not contribute to scheduling. */
5717 for (tmp = sd; tmp; ) {
5718 struct sched_domain *parent = tmp->parent;
5722 if (sd_parent_degenerate(tmp, parent)) {
5723 tmp->parent = parent->parent;
5725 parent->parent->child = tmp;
5727 * Transfer SD_PREFER_SIBLING down in case of a
5728 * degenerate parent; the spans match for this
5729 * so the property transfers.
5731 if (parent->flags & SD_PREFER_SIBLING)
5732 tmp->flags |= SD_PREFER_SIBLING;
5733 destroy_sched_domain(parent, cpu);
5738 if (sd && sd_degenerate(sd)) {
5741 destroy_sched_domain(tmp, cpu);
5746 sched_domain_debug(sd, cpu);
5748 rq_attach_root(rq, rd);
5750 rcu_assign_pointer(rq->sd, sd);
5751 destroy_sched_domains(tmp, cpu);
5753 update_top_cache_domain(cpu);
5756 /* cpus with isolated domains */
5757 static cpumask_var_t cpu_isolated_map;
5759 /* Setup the mask of cpus configured for isolated domains */
5760 static int __init isolated_cpu_setup(char *str)
5762 alloc_bootmem_cpumask_var(&cpu_isolated_map);
5763 cpulist_parse(str, cpu_isolated_map);
5767 __setup("isolcpus=", isolated_cpu_setup);
5770 struct sched_domain ** __percpu sd;
5771 struct root_domain *rd;
5782 * Build an iteration mask that can exclude certain CPUs from the upwards
5785 * Asymmetric node setups can result in situations where the domain tree is of
5786 * unequal depth, make sure to skip domains that already cover the entire
5789 * In that case build_sched_domains() will have terminated the iteration early
5790 * and our sibling sd spans will be empty. Domains should always include the
5791 * cpu they're built on, so check that.
5794 static void build_group_mask(struct sched_domain *sd, struct sched_group *sg)
5796 const struct cpumask *span = sched_domain_span(sd);
5797 struct sd_data *sdd = sd->private;
5798 struct sched_domain *sibling;
5801 for_each_cpu(i, span) {
5802 sibling = *per_cpu_ptr(sdd->sd, i);
5803 if (!cpumask_test_cpu(i, sched_domain_span(sibling)))
5806 cpumask_set_cpu(i, sched_group_mask(sg));
5811 * Return the canonical balance cpu for this group, this is the first cpu
5812 * of this group that's also in the iteration mask.
5814 int group_balance_cpu(struct sched_group *sg)
5816 return cpumask_first_and(sched_group_cpus(sg), sched_group_mask(sg));
5820 build_overlap_sched_groups(struct sched_domain *sd, int cpu)
5822 struct sched_group *first = NULL, *last = NULL, *groups = NULL, *sg;
5823 const struct cpumask *span = sched_domain_span(sd);
5824 struct cpumask *covered = sched_domains_tmpmask;
5825 struct sd_data *sdd = sd->private;
5826 struct sched_domain *sibling;
5829 cpumask_clear(covered);
5831 for_each_cpu(i, span) {
5832 struct cpumask *sg_span;
5834 if (cpumask_test_cpu(i, covered))
5837 sibling = *per_cpu_ptr(sdd->sd, i);
5839 /* See the comment near build_group_mask(). */
5840 if (!cpumask_test_cpu(i, sched_domain_span(sibling)))
5843 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
5844 GFP_KERNEL, cpu_to_node(cpu));
5849 sg_span = sched_group_cpus(sg);
5851 cpumask_copy(sg_span, sched_domain_span(sibling->child));
5853 cpumask_set_cpu(i, sg_span);
5855 cpumask_or(covered, covered, sg_span);
5857 sg->sgc = *per_cpu_ptr(sdd->sgc, i);
5858 if (atomic_inc_return(&sg->sgc->ref) == 1)
5859 build_group_mask(sd, sg);
5862 * Initialize sgc->capacity such that even if we mess up the
5863 * domains and no possible iteration will get us here, we won't
5866 sg->sgc->capacity = SCHED_CAPACITY_SCALE * cpumask_weight(sg_span);
5867 sg->sgc->capacity_orig = sg->sgc->capacity;
5870 * Make sure the first group of this domain contains the
5871 * canonical balance cpu. Otherwise the sched_domain iteration
5872 * breaks. See update_sg_lb_stats().
5874 if ((!groups && cpumask_test_cpu(cpu, sg_span)) ||
5875 group_balance_cpu(sg) == cpu)
5885 sd->groups = groups;
5890 free_sched_groups(first, 0);
5895 static int get_group(int cpu, struct sd_data *sdd, struct sched_group **sg)
5897 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, cpu);
5898 struct sched_domain *child = sd->child;
5901 cpu = cpumask_first(sched_domain_span(child));
5904 *sg = *per_cpu_ptr(sdd->sg, cpu);
5905 (*sg)->sgc = *per_cpu_ptr(sdd->sgc, cpu);
5906 atomic_set(&(*sg)->sgc->ref, 1); /* for claim_allocations */
5913 * build_sched_groups will build a circular linked list of the groups
5914 * covered by the given span, and will set each group's ->cpumask correctly,
5915 * and ->cpu_capacity to 0.
5917 * Assumes the sched_domain tree is fully constructed
5920 build_sched_groups(struct sched_domain *sd, int cpu)
5922 struct sched_group *first = NULL, *last = NULL;
5923 struct sd_data *sdd = sd->private;
5924 const struct cpumask *span = sched_domain_span(sd);
5925 struct cpumask *covered;
5928 get_group(cpu, sdd, &sd->groups);
5929 atomic_inc(&sd->groups->ref);
5931 if (cpu != cpumask_first(span))
5934 lockdep_assert_held(&sched_domains_mutex);
5935 covered = sched_domains_tmpmask;
5937 cpumask_clear(covered);
5939 for_each_cpu(i, span) {
5940 struct sched_group *sg;
5943 if (cpumask_test_cpu(i, covered))
5946 group = get_group(i, sdd, &sg);
5947 cpumask_setall(sched_group_mask(sg));
5949 for_each_cpu(j, span) {
5950 if (get_group(j, sdd, NULL) != group)
5953 cpumask_set_cpu(j, covered);
5954 cpumask_set_cpu(j, sched_group_cpus(sg));
5969 * Initialize sched groups cpu_capacity.
5971 * cpu_capacity indicates the capacity of sched group, which is used while
5972 * distributing the load between different sched groups in a sched domain.
5973 * Typically cpu_capacity for all the groups in a sched domain will be same
5974 * unless there are asymmetries in the topology. If there are asymmetries,
5975 * group having more cpu_capacity will pickup more load compared to the
5976 * group having less cpu_capacity.
5978 static void init_sched_groups_capacity(int cpu, struct sched_domain *sd)
5980 struct sched_group *sg = sd->groups;
5985 sg->group_weight = cpumask_weight(sched_group_cpus(sg));
5987 } while (sg != sd->groups);
5989 if (cpu != group_balance_cpu(sg))
5992 update_group_capacity(sd, cpu);
5993 atomic_set(&sg->sgc->nr_busy_cpus, sg->group_weight);
5997 * Initializers for schedule domains
5998 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6001 static int default_relax_domain_level = -1;
6002 int sched_domain_level_max;
6004 static int __init setup_relax_domain_level(char *str)
6006 if (kstrtoint(str, 0, &default_relax_domain_level))
6007 pr_warn("Unable to set relax_domain_level\n");
6011 __setup("relax_domain_level=", setup_relax_domain_level);
6013 static void set_domain_attribute(struct sched_domain *sd,
6014 struct sched_domain_attr *attr)
6018 if (!attr || attr->relax_domain_level < 0) {
6019 if (default_relax_domain_level < 0)
6022 request = default_relax_domain_level;
6024 request = attr->relax_domain_level;
6025 if (request < sd->level) {
6026 /* turn off idle balance on this domain */
6027 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6029 /* turn on idle balance on this domain */
6030 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6034 static void __sdt_free(const struct cpumask *cpu_map);
6035 static int __sdt_alloc(const struct cpumask *cpu_map);
6037 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6038 const struct cpumask *cpu_map)
6042 if (!atomic_read(&d->rd->refcount))
6043 free_rootdomain(&d->rd->rcu); /* fall through */
6045 free_percpu(d->sd); /* fall through */
6047 __sdt_free(cpu_map); /* fall through */
6053 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6054 const struct cpumask *cpu_map)
6056 memset(d, 0, sizeof(*d));
6058 if (__sdt_alloc(cpu_map))
6059 return sa_sd_storage;
6060 d->sd = alloc_percpu(struct sched_domain *);
6062 return sa_sd_storage;
6063 d->rd = alloc_rootdomain();
6066 return sa_rootdomain;
6070 * NULL the sd_data elements we've used to build the sched_domain and
6071 * sched_group structure so that the subsequent __free_domain_allocs()
6072 * will not free the data we're using.
6074 static void claim_allocations(int cpu, struct sched_domain *sd)
6076 struct sd_data *sdd = sd->private;
6078 WARN_ON_ONCE(*per_cpu_ptr(sdd->sd, cpu) != sd);
6079 *per_cpu_ptr(sdd->sd, cpu) = NULL;
6081 if (atomic_read(&(*per_cpu_ptr(sdd->sg, cpu))->ref))
6082 *per_cpu_ptr(sdd->sg, cpu) = NULL;
6084 if (atomic_read(&(*per_cpu_ptr(sdd->sgc, cpu))->ref))
6085 *per_cpu_ptr(sdd->sgc, cpu) = NULL;
6089 static int sched_domains_numa_levels;
6090 static int *sched_domains_numa_distance;
6091 static struct cpumask ***sched_domains_numa_masks;
6092 static int sched_domains_curr_level;
6096 * SD_flags allowed in topology descriptions.
6098 * SD_SHARE_CPUCAPACITY - describes SMT topologies
6099 * SD_SHARE_PKG_RESOURCES - describes shared caches
6100 * SD_NUMA - describes NUMA topologies
6101 * SD_SHARE_POWERDOMAIN - describes shared power domain
6104 * SD_ASYM_PACKING - describes SMT quirks
6106 #define TOPOLOGY_SD_FLAGS \
6107 (SD_SHARE_CPUCAPACITY | \
6108 SD_SHARE_PKG_RESOURCES | \
6111 SD_SHARE_POWERDOMAIN)
6113 static struct sched_domain *
6114 sd_init(struct sched_domain_topology_level *tl, int cpu)
6116 struct sched_domain *sd = *per_cpu_ptr(tl->data.sd, cpu);
6117 int sd_weight, sd_flags = 0;
6121 * Ugly hack to pass state to sd_numa_mask()...
6123 sched_domains_curr_level = tl->numa_level;
6126 sd_weight = cpumask_weight(tl->mask(cpu));
6129 sd_flags = (*tl->sd_flags)();
6130 if (WARN_ONCE(sd_flags & ~TOPOLOGY_SD_FLAGS,
6131 "wrong sd_flags in topology description\n"))
6132 sd_flags &= ~TOPOLOGY_SD_FLAGS;
6134 *sd = (struct sched_domain){
6135 .min_interval = sd_weight,
6136 .max_interval = 2*sd_weight,
6138 .imbalance_pct = 125,
6140 .cache_nice_tries = 0,
6147 .flags = 1*SD_LOAD_BALANCE
6148 | 1*SD_BALANCE_NEWIDLE
6153 | 0*SD_SHARE_CPUCAPACITY
6154 | 0*SD_SHARE_PKG_RESOURCES
6156 | 0*SD_PREFER_SIBLING
6161 .last_balance = jiffies,
6162 .balance_interval = sd_weight,
6164 .max_newidle_lb_cost = 0,
6165 .next_decay_max_lb_cost = jiffies,
6166 #ifdef CONFIG_SCHED_DEBUG
6172 * Convert topological properties into behaviour.
6175 if (sd->flags & SD_SHARE_CPUCAPACITY) {
6176 sd->imbalance_pct = 110;
6177 sd->smt_gain = 1178; /* ~15% */
6179 } else if (sd->flags & SD_SHARE_PKG_RESOURCES) {
6180 sd->imbalance_pct = 117;
6181 sd->cache_nice_tries = 1;
6185 } else if (sd->flags & SD_NUMA) {
6186 sd->cache_nice_tries = 2;
6190 sd->flags |= SD_SERIALIZE;
6191 if (sched_domains_numa_distance[tl->numa_level] > RECLAIM_DISTANCE) {
6192 sd->flags &= ~(SD_BALANCE_EXEC |
6199 sd->flags |= SD_PREFER_SIBLING;
6200 sd->cache_nice_tries = 1;
6205 sd->private = &tl->data;
6211 * Topology list, bottom-up.
6213 static struct sched_domain_topology_level default_topology[] = {
6214 #ifdef CONFIG_SCHED_SMT
6215 { cpu_smt_mask, cpu_smt_flags, SD_INIT_NAME(SMT) },
6217 #ifdef CONFIG_SCHED_MC
6218 { cpu_coregroup_mask, cpu_core_flags, SD_INIT_NAME(MC) },
6220 { cpu_cpu_mask, SD_INIT_NAME(DIE) },
6224 struct sched_domain_topology_level *sched_domain_topology = default_topology;
6226 #define for_each_sd_topology(tl) \
6227 for (tl = sched_domain_topology; tl->mask; tl++)
6229 void set_sched_topology(struct sched_domain_topology_level *tl)
6231 sched_domain_topology = tl;
6236 static const struct cpumask *sd_numa_mask(int cpu)
6238 return sched_domains_numa_masks[sched_domains_curr_level][cpu_to_node(cpu)];
6241 static void sched_numa_warn(const char *str)
6243 static int done = false;
6251 printk(KERN_WARNING "ERROR: %s\n\n", str);
6253 for (i = 0; i < nr_node_ids; i++) {
6254 printk(KERN_WARNING " ");
6255 for (j = 0; j < nr_node_ids; j++)
6256 printk(KERN_CONT "%02d ", node_distance(i,j));
6257 printk(KERN_CONT "\n");
6259 printk(KERN_WARNING "\n");
6262 static bool find_numa_distance(int distance)
6266 if (distance == node_distance(0, 0))
6269 for (i = 0; i < sched_domains_numa_levels; i++) {
6270 if (sched_domains_numa_distance[i] == distance)
6277 static void sched_init_numa(void)
6279 int next_distance, curr_distance = node_distance(0, 0);
6280 struct sched_domain_topology_level *tl;
6284 sched_domains_numa_distance = kzalloc(sizeof(int) * nr_node_ids, GFP_KERNEL);
6285 if (!sched_domains_numa_distance)
6289 * O(nr_nodes^2) deduplicating selection sort -- in order to find the
6290 * unique distances in the node_distance() table.
6292 * Assumes node_distance(0,j) includes all distances in
6293 * node_distance(i,j) in order to avoid cubic time.
6295 next_distance = curr_distance;
6296 for (i = 0; i < nr_node_ids; i++) {
6297 for (j = 0; j < nr_node_ids; j++) {
6298 for (k = 0; k < nr_node_ids; k++) {
6299 int distance = node_distance(i, k);
6301 if (distance > curr_distance &&
6302 (distance < next_distance ||
6303 next_distance == curr_distance))
6304 next_distance = distance;
6307 * While not a strong assumption it would be nice to know
6308 * about cases where if node A is connected to B, B is not
6309 * equally connected to A.
6311 if (sched_debug() && node_distance(k, i) != distance)
6312 sched_numa_warn("Node-distance not symmetric");
6314 if (sched_debug() && i && !find_numa_distance(distance))
6315 sched_numa_warn("Node-0 not representative");
6317 if (next_distance != curr_distance) {
6318 sched_domains_numa_distance[level++] = next_distance;
6319 sched_domains_numa_levels = level;
6320 curr_distance = next_distance;
6325 * In case of sched_debug() we verify the above assumption.
6331 * 'level' contains the number of unique distances, excluding the
6332 * identity distance node_distance(i,i).
6334 * The sched_domains_numa_distance[] array includes the actual distance
6339 * Here, we should temporarily reset sched_domains_numa_levels to 0.
6340 * If it fails to allocate memory for array sched_domains_numa_masks[][],
6341 * the array will contain less then 'level' members. This could be
6342 * dangerous when we use it to iterate array sched_domains_numa_masks[][]
6343 * in other functions.
6345 * We reset it to 'level' at the end of this function.
6347 sched_domains_numa_levels = 0;
6349 sched_domains_numa_masks = kzalloc(sizeof(void *) * level, GFP_KERNEL);
6350 if (!sched_domains_numa_masks)
6354 * Now for each level, construct a mask per node which contains all
6355 * cpus of nodes that are that many hops away from us.
6357 for (i = 0; i < level; i++) {
6358 sched_domains_numa_masks[i] =
6359 kzalloc(nr_node_ids * sizeof(void *), GFP_KERNEL);
6360 if (!sched_domains_numa_masks[i])
6363 for (j = 0; j < nr_node_ids; j++) {
6364 struct cpumask *mask = kzalloc(cpumask_size(), GFP_KERNEL);
6368 sched_domains_numa_masks[i][j] = mask;
6370 for (k = 0; k < nr_node_ids; k++) {
6371 if (node_distance(j, k) > sched_domains_numa_distance[i])
6374 cpumask_or(mask, mask, cpumask_of_node(k));
6379 /* Compute default topology size */
6380 for (i = 0; sched_domain_topology[i].mask; i++);
6382 tl = kzalloc((i + level + 1) *
6383 sizeof(struct sched_domain_topology_level), GFP_KERNEL);
6388 * Copy the default topology bits..
6390 for (i = 0; sched_domain_topology[i].mask; i++)
6391 tl[i] = sched_domain_topology[i];
6394 * .. and append 'j' levels of NUMA goodness.
6396 for (j = 0; j < level; i++, j++) {
6397 tl[i] = (struct sched_domain_topology_level){
6398 .mask = sd_numa_mask,
6399 .sd_flags = cpu_numa_flags,
6400 .flags = SDTL_OVERLAP,
6406 sched_domain_topology = tl;
6408 sched_domains_numa_levels = level;
6411 static void sched_domains_numa_masks_set(int cpu)
6414 int node = cpu_to_node(cpu);
6416 for (i = 0; i < sched_domains_numa_levels; i++) {
6417 for (j = 0; j < nr_node_ids; j++) {
6418 if (node_distance(j, node) <= sched_domains_numa_distance[i])
6419 cpumask_set_cpu(cpu, sched_domains_numa_masks[i][j]);
6424 static void sched_domains_numa_masks_clear(int cpu)
6427 for (i = 0; i < sched_domains_numa_levels; i++) {
6428 for (j = 0; j < nr_node_ids; j++)
6429 cpumask_clear_cpu(cpu, sched_domains_numa_masks[i][j]);
6434 * Update sched_domains_numa_masks[level][node] array when new cpus
6437 static int sched_domains_numa_masks_update(struct notifier_block *nfb,
6438 unsigned long action,
6441 int cpu = (long)hcpu;
6443 switch (action & ~CPU_TASKS_FROZEN) {
6445 sched_domains_numa_masks_set(cpu);
6449 sched_domains_numa_masks_clear(cpu);
6459 static inline void sched_init_numa(void)
6463 static int sched_domains_numa_masks_update(struct notifier_block *nfb,
6464 unsigned long action,
6469 #endif /* CONFIG_NUMA */
6471 static int __sdt_alloc(const struct cpumask *cpu_map)
6473 struct sched_domain_topology_level *tl;
6476 for_each_sd_topology(tl) {
6477 struct sd_data *sdd = &tl->data;
6479 sdd->sd = alloc_percpu(struct sched_domain *);
6483 sdd->sg = alloc_percpu(struct sched_group *);
6487 sdd->sgc = alloc_percpu(struct sched_group_capacity *);
6491 for_each_cpu(j, cpu_map) {
6492 struct sched_domain *sd;
6493 struct sched_group *sg;
6494 struct sched_group_capacity *sgc;
6496 sd = kzalloc_node(sizeof(struct sched_domain) + cpumask_size(),
6497 GFP_KERNEL, cpu_to_node(j));
6501 *per_cpu_ptr(sdd->sd, j) = sd;
6503 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6504 GFP_KERNEL, cpu_to_node(j));
6510 *per_cpu_ptr(sdd->sg, j) = sg;
6512 sgc = kzalloc_node(sizeof(struct sched_group_capacity) + cpumask_size(),
6513 GFP_KERNEL, cpu_to_node(j));
6517 *per_cpu_ptr(sdd->sgc, j) = sgc;
6524 static void __sdt_free(const struct cpumask *cpu_map)
6526 struct sched_domain_topology_level *tl;
6529 for_each_sd_topology(tl) {
6530 struct sd_data *sdd = &tl->data;
6532 for_each_cpu(j, cpu_map) {
6533 struct sched_domain *sd;
6536 sd = *per_cpu_ptr(sdd->sd, j);
6537 if (sd && (sd->flags & SD_OVERLAP))
6538 free_sched_groups(sd->groups, 0);
6539 kfree(*per_cpu_ptr(sdd->sd, j));
6543 kfree(*per_cpu_ptr(sdd->sg, j));
6545 kfree(*per_cpu_ptr(sdd->sgc, j));
6547 free_percpu(sdd->sd);
6549 free_percpu(sdd->sg);
6551 free_percpu(sdd->sgc);
6556 struct sched_domain *build_sched_domain(struct sched_domain_topology_level *tl,
6557 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6558 struct sched_domain *child, int cpu)
6560 struct sched_domain *sd = sd_init(tl, cpu);
6564 cpumask_and(sched_domain_span(sd), cpu_map, tl->mask(cpu));
6566 sd->level = child->level + 1;
6567 sched_domain_level_max = max(sched_domain_level_max, sd->level);
6571 if (!cpumask_subset(sched_domain_span(child),
6572 sched_domain_span(sd))) {
6573 pr_err("BUG: arch topology borken\n");
6574 #ifdef CONFIG_SCHED_DEBUG
6575 pr_err(" the %s domain not a subset of the %s domain\n",
6576 child->name, sd->name);
6578 /* Fixup, ensure @sd has at least @child cpus. */
6579 cpumask_or(sched_domain_span(sd),
6580 sched_domain_span(sd),
6581 sched_domain_span(child));
6585 set_domain_attribute(sd, attr);
6591 * Build sched domains for a given set of cpus and attach the sched domains
6592 * to the individual cpus
6594 static int build_sched_domains(const struct cpumask *cpu_map,
6595 struct sched_domain_attr *attr)
6597 enum s_alloc alloc_state;
6598 struct sched_domain *sd;
6600 int i, ret = -ENOMEM;
6602 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
6603 if (alloc_state != sa_rootdomain)
6606 /* Set up domains for cpus specified by the cpu_map. */
6607 for_each_cpu(i, cpu_map) {
6608 struct sched_domain_topology_level *tl;
6611 for_each_sd_topology(tl) {
6612 sd = build_sched_domain(tl, cpu_map, attr, sd, i);
6613 if (tl == sched_domain_topology)
6614 *per_cpu_ptr(d.sd, i) = sd;
6615 if (tl->flags & SDTL_OVERLAP || sched_feat(FORCE_SD_OVERLAP))
6616 sd->flags |= SD_OVERLAP;
6617 if (cpumask_equal(cpu_map, sched_domain_span(sd)))
6622 /* Build the groups for the domains */
6623 for_each_cpu(i, cpu_map) {
6624 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6625 sd->span_weight = cpumask_weight(sched_domain_span(sd));
6626 if (sd->flags & SD_OVERLAP) {
6627 if (build_overlap_sched_groups(sd, i))
6630 if (build_sched_groups(sd, i))
6636 /* Calculate CPU capacity for physical packages and nodes */
6637 for (i = nr_cpumask_bits-1; i >= 0; i--) {
6638 if (!cpumask_test_cpu(i, cpu_map))
6641 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6642 claim_allocations(i, sd);
6643 init_sched_groups_capacity(i, sd);
6647 /* Attach the domains */
6649 for_each_cpu(i, cpu_map) {
6650 sd = *per_cpu_ptr(d.sd, i);
6651 cpu_attach_domain(sd, d.rd, i);
6657 __free_domain_allocs(&d, alloc_state, cpu_map);
6661 static cpumask_var_t *doms_cur; /* current sched domains */
6662 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
6663 static struct sched_domain_attr *dattr_cur;
6664 /* attribues of custom domains in 'doms_cur' */
6667 * Special case: If a kmalloc of a doms_cur partition (array of
6668 * cpumask) fails, then fallback to a single sched domain,
6669 * as determined by the single cpumask fallback_doms.
6671 static cpumask_var_t fallback_doms;
6674 * arch_update_cpu_topology lets virtualized architectures update the
6675 * cpu core maps. It is supposed to return 1 if the topology changed
6676 * or 0 if it stayed the same.
6678 int __weak arch_update_cpu_topology(void)
6683 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
6686 cpumask_var_t *doms;
6688 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
6691 for (i = 0; i < ndoms; i++) {
6692 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
6693 free_sched_domains(doms, i);
6700 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
6703 for (i = 0; i < ndoms; i++)
6704 free_cpumask_var(doms[i]);
6709 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
6710 * For now this just excludes isolated cpus, but could be used to
6711 * exclude other special cases in the future.
6713 static int init_sched_domains(const struct cpumask *cpu_map)
6717 arch_update_cpu_topology();
6719 doms_cur = alloc_sched_domains(ndoms_cur);
6721 doms_cur = &fallback_doms;
6722 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
6723 err = build_sched_domains(doms_cur[0], NULL);
6724 register_sched_domain_sysctl();
6730 * Detach sched domains from a group of cpus specified in cpu_map
6731 * These cpus will now be attached to the NULL domain
6733 static void detach_destroy_domains(const struct cpumask *cpu_map)
6738 for_each_cpu(i, cpu_map)
6739 cpu_attach_domain(NULL, &def_root_domain, i);
6743 /* handle null as "default" */
6744 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
6745 struct sched_domain_attr *new, int idx_new)
6747 struct sched_domain_attr tmp;
6754 return !memcmp(cur ? (cur + idx_cur) : &tmp,
6755 new ? (new + idx_new) : &tmp,
6756 sizeof(struct sched_domain_attr));
6760 * Partition sched domains as specified by the 'ndoms_new'
6761 * cpumasks in the array doms_new[] of cpumasks. This compares
6762 * doms_new[] to the current sched domain partitioning, doms_cur[].
6763 * It destroys each deleted domain and builds each new domain.
6765 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
6766 * The masks don't intersect (don't overlap.) We should setup one
6767 * sched domain for each mask. CPUs not in any of the cpumasks will
6768 * not be load balanced. If the same cpumask appears both in the
6769 * current 'doms_cur' domains and in the new 'doms_new', we can leave
6772 * The passed in 'doms_new' should be allocated using
6773 * alloc_sched_domains. This routine takes ownership of it and will
6774 * free_sched_domains it when done with it. If the caller failed the
6775 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
6776 * and partition_sched_domains() will fallback to the single partition
6777 * 'fallback_doms', it also forces the domains to be rebuilt.
6779 * If doms_new == NULL it will be replaced with cpu_online_mask.
6780 * ndoms_new == 0 is a special case for destroying existing domains,
6781 * and it will not create the default domain.
6783 * Call with hotplug lock held
6785 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
6786 struct sched_domain_attr *dattr_new)
6791 mutex_lock(&sched_domains_mutex);
6793 /* always unregister in case we don't destroy any domains */
6794 unregister_sched_domain_sysctl();
6796 /* Let architecture update cpu core mappings. */
6797 new_topology = arch_update_cpu_topology();
6799 n = doms_new ? ndoms_new : 0;
6801 /* Destroy deleted domains */
6802 for (i = 0; i < ndoms_cur; i++) {
6803 for (j = 0; j < n && !new_topology; j++) {
6804 if (cpumask_equal(doms_cur[i], doms_new[j])
6805 && dattrs_equal(dattr_cur, i, dattr_new, j))
6808 /* no match - a current sched domain not in new doms_new[] */
6809 detach_destroy_domains(doms_cur[i]);
6815 if (doms_new == NULL) {
6817 doms_new = &fallback_doms;
6818 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
6819 WARN_ON_ONCE(dattr_new);
6822 /* Build new domains */
6823 for (i = 0; i < ndoms_new; i++) {
6824 for (j = 0; j < n && !new_topology; j++) {
6825 if (cpumask_equal(doms_new[i], doms_cur[j])
6826 && dattrs_equal(dattr_new, i, dattr_cur, j))
6829 /* no match - add a new doms_new */
6830 build_sched_domains(doms_new[i], dattr_new ? dattr_new + i : NULL);
6835 /* Remember the new sched domains */
6836 if (doms_cur != &fallback_doms)
6837 free_sched_domains(doms_cur, ndoms_cur);
6838 kfree(dattr_cur); /* kfree(NULL) is safe */
6839 doms_cur = doms_new;
6840 dattr_cur = dattr_new;
6841 ndoms_cur = ndoms_new;
6843 register_sched_domain_sysctl();
6845 mutex_unlock(&sched_domains_mutex);
6848 static int num_cpus_frozen; /* used to mark begin/end of suspend/resume */
6851 * Update cpusets according to cpu_active mask. If cpusets are
6852 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
6853 * around partition_sched_domains().
6855 * If we come here as part of a suspend/resume, don't touch cpusets because we
6856 * want to restore it back to its original state upon resume anyway.
6858 static int cpuset_cpu_active(struct notifier_block *nfb, unsigned long action,
6862 case CPU_ONLINE_FROZEN:
6863 case CPU_DOWN_FAILED_FROZEN:
6866 * num_cpus_frozen tracks how many CPUs are involved in suspend
6867 * resume sequence. As long as this is not the last online
6868 * operation in the resume sequence, just build a single sched
6869 * domain, ignoring cpusets.
6872 if (likely(num_cpus_frozen)) {
6873 partition_sched_domains(1, NULL, NULL);
6878 * This is the last CPU online operation. So fall through and
6879 * restore the original sched domains by considering the
6880 * cpuset configurations.
6884 case CPU_DOWN_FAILED:
6885 cpuset_update_active_cpus(true);
6893 static int cpuset_cpu_inactive(struct notifier_block *nfb, unsigned long action,
6897 case CPU_DOWN_PREPARE:
6898 cpuset_update_active_cpus(false);
6900 case CPU_DOWN_PREPARE_FROZEN:
6902 partition_sched_domains(1, NULL, NULL);
6910 void __init sched_init_smp(void)
6912 cpumask_var_t non_isolated_cpus;
6914 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
6915 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
6920 * There's no userspace yet to cause hotplug operations; hence all the
6921 * cpu masks are stable and all blatant races in the below code cannot
6924 mutex_lock(&sched_domains_mutex);
6925 init_sched_domains(cpu_active_mask);
6926 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
6927 if (cpumask_empty(non_isolated_cpus))
6928 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
6929 mutex_unlock(&sched_domains_mutex);
6931 hotcpu_notifier(sched_domains_numa_masks_update, CPU_PRI_SCHED_ACTIVE);
6932 hotcpu_notifier(cpuset_cpu_active, CPU_PRI_CPUSET_ACTIVE);
6933 hotcpu_notifier(cpuset_cpu_inactive, CPU_PRI_CPUSET_INACTIVE);
6937 /* Move init over to a non-isolated CPU */
6938 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
6940 sched_init_granularity();
6941 free_cpumask_var(non_isolated_cpus);
6943 init_sched_rt_class();
6944 init_sched_dl_class();
6947 void __init sched_init_smp(void)
6949 sched_init_granularity();
6951 #endif /* CONFIG_SMP */
6953 const_debug unsigned int sysctl_timer_migration = 1;
6955 int in_sched_functions(unsigned long addr)
6957 return in_lock_functions(addr) ||
6958 (addr >= (unsigned long)__sched_text_start
6959 && addr < (unsigned long)__sched_text_end);
6962 #ifdef CONFIG_CGROUP_SCHED
6964 * Default task group.
6965 * Every task in system belongs to this group at bootup.
6967 struct task_group root_task_group;
6968 LIST_HEAD(task_groups);
6971 DECLARE_PER_CPU(cpumask_var_t, load_balance_mask);
6973 void __init sched_init(void)
6976 unsigned long alloc_size = 0, ptr;
6978 #ifdef CONFIG_FAIR_GROUP_SCHED
6979 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6981 #ifdef CONFIG_RT_GROUP_SCHED
6982 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6984 #ifdef CONFIG_CPUMASK_OFFSTACK
6985 alloc_size += num_possible_cpus() * cpumask_size();
6988 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
6990 #ifdef CONFIG_FAIR_GROUP_SCHED
6991 root_task_group.se = (struct sched_entity **)ptr;
6992 ptr += nr_cpu_ids * sizeof(void **);
6994 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
6995 ptr += nr_cpu_ids * sizeof(void **);
6997 #endif /* CONFIG_FAIR_GROUP_SCHED */
6998 #ifdef CONFIG_RT_GROUP_SCHED
6999 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
7000 ptr += nr_cpu_ids * sizeof(void **);
7002 root_task_group.rt_rq = (struct rt_rq **)ptr;
7003 ptr += nr_cpu_ids * sizeof(void **);
7005 #endif /* CONFIG_RT_GROUP_SCHED */
7006 #ifdef CONFIG_CPUMASK_OFFSTACK
7007 for_each_possible_cpu(i) {
7008 per_cpu(load_balance_mask, i) = (void *)ptr;
7009 ptr += cpumask_size();
7011 #endif /* CONFIG_CPUMASK_OFFSTACK */
7014 init_rt_bandwidth(&def_rt_bandwidth,
7015 global_rt_period(), global_rt_runtime());
7016 init_dl_bandwidth(&def_dl_bandwidth,
7017 global_rt_period(), global_rt_runtime());
7020 init_defrootdomain();
7023 #ifdef CONFIG_RT_GROUP_SCHED
7024 init_rt_bandwidth(&root_task_group.rt_bandwidth,
7025 global_rt_period(), global_rt_runtime());
7026 #endif /* CONFIG_RT_GROUP_SCHED */
7028 #ifdef CONFIG_CGROUP_SCHED
7029 list_add(&root_task_group.list, &task_groups);
7030 INIT_LIST_HEAD(&root_task_group.children);
7031 INIT_LIST_HEAD(&root_task_group.siblings);
7032 autogroup_init(&init_task);
7034 #endif /* CONFIG_CGROUP_SCHED */
7036 for_each_possible_cpu(i) {
7040 raw_spin_lock_init(&rq->lock);
7042 rq->calc_load_active = 0;
7043 rq->calc_load_update = jiffies + LOAD_FREQ;
7044 init_cfs_rq(&rq->cfs);
7045 init_rt_rq(&rq->rt, rq);
7046 init_dl_rq(&rq->dl, rq);
7047 #ifdef CONFIG_FAIR_GROUP_SCHED
7048 root_task_group.shares = ROOT_TASK_GROUP_LOAD;
7049 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
7051 * How much cpu bandwidth does root_task_group get?
7053 * In case of task-groups formed thr' the cgroup filesystem, it
7054 * gets 100% of the cpu resources in the system. This overall
7055 * system cpu resource is divided among the tasks of
7056 * root_task_group and its child task-groups in a fair manner,
7057 * based on each entity's (task or task-group's) weight
7058 * (se->load.weight).
7060 * In other words, if root_task_group has 10 tasks of weight
7061 * 1024) and two child groups A0 and A1 (of weight 1024 each),
7062 * then A0's share of the cpu resource is:
7064 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
7066 * We achieve this by letting root_task_group's tasks sit
7067 * directly in rq->cfs (i.e root_task_group->se[] = NULL).
7069 init_cfs_bandwidth(&root_task_group.cfs_bandwidth);
7070 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL);
7071 #endif /* CONFIG_FAIR_GROUP_SCHED */
7073 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
7074 #ifdef CONFIG_RT_GROUP_SCHED
7075 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL);
7078 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
7079 rq->cpu_load[j] = 0;
7081 rq->last_load_update_tick = jiffies;
7086 rq->cpu_capacity = SCHED_CAPACITY_SCALE;
7087 rq->post_schedule = 0;
7088 rq->active_balance = 0;
7089 rq->next_balance = jiffies;
7094 rq->avg_idle = 2*sysctl_sched_migration_cost;
7095 rq->max_idle_balance_cost = sysctl_sched_migration_cost;
7097 INIT_LIST_HEAD(&rq->cfs_tasks);
7099 rq_attach_root(rq, &def_root_domain);
7100 #ifdef CONFIG_NO_HZ_COMMON
7103 #ifdef CONFIG_NO_HZ_FULL
7104 rq->last_sched_tick = 0;
7108 atomic_set(&rq->nr_iowait, 0);
7111 set_load_weight(&init_task);
7113 #ifdef CONFIG_PREEMPT_NOTIFIERS
7114 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
7118 * The boot idle thread does lazy MMU switching as well:
7120 atomic_inc(&init_mm.mm_count);
7121 enter_lazy_tlb(&init_mm, current);
7124 * Make us the idle thread. Technically, schedule() should not be
7125 * called from this thread, however somewhere below it might be,
7126 * but because we are the idle thread, we just pick up running again
7127 * when this runqueue becomes "idle".
7129 init_idle(current, smp_processor_id());
7131 calc_load_update = jiffies + LOAD_FREQ;
7134 * During early bootup we pretend to be a normal task:
7136 current->sched_class = &fair_sched_class;
7139 zalloc_cpumask_var(&sched_domains_tmpmask, GFP_NOWAIT);
7140 /* May be allocated at isolcpus cmdline parse time */
7141 if (cpu_isolated_map == NULL)
7142 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7143 idle_thread_set_boot_cpu();
7144 set_cpu_rq_start_time();
7146 init_sched_fair_class();
7148 scheduler_running = 1;
7151 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
7152 static inline int preempt_count_equals(int preempt_offset)
7154 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
7156 return (nested == preempt_offset);
7159 void __might_sleep(const char *file, int line, int preempt_offset)
7161 static unsigned long prev_jiffy; /* ratelimiting */
7163 rcu_sleep_check(); /* WARN_ON_ONCE() by default, no rate limit reqd. */
7164 if ((preempt_count_equals(preempt_offset) && !irqs_disabled() &&
7165 !is_idle_task(current)) ||
7166 system_state != SYSTEM_RUNNING || oops_in_progress)
7168 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7170 prev_jiffy = jiffies;
7173 "BUG: sleeping function called from invalid context at %s:%d\n",
7176 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7177 in_atomic(), irqs_disabled(),
7178 current->pid, current->comm);
7180 debug_show_held_locks(current);
7181 if (irqs_disabled())
7182 print_irqtrace_events(current);
7183 #ifdef CONFIG_DEBUG_PREEMPT
7184 if (!preempt_count_equals(preempt_offset)) {
7185 pr_err("Preemption disabled at:");
7186 print_ip_sym(current->preempt_disable_ip);
7192 EXPORT_SYMBOL(__might_sleep);
7195 #ifdef CONFIG_MAGIC_SYSRQ
7196 static void normalize_task(struct rq *rq, struct task_struct *p)
7198 const struct sched_class *prev_class = p->sched_class;
7199 struct sched_attr attr = {
7200 .sched_policy = SCHED_NORMAL,
7202 int old_prio = p->prio;
7205 queued = task_on_rq_queued(p);
7207 dequeue_task(rq, p, 0);
7208 __setscheduler(rq, p, &attr);
7210 enqueue_task(rq, p, 0);
7214 check_class_changed(rq, p, prev_class, old_prio);
7217 void normalize_rt_tasks(void)
7219 struct task_struct *g, *p;
7220 unsigned long flags;
7223 read_lock(&tasklist_lock);
7224 for_each_process_thread(g, p) {
7226 * Only normalize user tasks:
7228 if (p->flags & PF_KTHREAD)
7231 p->se.exec_start = 0;
7232 #ifdef CONFIG_SCHEDSTATS
7233 p->se.statistics.wait_start = 0;
7234 p->se.statistics.sleep_start = 0;
7235 p->se.statistics.block_start = 0;
7238 if (!dl_task(p) && !rt_task(p)) {
7240 * Renice negative nice level userspace
7243 if (task_nice(p) < 0)
7244 set_user_nice(p, 0);
7248 rq = task_rq_lock(p, &flags);
7249 normalize_task(rq, p);
7250 task_rq_unlock(rq, p, &flags);
7252 read_unlock(&tasklist_lock);
7255 #endif /* CONFIG_MAGIC_SYSRQ */
7257 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
7259 * These functions are only useful for the IA64 MCA handling, or kdb.
7261 * They can only be called when the whole system has been
7262 * stopped - every CPU needs to be quiescent, and no scheduling
7263 * activity can take place. Using them for anything else would
7264 * be a serious bug, and as a result, they aren't even visible
7265 * under any other configuration.
7269 * curr_task - return the current task for a given cpu.
7270 * @cpu: the processor in question.
7272 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7274 * Return: The current task for @cpu.
7276 struct task_struct *curr_task(int cpu)
7278 return cpu_curr(cpu);
7281 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
7285 * set_curr_task - set the current task for a given cpu.
7286 * @cpu: the processor in question.
7287 * @p: the task pointer to set.
7289 * Description: This function must only be used when non-maskable interrupts
7290 * are serviced on a separate stack. It allows the architecture to switch the
7291 * notion of the current task on a cpu in a non-blocking manner. This function
7292 * must be called with all CPU's synchronized, and interrupts disabled, the
7293 * and caller must save the original value of the current task (see
7294 * curr_task() above) and restore that value before reenabling interrupts and
7295 * re-starting the system.
7297 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7299 void set_curr_task(int cpu, struct task_struct *p)
7306 #ifdef CONFIG_CGROUP_SCHED
7307 /* task_group_lock serializes the addition/removal of task groups */
7308 static DEFINE_SPINLOCK(task_group_lock);
7310 static void free_sched_group(struct task_group *tg)
7312 free_fair_sched_group(tg);
7313 free_rt_sched_group(tg);
7318 /* allocate runqueue etc for a new task group */
7319 struct task_group *sched_create_group(struct task_group *parent)
7321 struct task_group *tg;
7323 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
7325 return ERR_PTR(-ENOMEM);
7327 if (!alloc_fair_sched_group(tg, parent))
7330 if (!alloc_rt_sched_group(tg, parent))
7336 free_sched_group(tg);
7337 return ERR_PTR(-ENOMEM);
7340 void sched_online_group(struct task_group *tg, struct task_group *parent)
7342 unsigned long flags;
7344 spin_lock_irqsave(&task_group_lock, flags);
7345 list_add_rcu(&tg->list, &task_groups);
7347 WARN_ON(!parent); /* root should already exist */
7349 tg->parent = parent;
7350 INIT_LIST_HEAD(&tg->children);
7351 list_add_rcu(&tg->siblings, &parent->children);
7352 spin_unlock_irqrestore(&task_group_lock, flags);
7355 /* rcu callback to free various structures associated with a task group */
7356 static void free_sched_group_rcu(struct rcu_head *rhp)
7358 /* now it should be safe to free those cfs_rqs */
7359 free_sched_group(container_of(rhp, struct task_group, rcu));
7362 /* Destroy runqueue etc associated with a task group */
7363 void sched_destroy_group(struct task_group *tg)
7365 /* wait for possible concurrent references to cfs_rqs complete */
7366 call_rcu(&tg->rcu, free_sched_group_rcu);
7369 void sched_offline_group(struct task_group *tg)
7371 unsigned long flags;
7374 /* end participation in shares distribution */
7375 for_each_possible_cpu(i)
7376 unregister_fair_sched_group(tg, i);
7378 spin_lock_irqsave(&task_group_lock, flags);
7379 list_del_rcu(&tg->list);
7380 list_del_rcu(&tg->siblings);
7381 spin_unlock_irqrestore(&task_group_lock, flags);
7384 /* change task's runqueue when it moves between groups.
7385 * The caller of this function should have put the task in its new group
7386 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
7387 * reflect its new group.
7389 void sched_move_task(struct task_struct *tsk)
7391 struct task_group *tg;
7392 int queued, running;
7393 unsigned long flags;
7396 rq = task_rq_lock(tsk, &flags);
7398 running = task_current(rq, tsk);
7399 queued = task_on_rq_queued(tsk);
7402 dequeue_task(rq, tsk, 0);
7403 if (unlikely(running))
7404 put_prev_task(rq, tsk);
7406 tg = container_of(task_css_check(tsk, cpu_cgrp_id,
7407 lockdep_is_held(&tsk->sighand->siglock)),
7408 struct task_group, css);
7409 tg = autogroup_task_group(tsk, tg);
7410 tsk->sched_task_group = tg;
7412 #ifdef CONFIG_FAIR_GROUP_SCHED
7413 if (tsk->sched_class->task_move_group)
7414 tsk->sched_class->task_move_group(tsk, queued);
7417 set_task_rq(tsk, task_cpu(tsk));
7419 if (unlikely(running))
7420 tsk->sched_class->set_curr_task(rq);
7422 enqueue_task(rq, tsk, 0);
7424 task_rq_unlock(rq, tsk, &flags);
7426 #endif /* CONFIG_CGROUP_SCHED */
7428 #ifdef CONFIG_RT_GROUP_SCHED
7430 * Ensure that the real time constraints are schedulable.
7432 static DEFINE_MUTEX(rt_constraints_mutex);
7434 /* Must be called with tasklist_lock held */
7435 static inline int tg_has_rt_tasks(struct task_group *tg)
7437 struct task_struct *g, *p;
7439 for_each_process_thread(g, p) {
7440 if (rt_task(p) && task_group(p) == tg)
7447 struct rt_schedulable_data {
7448 struct task_group *tg;
7453 static int tg_rt_schedulable(struct task_group *tg, void *data)
7455 struct rt_schedulable_data *d = data;
7456 struct task_group *child;
7457 unsigned long total, sum = 0;
7458 u64 period, runtime;
7460 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7461 runtime = tg->rt_bandwidth.rt_runtime;
7464 period = d->rt_period;
7465 runtime = d->rt_runtime;
7469 * Cannot have more runtime than the period.
7471 if (runtime > period && runtime != RUNTIME_INF)
7475 * Ensure we don't starve existing RT tasks.
7477 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
7480 total = to_ratio(period, runtime);
7483 * Nobody can have more than the global setting allows.
7485 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
7489 * The sum of our children's runtime should not exceed our own.
7491 list_for_each_entry_rcu(child, &tg->children, siblings) {
7492 period = ktime_to_ns(child->rt_bandwidth.rt_period);
7493 runtime = child->rt_bandwidth.rt_runtime;
7495 if (child == d->tg) {
7496 period = d->rt_period;
7497 runtime = d->rt_runtime;
7500 sum += to_ratio(period, runtime);
7509 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
7513 struct rt_schedulable_data data = {
7515 .rt_period = period,
7516 .rt_runtime = runtime,
7520 ret = walk_tg_tree(tg_rt_schedulable, tg_nop, &data);
7526 static int tg_set_rt_bandwidth(struct task_group *tg,
7527 u64 rt_period, u64 rt_runtime)
7531 mutex_lock(&rt_constraints_mutex);
7532 read_lock(&tasklist_lock);
7533 err = __rt_schedulable(tg, rt_period, rt_runtime);
7537 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7538 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
7539 tg->rt_bandwidth.rt_runtime = rt_runtime;
7541 for_each_possible_cpu(i) {
7542 struct rt_rq *rt_rq = tg->rt_rq[i];
7544 raw_spin_lock(&rt_rq->rt_runtime_lock);
7545 rt_rq->rt_runtime = rt_runtime;
7546 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7548 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7550 read_unlock(&tasklist_lock);
7551 mutex_unlock(&rt_constraints_mutex);
7556 static int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
7558 u64 rt_runtime, rt_period;
7560 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7561 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
7562 if (rt_runtime_us < 0)
7563 rt_runtime = RUNTIME_INF;
7565 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7568 static long sched_group_rt_runtime(struct task_group *tg)
7572 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
7575 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
7576 do_div(rt_runtime_us, NSEC_PER_USEC);
7577 return rt_runtime_us;
7580 static int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
7582 u64 rt_runtime, rt_period;
7584 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
7585 rt_runtime = tg->rt_bandwidth.rt_runtime;
7590 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7593 static long sched_group_rt_period(struct task_group *tg)
7597 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
7598 do_div(rt_period_us, NSEC_PER_USEC);
7599 return rt_period_us;
7601 #endif /* CONFIG_RT_GROUP_SCHED */
7603 #ifdef CONFIG_RT_GROUP_SCHED
7604 static int sched_rt_global_constraints(void)
7608 mutex_lock(&rt_constraints_mutex);
7609 read_lock(&tasklist_lock);
7610 ret = __rt_schedulable(NULL, 0, 0);
7611 read_unlock(&tasklist_lock);
7612 mutex_unlock(&rt_constraints_mutex);
7617 static int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
7619 /* Don't accept realtime tasks when there is no way for them to run */
7620 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
7626 #else /* !CONFIG_RT_GROUP_SCHED */
7627 static int sched_rt_global_constraints(void)
7629 unsigned long flags;
7632 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
7633 for_each_possible_cpu(i) {
7634 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
7636 raw_spin_lock(&rt_rq->rt_runtime_lock);
7637 rt_rq->rt_runtime = global_rt_runtime();
7638 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7640 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
7644 #endif /* CONFIG_RT_GROUP_SCHED */
7646 static int sched_dl_global_constraints(void)
7648 u64 runtime = global_rt_runtime();
7649 u64 period = global_rt_period();
7650 u64 new_bw = to_ratio(period, runtime);
7652 unsigned long flags;
7655 * Here we want to check the bandwidth not being set to some
7656 * value smaller than the currently allocated bandwidth in
7657 * any of the root_domains.
7659 * FIXME: Cycling on all the CPUs is overdoing, but simpler than
7660 * cycling on root_domains... Discussion on different/better
7661 * solutions is welcome!
7663 for_each_possible_cpu(cpu) {
7664 struct dl_bw *dl_b = dl_bw_of(cpu);
7666 raw_spin_lock_irqsave(&dl_b->lock, flags);
7667 if (new_bw < dl_b->total_bw)
7669 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
7678 static void sched_dl_do_global(void)
7682 unsigned long flags;
7684 def_dl_bandwidth.dl_period = global_rt_period();
7685 def_dl_bandwidth.dl_runtime = global_rt_runtime();
7687 if (global_rt_runtime() != RUNTIME_INF)
7688 new_bw = to_ratio(global_rt_period(), global_rt_runtime());
7691 * FIXME: As above...
7693 for_each_possible_cpu(cpu) {
7694 struct dl_bw *dl_b = dl_bw_of(cpu);
7696 raw_spin_lock_irqsave(&dl_b->lock, flags);
7698 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
7702 static int sched_rt_global_validate(void)
7704 if (sysctl_sched_rt_period <= 0)
7707 if ((sysctl_sched_rt_runtime != RUNTIME_INF) &&
7708 (sysctl_sched_rt_runtime > sysctl_sched_rt_period))
7714 static void sched_rt_do_global(void)
7716 def_rt_bandwidth.rt_runtime = global_rt_runtime();
7717 def_rt_bandwidth.rt_period = ns_to_ktime(global_rt_period());
7720 int sched_rt_handler(struct ctl_table *table, int write,
7721 void __user *buffer, size_t *lenp,
7724 int old_period, old_runtime;
7725 static DEFINE_MUTEX(mutex);
7729 old_period = sysctl_sched_rt_period;
7730 old_runtime = sysctl_sched_rt_runtime;
7732 ret = proc_dointvec(table, write, buffer, lenp, ppos);
7734 if (!ret && write) {
7735 ret = sched_rt_global_validate();
7739 ret = sched_rt_global_constraints();
7743 ret = sched_dl_global_constraints();
7747 sched_rt_do_global();
7748 sched_dl_do_global();
7752 sysctl_sched_rt_period = old_period;
7753 sysctl_sched_rt_runtime = old_runtime;
7755 mutex_unlock(&mutex);
7760 int sched_rr_handler(struct ctl_table *table, int write,
7761 void __user *buffer, size_t *lenp,
7765 static DEFINE_MUTEX(mutex);
7768 ret = proc_dointvec(table, write, buffer, lenp, ppos);
7769 /* make sure that internally we keep jiffies */
7770 /* also, writing zero resets timeslice to default */
7771 if (!ret && write) {
7772 sched_rr_timeslice = sched_rr_timeslice <= 0 ?
7773 RR_TIMESLICE : msecs_to_jiffies(sched_rr_timeslice);
7775 mutex_unlock(&mutex);
7779 #ifdef CONFIG_CGROUP_SCHED
7781 static inline struct task_group *css_tg(struct cgroup_subsys_state *css)
7783 return css ? container_of(css, struct task_group, css) : NULL;
7786 static struct cgroup_subsys_state *
7787 cpu_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
7789 struct task_group *parent = css_tg(parent_css);
7790 struct task_group *tg;
7793 /* This is early initialization for the top cgroup */
7794 return &root_task_group.css;
7797 tg = sched_create_group(parent);
7799 return ERR_PTR(-ENOMEM);
7804 static int cpu_cgroup_css_online(struct cgroup_subsys_state *css)
7806 struct task_group *tg = css_tg(css);
7807 struct task_group *parent = css_tg(css->parent);
7810 sched_online_group(tg, parent);
7814 static void cpu_cgroup_css_free(struct cgroup_subsys_state *css)
7816 struct task_group *tg = css_tg(css);
7818 sched_destroy_group(tg);
7821 static void cpu_cgroup_css_offline(struct cgroup_subsys_state *css)
7823 struct task_group *tg = css_tg(css);
7825 sched_offline_group(tg);
7828 static int cpu_cgroup_can_attach(struct cgroup_subsys_state *css,
7829 struct cgroup_taskset *tset)
7831 struct task_struct *task;
7833 cgroup_taskset_for_each(task, tset) {
7834 #ifdef CONFIG_RT_GROUP_SCHED
7835 if (!sched_rt_can_attach(css_tg(css), task))
7838 /* We don't support RT-tasks being in separate groups */
7839 if (task->sched_class != &fair_sched_class)
7846 static void cpu_cgroup_attach(struct cgroup_subsys_state *css,
7847 struct cgroup_taskset *tset)
7849 struct task_struct *task;
7851 cgroup_taskset_for_each(task, tset)
7852 sched_move_task(task);
7855 static void cpu_cgroup_exit(struct cgroup_subsys_state *css,
7856 struct cgroup_subsys_state *old_css,
7857 struct task_struct *task)
7860 * cgroup_exit() is called in the copy_process() failure path.
7861 * Ignore this case since the task hasn't ran yet, this avoids
7862 * trying to poke a half freed task state from generic code.
7864 if (!(task->flags & PF_EXITING))
7867 sched_move_task(task);
7870 #ifdef CONFIG_FAIR_GROUP_SCHED
7871 static int cpu_shares_write_u64(struct cgroup_subsys_state *css,
7872 struct cftype *cftype, u64 shareval)
7874 return sched_group_set_shares(css_tg(css), scale_load(shareval));
7877 static u64 cpu_shares_read_u64(struct cgroup_subsys_state *css,
7880 struct task_group *tg = css_tg(css);
7882 return (u64) scale_load_down(tg->shares);
7885 #ifdef CONFIG_CFS_BANDWIDTH
7886 static DEFINE_MUTEX(cfs_constraints_mutex);
7888 const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */
7889 const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */
7891 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime);
7893 static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota)
7895 int i, ret = 0, runtime_enabled, runtime_was_enabled;
7896 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7898 if (tg == &root_task_group)
7902 * Ensure we have at some amount of bandwidth every period. This is
7903 * to prevent reaching a state of large arrears when throttled via
7904 * entity_tick() resulting in prolonged exit starvation.
7906 if (quota < min_cfs_quota_period || period < min_cfs_quota_period)
7910 * Likewise, bound things on the otherside by preventing insane quota
7911 * periods. This also allows us to normalize in computing quota
7914 if (period > max_cfs_quota_period)
7918 * Prevent race between setting of cfs_rq->runtime_enabled and
7919 * unthrottle_offline_cfs_rqs().
7922 mutex_lock(&cfs_constraints_mutex);
7923 ret = __cfs_schedulable(tg, period, quota);
7927 runtime_enabled = quota != RUNTIME_INF;
7928 runtime_was_enabled = cfs_b->quota != RUNTIME_INF;
7930 * If we need to toggle cfs_bandwidth_used, off->on must occur
7931 * before making related changes, and on->off must occur afterwards
7933 if (runtime_enabled && !runtime_was_enabled)
7934 cfs_bandwidth_usage_inc();
7935 raw_spin_lock_irq(&cfs_b->lock);
7936 cfs_b->period = ns_to_ktime(period);
7937 cfs_b->quota = quota;
7939 __refill_cfs_bandwidth_runtime(cfs_b);
7940 /* restart the period timer (if active) to handle new period expiry */
7941 if (runtime_enabled && cfs_b->timer_active) {
7942 /* force a reprogram */
7943 __start_cfs_bandwidth(cfs_b, true);
7945 raw_spin_unlock_irq(&cfs_b->lock);
7947 for_each_online_cpu(i) {
7948 struct cfs_rq *cfs_rq = tg->cfs_rq[i];
7949 struct rq *rq = cfs_rq->rq;
7951 raw_spin_lock_irq(&rq->lock);
7952 cfs_rq->runtime_enabled = runtime_enabled;
7953 cfs_rq->runtime_remaining = 0;
7955 if (cfs_rq->throttled)
7956 unthrottle_cfs_rq(cfs_rq);
7957 raw_spin_unlock_irq(&rq->lock);
7959 if (runtime_was_enabled && !runtime_enabled)
7960 cfs_bandwidth_usage_dec();
7962 mutex_unlock(&cfs_constraints_mutex);
7968 int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us)
7972 period = ktime_to_ns(tg->cfs_bandwidth.period);
7973 if (cfs_quota_us < 0)
7974 quota = RUNTIME_INF;
7976 quota = (u64)cfs_quota_us * NSEC_PER_USEC;
7978 return tg_set_cfs_bandwidth(tg, period, quota);
7981 long tg_get_cfs_quota(struct task_group *tg)
7985 if (tg->cfs_bandwidth.quota == RUNTIME_INF)
7988 quota_us = tg->cfs_bandwidth.quota;
7989 do_div(quota_us, NSEC_PER_USEC);
7994 int tg_set_cfs_period(struct task_group *tg, long cfs_period_us)
7998 period = (u64)cfs_period_us * NSEC_PER_USEC;
7999 quota = tg->cfs_bandwidth.quota;
8001 return tg_set_cfs_bandwidth(tg, period, quota);
8004 long tg_get_cfs_period(struct task_group *tg)
8008 cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period);
8009 do_div(cfs_period_us, NSEC_PER_USEC);
8011 return cfs_period_us;
8014 static s64 cpu_cfs_quota_read_s64(struct cgroup_subsys_state *css,
8017 return tg_get_cfs_quota(css_tg(css));
8020 static int cpu_cfs_quota_write_s64(struct cgroup_subsys_state *css,
8021 struct cftype *cftype, s64 cfs_quota_us)
8023 return tg_set_cfs_quota(css_tg(css), cfs_quota_us);
8026 static u64 cpu_cfs_period_read_u64(struct cgroup_subsys_state *css,
8029 return tg_get_cfs_period(css_tg(css));
8032 static int cpu_cfs_period_write_u64(struct cgroup_subsys_state *css,
8033 struct cftype *cftype, u64 cfs_period_us)
8035 return tg_set_cfs_period(css_tg(css), cfs_period_us);
8038 struct cfs_schedulable_data {
8039 struct task_group *tg;
8044 * normalize group quota/period to be quota/max_period
8045 * note: units are usecs
8047 static u64 normalize_cfs_quota(struct task_group *tg,
8048 struct cfs_schedulable_data *d)
8056 period = tg_get_cfs_period(tg);
8057 quota = tg_get_cfs_quota(tg);
8060 /* note: these should typically be equivalent */
8061 if (quota == RUNTIME_INF || quota == -1)
8064 return to_ratio(period, quota);
8067 static int tg_cfs_schedulable_down(struct task_group *tg, void *data)
8069 struct cfs_schedulable_data *d = data;
8070 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
8071 s64 quota = 0, parent_quota = -1;
8074 quota = RUNTIME_INF;
8076 struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth;
8078 quota = normalize_cfs_quota(tg, d);
8079 parent_quota = parent_b->hierarchical_quota;
8082 * ensure max(child_quota) <= parent_quota, inherit when no
8085 if (quota == RUNTIME_INF)
8086 quota = parent_quota;
8087 else if (parent_quota != RUNTIME_INF && quota > parent_quota)
8090 cfs_b->hierarchical_quota = quota;
8095 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota)
8098 struct cfs_schedulable_data data = {
8104 if (quota != RUNTIME_INF) {
8105 do_div(data.period, NSEC_PER_USEC);
8106 do_div(data.quota, NSEC_PER_USEC);
8110 ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data);
8116 static int cpu_stats_show(struct seq_file *sf, void *v)
8118 struct task_group *tg = css_tg(seq_css(sf));
8119 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
8121 seq_printf(sf, "nr_periods %d\n", cfs_b->nr_periods);
8122 seq_printf(sf, "nr_throttled %d\n", cfs_b->nr_throttled);
8123 seq_printf(sf, "throttled_time %llu\n", cfs_b->throttled_time);
8127 #endif /* CONFIG_CFS_BANDWIDTH */
8128 #endif /* CONFIG_FAIR_GROUP_SCHED */
8130 #ifdef CONFIG_RT_GROUP_SCHED
8131 static int cpu_rt_runtime_write(struct cgroup_subsys_state *css,
8132 struct cftype *cft, s64 val)
8134 return sched_group_set_rt_runtime(css_tg(css), val);
8137 static s64 cpu_rt_runtime_read(struct cgroup_subsys_state *css,
8140 return sched_group_rt_runtime(css_tg(css));
8143 static int cpu_rt_period_write_uint(struct cgroup_subsys_state *css,
8144 struct cftype *cftype, u64 rt_period_us)
8146 return sched_group_set_rt_period(css_tg(css), rt_period_us);
8149 static u64 cpu_rt_period_read_uint(struct cgroup_subsys_state *css,
8152 return sched_group_rt_period(css_tg(css));
8154 #endif /* CONFIG_RT_GROUP_SCHED */
8156 static struct cftype cpu_files[] = {
8157 #ifdef CONFIG_FAIR_GROUP_SCHED
8160 .read_u64 = cpu_shares_read_u64,
8161 .write_u64 = cpu_shares_write_u64,
8164 #ifdef CONFIG_CFS_BANDWIDTH
8166 .name = "cfs_quota_us",
8167 .read_s64 = cpu_cfs_quota_read_s64,
8168 .write_s64 = cpu_cfs_quota_write_s64,
8171 .name = "cfs_period_us",
8172 .read_u64 = cpu_cfs_period_read_u64,
8173 .write_u64 = cpu_cfs_period_write_u64,
8177 .seq_show = cpu_stats_show,
8180 #ifdef CONFIG_RT_GROUP_SCHED
8182 .name = "rt_runtime_us",
8183 .read_s64 = cpu_rt_runtime_read,
8184 .write_s64 = cpu_rt_runtime_write,
8187 .name = "rt_period_us",
8188 .read_u64 = cpu_rt_period_read_uint,
8189 .write_u64 = cpu_rt_period_write_uint,
8195 struct cgroup_subsys cpu_cgrp_subsys = {
8196 .css_alloc = cpu_cgroup_css_alloc,
8197 .css_free = cpu_cgroup_css_free,
8198 .css_online = cpu_cgroup_css_online,
8199 .css_offline = cpu_cgroup_css_offline,
8200 .can_attach = cpu_cgroup_can_attach,
8201 .attach = cpu_cgroup_attach,
8202 .exit = cpu_cgroup_exit,
8203 .legacy_cftypes = cpu_files,
8207 #endif /* CONFIG_CGROUP_SCHED */
8209 void dump_cpu_task(int cpu)
8211 pr_info("Task dump for CPU %d:\n", cpu);
8212 sched_show_task(cpu_curr(cpu));