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 void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period)
96 ktime_t soft, hard, now;
99 if (hrtimer_active(period_timer))
102 now = hrtimer_cb_get_time(period_timer);
103 hrtimer_forward(period_timer, now, period);
105 soft = hrtimer_get_softexpires(period_timer);
106 hard = hrtimer_get_expires(period_timer);
107 delta = ktime_to_ns(ktime_sub(hard, soft));
108 __hrtimer_start_range_ns(period_timer, soft, delta,
109 HRTIMER_MODE_ABS_PINNED, 0);
113 DEFINE_MUTEX(sched_domains_mutex);
114 DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
116 static void update_rq_clock_task(struct rq *rq, s64 delta);
118 void update_rq_clock(struct rq *rq)
122 if (rq->skip_clock_update > 0)
125 delta = sched_clock_cpu(cpu_of(rq)) - rq->clock;
129 update_rq_clock_task(rq, delta);
133 * Debugging: various feature bits
136 #define SCHED_FEAT(name, enabled) \
137 (1UL << __SCHED_FEAT_##name) * enabled |
139 const_debug unsigned int sysctl_sched_features =
140 #include "features.h"
145 #ifdef CONFIG_SCHED_DEBUG
146 #define SCHED_FEAT(name, enabled) \
149 static const char * const sched_feat_names[] = {
150 #include "features.h"
155 static int sched_feat_show(struct seq_file *m, void *v)
159 for (i = 0; i < __SCHED_FEAT_NR; i++) {
160 if (!(sysctl_sched_features & (1UL << i)))
162 seq_printf(m, "%s ", sched_feat_names[i]);
169 #ifdef HAVE_JUMP_LABEL
171 #define jump_label_key__true STATIC_KEY_INIT_TRUE
172 #define jump_label_key__false STATIC_KEY_INIT_FALSE
174 #define SCHED_FEAT(name, enabled) \
175 jump_label_key__##enabled ,
177 struct static_key sched_feat_keys[__SCHED_FEAT_NR] = {
178 #include "features.h"
183 static void sched_feat_disable(int i)
185 if (static_key_enabled(&sched_feat_keys[i]))
186 static_key_slow_dec(&sched_feat_keys[i]);
189 static void sched_feat_enable(int i)
191 if (!static_key_enabled(&sched_feat_keys[i]))
192 static_key_slow_inc(&sched_feat_keys[i]);
195 static void sched_feat_disable(int i) { };
196 static void sched_feat_enable(int i) { };
197 #endif /* HAVE_JUMP_LABEL */
199 static int sched_feat_set(char *cmp)
204 if (strncmp(cmp, "NO_", 3) == 0) {
209 for (i = 0; i < __SCHED_FEAT_NR; i++) {
210 if (strcmp(cmp, sched_feat_names[i]) == 0) {
212 sysctl_sched_features &= ~(1UL << i);
213 sched_feat_disable(i);
215 sysctl_sched_features |= (1UL << i);
216 sched_feat_enable(i);
226 sched_feat_write(struct file *filp, const char __user *ubuf,
227 size_t cnt, loff_t *ppos)
237 if (copy_from_user(&buf, ubuf, cnt))
243 /* Ensure the static_key remains in a consistent state */
244 inode = file_inode(filp);
245 mutex_lock(&inode->i_mutex);
246 i = sched_feat_set(cmp);
247 mutex_unlock(&inode->i_mutex);
248 if (i == __SCHED_FEAT_NR)
256 static int sched_feat_open(struct inode *inode, struct file *filp)
258 return single_open(filp, sched_feat_show, NULL);
261 static const struct file_operations sched_feat_fops = {
262 .open = sched_feat_open,
263 .write = sched_feat_write,
266 .release = single_release,
269 static __init int sched_init_debug(void)
271 debugfs_create_file("sched_features", 0644, NULL, NULL,
276 late_initcall(sched_init_debug);
277 #endif /* CONFIG_SCHED_DEBUG */
280 * Number of tasks to iterate in a single balance run.
281 * Limited because this is done with IRQs disabled.
283 const_debug unsigned int sysctl_sched_nr_migrate = 32;
286 * period over which we average the RT time consumption, measured
291 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
294 * period over which we measure -rt task cpu usage in us.
297 unsigned int sysctl_sched_rt_period = 1000000;
299 __read_mostly int scheduler_running;
302 * part of the period that we allow rt tasks to run in us.
305 int sysctl_sched_rt_runtime = 950000;
308 * __task_rq_lock - lock the rq @p resides on.
310 static inline struct rq *__task_rq_lock(struct task_struct *p)
315 lockdep_assert_held(&p->pi_lock);
319 raw_spin_lock(&rq->lock);
320 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p)))
322 raw_spin_unlock(&rq->lock);
324 while (unlikely(task_on_rq_migrating(p)))
330 * task_rq_lock - lock p->pi_lock and lock the rq @p resides on.
332 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
333 __acquires(p->pi_lock)
339 raw_spin_lock_irqsave(&p->pi_lock, *flags);
341 raw_spin_lock(&rq->lock);
342 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p)))
344 raw_spin_unlock(&rq->lock);
345 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
347 while (unlikely(task_on_rq_migrating(p)))
352 static void __task_rq_unlock(struct rq *rq)
355 raw_spin_unlock(&rq->lock);
359 task_rq_unlock(struct rq *rq, struct task_struct *p, unsigned long *flags)
361 __releases(p->pi_lock)
363 raw_spin_unlock(&rq->lock);
364 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
368 * this_rq_lock - lock this runqueue and disable interrupts.
370 static struct rq *this_rq_lock(void)
377 raw_spin_lock(&rq->lock);
382 #ifdef CONFIG_SCHED_HRTICK
384 * Use HR-timers to deliver accurate preemption points.
387 static void hrtick_clear(struct rq *rq)
389 if (hrtimer_active(&rq->hrtick_timer))
390 hrtimer_cancel(&rq->hrtick_timer);
394 * High-resolution timer tick.
395 * Runs from hardirq context with interrupts disabled.
397 static enum hrtimer_restart hrtick(struct hrtimer *timer)
399 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
401 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
403 raw_spin_lock(&rq->lock);
405 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
406 raw_spin_unlock(&rq->lock);
408 return HRTIMER_NORESTART;
413 static int __hrtick_restart(struct rq *rq)
415 struct hrtimer *timer = &rq->hrtick_timer;
416 ktime_t time = hrtimer_get_softexpires(timer);
418 return __hrtimer_start_range_ns(timer, time, 0, HRTIMER_MODE_ABS_PINNED, 0);
422 * called from hardirq (IPI) context
424 static void __hrtick_start(void *arg)
428 raw_spin_lock(&rq->lock);
429 __hrtick_restart(rq);
430 rq->hrtick_csd_pending = 0;
431 raw_spin_unlock(&rq->lock);
435 * Called to set the hrtick timer state.
437 * called with rq->lock held and irqs disabled
439 void hrtick_start(struct rq *rq, u64 delay)
441 struct hrtimer *timer = &rq->hrtick_timer;
446 * Don't schedule slices shorter than 10000ns, that just
447 * doesn't make sense and can cause timer DoS.
449 delta = max_t(s64, delay, 10000LL);
450 time = ktime_add_ns(timer->base->get_time(), delta);
452 hrtimer_set_expires(timer, time);
454 if (rq == this_rq()) {
455 __hrtick_restart(rq);
456 } else if (!rq->hrtick_csd_pending) {
457 smp_call_function_single_async(cpu_of(rq), &rq->hrtick_csd);
458 rq->hrtick_csd_pending = 1;
463 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
465 int cpu = (int)(long)hcpu;
468 case CPU_UP_CANCELED:
469 case CPU_UP_CANCELED_FROZEN:
470 case CPU_DOWN_PREPARE:
471 case CPU_DOWN_PREPARE_FROZEN:
473 case CPU_DEAD_FROZEN:
474 hrtick_clear(cpu_rq(cpu));
481 static __init void init_hrtick(void)
483 hotcpu_notifier(hotplug_hrtick, 0);
487 * Called to set the hrtick timer state.
489 * called with rq->lock held and irqs disabled
491 void hrtick_start(struct rq *rq, u64 delay)
493 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
494 HRTIMER_MODE_REL_PINNED, 0);
497 static inline void init_hrtick(void)
500 #endif /* CONFIG_SMP */
502 static void init_rq_hrtick(struct rq *rq)
505 rq->hrtick_csd_pending = 0;
507 rq->hrtick_csd.flags = 0;
508 rq->hrtick_csd.func = __hrtick_start;
509 rq->hrtick_csd.info = rq;
512 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
513 rq->hrtick_timer.function = hrtick;
515 #else /* CONFIG_SCHED_HRTICK */
516 static inline void hrtick_clear(struct rq *rq)
520 static inline void init_rq_hrtick(struct rq *rq)
524 static inline void init_hrtick(void)
527 #endif /* CONFIG_SCHED_HRTICK */
530 * cmpxchg based fetch_or, macro so it works for different integer types
532 #define fetch_or(ptr, val) \
533 ({ typeof(*(ptr)) __old, __val = *(ptr); \
535 __old = cmpxchg((ptr), __val, __val | (val)); \
536 if (__old == __val) \
543 #if defined(CONFIG_SMP) && defined(TIF_POLLING_NRFLAG)
545 * Atomically set TIF_NEED_RESCHED and test for TIF_POLLING_NRFLAG,
546 * this avoids any races wrt polling state changes and thereby avoids
549 static bool set_nr_and_not_polling(struct task_struct *p)
551 struct thread_info *ti = task_thread_info(p);
552 return !(fetch_or(&ti->flags, _TIF_NEED_RESCHED) & _TIF_POLLING_NRFLAG);
556 * Atomically set TIF_NEED_RESCHED if TIF_POLLING_NRFLAG is set.
558 * If this returns true, then the idle task promises to call
559 * sched_ttwu_pending() and reschedule soon.
561 static bool set_nr_if_polling(struct task_struct *p)
563 struct thread_info *ti = task_thread_info(p);
564 typeof(ti->flags) old, val = ACCESS_ONCE(ti->flags);
567 if (!(val & _TIF_POLLING_NRFLAG))
569 if (val & _TIF_NEED_RESCHED)
571 old = cmpxchg(&ti->flags, val, val | _TIF_NEED_RESCHED);
580 static bool set_nr_and_not_polling(struct task_struct *p)
582 set_tsk_need_resched(p);
587 static bool set_nr_if_polling(struct task_struct *p)
595 * resched_curr - mark rq's current task 'to be rescheduled now'.
597 * On UP this means the setting of the need_resched flag, on SMP it
598 * might also involve a cross-CPU call to trigger the scheduler on
601 void resched_curr(struct rq *rq)
603 struct task_struct *curr = rq->curr;
606 lockdep_assert_held(&rq->lock);
608 if (test_tsk_need_resched(curr))
613 if (cpu == smp_processor_id()) {
614 set_tsk_need_resched(curr);
615 set_preempt_need_resched();
619 if (set_nr_and_not_polling(curr))
620 smp_send_reschedule(cpu);
622 trace_sched_wake_idle_without_ipi(cpu);
625 void resched_cpu(int cpu)
627 struct rq *rq = cpu_rq(cpu);
630 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
633 raw_spin_unlock_irqrestore(&rq->lock, flags);
637 #ifdef CONFIG_NO_HZ_COMMON
639 * In the semi idle case, use the nearest busy cpu for migrating timers
640 * from an idle cpu. This is good for power-savings.
642 * We don't do similar optimization for completely idle system, as
643 * selecting an idle cpu will add more delays to the timers than intended
644 * (as that cpu's timer base may not be uptodate wrt jiffies etc).
646 int get_nohz_timer_target(int pinned)
648 int cpu = smp_processor_id();
650 struct sched_domain *sd;
652 if (pinned || !get_sysctl_timer_migration() || !idle_cpu(cpu))
656 for_each_domain(cpu, sd) {
657 for_each_cpu(i, sched_domain_span(sd)) {
669 * When add_timer_on() enqueues a timer into the timer wheel of an
670 * idle CPU then this timer might expire before the next timer event
671 * which is scheduled to wake up that CPU. In case of a completely
672 * idle system the next event might even be infinite time into the
673 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
674 * leaves the inner idle loop so the newly added timer is taken into
675 * account when the CPU goes back to idle and evaluates the timer
676 * wheel for the next timer event.
678 static void wake_up_idle_cpu(int cpu)
680 struct rq *rq = cpu_rq(cpu);
682 if (cpu == smp_processor_id())
685 if (set_nr_and_not_polling(rq->idle))
686 smp_send_reschedule(cpu);
688 trace_sched_wake_idle_without_ipi(cpu);
691 static bool wake_up_full_nohz_cpu(int cpu)
694 * We just need the target to call irq_exit() and re-evaluate
695 * the next tick. The nohz full kick at least implies that.
696 * If needed we can still optimize that later with an
699 if (tick_nohz_full_cpu(cpu)) {
700 if (cpu != smp_processor_id() ||
701 tick_nohz_tick_stopped())
702 tick_nohz_full_kick_cpu(cpu);
709 void wake_up_nohz_cpu(int cpu)
711 if (!wake_up_full_nohz_cpu(cpu))
712 wake_up_idle_cpu(cpu);
715 static inline bool got_nohz_idle_kick(void)
717 int cpu = smp_processor_id();
719 if (!test_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu)))
722 if (idle_cpu(cpu) && !need_resched())
726 * We can't run Idle Load Balance on this CPU for this time so we
727 * cancel it and clear NOHZ_BALANCE_KICK
729 clear_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu));
733 #else /* CONFIG_NO_HZ_COMMON */
735 static inline bool got_nohz_idle_kick(void)
740 #endif /* CONFIG_NO_HZ_COMMON */
742 #ifdef CONFIG_NO_HZ_FULL
743 bool sched_can_stop_tick(void)
746 * More than one running task need preemption.
747 * nr_running update is assumed to be visible
748 * after IPI is sent from wakers.
750 if (this_rq()->nr_running > 1)
755 #endif /* CONFIG_NO_HZ_FULL */
757 void sched_avg_update(struct rq *rq)
759 s64 period = sched_avg_period();
761 while ((s64)(rq_clock(rq) - rq->age_stamp) > period) {
763 * Inline assembly required to prevent the compiler
764 * optimising this loop into a divmod call.
765 * See __iter_div_u64_rem() for another example of this.
767 asm("" : "+rm" (rq->age_stamp));
768 rq->age_stamp += period;
773 #endif /* CONFIG_SMP */
775 #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \
776 (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH)))
778 * Iterate task_group tree rooted at *from, calling @down when first entering a
779 * node and @up when leaving it for the final time.
781 * Caller must hold rcu_lock or sufficient equivalent.
783 int walk_tg_tree_from(struct task_group *from,
784 tg_visitor down, tg_visitor up, void *data)
786 struct task_group *parent, *child;
792 ret = (*down)(parent, data);
795 list_for_each_entry_rcu(child, &parent->children, siblings) {
802 ret = (*up)(parent, data);
803 if (ret || parent == from)
807 parent = parent->parent;
814 int tg_nop(struct task_group *tg, void *data)
820 static void set_load_weight(struct task_struct *p)
822 int prio = p->static_prio - MAX_RT_PRIO;
823 struct load_weight *load = &p->se.load;
826 * SCHED_IDLE tasks get minimal weight:
828 if (p->policy == SCHED_IDLE) {
829 load->weight = scale_load(WEIGHT_IDLEPRIO);
830 load->inv_weight = WMULT_IDLEPRIO;
834 load->weight = scale_load(prio_to_weight[prio]);
835 load->inv_weight = prio_to_wmult[prio];
838 static void enqueue_task(struct rq *rq, struct task_struct *p, int flags)
841 sched_info_queued(rq, p);
842 p->sched_class->enqueue_task(rq, p, flags);
845 static void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
848 sched_info_dequeued(rq, p);
849 p->sched_class->dequeue_task(rq, p, flags);
852 void activate_task(struct rq *rq, struct task_struct *p, int flags)
854 if (task_contributes_to_load(p))
855 rq->nr_uninterruptible--;
857 enqueue_task(rq, p, flags);
860 void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
862 if (task_contributes_to_load(p))
863 rq->nr_uninterruptible++;
865 dequeue_task(rq, p, flags);
868 static void update_rq_clock_task(struct rq *rq, s64 delta)
871 * In theory, the compile should just see 0 here, and optimize out the call
872 * to sched_rt_avg_update. But I don't trust it...
874 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
875 s64 steal = 0, irq_delta = 0;
877 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
878 irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time;
881 * Since irq_time is only updated on {soft,}irq_exit, we might run into
882 * this case when a previous update_rq_clock() happened inside a
885 * When this happens, we stop ->clock_task and only update the
886 * prev_irq_time stamp to account for the part that fit, so that a next
887 * update will consume the rest. This ensures ->clock_task is
890 * It does however cause some slight miss-attribution of {soft,}irq
891 * time, a more accurate solution would be to update the irq_time using
892 * the current rq->clock timestamp, except that would require using
895 if (irq_delta > delta)
898 rq->prev_irq_time += irq_delta;
901 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
902 if (static_key_false((¶virt_steal_rq_enabled))) {
903 steal = paravirt_steal_clock(cpu_of(rq));
904 steal -= rq->prev_steal_time_rq;
906 if (unlikely(steal > delta))
909 rq->prev_steal_time_rq += steal;
914 rq->clock_task += delta;
916 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
917 if ((irq_delta + steal) && sched_feat(NONTASK_CAPACITY))
918 sched_rt_avg_update(rq, irq_delta + steal);
922 void sched_set_stop_task(int cpu, struct task_struct *stop)
924 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
925 struct task_struct *old_stop = cpu_rq(cpu)->stop;
929 * Make it appear like a SCHED_FIFO task, its something
930 * userspace knows about and won't get confused about.
932 * Also, it will make PI more or less work without too
933 * much confusion -- but then, stop work should not
934 * rely on PI working anyway.
936 sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m);
938 stop->sched_class = &stop_sched_class;
941 cpu_rq(cpu)->stop = stop;
945 * Reset it back to a normal scheduling class so that
946 * it can die in pieces.
948 old_stop->sched_class = &rt_sched_class;
953 * __normal_prio - return the priority that is based on the static prio
955 static inline int __normal_prio(struct task_struct *p)
957 return p->static_prio;
961 * Calculate the expected normal priority: i.e. priority
962 * without taking RT-inheritance into account. Might be
963 * boosted by interactivity modifiers. Changes upon fork,
964 * setprio syscalls, and whenever the interactivity
965 * estimator recalculates.
967 static inline int normal_prio(struct task_struct *p)
971 if (task_has_dl_policy(p))
972 prio = MAX_DL_PRIO-1;
973 else if (task_has_rt_policy(p))
974 prio = MAX_RT_PRIO-1 - p->rt_priority;
976 prio = __normal_prio(p);
981 * Calculate the current priority, i.e. the priority
982 * taken into account by the scheduler. This value might
983 * be boosted by RT tasks, or might be boosted by
984 * interactivity modifiers. Will be RT if the task got
985 * RT-boosted. If not then it returns p->normal_prio.
987 static int effective_prio(struct task_struct *p)
989 p->normal_prio = normal_prio(p);
991 * If we are RT tasks or we were boosted to RT priority,
992 * keep the priority unchanged. Otherwise, update priority
993 * to the normal priority:
995 if (!rt_prio(p->prio))
996 return p->normal_prio;
1001 * task_curr - is this task currently executing on a CPU?
1002 * @p: the task in question.
1004 * Return: 1 if the task is currently executing. 0 otherwise.
1006 inline int task_curr(const struct task_struct *p)
1008 return cpu_curr(task_cpu(p)) == p;
1011 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1012 const struct sched_class *prev_class,
1015 if (prev_class != p->sched_class) {
1016 if (prev_class->switched_from)
1017 prev_class->switched_from(rq, p);
1018 p->sched_class->switched_to(rq, p);
1019 } else if (oldprio != p->prio || dl_task(p))
1020 p->sched_class->prio_changed(rq, p, oldprio);
1023 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
1025 const struct sched_class *class;
1027 if (p->sched_class == rq->curr->sched_class) {
1028 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
1030 for_each_class(class) {
1031 if (class == rq->curr->sched_class)
1033 if (class == p->sched_class) {
1041 * A queue event has occurred, and we're going to schedule. In
1042 * this case, we can save a useless back to back clock update.
1044 if (task_on_rq_queued(rq->curr) && test_tsk_need_resched(rq->curr))
1045 rq->skip_clock_update = 1;
1049 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1051 #ifdef CONFIG_SCHED_DEBUG
1053 * We should never call set_task_cpu() on a blocked task,
1054 * ttwu() will sort out the placement.
1056 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
1057 !(task_preempt_count(p) & PREEMPT_ACTIVE));
1059 #ifdef CONFIG_LOCKDEP
1061 * The caller should hold either p->pi_lock or rq->lock, when changing
1062 * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks.
1064 * sched_move_task() holds both and thus holding either pins the cgroup,
1067 * Furthermore, all task_rq users should acquire both locks, see
1070 WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) ||
1071 lockdep_is_held(&task_rq(p)->lock)));
1075 trace_sched_migrate_task(p, new_cpu);
1077 if (task_cpu(p) != new_cpu) {
1078 if (p->sched_class->migrate_task_rq)
1079 p->sched_class->migrate_task_rq(p, new_cpu);
1080 p->se.nr_migrations++;
1081 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, NULL, 0);
1084 __set_task_cpu(p, new_cpu);
1087 static void __migrate_swap_task(struct task_struct *p, int cpu)
1089 if (task_on_rq_queued(p)) {
1090 struct rq *src_rq, *dst_rq;
1092 src_rq = task_rq(p);
1093 dst_rq = cpu_rq(cpu);
1095 deactivate_task(src_rq, p, 0);
1096 set_task_cpu(p, cpu);
1097 activate_task(dst_rq, p, 0);
1098 check_preempt_curr(dst_rq, p, 0);
1101 * Task isn't running anymore; make it appear like we migrated
1102 * it before it went to sleep. This means on wakeup we make the
1103 * previous cpu our targer instead of where it really is.
1109 struct migration_swap_arg {
1110 struct task_struct *src_task, *dst_task;
1111 int src_cpu, dst_cpu;
1114 static int migrate_swap_stop(void *data)
1116 struct migration_swap_arg *arg = data;
1117 struct rq *src_rq, *dst_rq;
1120 src_rq = cpu_rq(arg->src_cpu);
1121 dst_rq = cpu_rq(arg->dst_cpu);
1123 double_raw_lock(&arg->src_task->pi_lock,
1124 &arg->dst_task->pi_lock);
1125 double_rq_lock(src_rq, dst_rq);
1126 if (task_cpu(arg->dst_task) != arg->dst_cpu)
1129 if (task_cpu(arg->src_task) != arg->src_cpu)
1132 if (!cpumask_test_cpu(arg->dst_cpu, tsk_cpus_allowed(arg->src_task)))
1135 if (!cpumask_test_cpu(arg->src_cpu, tsk_cpus_allowed(arg->dst_task)))
1138 __migrate_swap_task(arg->src_task, arg->dst_cpu);
1139 __migrate_swap_task(arg->dst_task, arg->src_cpu);
1144 double_rq_unlock(src_rq, dst_rq);
1145 raw_spin_unlock(&arg->dst_task->pi_lock);
1146 raw_spin_unlock(&arg->src_task->pi_lock);
1152 * Cross migrate two tasks
1154 int migrate_swap(struct task_struct *cur, struct task_struct *p)
1156 struct migration_swap_arg arg;
1159 arg = (struct migration_swap_arg){
1161 .src_cpu = task_cpu(cur),
1163 .dst_cpu = task_cpu(p),
1166 if (arg.src_cpu == arg.dst_cpu)
1170 * These three tests are all lockless; this is OK since all of them
1171 * will be re-checked with proper locks held further down the line.
1173 if (!cpu_active(arg.src_cpu) || !cpu_active(arg.dst_cpu))
1176 if (!cpumask_test_cpu(arg.dst_cpu, tsk_cpus_allowed(arg.src_task)))
1179 if (!cpumask_test_cpu(arg.src_cpu, tsk_cpus_allowed(arg.dst_task)))
1182 trace_sched_swap_numa(cur, arg.src_cpu, p, arg.dst_cpu);
1183 ret = stop_two_cpus(arg.dst_cpu, arg.src_cpu, migrate_swap_stop, &arg);
1189 struct migration_arg {
1190 struct task_struct *task;
1194 static int migration_cpu_stop(void *data);
1197 * wait_task_inactive - wait for a thread to unschedule.
1199 * If @match_state is nonzero, it's the @p->state value just checked and
1200 * not expected to change. If it changes, i.e. @p might have woken up,
1201 * then return zero. When we succeed in waiting for @p to be off its CPU,
1202 * we return a positive number (its total switch count). If a second call
1203 * a short while later returns the same number, the caller can be sure that
1204 * @p has remained unscheduled the whole time.
1206 * The caller must ensure that the task *will* unschedule sometime soon,
1207 * else this function might spin for a *long* time. This function can't
1208 * be called with interrupts off, or it may introduce deadlock with
1209 * smp_call_function() if an IPI is sent by the same process we are
1210 * waiting to become inactive.
1212 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
1214 unsigned long flags;
1215 int running, queued;
1221 * We do the initial early heuristics without holding
1222 * any task-queue locks at all. We'll only try to get
1223 * the runqueue lock when things look like they will
1229 * If the task is actively running on another CPU
1230 * still, just relax and busy-wait without holding
1233 * NOTE! Since we don't hold any locks, it's not
1234 * even sure that "rq" stays as the right runqueue!
1235 * But we don't care, since "task_running()" will
1236 * return false if the runqueue has changed and p
1237 * is actually now running somewhere else!
1239 while (task_running(rq, p)) {
1240 if (match_state && unlikely(p->state != match_state))
1246 * Ok, time to look more closely! We need the rq
1247 * lock now, to be *sure*. If we're wrong, we'll
1248 * just go back and repeat.
1250 rq = task_rq_lock(p, &flags);
1251 trace_sched_wait_task(p);
1252 running = task_running(rq, p);
1253 queued = task_on_rq_queued(p);
1255 if (!match_state || p->state == match_state)
1256 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
1257 task_rq_unlock(rq, p, &flags);
1260 * If it changed from the expected state, bail out now.
1262 if (unlikely(!ncsw))
1266 * Was it really running after all now that we
1267 * checked with the proper locks actually held?
1269 * Oops. Go back and try again..
1271 if (unlikely(running)) {
1277 * It's not enough that it's not actively running,
1278 * it must be off the runqueue _entirely_, and not
1281 * So if it was still runnable (but just not actively
1282 * running right now), it's preempted, and we should
1283 * yield - it could be a while.
1285 if (unlikely(queued)) {
1286 ktime_t to = ktime_set(0, NSEC_PER_SEC/HZ);
1288 set_current_state(TASK_UNINTERRUPTIBLE);
1289 schedule_hrtimeout(&to, HRTIMER_MODE_REL);
1294 * Ahh, all good. It wasn't running, and it wasn't
1295 * runnable, which means that it will never become
1296 * running in the future either. We're all done!
1305 * kick_process - kick a running thread to enter/exit the kernel
1306 * @p: the to-be-kicked thread
1308 * Cause a process which is running on another CPU to enter
1309 * kernel-mode, without any delay. (to get signals handled.)
1311 * NOTE: this function doesn't have to take the runqueue lock,
1312 * because all it wants to ensure is that the remote task enters
1313 * the kernel. If the IPI races and the task has been migrated
1314 * to another CPU then no harm is done and the purpose has been
1317 void kick_process(struct task_struct *p)
1323 if ((cpu != smp_processor_id()) && task_curr(p))
1324 smp_send_reschedule(cpu);
1327 EXPORT_SYMBOL_GPL(kick_process);
1328 #endif /* CONFIG_SMP */
1332 * ->cpus_allowed is protected by both rq->lock and p->pi_lock
1334 static int select_fallback_rq(int cpu, struct task_struct *p)
1336 int nid = cpu_to_node(cpu);
1337 const struct cpumask *nodemask = NULL;
1338 enum { cpuset, possible, fail } state = cpuset;
1342 * If the node that the cpu is on has been offlined, cpu_to_node()
1343 * will return -1. There is no cpu on the node, and we should
1344 * select the cpu on the other node.
1347 nodemask = cpumask_of_node(nid);
1349 /* Look for allowed, online CPU in same node. */
1350 for_each_cpu(dest_cpu, nodemask) {
1351 if (!cpu_online(dest_cpu))
1353 if (!cpu_active(dest_cpu))
1355 if (cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
1361 /* Any allowed, online CPU? */
1362 for_each_cpu(dest_cpu, tsk_cpus_allowed(p)) {
1363 if (!cpu_online(dest_cpu))
1365 if (!cpu_active(dest_cpu))
1372 /* No more Mr. Nice Guy. */
1373 cpuset_cpus_allowed_fallback(p);
1378 do_set_cpus_allowed(p, cpu_possible_mask);
1389 if (state != cpuset) {
1391 * Don't tell them about moving exiting tasks or
1392 * kernel threads (both mm NULL), since they never
1395 if (p->mm && printk_ratelimit()) {
1396 printk_deferred("process %d (%s) no longer affine to cpu%d\n",
1397 task_pid_nr(p), p->comm, cpu);
1405 * The caller (fork, wakeup) owns p->pi_lock, ->cpus_allowed is stable.
1408 int select_task_rq(struct task_struct *p, int cpu, int sd_flags, int wake_flags)
1410 cpu = p->sched_class->select_task_rq(p, cpu, sd_flags, wake_flags);
1413 * In order not to call set_task_cpu() on a blocking task we need
1414 * to rely on ttwu() to place the task on a valid ->cpus_allowed
1417 * Since this is common to all placement strategies, this lives here.
1419 * [ this allows ->select_task() to simply return task_cpu(p) and
1420 * not worry about this generic constraint ]
1422 if (unlikely(!cpumask_test_cpu(cpu, tsk_cpus_allowed(p)) ||
1424 cpu = select_fallback_rq(task_cpu(p), p);
1429 static void update_avg(u64 *avg, u64 sample)
1431 s64 diff = sample - *avg;
1437 ttwu_stat(struct task_struct *p, int cpu, int wake_flags)
1439 #ifdef CONFIG_SCHEDSTATS
1440 struct rq *rq = this_rq();
1443 int this_cpu = smp_processor_id();
1445 if (cpu == this_cpu) {
1446 schedstat_inc(rq, ttwu_local);
1447 schedstat_inc(p, se.statistics.nr_wakeups_local);
1449 struct sched_domain *sd;
1451 schedstat_inc(p, se.statistics.nr_wakeups_remote);
1453 for_each_domain(this_cpu, sd) {
1454 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
1455 schedstat_inc(sd, ttwu_wake_remote);
1462 if (wake_flags & WF_MIGRATED)
1463 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
1465 #endif /* CONFIG_SMP */
1467 schedstat_inc(rq, ttwu_count);
1468 schedstat_inc(p, se.statistics.nr_wakeups);
1470 if (wake_flags & WF_SYNC)
1471 schedstat_inc(p, se.statistics.nr_wakeups_sync);
1473 #endif /* CONFIG_SCHEDSTATS */
1476 static void ttwu_activate(struct rq *rq, struct task_struct *p, int en_flags)
1478 activate_task(rq, p, en_flags);
1479 p->on_rq = TASK_ON_RQ_QUEUED;
1481 /* if a worker is waking up, notify workqueue */
1482 if (p->flags & PF_WQ_WORKER)
1483 wq_worker_waking_up(p, cpu_of(rq));
1487 * Mark the task runnable and perform wakeup-preemption.
1490 ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags)
1492 check_preempt_curr(rq, p, wake_flags);
1493 trace_sched_wakeup(p, true);
1495 p->state = TASK_RUNNING;
1497 if (p->sched_class->task_woken)
1498 p->sched_class->task_woken(rq, p);
1500 if (rq->idle_stamp) {
1501 u64 delta = rq_clock(rq) - rq->idle_stamp;
1502 u64 max = 2*rq->max_idle_balance_cost;
1504 update_avg(&rq->avg_idle, delta);
1506 if (rq->avg_idle > max)
1515 ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags)
1518 if (p->sched_contributes_to_load)
1519 rq->nr_uninterruptible--;
1522 ttwu_activate(rq, p, ENQUEUE_WAKEUP | ENQUEUE_WAKING);
1523 ttwu_do_wakeup(rq, p, wake_flags);
1527 * Called in case the task @p isn't fully descheduled from its runqueue,
1528 * in this case we must do a remote wakeup. Its a 'light' wakeup though,
1529 * since all we need to do is flip p->state to TASK_RUNNING, since
1530 * the task is still ->on_rq.
1532 static int ttwu_remote(struct task_struct *p, int wake_flags)
1537 rq = __task_rq_lock(p);
1538 if (task_on_rq_queued(p)) {
1539 /* check_preempt_curr() may use rq clock */
1540 update_rq_clock(rq);
1541 ttwu_do_wakeup(rq, p, wake_flags);
1544 __task_rq_unlock(rq);
1550 void sched_ttwu_pending(void)
1552 struct rq *rq = this_rq();
1553 struct llist_node *llist = llist_del_all(&rq->wake_list);
1554 struct task_struct *p;
1555 unsigned long flags;
1560 raw_spin_lock_irqsave(&rq->lock, flags);
1563 p = llist_entry(llist, struct task_struct, wake_entry);
1564 llist = llist_next(llist);
1565 ttwu_do_activate(rq, p, 0);
1568 raw_spin_unlock_irqrestore(&rq->lock, flags);
1571 void scheduler_ipi(void)
1574 * Fold TIF_NEED_RESCHED into the preempt_count; anybody setting
1575 * TIF_NEED_RESCHED remotely (for the first time) will also send
1578 preempt_fold_need_resched();
1580 if (llist_empty(&this_rq()->wake_list) && !got_nohz_idle_kick())
1584 * Not all reschedule IPI handlers call irq_enter/irq_exit, since
1585 * traditionally all their work was done from the interrupt return
1586 * path. Now that we actually do some work, we need to make sure
1589 * Some archs already do call them, luckily irq_enter/exit nest
1592 * Arguably we should visit all archs and update all handlers,
1593 * however a fair share of IPIs are still resched only so this would
1594 * somewhat pessimize the simple resched case.
1597 sched_ttwu_pending();
1600 * Check if someone kicked us for doing the nohz idle load balance.
1602 if (unlikely(got_nohz_idle_kick())) {
1603 this_rq()->idle_balance = 1;
1604 raise_softirq_irqoff(SCHED_SOFTIRQ);
1609 static void ttwu_queue_remote(struct task_struct *p, int cpu)
1611 struct rq *rq = cpu_rq(cpu);
1613 if (llist_add(&p->wake_entry, &cpu_rq(cpu)->wake_list)) {
1614 if (!set_nr_if_polling(rq->idle))
1615 smp_send_reschedule(cpu);
1617 trace_sched_wake_idle_without_ipi(cpu);
1621 void wake_up_if_idle(int cpu)
1623 struct rq *rq = cpu_rq(cpu);
1624 unsigned long flags;
1626 if (!is_idle_task(rq->curr))
1629 if (set_nr_if_polling(rq->idle)) {
1630 trace_sched_wake_idle_without_ipi(cpu);
1632 raw_spin_lock_irqsave(&rq->lock, flags);
1633 if (is_idle_task(rq->curr))
1634 smp_send_reschedule(cpu);
1635 /* Else cpu is not in idle, do nothing here */
1636 raw_spin_unlock_irqrestore(&rq->lock, flags);
1640 bool cpus_share_cache(int this_cpu, int that_cpu)
1642 return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu);
1644 #endif /* CONFIG_SMP */
1646 static void ttwu_queue(struct task_struct *p, int cpu)
1648 struct rq *rq = cpu_rq(cpu);
1650 #if defined(CONFIG_SMP)
1651 if (sched_feat(TTWU_QUEUE) && !cpus_share_cache(smp_processor_id(), cpu)) {
1652 sched_clock_cpu(cpu); /* sync clocks x-cpu */
1653 ttwu_queue_remote(p, cpu);
1658 raw_spin_lock(&rq->lock);
1659 ttwu_do_activate(rq, p, 0);
1660 raw_spin_unlock(&rq->lock);
1664 * try_to_wake_up - wake up a thread
1665 * @p: the thread to be awakened
1666 * @state: the mask of task states that can be woken
1667 * @wake_flags: wake modifier flags (WF_*)
1669 * Put it on the run-queue if it's not already there. The "current"
1670 * thread is always on the run-queue (except when the actual
1671 * re-schedule is in progress), and as such you're allowed to do
1672 * the simpler "current->state = TASK_RUNNING" to mark yourself
1673 * runnable without the overhead of this.
1675 * Return: %true if @p was woken up, %false if it was already running.
1676 * or @state didn't match @p's state.
1679 try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags)
1681 unsigned long flags;
1682 int cpu, success = 0;
1685 * If we are going to wake up a thread waiting for CONDITION we
1686 * need to ensure that CONDITION=1 done by the caller can not be
1687 * reordered with p->state check below. This pairs with mb() in
1688 * set_current_state() the waiting thread does.
1690 smp_mb__before_spinlock();
1691 raw_spin_lock_irqsave(&p->pi_lock, flags);
1692 if (!(p->state & state))
1695 success = 1; /* we're going to change ->state */
1698 if (p->on_rq && ttwu_remote(p, wake_flags))
1703 * If the owning (remote) cpu is still in the middle of schedule() with
1704 * this task as prev, wait until its done referencing the task.
1709 * Pairs with the smp_wmb() in finish_lock_switch().
1713 p->sched_contributes_to_load = !!task_contributes_to_load(p);
1714 p->state = TASK_WAKING;
1716 if (p->sched_class->task_waking)
1717 p->sched_class->task_waking(p);
1719 cpu = select_task_rq(p, p->wake_cpu, SD_BALANCE_WAKE, wake_flags);
1720 if (task_cpu(p) != cpu) {
1721 wake_flags |= WF_MIGRATED;
1722 set_task_cpu(p, cpu);
1724 #endif /* CONFIG_SMP */
1728 ttwu_stat(p, cpu, wake_flags);
1730 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1736 * try_to_wake_up_local - try to wake up a local task with rq lock held
1737 * @p: the thread to be awakened
1739 * Put @p on the run-queue if it's not already there. The caller must
1740 * ensure that this_rq() is locked, @p is bound to this_rq() and not
1743 static void try_to_wake_up_local(struct task_struct *p)
1745 struct rq *rq = task_rq(p);
1747 if (WARN_ON_ONCE(rq != this_rq()) ||
1748 WARN_ON_ONCE(p == current))
1751 lockdep_assert_held(&rq->lock);
1753 if (!raw_spin_trylock(&p->pi_lock)) {
1754 raw_spin_unlock(&rq->lock);
1755 raw_spin_lock(&p->pi_lock);
1756 raw_spin_lock(&rq->lock);
1759 if (!(p->state & TASK_NORMAL))
1762 if (!task_on_rq_queued(p))
1763 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1765 ttwu_do_wakeup(rq, p, 0);
1766 ttwu_stat(p, smp_processor_id(), 0);
1768 raw_spin_unlock(&p->pi_lock);
1772 * wake_up_process - Wake up a specific process
1773 * @p: The process to be woken up.
1775 * Attempt to wake up the nominated process and move it to the set of runnable
1778 * Return: 1 if the process was woken up, 0 if it was already running.
1780 * It may be assumed that this function implies a write memory barrier before
1781 * changing the task state if and only if any tasks are woken up.
1783 int wake_up_process(struct task_struct *p)
1785 WARN_ON(task_is_stopped_or_traced(p));
1786 return try_to_wake_up(p, TASK_NORMAL, 0);
1788 EXPORT_SYMBOL(wake_up_process);
1790 int wake_up_state(struct task_struct *p, unsigned int state)
1792 return try_to_wake_up(p, state, 0);
1796 * This function clears the sched_dl_entity static params.
1798 void __dl_clear_params(struct task_struct *p)
1800 struct sched_dl_entity *dl_se = &p->dl;
1802 dl_se->dl_runtime = 0;
1803 dl_se->dl_deadline = 0;
1804 dl_se->dl_period = 0;
1810 * Perform scheduler related setup for a newly forked process p.
1811 * p is forked by current.
1813 * __sched_fork() is basic setup used by init_idle() too:
1815 static void __sched_fork(unsigned long clone_flags, struct task_struct *p)
1820 p->se.exec_start = 0;
1821 p->se.sum_exec_runtime = 0;
1822 p->se.prev_sum_exec_runtime = 0;
1823 p->se.nr_migrations = 0;
1825 INIT_LIST_HEAD(&p->se.group_node);
1827 #ifdef CONFIG_SCHEDSTATS
1828 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
1831 RB_CLEAR_NODE(&p->dl.rb_node);
1832 hrtimer_init(&p->dl.dl_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1833 __dl_clear_params(p);
1835 INIT_LIST_HEAD(&p->rt.run_list);
1837 #ifdef CONFIG_PREEMPT_NOTIFIERS
1838 INIT_HLIST_HEAD(&p->preempt_notifiers);
1841 #ifdef CONFIG_NUMA_BALANCING
1842 if (p->mm && atomic_read(&p->mm->mm_users) == 1) {
1843 p->mm->numa_next_scan = jiffies + msecs_to_jiffies(sysctl_numa_balancing_scan_delay);
1844 p->mm->numa_scan_seq = 0;
1847 if (clone_flags & CLONE_VM)
1848 p->numa_preferred_nid = current->numa_preferred_nid;
1850 p->numa_preferred_nid = -1;
1852 p->node_stamp = 0ULL;
1853 p->numa_scan_seq = p->mm ? p->mm->numa_scan_seq : 0;
1854 p->numa_scan_period = sysctl_numa_balancing_scan_delay;
1855 p->numa_work.next = &p->numa_work;
1856 p->numa_faults_memory = NULL;
1857 p->numa_faults_buffer_memory = NULL;
1858 p->last_task_numa_placement = 0;
1859 p->last_sum_exec_runtime = 0;
1861 INIT_LIST_HEAD(&p->numa_entry);
1862 p->numa_group = NULL;
1863 #endif /* CONFIG_NUMA_BALANCING */
1866 #ifdef CONFIG_NUMA_BALANCING
1867 #ifdef CONFIG_SCHED_DEBUG
1868 void set_numabalancing_state(bool enabled)
1871 sched_feat_set("NUMA");
1873 sched_feat_set("NO_NUMA");
1876 __read_mostly bool numabalancing_enabled;
1878 void set_numabalancing_state(bool enabled)
1880 numabalancing_enabled = enabled;
1882 #endif /* CONFIG_SCHED_DEBUG */
1884 #ifdef CONFIG_PROC_SYSCTL
1885 int sysctl_numa_balancing(struct ctl_table *table, int write,
1886 void __user *buffer, size_t *lenp, loff_t *ppos)
1890 int state = numabalancing_enabled;
1892 if (write && !capable(CAP_SYS_ADMIN))
1897 err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
1901 set_numabalancing_state(state);
1908 * fork()/clone()-time setup:
1910 int sched_fork(unsigned long clone_flags, struct task_struct *p)
1912 unsigned long flags;
1913 int cpu = get_cpu();
1915 __sched_fork(clone_flags, p);
1917 * We mark the process as running here. This guarantees that
1918 * nobody will actually run it, and a signal or other external
1919 * event cannot wake it up and insert it on the runqueue either.
1921 p->state = TASK_RUNNING;
1924 * Make sure we do not leak PI boosting priority to the child.
1926 p->prio = current->normal_prio;
1929 * Revert to default priority/policy on fork if requested.
1931 if (unlikely(p->sched_reset_on_fork)) {
1932 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
1933 p->policy = SCHED_NORMAL;
1934 p->static_prio = NICE_TO_PRIO(0);
1936 } else if (PRIO_TO_NICE(p->static_prio) < 0)
1937 p->static_prio = NICE_TO_PRIO(0);
1939 p->prio = p->normal_prio = __normal_prio(p);
1943 * We don't need the reset flag anymore after the fork. It has
1944 * fulfilled its duty:
1946 p->sched_reset_on_fork = 0;
1949 if (dl_prio(p->prio)) {
1952 } else if (rt_prio(p->prio)) {
1953 p->sched_class = &rt_sched_class;
1955 p->sched_class = &fair_sched_class;
1958 if (p->sched_class->task_fork)
1959 p->sched_class->task_fork(p);
1962 * The child is not yet in the pid-hash so no cgroup attach races,
1963 * and the cgroup is pinned to this child due to cgroup_fork()
1964 * is ran before sched_fork().
1966 * Silence PROVE_RCU.
1968 raw_spin_lock_irqsave(&p->pi_lock, flags);
1969 set_task_cpu(p, cpu);
1970 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1972 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
1973 if (likely(sched_info_on()))
1974 memset(&p->sched_info, 0, sizeof(p->sched_info));
1976 #if defined(CONFIG_SMP)
1979 init_task_preempt_count(p);
1981 plist_node_init(&p->pushable_tasks, MAX_PRIO);
1982 RB_CLEAR_NODE(&p->pushable_dl_tasks);
1989 unsigned long to_ratio(u64 period, u64 runtime)
1991 if (runtime == RUNTIME_INF)
1995 * Doing this here saves a lot of checks in all
1996 * the calling paths, and returning zero seems
1997 * safe for them anyway.
2002 return div64_u64(runtime << 20, period);
2006 inline struct dl_bw *dl_bw_of(int i)
2008 rcu_lockdep_assert(rcu_read_lock_sched_held(),
2009 "sched RCU must be held");
2010 return &cpu_rq(i)->rd->dl_bw;
2013 static inline int dl_bw_cpus(int i)
2015 struct root_domain *rd = cpu_rq(i)->rd;
2018 rcu_lockdep_assert(rcu_read_lock_sched_held(),
2019 "sched RCU must be held");
2020 for_each_cpu_and(i, rd->span, cpu_active_mask)
2026 inline struct dl_bw *dl_bw_of(int i)
2028 return &cpu_rq(i)->dl.dl_bw;
2031 static inline int dl_bw_cpus(int i)
2038 void __dl_clear(struct dl_bw *dl_b, u64 tsk_bw)
2040 dl_b->total_bw -= tsk_bw;
2044 void __dl_add(struct dl_bw *dl_b, u64 tsk_bw)
2046 dl_b->total_bw += tsk_bw;
2050 bool __dl_overflow(struct dl_bw *dl_b, int cpus, u64 old_bw, u64 new_bw)
2052 return dl_b->bw != -1 &&
2053 dl_b->bw * cpus < dl_b->total_bw - old_bw + new_bw;
2057 * We must be sure that accepting a new task (or allowing changing the
2058 * parameters of an existing one) is consistent with the bandwidth
2059 * constraints. If yes, this function also accordingly updates the currently
2060 * allocated bandwidth to reflect the new situation.
2062 * This function is called while holding p's rq->lock.
2064 static int dl_overflow(struct task_struct *p, int policy,
2065 const struct sched_attr *attr)
2068 struct dl_bw *dl_b = dl_bw_of(task_cpu(p));
2069 u64 period = attr->sched_period ?: attr->sched_deadline;
2070 u64 runtime = attr->sched_runtime;
2071 u64 new_bw = dl_policy(policy) ? to_ratio(period, runtime) : 0;
2074 if (new_bw == p->dl.dl_bw)
2078 * Either if a task, enters, leave, or stays -deadline but changes
2079 * its parameters, we may need to update accordingly the total
2080 * allocated bandwidth of the container.
2082 raw_spin_lock(&dl_b->lock);
2083 cpus = dl_bw_cpus(task_cpu(p));
2084 if (dl_policy(policy) && !task_has_dl_policy(p) &&
2085 !__dl_overflow(dl_b, cpus, 0, new_bw)) {
2086 __dl_add(dl_b, new_bw);
2088 } else if (dl_policy(policy) && task_has_dl_policy(p) &&
2089 !__dl_overflow(dl_b, cpus, p->dl.dl_bw, new_bw)) {
2090 __dl_clear(dl_b, p->dl.dl_bw);
2091 __dl_add(dl_b, new_bw);
2093 } else if (!dl_policy(policy) && task_has_dl_policy(p)) {
2094 __dl_clear(dl_b, p->dl.dl_bw);
2097 raw_spin_unlock(&dl_b->lock);
2102 extern void init_dl_bw(struct dl_bw *dl_b);
2105 * wake_up_new_task - wake up a newly created task for the first time.
2107 * This function will do some initial scheduler statistics housekeeping
2108 * that must be done for every newly created context, then puts the task
2109 * on the runqueue and wakes it.
2111 void wake_up_new_task(struct task_struct *p)
2113 unsigned long flags;
2116 raw_spin_lock_irqsave(&p->pi_lock, flags);
2119 * Fork balancing, do it here and not earlier because:
2120 * - cpus_allowed can change in the fork path
2121 * - any previously selected cpu might disappear through hotplug
2123 set_task_cpu(p, select_task_rq(p, task_cpu(p), SD_BALANCE_FORK, 0));
2126 /* Initialize new task's runnable average */
2127 init_task_runnable_average(p);
2128 rq = __task_rq_lock(p);
2129 activate_task(rq, p, 0);
2130 p->on_rq = TASK_ON_RQ_QUEUED;
2131 trace_sched_wakeup_new(p, true);
2132 check_preempt_curr(rq, p, WF_FORK);
2134 if (p->sched_class->task_woken)
2135 p->sched_class->task_woken(rq, p);
2137 task_rq_unlock(rq, p, &flags);
2140 #ifdef CONFIG_PREEMPT_NOTIFIERS
2143 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2144 * @notifier: notifier struct to register
2146 void preempt_notifier_register(struct preempt_notifier *notifier)
2148 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2150 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2153 * preempt_notifier_unregister - no longer interested in preemption notifications
2154 * @notifier: notifier struct to unregister
2156 * This is safe to call from within a preemption notifier.
2158 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2160 hlist_del(¬ifier->link);
2162 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2164 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2166 struct preempt_notifier *notifier;
2168 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
2169 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2173 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2174 struct task_struct *next)
2176 struct preempt_notifier *notifier;
2178 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
2179 notifier->ops->sched_out(notifier, next);
2182 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2184 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2189 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2190 struct task_struct *next)
2194 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2197 * prepare_task_switch - prepare to switch tasks
2198 * @rq: the runqueue preparing to switch
2199 * @prev: the current task that is being switched out
2200 * @next: the task we are going to switch to.
2202 * This is called with the rq lock held and interrupts off. It must
2203 * be paired with a subsequent finish_task_switch after the context
2206 * prepare_task_switch sets up locking and calls architecture specific
2210 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2211 struct task_struct *next)
2213 trace_sched_switch(prev, next);
2214 sched_info_switch(rq, prev, next);
2215 perf_event_task_sched_out(prev, next);
2216 fire_sched_out_preempt_notifiers(prev, next);
2217 prepare_lock_switch(rq, next);
2218 prepare_arch_switch(next);
2222 * finish_task_switch - clean up after a task-switch
2223 * @rq: runqueue associated with task-switch
2224 * @prev: the thread we just switched away from.
2226 * finish_task_switch must be called after the context switch, paired
2227 * with a prepare_task_switch call before the context switch.
2228 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2229 * and do any other architecture-specific cleanup actions.
2231 * Note that we may have delayed dropping an mm in context_switch(). If
2232 * so, we finish that here outside of the runqueue lock. (Doing it
2233 * with the lock held can cause deadlocks; see schedule() for
2236 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2237 __releases(rq->lock)
2239 struct mm_struct *mm = rq->prev_mm;
2245 * A task struct has one reference for the use as "current".
2246 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2247 * schedule one last time. The schedule call will never return, and
2248 * the scheduled task must drop that reference.
2249 * The test for TASK_DEAD must occur while the runqueue locks are
2250 * still held, otherwise prev could be scheduled on another cpu, die
2251 * there before we look at prev->state, and then the reference would
2253 * Manfred Spraul <manfred@colorfullife.com>
2255 prev_state = prev->state;
2256 vtime_task_switch(prev);
2257 finish_arch_switch(prev);
2258 perf_event_task_sched_in(prev, current);
2259 finish_lock_switch(rq, prev);
2260 finish_arch_post_lock_switch();
2262 fire_sched_in_preempt_notifiers(current);
2265 if (unlikely(prev_state == TASK_DEAD)) {
2266 if (prev->sched_class->task_dead)
2267 prev->sched_class->task_dead(prev);
2270 * Remove function-return probe instances associated with this
2271 * task and put them back on the free list.
2273 kprobe_flush_task(prev);
2274 put_task_struct(prev);
2277 tick_nohz_task_switch(current);
2282 /* rq->lock is NOT held, but preemption is disabled */
2283 static inline void post_schedule(struct rq *rq)
2285 if (rq->post_schedule) {
2286 unsigned long flags;
2288 raw_spin_lock_irqsave(&rq->lock, flags);
2289 if (rq->curr->sched_class->post_schedule)
2290 rq->curr->sched_class->post_schedule(rq);
2291 raw_spin_unlock_irqrestore(&rq->lock, flags);
2293 rq->post_schedule = 0;
2299 static inline void post_schedule(struct rq *rq)
2306 * schedule_tail - first thing a freshly forked thread must call.
2307 * @prev: the thread we just switched away from.
2309 asmlinkage __visible void schedule_tail(struct task_struct *prev)
2310 __releases(rq->lock)
2312 struct rq *rq = this_rq();
2314 finish_task_switch(rq, prev);
2317 * FIXME: do we need to worry about rq being invalidated by the
2322 if (current->set_child_tid)
2323 put_user(task_pid_vnr(current), current->set_child_tid);
2327 * context_switch - switch to the new MM and the new
2328 * thread's register state.
2331 context_switch(struct rq *rq, struct task_struct *prev,
2332 struct task_struct *next)
2334 struct mm_struct *mm, *oldmm;
2336 prepare_task_switch(rq, prev, next);
2339 oldmm = prev->active_mm;
2341 * For paravirt, this is coupled with an exit in switch_to to
2342 * combine the page table reload and the switch backend into
2345 arch_start_context_switch(prev);
2348 next->active_mm = oldmm;
2349 atomic_inc(&oldmm->mm_count);
2350 enter_lazy_tlb(oldmm, next);
2352 switch_mm(oldmm, mm, next);
2355 prev->active_mm = NULL;
2356 rq->prev_mm = oldmm;
2359 * Since the runqueue lock will be released by the next
2360 * task (which is an invalid locking op but in the case
2361 * of the scheduler it's an obvious special-case), so we
2362 * do an early lockdep release here:
2364 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2366 context_tracking_task_switch(prev, next);
2367 /* Here we just switch the register state and the stack. */
2368 switch_to(prev, next, prev);
2372 * this_rq must be evaluated again because prev may have moved
2373 * CPUs since it called schedule(), thus the 'rq' on its stack
2374 * frame will be invalid.
2376 finish_task_switch(this_rq(), prev);
2380 * nr_running and nr_context_switches:
2382 * externally visible scheduler statistics: current number of runnable
2383 * threads, total number of context switches performed since bootup.
2385 unsigned long nr_running(void)
2387 unsigned long i, sum = 0;
2389 for_each_online_cpu(i)
2390 sum += cpu_rq(i)->nr_running;
2396 * Check if only the current task is running on the cpu.
2398 bool single_task_running(void)
2400 if (cpu_rq(smp_processor_id())->nr_running == 1)
2405 EXPORT_SYMBOL(single_task_running);
2407 unsigned long long nr_context_switches(void)
2410 unsigned long long sum = 0;
2412 for_each_possible_cpu(i)
2413 sum += cpu_rq(i)->nr_switches;
2418 unsigned long nr_iowait(void)
2420 unsigned long i, sum = 0;
2422 for_each_possible_cpu(i)
2423 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2428 unsigned long nr_iowait_cpu(int cpu)
2430 struct rq *this = cpu_rq(cpu);
2431 return atomic_read(&this->nr_iowait);
2434 void get_iowait_load(unsigned long *nr_waiters, unsigned long *load)
2436 struct rq *this = this_rq();
2437 *nr_waiters = atomic_read(&this->nr_iowait);
2438 *load = this->cpu_load[0];
2444 * sched_exec - execve() is a valuable balancing opportunity, because at
2445 * this point the task has the smallest effective memory and cache footprint.
2447 void sched_exec(void)
2449 struct task_struct *p = current;
2450 unsigned long flags;
2453 raw_spin_lock_irqsave(&p->pi_lock, flags);
2454 dest_cpu = p->sched_class->select_task_rq(p, task_cpu(p), SD_BALANCE_EXEC, 0);
2455 if (dest_cpu == smp_processor_id())
2458 if (likely(cpu_active(dest_cpu))) {
2459 struct migration_arg arg = { p, dest_cpu };
2461 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2462 stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg);
2466 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2471 DEFINE_PER_CPU(struct kernel_stat, kstat);
2472 DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat);
2474 EXPORT_PER_CPU_SYMBOL(kstat);
2475 EXPORT_PER_CPU_SYMBOL(kernel_cpustat);
2478 * Return accounted runtime for the task.
2479 * In case the task is currently running, return the runtime plus current's
2480 * pending runtime that have not been accounted yet.
2482 unsigned long long task_sched_runtime(struct task_struct *p)
2484 unsigned long flags;
2488 #if defined(CONFIG_64BIT) && defined(CONFIG_SMP)
2490 * 64-bit doesn't need locks to atomically read a 64bit value.
2491 * So we have a optimization chance when the task's delta_exec is 0.
2492 * Reading ->on_cpu is racy, but this is ok.
2494 * If we race with it leaving cpu, we'll take a lock. So we're correct.
2495 * If we race with it entering cpu, unaccounted time is 0. This is
2496 * indistinguishable from the read occurring a few cycles earlier.
2497 * If we see ->on_cpu without ->on_rq, the task is leaving, and has
2498 * been accounted, so we're correct here as well.
2500 if (!p->on_cpu || !task_on_rq_queued(p))
2501 return p->se.sum_exec_runtime;
2504 rq = task_rq_lock(p, &flags);
2506 * Must be ->curr _and_ ->on_rq. If dequeued, we would
2507 * project cycles that may never be accounted to this
2508 * thread, breaking clock_gettime().
2510 if (task_current(rq, p) && task_on_rq_queued(p)) {
2511 update_rq_clock(rq);
2512 p->sched_class->update_curr(rq);
2514 ns = p->se.sum_exec_runtime;
2515 task_rq_unlock(rq, p, &flags);
2521 * This function gets called by the timer code, with HZ frequency.
2522 * We call it with interrupts disabled.
2524 void scheduler_tick(void)
2526 int cpu = smp_processor_id();
2527 struct rq *rq = cpu_rq(cpu);
2528 struct task_struct *curr = rq->curr;
2532 raw_spin_lock(&rq->lock);
2533 update_rq_clock(rq);
2534 curr->sched_class->task_tick(rq, curr, 0);
2535 update_cpu_load_active(rq);
2536 raw_spin_unlock(&rq->lock);
2538 perf_event_task_tick();
2541 rq->idle_balance = idle_cpu(cpu);
2542 trigger_load_balance(rq);
2544 rq_last_tick_reset(rq);
2547 #ifdef CONFIG_NO_HZ_FULL
2549 * scheduler_tick_max_deferment
2551 * Keep at least one tick per second when a single
2552 * active task is running because the scheduler doesn't
2553 * yet completely support full dynticks environment.
2555 * This makes sure that uptime, CFS vruntime, load
2556 * balancing, etc... continue to move forward, even
2557 * with a very low granularity.
2559 * Return: Maximum deferment in nanoseconds.
2561 u64 scheduler_tick_max_deferment(void)
2563 struct rq *rq = this_rq();
2564 unsigned long next, now = ACCESS_ONCE(jiffies);
2566 next = rq->last_sched_tick + HZ;
2568 if (time_before_eq(next, now))
2571 return jiffies_to_nsecs(next - now);
2575 notrace unsigned long get_parent_ip(unsigned long addr)
2577 if (in_lock_functions(addr)) {
2578 addr = CALLER_ADDR2;
2579 if (in_lock_functions(addr))
2580 addr = CALLER_ADDR3;
2585 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
2586 defined(CONFIG_PREEMPT_TRACER))
2588 void preempt_count_add(int val)
2590 #ifdef CONFIG_DEBUG_PREEMPT
2594 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
2597 __preempt_count_add(val);
2598 #ifdef CONFIG_DEBUG_PREEMPT
2600 * Spinlock count overflowing soon?
2602 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
2605 if (preempt_count() == val) {
2606 unsigned long ip = get_parent_ip(CALLER_ADDR1);
2607 #ifdef CONFIG_DEBUG_PREEMPT
2608 current->preempt_disable_ip = ip;
2610 trace_preempt_off(CALLER_ADDR0, ip);
2613 EXPORT_SYMBOL(preempt_count_add);
2614 NOKPROBE_SYMBOL(preempt_count_add);
2616 void preempt_count_sub(int val)
2618 #ifdef CONFIG_DEBUG_PREEMPT
2622 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
2625 * Is the spinlock portion underflowing?
2627 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
2628 !(preempt_count() & PREEMPT_MASK)))
2632 if (preempt_count() == val)
2633 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
2634 __preempt_count_sub(val);
2636 EXPORT_SYMBOL(preempt_count_sub);
2637 NOKPROBE_SYMBOL(preempt_count_sub);
2642 * Print scheduling while atomic bug:
2644 static noinline void __schedule_bug(struct task_struct *prev)
2646 if (oops_in_progress)
2649 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
2650 prev->comm, prev->pid, preempt_count());
2652 debug_show_held_locks(prev);
2654 if (irqs_disabled())
2655 print_irqtrace_events(prev);
2656 #ifdef CONFIG_DEBUG_PREEMPT
2657 if (in_atomic_preempt_off()) {
2658 pr_err("Preemption disabled at:");
2659 print_ip_sym(current->preempt_disable_ip);
2664 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
2668 * Various schedule()-time debugging checks and statistics:
2670 static inline void schedule_debug(struct task_struct *prev)
2672 #ifdef CONFIG_SCHED_STACK_END_CHECK
2673 BUG_ON(unlikely(task_stack_end_corrupted(prev)));
2676 * Test if we are atomic. Since do_exit() needs to call into
2677 * schedule() atomically, we ignore that path. Otherwise whine
2678 * if we are scheduling when we should not.
2680 if (unlikely(in_atomic_preempt_off() && prev->state != TASK_DEAD))
2681 __schedule_bug(prev);
2684 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
2686 schedstat_inc(this_rq(), sched_count);
2690 * Pick up the highest-prio task:
2692 static inline struct task_struct *
2693 pick_next_task(struct rq *rq, struct task_struct *prev)
2695 const struct sched_class *class = &fair_sched_class;
2696 struct task_struct *p;
2699 * Optimization: we know that if all tasks are in
2700 * the fair class we can call that function directly:
2702 if (likely(prev->sched_class == class &&
2703 rq->nr_running == rq->cfs.h_nr_running)) {
2704 p = fair_sched_class.pick_next_task(rq, prev);
2705 if (unlikely(p == RETRY_TASK))
2708 /* assumes fair_sched_class->next == idle_sched_class */
2710 p = idle_sched_class.pick_next_task(rq, prev);
2716 for_each_class(class) {
2717 p = class->pick_next_task(rq, prev);
2719 if (unlikely(p == RETRY_TASK))
2725 BUG(); /* the idle class will always have a runnable task */
2729 * __schedule() is the main scheduler function.
2731 * The main means of driving the scheduler and thus entering this function are:
2733 * 1. Explicit blocking: mutex, semaphore, waitqueue, etc.
2735 * 2. TIF_NEED_RESCHED flag is checked on interrupt and userspace return
2736 * paths. For example, see arch/x86/entry_64.S.
2738 * To drive preemption between tasks, the scheduler sets the flag in timer
2739 * interrupt handler scheduler_tick().
2741 * 3. Wakeups don't really cause entry into schedule(). They add a
2742 * task to the run-queue and that's it.
2744 * Now, if the new task added to the run-queue preempts the current
2745 * task, then the wakeup sets TIF_NEED_RESCHED and schedule() gets
2746 * called on the nearest possible occasion:
2748 * - If the kernel is preemptible (CONFIG_PREEMPT=y):
2750 * - in syscall or exception context, at the next outmost
2751 * preempt_enable(). (this might be as soon as the wake_up()'s
2754 * - in IRQ context, return from interrupt-handler to
2755 * preemptible context
2757 * - If the kernel is not preemptible (CONFIG_PREEMPT is not set)
2760 * - cond_resched() call
2761 * - explicit schedule() call
2762 * - return from syscall or exception to user-space
2763 * - return from interrupt-handler to user-space
2765 static void __sched __schedule(void)
2767 struct task_struct *prev, *next;
2768 unsigned long *switch_count;
2774 cpu = smp_processor_id();
2776 rcu_note_context_switch(cpu);
2779 schedule_debug(prev);
2781 if (sched_feat(HRTICK))
2785 * Make sure that signal_pending_state()->signal_pending() below
2786 * can't be reordered with __set_current_state(TASK_INTERRUPTIBLE)
2787 * done by the caller to avoid the race with signal_wake_up().
2789 smp_mb__before_spinlock();
2790 raw_spin_lock_irq(&rq->lock);
2792 switch_count = &prev->nivcsw;
2793 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
2794 if (unlikely(signal_pending_state(prev->state, prev))) {
2795 prev->state = TASK_RUNNING;
2797 deactivate_task(rq, prev, DEQUEUE_SLEEP);
2801 * If a worker went to sleep, notify and ask workqueue
2802 * whether it wants to wake up a task to maintain
2805 if (prev->flags & PF_WQ_WORKER) {
2806 struct task_struct *to_wakeup;
2808 to_wakeup = wq_worker_sleeping(prev, cpu);
2810 try_to_wake_up_local(to_wakeup);
2813 switch_count = &prev->nvcsw;
2816 if (task_on_rq_queued(prev) || rq->skip_clock_update < 0)
2817 update_rq_clock(rq);
2819 next = pick_next_task(rq, prev);
2820 clear_tsk_need_resched(prev);
2821 clear_preempt_need_resched();
2822 rq->skip_clock_update = 0;
2824 if (likely(prev != next)) {
2829 context_switch(rq, prev, next); /* unlocks the rq */
2831 * The context switch have flipped the stack from under us
2832 * and restored the local variables which were saved when
2833 * this task called schedule() in the past. prev == current
2834 * is still correct, but it can be moved to another cpu/rq.
2836 cpu = smp_processor_id();
2839 raw_spin_unlock_irq(&rq->lock);
2843 sched_preempt_enable_no_resched();
2848 static inline void sched_submit_work(struct task_struct *tsk)
2850 if (!tsk->state || tsk_is_pi_blocked(tsk))
2853 * If we are going to sleep and we have plugged IO queued,
2854 * make sure to submit it to avoid deadlocks.
2856 if (blk_needs_flush_plug(tsk))
2857 blk_schedule_flush_plug(tsk);
2860 asmlinkage __visible void __sched schedule(void)
2862 struct task_struct *tsk = current;
2864 sched_submit_work(tsk);
2867 EXPORT_SYMBOL(schedule);
2869 #ifdef CONFIG_CONTEXT_TRACKING
2870 asmlinkage __visible void __sched schedule_user(void)
2873 * If we come here after a random call to set_need_resched(),
2874 * or we have been woken up remotely but the IPI has not yet arrived,
2875 * we haven't yet exited the RCU idle mode. Do it here manually until
2876 * we find a better solution.
2878 * NB: There are buggy callers of this function. Ideally we
2879 * should warn if prev_state != IN_USER, but that will trigger
2880 * too frequently to make sense yet.
2882 enum ctx_state prev_state = exception_enter();
2884 exception_exit(prev_state);
2889 * schedule_preempt_disabled - called with preemption disabled
2891 * Returns with preemption disabled. Note: preempt_count must be 1
2893 void __sched schedule_preempt_disabled(void)
2895 sched_preempt_enable_no_resched();
2900 #ifdef CONFIG_PREEMPT
2902 * this is the entry point to schedule() from in-kernel preemption
2903 * off of preempt_enable. Kernel preemptions off return from interrupt
2904 * occur there and call schedule directly.
2906 asmlinkage __visible void __sched notrace preempt_schedule(void)
2909 * If there is a non-zero preempt_count or interrupts are disabled,
2910 * we do not want to preempt the current task. Just return..
2912 if (likely(!preemptible()))
2916 __preempt_count_add(PREEMPT_ACTIVE);
2918 __preempt_count_sub(PREEMPT_ACTIVE);
2921 * Check again in case we missed a preemption opportunity
2922 * between schedule and now.
2925 } while (need_resched());
2927 NOKPROBE_SYMBOL(preempt_schedule);
2928 EXPORT_SYMBOL(preempt_schedule);
2930 #ifdef CONFIG_CONTEXT_TRACKING
2932 * preempt_schedule_context - preempt_schedule called by tracing
2934 * The tracing infrastructure uses preempt_enable_notrace to prevent
2935 * recursion and tracing preempt enabling caused by the tracing
2936 * infrastructure itself. But as tracing can happen in areas coming
2937 * from userspace or just about to enter userspace, a preempt enable
2938 * can occur before user_exit() is called. This will cause the scheduler
2939 * to be called when the system is still in usermode.
2941 * To prevent this, the preempt_enable_notrace will use this function
2942 * instead of preempt_schedule() to exit user context if needed before
2943 * calling the scheduler.
2945 asmlinkage __visible void __sched notrace preempt_schedule_context(void)
2947 enum ctx_state prev_ctx;
2949 if (likely(!preemptible()))
2953 __preempt_count_add(PREEMPT_ACTIVE);
2955 * Needs preempt disabled in case user_exit() is traced
2956 * and the tracer calls preempt_enable_notrace() causing
2957 * an infinite recursion.
2959 prev_ctx = exception_enter();
2961 exception_exit(prev_ctx);
2963 __preempt_count_sub(PREEMPT_ACTIVE);
2965 } while (need_resched());
2967 EXPORT_SYMBOL_GPL(preempt_schedule_context);
2968 #endif /* CONFIG_CONTEXT_TRACKING */
2970 #endif /* CONFIG_PREEMPT */
2973 * this is the entry point to schedule() from kernel preemption
2974 * off of irq context.
2975 * Note, that this is called and return with irqs disabled. This will
2976 * protect us against recursive calling from irq.
2978 asmlinkage __visible void __sched preempt_schedule_irq(void)
2980 enum ctx_state prev_state;
2982 /* Catch callers which need to be fixed */
2983 BUG_ON(preempt_count() || !irqs_disabled());
2985 prev_state = exception_enter();
2988 __preempt_count_add(PREEMPT_ACTIVE);
2991 local_irq_disable();
2992 __preempt_count_sub(PREEMPT_ACTIVE);
2995 * Check again in case we missed a preemption opportunity
2996 * between schedule and now.
2999 } while (need_resched());
3001 exception_exit(prev_state);
3004 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3007 return try_to_wake_up(curr->private, mode, wake_flags);
3009 EXPORT_SYMBOL(default_wake_function);
3011 #ifdef CONFIG_RT_MUTEXES
3014 * rt_mutex_setprio - set the current priority of a task
3016 * @prio: prio value (kernel-internal form)
3018 * This function changes the 'effective' priority of a task. It does
3019 * not touch ->normal_prio like __setscheduler().
3021 * Used by the rt_mutex code to implement priority inheritance
3022 * logic. Call site only calls if the priority of the task changed.
3024 void rt_mutex_setprio(struct task_struct *p, int prio)
3026 int oldprio, queued, running, enqueue_flag = 0;
3028 const struct sched_class *prev_class;
3030 BUG_ON(prio > MAX_PRIO);
3032 rq = __task_rq_lock(p);
3035 * Idle task boosting is a nono in general. There is one
3036 * exception, when PREEMPT_RT and NOHZ is active:
3038 * The idle task calls get_next_timer_interrupt() and holds
3039 * the timer wheel base->lock on the CPU and another CPU wants
3040 * to access the timer (probably to cancel it). We can safely
3041 * ignore the boosting request, as the idle CPU runs this code
3042 * with interrupts disabled and will complete the lock
3043 * protected section without being interrupted. So there is no
3044 * real need to boost.
3046 if (unlikely(p == rq->idle)) {
3047 WARN_ON(p != rq->curr);
3048 WARN_ON(p->pi_blocked_on);
3052 trace_sched_pi_setprio(p, prio);
3054 prev_class = p->sched_class;
3055 queued = task_on_rq_queued(p);
3056 running = task_current(rq, p);
3058 dequeue_task(rq, p, 0);
3060 put_prev_task(rq, p);
3063 * Boosting condition are:
3064 * 1. -rt task is running and holds mutex A
3065 * --> -dl task blocks on mutex A
3067 * 2. -dl task is running and holds mutex A
3068 * --> -dl task blocks on mutex A and could preempt the
3071 if (dl_prio(prio)) {
3072 struct task_struct *pi_task = rt_mutex_get_top_task(p);
3073 if (!dl_prio(p->normal_prio) ||
3074 (pi_task && dl_entity_preempt(&pi_task->dl, &p->dl))) {
3075 p->dl.dl_boosted = 1;
3076 p->dl.dl_throttled = 0;
3077 enqueue_flag = ENQUEUE_REPLENISH;
3079 p->dl.dl_boosted = 0;
3080 p->sched_class = &dl_sched_class;
3081 } else if (rt_prio(prio)) {
3082 if (dl_prio(oldprio))
3083 p->dl.dl_boosted = 0;
3085 enqueue_flag = ENQUEUE_HEAD;
3086 p->sched_class = &rt_sched_class;
3088 if (dl_prio(oldprio))
3089 p->dl.dl_boosted = 0;
3090 p->sched_class = &fair_sched_class;
3096 p->sched_class->set_curr_task(rq);
3098 enqueue_task(rq, p, enqueue_flag);
3100 check_class_changed(rq, p, prev_class, oldprio);
3102 __task_rq_unlock(rq);
3106 void set_user_nice(struct task_struct *p, long nice)
3108 int old_prio, delta, queued;
3109 unsigned long flags;
3112 if (task_nice(p) == nice || nice < MIN_NICE || nice > MAX_NICE)
3115 * We have to be careful, if called from sys_setpriority(),
3116 * the task might be in the middle of scheduling on another CPU.
3118 rq = task_rq_lock(p, &flags);
3120 * The RT priorities are set via sched_setscheduler(), but we still
3121 * allow the 'normal' nice value to be set - but as expected
3122 * it wont have any effect on scheduling until the task is
3123 * SCHED_DEADLINE, SCHED_FIFO or SCHED_RR:
3125 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
3126 p->static_prio = NICE_TO_PRIO(nice);
3129 queued = task_on_rq_queued(p);
3131 dequeue_task(rq, p, 0);
3133 p->static_prio = NICE_TO_PRIO(nice);
3136 p->prio = effective_prio(p);
3137 delta = p->prio - old_prio;
3140 enqueue_task(rq, p, 0);
3142 * If the task increased its priority or is running and
3143 * lowered its priority, then reschedule its CPU:
3145 if (delta < 0 || (delta > 0 && task_running(rq, p)))
3149 task_rq_unlock(rq, p, &flags);
3151 EXPORT_SYMBOL(set_user_nice);
3154 * can_nice - check if a task can reduce its nice value
3158 int can_nice(const struct task_struct *p, const int nice)
3160 /* convert nice value [19,-20] to rlimit style value [1,40] */
3161 int nice_rlim = nice_to_rlimit(nice);
3163 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
3164 capable(CAP_SYS_NICE));
3167 #ifdef __ARCH_WANT_SYS_NICE
3170 * sys_nice - change the priority of the current process.
3171 * @increment: priority increment
3173 * sys_setpriority is a more generic, but much slower function that
3174 * does similar things.
3176 SYSCALL_DEFINE1(nice, int, increment)
3181 * Setpriority might change our priority at the same moment.
3182 * We don't have to worry. Conceptually one call occurs first
3183 * and we have a single winner.
3185 increment = clamp(increment, -NICE_WIDTH, NICE_WIDTH);
3186 nice = task_nice(current) + increment;
3188 nice = clamp_val(nice, MIN_NICE, MAX_NICE);
3189 if (increment < 0 && !can_nice(current, nice))
3192 retval = security_task_setnice(current, nice);
3196 set_user_nice(current, nice);
3203 * task_prio - return the priority value of a given task.
3204 * @p: the task in question.
3206 * Return: The priority value as seen by users in /proc.
3207 * RT tasks are offset by -200. Normal tasks are centered
3208 * around 0, value goes from -16 to +15.
3210 int task_prio(const struct task_struct *p)
3212 return p->prio - MAX_RT_PRIO;
3216 * idle_cpu - is a given cpu idle currently?
3217 * @cpu: the processor in question.
3219 * Return: 1 if the CPU is currently idle. 0 otherwise.
3221 int idle_cpu(int cpu)
3223 struct rq *rq = cpu_rq(cpu);
3225 if (rq->curr != rq->idle)
3232 if (!llist_empty(&rq->wake_list))
3240 * idle_task - return the idle task for a given cpu.
3241 * @cpu: the processor in question.
3243 * Return: The idle task for the cpu @cpu.
3245 struct task_struct *idle_task(int cpu)
3247 return cpu_rq(cpu)->idle;
3251 * find_process_by_pid - find a process with a matching PID value.
3252 * @pid: the pid in question.
3254 * The task of @pid, if found. %NULL otherwise.
3256 static struct task_struct *find_process_by_pid(pid_t pid)
3258 return pid ? find_task_by_vpid(pid) : current;
3262 * This function initializes the sched_dl_entity of a newly becoming
3263 * SCHED_DEADLINE task.
3265 * Only the static values are considered here, the actual runtime and the
3266 * absolute deadline will be properly calculated when the task is enqueued
3267 * for the first time with its new policy.
3270 __setparam_dl(struct task_struct *p, const struct sched_attr *attr)
3272 struct sched_dl_entity *dl_se = &p->dl;
3274 init_dl_task_timer(dl_se);
3275 dl_se->dl_runtime = attr->sched_runtime;
3276 dl_se->dl_deadline = attr->sched_deadline;
3277 dl_se->dl_period = attr->sched_period ?: dl_se->dl_deadline;
3278 dl_se->flags = attr->sched_flags;
3279 dl_se->dl_bw = to_ratio(dl_se->dl_period, dl_se->dl_runtime);
3280 dl_se->dl_throttled = 0;
3282 dl_se->dl_yielded = 0;
3286 * sched_setparam() passes in -1 for its policy, to let the functions
3287 * it calls know not to change it.
3289 #define SETPARAM_POLICY -1
3291 static void __setscheduler_params(struct task_struct *p,
3292 const struct sched_attr *attr)
3294 int policy = attr->sched_policy;
3296 if (policy == SETPARAM_POLICY)
3301 if (dl_policy(policy))
3302 __setparam_dl(p, attr);
3303 else if (fair_policy(policy))
3304 p->static_prio = NICE_TO_PRIO(attr->sched_nice);
3307 * __sched_setscheduler() ensures attr->sched_priority == 0 when
3308 * !rt_policy. Always setting this ensures that things like
3309 * getparam()/getattr() don't report silly values for !rt tasks.
3311 p->rt_priority = attr->sched_priority;
3312 p->normal_prio = normal_prio(p);
3316 /* Actually do priority change: must hold pi & rq lock. */
3317 static void __setscheduler(struct rq *rq, struct task_struct *p,
3318 const struct sched_attr *attr)
3320 __setscheduler_params(p, attr);
3323 * If we get here, there was no pi waiters boosting the
3324 * task. It is safe to use the normal prio.
3326 p->prio = normal_prio(p);
3328 if (dl_prio(p->prio))
3329 p->sched_class = &dl_sched_class;
3330 else if (rt_prio(p->prio))
3331 p->sched_class = &rt_sched_class;
3333 p->sched_class = &fair_sched_class;
3337 __getparam_dl(struct task_struct *p, struct sched_attr *attr)
3339 struct sched_dl_entity *dl_se = &p->dl;
3341 attr->sched_priority = p->rt_priority;
3342 attr->sched_runtime = dl_se->dl_runtime;
3343 attr->sched_deadline = dl_se->dl_deadline;
3344 attr->sched_period = dl_se->dl_period;
3345 attr->sched_flags = dl_se->flags;
3349 * This function validates the new parameters of a -deadline task.
3350 * We ask for the deadline not being zero, and greater or equal
3351 * than the runtime, as well as the period of being zero or
3352 * greater than deadline. Furthermore, we have to be sure that
3353 * user parameters are above the internal resolution of 1us (we
3354 * check sched_runtime only since it is always the smaller one) and
3355 * below 2^63 ns (we have to check both sched_deadline and
3356 * sched_period, as the latter can be zero).
3359 __checkparam_dl(const struct sched_attr *attr)
3362 if (attr->sched_deadline == 0)
3366 * Since we truncate DL_SCALE bits, make sure we're at least
3369 if (attr->sched_runtime < (1ULL << DL_SCALE))
3373 * Since we use the MSB for wrap-around and sign issues, make
3374 * sure it's not set (mind that period can be equal to zero).
3376 if (attr->sched_deadline & (1ULL << 63) ||
3377 attr->sched_period & (1ULL << 63))
3380 /* runtime <= deadline <= period (if period != 0) */
3381 if ((attr->sched_period != 0 &&
3382 attr->sched_period < attr->sched_deadline) ||
3383 attr->sched_deadline < attr->sched_runtime)
3390 * check the target process has a UID that matches the current process's
3392 static bool check_same_owner(struct task_struct *p)
3394 const struct cred *cred = current_cred(), *pcred;
3398 pcred = __task_cred(p);
3399 match = (uid_eq(cred->euid, pcred->euid) ||
3400 uid_eq(cred->euid, pcred->uid));
3405 static int __sched_setscheduler(struct task_struct *p,
3406 const struct sched_attr *attr,
3409 int newprio = dl_policy(attr->sched_policy) ? MAX_DL_PRIO - 1 :
3410 MAX_RT_PRIO - 1 - attr->sched_priority;
3411 int retval, oldprio, oldpolicy = -1, queued, running;
3412 int policy = attr->sched_policy;
3413 unsigned long flags;
3414 const struct sched_class *prev_class;
3418 /* may grab non-irq protected spin_locks */
3419 BUG_ON(in_interrupt());
3421 /* double check policy once rq lock held */
3423 reset_on_fork = p->sched_reset_on_fork;
3424 policy = oldpolicy = p->policy;
3426 reset_on_fork = !!(attr->sched_flags & SCHED_FLAG_RESET_ON_FORK);
3428 if (policy != SCHED_DEADLINE &&
3429 policy != SCHED_FIFO && policy != SCHED_RR &&
3430 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
3431 policy != SCHED_IDLE)
3435 if (attr->sched_flags & ~(SCHED_FLAG_RESET_ON_FORK))
3439 * Valid priorities for SCHED_FIFO and SCHED_RR are
3440 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
3441 * SCHED_BATCH and SCHED_IDLE is 0.
3443 if ((p->mm && attr->sched_priority > MAX_USER_RT_PRIO-1) ||
3444 (!p->mm && attr->sched_priority > MAX_RT_PRIO-1))
3446 if ((dl_policy(policy) && !__checkparam_dl(attr)) ||
3447 (rt_policy(policy) != (attr->sched_priority != 0)))
3451 * Allow unprivileged RT tasks to decrease priority:
3453 if (user && !capable(CAP_SYS_NICE)) {
3454 if (fair_policy(policy)) {
3455 if (attr->sched_nice < task_nice(p) &&
3456 !can_nice(p, attr->sched_nice))
3460 if (rt_policy(policy)) {
3461 unsigned long rlim_rtprio =
3462 task_rlimit(p, RLIMIT_RTPRIO);
3464 /* can't set/change the rt policy */
3465 if (policy != p->policy && !rlim_rtprio)
3468 /* can't increase priority */
3469 if (attr->sched_priority > p->rt_priority &&
3470 attr->sched_priority > rlim_rtprio)
3475 * Can't set/change SCHED_DEADLINE policy at all for now
3476 * (safest behavior); in the future we would like to allow
3477 * unprivileged DL tasks to increase their relative deadline
3478 * or reduce their runtime (both ways reducing utilization)
3480 if (dl_policy(policy))
3484 * Treat SCHED_IDLE as nice 20. Only allow a switch to
3485 * SCHED_NORMAL if the RLIMIT_NICE would normally permit it.
3487 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) {
3488 if (!can_nice(p, task_nice(p)))
3492 /* can't change other user's priorities */
3493 if (!check_same_owner(p))
3496 /* Normal users shall not reset the sched_reset_on_fork flag */
3497 if (p->sched_reset_on_fork && !reset_on_fork)
3502 retval = security_task_setscheduler(p);
3508 * make sure no PI-waiters arrive (or leave) while we are
3509 * changing the priority of the task:
3511 * To be able to change p->policy safely, the appropriate
3512 * runqueue lock must be held.
3514 rq = task_rq_lock(p, &flags);
3517 * Changing the policy of the stop threads its a very bad idea
3519 if (p == rq->stop) {
3520 task_rq_unlock(rq, p, &flags);
3525 * If not changing anything there's no need to proceed further,
3526 * but store a possible modification of reset_on_fork.
3528 if (unlikely(policy == p->policy)) {
3529 if (fair_policy(policy) && attr->sched_nice != task_nice(p))
3531 if (rt_policy(policy) && attr->sched_priority != p->rt_priority)
3533 if (dl_policy(policy))
3536 p->sched_reset_on_fork = reset_on_fork;
3537 task_rq_unlock(rq, p, &flags);
3543 #ifdef CONFIG_RT_GROUP_SCHED
3545 * Do not allow realtime tasks into groups that have no runtime
3548 if (rt_bandwidth_enabled() && rt_policy(policy) &&
3549 task_group(p)->rt_bandwidth.rt_runtime == 0 &&
3550 !task_group_is_autogroup(task_group(p))) {
3551 task_rq_unlock(rq, p, &flags);
3556 if (dl_bandwidth_enabled() && dl_policy(policy)) {
3557 cpumask_t *span = rq->rd->span;
3560 * Don't allow tasks with an affinity mask smaller than
3561 * the entire root_domain to become SCHED_DEADLINE. We
3562 * will also fail if there's no bandwidth available.
3564 if (!cpumask_subset(span, &p->cpus_allowed) ||
3565 rq->rd->dl_bw.bw == 0) {
3566 task_rq_unlock(rq, p, &flags);
3573 /* recheck policy now with rq lock held */
3574 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
3575 policy = oldpolicy = -1;
3576 task_rq_unlock(rq, p, &flags);
3581 * If setscheduling to SCHED_DEADLINE (or changing the parameters
3582 * of a SCHED_DEADLINE task) we need to check if enough bandwidth
3585 if ((dl_policy(policy) || dl_task(p)) && dl_overflow(p, policy, attr)) {
3586 task_rq_unlock(rq, p, &flags);
3590 p->sched_reset_on_fork = reset_on_fork;
3594 * Special case for priority boosted tasks.
3596 * If the new priority is lower or equal (user space view)
3597 * than the current (boosted) priority, we just store the new
3598 * normal parameters and do not touch the scheduler class and
3599 * the runqueue. This will be done when the task deboost
3602 if (rt_mutex_check_prio(p, newprio)) {
3603 __setscheduler_params(p, attr);
3604 task_rq_unlock(rq, p, &flags);
3608 queued = task_on_rq_queued(p);
3609 running = task_current(rq, p);
3611 dequeue_task(rq, p, 0);
3613 put_prev_task(rq, p);
3615 prev_class = p->sched_class;
3616 __setscheduler(rq, p, attr);
3619 p->sched_class->set_curr_task(rq);
3622 * We enqueue to tail when the priority of a task is
3623 * increased (user space view).
3625 enqueue_task(rq, p, oldprio <= p->prio ? ENQUEUE_HEAD : 0);
3628 check_class_changed(rq, p, prev_class, oldprio);
3629 task_rq_unlock(rq, p, &flags);
3631 rt_mutex_adjust_pi(p);
3636 static int _sched_setscheduler(struct task_struct *p, int policy,
3637 const struct sched_param *param, bool check)
3639 struct sched_attr attr = {
3640 .sched_policy = policy,
3641 .sched_priority = param->sched_priority,
3642 .sched_nice = PRIO_TO_NICE(p->static_prio),
3645 /* Fixup the legacy SCHED_RESET_ON_FORK hack. */
3646 if ((policy != SETPARAM_POLICY) && (policy & SCHED_RESET_ON_FORK)) {
3647 attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
3648 policy &= ~SCHED_RESET_ON_FORK;
3649 attr.sched_policy = policy;
3652 return __sched_setscheduler(p, &attr, check);
3655 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
3656 * @p: the task in question.
3657 * @policy: new policy.
3658 * @param: structure containing the new RT priority.
3660 * Return: 0 on success. An error code otherwise.
3662 * NOTE that the task may be already dead.
3664 int sched_setscheduler(struct task_struct *p, int policy,
3665 const struct sched_param *param)
3667 return _sched_setscheduler(p, policy, param, true);
3669 EXPORT_SYMBOL_GPL(sched_setscheduler);
3671 int sched_setattr(struct task_struct *p, const struct sched_attr *attr)
3673 return __sched_setscheduler(p, attr, true);
3675 EXPORT_SYMBOL_GPL(sched_setattr);
3678 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
3679 * @p: the task in question.
3680 * @policy: new policy.
3681 * @param: structure containing the new RT priority.
3683 * Just like sched_setscheduler, only don't bother checking if the
3684 * current context has permission. For example, this is needed in
3685 * stop_machine(): we create temporary high priority worker threads,
3686 * but our caller might not have that capability.
3688 * Return: 0 on success. An error code otherwise.
3690 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
3691 const struct sched_param *param)
3693 return _sched_setscheduler(p, policy, param, false);
3697 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
3699 struct sched_param lparam;
3700 struct task_struct *p;
3703 if (!param || pid < 0)
3705 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
3710 p = find_process_by_pid(pid);
3712 retval = sched_setscheduler(p, policy, &lparam);
3719 * Mimics kernel/events/core.c perf_copy_attr().
3721 static int sched_copy_attr(struct sched_attr __user *uattr,
3722 struct sched_attr *attr)
3727 if (!access_ok(VERIFY_WRITE, uattr, SCHED_ATTR_SIZE_VER0))
3731 * zero the full structure, so that a short copy will be nice.
3733 memset(attr, 0, sizeof(*attr));
3735 ret = get_user(size, &uattr->size);
3739 if (size > PAGE_SIZE) /* silly large */
3742 if (!size) /* abi compat */
3743 size = SCHED_ATTR_SIZE_VER0;
3745 if (size < SCHED_ATTR_SIZE_VER0)
3749 * If we're handed a bigger struct than we know of,
3750 * ensure all the unknown bits are 0 - i.e. new
3751 * user-space does not rely on any kernel feature
3752 * extensions we dont know about yet.
3754 if (size > sizeof(*attr)) {
3755 unsigned char __user *addr;
3756 unsigned char __user *end;
3759 addr = (void __user *)uattr + sizeof(*attr);
3760 end = (void __user *)uattr + size;
3762 for (; addr < end; addr++) {
3763 ret = get_user(val, addr);
3769 size = sizeof(*attr);
3772 ret = copy_from_user(attr, uattr, size);
3777 * XXX: do we want to be lenient like existing syscalls; or do we want
3778 * to be strict and return an error on out-of-bounds values?
3780 attr->sched_nice = clamp(attr->sched_nice, MIN_NICE, MAX_NICE);
3785 put_user(sizeof(*attr), &uattr->size);
3790 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
3791 * @pid: the pid in question.
3792 * @policy: new policy.
3793 * @param: structure containing the new RT priority.
3795 * Return: 0 on success. An error code otherwise.
3797 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
3798 struct sched_param __user *, param)
3800 /* negative values for policy are not valid */
3804 return do_sched_setscheduler(pid, policy, param);
3808 * sys_sched_setparam - set/change the RT priority of a thread
3809 * @pid: the pid in question.
3810 * @param: structure containing the new RT priority.
3812 * Return: 0 on success. An error code otherwise.
3814 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
3816 return do_sched_setscheduler(pid, SETPARAM_POLICY, param);
3820 * sys_sched_setattr - same as above, but with extended sched_attr
3821 * @pid: the pid in question.
3822 * @uattr: structure containing the extended parameters.
3823 * @flags: for future extension.
3825 SYSCALL_DEFINE3(sched_setattr, pid_t, pid, struct sched_attr __user *, uattr,
3826 unsigned int, flags)
3828 struct sched_attr attr;
3829 struct task_struct *p;
3832 if (!uattr || pid < 0 || flags)
3835 retval = sched_copy_attr(uattr, &attr);
3839 if ((int)attr.sched_policy < 0)
3844 p = find_process_by_pid(pid);
3846 retval = sched_setattr(p, &attr);
3853 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
3854 * @pid: the pid in question.
3856 * Return: On success, the policy of the thread. Otherwise, a negative error
3859 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
3861 struct task_struct *p;
3869 p = find_process_by_pid(pid);
3871 retval = security_task_getscheduler(p);
3874 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
3881 * sys_sched_getparam - get the RT priority of a thread
3882 * @pid: the pid in question.
3883 * @param: structure containing the RT priority.
3885 * Return: On success, 0 and the RT priority is in @param. Otherwise, an error
3888 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
3890 struct sched_param lp = { .sched_priority = 0 };
3891 struct task_struct *p;
3894 if (!param || pid < 0)
3898 p = find_process_by_pid(pid);
3903 retval = security_task_getscheduler(p);
3907 if (task_has_rt_policy(p))
3908 lp.sched_priority = p->rt_priority;
3912 * This one might sleep, we cannot do it with a spinlock held ...
3914 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
3923 static int sched_read_attr(struct sched_attr __user *uattr,
3924 struct sched_attr *attr,
3929 if (!access_ok(VERIFY_WRITE, uattr, usize))
3933 * If we're handed a smaller struct than we know of,
3934 * ensure all the unknown bits are 0 - i.e. old
3935 * user-space does not get uncomplete information.
3937 if (usize < sizeof(*attr)) {
3938 unsigned char *addr;
3941 addr = (void *)attr + usize;
3942 end = (void *)attr + sizeof(*attr);
3944 for (; addr < end; addr++) {
3952 ret = copy_to_user(uattr, attr, attr->size);
3960 * sys_sched_getattr - similar to sched_getparam, but with sched_attr
3961 * @pid: the pid in question.
3962 * @uattr: structure containing the extended parameters.
3963 * @size: sizeof(attr) for fwd/bwd comp.
3964 * @flags: for future extension.
3966 SYSCALL_DEFINE4(sched_getattr, pid_t, pid, struct sched_attr __user *, uattr,
3967 unsigned int, size, unsigned int, flags)
3969 struct sched_attr attr = {
3970 .size = sizeof(struct sched_attr),
3972 struct task_struct *p;
3975 if (!uattr || pid < 0 || size > PAGE_SIZE ||
3976 size < SCHED_ATTR_SIZE_VER0 || flags)
3980 p = find_process_by_pid(pid);
3985 retval = security_task_getscheduler(p);
3989 attr.sched_policy = p->policy;
3990 if (p->sched_reset_on_fork)
3991 attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
3992 if (task_has_dl_policy(p))
3993 __getparam_dl(p, &attr);
3994 else if (task_has_rt_policy(p))
3995 attr.sched_priority = p->rt_priority;
3997 attr.sched_nice = task_nice(p);
4001 retval = sched_read_attr(uattr, &attr, size);
4009 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4011 cpumask_var_t cpus_allowed, new_mask;
4012 struct task_struct *p;
4017 p = find_process_by_pid(pid);
4023 /* Prevent p going away */
4027 if (p->flags & PF_NO_SETAFFINITY) {
4031 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4035 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4037 goto out_free_cpus_allowed;
4040 if (!check_same_owner(p)) {
4042 if (!ns_capable(__task_cred(p)->user_ns, CAP_SYS_NICE)) {
4044 goto out_free_new_mask;
4049 retval = security_task_setscheduler(p);
4051 goto out_free_new_mask;
4054 cpuset_cpus_allowed(p, cpus_allowed);
4055 cpumask_and(new_mask, in_mask, cpus_allowed);
4058 * Since bandwidth control happens on root_domain basis,
4059 * if admission test is enabled, we only admit -deadline
4060 * tasks allowed to run on all the CPUs in the task's
4064 if (task_has_dl_policy(p) && dl_bandwidth_enabled()) {
4066 if (!cpumask_subset(task_rq(p)->rd->span, new_mask)) {
4069 goto out_free_new_mask;
4075 retval = set_cpus_allowed_ptr(p, new_mask);
4078 cpuset_cpus_allowed(p, cpus_allowed);
4079 if (!cpumask_subset(new_mask, cpus_allowed)) {
4081 * We must have raced with a concurrent cpuset
4082 * update. Just reset the cpus_allowed to the
4083 * cpuset's cpus_allowed
4085 cpumask_copy(new_mask, cpus_allowed);
4090 free_cpumask_var(new_mask);
4091 out_free_cpus_allowed:
4092 free_cpumask_var(cpus_allowed);
4098 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4099 struct cpumask *new_mask)
4101 if (len < cpumask_size())
4102 cpumask_clear(new_mask);
4103 else if (len > cpumask_size())
4104 len = cpumask_size();
4106 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4110 * sys_sched_setaffinity - set the cpu affinity of a process
4111 * @pid: pid of the process
4112 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4113 * @user_mask_ptr: user-space pointer to the new cpu mask
4115 * Return: 0 on success. An error code otherwise.
4117 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4118 unsigned long __user *, user_mask_ptr)
4120 cpumask_var_t new_mask;
4123 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4126 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4128 retval = sched_setaffinity(pid, new_mask);
4129 free_cpumask_var(new_mask);
4133 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4135 struct task_struct *p;
4136 unsigned long flags;
4142 p = find_process_by_pid(pid);
4146 retval = security_task_getscheduler(p);
4150 raw_spin_lock_irqsave(&p->pi_lock, flags);
4151 cpumask_and(mask, &p->cpus_allowed, cpu_active_mask);
4152 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4161 * sys_sched_getaffinity - get the cpu affinity of a process
4162 * @pid: pid of the process
4163 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4164 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4166 * Return: 0 on success. An error code otherwise.
4168 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4169 unsigned long __user *, user_mask_ptr)
4174 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
4176 if (len & (sizeof(unsigned long)-1))
4179 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4182 ret = sched_getaffinity(pid, mask);
4184 size_t retlen = min_t(size_t, len, cpumask_size());
4186 if (copy_to_user(user_mask_ptr, mask, retlen))
4191 free_cpumask_var(mask);
4197 * sys_sched_yield - yield the current processor to other threads.
4199 * This function yields the current CPU to other tasks. If there are no
4200 * other threads running on this CPU then this function will return.
4204 SYSCALL_DEFINE0(sched_yield)
4206 struct rq *rq = this_rq_lock();
4208 schedstat_inc(rq, yld_count);
4209 current->sched_class->yield_task(rq);
4212 * Since we are going to call schedule() anyway, there's
4213 * no need to preempt or enable interrupts:
4215 __release(rq->lock);
4216 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4217 do_raw_spin_unlock(&rq->lock);
4218 sched_preempt_enable_no_resched();
4225 static void __cond_resched(void)
4227 __preempt_count_add(PREEMPT_ACTIVE);
4229 __preempt_count_sub(PREEMPT_ACTIVE);
4232 int __sched _cond_resched(void)
4234 if (should_resched()) {
4240 EXPORT_SYMBOL(_cond_resched);
4243 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4244 * call schedule, and on return reacquire the lock.
4246 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4247 * operations here to prevent schedule() from being called twice (once via
4248 * spin_unlock(), once by hand).
4250 int __cond_resched_lock(spinlock_t *lock)
4252 int resched = should_resched();
4255 lockdep_assert_held(lock);
4257 if (spin_needbreak(lock) || resched) {
4268 EXPORT_SYMBOL(__cond_resched_lock);
4270 int __sched __cond_resched_softirq(void)
4272 BUG_ON(!in_softirq());
4274 if (should_resched()) {
4282 EXPORT_SYMBOL(__cond_resched_softirq);
4285 * yield - yield the current processor to other threads.
4287 * Do not ever use this function, there's a 99% chance you're doing it wrong.
4289 * The scheduler is at all times free to pick the calling task as the most
4290 * eligible task to run, if removing the yield() call from your code breaks
4291 * it, its already broken.
4293 * Typical broken usage is:
4298 * where one assumes that yield() will let 'the other' process run that will
4299 * make event true. If the current task is a SCHED_FIFO task that will never
4300 * happen. Never use yield() as a progress guarantee!!
4302 * If you want to use yield() to wait for something, use wait_event().
4303 * If you want to use yield() to be 'nice' for others, use cond_resched().
4304 * If you still want to use yield(), do not!
4306 void __sched yield(void)
4308 set_current_state(TASK_RUNNING);
4311 EXPORT_SYMBOL(yield);
4314 * yield_to - yield the current processor to another thread in
4315 * your thread group, or accelerate that thread toward the
4316 * processor it's on.
4318 * @preempt: whether task preemption is allowed or not
4320 * It's the caller's job to ensure that the target task struct
4321 * can't go away on us before we can do any checks.
4324 * true (>0) if we indeed boosted the target task.
4325 * false (0) if we failed to boost the target.
4326 * -ESRCH if there's no task to yield to.
4328 int __sched yield_to(struct task_struct *p, bool preempt)
4330 struct task_struct *curr = current;
4331 struct rq *rq, *p_rq;
4332 unsigned long flags;
4335 local_irq_save(flags);
4341 * If we're the only runnable task on the rq and target rq also
4342 * has only one task, there's absolutely no point in yielding.
4344 if (rq->nr_running == 1 && p_rq->nr_running == 1) {
4349 double_rq_lock(rq, p_rq);
4350 if (task_rq(p) != p_rq) {
4351 double_rq_unlock(rq, p_rq);
4355 if (!curr->sched_class->yield_to_task)
4358 if (curr->sched_class != p->sched_class)
4361 if (task_running(p_rq, p) || p->state)
4364 yielded = curr->sched_class->yield_to_task(rq, p, preempt);
4366 schedstat_inc(rq, yld_count);
4368 * Make p's CPU reschedule; pick_next_entity takes care of
4371 if (preempt && rq != p_rq)
4376 double_rq_unlock(rq, p_rq);
4378 local_irq_restore(flags);
4385 EXPORT_SYMBOL_GPL(yield_to);
4388 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
4389 * that process accounting knows that this is a task in IO wait state.
4391 void __sched io_schedule(void)
4393 struct rq *rq = raw_rq();
4395 delayacct_blkio_start();
4396 atomic_inc(&rq->nr_iowait);
4397 blk_flush_plug(current);
4398 current->in_iowait = 1;
4400 current->in_iowait = 0;
4401 atomic_dec(&rq->nr_iowait);
4402 delayacct_blkio_end();
4404 EXPORT_SYMBOL(io_schedule);
4406 long __sched io_schedule_timeout(long timeout)
4408 struct rq *rq = raw_rq();
4411 delayacct_blkio_start();
4412 atomic_inc(&rq->nr_iowait);
4413 blk_flush_plug(current);
4414 current->in_iowait = 1;
4415 ret = schedule_timeout(timeout);
4416 current->in_iowait = 0;
4417 atomic_dec(&rq->nr_iowait);
4418 delayacct_blkio_end();
4423 * sys_sched_get_priority_max - return maximum RT priority.
4424 * @policy: scheduling class.
4426 * Return: On success, this syscall returns the maximum
4427 * rt_priority that can be used by a given scheduling class.
4428 * On failure, a negative error code is returned.
4430 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
4437 ret = MAX_USER_RT_PRIO-1;
4439 case SCHED_DEADLINE:
4450 * sys_sched_get_priority_min - return minimum RT priority.
4451 * @policy: scheduling class.
4453 * Return: On success, this syscall returns the minimum
4454 * rt_priority that can be used by a given scheduling class.
4455 * On failure, a negative error code is returned.
4457 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
4466 case SCHED_DEADLINE:
4476 * sys_sched_rr_get_interval - return the default timeslice of a process.
4477 * @pid: pid of the process.
4478 * @interval: userspace pointer to the timeslice value.
4480 * this syscall writes the default timeslice value of a given process
4481 * into the user-space timespec buffer. A value of '0' means infinity.
4483 * Return: On success, 0 and the timeslice is in @interval. Otherwise,
4486 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
4487 struct timespec __user *, interval)
4489 struct task_struct *p;
4490 unsigned int time_slice;
4491 unsigned long flags;
4501 p = find_process_by_pid(pid);
4505 retval = security_task_getscheduler(p);
4509 rq = task_rq_lock(p, &flags);
4511 if (p->sched_class->get_rr_interval)
4512 time_slice = p->sched_class->get_rr_interval(rq, p);
4513 task_rq_unlock(rq, p, &flags);
4516 jiffies_to_timespec(time_slice, &t);
4517 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
4525 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
4527 void sched_show_task(struct task_struct *p)
4529 unsigned long free = 0;
4533 state = p->state ? __ffs(p->state) + 1 : 0;
4534 printk(KERN_INFO "%-15.15s %c", p->comm,
4535 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
4536 #if BITS_PER_LONG == 32
4537 if (state == TASK_RUNNING)
4538 printk(KERN_CONT " running ");
4540 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
4542 if (state == TASK_RUNNING)
4543 printk(KERN_CONT " running task ");
4545 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
4547 #ifdef CONFIG_DEBUG_STACK_USAGE
4548 free = stack_not_used(p);
4551 ppid = task_pid_nr(rcu_dereference(p->real_parent));
4553 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
4554 task_pid_nr(p), ppid,
4555 (unsigned long)task_thread_info(p)->flags);
4557 print_worker_info(KERN_INFO, p);
4558 show_stack(p, NULL);
4561 void show_state_filter(unsigned long state_filter)
4563 struct task_struct *g, *p;
4565 #if BITS_PER_LONG == 32
4567 " task PC stack pid father\n");
4570 " task PC stack pid father\n");
4573 for_each_process_thread(g, p) {
4575 * reset the NMI-timeout, listing all files on a slow
4576 * console might take a lot of time:
4578 touch_nmi_watchdog();
4579 if (!state_filter || (p->state & state_filter))
4583 touch_all_softlockup_watchdogs();
4585 #ifdef CONFIG_SCHED_DEBUG
4586 sysrq_sched_debug_show();
4590 * Only show locks if all tasks are dumped:
4593 debug_show_all_locks();
4596 void init_idle_bootup_task(struct task_struct *idle)
4598 idle->sched_class = &idle_sched_class;
4602 * init_idle - set up an idle thread for a given CPU
4603 * @idle: task in question
4604 * @cpu: cpu the idle task belongs to
4606 * NOTE: this function does not set the idle thread's NEED_RESCHED
4607 * flag, to make booting more robust.
4609 void init_idle(struct task_struct *idle, int cpu)
4611 struct rq *rq = cpu_rq(cpu);
4612 unsigned long flags;
4614 raw_spin_lock_irqsave(&rq->lock, flags);
4616 __sched_fork(0, idle);
4617 idle->state = TASK_RUNNING;
4618 idle->se.exec_start = sched_clock();
4620 do_set_cpus_allowed(idle, cpumask_of(cpu));
4622 * We're having a chicken and egg problem, even though we are
4623 * holding rq->lock, the cpu isn't yet set to this cpu so the
4624 * lockdep check in task_group() will fail.
4626 * Similar case to sched_fork(). / Alternatively we could
4627 * use task_rq_lock() here and obtain the other rq->lock.
4632 __set_task_cpu(idle, cpu);
4635 rq->curr = rq->idle = idle;
4636 idle->on_rq = TASK_ON_RQ_QUEUED;
4637 #if defined(CONFIG_SMP)
4640 raw_spin_unlock_irqrestore(&rq->lock, flags);
4642 /* Set the preempt count _outside_ the spinlocks! */
4643 init_idle_preempt_count(idle, cpu);
4646 * The idle tasks have their own, simple scheduling class:
4648 idle->sched_class = &idle_sched_class;
4649 ftrace_graph_init_idle_task(idle, cpu);
4650 vtime_init_idle(idle, cpu);
4651 #if defined(CONFIG_SMP)
4652 sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu);
4658 * move_queued_task - move a queued task to new rq.
4660 * Returns (locked) new rq. Old rq's lock is released.
4662 static struct rq *move_queued_task(struct task_struct *p, int new_cpu)
4664 struct rq *rq = task_rq(p);
4666 lockdep_assert_held(&rq->lock);
4668 dequeue_task(rq, p, 0);
4669 p->on_rq = TASK_ON_RQ_MIGRATING;
4670 set_task_cpu(p, new_cpu);
4671 raw_spin_unlock(&rq->lock);
4673 rq = cpu_rq(new_cpu);
4675 raw_spin_lock(&rq->lock);
4676 BUG_ON(task_cpu(p) != new_cpu);
4677 p->on_rq = TASK_ON_RQ_QUEUED;
4678 enqueue_task(rq, p, 0);
4679 check_preempt_curr(rq, p, 0);
4684 void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask)
4686 if (p->sched_class && p->sched_class->set_cpus_allowed)
4687 p->sched_class->set_cpus_allowed(p, new_mask);
4689 cpumask_copy(&p->cpus_allowed, new_mask);
4690 p->nr_cpus_allowed = cpumask_weight(new_mask);
4694 * This is how migration works:
4696 * 1) we invoke migration_cpu_stop() on the target CPU using
4698 * 2) stopper starts to run (implicitly forcing the migrated thread
4700 * 3) it checks whether the migrated task is still in the wrong runqueue.
4701 * 4) if it's in the wrong runqueue then the migration thread removes
4702 * it and puts it into the right queue.
4703 * 5) stopper completes and stop_one_cpu() returns and the migration
4708 * Change a given task's CPU affinity. Migrate the thread to a
4709 * proper CPU and schedule it away if the CPU it's executing on
4710 * is removed from the allowed bitmask.
4712 * NOTE: the caller must have a valid reference to the task, the
4713 * task must not exit() & deallocate itself prematurely. The
4714 * call is not atomic; no spinlocks may be held.
4716 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
4718 unsigned long flags;
4720 unsigned int dest_cpu;
4723 rq = task_rq_lock(p, &flags);
4725 if (cpumask_equal(&p->cpus_allowed, new_mask))
4728 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
4733 do_set_cpus_allowed(p, new_mask);
4735 /* Can the task run on the task's current CPU? If so, we're done */
4736 if (cpumask_test_cpu(task_cpu(p), new_mask))
4739 dest_cpu = cpumask_any_and(cpu_active_mask, new_mask);
4740 if (task_running(rq, p) || p->state == TASK_WAKING) {
4741 struct migration_arg arg = { p, dest_cpu };
4742 /* Need help from migration thread: drop lock and wait. */
4743 task_rq_unlock(rq, p, &flags);
4744 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
4745 tlb_migrate_finish(p->mm);
4747 } else if (task_on_rq_queued(p))
4748 rq = move_queued_task(p, dest_cpu);
4750 task_rq_unlock(rq, p, &flags);
4754 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
4757 * Move (not current) task off this cpu, onto dest cpu. We're doing
4758 * this because either it can't run here any more (set_cpus_allowed()
4759 * away from this CPU, or CPU going down), or because we're
4760 * attempting to rebalance this task on exec (sched_exec).
4762 * So we race with normal scheduler movements, but that's OK, as long
4763 * as the task is no longer on this CPU.
4765 * Returns non-zero if task was successfully migrated.
4767 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
4772 if (unlikely(!cpu_active(dest_cpu)))
4775 rq = cpu_rq(src_cpu);
4777 raw_spin_lock(&p->pi_lock);
4778 raw_spin_lock(&rq->lock);
4779 /* Already moved. */
4780 if (task_cpu(p) != src_cpu)
4783 /* Affinity changed (again). */
4784 if (!cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
4788 * If we're not on a rq, the next wake-up will ensure we're
4791 if (task_on_rq_queued(p))
4792 rq = move_queued_task(p, dest_cpu);
4796 raw_spin_unlock(&rq->lock);
4797 raw_spin_unlock(&p->pi_lock);
4801 #ifdef CONFIG_NUMA_BALANCING
4802 /* Migrate current task p to target_cpu */
4803 int migrate_task_to(struct task_struct *p, int target_cpu)
4805 struct migration_arg arg = { p, target_cpu };
4806 int curr_cpu = task_cpu(p);
4808 if (curr_cpu == target_cpu)
4811 if (!cpumask_test_cpu(target_cpu, tsk_cpus_allowed(p)))
4814 /* TODO: This is not properly updating schedstats */
4816 trace_sched_move_numa(p, curr_cpu, target_cpu);
4817 return stop_one_cpu(curr_cpu, migration_cpu_stop, &arg);
4821 * Requeue a task on a given node and accurately track the number of NUMA
4822 * tasks on the runqueues
4824 void sched_setnuma(struct task_struct *p, int nid)
4827 unsigned long flags;
4828 bool queued, running;
4830 rq = task_rq_lock(p, &flags);
4831 queued = task_on_rq_queued(p);
4832 running = task_current(rq, p);
4835 dequeue_task(rq, p, 0);
4837 put_prev_task(rq, p);
4839 p->numa_preferred_nid = nid;
4842 p->sched_class->set_curr_task(rq);
4844 enqueue_task(rq, p, 0);
4845 task_rq_unlock(rq, p, &flags);
4850 * migration_cpu_stop - this will be executed by a highprio stopper thread
4851 * and performs thread migration by bumping thread off CPU then
4852 * 'pushing' onto another runqueue.
4854 static int migration_cpu_stop(void *data)
4856 struct migration_arg *arg = data;
4859 * The original target cpu might have gone down and we might
4860 * be on another cpu but it doesn't matter.
4862 local_irq_disable();
4864 * We need to explicitly wake pending tasks before running
4865 * __migrate_task() such that we will not miss enforcing cpus_allowed
4866 * during wakeups, see set_cpus_allowed_ptr()'s TASK_WAKING test.
4868 sched_ttwu_pending();
4869 __migrate_task(arg->task, raw_smp_processor_id(), arg->dest_cpu);
4874 #ifdef CONFIG_HOTPLUG_CPU
4877 * Ensures that the idle task is using init_mm right before its cpu goes
4880 void idle_task_exit(void)
4882 struct mm_struct *mm = current->active_mm;
4884 BUG_ON(cpu_online(smp_processor_id()));
4886 if (mm != &init_mm) {
4887 switch_mm(mm, &init_mm, current);
4888 finish_arch_post_lock_switch();
4894 * Since this CPU is going 'away' for a while, fold any nr_active delta
4895 * we might have. Assumes we're called after migrate_tasks() so that the
4896 * nr_active count is stable.
4898 * Also see the comment "Global load-average calculations".
4900 static void calc_load_migrate(struct rq *rq)
4902 long delta = calc_load_fold_active(rq);
4904 atomic_long_add(delta, &calc_load_tasks);
4907 static void put_prev_task_fake(struct rq *rq, struct task_struct *prev)
4911 static const struct sched_class fake_sched_class = {
4912 .put_prev_task = put_prev_task_fake,
4915 static struct task_struct fake_task = {
4917 * Avoid pull_{rt,dl}_task()
4919 .prio = MAX_PRIO + 1,
4920 .sched_class = &fake_sched_class,
4924 * Migrate all tasks from the rq, sleeping tasks will be migrated by
4925 * try_to_wake_up()->select_task_rq().
4927 * Called with rq->lock held even though we'er in stop_machine() and
4928 * there's no concurrency possible, we hold the required locks anyway
4929 * because of lock validation efforts.
4931 static void migrate_tasks(unsigned int dead_cpu)
4933 struct rq *rq = cpu_rq(dead_cpu);
4934 struct task_struct *next, *stop = rq->stop;
4938 * Fudge the rq selection such that the below task selection loop
4939 * doesn't get stuck on the currently eligible stop task.
4941 * We're currently inside stop_machine() and the rq is either stuck
4942 * in the stop_machine_cpu_stop() loop, or we're executing this code,
4943 * either way we should never end up calling schedule() until we're
4949 * put_prev_task() and pick_next_task() sched
4950 * class method both need to have an up-to-date
4951 * value of rq->clock[_task]
4953 update_rq_clock(rq);
4957 * There's this thread running, bail when that's the only
4960 if (rq->nr_running == 1)
4963 next = pick_next_task(rq, &fake_task);
4965 next->sched_class->put_prev_task(rq, next);
4967 /* Find suitable destination for @next, with force if needed. */
4968 dest_cpu = select_fallback_rq(dead_cpu, next);
4969 raw_spin_unlock(&rq->lock);
4971 __migrate_task(next, dead_cpu, dest_cpu);
4973 raw_spin_lock(&rq->lock);
4979 #endif /* CONFIG_HOTPLUG_CPU */
4981 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
4983 static struct ctl_table sd_ctl_dir[] = {
4985 .procname = "sched_domain",
4991 static struct ctl_table sd_ctl_root[] = {
4993 .procname = "kernel",
4995 .child = sd_ctl_dir,
5000 static struct ctl_table *sd_alloc_ctl_entry(int n)
5002 struct ctl_table *entry =
5003 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
5008 static void sd_free_ctl_entry(struct ctl_table **tablep)
5010 struct ctl_table *entry;
5013 * In the intermediate directories, both the child directory and
5014 * procname are dynamically allocated and could fail but the mode
5015 * will always be set. In the lowest directory the names are
5016 * static strings and all have proc handlers.
5018 for (entry = *tablep; entry->mode; entry++) {
5020 sd_free_ctl_entry(&entry->child);
5021 if (entry->proc_handler == NULL)
5022 kfree(entry->procname);
5029 static int min_load_idx = 0;
5030 static int max_load_idx = CPU_LOAD_IDX_MAX-1;
5033 set_table_entry(struct ctl_table *entry,
5034 const char *procname, void *data, int maxlen,
5035 umode_t mode, proc_handler *proc_handler,
5038 entry->procname = procname;
5040 entry->maxlen = maxlen;
5042 entry->proc_handler = proc_handler;
5045 entry->extra1 = &min_load_idx;
5046 entry->extra2 = &max_load_idx;
5050 static struct ctl_table *
5051 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5053 struct ctl_table *table = sd_alloc_ctl_entry(14);
5058 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5059 sizeof(long), 0644, proc_doulongvec_minmax, false);
5060 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5061 sizeof(long), 0644, proc_doulongvec_minmax, false);
5062 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5063 sizeof(int), 0644, proc_dointvec_minmax, true);
5064 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5065 sizeof(int), 0644, proc_dointvec_minmax, true);
5066 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5067 sizeof(int), 0644, proc_dointvec_minmax, true);
5068 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5069 sizeof(int), 0644, proc_dointvec_minmax, true);
5070 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5071 sizeof(int), 0644, proc_dointvec_minmax, true);
5072 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5073 sizeof(int), 0644, proc_dointvec_minmax, false);
5074 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5075 sizeof(int), 0644, proc_dointvec_minmax, false);
5076 set_table_entry(&table[9], "cache_nice_tries",
5077 &sd->cache_nice_tries,
5078 sizeof(int), 0644, proc_dointvec_minmax, false);
5079 set_table_entry(&table[10], "flags", &sd->flags,
5080 sizeof(int), 0644, proc_dointvec_minmax, false);
5081 set_table_entry(&table[11], "max_newidle_lb_cost",
5082 &sd->max_newidle_lb_cost,
5083 sizeof(long), 0644, proc_doulongvec_minmax, false);
5084 set_table_entry(&table[12], "name", sd->name,
5085 CORENAME_MAX_SIZE, 0444, proc_dostring, false);
5086 /* &table[13] is terminator */
5091 static struct ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5093 struct ctl_table *entry, *table;
5094 struct sched_domain *sd;
5095 int domain_num = 0, i;
5098 for_each_domain(cpu, sd)
5100 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5105 for_each_domain(cpu, sd) {
5106 snprintf(buf, 32, "domain%d", i);
5107 entry->procname = kstrdup(buf, GFP_KERNEL);
5109 entry->child = sd_alloc_ctl_domain_table(sd);
5116 static struct ctl_table_header *sd_sysctl_header;
5117 static void register_sched_domain_sysctl(void)
5119 int i, cpu_num = num_possible_cpus();
5120 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5123 WARN_ON(sd_ctl_dir[0].child);
5124 sd_ctl_dir[0].child = entry;
5129 for_each_possible_cpu(i) {
5130 snprintf(buf, 32, "cpu%d", i);
5131 entry->procname = kstrdup(buf, GFP_KERNEL);
5133 entry->child = sd_alloc_ctl_cpu_table(i);
5137 WARN_ON(sd_sysctl_header);
5138 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5141 /* may be called multiple times per register */
5142 static void unregister_sched_domain_sysctl(void)
5144 if (sd_sysctl_header)
5145 unregister_sysctl_table(sd_sysctl_header);
5146 sd_sysctl_header = NULL;
5147 if (sd_ctl_dir[0].child)
5148 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5151 static void register_sched_domain_sysctl(void)
5154 static void unregister_sched_domain_sysctl(void)
5159 static void set_rq_online(struct rq *rq)
5162 const struct sched_class *class;
5164 cpumask_set_cpu(rq->cpu, rq->rd->online);
5167 for_each_class(class) {
5168 if (class->rq_online)
5169 class->rq_online(rq);
5174 static void set_rq_offline(struct rq *rq)
5177 const struct sched_class *class;
5179 for_each_class(class) {
5180 if (class->rq_offline)
5181 class->rq_offline(rq);
5184 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5190 * migration_call - callback that gets triggered when a CPU is added.
5191 * Here we can start up the necessary migration thread for the new CPU.
5194 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5196 int cpu = (long)hcpu;
5197 unsigned long flags;
5198 struct rq *rq = cpu_rq(cpu);
5200 switch (action & ~CPU_TASKS_FROZEN) {
5202 case CPU_UP_PREPARE:
5203 rq->calc_load_update = calc_load_update;
5207 /* Update our root-domain */
5208 raw_spin_lock_irqsave(&rq->lock, flags);
5210 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5214 raw_spin_unlock_irqrestore(&rq->lock, flags);
5217 #ifdef CONFIG_HOTPLUG_CPU
5219 sched_ttwu_pending();
5220 /* Update our root-domain */
5221 raw_spin_lock_irqsave(&rq->lock, flags);
5223 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5227 BUG_ON(rq->nr_running != 1); /* the migration thread */
5228 raw_spin_unlock_irqrestore(&rq->lock, flags);
5232 calc_load_migrate(rq);
5237 update_max_interval();
5243 * Register at high priority so that task migration (migrate_all_tasks)
5244 * happens before everything else. This has to be lower priority than
5245 * the notifier in the perf_event subsystem, though.
5247 static struct notifier_block migration_notifier = {
5248 .notifier_call = migration_call,
5249 .priority = CPU_PRI_MIGRATION,
5252 static void __cpuinit set_cpu_rq_start_time(void)
5254 int cpu = smp_processor_id();
5255 struct rq *rq = cpu_rq(cpu);
5256 rq->age_stamp = sched_clock_cpu(cpu);
5259 static int sched_cpu_active(struct notifier_block *nfb,
5260 unsigned long action, void *hcpu)
5262 switch (action & ~CPU_TASKS_FROZEN) {
5264 set_cpu_rq_start_time();
5266 case CPU_DOWN_FAILED:
5267 set_cpu_active((long)hcpu, true);
5274 static int sched_cpu_inactive(struct notifier_block *nfb,
5275 unsigned long action, void *hcpu)
5277 unsigned long flags;
5278 long cpu = (long)hcpu;
5281 switch (action & ~CPU_TASKS_FROZEN) {
5282 case CPU_DOWN_PREPARE:
5283 set_cpu_active(cpu, false);
5285 /* explicitly allow suspend */
5286 if (!(action & CPU_TASKS_FROZEN)) {
5290 rcu_read_lock_sched();
5291 dl_b = dl_bw_of(cpu);
5293 raw_spin_lock_irqsave(&dl_b->lock, flags);
5294 cpus = dl_bw_cpus(cpu);
5295 overflow = __dl_overflow(dl_b, cpus, 0, 0);
5296 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
5298 rcu_read_unlock_sched();
5301 return notifier_from_errno(-EBUSY);
5309 static int __init migration_init(void)
5311 void *cpu = (void *)(long)smp_processor_id();
5314 /* Initialize migration for the boot CPU */
5315 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
5316 BUG_ON(err == NOTIFY_BAD);
5317 migration_call(&migration_notifier, CPU_ONLINE, cpu);
5318 register_cpu_notifier(&migration_notifier);
5320 /* Register cpu active notifiers */
5321 cpu_notifier(sched_cpu_active, CPU_PRI_SCHED_ACTIVE);
5322 cpu_notifier(sched_cpu_inactive, CPU_PRI_SCHED_INACTIVE);
5326 early_initcall(migration_init);
5331 static cpumask_var_t sched_domains_tmpmask; /* sched_domains_mutex */
5333 #ifdef CONFIG_SCHED_DEBUG
5335 static __read_mostly int sched_debug_enabled;
5337 static int __init sched_debug_setup(char *str)
5339 sched_debug_enabled = 1;
5343 early_param("sched_debug", sched_debug_setup);
5345 static inline bool sched_debug(void)
5347 return sched_debug_enabled;
5350 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5351 struct cpumask *groupmask)
5353 struct sched_group *group = sd->groups;
5356 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
5357 cpumask_clear(groupmask);
5359 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5361 if (!(sd->flags & SD_LOAD_BALANCE)) {
5362 printk("does not load-balance\n");
5364 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5369 printk(KERN_CONT "span %s level %s\n", str, sd->name);
5371 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5372 printk(KERN_ERR "ERROR: domain->span does not contain "
5375 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5376 printk(KERN_ERR "ERROR: domain->groups does not contain"
5380 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5384 printk(KERN_ERR "ERROR: group is NULL\n");
5389 * Even though we initialize ->capacity to something semi-sane,
5390 * we leave capacity_orig unset. This allows us to detect if
5391 * domain iteration is still funny without causing /0 traps.
5393 if (!group->sgc->capacity_orig) {
5394 printk(KERN_CONT "\n");
5395 printk(KERN_ERR "ERROR: domain->cpu_capacity not set\n");
5399 if (!cpumask_weight(sched_group_cpus(group))) {
5400 printk(KERN_CONT "\n");
5401 printk(KERN_ERR "ERROR: empty group\n");
5405 if (!(sd->flags & SD_OVERLAP) &&
5406 cpumask_intersects(groupmask, sched_group_cpus(group))) {
5407 printk(KERN_CONT "\n");
5408 printk(KERN_ERR "ERROR: repeated CPUs\n");
5412 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
5414 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
5416 printk(KERN_CONT " %s", str);
5417 if (group->sgc->capacity != SCHED_CAPACITY_SCALE) {
5418 printk(KERN_CONT " (cpu_capacity = %d)",
5419 group->sgc->capacity);
5422 group = group->next;
5423 } while (group != sd->groups);
5424 printk(KERN_CONT "\n");
5426 if (!cpumask_equal(sched_domain_span(sd), groupmask))
5427 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
5430 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
5431 printk(KERN_ERR "ERROR: parent span is not a superset "
5432 "of domain->span\n");
5436 static void sched_domain_debug(struct sched_domain *sd, int cpu)
5440 if (!sched_debug_enabled)
5444 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
5448 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
5451 if (sched_domain_debug_one(sd, cpu, level, sched_domains_tmpmask))
5459 #else /* !CONFIG_SCHED_DEBUG */
5460 # define sched_domain_debug(sd, cpu) do { } while (0)
5461 static inline bool sched_debug(void)
5465 #endif /* CONFIG_SCHED_DEBUG */
5467 static int sd_degenerate(struct sched_domain *sd)
5469 if (cpumask_weight(sched_domain_span(sd)) == 1)
5472 /* Following flags need at least 2 groups */
5473 if (sd->flags & (SD_LOAD_BALANCE |
5474 SD_BALANCE_NEWIDLE |
5477 SD_SHARE_CPUCAPACITY |
5478 SD_SHARE_PKG_RESOURCES |
5479 SD_SHARE_POWERDOMAIN)) {
5480 if (sd->groups != sd->groups->next)
5484 /* Following flags don't use groups */
5485 if (sd->flags & (SD_WAKE_AFFINE))
5492 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
5494 unsigned long cflags = sd->flags, pflags = parent->flags;
5496 if (sd_degenerate(parent))
5499 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
5502 /* Flags needing groups don't count if only 1 group in parent */
5503 if (parent->groups == parent->groups->next) {
5504 pflags &= ~(SD_LOAD_BALANCE |
5505 SD_BALANCE_NEWIDLE |
5508 SD_SHARE_CPUCAPACITY |
5509 SD_SHARE_PKG_RESOURCES |
5511 SD_SHARE_POWERDOMAIN);
5512 if (nr_node_ids == 1)
5513 pflags &= ~SD_SERIALIZE;
5515 if (~cflags & pflags)
5521 static void free_rootdomain(struct rcu_head *rcu)
5523 struct root_domain *rd = container_of(rcu, struct root_domain, rcu);
5525 cpupri_cleanup(&rd->cpupri);
5526 cpudl_cleanup(&rd->cpudl);
5527 free_cpumask_var(rd->dlo_mask);
5528 free_cpumask_var(rd->rto_mask);
5529 free_cpumask_var(rd->online);
5530 free_cpumask_var(rd->span);
5534 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
5536 struct root_domain *old_rd = NULL;
5537 unsigned long flags;
5539 raw_spin_lock_irqsave(&rq->lock, flags);
5544 if (cpumask_test_cpu(rq->cpu, old_rd->online))
5547 cpumask_clear_cpu(rq->cpu, old_rd->span);
5550 * If we dont want to free the old_rd yet then
5551 * set old_rd to NULL to skip the freeing later
5554 if (!atomic_dec_and_test(&old_rd->refcount))
5558 atomic_inc(&rd->refcount);
5561 cpumask_set_cpu(rq->cpu, rd->span);
5562 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
5565 raw_spin_unlock_irqrestore(&rq->lock, flags);
5568 call_rcu_sched(&old_rd->rcu, free_rootdomain);
5571 static int init_rootdomain(struct root_domain *rd)
5573 memset(rd, 0, sizeof(*rd));
5575 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
5577 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
5579 if (!alloc_cpumask_var(&rd->dlo_mask, GFP_KERNEL))
5581 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
5584 init_dl_bw(&rd->dl_bw);
5585 if (cpudl_init(&rd->cpudl) != 0)
5588 if (cpupri_init(&rd->cpupri) != 0)
5593 free_cpumask_var(rd->rto_mask);
5595 free_cpumask_var(rd->dlo_mask);
5597 free_cpumask_var(rd->online);
5599 free_cpumask_var(rd->span);
5605 * By default the system creates a single root-domain with all cpus as
5606 * members (mimicking the global state we have today).
5608 struct root_domain def_root_domain;
5610 static void init_defrootdomain(void)
5612 init_rootdomain(&def_root_domain);
5614 atomic_set(&def_root_domain.refcount, 1);
5617 static struct root_domain *alloc_rootdomain(void)
5619 struct root_domain *rd;
5621 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
5625 if (init_rootdomain(rd) != 0) {
5633 static void free_sched_groups(struct sched_group *sg, int free_sgc)
5635 struct sched_group *tmp, *first;
5644 if (free_sgc && atomic_dec_and_test(&sg->sgc->ref))
5649 } while (sg != first);
5652 static void free_sched_domain(struct rcu_head *rcu)
5654 struct sched_domain *sd = container_of(rcu, struct sched_domain, rcu);
5657 * If its an overlapping domain it has private groups, iterate and
5660 if (sd->flags & SD_OVERLAP) {
5661 free_sched_groups(sd->groups, 1);
5662 } else if (atomic_dec_and_test(&sd->groups->ref)) {
5663 kfree(sd->groups->sgc);
5669 static void destroy_sched_domain(struct sched_domain *sd, int cpu)
5671 call_rcu(&sd->rcu, free_sched_domain);
5674 static void destroy_sched_domains(struct sched_domain *sd, int cpu)
5676 for (; sd; sd = sd->parent)
5677 destroy_sched_domain(sd, cpu);
5681 * Keep a special pointer to the highest sched_domain that has
5682 * SD_SHARE_PKG_RESOURCE set (Last Level Cache Domain) for this
5683 * allows us to avoid some pointer chasing select_idle_sibling().
5685 * Also keep a unique ID per domain (we use the first cpu number in
5686 * the cpumask of the domain), this allows us to quickly tell if
5687 * two cpus are in the same cache domain, see cpus_share_cache().
5689 DEFINE_PER_CPU(struct sched_domain *, sd_llc);
5690 DEFINE_PER_CPU(int, sd_llc_size);
5691 DEFINE_PER_CPU(int, sd_llc_id);
5692 DEFINE_PER_CPU(struct sched_domain *, sd_numa);
5693 DEFINE_PER_CPU(struct sched_domain *, sd_busy);
5694 DEFINE_PER_CPU(struct sched_domain *, sd_asym);
5696 static void update_top_cache_domain(int cpu)
5698 struct sched_domain *sd;
5699 struct sched_domain *busy_sd = NULL;
5703 sd = highest_flag_domain(cpu, SD_SHARE_PKG_RESOURCES);
5705 id = cpumask_first(sched_domain_span(sd));
5706 size = cpumask_weight(sched_domain_span(sd));
5707 busy_sd = sd->parent; /* sd_busy */
5709 rcu_assign_pointer(per_cpu(sd_busy, cpu), busy_sd);
5711 rcu_assign_pointer(per_cpu(sd_llc, cpu), sd);
5712 per_cpu(sd_llc_size, cpu) = size;
5713 per_cpu(sd_llc_id, cpu) = id;
5715 sd = lowest_flag_domain(cpu, SD_NUMA);
5716 rcu_assign_pointer(per_cpu(sd_numa, cpu), sd);
5718 sd = highest_flag_domain(cpu, SD_ASYM_PACKING);
5719 rcu_assign_pointer(per_cpu(sd_asym, cpu), sd);
5723 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
5724 * hold the hotplug lock.
5727 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
5729 struct rq *rq = cpu_rq(cpu);
5730 struct sched_domain *tmp;
5732 /* Remove the sched domains which do not contribute to scheduling. */
5733 for (tmp = sd; tmp; ) {
5734 struct sched_domain *parent = tmp->parent;
5738 if (sd_parent_degenerate(tmp, parent)) {
5739 tmp->parent = parent->parent;
5741 parent->parent->child = tmp;
5743 * Transfer SD_PREFER_SIBLING down in case of a
5744 * degenerate parent; the spans match for this
5745 * so the property transfers.
5747 if (parent->flags & SD_PREFER_SIBLING)
5748 tmp->flags |= SD_PREFER_SIBLING;
5749 destroy_sched_domain(parent, cpu);
5754 if (sd && sd_degenerate(sd)) {
5757 destroy_sched_domain(tmp, cpu);
5762 sched_domain_debug(sd, cpu);
5764 rq_attach_root(rq, rd);
5766 rcu_assign_pointer(rq->sd, sd);
5767 destroy_sched_domains(tmp, cpu);
5769 update_top_cache_domain(cpu);
5772 /* cpus with isolated domains */
5773 static cpumask_var_t cpu_isolated_map;
5775 /* Setup the mask of cpus configured for isolated domains */
5776 static int __init isolated_cpu_setup(char *str)
5778 alloc_bootmem_cpumask_var(&cpu_isolated_map);
5779 cpulist_parse(str, cpu_isolated_map);
5783 __setup("isolcpus=", isolated_cpu_setup);
5786 struct sched_domain ** __percpu sd;
5787 struct root_domain *rd;
5798 * Build an iteration mask that can exclude certain CPUs from the upwards
5801 * Asymmetric node setups can result in situations where the domain tree is of
5802 * unequal depth, make sure to skip domains that already cover the entire
5805 * In that case build_sched_domains() will have terminated the iteration early
5806 * and our sibling sd spans will be empty. Domains should always include the
5807 * cpu they're built on, so check that.
5810 static void build_group_mask(struct sched_domain *sd, struct sched_group *sg)
5812 const struct cpumask *span = sched_domain_span(sd);
5813 struct sd_data *sdd = sd->private;
5814 struct sched_domain *sibling;
5817 for_each_cpu(i, span) {
5818 sibling = *per_cpu_ptr(sdd->sd, i);
5819 if (!cpumask_test_cpu(i, sched_domain_span(sibling)))
5822 cpumask_set_cpu(i, sched_group_mask(sg));
5827 * Return the canonical balance cpu for this group, this is the first cpu
5828 * of this group that's also in the iteration mask.
5830 int group_balance_cpu(struct sched_group *sg)
5832 return cpumask_first_and(sched_group_cpus(sg), sched_group_mask(sg));
5836 build_overlap_sched_groups(struct sched_domain *sd, int cpu)
5838 struct sched_group *first = NULL, *last = NULL, *groups = NULL, *sg;
5839 const struct cpumask *span = sched_domain_span(sd);
5840 struct cpumask *covered = sched_domains_tmpmask;
5841 struct sd_data *sdd = sd->private;
5842 struct sched_domain *sibling;
5845 cpumask_clear(covered);
5847 for_each_cpu(i, span) {
5848 struct cpumask *sg_span;
5850 if (cpumask_test_cpu(i, covered))
5853 sibling = *per_cpu_ptr(sdd->sd, i);
5855 /* See the comment near build_group_mask(). */
5856 if (!cpumask_test_cpu(i, sched_domain_span(sibling)))
5859 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
5860 GFP_KERNEL, cpu_to_node(cpu));
5865 sg_span = sched_group_cpus(sg);
5867 cpumask_copy(sg_span, sched_domain_span(sibling->child));
5869 cpumask_set_cpu(i, sg_span);
5871 cpumask_or(covered, covered, sg_span);
5873 sg->sgc = *per_cpu_ptr(sdd->sgc, i);
5874 if (atomic_inc_return(&sg->sgc->ref) == 1)
5875 build_group_mask(sd, sg);
5878 * Initialize sgc->capacity such that even if we mess up the
5879 * domains and no possible iteration will get us here, we won't
5882 sg->sgc->capacity = SCHED_CAPACITY_SCALE * cpumask_weight(sg_span);
5883 sg->sgc->capacity_orig = sg->sgc->capacity;
5886 * Make sure the first group of this domain contains the
5887 * canonical balance cpu. Otherwise the sched_domain iteration
5888 * breaks. See update_sg_lb_stats().
5890 if ((!groups && cpumask_test_cpu(cpu, sg_span)) ||
5891 group_balance_cpu(sg) == cpu)
5901 sd->groups = groups;
5906 free_sched_groups(first, 0);
5911 static int get_group(int cpu, struct sd_data *sdd, struct sched_group **sg)
5913 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, cpu);
5914 struct sched_domain *child = sd->child;
5917 cpu = cpumask_first(sched_domain_span(child));
5920 *sg = *per_cpu_ptr(sdd->sg, cpu);
5921 (*sg)->sgc = *per_cpu_ptr(sdd->sgc, cpu);
5922 atomic_set(&(*sg)->sgc->ref, 1); /* for claim_allocations */
5929 * build_sched_groups will build a circular linked list of the groups
5930 * covered by the given span, and will set each group's ->cpumask correctly,
5931 * and ->cpu_capacity to 0.
5933 * Assumes the sched_domain tree is fully constructed
5936 build_sched_groups(struct sched_domain *sd, int cpu)
5938 struct sched_group *first = NULL, *last = NULL;
5939 struct sd_data *sdd = sd->private;
5940 const struct cpumask *span = sched_domain_span(sd);
5941 struct cpumask *covered;
5944 get_group(cpu, sdd, &sd->groups);
5945 atomic_inc(&sd->groups->ref);
5947 if (cpu != cpumask_first(span))
5950 lockdep_assert_held(&sched_domains_mutex);
5951 covered = sched_domains_tmpmask;
5953 cpumask_clear(covered);
5955 for_each_cpu(i, span) {
5956 struct sched_group *sg;
5959 if (cpumask_test_cpu(i, covered))
5962 group = get_group(i, sdd, &sg);
5963 cpumask_setall(sched_group_mask(sg));
5965 for_each_cpu(j, span) {
5966 if (get_group(j, sdd, NULL) != group)
5969 cpumask_set_cpu(j, covered);
5970 cpumask_set_cpu(j, sched_group_cpus(sg));
5985 * Initialize sched groups cpu_capacity.
5987 * cpu_capacity indicates the capacity of sched group, which is used while
5988 * distributing the load between different sched groups in a sched domain.
5989 * Typically cpu_capacity for all the groups in a sched domain will be same
5990 * unless there are asymmetries in the topology. If there are asymmetries,
5991 * group having more cpu_capacity will pickup more load compared to the
5992 * group having less cpu_capacity.
5994 static void init_sched_groups_capacity(int cpu, struct sched_domain *sd)
5996 struct sched_group *sg = sd->groups;
6001 sg->group_weight = cpumask_weight(sched_group_cpus(sg));
6003 } while (sg != sd->groups);
6005 if (cpu != group_balance_cpu(sg))
6008 update_group_capacity(sd, cpu);
6009 atomic_set(&sg->sgc->nr_busy_cpus, sg->group_weight);
6013 * Initializers for schedule domains
6014 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6017 static int default_relax_domain_level = -1;
6018 int sched_domain_level_max;
6020 static int __init setup_relax_domain_level(char *str)
6022 if (kstrtoint(str, 0, &default_relax_domain_level))
6023 pr_warn("Unable to set relax_domain_level\n");
6027 __setup("relax_domain_level=", setup_relax_domain_level);
6029 static void set_domain_attribute(struct sched_domain *sd,
6030 struct sched_domain_attr *attr)
6034 if (!attr || attr->relax_domain_level < 0) {
6035 if (default_relax_domain_level < 0)
6038 request = default_relax_domain_level;
6040 request = attr->relax_domain_level;
6041 if (request < sd->level) {
6042 /* turn off idle balance on this domain */
6043 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6045 /* turn on idle balance on this domain */
6046 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6050 static void __sdt_free(const struct cpumask *cpu_map);
6051 static int __sdt_alloc(const struct cpumask *cpu_map);
6053 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6054 const struct cpumask *cpu_map)
6058 if (!atomic_read(&d->rd->refcount))
6059 free_rootdomain(&d->rd->rcu); /* fall through */
6061 free_percpu(d->sd); /* fall through */
6063 __sdt_free(cpu_map); /* fall through */
6069 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6070 const struct cpumask *cpu_map)
6072 memset(d, 0, sizeof(*d));
6074 if (__sdt_alloc(cpu_map))
6075 return sa_sd_storage;
6076 d->sd = alloc_percpu(struct sched_domain *);
6078 return sa_sd_storage;
6079 d->rd = alloc_rootdomain();
6082 return sa_rootdomain;
6086 * NULL the sd_data elements we've used to build the sched_domain and
6087 * sched_group structure so that the subsequent __free_domain_allocs()
6088 * will not free the data we're using.
6090 static void claim_allocations(int cpu, struct sched_domain *sd)
6092 struct sd_data *sdd = sd->private;
6094 WARN_ON_ONCE(*per_cpu_ptr(sdd->sd, cpu) != sd);
6095 *per_cpu_ptr(sdd->sd, cpu) = NULL;
6097 if (atomic_read(&(*per_cpu_ptr(sdd->sg, cpu))->ref))
6098 *per_cpu_ptr(sdd->sg, cpu) = NULL;
6100 if (atomic_read(&(*per_cpu_ptr(sdd->sgc, cpu))->ref))
6101 *per_cpu_ptr(sdd->sgc, cpu) = NULL;
6105 static int sched_domains_numa_levels;
6106 static int *sched_domains_numa_distance;
6107 static struct cpumask ***sched_domains_numa_masks;
6108 static int sched_domains_curr_level;
6112 * SD_flags allowed in topology descriptions.
6114 * SD_SHARE_CPUCAPACITY - describes SMT topologies
6115 * SD_SHARE_PKG_RESOURCES - describes shared caches
6116 * SD_NUMA - describes NUMA topologies
6117 * SD_SHARE_POWERDOMAIN - describes shared power domain
6120 * SD_ASYM_PACKING - describes SMT quirks
6122 #define TOPOLOGY_SD_FLAGS \
6123 (SD_SHARE_CPUCAPACITY | \
6124 SD_SHARE_PKG_RESOURCES | \
6127 SD_SHARE_POWERDOMAIN)
6129 static struct sched_domain *
6130 sd_init(struct sched_domain_topology_level *tl, int cpu)
6132 struct sched_domain *sd = *per_cpu_ptr(tl->data.sd, cpu);
6133 int sd_weight, sd_flags = 0;
6137 * Ugly hack to pass state to sd_numa_mask()...
6139 sched_domains_curr_level = tl->numa_level;
6142 sd_weight = cpumask_weight(tl->mask(cpu));
6145 sd_flags = (*tl->sd_flags)();
6146 if (WARN_ONCE(sd_flags & ~TOPOLOGY_SD_FLAGS,
6147 "wrong sd_flags in topology description\n"))
6148 sd_flags &= ~TOPOLOGY_SD_FLAGS;
6150 *sd = (struct sched_domain){
6151 .min_interval = sd_weight,
6152 .max_interval = 2*sd_weight,
6154 .imbalance_pct = 125,
6156 .cache_nice_tries = 0,
6163 .flags = 1*SD_LOAD_BALANCE
6164 | 1*SD_BALANCE_NEWIDLE
6169 | 0*SD_SHARE_CPUCAPACITY
6170 | 0*SD_SHARE_PKG_RESOURCES
6172 | 0*SD_PREFER_SIBLING
6177 .last_balance = jiffies,
6178 .balance_interval = sd_weight,
6180 .max_newidle_lb_cost = 0,
6181 .next_decay_max_lb_cost = jiffies,
6182 #ifdef CONFIG_SCHED_DEBUG
6188 * Convert topological properties into behaviour.
6191 if (sd->flags & SD_SHARE_CPUCAPACITY) {
6192 sd->imbalance_pct = 110;
6193 sd->smt_gain = 1178; /* ~15% */
6195 } else if (sd->flags & SD_SHARE_PKG_RESOURCES) {
6196 sd->imbalance_pct = 117;
6197 sd->cache_nice_tries = 1;
6201 } else if (sd->flags & SD_NUMA) {
6202 sd->cache_nice_tries = 2;
6206 sd->flags |= SD_SERIALIZE;
6207 if (sched_domains_numa_distance[tl->numa_level] > RECLAIM_DISTANCE) {
6208 sd->flags &= ~(SD_BALANCE_EXEC |
6215 sd->flags |= SD_PREFER_SIBLING;
6216 sd->cache_nice_tries = 1;
6221 sd->private = &tl->data;
6227 * Topology list, bottom-up.
6229 static struct sched_domain_topology_level default_topology[] = {
6230 #ifdef CONFIG_SCHED_SMT
6231 { cpu_smt_mask, cpu_smt_flags, SD_INIT_NAME(SMT) },
6233 #ifdef CONFIG_SCHED_MC
6234 { cpu_coregroup_mask, cpu_core_flags, SD_INIT_NAME(MC) },
6236 { cpu_cpu_mask, SD_INIT_NAME(DIE) },
6240 struct sched_domain_topology_level *sched_domain_topology = default_topology;
6242 #define for_each_sd_topology(tl) \
6243 for (tl = sched_domain_topology; tl->mask; tl++)
6245 void set_sched_topology(struct sched_domain_topology_level *tl)
6247 sched_domain_topology = tl;
6252 static const struct cpumask *sd_numa_mask(int cpu)
6254 return sched_domains_numa_masks[sched_domains_curr_level][cpu_to_node(cpu)];
6257 static void sched_numa_warn(const char *str)
6259 static int done = false;
6267 printk(KERN_WARNING "ERROR: %s\n\n", str);
6269 for (i = 0; i < nr_node_ids; i++) {
6270 printk(KERN_WARNING " ");
6271 for (j = 0; j < nr_node_ids; j++)
6272 printk(KERN_CONT "%02d ", node_distance(i,j));
6273 printk(KERN_CONT "\n");
6275 printk(KERN_WARNING "\n");
6278 static bool find_numa_distance(int distance)
6282 if (distance == node_distance(0, 0))
6285 for (i = 0; i < sched_domains_numa_levels; i++) {
6286 if (sched_domains_numa_distance[i] == distance)
6293 static void sched_init_numa(void)
6295 int next_distance, curr_distance = node_distance(0, 0);
6296 struct sched_domain_topology_level *tl;
6300 sched_domains_numa_distance = kzalloc(sizeof(int) * nr_node_ids, GFP_KERNEL);
6301 if (!sched_domains_numa_distance)
6305 * O(nr_nodes^2) deduplicating selection sort -- in order to find the
6306 * unique distances in the node_distance() table.
6308 * Assumes node_distance(0,j) includes all distances in
6309 * node_distance(i,j) in order to avoid cubic time.
6311 next_distance = curr_distance;
6312 for (i = 0; i < nr_node_ids; i++) {
6313 for (j = 0; j < nr_node_ids; j++) {
6314 for (k = 0; k < nr_node_ids; k++) {
6315 int distance = node_distance(i, k);
6317 if (distance > curr_distance &&
6318 (distance < next_distance ||
6319 next_distance == curr_distance))
6320 next_distance = distance;
6323 * While not a strong assumption it would be nice to know
6324 * about cases where if node A is connected to B, B is not
6325 * equally connected to A.
6327 if (sched_debug() && node_distance(k, i) != distance)
6328 sched_numa_warn("Node-distance not symmetric");
6330 if (sched_debug() && i && !find_numa_distance(distance))
6331 sched_numa_warn("Node-0 not representative");
6333 if (next_distance != curr_distance) {
6334 sched_domains_numa_distance[level++] = next_distance;
6335 sched_domains_numa_levels = level;
6336 curr_distance = next_distance;
6341 * In case of sched_debug() we verify the above assumption.
6351 * 'level' contains the number of unique distances, excluding the
6352 * identity distance node_distance(i,i).
6354 * The sched_domains_numa_distance[] array includes the actual distance
6359 * Here, we should temporarily reset sched_domains_numa_levels to 0.
6360 * If it fails to allocate memory for array sched_domains_numa_masks[][],
6361 * the array will contain less then 'level' members. This could be
6362 * dangerous when we use it to iterate array sched_domains_numa_masks[][]
6363 * in other functions.
6365 * We reset it to 'level' at the end of this function.
6367 sched_domains_numa_levels = 0;
6369 sched_domains_numa_masks = kzalloc(sizeof(void *) * level, GFP_KERNEL);
6370 if (!sched_domains_numa_masks)
6374 * Now for each level, construct a mask per node which contains all
6375 * cpus of nodes that are that many hops away from us.
6377 for (i = 0; i < level; i++) {
6378 sched_domains_numa_masks[i] =
6379 kzalloc(nr_node_ids * sizeof(void *), GFP_KERNEL);
6380 if (!sched_domains_numa_masks[i])
6383 for (j = 0; j < nr_node_ids; j++) {
6384 struct cpumask *mask = kzalloc(cpumask_size(), GFP_KERNEL);
6388 sched_domains_numa_masks[i][j] = mask;
6390 for (k = 0; k < nr_node_ids; k++) {
6391 if (node_distance(j, k) > sched_domains_numa_distance[i])
6394 cpumask_or(mask, mask, cpumask_of_node(k));
6399 /* Compute default topology size */
6400 for (i = 0; sched_domain_topology[i].mask; i++);
6402 tl = kzalloc((i + level + 1) *
6403 sizeof(struct sched_domain_topology_level), GFP_KERNEL);
6408 * Copy the default topology bits..
6410 for (i = 0; sched_domain_topology[i].mask; i++)
6411 tl[i] = sched_domain_topology[i];
6414 * .. and append 'j' levels of NUMA goodness.
6416 for (j = 0; j < level; i++, j++) {
6417 tl[i] = (struct sched_domain_topology_level){
6418 .mask = sd_numa_mask,
6419 .sd_flags = cpu_numa_flags,
6420 .flags = SDTL_OVERLAP,
6426 sched_domain_topology = tl;
6428 sched_domains_numa_levels = level;
6431 static void sched_domains_numa_masks_set(int cpu)
6434 int node = cpu_to_node(cpu);
6436 for (i = 0; i < sched_domains_numa_levels; i++) {
6437 for (j = 0; j < nr_node_ids; j++) {
6438 if (node_distance(j, node) <= sched_domains_numa_distance[i])
6439 cpumask_set_cpu(cpu, sched_domains_numa_masks[i][j]);
6444 static void sched_domains_numa_masks_clear(int cpu)
6447 for (i = 0; i < sched_domains_numa_levels; i++) {
6448 for (j = 0; j < nr_node_ids; j++)
6449 cpumask_clear_cpu(cpu, sched_domains_numa_masks[i][j]);
6454 * Update sched_domains_numa_masks[level][node] array when new cpus
6457 static int sched_domains_numa_masks_update(struct notifier_block *nfb,
6458 unsigned long action,
6461 int cpu = (long)hcpu;
6463 switch (action & ~CPU_TASKS_FROZEN) {
6465 sched_domains_numa_masks_set(cpu);
6469 sched_domains_numa_masks_clear(cpu);
6479 static inline void sched_init_numa(void)
6483 static int sched_domains_numa_masks_update(struct notifier_block *nfb,
6484 unsigned long action,
6489 #endif /* CONFIG_NUMA */
6491 static int __sdt_alloc(const struct cpumask *cpu_map)
6493 struct sched_domain_topology_level *tl;
6496 for_each_sd_topology(tl) {
6497 struct sd_data *sdd = &tl->data;
6499 sdd->sd = alloc_percpu(struct sched_domain *);
6503 sdd->sg = alloc_percpu(struct sched_group *);
6507 sdd->sgc = alloc_percpu(struct sched_group_capacity *);
6511 for_each_cpu(j, cpu_map) {
6512 struct sched_domain *sd;
6513 struct sched_group *sg;
6514 struct sched_group_capacity *sgc;
6516 sd = kzalloc_node(sizeof(struct sched_domain) + cpumask_size(),
6517 GFP_KERNEL, cpu_to_node(j));
6521 *per_cpu_ptr(sdd->sd, j) = sd;
6523 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6524 GFP_KERNEL, cpu_to_node(j));
6530 *per_cpu_ptr(sdd->sg, j) = sg;
6532 sgc = kzalloc_node(sizeof(struct sched_group_capacity) + cpumask_size(),
6533 GFP_KERNEL, cpu_to_node(j));
6537 *per_cpu_ptr(sdd->sgc, j) = sgc;
6544 static void __sdt_free(const struct cpumask *cpu_map)
6546 struct sched_domain_topology_level *tl;
6549 for_each_sd_topology(tl) {
6550 struct sd_data *sdd = &tl->data;
6552 for_each_cpu(j, cpu_map) {
6553 struct sched_domain *sd;
6556 sd = *per_cpu_ptr(sdd->sd, j);
6557 if (sd && (sd->flags & SD_OVERLAP))
6558 free_sched_groups(sd->groups, 0);
6559 kfree(*per_cpu_ptr(sdd->sd, j));
6563 kfree(*per_cpu_ptr(sdd->sg, j));
6565 kfree(*per_cpu_ptr(sdd->sgc, j));
6567 free_percpu(sdd->sd);
6569 free_percpu(sdd->sg);
6571 free_percpu(sdd->sgc);
6576 struct sched_domain *build_sched_domain(struct sched_domain_topology_level *tl,
6577 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6578 struct sched_domain *child, int cpu)
6580 struct sched_domain *sd = sd_init(tl, cpu);
6584 cpumask_and(sched_domain_span(sd), cpu_map, tl->mask(cpu));
6586 sd->level = child->level + 1;
6587 sched_domain_level_max = max(sched_domain_level_max, sd->level);
6591 if (!cpumask_subset(sched_domain_span(child),
6592 sched_domain_span(sd))) {
6593 pr_err("BUG: arch topology borken\n");
6594 #ifdef CONFIG_SCHED_DEBUG
6595 pr_err(" the %s domain not a subset of the %s domain\n",
6596 child->name, sd->name);
6598 /* Fixup, ensure @sd has at least @child cpus. */
6599 cpumask_or(sched_domain_span(sd),
6600 sched_domain_span(sd),
6601 sched_domain_span(child));
6605 set_domain_attribute(sd, attr);
6611 * Build sched domains for a given set of cpus and attach the sched domains
6612 * to the individual cpus
6614 static int build_sched_domains(const struct cpumask *cpu_map,
6615 struct sched_domain_attr *attr)
6617 enum s_alloc alloc_state;
6618 struct sched_domain *sd;
6620 int i, ret = -ENOMEM;
6622 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
6623 if (alloc_state != sa_rootdomain)
6626 /* Set up domains for cpus specified by the cpu_map. */
6627 for_each_cpu(i, cpu_map) {
6628 struct sched_domain_topology_level *tl;
6631 for_each_sd_topology(tl) {
6632 sd = build_sched_domain(tl, cpu_map, attr, sd, i);
6633 if (tl == sched_domain_topology)
6634 *per_cpu_ptr(d.sd, i) = sd;
6635 if (tl->flags & SDTL_OVERLAP || sched_feat(FORCE_SD_OVERLAP))
6636 sd->flags |= SD_OVERLAP;
6637 if (cpumask_equal(cpu_map, sched_domain_span(sd)))
6642 /* Build the groups for the domains */
6643 for_each_cpu(i, cpu_map) {
6644 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6645 sd->span_weight = cpumask_weight(sched_domain_span(sd));
6646 if (sd->flags & SD_OVERLAP) {
6647 if (build_overlap_sched_groups(sd, i))
6650 if (build_sched_groups(sd, i))
6656 /* Calculate CPU capacity for physical packages and nodes */
6657 for (i = nr_cpumask_bits-1; i >= 0; i--) {
6658 if (!cpumask_test_cpu(i, cpu_map))
6661 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6662 claim_allocations(i, sd);
6663 init_sched_groups_capacity(i, sd);
6667 /* Attach the domains */
6669 for_each_cpu(i, cpu_map) {
6670 sd = *per_cpu_ptr(d.sd, i);
6671 cpu_attach_domain(sd, d.rd, i);
6677 __free_domain_allocs(&d, alloc_state, cpu_map);
6681 static cpumask_var_t *doms_cur; /* current sched domains */
6682 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
6683 static struct sched_domain_attr *dattr_cur;
6684 /* attribues of custom domains in 'doms_cur' */
6687 * Special case: If a kmalloc of a doms_cur partition (array of
6688 * cpumask) fails, then fallback to a single sched domain,
6689 * as determined by the single cpumask fallback_doms.
6691 static cpumask_var_t fallback_doms;
6694 * arch_update_cpu_topology lets virtualized architectures update the
6695 * cpu core maps. It is supposed to return 1 if the topology changed
6696 * or 0 if it stayed the same.
6698 int __weak arch_update_cpu_topology(void)
6703 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
6706 cpumask_var_t *doms;
6708 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
6711 for (i = 0; i < ndoms; i++) {
6712 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
6713 free_sched_domains(doms, i);
6720 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
6723 for (i = 0; i < ndoms; i++)
6724 free_cpumask_var(doms[i]);
6729 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
6730 * For now this just excludes isolated cpus, but could be used to
6731 * exclude other special cases in the future.
6733 static int init_sched_domains(const struct cpumask *cpu_map)
6737 arch_update_cpu_topology();
6739 doms_cur = alloc_sched_domains(ndoms_cur);
6741 doms_cur = &fallback_doms;
6742 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
6743 err = build_sched_domains(doms_cur[0], NULL);
6744 register_sched_domain_sysctl();
6750 * Detach sched domains from a group of cpus specified in cpu_map
6751 * These cpus will now be attached to the NULL domain
6753 static void detach_destroy_domains(const struct cpumask *cpu_map)
6758 for_each_cpu(i, cpu_map)
6759 cpu_attach_domain(NULL, &def_root_domain, i);
6763 /* handle null as "default" */
6764 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
6765 struct sched_domain_attr *new, int idx_new)
6767 struct sched_domain_attr tmp;
6774 return !memcmp(cur ? (cur + idx_cur) : &tmp,
6775 new ? (new + idx_new) : &tmp,
6776 sizeof(struct sched_domain_attr));
6780 * Partition sched domains as specified by the 'ndoms_new'
6781 * cpumasks in the array doms_new[] of cpumasks. This compares
6782 * doms_new[] to the current sched domain partitioning, doms_cur[].
6783 * It destroys each deleted domain and builds each new domain.
6785 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
6786 * The masks don't intersect (don't overlap.) We should setup one
6787 * sched domain for each mask. CPUs not in any of the cpumasks will
6788 * not be load balanced. If the same cpumask appears both in the
6789 * current 'doms_cur' domains and in the new 'doms_new', we can leave
6792 * The passed in 'doms_new' should be allocated using
6793 * alloc_sched_domains. This routine takes ownership of it and will
6794 * free_sched_domains it when done with it. If the caller failed the
6795 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
6796 * and partition_sched_domains() will fallback to the single partition
6797 * 'fallback_doms', it also forces the domains to be rebuilt.
6799 * If doms_new == NULL it will be replaced with cpu_online_mask.
6800 * ndoms_new == 0 is a special case for destroying existing domains,
6801 * and it will not create the default domain.
6803 * Call with hotplug lock held
6805 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
6806 struct sched_domain_attr *dattr_new)
6811 mutex_lock(&sched_domains_mutex);
6813 /* always unregister in case we don't destroy any domains */
6814 unregister_sched_domain_sysctl();
6816 /* Let architecture update cpu core mappings. */
6817 new_topology = arch_update_cpu_topology();
6819 n = doms_new ? ndoms_new : 0;
6821 /* Destroy deleted domains */
6822 for (i = 0; i < ndoms_cur; i++) {
6823 for (j = 0; j < n && !new_topology; j++) {
6824 if (cpumask_equal(doms_cur[i], doms_new[j])
6825 && dattrs_equal(dattr_cur, i, dattr_new, j))
6828 /* no match - a current sched domain not in new doms_new[] */
6829 detach_destroy_domains(doms_cur[i]);
6835 if (doms_new == NULL) {
6837 doms_new = &fallback_doms;
6838 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
6839 WARN_ON_ONCE(dattr_new);
6842 /* Build new domains */
6843 for (i = 0; i < ndoms_new; i++) {
6844 for (j = 0; j < n && !new_topology; j++) {
6845 if (cpumask_equal(doms_new[i], doms_cur[j])
6846 && dattrs_equal(dattr_new, i, dattr_cur, j))
6849 /* no match - add a new doms_new */
6850 build_sched_domains(doms_new[i], dattr_new ? dattr_new + i : NULL);
6855 /* Remember the new sched domains */
6856 if (doms_cur != &fallback_doms)
6857 free_sched_domains(doms_cur, ndoms_cur);
6858 kfree(dattr_cur); /* kfree(NULL) is safe */
6859 doms_cur = doms_new;
6860 dattr_cur = dattr_new;
6861 ndoms_cur = ndoms_new;
6863 register_sched_domain_sysctl();
6865 mutex_unlock(&sched_domains_mutex);
6868 static int num_cpus_frozen; /* used to mark begin/end of suspend/resume */
6871 * Update cpusets according to cpu_active mask. If cpusets are
6872 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
6873 * around partition_sched_domains().
6875 * If we come here as part of a suspend/resume, don't touch cpusets because we
6876 * want to restore it back to its original state upon resume anyway.
6878 static int cpuset_cpu_active(struct notifier_block *nfb, unsigned long action,
6882 case CPU_ONLINE_FROZEN:
6883 case CPU_DOWN_FAILED_FROZEN:
6886 * num_cpus_frozen tracks how many CPUs are involved in suspend
6887 * resume sequence. As long as this is not the last online
6888 * operation in the resume sequence, just build a single sched
6889 * domain, ignoring cpusets.
6892 if (likely(num_cpus_frozen)) {
6893 partition_sched_domains(1, NULL, NULL);
6898 * This is the last CPU online operation. So fall through and
6899 * restore the original sched domains by considering the
6900 * cpuset configurations.
6904 case CPU_DOWN_FAILED:
6905 cpuset_update_active_cpus(true);
6913 static int cpuset_cpu_inactive(struct notifier_block *nfb, unsigned long action,
6917 case CPU_DOWN_PREPARE:
6918 cpuset_update_active_cpus(false);
6920 case CPU_DOWN_PREPARE_FROZEN:
6922 partition_sched_domains(1, NULL, NULL);
6930 void __init sched_init_smp(void)
6932 cpumask_var_t non_isolated_cpus;
6934 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
6935 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
6940 * There's no userspace yet to cause hotplug operations; hence all the
6941 * cpu masks are stable and all blatant races in the below code cannot
6944 mutex_lock(&sched_domains_mutex);
6945 init_sched_domains(cpu_active_mask);
6946 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
6947 if (cpumask_empty(non_isolated_cpus))
6948 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
6949 mutex_unlock(&sched_domains_mutex);
6951 hotcpu_notifier(sched_domains_numa_masks_update, CPU_PRI_SCHED_ACTIVE);
6952 hotcpu_notifier(cpuset_cpu_active, CPU_PRI_CPUSET_ACTIVE);
6953 hotcpu_notifier(cpuset_cpu_inactive, CPU_PRI_CPUSET_INACTIVE);
6957 /* Move init over to a non-isolated CPU */
6958 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
6960 sched_init_granularity();
6961 free_cpumask_var(non_isolated_cpus);
6963 init_sched_rt_class();
6964 init_sched_dl_class();
6967 void __init sched_init_smp(void)
6969 sched_init_granularity();
6971 #endif /* CONFIG_SMP */
6973 const_debug unsigned int sysctl_timer_migration = 1;
6975 int in_sched_functions(unsigned long addr)
6977 return in_lock_functions(addr) ||
6978 (addr >= (unsigned long)__sched_text_start
6979 && addr < (unsigned long)__sched_text_end);
6982 #ifdef CONFIG_CGROUP_SCHED
6984 * Default task group.
6985 * Every task in system belongs to this group at bootup.
6987 struct task_group root_task_group;
6988 LIST_HEAD(task_groups);
6991 DECLARE_PER_CPU(cpumask_var_t, load_balance_mask);
6993 void __init sched_init(void)
6996 unsigned long alloc_size = 0, ptr;
6998 #ifdef CONFIG_FAIR_GROUP_SCHED
6999 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7001 #ifdef CONFIG_RT_GROUP_SCHED
7002 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7004 #ifdef CONFIG_CPUMASK_OFFSTACK
7005 alloc_size += num_possible_cpus() * cpumask_size();
7008 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
7010 #ifdef CONFIG_FAIR_GROUP_SCHED
7011 root_task_group.se = (struct sched_entity **)ptr;
7012 ptr += nr_cpu_ids * sizeof(void **);
7014 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
7015 ptr += nr_cpu_ids * sizeof(void **);
7017 #endif /* CONFIG_FAIR_GROUP_SCHED */
7018 #ifdef CONFIG_RT_GROUP_SCHED
7019 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
7020 ptr += nr_cpu_ids * sizeof(void **);
7022 root_task_group.rt_rq = (struct rt_rq **)ptr;
7023 ptr += nr_cpu_ids * sizeof(void **);
7025 #endif /* CONFIG_RT_GROUP_SCHED */
7026 #ifdef CONFIG_CPUMASK_OFFSTACK
7027 for_each_possible_cpu(i) {
7028 per_cpu(load_balance_mask, i) = (void *)ptr;
7029 ptr += cpumask_size();
7031 #endif /* CONFIG_CPUMASK_OFFSTACK */
7034 init_rt_bandwidth(&def_rt_bandwidth,
7035 global_rt_period(), global_rt_runtime());
7036 init_dl_bandwidth(&def_dl_bandwidth,
7037 global_rt_period(), global_rt_runtime());
7040 init_defrootdomain();
7043 #ifdef CONFIG_RT_GROUP_SCHED
7044 init_rt_bandwidth(&root_task_group.rt_bandwidth,
7045 global_rt_period(), global_rt_runtime());
7046 #endif /* CONFIG_RT_GROUP_SCHED */
7048 #ifdef CONFIG_CGROUP_SCHED
7049 list_add(&root_task_group.list, &task_groups);
7050 INIT_LIST_HEAD(&root_task_group.children);
7051 INIT_LIST_HEAD(&root_task_group.siblings);
7052 autogroup_init(&init_task);
7054 #endif /* CONFIG_CGROUP_SCHED */
7056 for_each_possible_cpu(i) {
7060 raw_spin_lock_init(&rq->lock);
7062 rq->calc_load_active = 0;
7063 rq->calc_load_update = jiffies + LOAD_FREQ;
7064 init_cfs_rq(&rq->cfs);
7065 init_rt_rq(&rq->rt, rq);
7066 init_dl_rq(&rq->dl, rq);
7067 #ifdef CONFIG_FAIR_GROUP_SCHED
7068 root_task_group.shares = ROOT_TASK_GROUP_LOAD;
7069 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
7071 * How much cpu bandwidth does root_task_group get?
7073 * In case of task-groups formed thr' the cgroup filesystem, it
7074 * gets 100% of the cpu resources in the system. This overall
7075 * system cpu resource is divided among the tasks of
7076 * root_task_group and its child task-groups in a fair manner,
7077 * based on each entity's (task or task-group's) weight
7078 * (se->load.weight).
7080 * In other words, if root_task_group has 10 tasks of weight
7081 * 1024) and two child groups A0 and A1 (of weight 1024 each),
7082 * then A0's share of the cpu resource is:
7084 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
7086 * We achieve this by letting root_task_group's tasks sit
7087 * directly in rq->cfs (i.e root_task_group->se[] = NULL).
7089 init_cfs_bandwidth(&root_task_group.cfs_bandwidth);
7090 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL);
7091 #endif /* CONFIG_FAIR_GROUP_SCHED */
7093 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
7094 #ifdef CONFIG_RT_GROUP_SCHED
7095 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL);
7098 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
7099 rq->cpu_load[j] = 0;
7101 rq->last_load_update_tick = jiffies;
7106 rq->cpu_capacity = SCHED_CAPACITY_SCALE;
7107 rq->post_schedule = 0;
7108 rq->active_balance = 0;
7109 rq->next_balance = jiffies;
7114 rq->avg_idle = 2*sysctl_sched_migration_cost;
7115 rq->max_idle_balance_cost = sysctl_sched_migration_cost;
7117 INIT_LIST_HEAD(&rq->cfs_tasks);
7119 rq_attach_root(rq, &def_root_domain);
7120 #ifdef CONFIG_NO_HZ_COMMON
7123 #ifdef CONFIG_NO_HZ_FULL
7124 rq->last_sched_tick = 0;
7128 atomic_set(&rq->nr_iowait, 0);
7131 set_load_weight(&init_task);
7133 #ifdef CONFIG_PREEMPT_NOTIFIERS
7134 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
7138 * The boot idle thread does lazy MMU switching as well:
7140 atomic_inc(&init_mm.mm_count);
7141 enter_lazy_tlb(&init_mm, current);
7144 * Make us the idle thread. Technically, schedule() should not be
7145 * called from this thread, however somewhere below it might be,
7146 * but because we are the idle thread, we just pick up running again
7147 * when this runqueue becomes "idle".
7149 init_idle(current, smp_processor_id());
7151 calc_load_update = jiffies + LOAD_FREQ;
7154 * During early bootup we pretend to be a normal task:
7156 current->sched_class = &fair_sched_class;
7159 zalloc_cpumask_var(&sched_domains_tmpmask, GFP_NOWAIT);
7160 /* May be allocated at isolcpus cmdline parse time */
7161 if (cpu_isolated_map == NULL)
7162 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7163 idle_thread_set_boot_cpu();
7164 set_cpu_rq_start_time();
7166 init_sched_fair_class();
7168 scheduler_running = 1;
7171 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
7172 static inline int preempt_count_equals(int preempt_offset)
7174 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
7176 return (nested == preempt_offset);
7179 void __might_sleep(const char *file, int line, int preempt_offset)
7181 static unsigned long prev_jiffy; /* ratelimiting */
7183 rcu_sleep_check(); /* WARN_ON_ONCE() by default, no rate limit reqd. */
7184 if ((preempt_count_equals(preempt_offset) && !irqs_disabled() &&
7185 !is_idle_task(current)) ||
7186 system_state != SYSTEM_RUNNING || oops_in_progress)
7188 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7190 prev_jiffy = jiffies;
7193 "BUG: sleeping function called from invalid context at %s:%d\n",
7196 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7197 in_atomic(), irqs_disabled(),
7198 current->pid, current->comm);
7200 debug_show_held_locks(current);
7201 if (irqs_disabled())
7202 print_irqtrace_events(current);
7203 #ifdef CONFIG_DEBUG_PREEMPT
7204 if (!preempt_count_equals(preempt_offset)) {
7205 pr_err("Preemption disabled at:");
7206 print_ip_sym(current->preempt_disable_ip);
7212 EXPORT_SYMBOL(__might_sleep);
7215 #ifdef CONFIG_MAGIC_SYSRQ
7216 static void normalize_task(struct rq *rq, struct task_struct *p)
7218 const struct sched_class *prev_class = p->sched_class;
7219 struct sched_attr attr = {
7220 .sched_policy = SCHED_NORMAL,
7222 int old_prio = p->prio;
7225 queued = task_on_rq_queued(p);
7227 dequeue_task(rq, p, 0);
7228 __setscheduler(rq, p, &attr);
7230 enqueue_task(rq, p, 0);
7234 check_class_changed(rq, p, prev_class, old_prio);
7237 void normalize_rt_tasks(void)
7239 struct task_struct *g, *p;
7240 unsigned long flags;
7243 read_lock(&tasklist_lock);
7244 for_each_process_thread(g, p) {
7246 * Only normalize user tasks:
7248 if (p->flags & PF_KTHREAD)
7251 p->se.exec_start = 0;
7252 #ifdef CONFIG_SCHEDSTATS
7253 p->se.statistics.wait_start = 0;
7254 p->se.statistics.sleep_start = 0;
7255 p->se.statistics.block_start = 0;
7258 if (!dl_task(p) && !rt_task(p)) {
7260 * Renice negative nice level userspace
7263 if (task_nice(p) < 0)
7264 set_user_nice(p, 0);
7268 rq = task_rq_lock(p, &flags);
7269 normalize_task(rq, p);
7270 task_rq_unlock(rq, p, &flags);
7272 read_unlock(&tasklist_lock);
7275 #endif /* CONFIG_MAGIC_SYSRQ */
7277 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
7279 * These functions are only useful for the IA64 MCA handling, or kdb.
7281 * They can only be called when the whole system has been
7282 * stopped - every CPU needs to be quiescent, and no scheduling
7283 * activity can take place. Using them for anything else would
7284 * be a serious bug, and as a result, they aren't even visible
7285 * under any other configuration.
7289 * curr_task - return the current task for a given cpu.
7290 * @cpu: the processor in question.
7292 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7294 * Return: The current task for @cpu.
7296 struct task_struct *curr_task(int cpu)
7298 return cpu_curr(cpu);
7301 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
7305 * set_curr_task - set the current task for a given cpu.
7306 * @cpu: the processor in question.
7307 * @p: the task pointer to set.
7309 * Description: This function must only be used when non-maskable interrupts
7310 * are serviced on a separate stack. It allows the architecture to switch the
7311 * notion of the current task on a cpu in a non-blocking manner. This function
7312 * must be called with all CPU's synchronized, and interrupts disabled, the
7313 * and caller must save the original value of the current task (see
7314 * curr_task() above) and restore that value before reenabling interrupts and
7315 * re-starting the system.
7317 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7319 void set_curr_task(int cpu, struct task_struct *p)
7326 #ifdef CONFIG_CGROUP_SCHED
7327 /* task_group_lock serializes the addition/removal of task groups */
7328 static DEFINE_SPINLOCK(task_group_lock);
7330 static void free_sched_group(struct task_group *tg)
7332 free_fair_sched_group(tg);
7333 free_rt_sched_group(tg);
7338 /* allocate runqueue etc for a new task group */
7339 struct task_group *sched_create_group(struct task_group *parent)
7341 struct task_group *tg;
7343 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
7345 return ERR_PTR(-ENOMEM);
7347 if (!alloc_fair_sched_group(tg, parent))
7350 if (!alloc_rt_sched_group(tg, parent))
7356 free_sched_group(tg);
7357 return ERR_PTR(-ENOMEM);
7360 void sched_online_group(struct task_group *tg, struct task_group *parent)
7362 unsigned long flags;
7364 spin_lock_irqsave(&task_group_lock, flags);
7365 list_add_rcu(&tg->list, &task_groups);
7367 WARN_ON(!parent); /* root should already exist */
7369 tg->parent = parent;
7370 INIT_LIST_HEAD(&tg->children);
7371 list_add_rcu(&tg->siblings, &parent->children);
7372 spin_unlock_irqrestore(&task_group_lock, flags);
7375 /* rcu callback to free various structures associated with a task group */
7376 static void free_sched_group_rcu(struct rcu_head *rhp)
7378 /* now it should be safe to free those cfs_rqs */
7379 free_sched_group(container_of(rhp, struct task_group, rcu));
7382 /* Destroy runqueue etc associated with a task group */
7383 void sched_destroy_group(struct task_group *tg)
7385 /* wait for possible concurrent references to cfs_rqs complete */
7386 call_rcu(&tg->rcu, free_sched_group_rcu);
7389 void sched_offline_group(struct task_group *tg)
7391 unsigned long flags;
7394 /* end participation in shares distribution */
7395 for_each_possible_cpu(i)
7396 unregister_fair_sched_group(tg, i);
7398 spin_lock_irqsave(&task_group_lock, flags);
7399 list_del_rcu(&tg->list);
7400 list_del_rcu(&tg->siblings);
7401 spin_unlock_irqrestore(&task_group_lock, flags);
7404 /* change task's runqueue when it moves between groups.
7405 * The caller of this function should have put the task in its new group
7406 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
7407 * reflect its new group.
7409 void sched_move_task(struct task_struct *tsk)
7411 struct task_group *tg;
7412 int queued, running;
7413 unsigned long flags;
7416 rq = task_rq_lock(tsk, &flags);
7418 running = task_current(rq, tsk);
7419 queued = task_on_rq_queued(tsk);
7422 dequeue_task(rq, tsk, 0);
7423 if (unlikely(running))
7424 put_prev_task(rq, tsk);
7427 * All callers are synchronized by task_rq_lock(); we do not use RCU
7428 * which is pointless here. Thus, we pass "true" to task_css_check()
7429 * to prevent lockdep warnings.
7431 tg = container_of(task_css_check(tsk, cpu_cgrp_id, true),
7432 struct task_group, css);
7433 tg = autogroup_task_group(tsk, tg);
7434 tsk->sched_task_group = tg;
7436 #ifdef CONFIG_FAIR_GROUP_SCHED
7437 if (tsk->sched_class->task_move_group)
7438 tsk->sched_class->task_move_group(tsk, queued);
7441 set_task_rq(tsk, task_cpu(tsk));
7443 if (unlikely(running))
7444 tsk->sched_class->set_curr_task(rq);
7446 enqueue_task(rq, tsk, 0);
7448 task_rq_unlock(rq, tsk, &flags);
7450 #endif /* CONFIG_CGROUP_SCHED */
7452 #ifdef CONFIG_RT_GROUP_SCHED
7454 * Ensure that the real time constraints are schedulable.
7456 static DEFINE_MUTEX(rt_constraints_mutex);
7458 /* Must be called with tasklist_lock held */
7459 static inline int tg_has_rt_tasks(struct task_group *tg)
7461 struct task_struct *g, *p;
7463 for_each_process_thread(g, p) {
7464 if (rt_task(p) && task_group(p) == tg)
7471 struct rt_schedulable_data {
7472 struct task_group *tg;
7477 static int tg_rt_schedulable(struct task_group *tg, void *data)
7479 struct rt_schedulable_data *d = data;
7480 struct task_group *child;
7481 unsigned long total, sum = 0;
7482 u64 period, runtime;
7484 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7485 runtime = tg->rt_bandwidth.rt_runtime;
7488 period = d->rt_period;
7489 runtime = d->rt_runtime;
7493 * Cannot have more runtime than the period.
7495 if (runtime > period && runtime != RUNTIME_INF)
7499 * Ensure we don't starve existing RT tasks.
7501 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
7504 total = to_ratio(period, runtime);
7507 * Nobody can have more than the global setting allows.
7509 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
7513 * The sum of our children's runtime should not exceed our own.
7515 list_for_each_entry_rcu(child, &tg->children, siblings) {
7516 period = ktime_to_ns(child->rt_bandwidth.rt_period);
7517 runtime = child->rt_bandwidth.rt_runtime;
7519 if (child == d->tg) {
7520 period = d->rt_period;
7521 runtime = d->rt_runtime;
7524 sum += to_ratio(period, runtime);
7533 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
7537 struct rt_schedulable_data data = {
7539 .rt_period = period,
7540 .rt_runtime = runtime,
7544 ret = walk_tg_tree(tg_rt_schedulable, tg_nop, &data);
7550 static int tg_set_rt_bandwidth(struct task_group *tg,
7551 u64 rt_period, u64 rt_runtime)
7555 mutex_lock(&rt_constraints_mutex);
7556 read_lock(&tasklist_lock);
7557 err = __rt_schedulable(tg, rt_period, rt_runtime);
7561 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7562 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
7563 tg->rt_bandwidth.rt_runtime = rt_runtime;
7565 for_each_possible_cpu(i) {
7566 struct rt_rq *rt_rq = tg->rt_rq[i];
7568 raw_spin_lock(&rt_rq->rt_runtime_lock);
7569 rt_rq->rt_runtime = rt_runtime;
7570 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7572 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7574 read_unlock(&tasklist_lock);
7575 mutex_unlock(&rt_constraints_mutex);
7580 static int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
7582 u64 rt_runtime, rt_period;
7584 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7585 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
7586 if (rt_runtime_us < 0)
7587 rt_runtime = RUNTIME_INF;
7589 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7592 static long sched_group_rt_runtime(struct task_group *tg)
7596 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
7599 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
7600 do_div(rt_runtime_us, NSEC_PER_USEC);
7601 return rt_runtime_us;
7604 static int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
7606 u64 rt_runtime, rt_period;
7608 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
7609 rt_runtime = tg->rt_bandwidth.rt_runtime;
7614 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7617 static long sched_group_rt_period(struct task_group *tg)
7621 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
7622 do_div(rt_period_us, NSEC_PER_USEC);
7623 return rt_period_us;
7625 #endif /* CONFIG_RT_GROUP_SCHED */
7627 #ifdef CONFIG_RT_GROUP_SCHED
7628 static int sched_rt_global_constraints(void)
7632 mutex_lock(&rt_constraints_mutex);
7633 read_lock(&tasklist_lock);
7634 ret = __rt_schedulable(NULL, 0, 0);
7635 read_unlock(&tasklist_lock);
7636 mutex_unlock(&rt_constraints_mutex);
7641 static int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
7643 /* Don't accept realtime tasks when there is no way for them to run */
7644 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
7650 #else /* !CONFIG_RT_GROUP_SCHED */
7651 static int sched_rt_global_constraints(void)
7653 unsigned long flags;
7656 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
7657 for_each_possible_cpu(i) {
7658 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
7660 raw_spin_lock(&rt_rq->rt_runtime_lock);
7661 rt_rq->rt_runtime = global_rt_runtime();
7662 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7664 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
7668 #endif /* CONFIG_RT_GROUP_SCHED */
7670 static int sched_dl_global_constraints(void)
7672 u64 runtime = global_rt_runtime();
7673 u64 period = global_rt_period();
7674 u64 new_bw = to_ratio(period, runtime);
7677 unsigned long flags;
7680 * Here we want to check the bandwidth not being set to some
7681 * value smaller than the currently allocated bandwidth in
7682 * any of the root_domains.
7684 * FIXME: Cycling on all the CPUs is overdoing, but simpler than
7685 * cycling on root_domains... Discussion on different/better
7686 * solutions is welcome!
7688 for_each_possible_cpu(cpu) {
7689 rcu_read_lock_sched();
7690 dl_b = dl_bw_of(cpu);
7692 raw_spin_lock_irqsave(&dl_b->lock, flags);
7693 if (new_bw < dl_b->total_bw)
7695 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
7697 rcu_read_unlock_sched();
7706 static void sched_dl_do_global(void)
7711 unsigned long flags;
7713 def_dl_bandwidth.dl_period = global_rt_period();
7714 def_dl_bandwidth.dl_runtime = global_rt_runtime();
7716 if (global_rt_runtime() != RUNTIME_INF)
7717 new_bw = to_ratio(global_rt_period(), global_rt_runtime());
7720 * FIXME: As above...
7722 for_each_possible_cpu(cpu) {
7723 rcu_read_lock_sched();
7724 dl_b = dl_bw_of(cpu);
7726 raw_spin_lock_irqsave(&dl_b->lock, flags);
7728 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
7730 rcu_read_unlock_sched();
7734 static int sched_rt_global_validate(void)
7736 if (sysctl_sched_rt_period <= 0)
7739 if ((sysctl_sched_rt_runtime != RUNTIME_INF) &&
7740 (sysctl_sched_rt_runtime > sysctl_sched_rt_period))
7746 static void sched_rt_do_global(void)
7748 def_rt_bandwidth.rt_runtime = global_rt_runtime();
7749 def_rt_bandwidth.rt_period = ns_to_ktime(global_rt_period());
7752 int sched_rt_handler(struct ctl_table *table, int write,
7753 void __user *buffer, size_t *lenp,
7756 int old_period, old_runtime;
7757 static DEFINE_MUTEX(mutex);
7761 old_period = sysctl_sched_rt_period;
7762 old_runtime = sysctl_sched_rt_runtime;
7764 ret = proc_dointvec(table, write, buffer, lenp, ppos);
7766 if (!ret && write) {
7767 ret = sched_rt_global_validate();
7771 ret = sched_rt_global_constraints();
7775 ret = sched_dl_global_constraints();
7779 sched_rt_do_global();
7780 sched_dl_do_global();
7784 sysctl_sched_rt_period = old_period;
7785 sysctl_sched_rt_runtime = old_runtime;
7787 mutex_unlock(&mutex);
7792 int sched_rr_handler(struct ctl_table *table, int write,
7793 void __user *buffer, size_t *lenp,
7797 static DEFINE_MUTEX(mutex);
7800 ret = proc_dointvec(table, write, buffer, lenp, ppos);
7801 /* make sure that internally we keep jiffies */
7802 /* also, writing zero resets timeslice to default */
7803 if (!ret && write) {
7804 sched_rr_timeslice = sched_rr_timeslice <= 0 ?
7805 RR_TIMESLICE : msecs_to_jiffies(sched_rr_timeslice);
7807 mutex_unlock(&mutex);
7811 #ifdef CONFIG_CGROUP_SCHED
7813 static inline struct task_group *css_tg(struct cgroup_subsys_state *css)
7815 return css ? container_of(css, struct task_group, css) : NULL;
7818 static struct cgroup_subsys_state *
7819 cpu_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
7821 struct task_group *parent = css_tg(parent_css);
7822 struct task_group *tg;
7825 /* This is early initialization for the top cgroup */
7826 return &root_task_group.css;
7829 tg = sched_create_group(parent);
7831 return ERR_PTR(-ENOMEM);
7836 static int cpu_cgroup_css_online(struct cgroup_subsys_state *css)
7838 struct task_group *tg = css_tg(css);
7839 struct task_group *parent = css_tg(css->parent);
7842 sched_online_group(tg, parent);
7846 static void cpu_cgroup_css_free(struct cgroup_subsys_state *css)
7848 struct task_group *tg = css_tg(css);
7850 sched_destroy_group(tg);
7853 static void cpu_cgroup_css_offline(struct cgroup_subsys_state *css)
7855 struct task_group *tg = css_tg(css);
7857 sched_offline_group(tg);
7860 static void cpu_cgroup_fork(struct task_struct *task)
7862 sched_move_task(task);
7865 static int cpu_cgroup_can_attach(struct cgroup_subsys_state *css,
7866 struct cgroup_taskset *tset)
7868 struct task_struct *task;
7870 cgroup_taskset_for_each(task, tset) {
7871 #ifdef CONFIG_RT_GROUP_SCHED
7872 if (!sched_rt_can_attach(css_tg(css), task))
7875 /* We don't support RT-tasks being in separate groups */
7876 if (task->sched_class != &fair_sched_class)
7883 static void cpu_cgroup_attach(struct cgroup_subsys_state *css,
7884 struct cgroup_taskset *tset)
7886 struct task_struct *task;
7888 cgroup_taskset_for_each(task, tset)
7889 sched_move_task(task);
7892 static void cpu_cgroup_exit(struct cgroup_subsys_state *css,
7893 struct cgroup_subsys_state *old_css,
7894 struct task_struct *task)
7897 * cgroup_exit() is called in the copy_process() failure path.
7898 * Ignore this case since the task hasn't ran yet, this avoids
7899 * trying to poke a half freed task state from generic code.
7901 if (!(task->flags & PF_EXITING))
7904 sched_move_task(task);
7907 #ifdef CONFIG_FAIR_GROUP_SCHED
7908 static int cpu_shares_write_u64(struct cgroup_subsys_state *css,
7909 struct cftype *cftype, u64 shareval)
7911 return sched_group_set_shares(css_tg(css), scale_load(shareval));
7914 static u64 cpu_shares_read_u64(struct cgroup_subsys_state *css,
7917 struct task_group *tg = css_tg(css);
7919 return (u64) scale_load_down(tg->shares);
7922 #ifdef CONFIG_CFS_BANDWIDTH
7923 static DEFINE_MUTEX(cfs_constraints_mutex);
7925 const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */
7926 const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */
7928 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime);
7930 static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota)
7932 int i, ret = 0, runtime_enabled, runtime_was_enabled;
7933 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7935 if (tg == &root_task_group)
7939 * Ensure we have at some amount of bandwidth every period. This is
7940 * to prevent reaching a state of large arrears when throttled via
7941 * entity_tick() resulting in prolonged exit starvation.
7943 if (quota < min_cfs_quota_period || period < min_cfs_quota_period)
7947 * Likewise, bound things on the otherside by preventing insane quota
7948 * periods. This also allows us to normalize in computing quota
7951 if (period > max_cfs_quota_period)
7955 * Prevent race between setting of cfs_rq->runtime_enabled and
7956 * unthrottle_offline_cfs_rqs().
7959 mutex_lock(&cfs_constraints_mutex);
7960 ret = __cfs_schedulable(tg, period, quota);
7964 runtime_enabled = quota != RUNTIME_INF;
7965 runtime_was_enabled = cfs_b->quota != RUNTIME_INF;
7967 * If we need to toggle cfs_bandwidth_used, off->on must occur
7968 * before making related changes, and on->off must occur afterwards
7970 if (runtime_enabled && !runtime_was_enabled)
7971 cfs_bandwidth_usage_inc();
7972 raw_spin_lock_irq(&cfs_b->lock);
7973 cfs_b->period = ns_to_ktime(period);
7974 cfs_b->quota = quota;
7976 __refill_cfs_bandwidth_runtime(cfs_b);
7977 /* restart the period timer (if active) to handle new period expiry */
7978 if (runtime_enabled && cfs_b->timer_active) {
7979 /* force a reprogram */
7980 __start_cfs_bandwidth(cfs_b, true);
7982 raw_spin_unlock_irq(&cfs_b->lock);
7984 for_each_online_cpu(i) {
7985 struct cfs_rq *cfs_rq = tg->cfs_rq[i];
7986 struct rq *rq = cfs_rq->rq;
7988 raw_spin_lock_irq(&rq->lock);
7989 cfs_rq->runtime_enabled = runtime_enabled;
7990 cfs_rq->runtime_remaining = 0;
7992 if (cfs_rq->throttled)
7993 unthrottle_cfs_rq(cfs_rq);
7994 raw_spin_unlock_irq(&rq->lock);
7996 if (runtime_was_enabled && !runtime_enabled)
7997 cfs_bandwidth_usage_dec();
7999 mutex_unlock(&cfs_constraints_mutex);
8005 int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us)
8009 period = ktime_to_ns(tg->cfs_bandwidth.period);
8010 if (cfs_quota_us < 0)
8011 quota = RUNTIME_INF;
8013 quota = (u64)cfs_quota_us * NSEC_PER_USEC;
8015 return tg_set_cfs_bandwidth(tg, period, quota);
8018 long tg_get_cfs_quota(struct task_group *tg)
8022 if (tg->cfs_bandwidth.quota == RUNTIME_INF)
8025 quota_us = tg->cfs_bandwidth.quota;
8026 do_div(quota_us, NSEC_PER_USEC);
8031 int tg_set_cfs_period(struct task_group *tg, long cfs_period_us)
8035 period = (u64)cfs_period_us * NSEC_PER_USEC;
8036 quota = tg->cfs_bandwidth.quota;
8038 return tg_set_cfs_bandwidth(tg, period, quota);
8041 long tg_get_cfs_period(struct task_group *tg)
8045 cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period);
8046 do_div(cfs_period_us, NSEC_PER_USEC);
8048 return cfs_period_us;
8051 static s64 cpu_cfs_quota_read_s64(struct cgroup_subsys_state *css,
8054 return tg_get_cfs_quota(css_tg(css));
8057 static int cpu_cfs_quota_write_s64(struct cgroup_subsys_state *css,
8058 struct cftype *cftype, s64 cfs_quota_us)
8060 return tg_set_cfs_quota(css_tg(css), cfs_quota_us);
8063 static u64 cpu_cfs_period_read_u64(struct cgroup_subsys_state *css,
8066 return tg_get_cfs_period(css_tg(css));
8069 static int cpu_cfs_period_write_u64(struct cgroup_subsys_state *css,
8070 struct cftype *cftype, u64 cfs_period_us)
8072 return tg_set_cfs_period(css_tg(css), cfs_period_us);
8075 struct cfs_schedulable_data {
8076 struct task_group *tg;
8081 * normalize group quota/period to be quota/max_period
8082 * note: units are usecs
8084 static u64 normalize_cfs_quota(struct task_group *tg,
8085 struct cfs_schedulable_data *d)
8093 period = tg_get_cfs_period(tg);
8094 quota = tg_get_cfs_quota(tg);
8097 /* note: these should typically be equivalent */
8098 if (quota == RUNTIME_INF || quota == -1)
8101 return to_ratio(period, quota);
8104 static int tg_cfs_schedulable_down(struct task_group *tg, void *data)
8106 struct cfs_schedulable_data *d = data;
8107 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
8108 s64 quota = 0, parent_quota = -1;
8111 quota = RUNTIME_INF;
8113 struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth;
8115 quota = normalize_cfs_quota(tg, d);
8116 parent_quota = parent_b->hierarchical_quota;
8119 * ensure max(child_quota) <= parent_quota, inherit when no
8122 if (quota == RUNTIME_INF)
8123 quota = parent_quota;
8124 else if (parent_quota != RUNTIME_INF && quota > parent_quota)
8127 cfs_b->hierarchical_quota = quota;
8132 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota)
8135 struct cfs_schedulable_data data = {
8141 if (quota != RUNTIME_INF) {
8142 do_div(data.period, NSEC_PER_USEC);
8143 do_div(data.quota, NSEC_PER_USEC);
8147 ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data);
8153 static int cpu_stats_show(struct seq_file *sf, void *v)
8155 struct task_group *tg = css_tg(seq_css(sf));
8156 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
8158 seq_printf(sf, "nr_periods %d\n", cfs_b->nr_periods);
8159 seq_printf(sf, "nr_throttled %d\n", cfs_b->nr_throttled);
8160 seq_printf(sf, "throttled_time %llu\n", cfs_b->throttled_time);
8164 #endif /* CONFIG_CFS_BANDWIDTH */
8165 #endif /* CONFIG_FAIR_GROUP_SCHED */
8167 #ifdef CONFIG_RT_GROUP_SCHED
8168 static int cpu_rt_runtime_write(struct cgroup_subsys_state *css,
8169 struct cftype *cft, s64 val)
8171 return sched_group_set_rt_runtime(css_tg(css), val);
8174 static s64 cpu_rt_runtime_read(struct cgroup_subsys_state *css,
8177 return sched_group_rt_runtime(css_tg(css));
8180 static int cpu_rt_period_write_uint(struct cgroup_subsys_state *css,
8181 struct cftype *cftype, u64 rt_period_us)
8183 return sched_group_set_rt_period(css_tg(css), rt_period_us);
8186 static u64 cpu_rt_period_read_uint(struct cgroup_subsys_state *css,
8189 return sched_group_rt_period(css_tg(css));
8191 #endif /* CONFIG_RT_GROUP_SCHED */
8193 static struct cftype cpu_files[] = {
8194 #ifdef CONFIG_FAIR_GROUP_SCHED
8197 .read_u64 = cpu_shares_read_u64,
8198 .write_u64 = cpu_shares_write_u64,
8201 #ifdef CONFIG_CFS_BANDWIDTH
8203 .name = "cfs_quota_us",
8204 .read_s64 = cpu_cfs_quota_read_s64,
8205 .write_s64 = cpu_cfs_quota_write_s64,
8208 .name = "cfs_period_us",
8209 .read_u64 = cpu_cfs_period_read_u64,
8210 .write_u64 = cpu_cfs_period_write_u64,
8214 .seq_show = cpu_stats_show,
8217 #ifdef CONFIG_RT_GROUP_SCHED
8219 .name = "rt_runtime_us",
8220 .read_s64 = cpu_rt_runtime_read,
8221 .write_s64 = cpu_rt_runtime_write,
8224 .name = "rt_period_us",
8225 .read_u64 = cpu_rt_period_read_uint,
8226 .write_u64 = cpu_rt_period_write_uint,
8232 struct cgroup_subsys cpu_cgrp_subsys = {
8233 .css_alloc = cpu_cgroup_css_alloc,
8234 .css_free = cpu_cgroup_css_free,
8235 .css_online = cpu_cgroup_css_online,
8236 .css_offline = cpu_cgroup_css_offline,
8237 .fork = cpu_cgroup_fork,
8238 .can_attach = cpu_cgroup_can_attach,
8239 .attach = cpu_cgroup_attach,
8240 .exit = cpu_cgroup_exit,
8241 .legacy_cftypes = cpu_files,
8245 #endif /* CONFIG_CGROUP_SCHED */
8247 void dump_cpu_task(int cpu)
8249 pr_info("Task dump for CPU %d:\n", cpu);
8250 sched_show_task(cpu_curr(cpu));