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
29 #include <linux/kasan.h>
31 #include <linux/module.h>
32 #include <linux/nmi.h>
33 #include <linux/init.h>
34 #include <linux/uaccess.h>
35 #include <linux/highmem.h>
36 #include <linux/mmu_context.h>
37 #include <linux/interrupt.h>
38 #include <linux/capability.h>
39 #include <linux/completion.h>
40 #include <linux/kernel_stat.h>
41 #include <linux/debug_locks.h>
42 #include <linux/perf_event.h>
43 #include <linux/security.h>
44 #include <linux/notifier.h>
45 #include <linux/profile.h>
46 #include <linux/freezer.h>
47 #include <linux/vmalloc.h>
48 #include <linux/blkdev.h>
49 #include <linux/delay.h>
50 #include <linux/pid_namespace.h>
51 #include <linux/smp.h>
52 #include <linux/threads.h>
53 #include <linux/timer.h>
54 #include <linux/rcupdate.h>
55 #include <linux/cpu.h>
56 #include <linux/cpuset.h>
57 #include <linux/percpu.h>
58 #include <linux/proc_fs.h>
59 #include <linux/seq_file.h>
60 #include <linux/sysctl.h>
61 #include <linux/syscalls.h>
62 #include <linux/times.h>
63 #include <linux/tsacct_kern.h>
64 #include <linux/kprobes.h>
65 #include <linux/delayacct.h>
66 #include <linux/unistd.h>
67 #include <linux/pagemap.h>
68 #include <linux/hrtimer.h>
69 #include <linux/tick.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/context_tracking.h>
75 #include <linux/compiler.h>
76 #include <linux/frame.h>
77 #include <linux/prefetch.h>
78 #include <linux/mutex.h>
80 #include <asm/switch_to.h>
82 #include <asm/irq_regs.h>
83 #ifdef CONFIG_PARAVIRT
84 #include <asm/paravirt.h>
88 #include "../workqueue_internal.h"
89 #include "../smpboot.h"
91 #define CREATE_TRACE_POINTS
92 #include <trace/events/sched.h>
94 DEFINE_MUTEX(sched_domains_mutex);
95 DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
97 static void update_rq_clock_task(struct rq *rq, s64 delta);
99 void update_rq_clock(struct rq *rq)
103 lockdep_assert_held(&rq->lock);
105 if (rq->clock_skip_update & RQCF_ACT_SKIP)
108 delta = sched_clock_cpu(cpu_of(rq)) - rq->clock;
112 update_rq_clock_task(rq, delta);
116 * Debugging: various feature bits
119 #define SCHED_FEAT(name, enabled) \
120 (1UL << __SCHED_FEAT_##name) * enabled |
122 const_debug unsigned int sysctl_sched_features =
123 #include "features.h"
129 * Number of tasks to iterate in a single balance run.
130 * Limited because this is done with IRQs disabled.
132 const_debug unsigned int sysctl_sched_nr_migrate = 32;
135 * period over which we average the RT time consumption, measured
140 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
143 * period over which we measure -rt task cpu usage in us.
146 unsigned int sysctl_sched_rt_period = 1000000;
148 __read_mostly int scheduler_running;
151 * part of the period that we allow rt tasks to run in us.
154 int sysctl_sched_rt_runtime = 950000;
156 /* cpus with isolated domains */
157 cpumask_var_t cpu_isolated_map;
160 * this_rq_lock - lock this runqueue and disable interrupts.
162 static struct rq *this_rq_lock(void)
169 raw_spin_lock(&rq->lock);
175 * __task_rq_lock - lock the rq @p resides on.
177 struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf)
182 lockdep_assert_held(&p->pi_lock);
186 raw_spin_lock(&rq->lock);
187 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) {
191 raw_spin_unlock(&rq->lock);
193 while (unlikely(task_on_rq_migrating(p)))
199 * task_rq_lock - lock p->pi_lock and lock the rq @p resides on.
201 struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf)
202 __acquires(p->pi_lock)
208 raw_spin_lock_irqsave(&p->pi_lock, rf->flags);
210 raw_spin_lock(&rq->lock);
212 * move_queued_task() task_rq_lock()
215 * [S] ->on_rq = MIGRATING [L] rq = task_rq()
216 * WMB (__set_task_cpu()) ACQUIRE (rq->lock);
217 * [S] ->cpu = new_cpu [L] task_rq()
221 * If we observe the old cpu in task_rq_lock, the acquire of
222 * the old rq->lock will fully serialize against the stores.
224 * If we observe the new cpu in task_rq_lock, the acquire will
225 * pair with the WMB to ensure we must then also see migrating.
227 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) {
231 raw_spin_unlock(&rq->lock);
232 raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags);
234 while (unlikely(task_on_rq_migrating(p)))
239 #ifdef CONFIG_SCHED_HRTICK
241 * Use HR-timers to deliver accurate preemption points.
244 static void hrtick_clear(struct rq *rq)
246 if (hrtimer_active(&rq->hrtick_timer))
247 hrtimer_cancel(&rq->hrtick_timer);
251 * High-resolution timer tick.
252 * Runs from hardirq context with interrupts disabled.
254 static enum hrtimer_restart hrtick(struct hrtimer *timer)
256 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
258 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
260 raw_spin_lock(&rq->lock);
262 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
263 raw_spin_unlock(&rq->lock);
265 return HRTIMER_NORESTART;
270 static void __hrtick_restart(struct rq *rq)
272 struct hrtimer *timer = &rq->hrtick_timer;
274 hrtimer_start_expires(timer, HRTIMER_MODE_ABS_PINNED);
278 * called from hardirq (IPI) context
280 static void __hrtick_start(void *arg)
284 raw_spin_lock(&rq->lock);
285 __hrtick_restart(rq);
286 rq->hrtick_csd_pending = 0;
287 raw_spin_unlock(&rq->lock);
291 * Called to set the hrtick timer state.
293 * called with rq->lock held and irqs disabled
295 void hrtick_start(struct rq *rq, u64 delay)
297 struct hrtimer *timer = &rq->hrtick_timer;
302 * Don't schedule slices shorter than 10000ns, that just
303 * doesn't make sense and can cause timer DoS.
305 delta = max_t(s64, delay, 10000LL);
306 time = ktime_add_ns(timer->base->get_time(), delta);
308 hrtimer_set_expires(timer, time);
310 if (rq == this_rq()) {
311 __hrtick_restart(rq);
312 } else if (!rq->hrtick_csd_pending) {
313 smp_call_function_single_async(cpu_of(rq), &rq->hrtick_csd);
314 rq->hrtick_csd_pending = 1;
320 * Called to set the hrtick timer state.
322 * called with rq->lock held and irqs disabled
324 void hrtick_start(struct rq *rq, u64 delay)
327 * Don't schedule slices shorter than 10000ns, that just
328 * doesn't make sense. Rely on vruntime for fairness.
330 delay = max_t(u64, delay, 10000LL);
331 hrtimer_start(&rq->hrtick_timer, ns_to_ktime(delay),
332 HRTIMER_MODE_REL_PINNED);
334 #endif /* CONFIG_SMP */
336 static void init_rq_hrtick(struct rq *rq)
339 rq->hrtick_csd_pending = 0;
341 rq->hrtick_csd.flags = 0;
342 rq->hrtick_csd.func = __hrtick_start;
343 rq->hrtick_csd.info = rq;
346 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
347 rq->hrtick_timer.function = hrtick;
349 #else /* CONFIG_SCHED_HRTICK */
350 static inline void hrtick_clear(struct rq *rq)
354 static inline void init_rq_hrtick(struct rq *rq)
357 #endif /* CONFIG_SCHED_HRTICK */
360 * cmpxchg based fetch_or, macro so it works for different integer types
362 #define fetch_or(ptr, mask) \
364 typeof(ptr) _ptr = (ptr); \
365 typeof(mask) _mask = (mask); \
366 typeof(*_ptr) _old, _val = *_ptr; \
369 _old = cmpxchg(_ptr, _val, _val | _mask); \
377 #if defined(CONFIG_SMP) && defined(TIF_POLLING_NRFLAG)
379 * Atomically set TIF_NEED_RESCHED and test for TIF_POLLING_NRFLAG,
380 * this avoids any races wrt polling state changes and thereby avoids
383 static bool set_nr_and_not_polling(struct task_struct *p)
385 struct thread_info *ti = task_thread_info(p);
386 return !(fetch_or(&ti->flags, _TIF_NEED_RESCHED) & _TIF_POLLING_NRFLAG);
390 * Atomically set TIF_NEED_RESCHED if TIF_POLLING_NRFLAG is set.
392 * If this returns true, then the idle task promises to call
393 * sched_ttwu_pending() and reschedule soon.
395 static bool set_nr_if_polling(struct task_struct *p)
397 struct thread_info *ti = task_thread_info(p);
398 typeof(ti->flags) old, val = READ_ONCE(ti->flags);
401 if (!(val & _TIF_POLLING_NRFLAG))
403 if (val & _TIF_NEED_RESCHED)
405 old = cmpxchg(&ti->flags, val, val | _TIF_NEED_RESCHED);
414 static bool set_nr_and_not_polling(struct task_struct *p)
416 set_tsk_need_resched(p);
421 static bool set_nr_if_polling(struct task_struct *p)
428 void wake_q_add(struct wake_q_head *head, struct task_struct *task)
430 struct wake_q_node *node = &task->wake_q;
433 * Atomically grab the task, if ->wake_q is !nil already it means
434 * its already queued (either by us or someone else) and will get the
435 * wakeup due to that.
437 * This cmpxchg() implies a full barrier, which pairs with the write
438 * barrier implied by the wakeup in wake_up_q().
440 if (cmpxchg(&node->next, NULL, WAKE_Q_TAIL))
443 get_task_struct(task);
446 * The head is context local, there can be no concurrency.
449 head->lastp = &node->next;
452 void wake_up_q(struct wake_q_head *head)
454 struct wake_q_node *node = head->first;
456 while (node != WAKE_Q_TAIL) {
457 struct task_struct *task;
459 task = container_of(node, struct task_struct, wake_q);
461 /* task can safely be re-inserted now */
463 task->wake_q.next = NULL;
466 * wake_up_process() implies a wmb() to pair with the queueing
467 * in wake_q_add() so as not to miss wakeups.
469 wake_up_process(task);
470 put_task_struct(task);
475 * resched_curr - mark rq's current task 'to be rescheduled now'.
477 * On UP this means the setting of the need_resched flag, on SMP it
478 * might also involve a cross-CPU call to trigger the scheduler on
481 void resched_curr(struct rq *rq)
483 struct task_struct *curr = rq->curr;
486 lockdep_assert_held(&rq->lock);
488 if (test_tsk_need_resched(curr))
493 if (cpu == smp_processor_id()) {
494 set_tsk_need_resched(curr);
495 set_preempt_need_resched();
499 if (set_nr_and_not_polling(curr))
500 smp_send_reschedule(cpu);
502 trace_sched_wake_idle_without_ipi(cpu);
505 void resched_cpu(int cpu)
507 struct rq *rq = cpu_rq(cpu);
510 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
513 raw_spin_unlock_irqrestore(&rq->lock, flags);
517 #ifdef CONFIG_NO_HZ_COMMON
519 * In the semi idle case, use the nearest busy cpu for migrating timers
520 * from an idle cpu. This is good for power-savings.
522 * We don't do similar optimization for completely idle system, as
523 * selecting an idle cpu will add more delays to the timers than intended
524 * (as that cpu's timer base may not be uptodate wrt jiffies etc).
526 int get_nohz_timer_target(void)
528 int i, cpu = smp_processor_id();
529 struct sched_domain *sd;
531 if (!idle_cpu(cpu) && is_housekeeping_cpu(cpu))
535 for_each_domain(cpu, sd) {
536 for_each_cpu(i, sched_domain_span(sd)) {
540 if (!idle_cpu(i) && is_housekeeping_cpu(i)) {
547 if (!is_housekeeping_cpu(cpu))
548 cpu = housekeeping_any_cpu();
554 * When add_timer_on() enqueues a timer into the timer wheel of an
555 * idle CPU then this timer might expire before the next timer event
556 * which is scheduled to wake up that CPU. In case of a completely
557 * idle system the next event might even be infinite time into the
558 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
559 * leaves the inner idle loop so the newly added timer is taken into
560 * account when the CPU goes back to idle and evaluates the timer
561 * wheel for the next timer event.
563 static void wake_up_idle_cpu(int cpu)
565 struct rq *rq = cpu_rq(cpu);
567 if (cpu == smp_processor_id())
570 if (set_nr_and_not_polling(rq->idle))
571 smp_send_reschedule(cpu);
573 trace_sched_wake_idle_without_ipi(cpu);
576 static bool wake_up_full_nohz_cpu(int cpu)
579 * We just need the target to call irq_exit() and re-evaluate
580 * the next tick. The nohz full kick at least implies that.
581 * If needed we can still optimize that later with an
584 if (cpu_is_offline(cpu))
585 return true; /* Don't try to wake offline CPUs. */
586 if (tick_nohz_full_cpu(cpu)) {
587 if (cpu != smp_processor_id() ||
588 tick_nohz_tick_stopped())
589 tick_nohz_full_kick_cpu(cpu);
597 * Wake up the specified CPU. If the CPU is going offline, it is the
598 * caller's responsibility to deal with the lost wakeup, for example,
599 * by hooking into the CPU_DEAD notifier like timers and hrtimers do.
601 void wake_up_nohz_cpu(int cpu)
603 if (!wake_up_full_nohz_cpu(cpu))
604 wake_up_idle_cpu(cpu);
607 static inline bool got_nohz_idle_kick(void)
609 int cpu = smp_processor_id();
611 if (!test_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu)))
614 if (idle_cpu(cpu) && !need_resched())
618 * We can't run Idle Load Balance on this CPU for this time so we
619 * cancel it and clear NOHZ_BALANCE_KICK
621 clear_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu));
625 #else /* CONFIG_NO_HZ_COMMON */
627 static inline bool got_nohz_idle_kick(void)
632 #endif /* CONFIG_NO_HZ_COMMON */
634 #ifdef CONFIG_NO_HZ_FULL
635 bool sched_can_stop_tick(struct rq *rq)
639 /* Deadline tasks, even if single, need the tick */
640 if (rq->dl.dl_nr_running)
644 * If there are more than one RR tasks, we need the tick to effect the
645 * actual RR behaviour.
647 if (rq->rt.rr_nr_running) {
648 if (rq->rt.rr_nr_running == 1)
655 * If there's no RR tasks, but FIFO tasks, we can skip the tick, no
656 * forced preemption between FIFO tasks.
658 fifo_nr_running = rq->rt.rt_nr_running - rq->rt.rr_nr_running;
663 * If there are no DL,RR/FIFO tasks, there must only be CFS tasks left;
664 * if there's more than one we need the tick for involuntary
667 if (rq->nr_running > 1)
672 #endif /* CONFIG_NO_HZ_FULL */
674 void sched_avg_update(struct rq *rq)
676 s64 period = sched_avg_period();
678 while ((s64)(rq_clock(rq) - rq->age_stamp) > period) {
680 * Inline assembly required to prevent the compiler
681 * optimising this loop into a divmod call.
682 * See __iter_div_u64_rem() for another example of this.
684 asm("" : "+rm" (rq->age_stamp));
685 rq->age_stamp += period;
690 #endif /* CONFIG_SMP */
692 #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \
693 (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH)))
695 * Iterate task_group tree rooted at *from, calling @down when first entering a
696 * node and @up when leaving it for the final time.
698 * Caller must hold rcu_lock or sufficient equivalent.
700 int walk_tg_tree_from(struct task_group *from,
701 tg_visitor down, tg_visitor up, void *data)
703 struct task_group *parent, *child;
709 ret = (*down)(parent, data);
712 list_for_each_entry_rcu(child, &parent->children, siblings) {
719 ret = (*up)(parent, data);
720 if (ret || parent == from)
724 parent = parent->parent;
731 int tg_nop(struct task_group *tg, void *data)
737 static void set_load_weight(struct task_struct *p)
739 int prio = p->static_prio - MAX_RT_PRIO;
740 struct load_weight *load = &p->se.load;
743 * SCHED_IDLE tasks get minimal weight:
745 if (idle_policy(p->policy)) {
746 load->weight = scale_load(WEIGHT_IDLEPRIO);
747 load->inv_weight = WMULT_IDLEPRIO;
751 load->weight = scale_load(sched_prio_to_weight[prio]);
752 load->inv_weight = sched_prio_to_wmult[prio];
755 static inline void enqueue_task(struct rq *rq, struct task_struct *p, int flags)
758 if (!(flags & ENQUEUE_RESTORE))
759 sched_info_queued(rq, p);
760 p->sched_class->enqueue_task(rq, p, flags);
763 static inline void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
766 if (!(flags & DEQUEUE_SAVE))
767 sched_info_dequeued(rq, p);
768 p->sched_class->dequeue_task(rq, p, flags);
771 void activate_task(struct rq *rq, struct task_struct *p, int flags)
773 if (task_contributes_to_load(p))
774 rq->nr_uninterruptible--;
776 enqueue_task(rq, p, flags);
779 void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
781 if (task_contributes_to_load(p))
782 rq->nr_uninterruptible++;
784 dequeue_task(rq, p, flags);
787 static void update_rq_clock_task(struct rq *rq, s64 delta)
790 * In theory, the compile should just see 0 here, and optimize out the call
791 * to sched_rt_avg_update. But I don't trust it...
793 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
794 s64 steal = 0, irq_delta = 0;
796 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
797 irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time;
800 * Since irq_time is only updated on {soft,}irq_exit, we might run into
801 * this case when a previous update_rq_clock() happened inside a
804 * When this happens, we stop ->clock_task and only update the
805 * prev_irq_time stamp to account for the part that fit, so that a next
806 * update will consume the rest. This ensures ->clock_task is
809 * It does however cause some slight miss-attribution of {soft,}irq
810 * time, a more accurate solution would be to update the irq_time using
811 * the current rq->clock timestamp, except that would require using
814 if (irq_delta > delta)
817 rq->prev_irq_time += irq_delta;
820 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
821 if (static_key_false((¶virt_steal_rq_enabled))) {
822 steal = paravirt_steal_clock(cpu_of(rq));
823 steal -= rq->prev_steal_time_rq;
825 if (unlikely(steal > delta))
828 rq->prev_steal_time_rq += steal;
833 rq->clock_task += delta;
835 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
836 if ((irq_delta + steal) && sched_feat(NONTASK_CAPACITY))
837 sched_rt_avg_update(rq, irq_delta + steal);
841 void sched_set_stop_task(int cpu, struct task_struct *stop)
843 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
844 struct task_struct *old_stop = cpu_rq(cpu)->stop;
848 * Make it appear like a SCHED_FIFO task, its something
849 * userspace knows about and won't get confused about.
851 * Also, it will make PI more or less work without too
852 * much confusion -- but then, stop work should not
853 * rely on PI working anyway.
855 sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m);
857 stop->sched_class = &stop_sched_class;
860 cpu_rq(cpu)->stop = stop;
864 * Reset it back to a normal scheduling class so that
865 * it can die in pieces.
867 old_stop->sched_class = &rt_sched_class;
872 * __normal_prio - return the priority that is based on the static prio
874 static inline int __normal_prio(struct task_struct *p)
876 return p->static_prio;
880 * Calculate the expected normal priority: i.e. priority
881 * without taking RT-inheritance into account. Might be
882 * boosted by interactivity modifiers. Changes upon fork,
883 * setprio syscalls, and whenever the interactivity
884 * estimator recalculates.
886 static inline int normal_prio(struct task_struct *p)
890 if (task_has_dl_policy(p))
891 prio = MAX_DL_PRIO-1;
892 else if (task_has_rt_policy(p))
893 prio = MAX_RT_PRIO-1 - p->rt_priority;
895 prio = __normal_prio(p);
900 * Calculate the current priority, i.e. the priority
901 * taken into account by the scheduler. This value might
902 * be boosted by RT tasks, or might be boosted by
903 * interactivity modifiers. Will be RT if the task got
904 * RT-boosted. If not then it returns p->normal_prio.
906 static int effective_prio(struct task_struct *p)
908 p->normal_prio = normal_prio(p);
910 * If we are RT tasks or we were boosted to RT priority,
911 * keep the priority unchanged. Otherwise, update priority
912 * to the normal priority:
914 if (!rt_prio(p->prio))
915 return p->normal_prio;
920 * task_curr - is this task currently executing on a CPU?
921 * @p: the task in question.
923 * Return: 1 if the task is currently executing. 0 otherwise.
925 inline int task_curr(const struct task_struct *p)
927 return cpu_curr(task_cpu(p)) == p;
931 * switched_from, switched_to and prio_changed must _NOT_ drop rq->lock,
932 * use the balance_callback list if you want balancing.
934 * this means any call to check_class_changed() must be followed by a call to
935 * balance_callback().
937 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
938 const struct sched_class *prev_class,
941 if (prev_class != p->sched_class) {
942 if (prev_class->switched_from)
943 prev_class->switched_from(rq, p);
945 p->sched_class->switched_to(rq, p);
946 } else if (oldprio != p->prio || dl_task(p))
947 p->sched_class->prio_changed(rq, p, oldprio);
950 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
952 const struct sched_class *class;
954 if (p->sched_class == rq->curr->sched_class) {
955 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
957 for_each_class(class) {
958 if (class == rq->curr->sched_class)
960 if (class == p->sched_class) {
968 * A queue event has occurred, and we're going to schedule. In
969 * this case, we can save a useless back to back clock update.
971 if (task_on_rq_queued(rq->curr) && test_tsk_need_resched(rq->curr))
972 rq_clock_skip_update(rq, true);
977 * This is how migration works:
979 * 1) we invoke migration_cpu_stop() on the target CPU using
981 * 2) stopper starts to run (implicitly forcing the migrated thread
983 * 3) it checks whether the migrated task is still in the wrong runqueue.
984 * 4) if it's in the wrong runqueue then the migration thread removes
985 * it and puts it into the right queue.
986 * 5) stopper completes and stop_one_cpu() returns and the migration
991 * move_queued_task - move a queued task to new rq.
993 * Returns (locked) new rq. Old rq's lock is released.
995 static struct rq *move_queued_task(struct rq *rq, struct task_struct *p, int new_cpu)
997 lockdep_assert_held(&rq->lock);
999 p->on_rq = TASK_ON_RQ_MIGRATING;
1000 dequeue_task(rq, p, 0);
1001 set_task_cpu(p, new_cpu);
1002 raw_spin_unlock(&rq->lock);
1004 rq = cpu_rq(new_cpu);
1006 raw_spin_lock(&rq->lock);
1007 BUG_ON(task_cpu(p) != new_cpu);
1008 enqueue_task(rq, p, 0);
1009 p->on_rq = TASK_ON_RQ_QUEUED;
1010 check_preempt_curr(rq, p, 0);
1015 struct migration_arg {
1016 struct task_struct *task;
1021 * Move (not current) task off this cpu, onto dest cpu. We're doing
1022 * this because either it can't run here any more (set_cpus_allowed()
1023 * away from this CPU, or CPU going down), or because we're
1024 * attempting to rebalance this task on exec (sched_exec).
1026 * So we race with normal scheduler movements, but that's OK, as long
1027 * as the task is no longer on this CPU.
1029 static struct rq *__migrate_task(struct rq *rq, struct task_struct *p, int dest_cpu)
1031 if (unlikely(!cpu_active(dest_cpu)))
1034 /* Affinity changed (again). */
1035 if (!cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
1038 rq = move_queued_task(rq, p, dest_cpu);
1044 * migration_cpu_stop - this will be executed by a highprio stopper thread
1045 * and performs thread migration by bumping thread off CPU then
1046 * 'pushing' onto another runqueue.
1048 static int migration_cpu_stop(void *data)
1050 struct migration_arg *arg = data;
1051 struct task_struct *p = arg->task;
1052 struct rq *rq = this_rq();
1055 * The original target cpu might have gone down and we might
1056 * be on another cpu but it doesn't matter.
1058 local_irq_disable();
1060 * We need to explicitly wake pending tasks before running
1061 * __migrate_task() such that we will not miss enforcing cpus_allowed
1062 * during wakeups, see set_cpus_allowed_ptr()'s TASK_WAKING test.
1064 sched_ttwu_pending();
1066 raw_spin_lock(&p->pi_lock);
1067 raw_spin_lock(&rq->lock);
1069 * If task_rq(p) != rq, it cannot be migrated here, because we're
1070 * holding rq->lock, if p->on_rq == 0 it cannot get enqueued because
1071 * we're holding p->pi_lock.
1073 if (task_rq(p) == rq) {
1074 if (task_on_rq_queued(p))
1075 rq = __migrate_task(rq, p, arg->dest_cpu);
1077 p->wake_cpu = arg->dest_cpu;
1079 raw_spin_unlock(&rq->lock);
1080 raw_spin_unlock(&p->pi_lock);
1087 * sched_class::set_cpus_allowed must do the below, but is not required to
1088 * actually call this function.
1090 void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask)
1092 cpumask_copy(&p->cpus_allowed, new_mask);
1093 p->nr_cpus_allowed = cpumask_weight(new_mask);
1096 void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask)
1098 struct rq *rq = task_rq(p);
1099 bool queued, running;
1101 lockdep_assert_held(&p->pi_lock);
1103 queued = task_on_rq_queued(p);
1104 running = task_current(rq, p);
1108 * Because __kthread_bind() calls this on blocked tasks without
1111 lockdep_assert_held(&rq->lock);
1112 dequeue_task(rq, p, DEQUEUE_SAVE);
1115 put_prev_task(rq, p);
1117 p->sched_class->set_cpus_allowed(p, new_mask);
1120 enqueue_task(rq, p, ENQUEUE_RESTORE);
1122 set_curr_task(rq, p);
1126 * Change a given task's CPU affinity. Migrate the thread to a
1127 * proper CPU and schedule it away if the CPU it's executing on
1128 * is removed from the allowed bitmask.
1130 * NOTE: the caller must have a valid reference to the task, the
1131 * task must not exit() & deallocate itself prematurely. The
1132 * call is not atomic; no spinlocks may be held.
1134 static int __set_cpus_allowed_ptr(struct task_struct *p,
1135 const struct cpumask *new_mask, bool check)
1137 const struct cpumask *cpu_valid_mask = cpu_active_mask;
1138 unsigned int dest_cpu;
1143 rq = task_rq_lock(p, &rf);
1145 if (p->flags & PF_KTHREAD) {
1147 * Kernel threads are allowed on online && !active CPUs
1149 cpu_valid_mask = cpu_online_mask;
1153 * Must re-check here, to close a race against __kthread_bind(),
1154 * sched_setaffinity() is not guaranteed to observe the flag.
1156 if (check && (p->flags & PF_NO_SETAFFINITY)) {
1161 if (cpumask_equal(&p->cpus_allowed, new_mask))
1164 if (!cpumask_intersects(new_mask, cpu_valid_mask)) {
1169 do_set_cpus_allowed(p, new_mask);
1171 if (p->flags & PF_KTHREAD) {
1173 * For kernel threads that do indeed end up on online &&
1174 * !active we want to ensure they are strict per-cpu threads.
1176 WARN_ON(cpumask_intersects(new_mask, cpu_online_mask) &&
1177 !cpumask_intersects(new_mask, cpu_active_mask) &&
1178 p->nr_cpus_allowed != 1);
1181 /* Can the task run on the task's current CPU? If so, we're done */
1182 if (cpumask_test_cpu(task_cpu(p), new_mask))
1185 dest_cpu = cpumask_any_and(cpu_valid_mask, new_mask);
1186 if (task_running(rq, p) || p->state == TASK_WAKING) {
1187 struct migration_arg arg = { p, dest_cpu };
1188 /* Need help from migration thread: drop lock and wait. */
1189 task_rq_unlock(rq, p, &rf);
1190 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
1191 tlb_migrate_finish(p->mm);
1193 } else if (task_on_rq_queued(p)) {
1195 * OK, since we're going to drop the lock immediately
1196 * afterwards anyway.
1198 rq_unpin_lock(rq, &rf);
1199 rq = move_queued_task(rq, p, dest_cpu);
1200 rq_repin_lock(rq, &rf);
1203 task_rq_unlock(rq, p, &rf);
1208 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
1210 return __set_cpus_allowed_ptr(p, new_mask, false);
1212 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
1214 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1216 #ifdef CONFIG_SCHED_DEBUG
1218 * We should never call set_task_cpu() on a blocked task,
1219 * ttwu() will sort out the placement.
1221 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
1225 * Migrating fair class task must have p->on_rq = TASK_ON_RQ_MIGRATING,
1226 * because schedstat_wait_{start,end} rebase migrating task's wait_start
1227 * time relying on p->on_rq.
1229 WARN_ON_ONCE(p->state == TASK_RUNNING &&
1230 p->sched_class == &fair_sched_class &&
1231 (p->on_rq && !task_on_rq_migrating(p)));
1233 #ifdef CONFIG_LOCKDEP
1235 * The caller should hold either p->pi_lock or rq->lock, when changing
1236 * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks.
1238 * sched_move_task() holds both and thus holding either pins the cgroup,
1241 * Furthermore, all task_rq users should acquire both locks, see
1244 WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) ||
1245 lockdep_is_held(&task_rq(p)->lock)));
1249 trace_sched_migrate_task(p, new_cpu);
1251 if (task_cpu(p) != new_cpu) {
1252 if (p->sched_class->migrate_task_rq)
1253 p->sched_class->migrate_task_rq(p);
1254 p->se.nr_migrations++;
1255 perf_event_task_migrate(p);
1258 __set_task_cpu(p, new_cpu);
1261 static void __migrate_swap_task(struct task_struct *p, int cpu)
1263 if (task_on_rq_queued(p)) {
1264 struct rq *src_rq, *dst_rq;
1266 src_rq = task_rq(p);
1267 dst_rq = cpu_rq(cpu);
1269 p->on_rq = TASK_ON_RQ_MIGRATING;
1270 deactivate_task(src_rq, p, 0);
1271 set_task_cpu(p, cpu);
1272 activate_task(dst_rq, p, 0);
1273 p->on_rq = TASK_ON_RQ_QUEUED;
1274 check_preempt_curr(dst_rq, p, 0);
1277 * Task isn't running anymore; make it appear like we migrated
1278 * it before it went to sleep. This means on wakeup we make the
1279 * previous cpu our target instead of where it really is.
1285 struct migration_swap_arg {
1286 struct task_struct *src_task, *dst_task;
1287 int src_cpu, dst_cpu;
1290 static int migrate_swap_stop(void *data)
1292 struct migration_swap_arg *arg = data;
1293 struct rq *src_rq, *dst_rq;
1296 if (!cpu_active(arg->src_cpu) || !cpu_active(arg->dst_cpu))
1299 src_rq = cpu_rq(arg->src_cpu);
1300 dst_rq = cpu_rq(arg->dst_cpu);
1302 double_raw_lock(&arg->src_task->pi_lock,
1303 &arg->dst_task->pi_lock);
1304 double_rq_lock(src_rq, dst_rq);
1306 if (task_cpu(arg->dst_task) != arg->dst_cpu)
1309 if (task_cpu(arg->src_task) != arg->src_cpu)
1312 if (!cpumask_test_cpu(arg->dst_cpu, tsk_cpus_allowed(arg->src_task)))
1315 if (!cpumask_test_cpu(arg->src_cpu, tsk_cpus_allowed(arg->dst_task)))
1318 __migrate_swap_task(arg->src_task, arg->dst_cpu);
1319 __migrate_swap_task(arg->dst_task, arg->src_cpu);
1324 double_rq_unlock(src_rq, dst_rq);
1325 raw_spin_unlock(&arg->dst_task->pi_lock);
1326 raw_spin_unlock(&arg->src_task->pi_lock);
1332 * Cross migrate two tasks
1334 int migrate_swap(struct task_struct *cur, struct task_struct *p)
1336 struct migration_swap_arg arg;
1339 arg = (struct migration_swap_arg){
1341 .src_cpu = task_cpu(cur),
1343 .dst_cpu = task_cpu(p),
1346 if (arg.src_cpu == arg.dst_cpu)
1350 * These three tests are all lockless; this is OK since all of them
1351 * will be re-checked with proper locks held further down the line.
1353 if (!cpu_active(arg.src_cpu) || !cpu_active(arg.dst_cpu))
1356 if (!cpumask_test_cpu(arg.dst_cpu, tsk_cpus_allowed(arg.src_task)))
1359 if (!cpumask_test_cpu(arg.src_cpu, tsk_cpus_allowed(arg.dst_task)))
1362 trace_sched_swap_numa(cur, arg.src_cpu, p, arg.dst_cpu);
1363 ret = stop_two_cpus(arg.dst_cpu, arg.src_cpu, migrate_swap_stop, &arg);
1370 * wait_task_inactive - wait for a thread to unschedule.
1372 * If @match_state is nonzero, it's the @p->state value just checked and
1373 * not expected to change. If it changes, i.e. @p might have woken up,
1374 * then return zero. When we succeed in waiting for @p to be off its CPU,
1375 * we return a positive number (its total switch count). If a second call
1376 * a short while later returns the same number, the caller can be sure that
1377 * @p has remained unscheduled the whole time.
1379 * The caller must ensure that the task *will* unschedule sometime soon,
1380 * else this function might spin for a *long* time. This function can't
1381 * be called with interrupts off, or it may introduce deadlock with
1382 * smp_call_function() if an IPI is sent by the same process we are
1383 * waiting to become inactive.
1385 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
1387 int running, queued;
1394 * We do the initial early heuristics without holding
1395 * any task-queue locks at all. We'll only try to get
1396 * the runqueue lock when things look like they will
1402 * If the task is actively running on another CPU
1403 * still, just relax and busy-wait without holding
1406 * NOTE! Since we don't hold any locks, it's not
1407 * even sure that "rq" stays as the right runqueue!
1408 * But we don't care, since "task_running()" will
1409 * return false if the runqueue has changed and p
1410 * is actually now running somewhere else!
1412 while (task_running(rq, p)) {
1413 if (match_state && unlikely(p->state != match_state))
1419 * Ok, time to look more closely! We need the rq
1420 * lock now, to be *sure*. If we're wrong, we'll
1421 * just go back and repeat.
1423 rq = task_rq_lock(p, &rf);
1424 trace_sched_wait_task(p);
1425 running = task_running(rq, p);
1426 queued = task_on_rq_queued(p);
1428 if (!match_state || p->state == match_state)
1429 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
1430 task_rq_unlock(rq, p, &rf);
1433 * If it changed from the expected state, bail out now.
1435 if (unlikely(!ncsw))
1439 * Was it really running after all now that we
1440 * checked with the proper locks actually held?
1442 * Oops. Go back and try again..
1444 if (unlikely(running)) {
1450 * It's not enough that it's not actively running,
1451 * it must be off the runqueue _entirely_, and not
1454 * So if it was still runnable (but just not actively
1455 * running right now), it's preempted, and we should
1456 * yield - it could be a while.
1458 if (unlikely(queued)) {
1459 ktime_t to = NSEC_PER_SEC / HZ;
1461 set_current_state(TASK_UNINTERRUPTIBLE);
1462 schedule_hrtimeout(&to, HRTIMER_MODE_REL);
1467 * Ahh, all good. It wasn't running, and it wasn't
1468 * runnable, which means that it will never become
1469 * running in the future either. We're all done!
1478 * kick_process - kick a running thread to enter/exit the kernel
1479 * @p: the to-be-kicked thread
1481 * Cause a process which is running on another CPU to enter
1482 * kernel-mode, without any delay. (to get signals handled.)
1484 * NOTE: this function doesn't have to take the runqueue lock,
1485 * because all it wants to ensure is that the remote task enters
1486 * the kernel. If the IPI races and the task has been migrated
1487 * to another CPU then no harm is done and the purpose has been
1490 void kick_process(struct task_struct *p)
1496 if ((cpu != smp_processor_id()) && task_curr(p))
1497 smp_send_reschedule(cpu);
1500 EXPORT_SYMBOL_GPL(kick_process);
1503 * ->cpus_allowed is protected by both rq->lock and p->pi_lock
1505 * A few notes on cpu_active vs cpu_online:
1507 * - cpu_active must be a subset of cpu_online
1509 * - on cpu-up we allow per-cpu kthreads on the online && !active cpu,
1510 * see __set_cpus_allowed_ptr(). At this point the newly online
1511 * cpu isn't yet part of the sched domains, and balancing will not
1514 * - on cpu-down we clear cpu_active() to mask the sched domains and
1515 * avoid the load balancer to place new tasks on the to be removed
1516 * cpu. Existing tasks will remain running there and will be taken
1519 * This means that fallback selection must not select !active CPUs.
1520 * And can assume that any active CPU must be online. Conversely
1521 * select_task_rq() below may allow selection of !active CPUs in order
1522 * to satisfy the above rules.
1524 static int select_fallback_rq(int cpu, struct task_struct *p)
1526 int nid = cpu_to_node(cpu);
1527 const struct cpumask *nodemask = NULL;
1528 enum { cpuset, possible, fail } state = cpuset;
1532 * If the node that the cpu is on has been offlined, cpu_to_node()
1533 * will return -1. There is no cpu on the node, and we should
1534 * select the cpu on the other node.
1537 nodemask = cpumask_of_node(nid);
1539 /* Look for allowed, online CPU in same node. */
1540 for_each_cpu(dest_cpu, nodemask) {
1541 if (!cpu_active(dest_cpu))
1543 if (cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
1549 /* Any allowed, online CPU? */
1550 for_each_cpu(dest_cpu, tsk_cpus_allowed(p)) {
1551 if (!(p->flags & PF_KTHREAD) && !cpu_active(dest_cpu))
1553 if (!cpu_online(dest_cpu))
1558 /* No more Mr. Nice Guy. */
1561 if (IS_ENABLED(CONFIG_CPUSETS)) {
1562 cpuset_cpus_allowed_fallback(p);
1568 do_set_cpus_allowed(p, cpu_possible_mask);
1579 if (state != cpuset) {
1581 * Don't tell them about moving exiting tasks or
1582 * kernel threads (both mm NULL), since they never
1585 if (p->mm && printk_ratelimit()) {
1586 printk_deferred("process %d (%s) no longer affine to cpu%d\n",
1587 task_pid_nr(p), p->comm, cpu);
1595 * The caller (fork, wakeup) owns p->pi_lock, ->cpus_allowed is stable.
1598 int select_task_rq(struct task_struct *p, int cpu, int sd_flags, int wake_flags)
1600 lockdep_assert_held(&p->pi_lock);
1602 if (tsk_nr_cpus_allowed(p) > 1)
1603 cpu = p->sched_class->select_task_rq(p, cpu, sd_flags, wake_flags);
1605 cpu = cpumask_any(tsk_cpus_allowed(p));
1608 * In order not to call set_task_cpu() on a blocking task we need
1609 * to rely on ttwu() to place the task on a valid ->cpus_allowed
1612 * Since this is common to all placement strategies, this lives here.
1614 * [ this allows ->select_task() to simply return task_cpu(p) and
1615 * not worry about this generic constraint ]
1617 if (unlikely(!cpumask_test_cpu(cpu, tsk_cpus_allowed(p)) ||
1619 cpu = select_fallback_rq(task_cpu(p), p);
1624 static void update_avg(u64 *avg, u64 sample)
1626 s64 diff = sample - *avg;
1632 static inline int __set_cpus_allowed_ptr(struct task_struct *p,
1633 const struct cpumask *new_mask, bool check)
1635 return set_cpus_allowed_ptr(p, new_mask);
1638 #endif /* CONFIG_SMP */
1641 ttwu_stat(struct task_struct *p, int cpu, int wake_flags)
1645 if (!schedstat_enabled())
1651 if (cpu == rq->cpu) {
1652 schedstat_inc(rq->ttwu_local);
1653 schedstat_inc(p->se.statistics.nr_wakeups_local);
1655 struct sched_domain *sd;
1657 schedstat_inc(p->se.statistics.nr_wakeups_remote);
1659 for_each_domain(rq->cpu, sd) {
1660 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
1661 schedstat_inc(sd->ttwu_wake_remote);
1668 if (wake_flags & WF_MIGRATED)
1669 schedstat_inc(p->se.statistics.nr_wakeups_migrate);
1670 #endif /* CONFIG_SMP */
1672 schedstat_inc(rq->ttwu_count);
1673 schedstat_inc(p->se.statistics.nr_wakeups);
1675 if (wake_flags & WF_SYNC)
1676 schedstat_inc(p->se.statistics.nr_wakeups_sync);
1679 static inline void ttwu_activate(struct rq *rq, struct task_struct *p, int en_flags)
1681 activate_task(rq, p, en_flags);
1682 p->on_rq = TASK_ON_RQ_QUEUED;
1684 /* if a worker is waking up, notify workqueue */
1685 if (p->flags & PF_WQ_WORKER)
1686 wq_worker_waking_up(p, cpu_of(rq));
1690 * Mark the task runnable and perform wakeup-preemption.
1692 static void ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags,
1693 struct rq_flags *rf)
1695 check_preempt_curr(rq, p, wake_flags);
1696 p->state = TASK_RUNNING;
1697 trace_sched_wakeup(p);
1700 if (p->sched_class->task_woken) {
1702 * Our task @p is fully woken up and running; so its safe to
1703 * drop the rq->lock, hereafter rq is only used for statistics.
1705 rq_unpin_lock(rq, rf);
1706 p->sched_class->task_woken(rq, p);
1707 rq_repin_lock(rq, rf);
1710 if (rq->idle_stamp) {
1711 u64 delta = rq_clock(rq) - rq->idle_stamp;
1712 u64 max = 2*rq->max_idle_balance_cost;
1714 update_avg(&rq->avg_idle, delta);
1716 if (rq->avg_idle > max)
1725 ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags,
1726 struct rq_flags *rf)
1728 int en_flags = ENQUEUE_WAKEUP;
1730 lockdep_assert_held(&rq->lock);
1733 if (p->sched_contributes_to_load)
1734 rq->nr_uninterruptible--;
1736 if (wake_flags & WF_MIGRATED)
1737 en_flags |= ENQUEUE_MIGRATED;
1740 ttwu_activate(rq, p, en_flags);
1741 ttwu_do_wakeup(rq, p, wake_flags, rf);
1745 * Called in case the task @p isn't fully descheduled from its runqueue,
1746 * in this case we must do a remote wakeup. Its a 'light' wakeup though,
1747 * since all we need to do is flip p->state to TASK_RUNNING, since
1748 * the task is still ->on_rq.
1750 static int ttwu_remote(struct task_struct *p, int wake_flags)
1756 rq = __task_rq_lock(p, &rf);
1757 if (task_on_rq_queued(p)) {
1758 /* check_preempt_curr() may use rq clock */
1759 update_rq_clock(rq);
1760 ttwu_do_wakeup(rq, p, wake_flags, &rf);
1763 __task_rq_unlock(rq, &rf);
1769 void sched_ttwu_pending(void)
1771 struct rq *rq = this_rq();
1772 struct llist_node *llist = llist_del_all(&rq->wake_list);
1773 struct task_struct *p;
1774 unsigned long flags;
1780 raw_spin_lock_irqsave(&rq->lock, flags);
1781 rq_pin_lock(rq, &rf);
1786 p = llist_entry(llist, struct task_struct, wake_entry);
1787 llist = llist_next(llist);
1789 if (p->sched_remote_wakeup)
1790 wake_flags = WF_MIGRATED;
1792 ttwu_do_activate(rq, p, wake_flags, &rf);
1795 rq_unpin_lock(rq, &rf);
1796 raw_spin_unlock_irqrestore(&rq->lock, flags);
1799 void scheduler_ipi(void)
1802 * Fold TIF_NEED_RESCHED into the preempt_count; anybody setting
1803 * TIF_NEED_RESCHED remotely (for the first time) will also send
1806 preempt_fold_need_resched();
1808 if (llist_empty(&this_rq()->wake_list) && !got_nohz_idle_kick())
1812 * Not all reschedule IPI handlers call irq_enter/irq_exit, since
1813 * traditionally all their work was done from the interrupt return
1814 * path. Now that we actually do some work, we need to make sure
1817 * Some archs already do call them, luckily irq_enter/exit nest
1820 * Arguably we should visit all archs and update all handlers,
1821 * however a fair share of IPIs are still resched only so this would
1822 * somewhat pessimize the simple resched case.
1825 sched_ttwu_pending();
1828 * Check if someone kicked us for doing the nohz idle load balance.
1830 if (unlikely(got_nohz_idle_kick())) {
1831 this_rq()->idle_balance = 1;
1832 raise_softirq_irqoff(SCHED_SOFTIRQ);
1837 static void ttwu_queue_remote(struct task_struct *p, int cpu, int wake_flags)
1839 struct rq *rq = cpu_rq(cpu);
1841 p->sched_remote_wakeup = !!(wake_flags & WF_MIGRATED);
1843 if (llist_add(&p->wake_entry, &cpu_rq(cpu)->wake_list)) {
1844 if (!set_nr_if_polling(rq->idle))
1845 smp_send_reschedule(cpu);
1847 trace_sched_wake_idle_without_ipi(cpu);
1851 void wake_up_if_idle(int cpu)
1853 struct rq *rq = cpu_rq(cpu);
1854 unsigned long flags;
1858 if (!is_idle_task(rcu_dereference(rq->curr)))
1861 if (set_nr_if_polling(rq->idle)) {
1862 trace_sched_wake_idle_without_ipi(cpu);
1864 raw_spin_lock_irqsave(&rq->lock, flags);
1865 if (is_idle_task(rq->curr))
1866 smp_send_reschedule(cpu);
1867 /* Else cpu is not in idle, do nothing here */
1868 raw_spin_unlock_irqrestore(&rq->lock, flags);
1875 bool cpus_share_cache(int this_cpu, int that_cpu)
1877 return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu);
1879 #endif /* CONFIG_SMP */
1881 static void ttwu_queue(struct task_struct *p, int cpu, int wake_flags)
1883 struct rq *rq = cpu_rq(cpu);
1886 #if defined(CONFIG_SMP)
1887 if (sched_feat(TTWU_QUEUE) && !cpus_share_cache(smp_processor_id(), cpu)) {
1888 sched_clock_cpu(cpu); /* sync clocks x-cpu */
1889 ttwu_queue_remote(p, cpu, wake_flags);
1894 raw_spin_lock(&rq->lock);
1895 rq_pin_lock(rq, &rf);
1896 ttwu_do_activate(rq, p, wake_flags, &rf);
1897 rq_unpin_lock(rq, &rf);
1898 raw_spin_unlock(&rq->lock);
1902 * Notes on Program-Order guarantees on SMP systems.
1906 * The basic program-order guarantee on SMP systems is that when a task [t]
1907 * migrates, all its activity on its old cpu [c0] happens-before any subsequent
1908 * execution on its new cpu [c1].
1910 * For migration (of runnable tasks) this is provided by the following means:
1912 * A) UNLOCK of the rq(c0)->lock scheduling out task t
1913 * B) migration for t is required to synchronize *both* rq(c0)->lock and
1914 * rq(c1)->lock (if not at the same time, then in that order).
1915 * C) LOCK of the rq(c1)->lock scheduling in task
1917 * Transitivity guarantees that B happens after A and C after B.
1918 * Note: we only require RCpc transitivity.
1919 * Note: the cpu doing B need not be c0 or c1
1928 * UNLOCK rq(0)->lock
1930 * LOCK rq(0)->lock // orders against CPU0
1932 * UNLOCK rq(0)->lock
1936 * UNLOCK rq(1)->lock
1938 * LOCK rq(1)->lock // orders against CPU2
1941 * UNLOCK rq(1)->lock
1944 * BLOCKING -- aka. SLEEP + WAKEUP
1946 * For blocking we (obviously) need to provide the same guarantee as for
1947 * migration. However the means are completely different as there is no lock
1948 * chain to provide order. Instead we do:
1950 * 1) smp_store_release(X->on_cpu, 0)
1951 * 2) smp_cond_load_acquire(!X->on_cpu)
1955 * CPU0 (schedule) CPU1 (try_to_wake_up) CPU2 (schedule)
1957 * LOCK rq(0)->lock LOCK X->pi_lock
1960 * smp_store_release(X->on_cpu, 0);
1962 * smp_cond_load_acquire(&X->on_cpu, !VAL);
1968 * X->state = RUNNING
1969 * UNLOCK rq(2)->lock
1971 * LOCK rq(2)->lock // orders against CPU1
1974 * UNLOCK rq(2)->lock
1977 * UNLOCK rq(0)->lock
1980 * However; for wakeups there is a second guarantee we must provide, namely we
1981 * must observe the state that lead to our wakeup. That is, not only must our
1982 * task observe its own prior state, it must also observe the stores prior to
1985 * This means that any means of doing remote wakeups must order the CPU doing
1986 * the wakeup against the CPU the task is going to end up running on. This,
1987 * however, is already required for the regular Program-Order guarantee above,
1988 * since the waking CPU is the one issueing the ACQUIRE (smp_cond_load_acquire).
1993 * try_to_wake_up - wake up a thread
1994 * @p: the thread to be awakened
1995 * @state: the mask of task states that can be woken
1996 * @wake_flags: wake modifier flags (WF_*)
1998 * If (@state & @p->state) @p->state = TASK_RUNNING.
2000 * If the task was not queued/runnable, also place it back on a runqueue.
2002 * Atomic against schedule() which would dequeue a task, also see
2003 * set_current_state().
2005 * Return: %true if @p->state changes (an actual wakeup was done),
2009 try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags)
2011 unsigned long flags;
2012 int cpu, success = 0;
2015 * If we are going to wake up a thread waiting for CONDITION we
2016 * need to ensure that CONDITION=1 done by the caller can not be
2017 * reordered with p->state check below. This pairs with mb() in
2018 * set_current_state() the waiting thread does.
2020 smp_mb__before_spinlock();
2021 raw_spin_lock_irqsave(&p->pi_lock, flags);
2022 if (!(p->state & state))
2025 trace_sched_waking(p);
2027 success = 1; /* we're going to change ->state */
2031 * Ensure we load p->on_rq _after_ p->state, otherwise it would
2032 * be possible to, falsely, observe p->on_rq == 0 and get stuck
2033 * in smp_cond_load_acquire() below.
2035 * sched_ttwu_pending() try_to_wake_up()
2036 * [S] p->on_rq = 1; [L] P->state
2037 * UNLOCK rq->lock -----.
2041 * LOCK rq->lock -----'
2045 * [S] p->state = UNINTERRUPTIBLE [L] p->on_rq
2047 * Pairs with the UNLOCK+LOCK on rq->lock from the
2048 * last wakeup of our task and the schedule that got our task
2052 if (p->on_rq && ttwu_remote(p, wake_flags))
2057 * Ensure we load p->on_cpu _after_ p->on_rq, otherwise it would be
2058 * possible to, falsely, observe p->on_cpu == 0.
2060 * One must be running (->on_cpu == 1) in order to remove oneself
2061 * from the runqueue.
2063 * [S] ->on_cpu = 1; [L] ->on_rq
2067 * [S] ->on_rq = 0; [L] ->on_cpu
2069 * Pairs with the full barrier implied in the UNLOCK+LOCK on rq->lock
2070 * from the consecutive calls to schedule(); the first switching to our
2071 * task, the second putting it to sleep.
2076 * If the owning (remote) cpu is still in the middle of schedule() with
2077 * this task as prev, wait until its done referencing the task.
2079 * Pairs with the smp_store_release() in finish_lock_switch().
2081 * This ensures that tasks getting woken will be fully ordered against
2082 * their previous state and preserve Program Order.
2084 smp_cond_load_acquire(&p->on_cpu, !VAL);
2086 p->sched_contributes_to_load = !!task_contributes_to_load(p);
2087 p->state = TASK_WAKING;
2089 cpu = select_task_rq(p, p->wake_cpu, SD_BALANCE_WAKE, wake_flags);
2090 if (task_cpu(p) != cpu) {
2091 wake_flags |= WF_MIGRATED;
2092 set_task_cpu(p, cpu);
2094 #endif /* CONFIG_SMP */
2096 ttwu_queue(p, cpu, wake_flags);
2098 ttwu_stat(p, cpu, wake_flags);
2100 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2106 * try_to_wake_up_local - try to wake up a local task with rq lock held
2107 * @p: the thread to be awakened
2108 * @cookie: context's cookie for pinning
2110 * Put @p on the run-queue if it's not already there. The caller must
2111 * ensure that this_rq() is locked, @p is bound to this_rq() and not
2114 static void try_to_wake_up_local(struct task_struct *p, struct rq_flags *rf)
2116 struct rq *rq = task_rq(p);
2118 if (WARN_ON_ONCE(rq != this_rq()) ||
2119 WARN_ON_ONCE(p == current))
2122 lockdep_assert_held(&rq->lock);
2124 if (!raw_spin_trylock(&p->pi_lock)) {
2126 * This is OK, because current is on_cpu, which avoids it being
2127 * picked for load-balance and preemption/IRQs are still
2128 * disabled avoiding further scheduler activity on it and we've
2129 * not yet picked a replacement task.
2131 rq_unpin_lock(rq, rf);
2132 raw_spin_unlock(&rq->lock);
2133 raw_spin_lock(&p->pi_lock);
2134 raw_spin_lock(&rq->lock);
2135 rq_repin_lock(rq, rf);
2138 if (!(p->state & TASK_NORMAL))
2141 trace_sched_waking(p);
2143 if (!task_on_rq_queued(p))
2144 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
2146 ttwu_do_wakeup(rq, p, 0, rf);
2147 ttwu_stat(p, smp_processor_id(), 0);
2149 raw_spin_unlock(&p->pi_lock);
2153 * wake_up_process - Wake up a specific process
2154 * @p: The process to be woken up.
2156 * Attempt to wake up the nominated process and move it to the set of runnable
2159 * Return: 1 if the process was woken up, 0 if it was already running.
2161 * It may be assumed that this function implies a write memory barrier before
2162 * changing the task state if and only if any tasks are woken up.
2164 int wake_up_process(struct task_struct *p)
2166 return try_to_wake_up(p, TASK_NORMAL, 0);
2168 EXPORT_SYMBOL(wake_up_process);
2170 int wake_up_state(struct task_struct *p, unsigned int state)
2172 return try_to_wake_up(p, state, 0);
2176 * This function clears the sched_dl_entity static params.
2178 void __dl_clear_params(struct task_struct *p)
2180 struct sched_dl_entity *dl_se = &p->dl;
2182 dl_se->dl_runtime = 0;
2183 dl_se->dl_deadline = 0;
2184 dl_se->dl_period = 0;
2188 dl_se->dl_throttled = 0;
2189 dl_se->dl_yielded = 0;
2193 * Perform scheduler related setup for a newly forked process p.
2194 * p is forked by current.
2196 * __sched_fork() is basic setup used by init_idle() too:
2198 static void __sched_fork(unsigned long clone_flags, struct task_struct *p)
2203 p->se.exec_start = 0;
2204 p->se.sum_exec_runtime = 0;
2205 p->se.prev_sum_exec_runtime = 0;
2206 p->se.nr_migrations = 0;
2208 INIT_LIST_HEAD(&p->se.group_node);
2210 #ifdef CONFIG_FAIR_GROUP_SCHED
2211 p->se.cfs_rq = NULL;
2214 #ifdef CONFIG_SCHEDSTATS
2215 /* Even if schedstat is disabled, there should not be garbage */
2216 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
2219 RB_CLEAR_NODE(&p->dl.rb_node);
2220 init_dl_task_timer(&p->dl);
2221 __dl_clear_params(p);
2223 INIT_LIST_HEAD(&p->rt.run_list);
2225 p->rt.time_slice = sched_rr_timeslice;
2229 #ifdef CONFIG_PREEMPT_NOTIFIERS
2230 INIT_HLIST_HEAD(&p->preempt_notifiers);
2233 #ifdef CONFIG_NUMA_BALANCING
2234 if (p->mm && atomic_read(&p->mm->mm_users) == 1) {
2235 p->mm->numa_next_scan = jiffies + msecs_to_jiffies(sysctl_numa_balancing_scan_delay);
2236 p->mm->numa_scan_seq = 0;
2239 if (clone_flags & CLONE_VM)
2240 p->numa_preferred_nid = current->numa_preferred_nid;
2242 p->numa_preferred_nid = -1;
2244 p->node_stamp = 0ULL;
2245 p->numa_scan_seq = p->mm ? p->mm->numa_scan_seq : 0;
2246 p->numa_scan_period = sysctl_numa_balancing_scan_delay;
2247 p->numa_work.next = &p->numa_work;
2248 p->numa_faults = NULL;
2249 p->last_task_numa_placement = 0;
2250 p->last_sum_exec_runtime = 0;
2252 p->numa_group = NULL;
2253 #endif /* CONFIG_NUMA_BALANCING */
2256 DEFINE_STATIC_KEY_FALSE(sched_numa_balancing);
2258 #ifdef CONFIG_NUMA_BALANCING
2260 void set_numabalancing_state(bool enabled)
2263 static_branch_enable(&sched_numa_balancing);
2265 static_branch_disable(&sched_numa_balancing);
2268 #ifdef CONFIG_PROC_SYSCTL
2269 int sysctl_numa_balancing(struct ctl_table *table, int write,
2270 void __user *buffer, size_t *lenp, loff_t *ppos)
2274 int state = static_branch_likely(&sched_numa_balancing);
2276 if (write && !capable(CAP_SYS_ADMIN))
2281 err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
2285 set_numabalancing_state(state);
2291 #ifdef CONFIG_SCHEDSTATS
2293 DEFINE_STATIC_KEY_FALSE(sched_schedstats);
2294 static bool __initdata __sched_schedstats = false;
2296 static void set_schedstats(bool enabled)
2299 static_branch_enable(&sched_schedstats);
2301 static_branch_disable(&sched_schedstats);
2304 void force_schedstat_enabled(void)
2306 if (!schedstat_enabled()) {
2307 pr_info("kernel profiling enabled schedstats, disable via kernel.sched_schedstats.\n");
2308 static_branch_enable(&sched_schedstats);
2312 static int __init setup_schedstats(char *str)
2319 * This code is called before jump labels have been set up, so we can't
2320 * change the static branch directly just yet. Instead set a temporary
2321 * variable so init_schedstats() can do it later.
2323 if (!strcmp(str, "enable")) {
2324 __sched_schedstats = true;
2326 } else if (!strcmp(str, "disable")) {
2327 __sched_schedstats = false;
2332 pr_warn("Unable to parse schedstats=\n");
2336 __setup("schedstats=", setup_schedstats);
2338 static void __init init_schedstats(void)
2340 set_schedstats(__sched_schedstats);
2343 #ifdef CONFIG_PROC_SYSCTL
2344 int sysctl_schedstats(struct ctl_table *table, int write,
2345 void __user *buffer, size_t *lenp, loff_t *ppos)
2349 int state = static_branch_likely(&sched_schedstats);
2351 if (write && !capable(CAP_SYS_ADMIN))
2356 err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
2360 set_schedstats(state);
2363 #endif /* CONFIG_PROC_SYSCTL */
2364 #else /* !CONFIG_SCHEDSTATS */
2365 static inline void init_schedstats(void) {}
2366 #endif /* CONFIG_SCHEDSTATS */
2369 * fork()/clone()-time setup:
2371 int sched_fork(unsigned long clone_flags, struct task_struct *p)
2373 unsigned long flags;
2374 int cpu = get_cpu();
2376 __sched_fork(clone_flags, p);
2378 * We mark the process as NEW here. This guarantees that
2379 * nobody will actually run it, and a signal or other external
2380 * event cannot wake it up and insert it on the runqueue either.
2382 p->state = TASK_NEW;
2385 * Make sure we do not leak PI boosting priority to the child.
2387 p->prio = current->normal_prio;
2390 * Revert to default priority/policy on fork if requested.
2392 if (unlikely(p->sched_reset_on_fork)) {
2393 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
2394 p->policy = SCHED_NORMAL;
2395 p->static_prio = NICE_TO_PRIO(0);
2397 } else if (PRIO_TO_NICE(p->static_prio) < 0)
2398 p->static_prio = NICE_TO_PRIO(0);
2400 p->prio = p->normal_prio = __normal_prio(p);
2404 * We don't need the reset flag anymore after the fork. It has
2405 * fulfilled its duty:
2407 p->sched_reset_on_fork = 0;
2410 if (dl_prio(p->prio)) {
2413 } else if (rt_prio(p->prio)) {
2414 p->sched_class = &rt_sched_class;
2416 p->sched_class = &fair_sched_class;
2419 init_entity_runnable_average(&p->se);
2422 * The child is not yet in the pid-hash so no cgroup attach races,
2423 * and the cgroup is pinned to this child due to cgroup_fork()
2424 * is ran before sched_fork().
2426 * Silence PROVE_RCU.
2428 raw_spin_lock_irqsave(&p->pi_lock, flags);
2430 * We're setting the cpu for the first time, we don't migrate,
2431 * so use __set_task_cpu().
2433 __set_task_cpu(p, cpu);
2434 if (p->sched_class->task_fork)
2435 p->sched_class->task_fork(p);
2436 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2438 #ifdef CONFIG_SCHED_INFO
2439 if (likely(sched_info_on()))
2440 memset(&p->sched_info, 0, sizeof(p->sched_info));
2442 #if defined(CONFIG_SMP)
2445 init_task_preempt_count(p);
2447 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2448 RB_CLEAR_NODE(&p->pushable_dl_tasks);
2455 unsigned long to_ratio(u64 period, u64 runtime)
2457 if (runtime == RUNTIME_INF)
2461 * Doing this here saves a lot of checks in all
2462 * the calling paths, and returning zero seems
2463 * safe for them anyway.
2468 return div64_u64(runtime << 20, period);
2472 inline struct dl_bw *dl_bw_of(int i)
2474 RCU_LOCKDEP_WARN(!rcu_read_lock_sched_held(),
2475 "sched RCU must be held");
2476 return &cpu_rq(i)->rd->dl_bw;
2479 static inline int dl_bw_cpus(int i)
2481 struct root_domain *rd = cpu_rq(i)->rd;
2484 RCU_LOCKDEP_WARN(!rcu_read_lock_sched_held(),
2485 "sched RCU must be held");
2486 for_each_cpu_and(i, rd->span, cpu_active_mask)
2492 inline struct dl_bw *dl_bw_of(int i)
2494 return &cpu_rq(i)->dl.dl_bw;
2497 static inline int dl_bw_cpus(int i)
2504 * We must be sure that accepting a new task (or allowing changing the
2505 * parameters of an existing one) is consistent with the bandwidth
2506 * constraints. If yes, this function also accordingly updates the currently
2507 * allocated bandwidth to reflect the new situation.
2509 * This function is called while holding p's rq->lock.
2511 * XXX we should delay bw change until the task's 0-lag point, see
2514 static int dl_overflow(struct task_struct *p, int policy,
2515 const struct sched_attr *attr)
2518 struct dl_bw *dl_b = dl_bw_of(task_cpu(p));
2519 u64 period = attr->sched_period ?: attr->sched_deadline;
2520 u64 runtime = attr->sched_runtime;
2521 u64 new_bw = dl_policy(policy) ? to_ratio(period, runtime) : 0;
2524 /* !deadline task may carry old deadline bandwidth */
2525 if (new_bw == p->dl.dl_bw && task_has_dl_policy(p))
2529 * Either if a task, enters, leave, or stays -deadline but changes
2530 * its parameters, we may need to update accordingly the total
2531 * allocated bandwidth of the container.
2533 raw_spin_lock(&dl_b->lock);
2534 cpus = dl_bw_cpus(task_cpu(p));
2535 if (dl_policy(policy) && !task_has_dl_policy(p) &&
2536 !__dl_overflow(dl_b, cpus, 0, new_bw)) {
2537 __dl_add(dl_b, new_bw);
2539 } else if (dl_policy(policy) && task_has_dl_policy(p) &&
2540 !__dl_overflow(dl_b, cpus, p->dl.dl_bw, new_bw)) {
2541 __dl_clear(dl_b, p->dl.dl_bw);
2542 __dl_add(dl_b, new_bw);
2544 } else if (!dl_policy(policy) && task_has_dl_policy(p)) {
2545 __dl_clear(dl_b, p->dl.dl_bw);
2548 raw_spin_unlock(&dl_b->lock);
2553 extern void init_dl_bw(struct dl_bw *dl_b);
2556 * wake_up_new_task - wake up a newly created task for the first time.
2558 * This function will do some initial scheduler statistics housekeeping
2559 * that must be done for every newly created context, then puts the task
2560 * on the runqueue and wakes it.
2562 void wake_up_new_task(struct task_struct *p)
2567 raw_spin_lock_irqsave(&p->pi_lock, rf.flags);
2568 p->state = TASK_RUNNING;
2571 * Fork balancing, do it here and not earlier because:
2572 * - cpus_allowed can change in the fork path
2573 * - any previously selected cpu might disappear through hotplug
2575 * Use __set_task_cpu() to avoid calling sched_class::migrate_task_rq,
2576 * as we're not fully set-up yet.
2578 __set_task_cpu(p, select_task_rq(p, task_cpu(p), SD_BALANCE_FORK, 0));
2580 rq = __task_rq_lock(p, &rf);
2581 update_rq_clock(rq);
2582 post_init_entity_util_avg(&p->se);
2584 activate_task(rq, p, 0);
2585 p->on_rq = TASK_ON_RQ_QUEUED;
2586 trace_sched_wakeup_new(p);
2587 check_preempt_curr(rq, p, WF_FORK);
2589 if (p->sched_class->task_woken) {
2591 * Nothing relies on rq->lock after this, so its fine to
2594 rq_unpin_lock(rq, &rf);
2595 p->sched_class->task_woken(rq, p);
2596 rq_repin_lock(rq, &rf);
2599 task_rq_unlock(rq, p, &rf);
2602 #ifdef CONFIG_PREEMPT_NOTIFIERS
2604 static struct static_key preempt_notifier_key = STATIC_KEY_INIT_FALSE;
2606 void preempt_notifier_inc(void)
2608 static_key_slow_inc(&preempt_notifier_key);
2610 EXPORT_SYMBOL_GPL(preempt_notifier_inc);
2612 void preempt_notifier_dec(void)
2614 static_key_slow_dec(&preempt_notifier_key);
2616 EXPORT_SYMBOL_GPL(preempt_notifier_dec);
2619 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2620 * @notifier: notifier struct to register
2622 void preempt_notifier_register(struct preempt_notifier *notifier)
2624 if (!static_key_false(&preempt_notifier_key))
2625 WARN(1, "registering preempt_notifier while notifiers disabled\n");
2627 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2629 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2632 * preempt_notifier_unregister - no longer interested in preemption notifications
2633 * @notifier: notifier struct to unregister
2635 * This is *not* safe to call from within a preemption notifier.
2637 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2639 hlist_del(¬ifier->link);
2641 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2643 static void __fire_sched_in_preempt_notifiers(struct task_struct *curr)
2645 struct preempt_notifier *notifier;
2647 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
2648 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2651 static __always_inline void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2653 if (static_key_false(&preempt_notifier_key))
2654 __fire_sched_in_preempt_notifiers(curr);
2658 __fire_sched_out_preempt_notifiers(struct task_struct *curr,
2659 struct task_struct *next)
2661 struct preempt_notifier *notifier;
2663 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
2664 notifier->ops->sched_out(notifier, next);
2667 static __always_inline void
2668 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2669 struct task_struct *next)
2671 if (static_key_false(&preempt_notifier_key))
2672 __fire_sched_out_preempt_notifiers(curr, next);
2675 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2677 static inline void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2682 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2683 struct task_struct *next)
2687 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2690 * prepare_task_switch - prepare to switch tasks
2691 * @rq: the runqueue preparing to switch
2692 * @prev: the current task that is being switched out
2693 * @next: the task we are going to switch to.
2695 * This is called with the rq lock held and interrupts off. It must
2696 * be paired with a subsequent finish_task_switch after the context
2699 * prepare_task_switch sets up locking and calls architecture specific
2703 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2704 struct task_struct *next)
2706 sched_info_switch(rq, prev, next);
2707 perf_event_task_sched_out(prev, next);
2708 fire_sched_out_preempt_notifiers(prev, next);
2709 prepare_lock_switch(rq, next);
2710 prepare_arch_switch(next);
2714 * finish_task_switch - clean up after a task-switch
2715 * @prev: the thread we just switched away from.
2717 * finish_task_switch must be called after the context switch, paired
2718 * with a prepare_task_switch call before the context switch.
2719 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2720 * and do any other architecture-specific cleanup actions.
2722 * Note that we may have delayed dropping an mm in context_switch(). If
2723 * so, we finish that here outside of the runqueue lock. (Doing it
2724 * with the lock held can cause deadlocks; see schedule() for
2727 * The context switch have flipped the stack from under us and restored the
2728 * local variables which were saved when this task called schedule() in the
2729 * past. prev == current is still correct but we need to recalculate this_rq
2730 * because prev may have moved to another CPU.
2732 static struct rq *finish_task_switch(struct task_struct *prev)
2733 __releases(rq->lock)
2735 struct rq *rq = this_rq();
2736 struct mm_struct *mm = rq->prev_mm;
2740 * The previous task will have left us with a preempt_count of 2
2741 * because it left us after:
2744 * preempt_disable(); // 1
2746 * raw_spin_lock_irq(&rq->lock) // 2
2748 * Also, see FORK_PREEMPT_COUNT.
2750 if (WARN_ONCE(preempt_count() != 2*PREEMPT_DISABLE_OFFSET,
2751 "corrupted preempt_count: %s/%d/0x%x\n",
2752 current->comm, current->pid, preempt_count()))
2753 preempt_count_set(FORK_PREEMPT_COUNT);
2758 * A task struct has one reference for the use as "current".
2759 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2760 * schedule one last time. The schedule call will never return, and
2761 * the scheduled task must drop that reference.
2763 * We must observe prev->state before clearing prev->on_cpu (in
2764 * finish_lock_switch), otherwise a concurrent wakeup can get prev
2765 * running on another CPU and we could rave with its RUNNING -> DEAD
2766 * transition, resulting in a double drop.
2768 prev_state = prev->state;
2769 vtime_task_switch(prev);
2770 perf_event_task_sched_in(prev, current);
2771 finish_lock_switch(rq, prev);
2772 finish_arch_post_lock_switch();
2774 fire_sched_in_preempt_notifiers(current);
2777 if (unlikely(prev_state == TASK_DEAD)) {
2778 if (prev->sched_class->task_dead)
2779 prev->sched_class->task_dead(prev);
2782 * Remove function-return probe instances associated with this
2783 * task and put them back on the free list.
2785 kprobe_flush_task(prev);
2787 /* Task is done with its stack. */
2788 put_task_stack(prev);
2790 put_task_struct(prev);
2793 tick_nohz_task_switch();
2799 /* rq->lock is NOT held, but preemption is disabled */
2800 static void __balance_callback(struct rq *rq)
2802 struct callback_head *head, *next;
2803 void (*func)(struct rq *rq);
2804 unsigned long flags;
2806 raw_spin_lock_irqsave(&rq->lock, flags);
2807 head = rq->balance_callback;
2808 rq->balance_callback = NULL;
2810 func = (void (*)(struct rq *))head->func;
2817 raw_spin_unlock_irqrestore(&rq->lock, flags);
2820 static inline void balance_callback(struct rq *rq)
2822 if (unlikely(rq->balance_callback))
2823 __balance_callback(rq);
2828 static inline void balance_callback(struct rq *rq)
2835 * schedule_tail - first thing a freshly forked thread must call.
2836 * @prev: the thread we just switched away from.
2838 asmlinkage __visible void schedule_tail(struct task_struct *prev)
2839 __releases(rq->lock)
2844 * New tasks start with FORK_PREEMPT_COUNT, see there and
2845 * finish_task_switch() for details.
2847 * finish_task_switch() will drop rq->lock() and lower preempt_count
2848 * and the preempt_enable() will end up enabling preemption (on
2849 * PREEMPT_COUNT kernels).
2852 rq = finish_task_switch(prev);
2853 balance_callback(rq);
2856 if (current->set_child_tid)
2857 put_user(task_pid_vnr(current), current->set_child_tid);
2861 * context_switch - switch to the new MM and the new thread's register state.
2863 static __always_inline struct rq *
2864 context_switch(struct rq *rq, struct task_struct *prev,
2865 struct task_struct *next, struct rq_flags *rf)
2867 struct mm_struct *mm, *oldmm;
2869 prepare_task_switch(rq, prev, next);
2872 oldmm = prev->active_mm;
2874 * For paravirt, this is coupled with an exit in switch_to to
2875 * combine the page table reload and the switch backend into
2878 arch_start_context_switch(prev);
2881 next->active_mm = oldmm;
2882 atomic_inc(&oldmm->mm_count);
2883 enter_lazy_tlb(oldmm, next);
2885 switch_mm_irqs_off(oldmm, mm, next);
2888 prev->active_mm = NULL;
2889 rq->prev_mm = oldmm;
2892 rq->clock_skip_update = 0;
2895 * Since the runqueue lock will be released by the next
2896 * task (which is an invalid locking op but in the case
2897 * of the scheduler it's an obvious special-case), so we
2898 * do an early lockdep release here:
2900 rq_unpin_lock(rq, rf);
2901 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2903 /* Here we just switch the register state and the stack. */
2904 switch_to(prev, next, prev);
2907 return finish_task_switch(prev);
2911 * nr_running and nr_context_switches:
2913 * externally visible scheduler statistics: current number of runnable
2914 * threads, total number of context switches performed since bootup.
2916 unsigned long nr_running(void)
2918 unsigned long i, sum = 0;
2920 for_each_online_cpu(i)
2921 sum += cpu_rq(i)->nr_running;
2927 * Check if only the current task is running on the cpu.
2929 * Caution: this function does not check that the caller has disabled
2930 * preemption, thus the result might have a time-of-check-to-time-of-use
2931 * race. The caller is responsible to use it correctly, for example:
2933 * - from a non-preemptable section (of course)
2935 * - from a thread that is bound to a single CPU
2937 * - in a loop with very short iterations (e.g. a polling loop)
2939 bool single_task_running(void)
2941 return raw_rq()->nr_running == 1;
2943 EXPORT_SYMBOL(single_task_running);
2945 unsigned long long nr_context_switches(void)
2948 unsigned long long sum = 0;
2950 for_each_possible_cpu(i)
2951 sum += cpu_rq(i)->nr_switches;
2956 unsigned long nr_iowait(void)
2958 unsigned long i, sum = 0;
2960 for_each_possible_cpu(i)
2961 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2966 unsigned long nr_iowait_cpu(int cpu)
2968 struct rq *this = cpu_rq(cpu);
2969 return atomic_read(&this->nr_iowait);
2972 void get_iowait_load(unsigned long *nr_waiters, unsigned long *load)
2974 struct rq *rq = this_rq();
2975 *nr_waiters = atomic_read(&rq->nr_iowait);
2976 *load = rq->load.weight;
2982 * sched_exec - execve() is a valuable balancing opportunity, because at
2983 * this point the task has the smallest effective memory and cache footprint.
2985 void sched_exec(void)
2987 struct task_struct *p = current;
2988 unsigned long flags;
2991 raw_spin_lock_irqsave(&p->pi_lock, flags);
2992 dest_cpu = p->sched_class->select_task_rq(p, task_cpu(p), SD_BALANCE_EXEC, 0);
2993 if (dest_cpu == smp_processor_id())
2996 if (likely(cpu_active(dest_cpu))) {
2997 struct migration_arg arg = { p, dest_cpu };
2999 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
3000 stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg);
3004 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
3009 DEFINE_PER_CPU(struct kernel_stat, kstat);
3010 DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat);
3012 EXPORT_PER_CPU_SYMBOL(kstat);
3013 EXPORT_PER_CPU_SYMBOL(kernel_cpustat);
3016 * The function fair_sched_class.update_curr accesses the struct curr
3017 * and its field curr->exec_start; when called from task_sched_runtime(),
3018 * we observe a high rate of cache misses in practice.
3019 * Prefetching this data results in improved performance.
3021 static inline void prefetch_curr_exec_start(struct task_struct *p)
3023 #ifdef CONFIG_FAIR_GROUP_SCHED
3024 struct sched_entity *curr = (&p->se)->cfs_rq->curr;
3026 struct sched_entity *curr = (&task_rq(p)->cfs)->curr;
3029 prefetch(&curr->exec_start);
3033 * Return accounted runtime for the task.
3034 * In case the task is currently running, return the runtime plus current's
3035 * pending runtime that have not been accounted yet.
3037 unsigned long long task_sched_runtime(struct task_struct *p)
3043 #if defined(CONFIG_64BIT) && defined(CONFIG_SMP)
3045 * 64-bit doesn't need locks to atomically read a 64bit value.
3046 * So we have a optimization chance when the task's delta_exec is 0.
3047 * Reading ->on_cpu is racy, but this is ok.
3049 * If we race with it leaving cpu, we'll take a lock. So we're correct.
3050 * If we race with it entering cpu, unaccounted time is 0. This is
3051 * indistinguishable from the read occurring a few cycles earlier.
3052 * If we see ->on_cpu without ->on_rq, the task is leaving, and has
3053 * been accounted, so we're correct here as well.
3055 if (!p->on_cpu || !task_on_rq_queued(p))
3056 return p->se.sum_exec_runtime;
3059 rq = task_rq_lock(p, &rf);
3061 * Must be ->curr _and_ ->on_rq. If dequeued, we would
3062 * project cycles that may never be accounted to this
3063 * thread, breaking clock_gettime().
3065 if (task_current(rq, p) && task_on_rq_queued(p)) {
3066 prefetch_curr_exec_start(p);
3067 update_rq_clock(rq);
3068 p->sched_class->update_curr(rq);
3070 ns = p->se.sum_exec_runtime;
3071 task_rq_unlock(rq, p, &rf);
3077 * This function gets called by the timer code, with HZ frequency.
3078 * We call it with interrupts disabled.
3080 void scheduler_tick(void)
3082 int cpu = smp_processor_id();
3083 struct rq *rq = cpu_rq(cpu);
3084 struct task_struct *curr = rq->curr;
3088 raw_spin_lock(&rq->lock);
3089 update_rq_clock(rq);
3090 curr->sched_class->task_tick(rq, curr, 0);
3091 cpu_load_update_active(rq);
3092 calc_global_load_tick(rq);
3093 raw_spin_unlock(&rq->lock);
3095 perf_event_task_tick();
3098 rq->idle_balance = idle_cpu(cpu);
3099 trigger_load_balance(rq);
3101 rq_last_tick_reset(rq);
3104 #ifdef CONFIG_NO_HZ_FULL
3106 * scheduler_tick_max_deferment
3108 * Keep at least one tick per second when a single
3109 * active task is running because the scheduler doesn't
3110 * yet completely support full dynticks environment.
3112 * This makes sure that uptime, CFS vruntime, load
3113 * balancing, etc... continue to move forward, even
3114 * with a very low granularity.
3116 * Return: Maximum deferment in nanoseconds.
3118 u64 scheduler_tick_max_deferment(void)
3120 struct rq *rq = this_rq();
3121 unsigned long next, now = READ_ONCE(jiffies);
3123 next = rq->last_sched_tick + HZ;
3125 if (time_before_eq(next, now))
3128 return jiffies_to_nsecs(next - now);
3132 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
3133 defined(CONFIG_PREEMPT_TRACER))
3135 * If the value passed in is equal to the current preempt count
3136 * then we just disabled preemption. Start timing the latency.
3138 static inline void preempt_latency_start(int val)
3140 if (preempt_count() == val) {
3141 unsigned long ip = get_lock_parent_ip();
3142 #ifdef CONFIG_DEBUG_PREEMPT
3143 current->preempt_disable_ip = ip;
3145 trace_preempt_off(CALLER_ADDR0, ip);
3149 void preempt_count_add(int val)
3151 #ifdef CONFIG_DEBUG_PREEMPT
3155 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3158 __preempt_count_add(val);
3159 #ifdef CONFIG_DEBUG_PREEMPT
3161 * Spinlock count overflowing soon?
3163 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
3166 preempt_latency_start(val);
3168 EXPORT_SYMBOL(preempt_count_add);
3169 NOKPROBE_SYMBOL(preempt_count_add);
3172 * If the value passed in equals to the current preempt count
3173 * then we just enabled preemption. Stop timing the latency.
3175 static inline void preempt_latency_stop(int val)
3177 if (preempt_count() == val)
3178 trace_preempt_on(CALLER_ADDR0, get_lock_parent_ip());
3181 void preempt_count_sub(int val)
3183 #ifdef CONFIG_DEBUG_PREEMPT
3187 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
3190 * Is the spinlock portion underflowing?
3192 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
3193 !(preempt_count() & PREEMPT_MASK)))
3197 preempt_latency_stop(val);
3198 __preempt_count_sub(val);
3200 EXPORT_SYMBOL(preempt_count_sub);
3201 NOKPROBE_SYMBOL(preempt_count_sub);
3204 static inline void preempt_latency_start(int val) { }
3205 static inline void preempt_latency_stop(int val) { }
3209 * Print scheduling while atomic bug:
3211 static noinline void __schedule_bug(struct task_struct *prev)
3213 /* Save this before calling printk(), since that will clobber it */
3214 unsigned long preempt_disable_ip = get_preempt_disable_ip(current);
3216 if (oops_in_progress)
3219 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
3220 prev->comm, prev->pid, preempt_count());
3222 debug_show_held_locks(prev);
3224 if (irqs_disabled())
3225 print_irqtrace_events(prev);
3226 if (IS_ENABLED(CONFIG_DEBUG_PREEMPT)
3227 && in_atomic_preempt_off()) {
3228 pr_err("Preemption disabled at:");
3229 print_ip_sym(preempt_disable_ip);
3233 panic("scheduling while atomic\n");
3236 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
3240 * Various schedule()-time debugging checks and statistics:
3242 static inline void schedule_debug(struct task_struct *prev)
3244 #ifdef CONFIG_SCHED_STACK_END_CHECK
3245 if (task_stack_end_corrupted(prev))
3246 panic("corrupted stack end detected inside scheduler\n");
3249 if (unlikely(in_atomic_preempt_off())) {
3250 __schedule_bug(prev);
3251 preempt_count_set(PREEMPT_DISABLED);
3255 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
3257 schedstat_inc(this_rq()->sched_count);
3261 * Pick up the highest-prio task:
3263 static inline struct task_struct *
3264 pick_next_task(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
3266 const struct sched_class *class = &fair_sched_class;
3267 struct task_struct *p;
3270 * Optimization: we know that if all tasks are in
3271 * the fair class we can call that function directly:
3273 if (likely(prev->sched_class == class &&
3274 rq->nr_running == rq->cfs.h_nr_running)) {
3275 p = fair_sched_class.pick_next_task(rq, prev, rf);
3276 if (unlikely(p == RETRY_TASK))
3279 /* assumes fair_sched_class->next == idle_sched_class */
3281 p = idle_sched_class.pick_next_task(rq, prev, rf);
3287 for_each_class(class) {
3288 p = class->pick_next_task(rq, prev, rf);
3290 if (unlikely(p == RETRY_TASK))
3296 BUG(); /* the idle class will always have a runnable task */
3300 * __schedule() is the main scheduler function.
3302 * The main means of driving the scheduler and thus entering this function are:
3304 * 1. Explicit blocking: mutex, semaphore, waitqueue, etc.
3306 * 2. TIF_NEED_RESCHED flag is checked on interrupt and userspace return
3307 * paths. For example, see arch/x86/entry_64.S.
3309 * To drive preemption between tasks, the scheduler sets the flag in timer
3310 * interrupt handler scheduler_tick().
3312 * 3. Wakeups don't really cause entry into schedule(). They add a
3313 * task to the run-queue and that's it.
3315 * Now, if the new task added to the run-queue preempts the current
3316 * task, then the wakeup sets TIF_NEED_RESCHED and schedule() gets
3317 * called on the nearest possible occasion:
3319 * - If the kernel is preemptible (CONFIG_PREEMPT=y):
3321 * - in syscall or exception context, at the next outmost
3322 * preempt_enable(). (this might be as soon as the wake_up()'s
3325 * - in IRQ context, return from interrupt-handler to
3326 * preemptible context
3328 * - If the kernel is not preemptible (CONFIG_PREEMPT is not set)
3331 * - cond_resched() call
3332 * - explicit schedule() call
3333 * - return from syscall or exception to user-space
3334 * - return from interrupt-handler to user-space
3336 * WARNING: must be called with preemption disabled!
3338 static void __sched notrace __schedule(bool preempt)
3340 struct task_struct *prev, *next;
3341 unsigned long *switch_count;
3346 cpu = smp_processor_id();
3350 schedule_debug(prev);
3352 if (sched_feat(HRTICK))
3355 local_irq_disable();
3356 rcu_note_context_switch();
3359 * Make sure that signal_pending_state()->signal_pending() below
3360 * can't be reordered with __set_current_state(TASK_INTERRUPTIBLE)
3361 * done by the caller to avoid the race with signal_wake_up().
3363 smp_mb__before_spinlock();
3364 raw_spin_lock(&rq->lock);
3365 rq_pin_lock(rq, &rf);
3367 rq->clock_skip_update <<= 1; /* promote REQ to ACT */
3369 switch_count = &prev->nivcsw;
3370 if (!preempt && prev->state) {
3371 if (unlikely(signal_pending_state(prev->state, prev))) {
3372 prev->state = TASK_RUNNING;
3374 deactivate_task(rq, prev, DEQUEUE_SLEEP);
3378 * If a worker went to sleep, notify and ask workqueue
3379 * whether it wants to wake up a task to maintain
3382 if (prev->flags & PF_WQ_WORKER) {
3383 struct task_struct *to_wakeup;
3385 to_wakeup = wq_worker_sleeping(prev);
3387 try_to_wake_up_local(to_wakeup, &rf);
3390 switch_count = &prev->nvcsw;
3393 if (task_on_rq_queued(prev))
3394 update_rq_clock(rq);
3396 next = pick_next_task(rq, prev, &rf);
3397 clear_tsk_need_resched(prev);
3398 clear_preempt_need_resched();
3400 if (likely(prev != next)) {
3405 trace_sched_switch(preempt, prev, next);
3406 rq = context_switch(rq, prev, next, &rf); /* unlocks the rq */
3408 rq->clock_skip_update = 0;
3409 rq_unpin_lock(rq, &rf);
3410 raw_spin_unlock_irq(&rq->lock);
3413 balance_callback(rq);
3416 void __noreturn do_task_dead(void)
3419 * The setting of TASK_RUNNING by try_to_wake_up() may be delayed
3420 * when the following two conditions become true.
3421 * - There is race condition of mmap_sem (It is acquired by
3423 * - SMI occurs before setting TASK_RUNINNG.
3424 * (or hypervisor of virtual machine switches to other guest)
3425 * As a result, we may become TASK_RUNNING after becoming TASK_DEAD
3427 * To avoid it, we have to wait for releasing tsk->pi_lock which
3428 * is held by try_to_wake_up()
3431 raw_spin_unlock_wait(¤t->pi_lock);
3433 /* causes final put_task_struct in finish_task_switch(). */
3434 __set_current_state(TASK_DEAD);
3435 current->flags |= PF_NOFREEZE; /* tell freezer to ignore us */
3438 /* Avoid "noreturn function does return". */
3440 cpu_relax(); /* For when BUG is null */
3443 static inline void sched_submit_work(struct task_struct *tsk)
3445 if (!tsk->state || tsk_is_pi_blocked(tsk))
3448 * If we are going to sleep and we have plugged IO queued,
3449 * make sure to submit it to avoid deadlocks.
3451 if (blk_needs_flush_plug(tsk))
3452 blk_schedule_flush_plug(tsk);
3455 asmlinkage __visible void __sched schedule(void)
3457 struct task_struct *tsk = current;
3459 sched_submit_work(tsk);
3463 sched_preempt_enable_no_resched();
3464 } while (need_resched());
3466 EXPORT_SYMBOL(schedule);
3468 #ifdef CONFIG_CONTEXT_TRACKING
3469 asmlinkage __visible void __sched schedule_user(void)
3472 * If we come here after a random call to set_need_resched(),
3473 * or we have been woken up remotely but the IPI has not yet arrived,
3474 * we haven't yet exited the RCU idle mode. Do it here manually until
3475 * we find a better solution.
3477 * NB: There are buggy callers of this function. Ideally we
3478 * should warn if prev_state != CONTEXT_USER, but that will trigger
3479 * too frequently to make sense yet.
3481 enum ctx_state prev_state = exception_enter();
3483 exception_exit(prev_state);
3488 * schedule_preempt_disabled - called with preemption disabled
3490 * Returns with preemption disabled. Note: preempt_count must be 1
3492 void __sched schedule_preempt_disabled(void)
3494 sched_preempt_enable_no_resched();
3499 static void __sched notrace preempt_schedule_common(void)
3503 * Because the function tracer can trace preempt_count_sub()
3504 * and it also uses preempt_enable/disable_notrace(), if
3505 * NEED_RESCHED is set, the preempt_enable_notrace() called
3506 * by the function tracer will call this function again and
3507 * cause infinite recursion.
3509 * Preemption must be disabled here before the function
3510 * tracer can trace. Break up preempt_disable() into two
3511 * calls. One to disable preemption without fear of being
3512 * traced. The other to still record the preemption latency,
3513 * which can also be traced by the function tracer.
3515 preempt_disable_notrace();
3516 preempt_latency_start(1);
3518 preempt_latency_stop(1);
3519 preempt_enable_no_resched_notrace();
3522 * Check again in case we missed a preemption opportunity
3523 * between schedule and now.
3525 } while (need_resched());
3528 #ifdef CONFIG_PREEMPT
3530 * this is the entry point to schedule() from in-kernel preemption
3531 * off of preempt_enable. Kernel preemptions off return from interrupt
3532 * occur there and call schedule directly.
3534 asmlinkage __visible void __sched notrace preempt_schedule(void)
3537 * If there is a non-zero preempt_count or interrupts are disabled,
3538 * we do not want to preempt the current task. Just return..
3540 if (likely(!preemptible()))
3543 preempt_schedule_common();
3545 NOKPROBE_SYMBOL(preempt_schedule);
3546 EXPORT_SYMBOL(preempt_schedule);
3549 * preempt_schedule_notrace - preempt_schedule called by tracing
3551 * The tracing infrastructure uses preempt_enable_notrace to prevent
3552 * recursion and tracing preempt enabling caused by the tracing
3553 * infrastructure itself. But as tracing can happen in areas coming
3554 * from userspace or just about to enter userspace, a preempt enable
3555 * can occur before user_exit() is called. This will cause the scheduler
3556 * to be called when the system is still in usermode.
3558 * To prevent this, the preempt_enable_notrace will use this function
3559 * instead of preempt_schedule() to exit user context if needed before
3560 * calling the scheduler.
3562 asmlinkage __visible void __sched notrace preempt_schedule_notrace(void)
3564 enum ctx_state prev_ctx;
3566 if (likely(!preemptible()))
3571 * Because the function tracer can trace preempt_count_sub()
3572 * and it also uses preempt_enable/disable_notrace(), if
3573 * NEED_RESCHED is set, the preempt_enable_notrace() called
3574 * by the function tracer will call this function again and
3575 * cause infinite recursion.
3577 * Preemption must be disabled here before the function
3578 * tracer can trace. Break up preempt_disable() into two
3579 * calls. One to disable preemption without fear of being
3580 * traced. The other to still record the preemption latency,
3581 * which can also be traced by the function tracer.
3583 preempt_disable_notrace();
3584 preempt_latency_start(1);
3586 * Needs preempt disabled in case user_exit() is traced
3587 * and the tracer calls preempt_enable_notrace() causing
3588 * an infinite recursion.
3590 prev_ctx = exception_enter();
3592 exception_exit(prev_ctx);
3594 preempt_latency_stop(1);
3595 preempt_enable_no_resched_notrace();
3596 } while (need_resched());
3598 EXPORT_SYMBOL_GPL(preempt_schedule_notrace);
3600 #endif /* CONFIG_PREEMPT */
3603 * this is the entry point to schedule() from kernel preemption
3604 * off of irq context.
3605 * Note, that this is called and return with irqs disabled. This will
3606 * protect us against recursive calling from irq.
3608 asmlinkage __visible void __sched preempt_schedule_irq(void)
3610 enum ctx_state prev_state;
3612 /* Catch callers which need to be fixed */
3613 BUG_ON(preempt_count() || !irqs_disabled());
3615 prev_state = exception_enter();
3621 local_irq_disable();
3622 sched_preempt_enable_no_resched();
3623 } while (need_resched());
3625 exception_exit(prev_state);
3628 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3631 return try_to_wake_up(curr->private, mode, wake_flags);
3633 EXPORT_SYMBOL(default_wake_function);
3635 #ifdef CONFIG_RT_MUTEXES
3638 * rt_mutex_setprio - set the current priority of a task
3640 * @prio: prio value (kernel-internal form)
3642 * This function changes the 'effective' priority of a task. It does
3643 * not touch ->normal_prio like __setscheduler().
3645 * Used by the rt_mutex code to implement priority inheritance
3646 * logic. Call site only calls if the priority of the task changed.
3648 void rt_mutex_setprio(struct task_struct *p, int prio)
3650 int oldprio, queued, running, queue_flag = DEQUEUE_SAVE | DEQUEUE_MOVE;
3651 const struct sched_class *prev_class;
3655 BUG_ON(prio > MAX_PRIO);
3657 rq = __task_rq_lock(p, &rf);
3658 update_rq_clock(rq);
3661 * Idle task boosting is a nono in general. There is one
3662 * exception, when PREEMPT_RT and NOHZ is active:
3664 * The idle task calls get_next_timer_interrupt() and holds
3665 * the timer wheel base->lock on the CPU and another CPU wants
3666 * to access the timer (probably to cancel it). We can safely
3667 * ignore the boosting request, as the idle CPU runs this code
3668 * with interrupts disabled and will complete the lock
3669 * protected section without being interrupted. So there is no
3670 * real need to boost.
3672 if (unlikely(p == rq->idle)) {
3673 WARN_ON(p != rq->curr);
3674 WARN_ON(p->pi_blocked_on);
3678 trace_sched_pi_setprio(p, prio);
3681 if (oldprio == prio)
3682 queue_flag &= ~DEQUEUE_MOVE;
3684 prev_class = p->sched_class;
3685 queued = task_on_rq_queued(p);
3686 running = task_current(rq, p);
3688 dequeue_task(rq, p, queue_flag);
3690 put_prev_task(rq, p);
3693 * Boosting condition are:
3694 * 1. -rt task is running and holds mutex A
3695 * --> -dl task blocks on mutex A
3697 * 2. -dl task is running and holds mutex A
3698 * --> -dl task blocks on mutex A and could preempt the
3701 if (dl_prio(prio)) {
3702 struct task_struct *pi_task = rt_mutex_get_top_task(p);
3703 if (!dl_prio(p->normal_prio) ||
3704 (pi_task && dl_entity_preempt(&pi_task->dl, &p->dl))) {
3705 p->dl.dl_boosted = 1;
3706 queue_flag |= ENQUEUE_REPLENISH;
3708 p->dl.dl_boosted = 0;
3709 p->sched_class = &dl_sched_class;
3710 } else if (rt_prio(prio)) {
3711 if (dl_prio(oldprio))
3712 p->dl.dl_boosted = 0;
3714 queue_flag |= ENQUEUE_HEAD;
3715 p->sched_class = &rt_sched_class;
3717 if (dl_prio(oldprio))
3718 p->dl.dl_boosted = 0;
3719 if (rt_prio(oldprio))
3721 p->sched_class = &fair_sched_class;
3727 enqueue_task(rq, p, queue_flag);
3729 set_curr_task(rq, p);
3731 check_class_changed(rq, p, prev_class, oldprio);
3733 preempt_disable(); /* avoid rq from going away on us */
3734 __task_rq_unlock(rq, &rf);
3736 balance_callback(rq);
3741 void set_user_nice(struct task_struct *p, long nice)
3743 bool queued, running;
3744 int old_prio, delta;
3748 if (task_nice(p) == nice || nice < MIN_NICE || nice > MAX_NICE)
3751 * We have to be careful, if called from sys_setpriority(),
3752 * the task might be in the middle of scheduling on another CPU.
3754 rq = task_rq_lock(p, &rf);
3756 * The RT priorities are set via sched_setscheduler(), but we still
3757 * allow the 'normal' nice value to be set - but as expected
3758 * it wont have any effect on scheduling until the task is
3759 * SCHED_DEADLINE, SCHED_FIFO or SCHED_RR:
3761 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
3762 p->static_prio = NICE_TO_PRIO(nice);
3765 queued = task_on_rq_queued(p);
3766 running = task_current(rq, p);
3768 dequeue_task(rq, p, DEQUEUE_SAVE);
3770 put_prev_task(rq, p);
3772 p->static_prio = NICE_TO_PRIO(nice);
3775 p->prio = effective_prio(p);
3776 delta = p->prio - old_prio;
3779 enqueue_task(rq, p, ENQUEUE_RESTORE);
3781 * If the task increased its priority or is running and
3782 * lowered its priority, then reschedule its CPU:
3784 if (delta < 0 || (delta > 0 && task_running(rq, p)))
3788 set_curr_task(rq, p);
3790 task_rq_unlock(rq, p, &rf);
3792 EXPORT_SYMBOL(set_user_nice);
3795 * can_nice - check if a task can reduce its nice value
3799 int can_nice(const struct task_struct *p, const int nice)
3801 /* convert nice value [19,-20] to rlimit style value [1,40] */
3802 int nice_rlim = nice_to_rlimit(nice);
3804 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
3805 capable(CAP_SYS_NICE));
3808 #ifdef __ARCH_WANT_SYS_NICE
3811 * sys_nice - change the priority of the current process.
3812 * @increment: priority increment
3814 * sys_setpriority is a more generic, but much slower function that
3815 * does similar things.
3817 SYSCALL_DEFINE1(nice, int, increment)
3822 * Setpriority might change our priority at the same moment.
3823 * We don't have to worry. Conceptually one call occurs first
3824 * and we have a single winner.
3826 increment = clamp(increment, -NICE_WIDTH, NICE_WIDTH);
3827 nice = task_nice(current) + increment;
3829 nice = clamp_val(nice, MIN_NICE, MAX_NICE);
3830 if (increment < 0 && !can_nice(current, nice))
3833 retval = security_task_setnice(current, nice);
3837 set_user_nice(current, nice);
3844 * task_prio - return the priority value of a given task.
3845 * @p: the task in question.
3847 * Return: The priority value as seen by users in /proc.
3848 * RT tasks are offset by -200. Normal tasks are centered
3849 * around 0, value goes from -16 to +15.
3851 int task_prio(const struct task_struct *p)
3853 return p->prio - MAX_RT_PRIO;
3857 * idle_cpu - is a given cpu idle currently?
3858 * @cpu: the processor in question.
3860 * Return: 1 if the CPU is currently idle. 0 otherwise.
3862 int idle_cpu(int cpu)
3864 struct rq *rq = cpu_rq(cpu);
3866 if (rq->curr != rq->idle)
3873 if (!llist_empty(&rq->wake_list))
3881 * idle_task - return the idle task for a given cpu.
3882 * @cpu: the processor in question.
3884 * Return: The idle task for the cpu @cpu.
3886 struct task_struct *idle_task(int cpu)
3888 return cpu_rq(cpu)->idle;
3892 * find_process_by_pid - find a process with a matching PID value.
3893 * @pid: the pid in question.
3895 * The task of @pid, if found. %NULL otherwise.
3897 static struct task_struct *find_process_by_pid(pid_t pid)
3899 return pid ? find_task_by_vpid(pid) : current;
3903 * This function initializes the sched_dl_entity of a newly becoming
3904 * SCHED_DEADLINE task.
3906 * Only the static values are considered here, the actual runtime and the
3907 * absolute deadline will be properly calculated when the task is enqueued
3908 * for the first time with its new policy.
3911 __setparam_dl(struct task_struct *p, const struct sched_attr *attr)
3913 struct sched_dl_entity *dl_se = &p->dl;
3915 dl_se->dl_runtime = attr->sched_runtime;
3916 dl_se->dl_deadline = attr->sched_deadline;
3917 dl_se->dl_period = attr->sched_period ?: dl_se->dl_deadline;
3918 dl_se->flags = attr->sched_flags;
3919 dl_se->dl_bw = to_ratio(dl_se->dl_period, dl_se->dl_runtime);
3922 * Changing the parameters of a task is 'tricky' and we're not doing
3923 * the correct thing -- also see task_dead_dl() and switched_from_dl().
3925 * What we SHOULD do is delay the bandwidth release until the 0-lag
3926 * point. This would include retaining the task_struct until that time
3927 * and change dl_overflow() to not immediately decrement the current
3930 * Instead we retain the current runtime/deadline and let the new
3931 * parameters take effect after the current reservation period lapses.
3932 * This is safe (albeit pessimistic) because the 0-lag point is always
3933 * before the current scheduling deadline.
3935 * We can still have temporary overloads because we do not delay the
3936 * change in bandwidth until that time; so admission control is
3937 * not on the safe side. It does however guarantee tasks will never
3938 * consume more than promised.
3943 * sched_setparam() passes in -1 for its policy, to let the functions
3944 * it calls know not to change it.
3946 #define SETPARAM_POLICY -1
3948 static void __setscheduler_params(struct task_struct *p,
3949 const struct sched_attr *attr)
3951 int policy = attr->sched_policy;
3953 if (policy == SETPARAM_POLICY)
3958 if (dl_policy(policy))
3959 __setparam_dl(p, attr);
3960 else if (fair_policy(policy))
3961 p->static_prio = NICE_TO_PRIO(attr->sched_nice);
3964 * __sched_setscheduler() ensures attr->sched_priority == 0 when
3965 * !rt_policy. Always setting this ensures that things like
3966 * getparam()/getattr() don't report silly values for !rt tasks.
3968 p->rt_priority = attr->sched_priority;
3969 p->normal_prio = normal_prio(p);
3973 /* Actually do priority change: must hold pi & rq lock. */
3974 static void __setscheduler(struct rq *rq, struct task_struct *p,
3975 const struct sched_attr *attr, bool keep_boost)
3977 __setscheduler_params(p, attr);
3980 * Keep a potential priority boosting if called from
3981 * sched_setscheduler().
3984 p->prio = rt_mutex_get_effective_prio(p, normal_prio(p));
3986 p->prio = normal_prio(p);
3988 if (dl_prio(p->prio))
3989 p->sched_class = &dl_sched_class;
3990 else if (rt_prio(p->prio))
3991 p->sched_class = &rt_sched_class;
3993 p->sched_class = &fair_sched_class;
3997 __getparam_dl(struct task_struct *p, struct sched_attr *attr)
3999 struct sched_dl_entity *dl_se = &p->dl;
4001 attr->sched_priority = p->rt_priority;
4002 attr->sched_runtime = dl_se->dl_runtime;
4003 attr->sched_deadline = dl_se->dl_deadline;
4004 attr->sched_period = dl_se->dl_period;
4005 attr->sched_flags = dl_se->flags;
4009 * This function validates the new parameters of a -deadline task.
4010 * We ask for the deadline not being zero, and greater or equal
4011 * than the runtime, as well as the period of being zero or
4012 * greater than deadline. Furthermore, we have to be sure that
4013 * user parameters are above the internal resolution of 1us (we
4014 * check sched_runtime only since it is always the smaller one) and
4015 * below 2^63 ns (we have to check both sched_deadline and
4016 * sched_period, as the latter can be zero).
4019 __checkparam_dl(const struct sched_attr *attr)
4022 if (attr->sched_deadline == 0)
4026 * Since we truncate DL_SCALE bits, make sure we're at least
4029 if (attr->sched_runtime < (1ULL << DL_SCALE))
4033 * Since we use the MSB for wrap-around and sign issues, make
4034 * sure it's not set (mind that period can be equal to zero).
4036 if (attr->sched_deadline & (1ULL << 63) ||
4037 attr->sched_period & (1ULL << 63))
4040 /* runtime <= deadline <= period (if period != 0) */
4041 if ((attr->sched_period != 0 &&
4042 attr->sched_period < attr->sched_deadline) ||
4043 attr->sched_deadline < attr->sched_runtime)
4050 * check the target process has a UID that matches the current process's
4052 static bool check_same_owner(struct task_struct *p)
4054 const struct cred *cred = current_cred(), *pcred;
4058 pcred = __task_cred(p);
4059 match = (uid_eq(cred->euid, pcred->euid) ||
4060 uid_eq(cred->euid, pcred->uid));
4065 static bool dl_param_changed(struct task_struct *p,
4066 const struct sched_attr *attr)
4068 struct sched_dl_entity *dl_se = &p->dl;
4070 if (dl_se->dl_runtime != attr->sched_runtime ||
4071 dl_se->dl_deadline != attr->sched_deadline ||
4072 dl_se->dl_period != attr->sched_period ||
4073 dl_se->flags != attr->sched_flags)
4079 static int __sched_setscheduler(struct task_struct *p,
4080 const struct sched_attr *attr,
4083 int newprio = dl_policy(attr->sched_policy) ? MAX_DL_PRIO - 1 :
4084 MAX_RT_PRIO - 1 - attr->sched_priority;
4085 int retval, oldprio, oldpolicy = -1, queued, running;
4086 int new_effective_prio, policy = attr->sched_policy;
4087 const struct sched_class *prev_class;
4090 int queue_flags = DEQUEUE_SAVE | DEQUEUE_MOVE;
4093 /* may grab non-irq protected spin_locks */
4094 BUG_ON(in_interrupt());
4096 /* double check policy once rq lock held */
4098 reset_on_fork = p->sched_reset_on_fork;
4099 policy = oldpolicy = p->policy;
4101 reset_on_fork = !!(attr->sched_flags & SCHED_FLAG_RESET_ON_FORK);
4103 if (!valid_policy(policy))
4107 if (attr->sched_flags & ~(SCHED_FLAG_RESET_ON_FORK))
4111 * Valid priorities for SCHED_FIFO and SCHED_RR are
4112 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4113 * SCHED_BATCH and SCHED_IDLE is 0.
4115 if ((p->mm && attr->sched_priority > MAX_USER_RT_PRIO-1) ||
4116 (!p->mm && attr->sched_priority > MAX_RT_PRIO-1))
4118 if ((dl_policy(policy) && !__checkparam_dl(attr)) ||
4119 (rt_policy(policy) != (attr->sched_priority != 0)))
4123 * Allow unprivileged RT tasks to decrease priority:
4125 if (user && !capable(CAP_SYS_NICE)) {
4126 if (fair_policy(policy)) {
4127 if (attr->sched_nice < task_nice(p) &&
4128 !can_nice(p, attr->sched_nice))
4132 if (rt_policy(policy)) {
4133 unsigned long rlim_rtprio =
4134 task_rlimit(p, RLIMIT_RTPRIO);
4136 /* can't set/change the rt policy */
4137 if (policy != p->policy && !rlim_rtprio)
4140 /* can't increase priority */
4141 if (attr->sched_priority > p->rt_priority &&
4142 attr->sched_priority > rlim_rtprio)
4147 * Can't set/change SCHED_DEADLINE policy at all for now
4148 * (safest behavior); in the future we would like to allow
4149 * unprivileged DL tasks to increase their relative deadline
4150 * or reduce their runtime (both ways reducing utilization)
4152 if (dl_policy(policy))
4156 * Treat SCHED_IDLE as nice 20. Only allow a switch to
4157 * SCHED_NORMAL if the RLIMIT_NICE would normally permit it.
4159 if (idle_policy(p->policy) && !idle_policy(policy)) {
4160 if (!can_nice(p, task_nice(p)))
4164 /* can't change other user's priorities */
4165 if (!check_same_owner(p))
4168 /* Normal users shall not reset the sched_reset_on_fork flag */
4169 if (p->sched_reset_on_fork && !reset_on_fork)
4174 retval = security_task_setscheduler(p);
4180 * make sure no PI-waiters arrive (or leave) while we are
4181 * changing the priority of the task:
4183 * To be able to change p->policy safely, the appropriate
4184 * runqueue lock must be held.
4186 rq = task_rq_lock(p, &rf);
4187 update_rq_clock(rq);
4190 * Changing the policy of the stop threads its a very bad idea
4192 if (p == rq->stop) {
4193 task_rq_unlock(rq, p, &rf);
4198 * If not changing anything there's no need to proceed further,
4199 * but store a possible modification of reset_on_fork.
4201 if (unlikely(policy == p->policy)) {
4202 if (fair_policy(policy) && attr->sched_nice != task_nice(p))
4204 if (rt_policy(policy) && attr->sched_priority != p->rt_priority)
4206 if (dl_policy(policy) && dl_param_changed(p, attr))
4209 p->sched_reset_on_fork = reset_on_fork;
4210 task_rq_unlock(rq, p, &rf);
4216 #ifdef CONFIG_RT_GROUP_SCHED
4218 * Do not allow realtime tasks into groups that have no runtime
4221 if (rt_bandwidth_enabled() && rt_policy(policy) &&
4222 task_group(p)->rt_bandwidth.rt_runtime == 0 &&
4223 !task_group_is_autogroup(task_group(p))) {
4224 task_rq_unlock(rq, p, &rf);
4229 if (dl_bandwidth_enabled() && dl_policy(policy)) {
4230 cpumask_t *span = rq->rd->span;
4233 * Don't allow tasks with an affinity mask smaller than
4234 * the entire root_domain to become SCHED_DEADLINE. We
4235 * will also fail if there's no bandwidth available.
4237 if (!cpumask_subset(span, &p->cpus_allowed) ||
4238 rq->rd->dl_bw.bw == 0) {
4239 task_rq_unlock(rq, p, &rf);
4246 /* recheck policy now with rq lock held */
4247 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
4248 policy = oldpolicy = -1;
4249 task_rq_unlock(rq, p, &rf);
4254 * If setscheduling to SCHED_DEADLINE (or changing the parameters
4255 * of a SCHED_DEADLINE task) we need to check if enough bandwidth
4258 if ((dl_policy(policy) || dl_task(p)) && dl_overflow(p, policy, attr)) {
4259 task_rq_unlock(rq, p, &rf);
4263 p->sched_reset_on_fork = reset_on_fork;
4268 * Take priority boosted tasks into account. If the new
4269 * effective priority is unchanged, we just store the new
4270 * normal parameters and do not touch the scheduler class and
4271 * the runqueue. This will be done when the task deboost
4274 new_effective_prio = rt_mutex_get_effective_prio(p, newprio);
4275 if (new_effective_prio == oldprio)
4276 queue_flags &= ~DEQUEUE_MOVE;
4279 queued = task_on_rq_queued(p);
4280 running = task_current(rq, p);
4282 dequeue_task(rq, p, queue_flags);
4284 put_prev_task(rq, p);
4286 prev_class = p->sched_class;
4287 __setscheduler(rq, p, attr, pi);
4291 * We enqueue to tail when the priority of a task is
4292 * increased (user space view).
4294 if (oldprio < p->prio)
4295 queue_flags |= ENQUEUE_HEAD;
4297 enqueue_task(rq, p, queue_flags);
4300 set_curr_task(rq, p);
4302 check_class_changed(rq, p, prev_class, oldprio);
4303 preempt_disable(); /* avoid rq from going away on us */
4304 task_rq_unlock(rq, p, &rf);
4307 rt_mutex_adjust_pi(p);
4310 * Run balance callbacks after we've adjusted the PI chain.
4312 balance_callback(rq);
4318 static int _sched_setscheduler(struct task_struct *p, int policy,
4319 const struct sched_param *param, bool check)
4321 struct sched_attr attr = {
4322 .sched_policy = policy,
4323 .sched_priority = param->sched_priority,
4324 .sched_nice = PRIO_TO_NICE(p->static_prio),
4327 /* Fixup the legacy SCHED_RESET_ON_FORK hack. */
4328 if ((policy != SETPARAM_POLICY) && (policy & SCHED_RESET_ON_FORK)) {
4329 attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
4330 policy &= ~SCHED_RESET_ON_FORK;
4331 attr.sched_policy = policy;
4334 return __sched_setscheduler(p, &attr, check, true);
4337 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4338 * @p: the task in question.
4339 * @policy: new policy.
4340 * @param: structure containing the new RT priority.
4342 * Return: 0 on success. An error code otherwise.
4344 * NOTE that the task may be already dead.
4346 int sched_setscheduler(struct task_struct *p, int policy,
4347 const struct sched_param *param)
4349 return _sched_setscheduler(p, policy, param, true);
4351 EXPORT_SYMBOL_GPL(sched_setscheduler);
4353 int sched_setattr(struct task_struct *p, const struct sched_attr *attr)
4355 return __sched_setscheduler(p, attr, true, true);
4357 EXPORT_SYMBOL_GPL(sched_setattr);
4360 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
4361 * @p: the task in question.
4362 * @policy: new policy.
4363 * @param: structure containing the new RT priority.
4365 * Just like sched_setscheduler, only don't bother checking if the
4366 * current context has permission. For example, this is needed in
4367 * stop_machine(): we create temporary high priority worker threads,
4368 * but our caller might not have that capability.
4370 * Return: 0 on success. An error code otherwise.
4372 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
4373 const struct sched_param *param)
4375 return _sched_setscheduler(p, policy, param, false);
4377 EXPORT_SYMBOL_GPL(sched_setscheduler_nocheck);
4380 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
4382 struct sched_param lparam;
4383 struct task_struct *p;
4386 if (!param || pid < 0)
4388 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
4393 p = find_process_by_pid(pid);
4395 retval = sched_setscheduler(p, policy, &lparam);
4402 * Mimics kernel/events/core.c perf_copy_attr().
4404 static int sched_copy_attr(struct sched_attr __user *uattr,
4405 struct sched_attr *attr)
4410 if (!access_ok(VERIFY_WRITE, uattr, SCHED_ATTR_SIZE_VER0))
4414 * zero the full structure, so that a short copy will be nice.
4416 memset(attr, 0, sizeof(*attr));
4418 ret = get_user(size, &uattr->size);
4422 if (size > PAGE_SIZE) /* silly large */
4425 if (!size) /* abi compat */
4426 size = SCHED_ATTR_SIZE_VER0;
4428 if (size < SCHED_ATTR_SIZE_VER0)
4432 * If we're handed a bigger struct than we know of,
4433 * ensure all the unknown bits are 0 - i.e. new
4434 * user-space does not rely on any kernel feature
4435 * extensions we dont know about yet.
4437 if (size > sizeof(*attr)) {
4438 unsigned char __user *addr;
4439 unsigned char __user *end;
4442 addr = (void __user *)uattr + sizeof(*attr);
4443 end = (void __user *)uattr + size;
4445 for (; addr < end; addr++) {
4446 ret = get_user(val, addr);
4452 size = sizeof(*attr);
4455 ret = copy_from_user(attr, uattr, size);
4460 * XXX: do we want to be lenient like existing syscalls; or do we want
4461 * to be strict and return an error on out-of-bounds values?
4463 attr->sched_nice = clamp(attr->sched_nice, MIN_NICE, MAX_NICE);
4468 put_user(sizeof(*attr), &uattr->size);
4473 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4474 * @pid: the pid in question.
4475 * @policy: new policy.
4476 * @param: structure containing the new RT priority.
4478 * Return: 0 on success. An error code otherwise.
4480 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
4481 struct sched_param __user *, param)
4483 /* negative values for policy are not valid */
4487 return do_sched_setscheduler(pid, policy, param);
4491 * sys_sched_setparam - set/change the RT priority of a thread
4492 * @pid: the pid in question.
4493 * @param: structure containing the new RT priority.
4495 * Return: 0 on success. An error code otherwise.
4497 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
4499 return do_sched_setscheduler(pid, SETPARAM_POLICY, param);
4503 * sys_sched_setattr - same as above, but with extended sched_attr
4504 * @pid: the pid in question.
4505 * @uattr: structure containing the extended parameters.
4506 * @flags: for future extension.
4508 SYSCALL_DEFINE3(sched_setattr, pid_t, pid, struct sched_attr __user *, uattr,
4509 unsigned int, flags)
4511 struct sched_attr attr;
4512 struct task_struct *p;
4515 if (!uattr || pid < 0 || flags)
4518 retval = sched_copy_attr(uattr, &attr);
4522 if ((int)attr.sched_policy < 0)
4527 p = find_process_by_pid(pid);
4529 retval = sched_setattr(p, &attr);
4536 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4537 * @pid: the pid in question.
4539 * Return: On success, the policy of the thread. Otherwise, a negative error
4542 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
4544 struct task_struct *p;
4552 p = find_process_by_pid(pid);
4554 retval = security_task_getscheduler(p);
4557 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
4564 * sys_sched_getparam - get the RT priority of a thread
4565 * @pid: the pid in question.
4566 * @param: structure containing the RT priority.
4568 * Return: On success, 0 and the RT priority is in @param. Otherwise, an error
4571 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
4573 struct sched_param lp = { .sched_priority = 0 };
4574 struct task_struct *p;
4577 if (!param || pid < 0)
4581 p = find_process_by_pid(pid);
4586 retval = security_task_getscheduler(p);
4590 if (task_has_rt_policy(p))
4591 lp.sched_priority = p->rt_priority;
4595 * This one might sleep, we cannot do it with a spinlock held ...
4597 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
4606 static int sched_read_attr(struct sched_attr __user *uattr,
4607 struct sched_attr *attr,
4612 if (!access_ok(VERIFY_WRITE, uattr, usize))
4616 * If we're handed a smaller struct than we know of,
4617 * ensure all the unknown bits are 0 - i.e. old
4618 * user-space does not get uncomplete information.
4620 if (usize < sizeof(*attr)) {
4621 unsigned char *addr;
4624 addr = (void *)attr + usize;
4625 end = (void *)attr + sizeof(*attr);
4627 for (; addr < end; addr++) {
4635 ret = copy_to_user(uattr, attr, attr->size);
4643 * sys_sched_getattr - similar to sched_getparam, but with sched_attr
4644 * @pid: the pid in question.
4645 * @uattr: structure containing the extended parameters.
4646 * @size: sizeof(attr) for fwd/bwd comp.
4647 * @flags: for future extension.
4649 SYSCALL_DEFINE4(sched_getattr, pid_t, pid, struct sched_attr __user *, uattr,
4650 unsigned int, size, unsigned int, flags)
4652 struct sched_attr attr = {
4653 .size = sizeof(struct sched_attr),
4655 struct task_struct *p;
4658 if (!uattr || pid < 0 || size > PAGE_SIZE ||
4659 size < SCHED_ATTR_SIZE_VER0 || flags)
4663 p = find_process_by_pid(pid);
4668 retval = security_task_getscheduler(p);
4672 attr.sched_policy = p->policy;
4673 if (p->sched_reset_on_fork)
4674 attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
4675 if (task_has_dl_policy(p))
4676 __getparam_dl(p, &attr);
4677 else if (task_has_rt_policy(p))
4678 attr.sched_priority = p->rt_priority;
4680 attr.sched_nice = task_nice(p);
4684 retval = sched_read_attr(uattr, &attr, size);
4692 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4694 cpumask_var_t cpus_allowed, new_mask;
4695 struct task_struct *p;
4700 p = find_process_by_pid(pid);
4706 /* Prevent p going away */
4710 if (p->flags & PF_NO_SETAFFINITY) {
4714 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4718 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4720 goto out_free_cpus_allowed;
4723 if (!check_same_owner(p)) {
4725 if (!ns_capable(__task_cred(p)->user_ns, CAP_SYS_NICE)) {
4727 goto out_free_new_mask;
4732 retval = security_task_setscheduler(p);
4734 goto out_free_new_mask;
4737 cpuset_cpus_allowed(p, cpus_allowed);
4738 cpumask_and(new_mask, in_mask, cpus_allowed);
4741 * Since bandwidth control happens on root_domain basis,
4742 * if admission test is enabled, we only admit -deadline
4743 * tasks allowed to run on all the CPUs in the task's
4747 if (task_has_dl_policy(p) && dl_bandwidth_enabled()) {
4749 if (!cpumask_subset(task_rq(p)->rd->span, new_mask)) {
4752 goto out_free_new_mask;
4758 retval = __set_cpus_allowed_ptr(p, new_mask, true);
4761 cpuset_cpus_allowed(p, cpus_allowed);
4762 if (!cpumask_subset(new_mask, cpus_allowed)) {
4764 * We must have raced with a concurrent cpuset
4765 * update. Just reset the cpus_allowed to the
4766 * cpuset's cpus_allowed
4768 cpumask_copy(new_mask, cpus_allowed);
4773 free_cpumask_var(new_mask);
4774 out_free_cpus_allowed:
4775 free_cpumask_var(cpus_allowed);
4781 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4782 struct cpumask *new_mask)
4784 if (len < cpumask_size())
4785 cpumask_clear(new_mask);
4786 else if (len > cpumask_size())
4787 len = cpumask_size();
4789 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4793 * sys_sched_setaffinity - set the cpu affinity of a process
4794 * @pid: pid of the process
4795 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4796 * @user_mask_ptr: user-space pointer to the new cpu mask
4798 * Return: 0 on success. An error code otherwise.
4800 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4801 unsigned long __user *, user_mask_ptr)
4803 cpumask_var_t new_mask;
4806 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4809 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4811 retval = sched_setaffinity(pid, new_mask);
4812 free_cpumask_var(new_mask);
4816 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4818 struct task_struct *p;
4819 unsigned long flags;
4825 p = find_process_by_pid(pid);
4829 retval = security_task_getscheduler(p);
4833 raw_spin_lock_irqsave(&p->pi_lock, flags);
4834 cpumask_and(mask, &p->cpus_allowed, cpu_active_mask);
4835 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4844 * sys_sched_getaffinity - get the cpu affinity of a process
4845 * @pid: pid of the process
4846 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4847 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4849 * Return: size of CPU mask copied to user_mask_ptr on success. An
4850 * error code otherwise.
4852 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4853 unsigned long __user *, user_mask_ptr)
4858 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
4860 if (len & (sizeof(unsigned long)-1))
4863 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4866 ret = sched_getaffinity(pid, mask);
4868 size_t retlen = min_t(size_t, len, cpumask_size());
4870 if (copy_to_user(user_mask_ptr, mask, retlen))
4875 free_cpumask_var(mask);
4881 * sys_sched_yield - yield the current processor to other threads.
4883 * This function yields the current CPU to other tasks. If there are no
4884 * other threads running on this CPU then this function will return.
4888 SYSCALL_DEFINE0(sched_yield)
4890 struct rq *rq = this_rq_lock();
4892 schedstat_inc(rq->yld_count);
4893 current->sched_class->yield_task(rq);
4896 * Since we are going to call schedule() anyway, there's
4897 * no need to preempt or enable interrupts:
4899 __release(rq->lock);
4900 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4901 do_raw_spin_unlock(&rq->lock);
4902 sched_preempt_enable_no_resched();
4909 #ifndef CONFIG_PREEMPT
4910 int __sched _cond_resched(void)
4912 if (should_resched(0)) {
4913 preempt_schedule_common();
4918 EXPORT_SYMBOL(_cond_resched);
4922 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4923 * call schedule, and on return reacquire the lock.
4925 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4926 * operations here to prevent schedule() from being called twice (once via
4927 * spin_unlock(), once by hand).
4929 int __cond_resched_lock(spinlock_t *lock)
4931 int resched = should_resched(PREEMPT_LOCK_OFFSET);
4934 lockdep_assert_held(lock);
4936 if (spin_needbreak(lock) || resched) {
4939 preempt_schedule_common();
4947 EXPORT_SYMBOL(__cond_resched_lock);
4949 int __sched __cond_resched_softirq(void)
4951 BUG_ON(!in_softirq());
4953 if (should_resched(SOFTIRQ_DISABLE_OFFSET)) {
4955 preempt_schedule_common();
4961 EXPORT_SYMBOL(__cond_resched_softirq);
4964 * yield - yield the current processor to other threads.
4966 * Do not ever use this function, there's a 99% chance you're doing it wrong.
4968 * The scheduler is at all times free to pick the calling task as the most
4969 * eligible task to run, if removing the yield() call from your code breaks
4970 * it, its already broken.
4972 * Typical broken usage is:
4977 * where one assumes that yield() will let 'the other' process run that will
4978 * make event true. If the current task is a SCHED_FIFO task that will never
4979 * happen. Never use yield() as a progress guarantee!!
4981 * If you want to use yield() to wait for something, use wait_event().
4982 * If you want to use yield() to be 'nice' for others, use cond_resched().
4983 * If you still want to use yield(), do not!
4985 void __sched yield(void)
4987 set_current_state(TASK_RUNNING);
4990 EXPORT_SYMBOL(yield);
4993 * yield_to - yield the current processor to another thread in
4994 * your thread group, or accelerate that thread toward the
4995 * processor it's on.
4997 * @preempt: whether task preemption is allowed or not
4999 * It's the caller's job to ensure that the target task struct
5000 * can't go away on us before we can do any checks.
5003 * true (>0) if we indeed boosted the target task.
5004 * false (0) if we failed to boost the target.
5005 * -ESRCH if there's no task to yield to.
5007 int __sched yield_to(struct task_struct *p, bool preempt)
5009 struct task_struct *curr = current;
5010 struct rq *rq, *p_rq;
5011 unsigned long flags;
5014 local_irq_save(flags);
5020 * If we're the only runnable task on the rq and target rq also
5021 * has only one task, there's absolutely no point in yielding.
5023 if (rq->nr_running == 1 && p_rq->nr_running == 1) {
5028 double_rq_lock(rq, p_rq);
5029 if (task_rq(p) != p_rq) {
5030 double_rq_unlock(rq, p_rq);
5034 if (!curr->sched_class->yield_to_task)
5037 if (curr->sched_class != p->sched_class)
5040 if (task_running(p_rq, p) || p->state)
5043 yielded = curr->sched_class->yield_to_task(rq, p, preempt);
5045 schedstat_inc(rq->yld_count);
5047 * Make p's CPU reschedule; pick_next_entity takes care of
5050 if (preempt && rq != p_rq)
5055 double_rq_unlock(rq, p_rq);
5057 local_irq_restore(flags);
5064 EXPORT_SYMBOL_GPL(yield_to);
5067 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
5068 * that process accounting knows that this is a task in IO wait state.
5070 long __sched io_schedule_timeout(long timeout)
5072 int old_iowait = current->in_iowait;
5076 current->in_iowait = 1;
5077 blk_schedule_flush_plug(current);
5079 delayacct_blkio_start();
5081 atomic_inc(&rq->nr_iowait);
5082 ret = schedule_timeout(timeout);
5083 current->in_iowait = old_iowait;
5084 atomic_dec(&rq->nr_iowait);
5085 delayacct_blkio_end();
5089 EXPORT_SYMBOL(io_schedule_timeout);
5092 * sys_sched_get_priority_max - return maximum RT priority.
5093 * @policy: scheduling class.
5095 * Return: On success, this syscall returns the maximum
5096 * rt_priority that can be used by a given scheduling class.
5097 * On failure, a negative error code is returned.
5099 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
5106 ret = MAX_USER_RT_PRIO-1;
5108 case SCHED_DEADLINE:
5119 * sys_sched_get_priority_min - return minimum RT priority.
5120 * @policy: scheduling class.
5122 * Return: On success, this syscall returns the minimum
5123 * rt_priority that can be used by a given scheduling class.
5124 * On failure, a negative error code is returned.
5126 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
5135 case SCHED_DEADLINE:
5145 * sys_sched_rr_get_interval - return the default timeslice of a process.
5146 * @pid: pid of the process.
5147 * @interval: userspace pointer to the timeslice value.
5149 * this syscall writes the default timeslice value of a given process
5150 * into the user-space timespec buffer. A value of '0' means infinity.
5152 * Return: On success, 0 and the timeslice is in @interval. Otherwise,
5155 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
5156 struct timespec __user *, interval)
5158 struct task_struct *p;
5159 unsigned int time_slice;
5170 p = find_process_by_pid(pid);
5174 retval = security_task_getscheduler(p);
5178 rq = task_rq_lock(p, &rf);
5180 if (p->sched_class->get_rr_interval)
5181 time_slice = p->sched_class->get_rr_interval(rq, p);
5182 task_rq_unlock(rq, p, &rf);
5185 jiffies_to_timespec(time_slice, &t);
5186 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
5194 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
5196 void sched_show_task(struct task_struct *p)
5198 unsigned long free = 0;
5200 unsigned long state = p->state;
5202 if (!try_get_task_stack(p))
5205 state = __ffs(state) + 1;
5206 printk(KERN_INFO "%-15.15s %c", p->comm,
5207 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
5208 if (state == TASK_RUNNING)
5209 printk(KERN_CONT " running task ");
5210 #ifdef CONFIG_DEBUG_STACK_USAGE
5211 free = stack_not_used(p);
5216 ppid = task_pid_nr(rcu_dereference(p->real_parent));
5218 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
5219 task_pid_nr(p), ppid,
5220 (unsigned long)task_thread_info(p)->flags);
5222 print_worker_info(KERN_INFO, p);
5223 show_stack(p, NULL);
5227 void show_state_filter(unsigned long state_filter)
5229 struct task_struct *g, *p;
5231 #if BITS_PER_LONG == 32
5233 " task PC stack pid father\n");
5236 " task PC stack pid father\n");
5239 for_each_process_thread(g, p) {
5241 * reset the NMI-timeout, listing all files on a slow
5242 * console might take a lot of time:
5243 * Also, reset softlockup watchdogs on all CPUs, because
5244 * another CPU might be blocked waiting for us to process
5247 touch_nmi_watchdog();
5248 touch_all_softlockup_watchdogs();
5249 if (!state_filter || (p->state & state_filter))
5253 #ifdef CONFIG_SCHED_DEBUG
5255 sysrq_sched_debug_show();
5259 * Only show locks if all tasks are dumped:
5262 debug_show_all_locks();
5265 void init_idle_bootup_task(struct task_struct *idle)
5267 idle->sched_class = &idle_sched_class;
5271 * init_idle - set up an idle thread for a given CPU
5272 * @idle: task in question
5273 * @cpu: cpu the idle task belongs to
5275 * NOTE: this function does not set the idle thread's NEED_RESCHED
5276 * flag, to make booting more robust.
5278 void init_idle(struct task_struct *idle, int cpu)
5280 struct rq *rq = cpu_rq(cpu);
5281 unsigned long flags;
5283 raw_spin_lock_irqsave(&idle->pi_lock, flags);
5284 raw_spin_lock(&rq->lock);
5286 __sched_fork(0, idle);
5287 idle->state = TASK_RUNNING;
5288 idle->se.exec_start = sched_clock();
5289 idle->flags |= PF_IDLE;
5291 kasan_unpoison_task_stack(idle);
5295 * Its possible that init_idle() gets called multiple times on a task,
5296 * in that case do_set_cpus_allowed() will not do the right thing.
5298 * And since this is boot we can forgo the serialization.
5300 set_cpus_allowed_common(idle, cpumask_of(cpu));
5303 * We're having a chicken and egg problem, even though we are
5304 * holding rq->lock, the cpu isn't yet set to this cpu so the
5305 * lockdep check in task_group() will fail.
5307 * Similar case to sched_fork(). / Alternatively we could
5308 * use task_rq_lock() here and obtain the other rq->lock.
5313 __set_task_cpu(idle, cpu);
5316 rq->curr = rq->idle = idle;
5317 idle->on_rq = TASK_ON_RQ_QUEUED;
5321 raw_spin_unlock(&rq->lock);
5322 raw_spin_unlock_irqrestore(&idle->pi_lock, flags);
5324 /* Set the preempt count _outside_ the spinlocks! */
5325 init_idle_preempt_count(idle, cpu);
5328 * The idle tasks have their own, simple scheduling class:
5330 idle->sched_class = &idle_sched_class;
5331 ftrace_graph_init_idle_task(idle, cpu);
5332 vtime_init_idle(idle, cpu);
5334 sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu);
5338 int cpuset_cpumask_can_shrink(const struct cpumask *cur,
5339 const struct cpumask *trial)
5341 int ret = 1, trial_cpus;
5342 struct dl_bw *cur_dl_b;
5343 unsigned long flags;
5345 if (!cpumask_weight(cur))
5348 rcu_read_lock_sched();
5349 cur_dl_b = dl_bw_of(cpumask_any(cur));
5350 trial_cpus = cpumask_weight(trial);
5352 raw_spin_lock_irqsave(&cur_dl_b->lock, flags);
5353 if (cur_dl_b->bw != -1 &&
5354 cur_dl_b->bw * trial_cpus < cur_dl_b->total_bw)
5356 raw_spin_unlock_irqrestore(&cur_dl_b->lock, flags);
5357 rcu_read_unlock_sched();
5362 int task_can_attach(struct task_struct *p,
5363 const struct cpumask *cs_cpus_allowed)
5368 * Kthreads which disallow setaffinity shouldn't be moved
5369 * to a new cpuset; we don't want to change their cpu
5370 * affinity and isolating such threads by their set of
5371 * allowed nodes is unnecessary. Thus, cpusets are not
5372 * applicable for such threads. This prevents checking for
5373 * success of set_cpus_allowed_ptr() on all attached tasks
5374 * before cpus_allowed may be changed.
5376 if (p->flags & PF_NO_SETAFFINITY) {
5382 if (dl_task(p) && !cpumask_intersects(task_rq(p)->rd->span,
5384 unsigned int dest_cpu = cpumask_any_and(cpu_active_mask,
5389 unsigned long flags;
5391 rcu_read_lock_sched();
5392 dl_b = dl_bw_of(dest_cpu);
5393 raw_spin_lock_irqsave(&dl_b->lock, flags);
5394 cpus = dl_bw_cpus(dest_cpu);
5395 overflow = __dl_overflow(dl_b, cpus, 0, p->dl.dl_bw);
5400 * We reserve space for this task in the destination
5401 * root_domain, as we can't fail after this point.
5402 * We will free resources in the source root_domain
5403 * later on (see set_cpus_allowed_dl()).
5405 __dl_add(dl_b, p->dl.dl_bw);
5407 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
5408 rcu_read_unlock_sched();
5418 static bool sched_smp_initialized __read_mostly;
5420 #ifdef CONFIG_NUMA_BALANCING
5421 /* Migrate current task p to target_cpu */
5422 int migrate_task_to(struct task_struct *p, int target_cpu)
5424 struct migration_arg arg = { p, target_cpu };
5425 int curr_cpu = task_cpu(p);
5427 if (curr_cpu == target_cpu)
5430 if (!cpumask_test_cpu(target_cpu, tsk_cpus_allowed(p)))
5433 /* TODO: This is not properly updating schedstats */
5435 trace_sched_move_numa(p, curr_cpu, target_cpu);
5436 return stop_one_cpu(curr_cpu, migration_cpu_stop, &arg);
5440 * Requeue a task on a given node and accurately track the number of NUMA
5441 * tasks on the runqueues
5443 void sched_setnuma(struct task_struct *p, int nid)
5445 bool queued, running;
5449 rq = task_rq_lock(p, &rf);
5450 queued = task_on_rq_queued(p);
5451 running = task_current(rq, p);
5454 dequeue_task(rq, p, DEQUEUE_SAVE);
5456 put_prev_task(rq, p);
5458 p->numa_preferred_nid = nid;
5461 enqueue_task(rq, p, ENQUEUE_RESTORE);
5463 set_curr_task(rq, p);
5464 task_rq_unlock(rq, p, &rf);
5466 #endif /* CONFIG_NUMA_BALANCING */
5468 #ifdef CONFIG_HOTPLUG_CPU
5470 * Ensures that the idle task is using init_mm right before its cpu goes
5473 void idle_task_exit(void)
5475 struct mm_struct *mm = current->active_mm;
5477 BUG_ON(cpu_online(smp_processor_id()));
5479 if (mm != &init_mm) {
5480 switch_mm_irqs_off(mm, &init_mm, current);
5481 finish_arch_post_lock_switch();
5487 * Since this CPU is going 'away' for a while, fold any nr_active delta
5488 * we might have. Assumes we're called after migrate_tasks() so that the
5489 * nr_active count is stable. We need to take the teardown thread which
5490 * is calling this into account, so we hand in adjust = 1 to the load
5493 * Also see the comment "Global load-average calculations".
5495 static void calc_load_migrate(struct rq *rq)
5497 long delta = calc_load_fold_active(rq, 1);
5499 atomic_long_add(delta, &calc_load_tasks);
5502 static void put_prev_task_fake(struct rq *rq, struct task_struct *prev)
5506 static const struct sched_class fake_sched_class = {
5507 .put_prev_task = put_prev_task_fake,
5510 static struct task_struct fake_task = {
5512 * Avoid pull_{rt,dl}_task()
5514 .prio = MAX_PRIO + 1,
5515 .sched_class = &fake_sched_class,
5519 * Migrate all tasks from the rq, sleeping tasks will be migrated by
5520 * try_to_wake_up()->select_task_rq().
5522 * Called with rq->lock held even though we'er in stop_machine() and
5523 * there's no concurrency possible, we hold the required locks anyway
5524 * because of lock validation efforts.
5526 static void migrate_tasks(struct rq *dead_rq)
5528 struct rq *rq = dead_rq;
5529 struct task_struct *next, *stop = rq->stop;
5534 * Fudge the rq selection such that the below task selection loop
5535 * doesn't get stuck on the currently eligible stop task.
5537 * We're currently inside stop_machine() and the rq is either stuck
5538 * in the stop_machine_cpu_stop() loop, or we're executing this code,
5539 * either way we should never end up calling schedule() until we're
5545 * put_prev_task() and pick_next_task() sched
5546 * class method both need to have an up-to-date
5547 * value of rq->clock[_task]
5549 update_rq_clock(rq);
5553 * There's this thread running, bail when that's the only
5556 if (rq->nr_running == 1)
5560 * pick_next_task assumes pinned rq->lock.
5562 rq_pin_lock(rq, &rf);
5563 next = pick_next_task(rq, &fake_task, &rf);
5565 next->sched_class->put_prev_task(rq, next);
5568 * Rules for changing task_struct::cpus_allowed are holding
5569 * both pi_lock and rq->lock, such that holding either
5570 * stabilizes the mask.
5572 * Drop rq->lock is not quite as disastrous as it usually is
5573 * because !cpu_active at this point, which means load-balance
5574 * will not interfere. Also, stop-machine.
5576 rq_unpin_lock(rq, &rf);
5577 raw_spin_unlock(&rq->lock);
5578 raw_spin_lock(&next->pi_lock);
5579 raw_spin_lock(&rq->lock);
5582 * Since we're inside stop-machine, _nothing_ should have
5583 * changed the task, WARN if weird stuff happened, because in
5584 * that case the above rq->lock drop is a fail too.
5586 if (WARN_ON(task_rq(next) != rq || !task_on_rq_queued(next))) {
5587 raw_spin_unlock(&next->pi_lock);
5591 /* Find suitable destination for @next, with force if needed. */
5592 dest_cpu = select_fallback_rq(dead_rq->cpu, next);
5594 rq = __migrate_task(rq, next, dest_cpu);
5595 if (rq != dead_rq) {
5596 raw_spin_unlock(&rq->lock);
5598 raw_spin_lock(&rq->lock);
5600 raw_spin_unlock(&next->pi_lock);
5605 #endif /* CONFIG_HOTPLUG_CPU */
5607 static void set_rq_online(struct rq *rq)
5610 const struct sched_class *class;
5612 cpumask_set_cpu(rq->cpu, rq->rd->online);
5615 for_each_class(class) {
5616 if (class->rq_online)
5617 class->rq_online(rq);
5622 static void set_rq_offline(struct rq *rq)
5625 const struct sched_class *class;
5627 for_each_class(class) {
5628 if (class->rq_offline)
5629 class->rq_offline(rq);
5632 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5637 static void set_cpu_rq_start_time(unsigned int cpu)
5639 struct rq *rq = cpu_rq(cpu);
5641 rq->age_stamp = sched_clock_cpu(cpu);
5644 static cpumask_var_t sched_domains_tmpmask; /* sched_domains_mutex */
5646 #ifdef CONFIG_SCHED_DEBUG
5648 static __read_mostly int sched_debug_enabled;
5650 static int __init sched_debug_setup(char *str)
5652 sched_debug_enabled = 1;
5656 early_param("sched_debug", sched_debug_setup);
5658 static inline bool sched_debug(void)
5660 return sched_debug_enabled;
5663 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5664 struct cpumask *groupmask)
5666 struct sched_group *group = sd->groups;
5668 cpumask_clear(groupmask);
5670 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5672 if (!(sd->flags & SD_LOAD_BALANCE)) {
5673 printk("does not load-balance\n");
5675 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5680 printk(KERN_CONT "span %*pbl level %s\n",
5681 cpumask_pr_args(sched_domain_span(sd)), sd->name);
5683 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5684 printk(KERN_ERR "ERROR: domain->span does not contain "
5687 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5688 printk(KERN_ERR "ERROR: domain->groups does not contain"
5692 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5696 printk(KERN_ERR "ERROR: group is NULL\n");
5700 if (!cpumask_weight(sched_group_cpus(group))) {
5701 printk(KERN_CONT "\n");
5702 printk(KERN_ERR "ERROR: empty group\n");
5706 if (!(sd->flags & SD_OVERLAP) &&
5707 cpumask_intersects(groupmask, sched_group_cpus(group))) {
5708 printk(KERN_CONT "\n");
5709 printk(KERN_ERR "ERROR: repeated CPUs\n");
5713 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
5715 printk(KERN_CONT " %*pbl",
5716 cpumask_pr_args(sched_group_cpus(group)));
5717 if (group->sgc->capacity != SCHED_CAPACITY_SCALE) {
5718 printk(KERN_CONT " (cpu_capacity = %lu)",
5719 group->sgc->capacity);
5722 group = group->next;
5723 } while (group != sd->groups);
5724 printk(KERN_CONT "\n");
5726 if (!cpumask_equal(sched_domain_span(sd), groupmask))
5727 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
5730 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
5731 printk(KERN_ERR "ERROR: parent span is not a superset "
5732 "of domain->span\n");
5736 static void sched_domain_debug(struct sched_domain *sd, int cpu)
5740 if (!sched_debug_enabled)
5744 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
5748 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
5751 if (sched_domain_debug_one(sd, cpu, level, sched_domains_tmpmask))
5759 #else /* !CONFIG_SCHED_DEBUG */
5761 # define sched_debug_enabled 0
5762 # define sched_domain_debug(sd, cpu) do { } while (0)
5763 static inline bool sched_debug(void)
5767 #endif /* CONFIG_SCHED_DEBUG */
5769 static int sd_degenerate(struct sched_domain *sd)
5771 if (cpumask_weight(sched_domain_span(sd)) == 1)
5774 /* Following flags need at least 2 groups */
5775 if (sd->flags & (SD_LOAD_BALANCE |
5776 SD_BALANCE_NEWIDLE |
5779 SD_SHARE_CPUCAPACITY |
5780 SD_ASYM_CPUCAPACITY |
5781 SD_SHARE_PKG_RESOURCES |
5782 SD_SHARE_POWERDOMAIN)) {
5783 if (sd->groups != sd->groups->next)
5787 /* Following flags don't use groups */
5788 if (sd->flags & (SD_WAKE_AFFINE))
5795 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
5797 unsigned long cflags = sd->flags, pflags = parent->flags;
5799 if (sd_degenerate(parent))
5802 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
5805 /* Flags needing groups don't count if only 1 group in parent */
5806 if (parent->groups == parent->groups->next) {
5807 pflags &= ~(SD_LOAD_BALANCE |
5808 SD_BALANCE_NEWIDLE |
5811 SD_ASYM_CPUCAPACITY |
5812 SD_SHARE_CPUCAPACITY |
5813 SD_SHARE_PKG_RESOURCES |
5815 SD_SHARE_POWERDOMAIN);
5816 if (nr_node_ids == 1)
5817 pflags &= ~SD_SERIALIZE;
5819 if (~cflags & pflags)
5825 static void free_rootdomain(struct rcu_head *rcu)
5827 struct root_domain *rd = container_of(rcu, struct root_domain, rcu);
5829 cpupri_cleanup(&rd->cpupri);
5830 cpudl_cleanup(&rd->cpudl);
5831 free_cpumask_var(rd->dlo_mask);
5832 free_cpumask_var(rd->rto_mask);
5833 free_cpumask_var(rd->online);
5834 free_cpumask_var(rd->span);
5838 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
5840 struct root_domain *old_rd = NULL;
5841 unsigned long flags;
5843 raw_spin_lock_irqsave(&rq->lock, flags);
5848 if (cpumask_test_cpu(rq->cpu, old_rd->online))
5851 cpumask_clear_cpu(rq->cpu, old_rd->span);
5854 * If we dont want to free the old_rd yet then
5855 * set old_rd to NULL to skip the freeing later
5858 if (!atomic_dec_and_test(&old_rd->refcount))
5862 atomic_inc(&rd->refcount);
5865 cpumask_set_cpu(rq->cpu, rd->span);
5866 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
5869 raw_spin_unlock_irqrestore(&rq->lock, flags);
5872 call_rcu_sched(&old_rd->rcu, free_rootdomain);
5875 static int init_rootdomain(struct root_domain *rd)
5877 memset(rd, 0, sizeof(*rd));
5879 if (!zalloc_cpumask_var(&rd->span, GFP_KERNEL))
5881 if (!zalloc_cpumask_var(&rd->online, GFP_KERNEL))
5883 if (!zalloc_cpumask_var(&rd->dlo_mask, GFP_KERNEL))
5885 if (!zalloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
5888 init_dl_bw(&rd->dl_bw);
5889 if (cpudl_init(&rd->cpudl) != 0)
5892 if (cpupri_init(&rd->cpupri) != 0)
5897 free_cpumask_var(rd->rto_mask);
5899 free_cpumask_var(rd->dlo_mask);
5901 free_cpumask_var(rd->online);
5903 free_cpumask_var(rd->span);
5909 * By default the system creates a single root-domain with all cpus as
5910 * members (mimicking the global state we have today).
5912 struct root_domain def_root_domain;
5914 static void init_defrootdomain(void)
5916 init_rootdomain(&def_root_domain);
5918 atomic_set(&def_root_domain.refcount, 1);
5921 static struct root_domain *alloc_rootdomain(void)
5923 struct root_domain *rd;
5925 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
5929 if (init_rootdomain(rd) != 0) {
5937 static void free_sched_groups(struct sched_group *sg, int free_sgc)
5939 struct sched_group *tmp, *first;
5948 if (free_sgc && atomic_dec_and_test(&sg->sgc->ref))
5953 } while (sg != first);
5956 static void destroy_sched_domain(struct sched_domain *sd)
5959 * If its an overlapping domain it has private groups, iterate and
5962 if (sd->flags & SD_OVERLAP) {
5963 free_sched_groups(sd->groups, 1);
5964 } else if (atomic_dec_and_test(&sd->groups->ref)) {
5965 kfree(sd->groups->sgc);
5968 if (sd->shared && atomic_dec_and_test(&sd->shared->ref))
5973 static void destroy_sched_domains_rcu(struct rcu_head *rcu)
5975 struct sched_domain *sd = container_of(rcu, struct sched_domain, rcu);
5978 struct sched_domain *parent = sd->parent;
5979 destroy_sched_domain(sd);
5984 static void destroy_sched_domains(struct sched_domain *sd)
5987 call_rcu(&sd->rcu, destroy_sched_domains_rcu);
5991 * Keep a special pointer to the highest sched_domain that has
5992 * SD_SHARE_PKG_RESOURCE set (Last Level Cache Domain) for this
5993 * allows us to avoid some pointer chasing select_idle_sibling().
5995 * Also keep a unique ID per domain (we use the first cpu number in
5996 * the cpumask of the domain), this allows us to quickly tell if
5997 * two cpus are in the same cache domain, see cpus_share_cache().
5999 DEFINE_PER_CPU(struct sched_domain *, sd_llc);
6000 DEFINE_PER_CPU(int, sd_llc_size);
6001 DEFINE_PER_CPU(int, sd_llc_id);
6002 DEFINE_PER_CPU(struct sched_domain_shared *, sd_llc_shared);
6003 DEFINE_PER_CPU(struct sched_domain *, sd_numa);
6004 DEFINE_PER_CPU(struct sched_domain *, sd_asym);
6006 static void update_top_cache_domain(int cpu)
6008 struct sched_domain_shared *sds = NULL;
6009 struct sched_domain *sd;
6013 sd = highest_flag_domain(cpu, SD_SHARE_PKG_RESOURCES);
6015 id = cpumask_first(sched_domain_span(sd));
6016 size = cpumask_weight(sched_domain_span(sd));
6020 rcu_assign_pointer(per_cpu(sd_llc, cpu), sd);
6021 per_cpu(sd_llc_size, cpu) = size;
6022 per_cpu(sd_llc_id, cpu) = id;
6023 rcu_assign_pointer(per_cpu(sd_llc_shared, cpu), sds);
6025 sd = lowest_flag_domain(cpu, SD_NUMA);
6026 rcu_assign_pointer(per_cpu(sd_numa, cpu), sd);
6028 sd = highest_flag_domain(cpu, SD_ASYM_PACKING);
6029 rcu_assign_pointer(per_cpu(sd_asym, cpu), sd);
6033 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6034 * hold the hotplug lock.
6037 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
6039 struct rq *rq = cpu_rq(cpu);
6040 struct sched_domain *tmp;
6042 /* Remove the sched domains which do not contribute to scheduling. */
6043 for (tmp = sd; tmp; ) {
6044 struct sched_domain *parent = tmp->parent;
6048 if (sd_parent_degenerate(tmp, parent)) {
6049 tmp->parent = parent->parent;
6051 parent->parent->child = tmp;
6053 * Transfer SD_PREFER_SIBLING down in case of a
6054 * degenerate parent; the spans match for this
6055 * so the property transfers.
6057 if (parent->flags & SD_PREFER_SIBLING)
6058 tmp->flags |= SD_PREFER_SIBLING;
6059 destroy_sched_domain(parent);
6064 if (sd && sd_degenerate(sd)) {
6067 destroy_sched_domain(tmp);
6072 sched_domain_debug(sd, cpu);
6074 rq_attach_root(rq, rd);
6076 rcu_assign_pointer(rq->sd, sd);
6077 destroy_sched_domains(tmp);
6079 update_top_cache_domain(cpu);
6082 /* Setup the mask of cpus configured for isolated domains */
6083 static int __init isolated_cpu_setup(char *str)
6087 alloc_bootmem_cpumask_var(&cpu_isolated_map);
6088 ret = cpulist_parse(str, cpu_isolated_map);
6090 pr_err("sched: Error, all isolcpus= values must be between 0 and %d\n", nr_cpu_ids);
6095 __setup("isolcpus=", isolated_cpu_setup);
6098 struct sched_domain ** __percpu sd;
6099 struct root_domain *rd;
6110 * Build an iteration mask that can exclude certain CPUs from the upwards
6113 * Asymmetric node setups can result in situations where the domain tree is of
6114 * unequal depth, make sure to skip domains that already cover the entire
6117 * In that case build_sched_domains() will have terminated the iteration early
6118 * and our sibling sd spans will be empty. Domains should always include the
6119 * cpu they're built on, so check that.
6122 static void build_group_mask(struct sched_domain *sd, struct sched_group *sg)
6124 const struct cpumask *span = sched_domain_span(sd);
6125 struct sd_data *sdd = sd->private;
6126 struct sched_domain *sibling;
6129 for_each_cpu(i, span) {
6130 sibling = *per_cpu_ptr(sdd->sd, i);
6131 if (!cpumask_test_cpu(i, sched_domain_span(sibling)))
6134 cpumask_set_cpu(i, sched_group_mask(sg));
6139 * Return the canonical balance cpu for this group, this is the first cpu
6140 * of this group that's also in the iteration mask.
6142 int group_balance_cpu(struct sched_group *sg)
6144 return cpumask_first_and(sched_group_cpus(sg), sched_group_mask(sg));
6148 build_overlap_sched_groups(struct sched_domain *sd, int cpu)
6150 struct sched_group *first = NULL, *last = NULL, *groups = NULL, *sg;
6151 const struct cpumask *span = sched_domain_span(sd);
6152 struct cpumask *covered = sched_domains_tmpmask;
6153 struct sd_data *sdd = sd->private;
6154 struct sched_domain *sibling;
6157 cpumask_clear(covered);
6159 for_each_cpu(i, span) {
6160 struct cpumask *sg_span;
6162 if (cpumask_test_cpu(i, covered))
6165 sibling = *per_cpu_ptr(sdd->sd, i);
6167 /* See the comment near build_group_mask(). */
6168 if (!cpumask_test_cpu(i, sched_domain_span(sibling)))
6171 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6172 GFP_KERNEL, cpu_to_node(cpu));
6177 sg_span = sched_group_cpus(sg);
6179 cpumask_copy(sg_span, sched_domain_span(sibling->child));
6181 cpumask_set_cpu(i, sg_span);
6183 cpumask_or(covered, covered, sg_span);
6185 sg->sgc = *per_cpu_ptr(sdd->sgc, i);
6186 if (atomic_inc_return(&sg->sgc->ref) == 1)
6187 build_group_mask(sd, sg);
6190 * Initialize sgc->capacity such that even if we mess up the
6191 * domains and no possible iteration will get us here, we won't
6194 sg->sgc->capacity = SCHED_CAPACITY_SCALE * cpumask_weight(sg_span);
6195 sg->sgc->min_capacity = SCHED_CAPACITY_SCALE;
6198 * Make sure the first group of this domain contains the
6199 * canonical balance cpu. Otherwise the sched_domain iteration
6200 * breaks. See update_sg_lb_stats().
6202 if ((!groups && cpumask_test_cpu(cpu, sg_span)) ||
6203 group_balance_cpu(sg) == cpu)
6213 sd->groups = groups;
6218 free_sched_groups(first, 0);
6223 static int get_group(int cpu, struct sd_data *sdd, struct sched_group **sg)
6225 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, cpu);
6226 struct sched_domain *child = sd->child;
6229 cpu = cpumask_first(sched_domain_span(child));
6232 *sg = *per_cpu_ptr(sdd->sg, cpu);
6233 (*sg)->sgc = *per_cpu_ptr(sdd->sgc, cpu);
6234 atomic_set(&(*sg)->sgc->ref, 1); /* for claim_allocations */
6241 * build_sched_groups will build a circular linked list of the groups
6242 * covered by the given span, and will set each group's ->cpumask correctly,
6243 * and ->cpu_capacity to 0.
6245 * Assumes the sched_domain tree is fully constructed
6248 build_sched_groups(struct sched_domain *sd, int cpu)
6250 struct sched_group *first = NULL, *last = NULL;
6251 struct sd_data *sdd = sd->private;
6252 const struct cpumask *span = sched_domain_span(sd);
6253 struct cpumask *covered;
6256 get_group(cpu, sdd, &sd->groups);
6257 atomic_inc(&sd->groups->ref);
6259 if (cpu != cpumask_first(span))
6262 lockdep_assert_held(&sched_domains_mutex);
6263 covered = sched_domains_tmpmask;
6265 cpumask_clear(covered);
6267 for_each_cpu(i, span) {
6268 struct sched_group *sg;
6271 if (cpumask_test_cpu(i, covered))
6274 group = get_group(i, sdd, &sg);
6275 cpumask_setall(sched_group_mask(sg));
6277 for_each_cpu(j, span) {
6278 if (get_group(j, sdd, NULL) != group)
6281 cpumask_set_cpu(j, covered);
6282 cpumask_set_cpu(j, sched_group_cpus(sg));
6297 * Initialize sched groups cpu_capacity.
6299 * cpu_capacity indicates the capacity of sched group, which is used while
6300 * distributing the load between different sched groups in a sched domain.
6301 * Typically cpu_capacity for all the groups in a sched domain will be same
6302 * unless there are asymmetries in the topology. If there are asymmetries,
6303 * group having more cpu_capacity will pickup more load compared to the
6304 * group having less cpu_capacity.
6306 static void init_sched_groups_capacity(int cpu, struct sched_domain *sd)
6308 struct sched_group *sg = sd->groups;
6313 int cpu, max_cpu = -1;
6315 sg->group_weight = cpumask_weight(sched_group_cpus(sg));
6317 if (!(sd->flags & SD_ASYM_PACKING))
6320 for_each_cpu(cpu, sched_group_cpus(sg)) {
6323 else if (sched_asym_prefer(cpu, max_cpu))
6326 sg->asym_prefer_cpu = max_cpu;
6330 } while (sg != sd->groups);
6332 if (cpu != group_balance_cpu(sg))
6335 update_group_capacity(sd, cpu);
6339 * Initializers for schedule domains
6340 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6343 static int default_relax_domain_level = -1;
6344 int sched_domain_level_max;
6346 static int __init setup_relax_domain_level(char *str)
6348 if (kstrtoint(str, 0, &default_relax_domain_level))
6349 pr_warn("Unable to set relax_domain_level\n");
6353 __setup("relax_domain_level=", setup_relax_domain_level);
6355 static void set_domain_attribute(struct sched_domain *sd,
6356 struct sched_domain_attr *attr)
6360 if (!attr || attr->relax_domain_level < 0) {
6361 if (default_relax_domain_level < 0)
6364 request = default_relax_domain_level;
6366 request = attr->relax_domain_level;
6367 if (request < sd->level) {
6368 /* turn off idle balance on this domain */
6369 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6371 /* turn on idle balance on this domain */
6372 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6376 static void __sdt_free(const struct cpumask *cpu_map);
6377 static int __sdt_alloc(const struct cpumask *cpu_map);
6379 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6380 const struct cpumask *cpu_map)
6384 if (!atomic_read(&d->rd->refcount))
6385 free_rootdomain(&d->rd->rcu); /* fall through */
6387 free_percpu(d->sd); /* fall through */
6389 __sdt_free(cpu_map); /* fall through */
6395 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6396 const struct cpumask *cpu_map)
6398 memset(d, 0, sizeof(*d));
6400 if (__sdt_alloc(cpu_map))
6401 return sa_sd_storage;
6402 d->sd = alloc_percpu(struct sched_domain *);
6404 return sa_sd_storage;
6405 d->rd = alloc_rootdomain();
6408 return sa_rootdomain;
6412 * NULL the sd_data elements we've used to build the sched_domain and
6413 * sched_group structure so that the subsequent __free_domain_allocs()
6414 * will not free the data we're using.
6416 static void claim_allocations(int cpu, struct sched_domain *sd)
6418 struct sd_data *sdd = sd->private;
6420 WARN_ON_ONCE(*per_cpu_ptr(sdd->sd, cpu) != sd);
6421 *per_cpu_ptr(sdd->sd, cpu) = NULL;
6423 if (atomic_read(&(*per_cpu_ptr(sdd->sds, cpu))->ref))
6424 *per_cpu_ptr(sdd->sds, cpu) = NULL;
6426 if (atomic_read(&(*per_cpu_ptr(sdd->sg, cpu))->ref))
6427 *per_cpu_ptr(sdd->sg, cpu) = NULL;
6429 if (atomic_read(&(*per_cpu_ptr(sdd->sgc, cpu))->ref))
6430 *per_cpu_ptr(sdd->sgc, cpu) = NULL;
6434 static int sched_domains_numa_levels;
6435 enum numa_topology_type sched_numa_topology_type;
6436 static int *sched_domains_numa_distance;
6437 int sched_max_numa_distance;
6438 static struct cpumask ***sched_domains_numa_masks;
6439 static int sched_domains_curr_level;
6443 * SD_flags allowed in topology descriptions.
6445 * These flags are purely descriptive of the topology and do not prescribe
6446 * behaviour. Behaviour is artificial and mapped in the below sd_init()
6449 * SD_SHARE_CPUCAPACITY - describes SMT topologies
6450 * SD_SHARE_PKG_RESOURCES - describes shared caches
6451 * SD_NUMA - describes NUMA topologies
6452 * SD_SHARE_POWERDOMAIN - describes shared power domain
6453 * SD_ASYM_CPUCAPACITY - describes mixed capacity topologies
6455 * Odd one out, which beside describing the topology has a quirk also
6456 * prescribes the desired behaviour that goes along with it:
6458 * SD_ASYM_PACKING - describes SMT quirks
6460 #define TOPOLOGY_SD_FLAGS \
6461 (SD_SHARE_CPUCAPACITY | \
6462 SD_SHARE_PKG_RESOURCES | \
6465 SD_ASYM_CPUCAPACITY | \
6466 SD_SHARE_POWERDOMAIN)
6468 static struct sched_domain *
6469 sd_init(struct sched_domain_topology_level *tl,
6470 const struct cpumask *cpu_map,
6471 struct sched_domain *child, int cpu)
6473 struct sd_data *sdd = &tl->data;
6474 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, cpu);
6475 int sd_id, sd_weight, sd_flags = 0;
6479 * Ugly hack to pass state to sd_numa_mask()...
6481 sched_domains_curr_level = tl->numa_level;
6484 sd_weight = cpumask_weight(tl->mask(cpu));
6487 sd_flags = (*tl->sd_flags)();
6488 if (WARN_ONCE(sd_flags & ~TOPOLOGY_SD_FLAGS,
6489 "wrong sd_flags in topology description\n"))
6490 sd_flags &= ~TOPOLOGY_SD_FLAGS;
6492 *sd = (struct sched_domain){
6493 .min_interval = sd_weight,
6494 .max_interval = 2*sd_weight,
6496 .imbalance_pct = 125,
6498 .cache_nice_tries = 0,
6505 .flags = 1*SD_LOAD_BALANCE
6506 | 1*SD_BALANCE_NEWIDLE
6511 | 0*SD_SHARE_CPUCAPACITY
6512 | 0*SD_SHARE_PKG_RESOURCES
6514 | 0*SD_PREFER_SIBLING
6519 .last_balance = jiffies,
6520 .balance_interval = sd_weight,
6522 .max_newidle_lb_cost = 0,
6523 .next_decay_max_lb_cost = jiffies,
6525 #ifdef CONFIG_SCHED_DEBUG
6530 cpumask_and(sched_domain_span(sd), cpu_map, tl->mask(cpu));
6531 sd_id = cpumask_first(sched_domain_span(sd));
6534 * Convert topological properties into behaviour.
6537 if (sd->flags & SD_ASYM_CPUCAPACITY) {
6538 struct sched_domain *t = sd;
6540 for_each_lower_domain(t)
6541 t->flags |= SD_BALANCE_WAKE;
6544 if (sd->flags & SD_SHARE_CPUCAPACITY) {
6545 sd->flags |= SD_PREFER_SIBLING;
6546 sd->imbalance_pct = 110;
6547 sd->smt_gain = 1178; /* ~15% */
6549 } else if (sd->flags & SD_SHARE_PKG_RESOURCES) {
6550 sd->imbalance_pct = 117;
6551 sd->cache_nice_tries = 1;
6555 } else if (sd->flags & SD_NUMA) {
6556 sd->cache_nice_tries = 2;
6560 sd->flags |= SD_SERIALIZE;
6561 if (sched_domains_numa_distance[tl->numa_level] > RECLAIM_DISTANCE) {
6562 sd->flags &= ~(SD_BALANCE_EXEC |
6569 sd->flags |= SD_PREFER_SIBLING;
6570 sd->cache_nice_tries = 1;
6576 * For all levels sharing cache; connect a sched_domain_shared
6579 if (sd->flags & SD_SHARE_PKG_RESOURCES) {
6580 sd->shared = *per_cpu_ptr(sdd->sds, sd_id);
6581 atomic_inc(&sd->shared->ref);
6582 atomic_set(&sd->shared->nr_busy_cpus, sd_weight);
6591 * Topology list, bottom-up.
6593 static struct sched_domain_topology_level default_topology[] = {
6594 #ifdef CONFIG_SCHED_SMT
6595 { cpu_smt_mask, cpu_smt_flags, SD_INIT_NAME(SMT) },
6597 #ifdef CONFIG_SCHED_MC
6598 { cpu_coregroup_mask, cpu_core_flags, SD_INIT_NAME(MC) },
6600 { cpu_cpu_mask, SD_INIT_NAME(DIE) },
6604 static struct sched_domain_topology_level *sched_domain_topology =
6607 #define for_each_sd_topology(tl) \
6608 for (tl = sched_domain_topology; tl->mask; tl++)
6610 void set_sched_topology(struct sched_domain_topology_level *tl)
6612 if (WARN_ON_ONCE(sched_smp_initialized))
6615 sched_domain_topology = tl;
6620 static const struct cpumask *sd_numa_mask(int cpu)
6622 return sched_domains_numa_masks[sched_domains_curr_level][cpu_to_node(cpu)];
6625 static void sched_numa_warn(const char *str)
6627 static int done = false;
6635 printk(KERN_WARNING "ERROR: %s\n\n", str);
6637 for (i = 0; i < nr_node_ids; i++) {
6638 printk(KERN_WARNING " ");
6639 for (j = 0; j < nr_node_ids; j++)
6640 printk(KERN_CONT "%02d ", node_distance(i,j));
6641 printk(KERN_CONT "\n");
6643 printk(KERN_WARNING "\n");
6646 bool find_numa_distance(int distance)
6650 if (distance == node_distance(0, 0))
6653 for (i = 0; i < sched_domains_numa_levels; i++) {
6654 if (sched_domains_numa_distance[i] == distance)
6662 * A system can have three types of NUMA topology:
6663 * NUMA_DIRECT: all nodes are directly connected, or not a NUMA system
6664 * NUMA_GLUELESS_MESH: some nodes reachable through intermediary nodes
6665 * NUMA_BACKPLANE: nodes can reach other nodes through a backplane
6667 * The difference between a glueless mesh topology and a backplane
6668 * topology lies in whether communication between not directly
6669 * connected nodes goes through intermediary nodes (where programs
6670 * could run), or through backplane controllers. This affects
6671 * placement of programs.
6673 * The type of topology can be discerned with the following tests:
6674 * - If the maximum distance between any nodes is 1 hop, the system
6675 * is directly connected.
6676 * - If for two nodes A and B, located N > 1 hops away from each other,
6677 * there is an intermediary node C, which is < N hops away from both
6678 * nodes A and B, the system is a glueless mesh.
6680 static void init_numa_topology_type(void)
6684 n = sched_max_numa_distance;
6686 if (sched_domains_numa_levels <= 1) {
6687 sched_numa_topology_type = NUMA_DIRECT;
6691 for_each_online_node(a) {
6692 for_each_online_node(b) {
6693 /* Find two nodes furthest removed from each other. */
6694 if (node_distance(a, b) < n)
6697 /* Is there an intermediary node between a and b? */
6698 for_each_online_node(c) {
6699 if (node_distance(a, c) < n &&
6700 node_distance(b, c) < n) {
6701 sched_numa_topology_type =
6707 sched_numa_topology_type = NUMA_BACKPLANE;
6713 static void sched_init_numa(void)
6715 int next_distance, curr_distance = node_distance(0, 0);
6716 struct sched_domain_topology_level *tl;
6720 sched_domains_numa_distance = kzalloc(sizeof(int) * nr_node_ids, GFP_KERNEL);
6721 if (!sched_domains_numa_distance)
6725 * O(nr_nodes^2) deduplicating selection sort -- in order to find the
6726 * unique distances in the node_distance() table.
6728 * Assumes node_distance(0,j) includes all distances in
6729 * node_distance(i,j) in order to avoid cubic time.
6731 next_distance = curr_distance;
6732 for (i = 0; i < nr_node_ids; i++) {
6733 for (j = 0; j < nr_node_ids; j++) {
6734 for (k = 0; k < nr_node_ids; k++) {
6735 int distance = node_distance(i, k);
6737 if (distance > curr_distance &&
6738 (distance < next_distance ||
6739 next_distance == curr_distance))
6740 next_distance = distance;
6743 * While not a strong assumption it would be nice to know
6744 * about cases where if node A is connected to B, B is not
6745 * equally connected to A.
6747 if (sched_debug() && node_distance(k, i) != distance)
6748 sched_numa_warn("Node-distance not symmetric");
6750 if (sched_debug() && i && !find_numa_distance(distance))
6751 sched_numa_warn("Node-0 not representative");
6753 if (next_distance != curr_distance) {
6754 sched_domains_numa_distance[level++] = next_distance;
6755 sched_domains_numa_levels = level;
6756 curr_distance = next_distance;
6761 * In case of sched_debug() we verify the above assumption.
6771 * 'level' contains the number of unique distances, excluding the
6772 * identity distance node_distance(i,i).
6774 * The sched_domains_numa_distance[] array includes the actual distance
6779 * Here, we should temporarily reset sched_domains_numa_levels to 0.
6780 * If it fails to allocate memory for array sched_domains_numa_masks[][],
6781 * the array will contain less then 'level' members. This could be
6782 * dangerous when we use it to iterate array sched_domains_numa_masks[][]
6783 * in other functions.
6785 * We reset it to 'level' at the end of this function.
6787 sched_domains_numa_levels = 0;
6789 sched_domains_numa_masks = kzalloc(sizeof(void *) * level, GFP_KERNEL);
6790 if (!sched_domains_numa_masks)
6794 * Now for each level, construct a mask per node which contains all
6795 * cpus of nodes that are that many hops away from us.
6797 for (i = 0; i < level; i++) {
6798 sched_domains_numa_masks[i] =
6799 kzalloc(nr_node_ids * sizeof(void *), GFP_KERNEL);
6800 if (!sched_domains_numa_masks[i])
6803 for (j = 0; j < nr_node_ids; j++) {
6804 struct cpumask *mask = kzalloc(cpumask_size(), GFP_KERNEL);
6808 sched_domains_numa_masks[i][j] = mask;
6811 if (node_distance(j, k) > sched_domains_numa_distance[i])
6814 cpumask_or(mask, mask, cpumask_of_node(k));
6819 /* Compute default topology size */
6820 for (i = 0; sched_domain_topology[i].mask; i++);
6822 tl = kzalloc((i + level + 1) *
6823 sizeof(struct sched_domain_topology_level), GFP_KERNEL);
6828 * Copy the default topology bits..
6830 for (i = 0; sched_domain_topology[i].mask; i++)
6831 tl[i] = sched_domain_topology[i];
6834 * .. and append 'j' levels of NUMA goodness.
6836 for (j = 0; j < level; i++, j++) {
6837 tl[i] = (struct sched_domain_topology_level){
6838 .mask = sd_numa_mask,
6839 .sd_flags = cpu_numa_flags,
6840 .flags = SDTL_OVERLAP,
6846 sched_domain_topology = tl;
6848 sched_domains_numa_levels = level;
6849 sched_max_numa_distance = sched_domains_numa_distance[level - 1];
6851 init_numa_topology_type();
6854 static void sched_domains_numa_masks_set(unsigned int cpu)
6856 int node = cpu_to_node(cpu);
6859 for (i = 0; i < sched_domains_numa_levels; i++) {
6860 for (j = 0; j < nr_node_ids; j++) {
6861 if (node_distance(j, node) <= sched_domains_numa_distance[i])
6862 cpumask_set_cpu(cpu, sched_domains_numa_masks[i][j]);
6867 static void sched_domains_numa_masks_clear(unsigned int cpu)
6871 for (i = 0; i < sched_domains_numa_levels; i++) {
6872 for (j = 0; j < nr_node_ids; j++)
6873 cpumask_clear_cpu(cpu, sched_domains_numa_masks[i][j]);
6878 static inline void sched_init_numa(void) { }
6879 static void sched_domains_numa_masks_set(unsigned int cpu) { }
6880 static void sched_domains_numa_masks_clear(unsigned int cpu) { }
6881 #endif /* CONFIG_NUMA */
6883 static int __sdt_alloc(const struct cpumask *cpu_map)
6885 struct sched_domain_topology_level *tl;
6888 for_each_sd_topology(tl) {
6889 struct sd_data *sdd = &tl->data;
6891 sdd->sd = alloc_percpu(struct sched_domain *);
6895 sdd->sds = alloc_percpu(struct sched_domain_shared *);
6899 sdd->sg = alloc_percpu(struct sched_group *);
6903 sdd->sgc = alloc_percpu(struct sched_group_capacity *);
6907 for_each_cpu(j, cpu_map) {
6908 struct sched_domain *sd;
6909 struct sched_domain_shared *sds;
6910 struct sched_group *sg;
6911 struct sched_group_capacity *sgc;
6913 sd = kzalloc_node(sizeof(struct sched_domain) + cpumask_size(),
6914 GFP_KERNEL, cpu_to_node(j));
6918 *per_cpu_ptr(sdd->sd, j) = sd;
6920 sds = kzalloc_node(sizeof(struct sched_domain_shared),
6921 GFP_KERNEL, cpu_to_node(j));
6925 *per_cpu_ptr(sdd->sds, j) = sds;
6927 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6928 GFP_KERNEL, cpu_to_node(j));
6934 *per_cpu_ptr(sdd->sg, j) = sg;
6936 sgc = kzalloc_node(sizeof(struct sched_group_capacity) + cpumask_size(),
6937 GFP_KERNEL, cpu_to_node(j));
6941 *per_cpu_ptr(sdd->sgc, j) = sgc;
6948 static void __sdt_free(const struct cpumask *cpu_map)
6950 struct sched_domain_topology_level *tl;
6953 for_each_sd_topology(tl) {
6954 struct sd_data *sdd = &tl->data;
6956 for_each_cpu(j, cpu_map) {
6957 struct sched_domain *sd;
6960 sd = *per_cpu_ptr(sdd->sd, j);
6961 if (sd && (sd->flags & SD_OVERLAP))
6962 free_sched_groups(sd->groups, 0);
6963 kfree(*per_cpu_ptr(sdd->sd, j));
6967 kfree(*per_cpu_ptr(sdd->sds, j));
6969 kfree(*per_cpu_ptr(sdd->sg, j));
6971 kfree(*per_cpu_ptr(sdd->sgc, j));
6973 free_percpu(sdd->sd);
6975 free_percpu(sdd->sds);
6977 free_percpu(sdd->sg);
6979 free_percpu(sdd->sgc);
6984 struct sched_domain *build_sched_domain(struct sched_domain_topology_level *tl,
6985 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6986 struct sched_domain *child, int cpu)
6988 struct sched_domain *sd = sd_init(tl, cpu_map, child, cpu);
6991 sd->level = child->level + 1;
6992 sched_domain_level_max = max(sched_domain_level_max, sd->level);
6995 if (!cpumask_subset(sched_domain_span(child),
6996 sched_domain_span(sd))) {
6997 pr_err("BUG: arch topology borken\n");
6998 #ifdef CONFIG_SCHED_DEBUG
6999 pr_err(" the %s domain not a subset of the %s domain\n",
7000 child->name, sd->name);
7002 /* Fixup, ensure @sd has at least @child cpus. */
7003 cpumask_or(sched_domain_span(sd),
7004 sched_domain_span(sd),
7005 sched_domain_span(child));
7009 set_domain_attribute(sd, attr);
7015 * Build sched domains for a given set of cpus and attach the sched domains
7016 * to the individual cpus
7018 static int build_sched_domains(const struct cpumask *cpu_map,
7019 struct sched_domain_attr *attr)
7021 enum s_alloc alloc_state;
7022 struct sched_domain *sd;
7024 struct rq *rq = NULL;
7025 int i, ret = -ENOMEM;
7027 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
7028 if (alloc_state != sa_rootdomain)
7031 /* Set up domains for cpus specified by the cpu_map. */
7032 for_each_cpu(i, cpu_map) {
7033 struct sched_domain_topology_level *tl;
7036 for_each_sd_topology(tl) {
7037 sd = build_sched_domain(tl, cpu_map, attr, sd, i);
7038 if (tl == sched_domain_topology)
7039 *per_cpu_ptr(d.sd, i) = sd;
7040 if (tl->flags & SDTL_OVERLAP || sched_feat(FORCE_SD_OVERLAP))
7041 sd->flags |= SD_OVERLAP;
7042 if (cpumask_equal(cpu_map, sched_domain_span(sd)))
7047 /* Build the groups for the domains */
7048 for_each_cpu(i, cpu_map) {
7049 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
7050 sd->span_weight = cpumask_weight(sched_domain_span(sd));
7051 if (sd->flags & SD_OVERLAP) {
7052 if (build_overlap_sched_groups(sd, i))
7055 if (build_sched_groups(sd, i))
7061 /* Calculate CPU capacity for physical packages and nodes */
7062 for (i = nr_cpumask_bits-1; i >= 0; i--) {
7063 if (!cpumask_test_cpu(i, cpu_map))
7066 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
7067 claim_allocations(i, sd);
7068 init_sched_groups_capacity(i, sd);
7072 /* Attach the domains */
7074 for_each_cpu(i, cpu_map) {
7076 sd = *per_cpu_ptr(d.sd, i);
7078 /* Use READ_ONCE()/WRITE_ONCE() to avoid load/store tearing: */
7079 if (rq->cpu_capacity_orig > READ_ONCE(d.rd->max_cpu_capacity))
7080 WRITE_ONCE(d.rd->max_cpu_capacity, rq->cpu_capacity_orig);
7082 cpu_attach_domain(sd, d.rd, i);
7086 if (rq && sched_debug_enabled) {
7087 pr_info("span: %*pbl (max cpu_capacity = %lu)\n",
7088 cpumask_pr_args(cpu_map), rq->rd->max_cpu_capacity);
7093 __free_domain_allocs(&d, alloc_state, cpu_map);
7097 static cpumask_var_t *doms_cur; /* current sched domains */
7098 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
7099 static struct sched_domain_attr *dattr_cur;
7100 /* attribues of custom domains in 'doms_cur' */
7103 * Special case: If a kmalloc of a doms_cur partition (array of
7104 * cpumask) fails, then fallback to a single sched domain,
7105 * as determined by the single cpumask fallback_doms.
7107 static cpumask_var_t fallback_doms;
7110 * arch_update_cpu_topology lets virtualized architectures update the
7111 * cpu core maps. It is supposed to return 1 if the topology changed
7112 * or 0 if it stayed the same.
7114 int __weak arch_update_cpu_topology(void)
7119 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
7122 cpumask_var_t *doms;
7124 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
7127 for (i = 0; i < ndoms; i++) {
7128 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
7129 free_sched_domains(doms, i);
7136 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
7139 for (i = 0; i < ndoms; i++)
7140 free_cpumask_var(doms[i]);
7145 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7146 * For now this just excludes isolated cpus, but could be used to
7147 * exclude other special cases in the future.
7149 static int init_sched_domains(const struct cpumask *cpu_map)
7153 arch_update_cpu_topology();
7155 doms_cur = alloc_sched_domains(ndoms_cur);
7157 doms_cur = &fallback_doms;
7158 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
7159 err = build_sched_domains(doms_cur[0], NULL);
7160 register_sched_domain_sysctl();
7166 * Detach sched domains from a group of cpus specified in cpu_map
7167 * These cpus will now be attached to the NULL domain
7169 static void detach_destroy_domains(const struct cpumask *cpu_map)
7174 for_each_cpu(i, cpu_map)
7175 cpu_attach_domain(NULL, &def_root_domain, i);
7179 /* handle null as "default" */
7180 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
7181 struct sched_domain_attr *new, int idx_new)
7183 struct sched_domain_attr tmp;
7190 return !memcmp(cur ? (cur + idx_cur) : &tmp,
7191 new ? (new + idx_new) : &tmp,
7192 sizeof(struct sched_domain_attr));
7196 * Partition sched domains as specified by the 'ndoms_new'
7197 * cpumasks in the array doms_new[] of cpumasks. This compares
7198 * doms_new[] to the current sched domain partitioning, doms_cur[].
7199 * It destroys each deleted domain and builds each new domain.
7201 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
7202 * The masks don't intersect (don't overlap.) We should setup one
7203 * sched domain for each mask. CPUs not in any of the cpumasks will
7204 * not be load balanced. If the same cpumask appears both in the
7205 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7208 * The passed in 'doms_new' should be allocated using
7209 * alloc_sched_domains. This routine takes ownership of it and will
7210 * free_sched_domains it when done with it. If the caller failed the
7211 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
7212 * and partition_sched_domains() will fallback to the single partition
7213 * 'fallback_doms', it also forces the domains to be rebuilt.
7215 * If doms_new == NULL it will be replaced with cpu_online_mask.
7216 * ndoms_new == 0 is a special case for destroying existing domains,
7217 * and it will not create the default domain.
7219 * Call with hotplug lock held
7221 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
7222 struct sched_domain_attr *dattr_new)
7227 mutex_lock(&sched_domains_mutex);
7229 /* always unregister in case we don't destroy any domains */
7230 unregister_sched_domain_sysctl();
7232 /* Let architecture update cpu core mappings. */
7233 new_topology = arch_update_cpu_topology();
7235 n = doms_new ? ndoms_new : 0;
7237 /* Destroy deleted domains */
7238 for (i = 0; i < ndoms_cur; i++) {
7239 for (j = 0; j < n && !new_topology; j++) {
7240 if (cpumask_equal(doms_cur[i], doms_new[j])
7241 && dattrs_equal(dattr_cur, i, dattr_new, j))
7244 /* no match - a current sched domain not in new doms_new[] */
7245 detach_destroy_domains(doms_cur[i]);
7251 if (doms_new == NULL) {
7253 doms_new = &fallback_doms;
7254 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
7255 WARN_ON_ONCE(dattr_new);
7258 /* Build new domains */
7259 for (i = 0; i < ndoms_new; i++) {
7260 for (j = 0; j < n && !new_topology; j++) {
7261 if (cpumask_equal(doms_new[i], doms_cur[j])
7262 && dattrs_equal(dattr_new, i, dattr_cur, j))
7265 /* no match - add a new doms_new */
7266 build_sched_domains(doms_new[i], dattr_new ? dattr_new + i : NULL);
7271 /* Remember the new sched domains */
7272 if (doms_cur != &fallback_doms)
7273 free_sched_domains(doms_cur, ndoms_cur);
7274 kfree(dattr_cur); /* kfree(NULL) is safe */
7275 doms_cur = doms_new;
7276 dattr_cur = dattr_new;
7277 ndoms_cur = ndoms_new;
7279 register_sched_domain_sysctl();
7281 mutex_unlock(&sched_domains_mutex);
7284 static int num_cpus_frozen; /* used to mark begin/end of suspend/resume */
7287 * Update cpusets according to cpu_active mask. If cpusets are
7288 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
7289 * around partition_sched_domains().
7291 * If we come here as part of a suspend/resume, don't touch cpusets because we
7292 * want to restore it back to its original state upon resume anyway.
7294 static void cpuset_cpu_active(void)
7296 if (cpuhp_tasks_frozen) {
7298 * num_cpus_frozen tracks how many CPUs are involved in suspend
7299 * resume sequence. As long as this is not the last online
7300 * operation in the resume sequence, just build a single sched
7301 * domain, ignoring cpusets.
7304 if (likely(num_cpus_frozen)) {
7305 partition_sched_domains(1, NULL, NULL);
7309 * This is the last CPU online operation. So fall through and
7310 * restore the original sched domains by considering the
7311 * cpuset configurations.
7314 cpuset_update_active_cpus(true);
7317 static int cpuset_cpu_inactive(unsigned int cpu)
7319 unsigned long flags;
7324 if (!cpuhp_tasks_frozen) {
7325 rcu_read_lock_sched();
7326 dl_b = dl_bw_of(cpu);
7328 raw_spin_lock_irqsave(&dl_b->lock, flags);
7329 cpus = dl_bw_cpus(cpu);
7330 overflow = __dl_overflow(dl_b, cpus, 0, 0);
7331 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
7333 rcu_read_unlock_sched();
7337 cpuset_update_active_cpus(false);
7340 partition_sched_domains(1, NULL, NULL);
7345 int sched_cpu_activate(unsigned int cpu)
7347 struct rq *rq = cpu_rq(cpu);
7348 unsigned long flags;
7350 set_cpu_active(cpu, true);
7352 if (sched_smp_initialized) {
7353 sched_domains_numa_masks_set(cpu);
7354 cpuset_cpu_active();
7358 * Put the rq online, if not already. This happens:
7360 * 1) In the early boot process, because we build the real domains
7361 * after all cpus have been brought up.
7363 * 2) At runtime, if cpuset_cpu_active() fails to rebuild the
7366 raw_spin_lock_irqsave(&rq->lock, flags);
7368 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
7371 raw_spin_unlock_irqrestore(&rq->lock, flags);
7373 update_max_interval();
7378 int sched_cpu_deactivate(unsigned int cpu)
7382 set_cpu_active(cpu, false);
7384 * We've cleared cpu_active_mask, wait for all preempt-disabled and RCU
7385 * users of this state to go away such that all new such users will
7388 * For CONFIG_PREEMPT we have preemptible RCU and its sync_rcu() might
7389 * not imply sync_sched(), so wait for both.
7391 * Do sync before park smpboot threads to take care the rcu boost case.
7393 if (IS_ENABLED(CONFIG_PREEMPT))
7394 synchronize_rcu_mult(call_rcu, call_rcu_sched);
7398 if (!sched_smp_initialized)
7401 ret = cpuset_cpu_inactive(cpu);
7403 set_cpu_active(cpu, true);
7406 sched_domains_numa_masks_clear(cpu);
7410 static void sched_rq_cpu_starting(unsigned int cpu)
7412 struct rq *rq = cpu_rq(cpu);
7414 rq->calc_load_update = calc_load_update;
7415 update_max_interval();
7418 int sched_cpu_starting(unsigned int cpu)
7420 set_cpu_rq_start_time(cpu);
7421 sched_rq_cpu_starting(cpu);
7425 #ifdef CONFIG_HOTPLUG_CPU
7426 int sched_cpu_dying(unsigned int cpu)
7428 struct rq *rq = cpu_rq(cpu);
7429 unsigned long flags;
7431 /* Handle pending wakeups and then migrate everything off */
7432 sched_ttwu_pending();
7433 raw_spin_lock_irqsave(&rq->lock, flags);
7435 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
7439 BUG_ON(rq->nr_running != 1);
7440 raw_spin_unlock_irqrestore(&rq->lock, flags);
7441 calc_load_migrate(rq);
7442 update_max_interval();
7443 nohz_balance_exit_idle(cpu);
7449 #ifdef CONFIG_SCHED_SMT
7450 DEFINE_STATIC_KEY_FALSE(sched_smt_present);
7452 static void sched_init_smt(void)
7455 * We've enumerated all CPUs and will assume that if any CPU
7456 * has SMT siblings, CPU0 will too.
7458 if (cpumask_weight(cpu_smt_mask(0)) > 1)
7459 static_branch_enable(&sched_smt_present);
7462 static inline void sched_init_smt(void) { }
7465 void __init sched_init_smp(void)
7467 cpumask_var_t non_isolated_cpus;
7469 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
7470 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
7475 * There's no userspace yet to cause hotplug operations; hence all the
7476 * cpu masks are stable and all blatant races in the below code cannot
7479 mutex_lock(&sched_domains_mutex);
7480 init_sched_domains(cpu_active_mask);
7481 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
7482 if (cpumask_empty(non_isolated_cpus))
7483 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
7484 mutex_unlock(&sched_domains_mutex);
7486 /* Move init over to a non-isolated CPU */
7487 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
7489 sched_init_granularity();
7490 free_cpumask_var(non_isolated_cpus);
7492 init_sched_rt_class();
7493 init_sched_dl_class();
7497 sched_smp_initialized = true;
7500 static int __init migration_init(void)
7502 sched_rq_cpu_starting(smp_processor_id());
7505 early_initcall(migration_init);
7508 void __init sched_init_smp(void)
7510 sched_init_granularity();
7512 #endif /* CONFIG_SMP */
7514 int in_sched_functions(unsigned long addr)
7516 return in_lock_functions(addr) ||
7517 (addr >= (unsigned long)__sched_text_start
7518 && addr < (unsigned long)__sched_text_end);
7521 #ifdef CONFIG_CGROUP_SCHED
7523 * Default task group.
7524 * Every task in system belongs to this group at bootup.
7526 struct task_group root_task_group;
7527 LIST_HEAD(task_groups);
7529 /* Cacheline aligned slab cache for task_group */
7530 static struct kmem_cache *task_group_cache __read_mostly;
7533 DECLARE_PER_CPU(cpumask_var_t, load_balance_mask);
7534 DECLARE_PER_CPU(cpumask_var_t, select_idle_mask);
7536 #define WAIT_TABLE_BITS 8
7537 #define WAIT_TABLE_SIZE (1 << WAIT_TABLE_BITS)
7538 static wait_queue_head_t bit_wait_table[WAIT_TABLE_SIZE] __cacheline_aligned;
7540 wait_queue_head_t *bit_waitqueue(void *word, int bit)
7542 const int shift = BITS_PER_LONG == 32 ? 5 : 6;
7543 unsigned long val = (unsigned long)word << shift | bit;
7545 return bit_wait_table + hash_long(val, WAIT_TABLE_BITS);
7547 EXPORT_SYMBOL(bit_waitqueue);
7549 void __init sched_init(void)
7552 unsigned long alloc_size = 0, ptr;
7554 for (i = 0; i < WAIT_TABLE_SIZE; i++)
7555 init_waitqueue_head(bit_wait_table + i);
7557 #ifdef CONFIG_FAIR_GROUP_SCHED
7558 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7560 #ifdef CONFIG_RT_GROUP_SCHED
7561 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7564 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
7566 #ifdef CONFIG_FAIR_GROUP_SCHED
7567 root_task_group.se = (struct sched_entity **)ptr;
7568 ptr += nr_cpu_ids * sizeof(void **);
7570 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
7571 ptr += nr_cpu_ids * sizeof(void **);
7573 #endif /* CONFIG_FAIR_GROUP_SCHED */
7574 #ifdef CONFIG_RT_GROUP_SCHED
7575 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
7576 ptr += nr_cpu_ids * sizeof(void **);
7578 root_task_group.rt_rq = (struct rt_rq **)ptr;
7579 ptr += nr_cpu_ids * sizeof(void **);
7581 #endif /* CONFIG_RT_GROUP_SCHED */
7583 #ifdef CONFIG_CPUMASK_OFFSTACK
7584 for_each_possible_cpu(i) {
7585 per_cpu(load_balance_mask, i) = (cpumask_var_t)kzalloc_node(
7586 cpumask_size(), GFP_KERNEL, cpu_to_node(i));
7587 per_cpu(select_idle_mask, i) = (cpumask_var_t)kzalloc_node(
7588 cpumask_size(), GFP_KERNEL, cpu_to_node(i));
7590 #endif /* CONFIG_CPUMASK_OFFSTACK */
7592 init_rt_bandwidth(&def_rt_bandwidth,
7593 global_rt_period(), global_rt_runtime());
7594 init_dl_bandwidth(&def_dl_bandwidth,
7595 global_rt_period(), global_rt_runtime());
7598 init_defrootdomain();
7601 #ifdef CONFIG_RT_GROUP_SCHED
7602 init_rt_bandwidth(&root_task_group.rt_bandwidth,
7603 global_rt_period(), global_rt_runtime());
7604 #endif /* CONFIG_RT_GROUP_SCHED */
7606 #ifdef CONFIG_CGROUP_SCHED
7607 task_group_cache = KMEM_CACHE(task_group, 0);
7609 list_add(&root_task_group.list, &task_groups);
7610 INIT_LIST_HEAD(&root_task_group.children);
7611 INIT_LIST_HEAD(&root_task_group.siblings);
7612 autogroup_init(&init_task);
7613 #endif /* CONFIG_CGROUP_SCHED */
7615 for_each_possible_cpu(i) {
7619 raw_spin_lock_init(&rq->lock);
7621 rq->calc_load_active = 0;
7622 rq->calc_load_update = jiffies + LOAD_FREQ;
7623 init_cfs_rq(&rq->cfs);
7624 init_rt_rq(&rq->rt);
7625 init_dl_rq(&rq->dl);
7626 #ifdef CONFIG_FAIR_GROUP_SCHED
7627 root_task_group.shares = ROOT_TASK_GROUP_LOAD;
7628 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
7629 rq->tmp_alone_branch = &rq->leaf_cfs_rq_list;
7631 * How much cpu bandwidth does root_task_group get?
7633 * In case of task-groups formed thr' the cgroup filesystem, it
7634 * gets 100% of the cpu resources in the system. This overall
7635 * system cpu resource is divided among the tasks of
7636 * root_task_group and its child task-groups in a fair manner,
7637 * based on each entity's (task or task-group's) weight
7638 * (se->load.weight).
7640 * In other words, if root_task_group has 10 tasks of weight
7641 * 1024) and two child groups A0 and A1 (of weight 1024 each),
7642 * then A0's share of the cpu resource is:
7644 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
7646 * We achieve this by letting root_task_group's tasks sit
7647 * directly in rq->cfs (i.e root_task_group->se[] = NULL).
7649 init_cfs_bandwidth(&root_task_group.cfs_bandwidth);
7650 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL);
7651 #endif /* CONFIG_FAIR_GROUP_SCHED */
7653 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
7654 #ifdef CONFIG_RT_GROUP_SCHED
7655 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL);
7658 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
7659 rq->cpu_load[j] = 0;
7664 rq->cpu_capacity = rq->cpu_capacity_orig = SCHED_CAPACITY_SCALE;
7665 rq->balance_callback = NULL;
7666 rq->active_balance = 0;
7667 rq->next_balance = jiffies;
7672 rq->avg_idle = 2*sysctl_sched_migration_cost;
7673 rq->max_idle_balance_cost = sysctl_sched_migration_cost;
7675 INIT_LIST_HEAD(&rq->cfs_tasks);
7677 rq_attach_root(rq, &def_root_domain);
7678 #ifdef CONFIG_NO_HZ_COMMON
7679 rq->last_load_update_tick = jiffies;
7682 #ifdef CONFIG_NO_HZ_FULL
7683 rq->last_sched_tick = 0;
7685 #endif /* CONFIG_SMP */
7687 atomic_set(&rq->nr_iowait, 0);
7690 set_load_weight(&init_task);
7693 * The boot idle thread does lazy MMU switching as well:
7695 atomic_inc(&init_mm.mm_count);
7696 enter_lazy_tlb(&init_mm, current);
7699 * Make us the idle thread. Technically, schedule() should not be
7700 * called from this thread, however somewhere below it might be,
7701 * but because we are the idle thread, we just pick up running again
7702 * when this runqueue becomes "idle".
7704 init_idle(current, smp_processor_id());
7706 calc_load_update = jiffies + LOAD_FREQ;
7709 zalloc_cpumask_var(&sched_domains_tmpmask, GFP_NOWAIT);
7710 /* May be allocated at isolcpus cmdline parse time */
7711 if (cpu_isolated_map == NULL)
7712 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7713 idle_thread_set_boot_cpu();
7714 set_cpu_rq_start_time(smp_processor_id());
7716 init_sched_fair_class();
7720 scheduler_running = 1;
7723 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
7724 static inline int preempt_count_equals(int preempt_offset)
7726 int nested = preempt_count() + rcu_preempt_depth();
7728 return (nested == preempt_offset);
7731 void __might_sleep(const char *file, int line, int preempt_offset)
7734 * Blocking primitives will set (and therefore destroy) current->state,
7735 * since we will exit with TASK_RUNNING make sure we enter with it,
7736 * otherwise we will destroy state.
7738 WARN_ONCE(current->state != TASK_RUNNING && current->task_state_change,
7739 "do not call blocking ops when !TASK_RUNNING; "
7740 "state=%lx set at [<%p>] %pS\n",
7742 (void *)current->task_state_change,
7743 (void *)current->task_state_change);
7745 ___might_sleep(file, line, preempt_offset);
7747 EXPORT_SYMBOL(__might_sleep);
7749 void ___might_sleep(const char *file, int line, int preempt_offset)
7751 static unsigned long prev_jiffy; /* ratelimiting */
7752 unsigned long preempt_disable_ip;
7754 rcu_sleep_check(); /* WARN_ON_ONCE() by default, no rate limit reqd. */
7755 if ((preempt_count_equals(preempt_offset) && !irqs_disabled() &&
7756 !is_idle_task(current)) ||
7757 system_state != SYSTEM_RUNNING || oops_in_progress)
7759 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7761 prev_jiffy = jiffies;
7763 /* Save this before calling printk(), since that will clobber it */
7764 preempt_disable_ip = get_preempt_disable_ip(current);
7767 "BUG: sleeping function called from invalid context at %s:%d\n",
7770 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7771 in_atomic(), irqs_disabled(),
7772 current->pid, current->comm);
7774 if (task_stack_end_corrupted(current))
7775 printk(KERN_EMERG "Thread overran stack, or stack corrupted\n");
7777 debug_show_held_locks(current);
7778 if (irqs_disabled())
7779 print_irqtrace_events(current);
7780 if (IS_ENABLED(CONFIG_DEBUG_PREEMPT)
7781 && !preempt_count_equals(preempt_offset)) {
7782 pr_err("Preemption disabled at:");
7783 print_ip_sym(preempt_disable_ip);
7787 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
7789 EXPORT_SYMBOL(___might_sleep);
7792 #ifdef CONFIG_MAGIC_SYSRQ
7793 void normalize_rt_tasks(void)
7795 struct task_struct *g, *p;
7796 struct sched_attr attr = {
7797 .sched_policy = SCHED_NORMAL,
7800 read_lock(&tasklist_lock);
7801 for_each_process_thread(g, p) {
7803 * Only normalize user tasks:
7805 if (p->flags & PF_KTHREAD)
7808 p->se.exec_start = 0;
7809 schedstat_set(p->se.statistics.wait_start, 0);
7810 schedstat_set(p->se.statistics.sleep_start, 0);
7811 schedstat_set(p->se.statistics.block_start, 0);
7813 if (!dl_task(p) && !rt_task(p)) {
7815 * Renice negative nice level userspace
7818 if (task_nice(p) < 0)
7819 set_user_nice(p, 0);
7823 __sched_setscheduler(p, &attr, false, false);
7825 read_unlock(&tasklist_lock);
7828 #endif /* CONFIG_MAGIC_SYSRQ */
7830 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
7832 * These functions are only useful for the IA64 MCA handling, or kdb.
7834 * They can only be called when the whole system has been
7835 * stopped - every CPU needs to be quiescent, and no scheduling
7836 * activity can take place. Using them for anything else would
7837 * be a serious bug, and as a result, they aren't even visible
7838 * under any other configuration.
7842 * curr_task - return the current task for a given cpu.
7843 * @cpu: the processor in question.
7845 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7847 * Return: The current task for @cpu.
7849 struct task_struct *curr_task(int cpu)
7851 return cpu_curr(cpu);
7854 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
7858 * set_curr_task - set the current task for a given cpu.
7859 * @cpu: the processor in question.
7860 * @p: the task pointer to set.
7862 * Description: This function must only be used when non-maskable interrupts
7863 * are serviced on a separate stack. It allows the architecture to switch the
7864 * notion of the current task on a cpu in a non-blocking manner. This function
7865 * must be called with all CPU's synchronized, and interrupts disabled, the
7866 * and caller must save the original value of the current task (see
7867 * curr_task() above) and restore that value before reenabling interrupts and
7868 * re-starting the system.
7870 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7872 void ia64_set_curr_task(int cpu, struct task_struct *p)
7879 #ifdef CONFIG_CGROUP_SCHED
7880 /* task_group_lock serializes the addition/removal of task groups */
7881 static DEFINE_SPINLOCK(task_group_lock);
7883 static void sched_free_group(struct task_group *tg)
7885 free_fair_sched_group(tg);
7886 free_rt_sched_group(tg);
7888 kmem_cache_free(task_group_cache, tg);
7891 /* allocate runqueue etc for a new task group */
7892 struct task_group *sched_create_group(struct task_group *parent)
7894 struct task_group *tg;
7896 tg = kmem_cache_alloc(task_group_cache, GFP_KERNEL | __GFP_ZERO);
7898 return ERR_PTR(-ENOMEM);
7900 if (!alloc_fair_sched_group(tg, parent))
7903 if (!alloc_rt_sched_group(tg, parent))
7909 sched_free_group(tg);
7910 return ERR_PTR(-ENOMEM);
7913 void sched_online_group(struct task_group *tg, struct task_group *parent)
7915 unsigned long flags;
7917 spin_lock_irqsave(&task_group_lock, flags);
7918 list_add_rcu(&tg->list, &task_groups);
7920 WARN_ON(!parent); /* root should already exist */
7922 tg->parent = parent;
7923 INIT_LIST_HEAD(&tg->children);
7924 list_add_rcu(&tg->siblings, &parent->children);
7925 spin_unlock_irqrestore(&task_group_lock, flags);
7927 online_fair_sched_group(tg);
7930 /* rcu callback to free various structures associated with a task group */
7931 static void sched_free_group_rcu(struct rcu_head *rhp)
7933 /* now it should be safe to free those cfs_rqs */
7934 sched_free_group(container_of(rhp, struct task_group, rcu));
7937 void sched_destroy_group(struct task_group *tg)
7939 /* wait for possible concurrent references to cfs_rqs complete */
7940 call_rcu(&tg->rcu, sched_free_group_rcu);
7943 void sched_offline_group(struct task_group *tg)
7945 unsigned long flags;
7947 /* end participation in shares distribution */
7948 unregister_fair_sched_group(tg);
7950 spin_lock_irqsave(&task_group_lock, flags);
7951 list_del_rcu(&tg->list);
7952 list_del_rcu(&tg->siblings);
7953 spin_unlock_irqrestore(&task_group_lock, flags);
7956 static void sched_change_group(struct task_struct *tsk, int type)
7958 struct task_group *tg;
7961 * All callers are synchronized by task_rq_lock(); we do not use RCU
7962 * which is pointless here. Thus, we pass "true" to task_css_check()
7963 * to prevent lockdep warnings.
7965 tg = container_of(task_css_check(tsk, cpu_cgrp_id, true),
7966 struct task_group, css);
7967 tg = autogroup_task_group(tsk, tg);
7968 tsk->sched_task_group = tg;
7970 #ifdef CONFIG_FAIR_GROUP_SCHED
7971 if (tsk->sched_class->task_change_group)
7972 tsk->sched_class->task_change_group(tsk, type);
7975 set_task_rq(tsk, task_cpu(tsk));
7979 * Change task's runqueue when it moves between groups.
7981 * The caller of this function should have put the task in its new group by
7982 * now. This function just updates tsk->se.cfs_rq and tsk->se.parent to reflect
7985 void sched_move_task(struct task_struct *tsk)
7987 int queued, running;
7991 rq = task_rq_lock(tsk, &rf);
7993 running = task_current(rq, tsk);
7994 queued = task_on_rq_queued(tsk);
7997 dequeue_task(rq, tsk, DEQUEUE_SAVE | DEQUEUE_MOVE);
7998 if (unlikely(running))
7999 put_prev_task(rq, tsk);
8001 sched_change_group(tsk, TASK_MOVE_GROUP);
8004 enqueue_task(rq, tsk, ENQUEUE_RESTORE | ENQUEUE_MOVE);
8005 if (unlikely(running))
8006 set_curr_task(rq, tsk);
8008 task_rq_unlock(rq, tsk, &rf);
8010 #endif /* CONFIG_CGROUP_SCHED */
8012 #ifdef CONFIG_RT_GROUP_SCHED
8014 * Ensure that the real time constraints are schedulable.
8016 static DEFINE_MUTEX(rt_constraints_mutex);
8018 /* Must be called with tasklist_lock held */
8019 static inline int tg_has_rt_tasks(struct task_group *tg)
8021 struct task_struct *g, *p;
8024 * Autogroups do not have RT tasks; see autogroup_create().
8026 if (task_group_is_autogroup(tg))
8029 for_each_process_thread(g, p) {
8030 if (rt_task(p) && task_group(p) == tg)
8037 struct rt_schedulable_data {
8038 struct task_group *tg;
8043 static int tg_rt_schedulable(struct task_group *tg, void *data)
8045 struct rt_schedulable_data *d = data;
8046 struct task_group *child;
8047 unsigned long total, sum = 0;
8048 u64 period, runtime;
8050 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8051 runtime = tg->rt_bandwidth.rt_runtime;
8054 period = d->rt_period;
8055 runtime = d->rt_runtime;
8059 * Cannot have more runtime than the period.
8061 if (runtime > period && runtime != RUNTIME_INF)
8065 * Ensure we don't starve existing RT tasks.
8067 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
8070 total = to_ratio(period, runtime);
8073 * Nobody can have more than the global setting allows.
8075 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
8079 * The sum of our children's runtime should not exceed our own.
8081 list_for_each_entry_rcu(child, &tg->children, siblings) {
8082 period = ktime_to_ns(child->rt_bandwidth.rt_period);
8083 runtime = child->rt_bandwidth.rt_runtime;
8085 if (child == d->tg) {
8086 period = d->rt_period;
8087 runtime = d->rt_runtime;
8090 sum += to_ratio(period, runtime);
8099 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
8103 struct rt_schedulable_data data = {
8105 .rt_period = period,
8106 .rt_runtime = runtime,
8110 ret = walk_tg_tree(tg_rt_schedulable, tg_nop, &data);
8116 static int tg_set_rt_bandwidth(struct task_group *tg,
8117 u64 rt_period, u64 rt_runtime)
8122 * Disallowing the root group RT runtime is BAD, it would disallow the
8123 * kernel creating (and or operating) RT threads.
8125 if (tg == &root_task_group && rt_runtime == 0)
8128 /* No period doesn't make any sense. */
8132 mutex_lock(&rt_constraints_mutex);
8133 read_lock(&tasklist_lock);
8134 err = __rt_schedulable(tg, rt_period, rt_runtime);
8138 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8139 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
8140 tg->rt_bandwidth.rt_runtime = rt_runtime;
8142 for_each_possible_cpu(i) {
8143 struct rt_rq *rt_rq = tg->rt_rq[i];
8145 raw_spin_lock(&rt_rq->rt_runtime_lock);
8146 rt_rq->rt_runtime = rt_runtime;
8147 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8149 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8151 read_unlock(&tasklist_lock);
8152 mutex_unlock(&rt_constraints_mutex);
8157 static int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
8159 u64 rt_runtime, rt_period;
8161 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8162 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
8163 if (rt_runtime_us < 0)
8164 rt_runtime = RUNTIME_INF;
8166 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
8169 static long sched_group_rt_runtime(struct task_group *tg)
8173 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
8176 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
8177 do_div(rt_runtime_us, NSEC_PER_USEC);
8178 return rt_runtime_us;
8181 static int sched_group_set_rt_period(struct task_group *tg, u64 rt_period_us)
8183 u64 rt_runtime, rt_period;
8185 rt_period = rt_period_us * NSEC_PER_USEC;
8186 rt_runtime = tg->rt_bandwidth.rt_runtime;
8188 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
8191 static long sched_group_rt_period(struct task_group *tg)
8195 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
8196 do_div(rt_period_us, NSEC_PER_USEC);
8197 return rt_period_us;
8199 #endif /* CONFIG_RT_GROUP_SCHED */
8201 #ifdef CONFIG_RT_GROUP_SCHED
8202 static int sched_rt_global_constraints(void)
8206 mutex_lock(&rt_constraints_mutex);
8207 read_lock(&tasklist_lock);
8208 ret = __rt_schedulable(NULL, 0, 0);
8209 read_unlock(&tasklist_lock);
8210 mutex_unlock(&rt_constraints_mutex);
8215 static int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
8217 /* Don't accept realtime tasks when there is no way for them to run */
8218 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
8224 #else /* !CONFIG_RT_GROUP_SCHED */
8225 static int sched_rt_global_constraints(void)
8227 unsigned long flags;
8230 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
8231 for_each_possible_cpu(i) {
8232 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
8234 raw_spin_lock(&rt_rq->rt_runtime_lock);
8235 rt_rq->rt_runtime = global_rt_runtime();
8236 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8238 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
8242 #endif /* CONFIG_RT_GROUP_SCHED */
8244 static int sched_dl_global_validate(void)
8246 u64 runtime = global_rt_runtime();
8247 u64 period = global_rt_period();
8248 u64 new_bw = to_ratio(period, runtime);
8251 unsigned long flags;
8254 * Here we want to check the bandwidth not being set to some
8255 * value smaller than the currently allocated bandwidth in
8256 * any of the root_domains.
8258 * FIXME: Cycling on all the CPUs is overdoing, but simpler than
8259 * cycling on root_domains... Discussion on different/better
8260 * solutions is welcome!
8262 for_each_possible_cpu(cpu) {
8263 rcu_read_lock_sched();
8264 dl_b = dl_bw_of(cpu);
8266 raw_spin_lock_irqsave(&dl_b->lock, flags);
8267 if (new_bw < dl_b->total_bw)
8269 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
8271 rcu_read_unlock_sched();
8280 static void sched_dl_do_global(void)
8285 unsigned long flags;
8287 def_dl_bandwidth.dl_period = global_rt_period();
8288 def_dl_bandwidth.dl_runtime = global_rt_runtime();
8290 if (global_rt_runtime() != RUNTIME_INF)
8291 new_bw = to_ratio(global_rt_period(), global_rt_runtime());
8294 * FIXME: As above...
8296 for_each_possible_cpu(cpu) {
8297 rcu_read_lock_sched();
8298 dl_b = dl_bw_of(cpu);
8300 raw_spin_lock_irqsave(&dl_b->lock, flags);
8302 raw_spin_unlock_irqrestore(&dl_b->lock, flags);
8304 rcu_read_unlock_sched();
8308 static int sched_rt_global_validate(void)
8310 if (sysctl_sched_rt_period <= 0)
8313 if ((sysctl_sched_rt_runtime != RUNTIME_INF) &&
8314 (sysctl_sched_rt_runtime > sysctl_sched_rt_period))
8320 static void sched_rt_do_global(void)
8322 def_rt_bandwidth.rt_runtime = global_rt_runtime();
8323 def_rt_bandwidth.rt_period = ns_to_ktime(global_rt_period());
8326 int sched_rt_handler(struct ctl_table *table, int write,
8327 void __user *buffer, size_t *lenp,
8330 int old_period, old_runtime;
8331 static DEFINE_MUTEX(mutex);
8335 old_period = sysctl_sched_rt_period;
8336 old_runtime = sysctl_sched_rt_runtime;
8338 ret = proc_dointvec(table, write, buffer, lenp, ppos);
8340 if (!ret && write) {
8341 ret = sched_rt_global_validate();
8345 ret = sched_dl_global_validate();
8349 ret = sched_rt_global_constraints();
8353 sched_rt_do_global();
8354 sched_dl_do_global();
8358 sysctl_sched_rt_period = old_period;
8359 sysctl_sched_rt_runtime = old_runtime;
8361 mutex_unlock(&mutex);
8366 int sched_rr_handler(struct ctl_table *table, int write,
8367 void __user *buffer, size_t *lenp,
8371 static DEFINE_MUTEX(mutex);
8374 ret = proc_dointvec(table, write, buffer, lenp, ppos);
8375 /* make sure that internally we keep jiffies */
8376 /* also, writing zero resets timeslice to default */
8377 if (!ret && write) {
8378 sched_rr_timeslice = sched_rr_timeslice <= 0 ?
8379 RR_TIMESLICE : msecs_to_jiffies(sched_rr_timeslice);
8381 mutex_unlock(&mutex);
8385 #ifdef CONFIG_CGROUP_SCHED
8387 static inline struct task_group *css_tg(struct cgroup_subsys_state *css)
8389 return css ? container_of(css, struct task_group, css) : NULL;
8392 static struct cgroup_subsys_state *
8393 cpu_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
8395 struct task_group *parent = css_tg(parent_css);
8396 struct task_group *tg;
8399 /* This is early initialization for the top cgroup */
8400 return &root_task_group.css;
8403 tg = sched_create_group(parent);
8405 return ERR_PTR(-ENOMEM);
8407 sched_online_group(tg, parent);
8412 static void cpu_cgroup_css_released(struct cgroup_subsys_state *css)
8414 struct task_group *tg = css_tg(css);
8416 sched_offline_group(tg);
8419 static void cpu_cgroup_css_free(struct cgroup_subsys_state *css)
8421 struct task_group *tg = css_tg(css);
8424 * Relies on the RCU grace period between css_released() and this.
8426 sched_free_group(tg);
8430 * This is called before wake_up_new_task(), therefore we really only
8431 * have to set its group bits, all the other stuff does not apply.
8433 static void cpu_cgroup_fork(struct task_struct *task)
8438 rq = task_rq_lock(task, &rf);
8440 update_rq_clock(rq);
8441 sched_change_group(task, TASK_SET_GROUP);
8443 task_rq_unlock(rq, task, &rf);
8446 static int cpu_cgroup_can_attach(struct cgroup_taskset *tset)
8448 struct task_struct *task;
8449 struct cgroup_subsys_state *css;
8452 cgroup_taskset_for_each(task, css, tset) {
8453 #ifdef CONFIG_RT_GROUP_SCHED
8454 if (!sched_rt_can_attach(css_tg(css), task))
8457 /* We don't support RT-tasks being in separate groups */
8458 if (task->sched_class != &fair_sched_class)
8462 * Serialize against wake_up_new_task() such that if its
8463 * running, we're sure to observe its full state.
8465 raw_spin_lock_irq(&task->pi_lock);
8467 * Avoid calling sched_move_task() before wake_up_new_task()
8468 * has happened. This would lead to problems with PELT, due to
8469 * move wanting to detach+attach while we're not attached yet.
8471 if (task->state == TASK_NEW)
8473 raw_spin_unlock_irq(&task->pi_lock);
8481 static void cpu_cgroup_attach(struct cgroup_taskset *tset)
8483 struct task_struct *task;
8484 struct cgroup_subsys_state *css;
8486 cgroup_taskset_for_each(task, css, tset)
8487 sched_move_task(task);
8490 #ifdef CONFIG_FAIR_GROUP_SCHED
8491 static int cpu_shares_write_u64(struct cgroup_subsys_state *css,
8492 struct cftype *cftype, u64 shareval)
8494 return sched_group_set_shares(css_tg(css), scale_load(shareval));
8497 static u64 cpu_shares_read_u64(struct cgroup_subsys_state *css,
8500 struct task_group *tg = css_tg(css);
8502 return (u64) scale_load_down(tg->shares);
8505 #ifdef CONFIG_CFS_BANDWIDTH
8506 static DEFINE_MUTEX(cfs_constraints_mutex);
8508 const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */
8509 const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */
8511 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime);
8513 static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota)
8515 int i, ret = 0, runtime_enabled, runtime_was_enabled;
8516 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
8518 if (tg == &root_task_group)
8522 * Ensure we have at some amount of bandwidth every period. This is
8523 * to prevent reaching a state of large arrears when throttled via
8524 * entity_tick() resulting in prolonged exit starvation.
8526 if (quota < min_cfs_quota_period || period < min_cfs_quota_period)
8530 * Likewise, bound things on the otherside by preventing insane quota
8531 * periods. This also allows us to normalize in computing quota
8534 if (period > max_cfs_quota_period)
8538 * Prevent race between setting of cfs_rq->runtime_enabled and
8539 * unthrottle_offline_cfs_rqs().
8542 mutex_lock(&cfs_constraints_mutex);
8543 ret = __cfs_schedulable(tg, period, quota);
8547 runtime_enabled = quota != RUNTIME_INF;
8548 runtime_was_enabled = cfs_b->quota != RUNTIME_INF;
8550 * If we need to toggle cfs_bandwidth_used, off->on must occur
8551 * before making related changes, and on->off must occur afterwards
8553 if (runtime_enabled && !runtime_was_enabled)
8554 cfs_bandwidth_usage_inc();
8555 raw_spin_lock_irq(&cfs_b->lock);
8556 cfs_b->period = ns_to_ktime(period);
8557 cfs_b->quota = quota;
8559 __refill_cfs_bandwidth_runtime(cfs_b);
8560 /* restart the period timer (if active) to handle new period expiry */
8561 if (runtime_enabled)
8562 start_cfs_bandwidth(cfs_b);
8563 raw_spin_unlock_irq(&cfs_b->lock);
8565 for_each_online_cpu(i) {
8566 struct cfs_rq *cfs_rq = tg->cfs_rq[i];
8567 struct rq *rq = cfs_rq->rq;
8569 raw_spin_lock_irq(&rq->lock);
8570 cfs_rq->runtime_enabled = runtime_enabled;
8571 cfs_rq->runtime_remaining = 0;
8573 if (cfs_rq->throttled)
8574 unthrottle_cfs_rq(cfs_rq);
8575 raw_spin_unlock_irq(&rq->lock);
8577 if (runtime_was_enabled && !runtime_enabled)
8578 cfs_bandwidth_usage_dec();
8580 mutex_unlock(&cfs_constraints_mutex);
8586 int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us)
8590 period = ktime_to_ns(tg->cfs_bandwidth.period);
8591 if (cfs_quota_us < 0)
8592 quota = RUNTIME_INF;
8594 quota = (u64)cfs_quota_us * NSEC_PER_USEC;
8596 return tg_set_cfs_bandwidth(tg, period, quota);
8599 long tg_get_cfs_quota(struct task_group *tg)
8603 if (tg->cfs_bandwidth.quota == RUNTIME_INF)
8606 quota_us = tg->cfs_bandwidth.quota;
8607 do_div(quota_us, NSEC_PER_USEC);
8612 int tg_set_cfs_period(struct task_group *tg, long cfs_period_us)
8616 period = (u64)cfs_period_us * NSEC_PER_USEC;
8617 quota = tg->cfs_bandwidth.quota;
8619 return tg_set_cfs_bandwidth(tg, period, quota);
8622 long tg_get_cfs_period(struct task_group *tg)
8626 cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period);
8627 do_div(cfs_period_us, NSEC_PER_USEC);
8629 return cfs_period_us;
8632 static s64 cpu_cfs_quota_read_s64(struct cgroup_subsys_state *css,
8635 return tg_get_cfs_quota(css_tg(css));
8638 static int cpu_cfs_quota_write_s64(struct cgroup_subsys_state *css,
8639 struct cftype *cftype, s64 cfs_quota_us)
8641 return tg_set_cfs_quota(css_tg(css), cfs_quota_us);
8644 static u64 cpu_cfs_period_read_u64(struct cgroup_subsys_state *css,
8647 return tg_get_cfs_period(css_tg(css));
8650 static int cpu_cfs_period_write_u64(struct cgroup_subsys_state *css,
8651 struct cftype *cftype, u64 cfs_period_us)
8653 return tg_set_cfs_period(css_tg(css), cfs_period_us);
8656 struct cfs_schedulable_data {
8657 struct task_group *tg;
8662 * normalize group quota/period to be quota/max_period
8663 * note: units are usecs
8665 static u64 normalize_cfs_quota(struct task_group *tg,
8666 struct cfs_schedulable_data *d)
8674 period = tg_get_cfs_period(tg);
8675 quota = tg_get_cfs_quota(tg);
8678 /* note: these should typically be equivalent */
8679 if (quota == RUNTIME_INF || quota == -1)
8682 return to_ratio(period, quota);
8685 static int tg_cfs_schedulable_down(struct task_group *tg, void *data)
8687 struct cfs_schedulable_data *d = data;
8688 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
8689 s64 quota = 0, parent_quota = -1;
8692 quota = RUNTIME_INF;
8694 struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth;
8696 quota = normalize_cfs_quota(tg, d);
8697 parent_quota = parent_b->hierarchical_quota;
8700 * ensure max(child_quota) <= parent_quota, inherit when no
8703 if (quota == RUNTIME_INF)
8704 quota = parent_quota;
8705 else if (parent_quota != RUNTIME_INF && quota > parent_quota)
8708 cfs_b->hierarchical_quota = quota;
8713 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota)
8716 struct cfs_schedulable_data data = {
8722 if (quota != RUNTIME_INF) {
8723 do_div(data.period, NSEC_PER_USEC);
8724 do_div(data.quota, NSEC_PER_USEC);
8728 ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data);
8734 static int cpu_stats_show(struct seq_file *sf, void *v)
8736 struct task_group *tg = css_tg(seq_css(sf));
8737 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
8739 seq_printf(sf, "nr_periods %d\n", cfs_b->nr_periods);
8740 seq_printf(sf, "nr_throttled %d\n", cfs_b->nr_throttled);
8741 seq_printf(sf, "throttled_time %llu\n", cfs_b->throttled_time);
8745 #endif /* CONFIG_CFS_BANDWIDTH */
8746 #endif /* CONFIG_FAIR_GROUP_SCHED */
8748 #ifdef CONFIG_RT_GROUP_SCHED
8749 static int cpu_rt_runtime_write(struct cgroup_subsys_state *css,
8750 struct cftype *cft, s64 val)
8752 return sched_group_set_rt_runtime(css_tg(css), val);
8755 static s64 cpu_rt_runtime_read(struct cgroup_subsys_state *css,
8758 return sched_group_rt_runtime(css_tg(css));
8761 static int cpu_rt_period_write_uint(struct cgroup_subsys_state *css,
8762 struct cftype *cftype, u64 rt_period_us)
8764 return sched_group_set_rt_period(css_tg(css), rt_period_us);
8767 static u64 cpu_rt_period_read_uint(struct cgroup_subsys_state *css,
8770 return sched_group_rt_period(css_tg(css));
8772 #endif /* CONFIG_RT_GROUP_SCHED */
8774 static struct cftype cpu_files[] = {
8775 #ifdef CONFIG_FAIR_GROUP_SCHED
8778 .read_u64 = cpu_shares_read_u64,
8779 .write_u64 = cpu_shares_write_u64,
8782 #ifdef CONFIG_CFS_BANDWIDTH
8784 .name = "cfs_quota_us",
8785 .read_s64 = cpu_cfs_quota_read_s64,
8786 .write_s64 = cpu_cfs_quota_write_s64,
8789 .name = "cfs_period_us",
8790 .read_u64 = cpu_cfs_period_read_u64,
8791 .write_u64 = cpu_cfs_period_write_u64,
8795 .seq_show = cpu_stats_show,
8798 #ifdef CONFIG_RT_GROUP_SCHED
8800 .name = "rt_runtime_us",
8801 .read_s64 = cpu_rt_runtime_read,
8802 .write_s64 = cpu_rt_runtime_write,
8805 .name = "rt_period_us",
8806 .read_u64 = cpu_rt_period_read_uint,
8807 .write_u64 = cpu_rt_period_write_uint,
8813 struct cgroup_subsys cpu_cgrp_subsys = {
8814 .css_alloc = cpu_cgroup_css_alloc,
8815 .css_released = cpu_cgroup_css_released,
8816 .css_free = cpu_cgroup_css_free,
8817 .fork = cpu_cgroup_fork,
8818 .can_attach = cpu_cgroup_can_attach,
8819 .attach = cpu_cgroup_attach,
8820 .legacy_cftypes = cpu_files,
8824 #endif /* CONFIG_CGROUP_SCHED */
8826 void dump_cpu_task(int cpu)
8828 pr_info("Task dump for CPU %d:\n", cpu);
8829 sched_show_task(cpu_curr(cpu));
8833 * Nice levels are multiplicative, with a gentle 10% change for every
8834 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
8835 * nice 1, it will get ~10% less CPU time than another CPU-bound task
8836 * that remained on nice 0.
8838 * The "10% effect" is relative and cumulative: from _any_ nice level,
8839 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
8840 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
8841 * If a task goes up by ~10% and another task goes down by ~10% then
8842 * the relative distance between them is ~25%.)
8844 const int sched_prio_to_weight[40] = {
8845 /* -20 */ 88761, 71755, 56483, 46273, 36291,
8846 /* -15 */ 29154, 23254, 18705, 14949, 11916,
8847 /* -10 */ 9548, 7620, 6100, 4904, 3906,
8848 /* -5 */ 3121, 2501, 1991, 1586, 1277,
8849 /* 0 */ 1024, 820, 655, 526, 423,
8850 /* 5 */ 335, 272, 215, 172, 137,
8851 /* 10 */ 110, 87, 70, 56, 45,
8852 /* 15 */ 36, 29, 23, 18, 15,
8856 * Inverse (2^32/x) values of the sched_prio_to_weight[] array, precalculated.
8858 * In cases where the weight does not change often, we can use the
8859 * precalculated inverse to speed up arithmetics by turning divisions
8860 * into multiplications:
8862 const u32 sched_prio_to_wmult[40] = {
8863 /* -20 */ 48388, 59856, 76040, 92818, 118348,
8864 /* -15 */ 147320, 184698, 229616, 287308, 360437,
8865 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
8866 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
8867 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
8868 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
8869 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
8870 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,