1 // SPDX-License-Identifier: GPL-2.0-only
5 * Core kernel scheduler code and related syscalls
7 * Copyright (C) 1991-2002 Linus Torvalds
9 #define CREATE_TRACE_POINTS
10 #include <trace/events/sched.h>
11 #undef CREATE_TRACE_POINTS
15 #include <linux/nospec.h>
17 #include <linux/kcov.h>
18 #include <linux/scs.h>
20 #include <asm/switch_to.h>
23 #include "../workqueue_internal.h"
24 #include "../../fs/io-wq.h"
25 #include "../smpboot.h"
31 * Export tracepoints that act as a bare tracehook (ie: have no trace event
32 * associated with them) to allow external modules to probe them.
34 EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_cfs_tp);
35 EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_rt_tp);
36 EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_dl_tp);
37 EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_irq_tp);
38 EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_se_tp);
39 EXPORT_TRACEPOINT_SYMBOL_GPL(sched_cpu_capacity_tp);
40 EXPORT_TRACEPOINT_SYMBOL_GPL(sched_overutilized_tp);
41 EXPORT_TRACEPOINT_SYMBOL_GPL(sched_util_est_cfs_tp);
42 EXPORT_TRACEPOINT_SYMBOL_GPL(sched_util_est_se_tp);
43 EXPORT_TRACEPOINT_SYMBOL_GPL(sched_update_nr_running_tp);
45 DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
47 #ifdef CONFIG_SCHED_DEBUG
49 * Debugging: various feature bits
51 * If SCHED_DEBUG is disabled, each compilation unit has its own copy of
52 * sysctl_sched_features, defined in sched.h, to allow constants propagation
53 * at compile time and compiler optimization based on features default.
55 #define SCHED_FEAT(name, enabled) \
56 (1UL << __SCHED_FEAT_##name) * enabled |
57 const_debug unsigned int sysctl_sched_features =
63 * Print a warning if need_resched is set for the given duration (if
64 * LATENCY_WARN is enabled).
66 * If sysctl_resched_latency_warn_once is set, only one warning will be shown
69 __read_mostly int sysctl_resched_latency_warn_ms = 100;
70 __read_mostly int sysctl_resched_latency_warn_once = 1;
71 #endif /* CONFIG_SCHED_DEBUG */
74 * Number of tasks to iterate in a single balance run.
75 * Limited because this is done with IRQs disabled.
77 const_debug unsigned int sysctl_sched_nr_migrate = 32;
80 * period over which we measure -rt task CPU usage in us.
83 unsigned int sysctl_sched_rt_period = 1000000;
85 __read_mostly int scheduler_running;
87 #ifdef CONFIG_SCHED_CORE
89 DEFINE_STATIC_KEY_FALSE(__sched_core_enabled);
91 /* kernel prio, less is more */
92 static inline int __task_prio(struct task_struct *p)
94 if (p->sched_class == &stop_sched_class) /* trumps deadline */
97 if (rt_prio(p->prio)) /* includes deadline */
98 return p->prio; /* [-1, 99] */
100 if (p->sched_class == &idle_sched_class)
101 return MAX_RT_PRIO + NICE_WIDTH; /* 140 */
103 return MAX_RT_PRIO + MAX_NICE; /* 120, squash fair */
113 /* real prio, less is less */
114 static inline bool prio_less(struct task_struct *a, struct task_struct *b, bool in_fi)
117 int pa = __task_prio(a), pb = __task_prio(b);
125 if (pa == -1) /* dl_prio() doesn't work because of stop_class above */
126 return !dl_time_before(a->dl.deadline, b->dl.deadline);
128 if (pa == MAX_RT_PRIO + MAX_NICE) /* fair */
129 return cfs_prio_less(a, b, in_fi);
134 static inline bool __sched_core_less(struct task_struct *a, struct task_struct *b)
136 if (a->core_cookie < b->core_cookie)
139 if (a->core_cookie > b->core_cookie)
142 /* flip prio, so high prio is leftmost */
143 if (prio_less(b, a, task_rq(a)->core->core_forceidle))
149 #define __node_2_sc(node) rb_entry((node), struct task_struct, core_node)
151 static inline bool rb_sched_core_less(struct rb_node *a, const struct rb_node *b)
153 return __sched_core_less(__node_2_sc(a), __node_2_sc(b));
156 static inline int rb_sched_core_cmp(const void *key, const struct rb_node *node)
158 const struct task_struct *p = __node_2_sc(node);
159 unsigned long cookie = (unsigned long)key;
161 if (cookie < p->core_cookie)
164 if (cookie > p->core_cookie)
170 void sched_core_enqueue(struct rq *rq, struct task_struct *p)
172 rq->core->core_task_seq++;
177 rb_add(&p->core_node, &rq->core_tree, rb_sched_core_less);
180 void sched_core_dequeue(struct rq *rq, struct task_struct *p)
182 rq->core->core_task_seq++;
184 if (!sched_core_enqueued(p))
187 rb_erase(&p->core_node, &rq->core_tree);
188 RB_CLEAR_NODE(&p->core_node);
192 * Find left-most (aka, highest priority) task matching @cookie.
194 static struct task_struct *sched_core_find(struct rq *rq, unsigned long cookie)
196 struct rb_node *node;
198 node = rb_find_first((void *)cookie, &rq->core_tree, rb_sched_core_cmp);
200 * The idle task always matches any cookie!
203 return idle_sched_class.pick_task(rq);
205 return __node_2_sc(node);
208 static struct task_struct *sched_core_next(struct task_struct *p, unsigned long cookie)
210 struct rb_node *node = &p->core_node;
212 node = rb_next(node);
216 p = container_of(node, struct task_struct, core_node);
217 if (p->core_cookie != cookie)
224 * Magic required such that:
226 * raw_spin_rq_lock(rq);
228 * raw_spin_rq_unlock(rq);
230 * ends up locking and unlocking the _same_ lock, and all CPUs
231 * always agree on what rq has what lock.
233 * XXX entirely possible to selectively enable cores, don't bother for now.
236 static DEFINE_MUTEX(sched_core_mutex);
237 static atomic_t sched_core_count;
238 static struct cpumask sched_core_mask;
240 static void __sched_core_flip(bool enabled)
247 * Toggle the online cores, one by one.
249 cpumask_copy(&sched_core_mask, cpu_online_mask);
250 for_each_cpu(cpu, &sched_core_mask) {
251 const struct cpumask *smt_mask = cpu_smt_mask(cpu);
255 for_each_cpu(t, smt_mask) {
256 /* supports up to SMT8 */
257 raw_spin_lock_nested(&cpu_rq(t)->__lock, i++);
260 for_each_cpu(t, smt_mask)
261 cpu_rq(t)->core_enabled = enabled;
263 for_each_cpu(t, smt_mask)
264 raw_spin_unlock(&cpu_rq(t)->__lock);
267 cpumask_andnot(&sched_core_mask, &sched_core_mask, smt_mask);
271 * Toggle the offline CPUs.
273 cpumask_copy(&sched_core_mask, cpu_possible_mask);
274 cpumask_andnot(&sched_core_mask, &sched_core_mask, cpu_online_mask);
276 for_each_cpu(cpu, &sched_core_mask)
277 cpu_rq(cpu)->core_enabled = enabled;
282 static void sched_core_assert_empty(void)
286 for_each_possible_cpu(cpu)
287 WARN_ON_ONCE(!RB_EMPTY_ROOT(&cpu_rq(cpu)->core_tree));
290 static void __sched_core_enable(void)
292 static_branch_enable(&__sched_core_enabled);
294 * Ensure all previous instances of raw_spin_rq_*lock() have finished
295 * and future ones will observe !sched_core_disabled().
298 __sched_core_flip(true);
299 sched_core_assert_empty();
302 static void __sched_core_disable(void)
304 sched_core_assert_empty();
305 __sched_core_flip(false);
306 static_branch_disable(&__sched_core_enabled);
309 void sched_core_get(void)
311 if (atomic_inc_not_zero(&sched_core_count))
314 mutex_lock(&sched_core_mutex);
315 if (!atomic_read(&sched_core_count))
316 __sched_core_enable();
318 smp_mb__before_atomic();
319 atomic_inc(&sched_core_count);
320 mutex_unlock(&sched_core_mutex);
323 static void __sched_core_put(struct work_struct *work)
325 if (atomic_dec_and_mutex_lock(&sched_core_count, &sched_core_mutex)) {
326 __sched_core_disable();
327 mutex_unlock(&sched_core_mutex);
331 void sched_core_put(void)
333 static DECLARE_WORK(_work, __sched_core_put);
336 * "There can be only one"
338 * Either this is the last one, or we don't actually need to do any
339 * 'work'. If it is the last *again*, we rely on
340 * WORK_STRUCT_PENDING_BIT.
342 if (!atomic_add_unless(&sched_core_count, -1, 1))
343 schedule_work(&_work);
346 #else /* !CONFIG_SCHED_CORE */
348 static inline void sched_core_enqueue(struct rq *rq, struct task_struct *p) { }
349 static inline void sched_core_dequeue(struct rq *rq, struct task_struct *p) { }
351 #endif /* CONFIG_SCHED_CORE */
354 * part of the period that we allow rt tasks to run in us.
357 int sysctl_sched_rt_runtime = 950000;
361 * Serialization rules:
367 * hrtimer_cpu_base->lock (hrtimer_start() for bandwidth controls)
370 * rq2->lock where: rq1 < rq2
374 * Normal scheduling state is serialized by rq->lock. __schedule() takes the
375 * local CPU's rq->lock, it optionally removes the task from the runqueue and
376 * always looks at the local rq data structures to find the most eligible task
379 * Task enqueue is also under rq->lock, possibly taken from another CPU.
380 * Wakeups from another LLC domain might use an IPI to transfer the enqueue to
381 * the local CPU to avoid bouncing the runqueue state around [ see
382 * ttwu_queue_wakelist() ]
384 * Task wakeup, specifically wakeups that involve migration, are horribly
385 * complicated to avoid having to take two rq->locks.
389 * System-calls and anything external will use task_rq_lock() which acquires
390 * both p->pi_lock and rq->lock. As a consequence the state they change is
391 * stable while holding either lock:
393 * - sched_setaffinity()/
394 * set_cpus_allowed_ptr(): p->cpus_ptr, p->nr_cpus_allowed
395 * - set_user_nice(): p->se.load, p->*prio
396 * - __sched_setscheduler(): p->sched_class, p->policy, p->*prio,
397 * p->se.load, p->rt_priority,
398 * p->dl.dl_{runtime, deadline, period, flags, bw, density}
399 * - sched_setnuma(): p->numa_preferred_nid
400 * - sched_move_task()/
401 * cpu_cgroup_fork(): p->sched_task_group
402 * - uclamp_update_active() p->uclamp*
404 * p->state <- TASK_*:
406 * is changed locklessly using set_current_state(), __set_current_state() or
407 * set_special_state(), see their respective comments, or by
408 * try_to_wake_up(). This latter uses p->pi_lock to serialize against
411 * p->on_rq <- { 0, 1 = TASK_ON_RQ_QUEUED, 2 = TASK_ON_RQ_MIGRATING }:
413 * is set by activate_task() and cleared by deactivate_task(), under
414 * rq->lock. Non-zero indicates the task is runnable, the special
415 * ON_RQ_MIGRATING state is used for migration without holding both
416 * rq->locks. It indicates task_cpu() is not stable, see task_rq_lock().
418 * p->on_cpu <- { 0, 1 }:
420 * is set by prepare_task() and cleared by finish_task() such that it will be
421 * set before p is scheduled-in and cleared after p is scheduled-out, both
422 * under rq->lock. Non-zero indicates the task is running on its CPU.
424 * [ The astute reader will observe that it is possible for two tasks on one
425 * CPU to have ->on_cpu = 1 at the same time. ]
427 * task_cpu(p): is changed by set_task_cpu(), the rules are:
429 * - Don't call set_task_cpu() on a blocked task:
431 * We don't care what CPU we're not running on, this simplifies hotplug,
432 * the CPU assignment of blocked tasks isn't required to be valid.
434 * - for try_to_wake_up(), called under p->pi_lock:
436 * This allows try_to_wake_up() to only take one rq->lock, see its comment.
438 * - for migration called under rq->lock:
439 * [ see task_on_rq_migrating() in task_rq_lock() ]
441 * o move_queued_task()
444 * - for migration called under double_rq_lock():
446 * o __migrate_swap_task()
447 * o push_rt_task() / pull_rt_task()
448 * o push_dl_task() / pull_dl_task()
449 * o dl_task_offline_migration()
453 void raw_spin_rq_lock_nested(struct rq *rq, int subclass)
455 raw_spinlock_t *lock;
457 /* Matches synchronize_rcu() in __sched_core_enable() */
459 if (sched_core_disabled()) {
460 raw_spin_lock_nested(&rq->__lock, subclass);
461 /* preempt_count *MUST* be > 1 */
462 preempt_enable_no_resched();
467 lock = __rq_lockp(rq);
468 raw_spin_lock_nested(lock, subclass);
469 if (likely(lock == __rq_lockp(rq))) {
470 /* preempt_count *MUST* be > 1 */
471 preempt_enable_no_resched();
474 raw_spin_unlock(lock);
478 bool raw_spin_rq_trylock(struct rq *rq)
480 raw_spinlock_t *lock;
483 /* Matches synchronize_rcu() in __sched_core_enable() */
485 if (sched_core_disabled()) {
486 ret = raw_spin_trylock(&rq->__lock);
492 lock = __rq_lockp(rq);
493 ret = raw_spin_trylock(lock);
494 if (!ret || (likely(lock == __rq_lockp(rq)))) {
498 raw_spin_unlock(lock);
502 void raw_spin_rq_unlock(struct rq *rq)
504 raw_spin_unlock(rq_lockp(rq));
509 * double_rq_lock - safely lock two runqueues
511 void double_rq_lock(struct rq *rq1, struct rq *rq2)
513 lockdep_assert_irqs_disabled();
515 if (rq_order_less(rq2, rq1))
518 raw_spin_rq_lock(rq1);
519 if (__rq_lockp(rq1) == __rq_lockp(rq2))
522 raw_spin_rq_lock_nested(rq2, SINGLE_DEPTH_NESTING);
527 * __task_rq_lock - lock the rq @p resides on.
529 struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf)
534 lockdep_assert_held(&p->pi_lock);
538 raw_spin_rq_lock(rq);
539 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) {
543 raw_spin_rq_unlock(rq);
545 while (unlikely(task_on_rq_migrating(p)))
551 * task_rq_lock - lock p->pi_lock and lock the rq @p resides on.
553 struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf)
554 __acquires(p->pi_lock)
560 raw_spin_lock_irqsave(&p->pi_lock, rf->flags);
562 raw_spin_rq_lock(rq);
564 * move_queued_task() task_rq_lock()
567 * [S] ->on_rq = MIGRATING [L] rq = task_rq()
568 * WMB (__set_task_cpu()) ACQUIRE (rq->lock);
569 * [S] ->cpu = new_cpu [L] task_rq()
573 * If we observe the old CPU in task_rq_lock(), the acquire of
574 * the old rq->lock will fully serialize against the stores.
576 * If we observe the new CPU in task_rq_lock(), the address
577 * dependency headed by '[L] rq = task_rq()' and the acquire
578 * will pair with the WMB to ensure we then also see migrating.
580 if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) {
584 raw_spin_rq_unlock(rq);
585 raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags);
587 while (unlikely(task_on_rq_migrating(p)))
593 * RQ-clock updating methods:
596 static void update_rq_clock_task(struct rq *rq, s64 delta)
599 * In theory, the compile should just see 0 here, and optimize out the call
600 * to sched_rt_avg_update. But I don't trust it...
602 s64 __maybe_unused steal = 0, irq_delta = 0;
604 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
605 irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time;
608 * Since irq_time is only updated on {soft,}irq_exit, we might run into
609 * this case when a previous update_rq_clock() happened inside a
612 * When this happens, we stop ->clock_task and only update the
613 * prev_irq_time stamp to account for the part that fit, so that a next
614 * update will consume the rest. This ensures ->clock_task is
617 * It does however cause some slight miss-attribution of {soft,}irq
618 * time, a more accurate solution would be to update the irq_time using
619 * the current rq->clock timestamp, except that would require using
622 if (irq_delta > delta)
625 rq->prev_irq_time += irq_delta;
628 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
629 if (static_key_false((¶virt_steal_rq_enabled))) {
630 steal = paravirt_steal_clock(cpu_of(rq));
631 steal -= rq->prev_steal_time_rq;
633 if (unlikely(steal > delta))
636 rq->prev_steal_time_rq += steal;
641 rq->clock_task += delta;
643 #ifdef CONFIG_HAVE_SCHED_AVG_IRQ
644 if ((irq_delta + steal) && sched_feat(NONTASK_CAPACITY))
645 update_irq_load_avg(rq, irq_delta + steal);
647 update_rq_clock_pelt(rq, delta);
650 void update_rq_clock(struct rq *rq)
654 lockdep_assert_rq_held(rq);
656 if (rq->clock_update_flags & RQCF_ACT_SKIP)
659 #ifdef CONFIG_SCHED_DEBUG
660 if (sched_feat(WARN_DOUBLE_CLOCK))
661 SCHED_WARN_ON(rq->clock_update_flags & RQCF_UPDATED);
662 rq->clock_update_flags |= RQCF_UPDATED;
665 delta = sched_clock_cpu(cpu_of(rq)) - rq->clock;
669 update_rq_clock_task(rq, delta);
672 #ifdef CONFIG_SCHED_HRTICK
674 * Use HR-timers to deliver accurate preemption points.
677 static void hrtick_clear(struct rq *rq)
679 if (hrtimer_active(&rq->hrtick_timer))
680 hrtimer_cancel(&rq->hrtick_timer);
684 * High-resolution timer tick.
685 * Runs from hardirq context with interrupts disabled.
687 static enum hrtimer_restart hrtick(struct hrtimer *timer)
689 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
692 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
696 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
699 return HRTIMER_NORESTART;
704 static void __hrtick_restart(struct rq *rq)
706 struct hrtimer *timer = &rq->hrtick_timer;
707 ktime_t time = rq->hrtick_time;
709 hrtimer_start(timer, time, HRTIMER_MODE_ABS_PINNED_HARD);
713 * called from hardirq (IPI) context
715 static void __hrtick_start(void *arg)
721 __hrtick_restart(rq);
726 * Called to set the hrtick timer state.
728 * called with rq->lock held and irqs disabled
730 void hrtick_start(struct rq *rq, u64 delay)
732 struct hrtimer *timer = &rq->hrtick_timer;
736 * Don't schedule slices shorter than 10000ns, that just
737 * doesn't make sense and can cause timer DoS.
739 delta = max_t(s64, delay, 10000LL);
740 rq->hrtick_time = ktime_add_ns(timer->base->get_time(), delta);
743 __hrtick_restart(rq);
745 smp_call_function_single_async(cpu_of(rq), &rq->hrtick_csd);
750 * Called to set the hrtick timer state.
752 * called with rq->lock held and irqs disabled
754 void hrtick_start(struct rq *rq, u64 delay)
757 * Don't schedule slices shorter than 10000ns, that just
758 * doesn't make sense. Rely on vruntime for fairness.
760 delay = max_t(u64, delay, 10000LL);
761 hrtimer_start(&rq->hrtick_timer, ns_to_ktime(delay),
762 HRTIMER_MODE_REL_PINNED_HARD);
765 #endif /* CONFIG_SMP */
767 static void hrtick_rq_init(struct rq *rq)
770 INIT_CSD(&rq->hrtick_csd, __hrtick_start, rq);
772 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL_HARD);
773 rq->hrtick_timer.function = hrtick;
775 #else /* CONFIG_SCHED_HRTICK */
776 static inline void hrtick_clear(struct rq *rq)
780 static inline void hrtick_rq_init(struct rq *rq)
783 #endif /* CONFIG_SCHED_HRTICK */
786 * cmpxchg based fetch_or, macro so it works for different integer types
788 #define fetch_or(ptr, mask) \
790 typeof(ptr) _ptr = (ptr); \
791 typeof(mask) _mask = (mask); \
792 typeof(*_ptr) _old, _val = *_ptr; \
795 _old = cmpxchg(_ptr, _val, _val | _mask); \
803 #if defined(CONFIG_SMP) && defined(TIF_POLLING_NRFLAG)
805 * Atomically set TIF_NEED_RESCHED and test for TIF_POLLING_NRFLAG,
806 * this avoids any races wrt polling state changes and thereby avoids
809 static bool set_nr_and_not_polling(struct task_struct *p)
811 struct thread_info *ti = task_thread_info(p);
812 return !(fetch_or(&ti->flags, _TIF_NEED_RESCHED) & _TIF_POLLING_NRFLAG);
816 * Atomically set TIF_NEED_RESCHED if TIF_POLLING_NRFLAG is set.
818 * If this returns true, then the idle task promises to call
819 * sched_ttwu_pending() and reschedule soon.
821 static bool set_nr_if_polling(struct task_struct *p)
823 struct thread_info *ti = task_thread_info(p);
824 typeof(ti->flags) old, val = READ_ONCE(ti->flags);
827 if (!(val & _TIF_POLLING_NRFLAG))
829 if (val & _TIF_NEED_RESCHED)
831 old = cmpxchg(&ti->flags, val, val | _TIF_NEED_RESCHED);
840 static bool set_nr_and_not_polling(struct task_struct *p)
842 set_tsk_need_resched(p);
847 static bool set_nr_if_polling(struct task_struct *p)
854 static bool __wake_q_add(struct wake_q_head *head, struct task_struct *task)
856 struct wake_q_node *node = &task->wake_q;
859 * Atomically grab the task, if ->wake_q is !nil already it means
860 * it's already queued (either by us or someone else) and will get the
861 * wakeup due to that.
863 * In order to ensure that a pending wakeup will observe our pending
864 * state, even in the failed case, an explicit smp_mb() must be used.
866 smp_mb__before_atomic();
867 if (unlikely(cmpxchg_relaxed(&node->next, NULL, WAKE_Q_TAIL)))
871 * The head is context local, there can be no concurrency.
874 head->lastp = &node->next;
879 * wake_q_add() - queue a wakeup for 'later' waking.
880 * @head: the wake_q_head to add @task to
881 * @task: the task to queue for 'later' wakeup
883 * Queue a task for later wakeup, most likely by the wake_up_q() call in the
884 * same context, _HOWEVER_ this is not guaranteed, the wakeup can come
887 * This function must be used as-if it were wake_up_process(); IOW the task
888 * must be ready to be woken at this location.
890 void wake_q_add(struct wake_q_head *head, struct task_struct *task)
892 if (__wake_q_add(head, task))
893 get_task_struct(task);
897 * wake_q_add_safe() - safely queue a wakeup for 'later' waking.
898 * @head: the wake_q_head to add @task to
899 * @task: the task to queue for 'later' wakeup
901 * Queue a task for later wakeup, most likely by the wake_up_q() call in the
902 * same context, _HOWEVER_ this is not guaranteed, the wakeup can come
905 * This function must be used as-if it were wake_up_process(); IOW the task
906 * must be ready to be woken at this location.
908 * This function is essentially a task-safe equivalent to wake_q_add(). Callers
909 * that already hold reference to @task can call the 'safe' version and trust
910 * wake_q to do the right thing depending whether or not the @task is already
913 void wake_q_add_safe(struct wake_q_head *head, struct task_struct *task)
915 if (!__wake_q_add(head, task))
916 put_task_struct(task);
919 void wake_up_q(struct wake_q_head *head)
921 struct wake_q_node *node = head->first;
923 while (node != WAKE_Q_TAIL) {
924 struct task_struct *task;
926 task = container_of(node, struct task_struct, wake_q);
927 /* Task can safely be re-inserted now: */
929 task->wake_q.next = NULL;
932 * wake_up_process() executes a full barrier, which pairs with
933 * the queueing in wake_q_add() so as not to miss wakeups.
935 wake_up_process(task);
936 put_task_struct(task);
941 * resched_curr - mark rq's current task 'to be rescheduled now'.
943 * On UP this means the setting of the need_resched flag, on SMP it
944 * might also involve a cross-CPU call to trigger the scheduler on
947 void resched_curr(struct rq *rq)
949 struct task_struct *curr = rq->curr;
952 lockdep_assert_rq_held(rq);
954 if (test_tsk_need_resched(curr))
959 if (cpu == smp_processor_id()) {
960 set_tsk_need_resched(curr);
961 set_preempt_need_resched();
965 if (set_nr_and_not_polling(curr))
966 smp_send_reschedule(cpu);
968 trace_sched_wake_idle_without_ipi(cpu);
971 void resched_cpu(int cpu)
973 struct rq *rq = cpu_rq(cpu);
976 raw_spin_rq_lock_irqsave(rq, flags);
977 if (cpu_online(cpu) || cpu == smp_processor_id())
979 raw_spin_rq_unlock_irqrestore(rq, flags);
983 #ifdef CONFIG_NO_HZ_COMMON
985 * In the semi idle case, use the nearest busy CPU for migrating timers
986 * from an idle CPU. This is good for power-savings.
988 * We don't do similar optimization for completely idle system, as
989 * selecting an idle CPU will add more delays to the timers than intended
990 * (as that CPU's timer base may not be uptodate wrt jiffies etc).
992 int get_nohz_timer_target(void)
994 int i, cpu = smp_processor_id(), default_cpu = -1;
995 struct sched_domain *sd;
997 if (housekeeping_cpu(cpu, HK_FLAG_TIMER)) {
1004 for_each_domain(cpu, sd) {
1005 for_each_cpu_and(i, sched_domain_span(sd),
1006 housekeeping_cpumask(HK_FLAG_TIMER)) {
1017 if (default_cpu == -1)
1018 default_cpu = housekeeping_any_cpu(HK_FLAG_TIMER);
1026 * When add_timer_on() enqueues a timer into the timer wheel of an
1027 * idle CPU then this timer might expire before the next timer event
1028 * which is scheduled to wake up that CPU. In case of a completely
1029 * idle system the next event might even be infinite time into the
1030 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1031 * leaves the inner idle loop so the newly added timer is taken into
1032 * account when the CPU goes back to idle and evaluates the timer
1033 * wheel for the next timer event.
1035 static void wake_up_idle_cpu(int cpu)
1037 struct rq *rq = cpu_rq(cpu);
1039 if (cpu == smp_processor_id())
1042 if (set_nr_and_not_polling(rq->idle))
1043 smp_send_reschedule(cpu);
1045 trace_sched_wake_idle_without_ipi(cpu);
1048 static bool wake_up_full_nohz_cpu(int cpu)
1051 * We just need the target to call irq_exit() and re-evaluate
1052 * the next tick. The nohz full kick at least implies that.
1053 * If needed we can still optimize that later with an
1056 if (cpu_is_offline(cpu))
1057 return true; /* Don't try to wake offline CPUs. */
1058 if (tick_nohz_full_cpu(cpu)) {
1059 if (cpu != smp_processor_id() ||
1060 tick_nohz_tick_stopped())
1061 tick_nohz_full_kick_cpu(cpu);
1069 * Wake up the specified CPU. If the CPU is going offline, it is the
1070 * caller's responsibility to deal with the lost wakeup, for example,
1071 * by hooking into the CPU_DEAD notifier like timers and hrtimers do.
1073 void wake_up_nohz_cpu(int cpu)
1075 if (!wake_up_full_nohz_cpu(cpu))
1076 wake_up_idle_cpu(cpu);
1079 static void nohz_csd_func(void *info)
1081 struct rq *rq = info;
1082 int cpu = cpu_of(rq);
1086 * Release the rq::nohz_csd.
1088 flags = atomic_fetch_andnot(NOHZ_KICK_MASK | NOHZ_NEWILB_KICK, nohz_flags(cpu));
1089 WARN_ON(!(flags & NOHZ_KICK_MASK));
1091 rq->idle_balance = idle_cpu(cpu);
1092 if (rq->idle_balance && !need_resched()) {
1093 rq->nohz_idle_balance = flags;
1094 raise_softirq_irqoff(SCHED_SOFTIRQ);
1098 #endif /* CONFIG_NO_HZ_COMMON */
1100 #ifdef CONFIG_NO_HZ_FULL
1101 bool sched_can_stop_tick(struct rq *rq)
1103 int fifo_nr_running;
1105 /* Deadline tasks, even if single, need the tick */
1106 if (rq->dl.dl_nr_running)
1110 * If there are more than one RR tasks, we need the tick to affect the
1111 * actual RR behaviour.
1113 if (rq->rt.rr_nr_running) {
1114 if (rq->rt.rr_nr_running == 1)
1121 * If there's no RR tasks, but FIFO tasks, we can skip the tick, no
1122 * forced preemption between FIFO tasks.
1124 fifo_nr_running = rq->rt.rt_nr_running - rq->rt.rr_nr_running;
1125 if (fifo_nr_running)
1129 * If there are no DL,RR/FIFO tasks, there must only be CFS tasks left;
1130 * if there's more than one we need the tick for involuntary
1133 if (rq->nr_running > 1)
1138 #endif /* CONFIG_NO_HZ_FULL */
1139 #endif /* CONFIG_SMP */
1141 #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \
1142 (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH)))
1144 * Iterate task_group tree rooted at *from, calling @down when first entering a
1145 * node and @up when leaving it for the final time.
1147 * Caller must hold rcu_lock or sufficient equivalent.
1149 int walk_tg_tree_from(struct task_group *from,
1150 tg_visitor down, tg_visitor up, void *data)
1152 struct task_group *parent, *child;
1158 ret = (*down)(parent, data);
1161 list_for_each_entry_rcu(child, &parent->children, siblings) {
1168 ret = (*up)(parent, data);
1169 if (ret || parent == from)
1173 parent = parent->parent;
1180 int tg_nop(struct task_group *tg, void *data)
1186 static void set_load_weight(struct task_struct *p, bool update_load)
1188 int prio = p->static_prio - MAX_RT_PRIO;
1189 struct load_weight *load = &p->se.load;
1192 * SCHED_IDLE tasks get minimal weight:
1194 if (task_has_idle_policy(p)) {
1195 load->weight = scale_load(WEIGHT_IDLEPRIO);
1196 load->inv_weight = WMULT_IDLEPRIO;
1201 * SCHED_OTHER tasks have to update their load when changing their
1204 if (update_load && p->sched_class == &fair_sched_class) {
1205 reweight_task(p, prio);
1207 load->weight = scale_load(sched_prio_to_weight[prio]);
1208 load->inv_weight = sched_prio_to_wmult[prio];
1212 #ifdef CONFIG_UCLAMP_TASK
1214 * Serializes updates of utilization clamp values
1216 * The (slow-path) user-space triggers utilization clamp value updates which
1217 * can require updates on (fast-path) scheduler's data structures used to
1218 * support enqueue/dequeue operations.
1219 * While the per-CPU rq lock protects fast-path update operations, user-space
1220 * requests are serialized using a mutex to reduce the risk of conflicting
1221 * updates or API abuses.
1223 static DEFINE_MUTEX(uclamp_mutex);
1225 /* Max allowed minimum utilization */
1226 unsigned int sysctl_sched_uclamp_util_min = SCHED_CAPACITY_SCALE;
1228 /* Max allowed maximum utilization */
1229 unsigned int sysctl_sched_uclamp_util_max = SCHED_CAPACITY_SCALE;
1232 * By default RT tasks run at the maximum performance point/capacity of the
1233 * system. Uclamp enforces this by always setting UCLAMP_MIN of RT tasks to
1234 * SCHED_CAPACITY_SCALE.
1236 * This knob allows admins to change the default behavior when uclamp is being
1237 * used. In battery powered devices, particularly, running at the maximum
1238 * capacity and frequency will increase energy consumption and shorten the
1241 * This knob only affects RT tasks that their uclamp_se->user_defined == false.
1243 * This knob will not override the system default sched_util_clamp_min defined
1246 unsigned int sysctl_sched_uclamp_util_min_rt_default = SCHED_CAPACITY_SCALE;
1248 /* All clamps are required to be less or equal than these values */
1249 static struct uclamp_se uclamp_default[UCLAMP_CNT];
1252 * This static key is used to reduce the uclamp overhead in the fast path. It
1253 * primarily disables the call to uclamp_rq_{inc, dec}() in
1254 * enqueue/dequeue_task().
1256 * This allows users to continue to enable uclamp in their kernel config with
1257 * minimum uclamp overhead in the fast path.
1259 * As soon as userspace modifies any of the uclamp knobs, the static key is
1260 * enabled, since we have an actual users that make use of uclamp
1263 * The knobs that would enable this static key are:
1265 * * A task modifying its uclamp value with sched_setattr().
1266 * * An admin modifying the sysctl_sched_uclamp_{min, max} via procfs.
1267 * * An admin modifying the cgroup cpu.uclamp.{min, max}
1269 DEFINE_STATIC_KEY_FALSE(sched_uclamp_used);
1271 /* Integer rounded range for each bucket */
1272 #define UCLAMP_BUCKET_DELTA DIV_ROUND_CLOSEST(SCHED_CAPACITY_SCALE, UCLAMP_BUCKETS)
1274 #define for_each_clamp_id(clamp_id) \
1275 for ((clamp_id) = 0; (clamp_id) < UCLAMP_CNT; (clamp_id)++)
1277 static inline unsigned int uclamp_bucket_id(unsigned int clamp_value)
1279 return min_t(unsigned int, clamp_value / UCLAMP_BUCKET_DELTA, UCLAMP_BUCKETS - 1);
1282 static inline unsigned int uclamp_none(enum uclamp_id clamp_id)
1284 if (clamp_id == UCLAMP_MIN)
1286 return SCHED_CAPACITY_SCALE;
1289 static inline void uclamp_se_set(struct uclamp_se *uc_se,
1290 unsigned int value, bool user_defined)
1292 uc_se->value = value;
1293 uc_se->bucket_id = uclamp_bucket_id(value);
1294 uc_se->user_defined = user_defined;
1297 static inline unsigned int
1298 uclamp_idle_value(struct rq *rq, enum uclamp_id clamp_id,
1299 unsigned int clamp_value)
1302 * Avoid blocked utilization pushing up the frequency when we go
1303 * idle (which drops the max-clamp) by retaining the last known
1306 if (clamp_id == UCLAMP_MAX) {
1307 rq->uclamp_flags |= UCLAMP_FLAG_IDLE;
1311 return uclamp_none(UCLAMP_MIN);
1314 static inline void uclamp_idle_reset(struct rq *rq, enum uclamp_id clamp_id,
1315 unsigned int clamp_value)
1317 /* Reset max-clamp retention only on idle exit */
1318 if (!(rq->uclamp_flags & UCLAMP_FLAG_IDLE))
1321 WRITE_ONCE(rq->uclamp[clamp_id].value, clamp_value);
1325 unsigned int uclamp_rq_max_value(struct rq *rq, enum uclamp_id clamp_id,
1326 unsigned int clamp_value)
1328 struct uclamp_bucket *bucket = rq->uclamp[clamp_id].bucket;
1329 int bucket_id = UCLAMP_BUCKETS - 1;
1332 * Since both min and max clamps are max aggregated, find the
1333 * top most bucket with tasks in.
1335 for ( ; bucket_id >= 0; bucket_id--) {
1336 if (!bucket[bucket_id].tasks)
1338 return bucket[bucket_id].value;
1341 /* No tasks -- default clamp values */
1342 return uclamp_idle_value(rq, clamp_id, clamp_value);
1345 static void __uclamp_update_util_min_rt_default(struct task_struct *p)
1347 unsigned int default_util_min;
1348 struct uclamp_se *uc_se;
1350 lockdep_assert_held(&p->pi_lock);
1352 uc_se = &p->uclamp_req[UCLAMP_MIN];
1354 /* Only sync if user didn't override the default */
1355 if (uc_se->user_defined)
1358 default_util_min = sysctl_sched_uclamp_util_min_rt_default;
1359 uclamp_se_set(uc_se, default_util_min, false);
1362 static void uclamp_update_util_min_rt_default(struct task_struct *p)
1370 /* Protect updates to p->uclamp_* */
1371 rq = task_rq_lock(p, &rf);
1372 __uclamp_update_util_min_rt_default(p);
1373 task_rq_unlock(rq, p, &rf);
1376 static void uclamp_sync_util_min_rt_default(void)
1378 struct task_struct *g, *p;
1381 * copy_process() sysctl_uclamp
1382 * uclamp_min_rt = X;
1383 * write_lock(&tasklist_lock) read_lock(&tasklist_lock)
1384 * // link thread smp_mb__after_spinlock()
1385 * write_unlock(&tasklist_lock) read_unlock(&tasklist_lock);
1386 * sched_post_fork() for_each_process_thread()
1387 * __uclamp_sync_rt() __uclamp_sync_rt()
1389 * Ensures that either sched_post_fork() will observe the new
1390 * uclamp_min_rt or for_each_process_thread() will observe the new
1393 read_lock(&tasklist_lock);
1394 smp_mb__after_spinlock();
1395 read_unlock(&tasklist_lock);
1398 for_each_process_thread(g, p)
1399 uclamp_update_util_min_rt_default(p);
1403 static inline struct uclamp_se
1404 uclamp_tg_restrict(struct task_struct *p, enum uclamp_id clamp_id)
1406 struct uclamp_se uc_req = p->uclamp_req[clamp_id];
1407 #ifdef CONFIG_UCLAMP_TASK_GROUP
1410 * Tasks in autogroups or root task group will be
1411 * restricted by system defaults.
1413 if (task_group_is_autogroup(task_group(p)))
1415 if (task_group(p) == &root_task_group)
1420 struct uclamp_se uc_min = task_group(p)->uclamp[clamp_id];
1421 if (uc_req.value < uc_min.value)
1426 struct uclamp_se uc_max = task_group(p)->uclamp[clamp_id];
1427 if (uc_req.value > uc_max.value)
1441 * The effective clamp bucket index of a task depends on, by increasing
1443 * - the task specific clamp value, when explicitly requested from userspace
1444 * - the task group effective clamp value, for tasks not either in the root
1445 * group or in an autogroup
1446 * - the system default clamp value, defined by the sysadmin
1448 static inline struct uclamp_se
1449 uclamp_eff_get(struct task_struct *p, enum uclamp_id clamp_id)
1451 struct uclamp_se uc_req = uclamp_tg_restrict(p, clamp_id);
1452 struct uclamp_se uc_max = uclamp_default[clamp_id];
1454 /* System default restrictions always apply */
1455 if (unlikely(uc_req.value > uc_max.value))
1461 unsigned long uclamp_eff_value(struct task_struct *p, enum uclamp_id clamp_id)
1463 struct uclamp_se uc_eff;
1465 /* Task currently refcounted: use back-annotated (effective) value */
1466 if (p->uclamp[clamp_id].active)
1467 return (unsigned long)p->uclamp[clamp_id].value;
1469 uc_eff = uclamp_eff_get(p, clamp_id);
1471 return (unsigned long)uc_eff.value;
1475 * When a task is enqueued on a rq, the clamp bucket currently defined by the
1476 * task's uclamp::bucket_id is refcounted on that rq. This also immediately
1477 * updates the rq's clamp value if required.
1479 * Tasks can have a task-specific value requested from user-space, track
1480 * within each bucket the maximum value for tasks refcounted in it.
1481 * This "local max aggregation" allows to track the exact "requested" value
1482 * for each bucket when all its RUNNABLE tasks require the same clamp.
1484 static inline void uclamp_rq_inc_id(struct rq *rq, struct task_struct *p,
1485 enum uclamp_id clamp_id)
1487 struct uclamp_rq *uc_rq = &rq->uclamp[clamp_id];
1488 struct uclamp_se *uc_se = &p->uclamp[clamp_id];
1489 struct uclamp_bucket *bucket;
1491 lockdep_assert_rq_held(rq);
1493 /* Update task effective clamp */
1494 p->uclamp[clamp_id] = uclamp_eff_get(p, clamp_id);
1496 bucket = &uc_rq->bucket[uc_se->bucket_id];
1498 uc_se->active = true;
1500 uclamp_idle_reset(rq, clamp_id, uc_se->value);
1503 * Local max aggregation: rq buckets always track the max
1504 * "requested" clamp value of its RUNNABLE tasks.
1506 if (bucket->tasks == 1 || uc_se->value > bucket->value)
1507 bucket->value = uc_se->value;
1509 if (uc_se->value > READ_ONCE(uc_rq->value))
1510 WRITE_ONCE(uc_rq->value, uc_se->value);
1514 * When a task is dequeued from a rq, the clamp bucket refcounted by the task
1515 * is released. If this is the last task reference counting the rq's max
1516 * active clamp value, then the rq's clamp value is updated.
1518 * Both refcounted tasks and rq's cached clamp values are expected to be
1519 * always valid. If it's detected they are not, as defensive programming,
1520 * enforce the expected state and warn.
1522 static inline void uclamp_rq_dec_id(struct rq *rq, struct task_struct *p,
1523 enum uclamp_id clamp_id)
1525 struct uclamp_rq *uc_rq = &rq->uclamp[clamp_id];
1526 struct uclamp_se *uc_se = &p->uclamp[clamp_id];
1527 struct uclamp_bucket *bucket;
1528 unsigned int bkt_clamp;
1529 unsigned int rq_clamp;
1531 lockdep_assert_rq_held(rq);
1534 * If sched_uclamp_used was enabled after task @p was enqueued,
1535 * we could end up with unbalanced call to uclamp_rq_dec_id().
1537 * In this case the uc_se->active flag should be false since no uclamp
1538 * accounting was performed at enqueue time and we can just return
1541 * Need to be careful of the following enqueue/dequeue ordering
1545 * // sched_uclamp_used gets enabled
1548 * // Must not decrement bucket->tasks here
1551 * where we could end up with stale data in uc_se and
1552 * bucket[uc_se->bucket_id].
1554 * The following check here eliminates the possibility of such race.
1556 if (unlikely(!uc_se->active))
1559 bucket = &uc_rq->bucket[uc_se->bucket_id];
1561 SCHED_WARN_ON(!bucket->tasks);
1562 if (likely(bucket->tasks))
1565 uc_se->active = false;
1568 * Keep "local max aggregation" simple and accept to (possibly)
1569 * overboost some RUNNABLE tasks in the same bucket.
1570 * The rq clamp bucket value is reset to its base value whenever
1571 * there are no more RUNNABLE tasks refcounting it.
1573 if (likely(bucket->tasks))
1576 rq_clamp = READ_ONCE(uc_rq->value);
1578 * Defensive programming: this should never happen. If it happens,
1579 * e.g. due to future modification, warn and fixup the expected value.
1581 SCHED_WARN_ON(bucket->value > rq_clamp);
1582 if (bucket->value >= rq_clamp) {
1583 bkt_clamp = uclamp_rq_max_value(rq, clamp_id, uc_se->value);
1584 WRITE_ONCE(uc_rq->value, bkt_clamp);
1588 static inline void uclamp_rq_inc(struct rq *rq, struct task_struct *p)
1590 enum uclamp_id clamp_id;
1593 * Avoid any overhead until uclamp is actually used by the userspace.
1595 * The condition is constructed such that a NOP is generated when
1596 * sched_uclamp_used is disabled.
1598 if (!static_branch_unlikely(&sched_uclamp_used))
1601 if (unlikely(!p->sched_class->uclamp_enabled))
1604 for_each_clamp_id(clamp_id)
1605 uclamp_rq_inc_id(rq, p, clamp_id);
1607 /* Reset clamp idle holding when there is one RUNNABLE task */
1608 if (rq->uclamp_flags & UCLAMP_FLAG_IDLE)
1609 rq->uclamp_flags &= ~UCLAMP_FLAG_IDLE;
1612 static inline void uclamp_rq_dec(struct rq *rq, struct task_struct *p)
1614 enum uclamp_id clamp_id;
1617 * Avoid any overhead until uclamp is actually used by the userspace.
1619 * The condition is constructed such that a NOP is generated when
1620 * sched_uclamp_used is disabled.
1622 if (!static_branch_unlikely(&sched_uclamp_used))
1625 if (unlikely(!p->sched_class->uclamp_enabled))
1628 for_each_clamp_id(clamp_id)
1629 uclamp_rq_dec_id(rq, p, clamp_id);
1633 uclamp_update_active(struct task_struct *p, enum uclamp_id clamp_id)
1639 * Lock the task and the rq where the task is (or was) queued.
1641 * We might lock the (previous) rq of a !RUNNABLE task, but that's the
1642 * price to pay to safely serialize util_{min,max} updates with
1643 * enqueues, dequeues and migration operations.
1644 * This is the same locking schema used by __set_cpus_allowed_ptr().
1646 rq = task_rq_lock(p, &rf);
1649 * Setting the clamp bucket is serialized by task_rq_lock().
1650 * If the task is not yet RUNNABLE and its task_struct is not
1651 * affecting a valid clamp bucket, the next time it's enqueued,
1652 * it will already see the updated clamp bucket value.
1654 if (p->uclamp[clamp_id].active) {
1655 uclamp_rq_dec_id(rq, p, clamp_id);
1656 uclamp_rq_inc_id(rq, p, clamp_id);
1659 task_rq_unlock(rq, p, &rf);
1662 #ifdef CONFIG_UCLAMP_TASK_GROUP
1664 uclamp_update_active_tasks(struct cgroup_subsys_state *css,
1665 unsigned int clamps)
1667 enum uclamp_id clamp_id;
1668 struct css_task_iter it;
1669 struct task_struct *p;
1671 css_task_iter_start(css, 0, &it);
1672 while ((p = css_task_iter_next(&it))) {
1673 for_each_clamp_id(clamp_id) {
1674 if ((0x1 << clamp_id) & clamps)
1675 uclamp_update_active(p, clamp_id);
1678 css_task_iter_end(&it);
1681 static void cpu_util_update_eff(struct cgroup_subsys_state *css);
1682 static void uclamp_update_root_tg(void)
1684 struct task_group *tg = &root_task_group;
1686 uclamp_se_set(&tg->uclamp_req[UCLAMP_MIN],
1687 sysctl_sched_uclamp_util_min, false);
1688 uclamp_se_set(&tg->uclamp_req[UCLAMP_MAX],
1689 sysctl_sched_uclamp_util_max, false);
1692 cpu_util_update_eff(&root_task_group.css);
1696 static void uclamp_update_root_tg(void) { }
1699 int sysctl_sched_uclamp_handler(struct ctl_table *table, int write,
1700 void *buffer, size_t *lenp, loff_t *ppos)
1702 bool update_root_tg = false;
1703 int old_min, old_max, old_min_rt;
1706 mutex_lock(&uclamp_mutex);
1707 old_min = sysctl_sched_uclamp_util_min;
1708 old_max = sysctl_sched_uclamp_util_max;
1709 old_min_rt = sysctl_sched_uclamp_util_min_rt_default;
1711 result = proc_dointvec(table, write, buffer, lenp, ppos);
1717 if (sysctl_sched_uclamp_util_min > sysctl_sched_uclamp_util_max ||
1718 sysctl_sched_uclamp_util_max > SCHED_CAPACITY_SCALE ||
1719 sysctl_sched_uclamp_util_min_rt_default > SCHED_CAPACITY_SCALE) {
1725 if (old_min != sysctl_sched_uclamp_util_min) {
1726 uclamp_se_set(&uclamp_default[UCLAMP_MIN],
1727 sysctl_sched_uclamp_util_min, false);
1728 update_root_tg = true;
1730 if (old_max != sysctl_sched_uclamp_util_max) {
1731 uclamp_se_set(&uclamp_default[UCLAMP_MAX],
1732 sysctl_sched_uclamp_util_max, false);
1733 update_root_tg = true;
1736 if (update_root_tg) {
1737 static_branch_enable(&sched_uclamp_used);
1738 uclamp_update_root_tg();
1741 if (old_min_rt != sysctl_sched_uclamp_util_min_rt_default) {
1742 static_branch_enable(&sched_uclamp_used);
1743 uclamp_sync_util_min_rt_default();
1747 * We update all RUNNABLE tasks only when task groups are in use.
1748 * Otherwise, keep it simple and do just a lazy update at each next
1749 * task enqueue time.
1755 sysctl_sched_uclamp_util_min = old_min;
1756 sysctl_sched_uclamp_util_max = old_max;
1757 sysctl_sched_uclamp_util_min_rt_default = old_min_rt;
1759 mutex_unlock(&uclamp_mutex);
1764 static int uclamp_validate(struct task_struct *p,
1765 const struct sched_attr *attr)
1767 int util_min = p->uclamp_req[UCLAMP_MIN].value;
1768 int util_max = p->uclamp_req[UCLAMP_MAX].value;
1770 if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MIN) {
1771 util_min = attr->sched_util_min;
1773 if (util_min + 1 > SCHED_CAPACITY_SCALE + 1)
1777 if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MAX) {
1778 util_max = attr->sched_util_max;
1780 if (util_max + 1 > SCHED_CAPACITY_SCALE + 1)
1784 if (util_min != -1 && util_max != -1 && util_min > util_max)
1788 * We have valid uclamp attributes; make sure uclamp is enabled.
1790 * We need to do that here, because enabling static branches is a
1791 * blocking operation which obviously cannot be done while holding
1794 static_branch_enable(&sched_uclamp_used);
1799 static bool uclamp_reset(const struct sched_attr *attr,
1800 enum uclamp_id clamp_id,
1801 struct uclamp_se *uc_se)
1803 /* Reset on sched class change for a non user-defined clamp value. */
1804 if (likely(!(attr->sched_flags & SCHED_FLAG_UTIL_CLAMP)) &&
1805 !uc_se->user_defined)
1808 /* Reset on sched_util_{min,max} == -1. */
1809 if (clamp_id == UCLAMP_MIN &&
1810 attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MIN &&
1811 attr->sched_util_min == -1) {
1815 if (clamp_id == UCLAMP_MAX &&
1816 attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MAX &&
1817 attr->sched_util_max == -1) {
1824 static void __setscheduler_uclamp(struct task_struct *p,
1825 const struct sched_attr *attr)
1827 enum uclamp_id clamp_id;
1829 for_each_clamp_id(clamp_id) {
1830 struct uclamp_se *uc_se = &p->uclamp_req[clamp_id];
1833 if (!uclamp_reset(attr, clamp_id, uc_se))
1837 * RT by default have a 100% boost value that could be modified
1840 if (unlikely(rt_task(p) && clamp_id == UCLAMP_MIN))
1841 value = sysctl_sched_uclamp_util_min_rt_default;
1843 value = uclamp_none(clamp_id);
1845 uclamp_se_set(uc_se, value, false);
1849 if (likely(!(attr->sched_flags & SCHED_FLAG_UTIL_CLAMP)))
1852 if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MIN &&
1853 attr->sched_util_min != -1) {
1854 uclamp_se_set(&p->uclamp_req[UCLAMP_MIN],
1855 attr->sched_util_min, true);
1858 if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MAX &&
1859 attr->sched_util_max != -1) {
1860 uclamp_se_set(&p->uclamp_req[UCLAMP_MAX],
1861 attr->sched_util_max, true);
1865 static void uclamp_fork(struct task_struct *p)
1867 enum uclamp_id clamp_id;
1870 * We don't need to hold task_rq_lock() when updating p->uclamp_* here
1871 * as the task is still at its early fork stages.
1873 for_each_clamp_id(clamp_id)
1874 p->uclamp[clamp_id].active = false;
1876 if (likely(!p->sched_reset_on_fork))
1879 for_each_clamp_id(clamp_id) {
1880 uclamp_se_set(&p->uclamp_req[clamp_id],
1881 uclamp_none(clamp_id), false);
1885 static void uclamp_post_fork(struct task_struct *p)
1887 uclamp_update_util_min_rt_default(p);
1890 static void __init init_uclamp_rq(struct rq *rq)
1892 enum uclamp_id clamp_id;
1893 struct uclamp_rq *uc_rq = rq->uclamp;
1895 for_each_clamp_id(clamp_id) {
1896 uc_rq[clamp_id] = (struct uclamp_rq) {
1897 .value = uclamp_none(clamp_id)
1901 rq->uclamp_flags = 0;
1904 static void __init init_uclamp(void)
1906 struct uclamp_se uc_max = {};
1907 enum uclamp_id clamp_id;
1910 for_each_possible_cpu(cpu)
1911 init_uclamp_rq(cpu_rq(cpu));
1913 for_each_clamp_id(clamp_id) {
1914 uclamp_se_set(&init_task.uclamp_req[clamp_id],
1915 uclamp_none(clamp_id), false);
1918 /* System defaults allow max clamp values for both indexes */
1919 uclamp_se_set(&uc_max, uclamp_none(UCLAMP_MAX), false);
1920 for_each_clamp_id(clamp_id) {
1921 uclamp_default[clamp_id] = uc_max;
1922 #ifdef CONFIG_UCLAMP_TASK_GROUP
1923 root_task_group.uclamp_req[clamp_id] = uc_max;
1924 root_task_group.uclamp[clamp_id] = uc_max;
1929 #else /* CONFIG_UCLAMP_TASK */
1930 static inline void uclamp_rq_inc(struct rq *rq, struct task_struct *p) { }
1931 static inline void uclamp_rq_dec(struct rq *rq, struct task_struct *p) { }
1932 static inline int uclamp_validate(struct task_struct *p,
1933 const struct sched_attr *attr)
1937 static void __setscheduler_uclamp(struct task_struct *p,
1938 const struct sched_attr *attr) { }
1939 static inline void uclamp_fork(struct task_struct *p) { }
1940 static inline void uclamp_post_fork(struct task_struct *p) { }
1941 static inline void init_uclamp(void) { }
1942 #endif /* CONFIG_UCLAMP_TASK */
1944 static inline void enqueue_task(struct rq *rq, struct task_struct *p, int flags)
1946 if (!(flags & ENQUEUE_NOCLOCK))
1947 update_rq_clock(rq);
1949 if (!(flags & ENQUEUE_RESTORE)) {
1950 sched_info_enqueue(rq, p);
1951 psi_enqueue(p, flags & ENQUEUE_WAKEUP);
1954 uclamp_rq_inc(rq, p);
1955 p->sched_class->enqueue_task(rq, p, flags);
1957 if (sched_core_enabled(rq))
1958 sched_core_enqueue(rq, p);
1961 static inline void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
1963 if (sched_core_enabled(rq))
1964 sched_core_dequeue(rq, p);
1966 if (!(flags & DEQUEUE_NOCLOCK))
1967 update_rq_clock(rq);
1969 if (!(flags & DEQUEUE_SAVE)) {
1970 sched_info_dequeue(rq, p);
1971 psi_dequeue(p, flags & DEQUEUE_SLEEP);
1974 uclamp_rq_dec(rq, p);
1975 p->sched_class->dequeue_task(rq, p, flags);
1978 void activate_task(struct rq *rq, struct task_struct *p, int flags)
1980 enqueue_task(rq, p, flags);
1982 p->on_rq = TASK_ON_RQ_QUEUED;
1985 void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
1987 p->on_rq = (flags & DEQUEUE_SLEEP) ? 0 : TASK_ON_RQ_MIGRATING;
1989 dequeue_task(rq, p, flags);
1993 * __normal_prio - return the priority that is based on the static prio
1995 static inline int __normal_prio(struct task_struct *p)
1997 return p->static_prio;
2001 * Calculate the expected normal priority: i.e. priority
2002 * without taking RT-inheritance into account. Might be
2003 * boosted by interactivity modifiers. Changes upon fork,
2004 * setprio syscalls, and whenever the interactivity
2005 * estimator recalculates.
2007 static inline int normal_prio(struct task_struct *p)
2011 if (task_has_dl_policy(p))
2012 prio = MAX_DL_PRIO-1;
2013 else if (task_has_rt_policy(p))
2014 prio = MAX_RT_PRIO-1 - p->rt_priority;
2016 prio = __normal_prio(p);
2021 * Calculate the current priority, i.e. the priority
2022 * taken into account by the scheduler. This value might
2023 * be boosted by RT tasks, or might be boosted by
2024 * interactivity modifiers. Will be RT if the task got
2025 * RT-boosted. If not then it returns p->normal_prio.
2027 static int effective_prio(struct task_struct *p)
2029 p->normal_prio = normal_prio(p);
2031 * If we are RT tasks or we were boosted to RT priority,
2032 * keep the priority unchanged. Otherwise, update priority
2033 * to the normal priority:
2035 if (!rt_prio(p->prio))
2036 return p->normal_prio;
2041 * task_curr - is this task currently executing on a CPU?
2042 * @p: the task in question.
2044 * Return: 1 if the task is currently executing. 0 otherwise.
2046 inline int task_curr(const struct task_struct *p)
2048 return cpu_curr(task_cpu(p)) == p;
2052 * switched_from, switched_to and prio_changed must _NOT_ drop rq->lock,
2053 * use the balance_callback list if you want balancing.
2055 * this means any call to check_class_changed() must be followed by a call to
2056 * balance_callback().
2058 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
2059 const struct sched_class *prev_class,
2062 if (prev_class != p->sched_class) {
2063 if (prev_class->switched_from)
2064 prev_class->switched_from(rq, p);
2066 p->sched_class->switched_to(rq, p);
2067 } else if (oldprio != p->prio || dl_task(p))
2068 p->sched_class->prio_changed(rq, p, oldprio);
2071 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
2073 if (p->sched_class == rq->curr->sched_class)
2074 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
2075 else if (p->sched_class > rq->curr->sched_class)
2079 * A queue event has occurred, and we're going to schedule. In
2080 * this case, we can save a useless back to back clock update.
2082 if (task_on_rq_queued(rq->curr) && test_tsk_need_resched(rq->curr))
2083 rq_clock_skip_update(rq);
2089 __do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask, u32 flags);
2091 static int __set_cpus_allowed_ptr(struct task_struct *p,
2092 const struct cpumask *new_mask,
2095 static void migrate_disable_switch(struct rq *rq, struct task_struct *p)
2097 if (likely(!p->migration_disabled))
2100 if (p->cpus_ptr != &p->cpus_mask)
2104 * Violates locking rules! see comment in __do_set_cpus_allowed().
2106 __do_set_cpus_allowed(p, cpumask_of(rq->cpu), SCA_MIGRATE_DISABLE);
2109 void migrate_disable(void)
2111 struct task_struct *p = current;
2113 if (p->migration_disabled) {
2114 p->migration_disabled++;
2119 this_rq()->nr_pinned++;
2120 p->migration_disabled = 1;
2123 EXPORT_SYMBOL_GPL(migrate_disable);
2125 void migrate_enable(void)
2127 struct task_struct *p = current;
2129 if (p->migration_disabled > 1) {
2130 p->migration_disabled--;
2135 * Ensure stop_task runs either before or after this, and that
2136 * __set_cpus_allowed_ptr(SCA_MIGRATE_ENABLE) doesn't schedule().
2139 if (p->cpus_ptr != &p->cpus_mask)
2140 __set_cpus_allowed_ptr(p, &p->cpus_mask, SCA_MIGRATE_ENABLE);
2142 * Mustn't clear migration_disabled() until cpus_ptr points back at the
2143 * regular cpus_mask, otherwise things that race (eg.
2144 * select_fallback_rq) get confused.
2147 p->migration_disabled = 0;
2148 this_rq()->nr_pinned--;
2151 EXPORT_SYMBOL_GPL(migrate_enable);
2153 static inline bool rq_has_pinned_tasks(struct rq *rq)
2155 return rq->nr_pinned;
2159 * Per-CPU kthreads are allowed to run on !active && online CPUs, see
2160 * __set_cpus_allowed_ptr() and select_fallback_rq().
2162 static inline bool is_cpu_allowed(struct task_struct *p, int cpu)
2164 /* When not in the task's cpumask, no point in looking further. */
2165 if (!cpumask_test_cpu(cpu, p->cpus_ptr))
2168 /* migrate_disabled() must be allowed to finish. */
2169 if (is_migration_disabled(p))
2170 return cpu_online(cpu);
2172 /* Non kernel threads are not allowed during either online or offline. */
2173 if (!(p->flags & PF_KTHREAD))
2174 return cpu_active(cpu);
2176 /* KTHREAD_IS_PER_CPU is always allowed. */
2177 if (kthread_is_per_cpu(p))
2178 return cpu_online(cpu);
2180 /* Regular kernel threads don't get to stay during offline. */
2184 /* But are allowed during online. */
2185 return cpu_online(cpu);
2189 * This is how migration works:
2191 * 1) we invoke migration_cpu_stop() on the target CPU using
2193 * 2) stopper starts to run (implicitly forcing the migrated thread
2195 * 3) it checks whether the migrated task is still in the wrong runqueue.
2196 * 4) if it's in the wrong runqueue then the migration thread removes
2197 * it and puts it into the right queue.
2198 * 5) stopper completes and stop_one_cpu() returns and the migration
2203 * move_queued_task - move a queued task to new rq.
2205 * Returns (locked) new rq. Old rq's lock is released.
2207 static struct rq *move_queued_task(struct rq *rq, struct rq_flags *rf,
2208 struct task_struct *p, int new_cpu)
2210 lockdep_assert_rq_held(rq);
2212 deactivate_task(rq, p, DEQUEUE_NOCLOCK);
2213 set_task_cpu(p, new_cpu);
2216 rq = cpu_rq(new_cpu);
2219 BUG_ON(task_cpu(p) != new_cpu);
2220 activate_task(rq, p, 0);
2221 check_preempt_curr(rq, p, 0);
2226 struct migration_arg {
2227 struct task_struct *task;
2229 struct set_affinity_pending *pending;
2233 * @refs: number of wait_for_completion()
2234 * @stop_pending: is @stop_work in use
2236 struct set_affinity_pending {
2238 unsigned int stop_pending;
2239 struct completion done;
2240 struct cpu_stop_work stop_work;
2241 struct migration_arg arg;
2245 * Move (not current) task off this CPU, onto the destination CPU. We're doing
2246 * this because either it can't run here any more (set_cpus_allowed()
2247 * away from this CPU, or CPU going down), or because we're
2248 * attempting to rebalance this task on exec (sched_exec).
2250 * So we race with normal scheduler movements, but that's OK, as long
2251 * as the task is no longer on this CPU.
2253 static struct rq *__migrate_task(struct rq *rq, struct rq_flags *rf,
2254 struct task_struct *p, int dest_cpu)
2256 /* Affinity changed (again). */
2257 if (!is_cpu_allowed(p, dest_cpu))
2260 update_rq_clock(rq);
2261 rq = move_queued_task(rq, rf, p, dest_cpu);
2267 * migration_cpu_stop - this will be executed by a highprio stopper thread
2268 * and performs thread migration by bumping thread off CPU then
2269 * 'pushing' onto another runqueue.
2271 static int migration_cpu_stop(void *data)
2273 struct migration_arg *arg = data;
2274 struct set_affinity_pending *pending = arg->pending;
2275 struct task_struct *p = arg->task;
2276 struct rq *rq = this_rq();
2277 bool complete = false;
2281 * The original target CPU might have gone down and we might
2282 * be on another CPU but it doesn't matter.
2284 local_irq_save(rf.flags);
2286 * We need to explicitly wake pending tasks before running
2287 * __migrate_task() such that we will not miss enforcing cpus_ptr
2288 * during wakeups, see set_cpus_allowed_ptr()'s TASK_WAKING test.
2290 flush_smp_call_function_from_idle();
2292 raw_spin_lock(&p->pi_lock);
2296 * If we were passed a pending, then ->stop_pending was set, thus
2297 * p->migration_pending must have remained stable.
2299 WARN_ON_ONCE(pending && pending != p->migration_pending);
2302 * If task_rq(p) != rq, it cannot be migrated here, because we're
2303 * holding rq->lock, if p->on_rq == 0 it cannot get enqueued because
2304 * we're holding p->pi_lock.
2306 if (task_rq(p) == rq) {
2307 if (is_migration_disabled(p))
2311 p->migration_pending = NULL;
2314 if (cpumask_test_cpu(task_cpu(p), &p->cpus_mask))
2318 if (task_on_rq_queued(p))
2319 rq = __migrate_task(rq, &rf, p, arg->dest_cpu);
2321 p->wake_cpu = arg->dest_cpu;
2324 * XXX __migrate_task() can fail, at which point we might end
2325 * up running on a dodgy CPU, AFAICT this can only happen
2326 * during CPU hotplug, at which point we'll get pushed out
2327 * anyway, so it's probably not a big deal.
2330 } else if (pending) {
2332 * This happens when we get migrated between migrate_enable()'s
2333 * preempt_enable() and scheduling the stopper task. At that
2334 * point we're a regular task again and not current anymore.
2336 * A !PREEMPT kernel has a giant hole here, which makes it far
2341 * The task moved before the stopper got to run. We're holding
2342 * ->pi_lock, so the allowed mask is stable - if it got
2343 * somewhere allowed, we're done.
2345 if (cpumask_test_cpu(task_cpu(p), p->cpus_ptr)) {
2346 p->migration_pending = NULL;
2352 * When migrate_enable() hits a rq mis-match we can't reliably
2353 * determine is_migration_disabled() and so have to chase after
2356 WARN_ON_ONCE(!pending->stop_pending);
2357 task_rq_unlock(rq, p, &rf);
2358 stop_one_cpu_nowait(task_cpu(p), migration_cpu_stop,
2359 &pending->arg, &pending->stop_work);
2364 pending->stop_pending = false;
2365 task_rq_unlock(rq, p, &rf);
2368 complete_all(&pending->done);
2373 int push_cpu_stop(void *arg)
2375 struct rq *lowest_rq = NULL, *rq = this_rq();
2376 struct task_struct *p = arg;
2378 raw_spin_lock_irq(&p->pi_lock);
2379 raw_spin_rq_lock(rq);
2381 if (task_rq(p) != rq)
2384 if (is_migration_disabled(p)) {
2385 p->migration_flags |= MDF_PUSH;
2389 p->migration_flags &= ~MDF_PUSH;
2391 if (p->sched_class->find_lock_rq)
2392 lowest_rq = p->sched_class->find_lock_rq(p, rq);
2397 // XXX validate p is still the highest prio task
2398 if (task_rq(p) == rq) {
2399 deactivate_task(rq, p, 0);
2400 set_task_cpu(p, lowest_rq->cpu);
2401 activate_task(lowest_rq, p, 0);
2402 resched_curr(lowest_rq);
2405 double_unlock_balance(rq, lowest_rq);
2408 rq->push_busy = false;
2409 raw_spin_rq_unlock(rq);
2410 raw_spin_unlock_irq(&p->pi_lock);
2417 * sched_class::set_cpus_allowed must do the below, but is not required to
2418 * actually call this function.
2420 void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask, u32 flags)
2422 if (flags & (SCA_MIGRATE_ENABLE | SCA_MIGRATE_DISABLE)) {
2423 p->cpus_ptr = new_mask;
2427 cpumask_copy(&p->cpus_mask, new_mask);
2428 p->nr_cpus_allowed = cpumask_weight(new_mask);
2432 __do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask, u32 flags)
2434 struct rq *rq = task_rq(p);
2435 bool queued, running;
2438 * This here violates the locking rules for affinity, since we're only
2439 * supposed to change these variables while holding both rq->lock and
2442 * HOWEVER, it magically works, because ttwu() is the only code that
2443 * accesses these variables under p->pi_lock and only does so after
2444 * smp_cond_load_acquire(&p->on_cpu, !VAL), and we're in __schedule()
2445 * before finish_task().
2447 * XXX do further audits, this smells like something putrid.
2449 if (flags & SCA_MIGRATE_DISABLE)
2450 SCHED_WARN_ON(!p->on_cpu);
2452 lockdep_assert_held(&p->pi_lock);
2454 queued = task_on_rq_queued(p);
2455 running = task_current(rq, p);
2459 * Because __kthread_bind() calls this on blocked tasks without
2462 lockdep_assert_rq_held(rq);
2463 dequeue_task(rq, p, DEQUEUE_SAVE | DEQUEUE_NOCLOCK);
2466 put_prev_task(rq, p);
2468 p->sched_class->set_cpus_allowed(p, new_mask, flags);
2471 enqueue_task(rq, p, ENQUEUE_RESTORE | ENQUEUE_NOCLOCK);
2473 set_next_task(rq, p);
2476 void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask)
2478 __do_set_cpus_allowed(p, new_mask, 0);
2482 * This function is wildly self concurrent; here be dragons.
2485 * When given a valid mask, __set_cpus_allowed_ptr() must block until the
2486 * designated task is enqueued on an allowed CPU. If that task is currently
2487 * running, we have to kick it out using the CPU stopper.
2489 * Migrate-Disable comes along and tramples all over our nice sandcastle.
2492 * Initial conditions: P0->cpus_mask = [0, 1]
2496 * migrate_disable();
2498 * set_cpus_allowed_ptr(P0, [1]);
2500 * P1 *cannot* return from this set_cpus_allowed_ptr() call until P0 executes
2501 * its outermost migrate_enable() (i.e. it exits its Migrate-Disable region).
2502 * This means we need the following scheme:
2506 * migrate_disable();
2508 * set_cpus_allowed_ptr(P0, [1]);
2512 * __set_cpus_allowed_ptr();
2513 * <wakes local stopper>
2514 * `--> <woken on migration completion>
2516 * Now the fun stuff: there may be several P1-like tasks, i.e. multiple
2517 * concurrent set_cpus_allowed_ptr(P0, [*]) calls. CPU affinity changes of any
2518 * task p are serialized by p->pi_lock, which we can leverage: the one that
2519 * should come into effect at the end of the Migrate-Disable region is the last
2520 * one. This means we only need to track a single cpumask (i.e. p->cpus_mask),
2521 * but we still need to properly signal those waiting tasks at the appropriate
2524 * This is implemented using struct set_affinity_pending. The first
2525 * __set_cpus_allowed_ptr() caller within a given Migrate-Disable region will
2526 * setup an instance of that struct and install it on the targeted task_struct.
2527 * Any and all further callers will reuse that instance. Those then wait for
2528 * a completion signaled at the tail of the CPU stopper callback (1), triggered
2529 * on the end of the Migrate-Disable region (i.e. outermost migrate_enable()).
2532 * (1) In the cases covered above. There is one more where the completion is
2533 * signaled within affine_move_task() itself: when a subsequent affinity request
2534 * occurs after the stopper bailed out due to the targeted task still being
2535 * Migrate-Disable. Consider:
2537 * Initial conditions: P0->cpus_mask = [0, 1]
2541 * migrate_disable();
2543 * set_cpus_allowed_ptr(P0, [1]);
2546 * migration_cpu_stop()
2547 * is_migration_disabled()
2549 * set_cpus_allowed_ptr(P0, [0, 1]);
2550 * <signal completion>
2553 * Note that the above is safe vs a concurrent migrate_enable(), as any
2554 * pending affinity completion is preceded by an uninstallation of
2555 * p->migration_pending done with p->pi_lock held.
2557 static int affine_move_task(struct rq *rq, struct task_struct *p, struct rq_flags *rf,
2558 int dest_cpu, unsigned int flags)
2560 struct set_affinity_pending my_pending = { }, *pending = NULL;
2561 bool stop_pending, complete = false;
2563 /* Can the task run on the task's current CPU? If so, we're done */
2564 if (cpumask_test_cpu(task_cpu(p), &p->cpus_mask)) {
2565 struct task_struct *push_task = NULL;
2567 if ((flags & SCA_MIGRATE_ENABLE) &&
2568 (p->migration_flags & MDF_PUSH) && !rq->push_busy) {
2569 rq->push_busy = true;
2570 push_task = get_task_struct(p);
2574 * If there are pending waiters, but no pending stop_work,
2575 * then complete now.
2577 pending = p->migration_pending;
2578 if (pending && !pending->stop_pending) {
2579 p->migration_pending = NULL;
2583 task_rq_unlock(rq, p, rf);
2586 stop_one_cpu_nowait(rq->cpu, push_cpu_stop,
2591 complete_all(&pending->done);
2596 if (!(flags & SCA_MIGRATE_ENABLE)) {
2597 /* serialized by p->pi_lock */
2598 if (!p->migration_pending) {
2599 /* Install the request */
2600 refcount_set(&my_pending.refs, 1);
2601 init_completion(&my_pending.done);
2602 my_pending.arg = (struct migration_arg) {
2604 .dest_cpu = dest_cpu,
2605 .pending = &my_pending,
2608 p->migration_pending = &my_pending;
2610 pending = p->migration_pending;
2611 refcount_inc(&pending->refs);
2613 * Affinity has changed, but we've already installed a
2614 * pending. migration_cpu_stop() *must* see this, else
2615 * we risk a completion of the pending despite having a
2616 * task on a disallowed CPU.
2618 * Serialized by p->pi_lock, so this is safe.
2620 pending->arg.dest_cpu = dest_cpu;
2623 pending = p->migration_pending;
2625 * - !MIGRATE_ENABLE:
2626 * we'll have installed a pending if there wasn't one already.
2629 * we're here because the current CPU isn't matching anymore,
2630 * the only way that can happen is because of a concurrent
2631 * set_cpus_allowed_ptr() call, which should then still be
2632 * pending completion.
2634 * Either way, we really should have a @pending here.
2636 if (WARN_ON_ONCE(!pending)) {
2637 task_rq_unlock(rq, p, rf);
2641 if (task_running(rq, p) || p->state == TASK_WAKING) {
2643 * MIGRATE_ENABLE gets here because 'p == current', but for
2644 * anything else we cannot do is_migration_disabled(), punt
2645 * and have the stopper function handle it all race-free.
2647 stop_pending = pending->stop_pending;
2649 pending->stop_pending = true;
2651 if (flags & SCA_MIGRATE_ENABLE)
2652 p->migration_flags &= ~MDF_PUSH;
2654 task_rq_unlock(rq, p, rf);
2656 if (!stop_pending) {
2657 stop_one_cpu_nowait(cpu_of(rq), migration_cpu_stop,
2658 &pending->arg, &pending->stop_work);
2661 if (flags & SCA_MIGRATE_ENABLE)
2665 if (!is_migration_disabled(p)) {
2666 if (task_on_rq_queued(p))
2667 rq = move_queued_task(rq, rf, p, dest_cpu);
2669 if (!pending->stop_pending) {
2670 p->migration_pending = NULL;
2674 task_rq_unlock(rq, p, rf);
2677 complete_all(&pending->done);
2680 wait_for_completion(&pending->done);
2682 if (refcount_dec_and_test(&pending->refs))
2683 wake_up_var(&pending->refs); /* No UaF, just an address */
2686 * Block the original owner of &pending until all subsequent callers
2687 * have seen the completion and decremented the refcount
2689 wait_var_event(&my_pending.refs, !refcount_read(&my_pending.refs));
2692 WARN_ON_ONCE(my_pending.stop_pending);
2698 * Change a given task's CPU affinity. Migrate the thread to a
2699 * proper CPU and schedule it away if the CPU it's executing on
2700 * is removed from the allowed bitmask.
2702 * NOTE: the caller must have a valid reference to the task, the
2703 * task must not exit() & deallocate itself prematurely. The
2704 * call is not atomic; no spinlocks may be held.
2706 static int __set_cpus_allowed_ptr(struct task_struct *p,
2707 const struct cpumask *new_mask,
2710 const struct cpumask *cpu_valid_mask = cpu_active_mask;
2711 unsigned int dest_cpu;
2716 rq = task_rq_lock(p, &rf);
2717 update_rq_clock(rq);
2719 if (p->flags & PF_KTHREAD || is_migration_disabled(p)) {
2721 * Kernel threads are allowed on online && !active CPUs,
2722 * however, during cpu-hot-unplug, even these might get pushed
2723 * away if not KTHREAD_IS_PER_CPU.
2725 * Specifically, migration_disabled() tasks must not fail the
2726 * cpumask_any_and_distribute() pick below, esp. so on
2727 * SCA_MIGRATE_ENABLE, otherwise we'll not call
2728 * set_cpus_allowed_common() and actually reset p->cpus_ptr.
2730 cpu_valid_mask = cpu_online_mask;
2734 * Must re-check here, to close a race against __kthread_bind(),
2735 * sched_setaffinity() is not guaranteed to observe the flag.
2737 if ((flags & SCA_CHECK) && (p->flags & PF_NO_SETAFFINITY)) {
2742 if (!(flags & SCA_MIGRATE_ENABLE)) {
2743 if (cpumask_equal(&p->cpus_mask, new_mask))
2746 if (WARN_ON_ONCE(p == current &&
2747 is_migration_disabled(p) &&
2748 !cpumask_test_cpu(task_cpu(p), new_mask))) {
2755 * Picking a ~random cpu helps in cases where we are changing affinity
2756 * for groups of tasks (ie. cpuset), so that load balancing is not
2757 * immediately required to distribute the tasks within their new mask.
2759 dest_cpu = cpumask_any_and_distribute(cpu_valid_mask, new_mask);
2760 if (dest_cpu >= nr_cpu_ids) {
2765 __do_set_cpus_allowed(p, new_mask, flags);
2767 return affine_move_task(rq, p, &rf, dest_cpu, flags);
2770 task_rq_unlock(rq, p, &rf);
2775 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
2777 return __set_cpus_allowed_ptr(p, new_mask, 0);
2779 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
2781 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
2783 #ifdef CONFIG_SCHED_DEBUG
2785 * We should never call set_task_cpu() on a blocked task,
2786 * ttwu() will sort out the placement.
2788 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
2792 * Migrating fair class task must have p->on_rq = TASK_ON_RQ_MIGRATING,
2793 * because schedstat_wait_{start,end} rebase migrating task's wait_start
2794 * time relying on p->on_rq.
2796 WARN_ON_ONCE(p->state == TASK_RUNNING &&
2797 p->sched_class == &fair_sched_class &&
2798 (p->on_rq && !task_on_rq_migrating(p)));
2800 #ifdef CONFIG_LOCKDEP
2802 * The caller should hold either p->pi_lock or rq->lock, when changing
2803 * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks.
2805 * sched_move_task() holds both and thus holding either pins the cgroup,
2808 * Furthermore, all task_rq users should acquire both locks, see
2811 WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) ||
2812 lockdep_is_held(__rq_lockp(task_rq(p)))));
2815 * Clearly, migrating tasks to offline CPUs is a fairly daft thing.
2817 WARN_ON_ONCE(!cpu_online(new_cpu));
2819 WARN_ON_ONCE(is_migration_disabled(p));
2822 trace_sched_migrate_task(p, new_cpu);
2824 if (task_cpu(p) != new_cpu) {
2825 if (p->sched_class->migrate_task_rq)
2826 p->sched_class->migrate_task_rq(p, new_cpu);
2827 p->se.nr_migrations++;
2829 perf_event_task_migrate(p);
2832 __set_task_cpu(p, new_cpu);
2835 #ifdef CONFIG_NUMA_BALANCING
2836 static void __migrate_swap_task(struct task_struct *p, int cpu)
2838 if (task_on_rq_queued(p)) {
2839 struct rq *src_rq, *dst_rq;
2840 struct rq_flags srf, drf;
2842 src_rq = task_rq(p);
2843 dst_rq = cpu_rq(cpu);
2845 rq_pin_lock(src_rq, &srf);
2846 rq_pin_lock(dst_rq, &drf);
2848 deactivate_task(src_rq, p, 0);
2849 set_task_cpu(p, cpu);
2850 activate_task(dst_rq, p, 0);
2851 check_preempt_curr(dst_rq, p, 0);
2853 rq_unpin_lock(dst_rq, &drf);
2854 rq_unpin_lock(src_rq, &srf);
2858 * Task isn't running anymore; make it appear like we migrated
2859 * it before it went to sleep. This means on wakeup we make the
2860 * previous CPU our target instead of where it really is.
2866 struct migration_swap_arg {
2867 struct task_struct *src_task, *dst_task;
2868 int src_cpu, dst_cpu;
2871 static int migrate_swap_stop(void *data)
2873 struct migration_swap_arg *arg = data;
2874 struct rq *src_rq, *dst_rq;
2877 if (!cpu_active(arg->src_cpu) || !cpu_active(arg->dst_cpu))
2880 src_rq = cpu_rq(arg->src_cpu);
2881 dst_rq = cpu_rq(arg->dst_cpu);
2883 double_raw_lock(&arg->src_task->pi_lock,
2884 &arg->dst_task->pi_lock);
2885 double_rq_lock(src_rq, dst_rq);
2887 if (task_cpu(arg->dst_task) != arg->dst_cpu)
2890 if (task_cpu(arg->src_task) != arg->src_cpu)
2893 if (!cpumask_test_cpu(arg->dst_cpu, arg->src_task->cpus_ptr))
2896 if (!cpumask_test_cpu(arg->src_cpu, arg->dst_task->cpus_ptr))
2899 __migrate_swap_task(arg->src_task, arg->dst_cpu);
2900 __migrate_swap_task(arg->dst_task, arg->src_cpu);
2905 double_rq_unlock(src_rq, dst_rq);
2906 raw_spin_unlock(&arg->dst_task->pi_lock);
2907 raw_spin_unlock(&arg->src_task->pi_lock);
2913 * Cross migrate two tasks
2915 int migrate_swap(struct task_struct *cur, struct task_struct *p,
2916 int target_cpu, int curr_cpu)
2918 struct migration_swap_arg arg;
2921 arg = (struct migration_swap_arg){
2923 .src_cpu = curr_cpu,
2925 .dst_cpu = target_cpu,
2928 if (arg.src_cpu == arg.dst_cpu)
2932 * These three tests are all lockless; this is OK since all of them
2933 * will be re-checked with proper locks held further down the line.
2935 if (!cpu_active(arg.src_cpu) || !cpu_active(arg.dst_cpu))
2938 if (!cpumask_test_cpu(arg.dst_cpu, arg.src_task->cpus_ptr))
2941 if (!cpumask_test_cpu(arg.src_cpu, arg.dst_task->cpus_ptr))
2944 trace_sched_swap_numa(cur, arg.src_cpu, p, arg.dst_cpu);
2945 ret = stop_two_cpus(arg.dst_cpu, arg.src_cpu, migrate_swap_stop, &arg);
2950 #endif /* CONFIG_NUMA_BALANCING */
2953 * wait_task_inactive - wait for a thread to unschedule.
2955 * If @match_state is nonzero, it's the @p->state value just checked and
2956 * not expected to change. If it changes, i.e. @p might have woken up,
2957 * then return zero. When we succeed in waiting for @p to be off its CPU,
2958 * we return a positive number (its total switch count). If a second call
2959 * a short while later returns the same number, the caller can be sure that
2960 * @p has remained unscheduled the whole time.
2962 * The caller must ensure that the task *will* unschedule sometime soon,
2963 * else this function might spin for a *long* time. This function can't
2964 * be called with interrupts off, or it may introduce deadlock with
2965 * smp_call_function() if an IPI is sent by the same process we are
2966 * waiting to become inactive.
2968 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2970 int running, queued;
2977 * We do the initial early heuristics without holding
2978 * any task-queue locks at all. We'll only try to get
2979 * the runqueue lock when things look like they will
2985 * If the task is actively running on another CPU
2986 * still, just relax and busy-wait without holding
2989 * NOTE! Since we don't hold any locks, it's not
2990 * even sure that "rq" stays as the right runqueue!
2991 * But we don't care, since "task_running()" will
2992 * return false if the runqueue has changed and p
2993 * is actually now running somewhere else!
2995 while (task_running(rq, p)) {
2996 if (match_state && unlikely(p->state != match_state))
3002 * Ok, time to look more closely! We need the rq
3003 * lock now, to be *sure*. If we're wrong, we'll
3004 * just go back and repeat.
3006 rq = task_rq_lock(p, &rf);
3007 trace_sched_wait_task(p);
3008 running = task_running(rq, p);
3009 queued = task_on_rq_queued(p);
3011 if (!match_state || p->state == match_state)
3012 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
3013 task_rq_unlock(rq, p, &rf);
3016 * If it changed from the expected state, bail out now.
3018 if (unlikely(!ncsw))
3022 * Was it really running after all now that we
3023 * checked with the proper locks actually held?
3025 * Oops. Go back and try again..
3027 if (unlikely(running)) {
3033 * It's not enough that it's not actively running,
3034 * it must be off the runqueue _entirely_, and not
3037 * So if it was still runnable (but just not actively
3038 * running right now), it's preempted, and we should
3039 * yield - it could be a while.
3041 if (unlikely(queued)) {
3042 ktime_t to = NSEC_PER_SEC / HZ;
3044 set_current_state(TASK_UNINTERRUPTIBLE);
3045 schedule_hrtimeout(&to, HRTIMER_MODE_REL);
3050 * Ahh, all good. It wasn't running, and it wasn't
3051 * runnable, which means that it will never become
3052 * running in the future either. We're all done!
3061 * kick_process - kick a running thread to enter/exit the kernel
3062 * @p: the to-be-kicked thread
3064 * Cause a process which is running on another CPU to enter
3065 * kernel-mode, without any delay. (to get signals handled.)
3067 * NOTE: this function doesn't have to take the runqueue lock,
3068 * because all it wants to ensure is that the remote task enters
3069 * the kernel. If the IPI races and the task has been migrated
3070 * to another CPU then no harm is done and the purpose has been
3073 void kick_process(struct task_struct *p)
3079 if ((cpu != smp_processor_id()) && task_curr(p))
3080 smp_send_reschedule(cpu);
3083 EXPORT_SYMBOL_GPL(kick_process);
3086 * ->cpus_ptr is protected by both rq->lock and p->pi_lock
3088 * A few notes on cpu_active vs cpu_online:
3090 * - cpu_active must be a subset of cpu_online
3092 * - on CPU-up we allow per-CPU kthreads on the online && !active CPU,
3093 * see __set_cpus_allowed_ptr(). At this point the newly online
3094 * CPU isn't yet part of the sched domains, and balancing will not
3097 * - on CPU-down we clear cpu_active() to mask the sched domains and
3098 * avoid the load balancer to place new tasks on the to be removed
3099 * CPU. Existing tasks will remain running there and will be taken
3102 * This means that fallback selection must not select !active CPUs.
3103 * And can assume that any active CPU must be online. Conversely
3104 * select_task_rq() below may allow selection of !active CPUs in order
3105 * to satisfy the above rules.
3107 static int select_fallback_rq(int cpu, struct task_struct *p)
3109 int nid = cpu_to_node(cpu);
3110 const struct cpumask *nodemask = NULL;
3111 enum { cpuset, possible, fail } state = cpuset;
3115 * If the node that the CPU is on has been offlined, cpu_to_node()
3116 * will return -1. There is no CPU on the node, and we should
3117 * select the CPU on the other node.
3120 nodemask = cpumask_of_node(nid);
3122 /* Look for allowed, online CPU in same node. */
3123 for_each_cpu(dest_cpu, nodemask) {
3124 if (!cpu_active(dest_cpu))
3126 if (cpumask_test_cpu(dest_cpu, p->cpus_ptr))
3132 /* Any allowed, online CPU? */
3133 for_each_cpu(dest_cpu, p->cpus_ptr) {
3134 if (!is_cpu_allowed(p, dest_cpu))
3140 /* No more Mr. Nice Guy. */
3143 if (IS_ENABLED(CONFIG_CPUSETS)) {
3144 cpuset_cpus_allowed_fallback(p);
3151 * XXX When called from select_task_rq() we only
3152 * hold p->pi_lock and again violate locking order.
3154 * More yuck to audit.
3156 do_set_cpus_allowed(p, cpu_possible_mask);
3167 if (state != cpuset) {
3169 * Don't tell them about moving exiting tasks or
3170 * kernel threads (both mm NULL), since they never
3173 if (p->mm && printk_ratelimit()) {
3174 printk_deferred("process %d (%s) no longer affine to cpu%d\n",
3175 task_pid_nr(p), p->comm, cpu);
3183 * The caller (fork, wakeup) owns p->pi_lock, ->cpus_ptr is stable.
3186 int select_task_rq(struct task_struct *p, int cpu, int wake_flags)
3188 lockdep_assert_held(&p->pi_lock);
3190 if (p->nr_cpus_allowed > 1 && !is_migration_disabled(p))
3191 cpu = p->sched_class->select_task_rq(p, cpu, wake_flags);
3193 cpu = cpumask_any(p->cpus_ptr);
3196 * In order not to call set_task_cpu() on a blocking task we need
3197 * to rely on ttwu() to place the task on a valid ->cpus_ptr
3200 * Since this is common to all placement strategies, this lives here.
3202 * [ this allows ->select_task() to simply return task_cpu(p) and
3203 * not worry about this generic constraint ]
3205 if (unlikely(!is_cpu_allowed(p, cpu)))
3206 cpu = select_fallback_rq(task_cpu(p), p);
3211 void sched_set_stop_task(int cpu, struct task_struct *stop)
3213 static struct lock_class_key stop_pi_lock;
3214 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
3215 struct task_struct *old_stop = cpu_rq(cpu)->stop;
3219 * Make it appear like a SCHED_FIFO task, its something
3220 * userspace knows about and won't get confused about.
3222 * Also, it will make PI more or less work without too
3223 * much confusion -- but then, stop work should not
3224 * rely on PI working anyway.
3226 sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m);
3228 stop->sched_class = &stop_sched_class;
3231 * The PI code calls rt_mutex_setprio() with ->pi_lock held to
3232 * adjust the effective priority of a task. As a result,
3233 * rt_mutex_setprio() can trigger (RT) balancing operations,
3234 * which can then trigger wakeups of the stop thread to push
3235 * around the current task.
3237 * The stop task itself will never be part of the PI-chain, it
3238 * never blocks, therefore that ->pi_lock recursion is safe.
3239 * Tell lockdep about this by placing the stop->pi_lock in its
3242 lockdep_set_class(&stop->pi_lock, &stop_pi_lock);
3245 cpu_rq(cpu)->stop = stop;
3249 * Reset it back to a normal scheduling class so that
3250 * it can die in pieces.
3252 old_stop->sched_class = &rt_sched_class;
3256 #else /* CONFIG_SMP */
3258 static inline int __set_cpus_allowed_ptr(struct task_struct *p,
3259 const struct cpumask *new_mask,
3262 return set_cpus_allowed_ptr(p, new_mask);
3265 static inline void migrate_disable_switch(struct rq *rq, struct task_struct *p) { }
3267 static inline bool rq_has_pinned_tasks(struct rq *rq)
3272 #endif /* !CONFIG_SMP */
3275 ttwu_stat(struct task_struct *p, int cpu, int wake_flags)
3279 if (!schedstat_enabled())
3285 if (cpu == rq->cpu) {
3286 __schedstat_inc(rq->ttwu_local);
3287 __schedstat_inc(p->se.statistics.nr_wakeups_local);
3289 struct sched_domain *sd;
3291 __schedstat_inc(p->se.statistics.nr_wakeups_remote);
3293 for_each_domain(rq->cpu, sd) {
3294 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
3295 __schedstat_inc(sd->ttwu_wake_remote);
3302 if (wake_flags & WF_MIGRATED)
3303 __schedstat_inc(p->se.statistics.nr_wakeups_migrate);
3304 #endif /* CONFIG_SMP */
3306 __schedstat_inc(rq->ttwu_count);
3307 __schedstat_inc(p->se.statistics.nr_wakeups);
3309 if (wake_flags & WF_SYNC)
3310 __schedstat_inc(p->se.statistics.nr_wakeups_sync);
3314 * Mark the task runnable and perform wakeup-preemption.
3316 static void ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags,
3317 struct rq_flags *rf)
3319 check_preempt_curr(rq, p, wake_flags);
3320 p->state = TASK_RUNNING;
3321 trace_sched_wakeup(p);
3324 if (p->sched_class->task_woken) {
3326 * Our task @p is fully woken up and running; so it's safe to
3327 * drop the rq->lock, hereafter rq is only used for statistics.
3329 rq_unpin_lock(rq, rf);
3330 p->sched_class->task_woken(rq, p);
3331 rq_repin_lock(rq, rf);
3334 if (rq->idle_stamp) {
3335 u64 delta = rq_clock(rq) - rq->idle_stamp;
3336 u64 max = 2*rq->max_idle_balance_cost;
3338 update_avg(&rq->avg_idle, delta);
3340 if (rq->avg_idle > max)
3349 ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags,
3350 struct rq_flags *rf)
3352 int en_flags = ENQUEUE_WAKEUP | ENQUEUE_NOCLOCK;
3354 lockdep_assert_rq_held(rq);
3356 if (p->sched_contributes_to_load)
3357 rq->nr_uninterruptible--;
3360 if (wake_flags & WF_MIGRATED)
3361 en_flags |= ENQUEUE_MIGRATED;
3365 delayacct_blkio_end(p);
3366 atomic_dec(&task_rq(p)->nr_iowait);
3369 activate_task(rq, p, en_flags);
3370 ttwu_do_wakeup(rq, p, wake_flags, rf);
3374 * Consider @p being inside a wait loop:
3377 * set_current_state(TASK_UNINTERRUPTIBLE);
3384 * __set_current_state(TASK_RUNNING);
3386 * between set_current_state() and schedule(). In this case @p is still
3387 * runnable, so all that needs doing is change p->state back to TASK_RUNNING in
3390 * By taking task_rq(p)->lock we serialize against schedule(), if @p->on_rq
3391 * then schedule() must still happen and p->state can be changed to
3392 * TASK_RUNNING. Otherwise we lost the race, schedule() has happened, and we
3393 * need to do a full wakeup with enqueue.
3395 * Returns: %true when the wakeup is done,
3398 static int ttwu_runnable(struct task_struct *p, int wake_flags)
3404 rq = __task_rq_lock(p, &rf);
3405 if (task_on_rq_queued(p)) {
3406 /* check_preempt_curr() may use rq clock */
3407 update_rq_clock(rq);
3408 ttwu_do_wakeup(rq, p, wake_flags, &rf);
3411 __task_rq_unlock(rq, &rf);
3417 void sched_ttwu_pending(void *arg)
3419 struct llist_node *llist = arg;
3420 struct rq *rq = this_rq();
3421 struct task_struct *p, *t;
3428 * rq::ttwu_pending racy indication of out-standing wakeups.
3429 * Races such that false-negatives are possible, since they
3430 * are shorter lived that false-positives would be.
3432 WRITE_ONCE(rq->ttwu_pending, 0);
3434 rq_lock_irqsave(rq, &rf);
3435 update_rq_clock(rq);
3437 llist_for_each_entry_safe(p, t, llist, wake_entry.llist) {
3438 if (WARN_ON_ONCE(p->on_cpu))
3439 smp_cond_load_acquire(&p->on_cpu, !VAL);
3441 if (WARN_ON_ONCE(task_cpu(p) != cpu_of(rq)))
3442 set_task_cpu(p, cpu_of(rq));
3444 ttwu_do_activate(rq, p, p->sched_remote_wakeup ? WF_MIGRATED : 0, &rf);
3447 rq_unlock_irqrestore(rq, &rf);
3450 void send_call_function_single_ipi(int cpu)
3452 struct rq *rq = cpu_rq(cpu);
3454 if (!set_nr_if_polling(rq->idle))
3455 arch_send_call_function_single_ipi(cpu);
3457 trace_sched_wake_idle_without_ipi(cpu);
3461 * Queue a task on the target CPUs wake_list and wake the CPU via IPI if
3462 * necessary. The wakee CPU on receipt of the IPI will queue the task
3463 * via sched_ttwu_wakeup() for activation so the wakee incurs the cost
3464 * of the wakeup instead of the waker.
3466 static void __ttwu_queue_wakelist(struct task_struct *p, int cpu, int wake_flags)
3468 struct rq *rq = cpu_rq(cpu);
3470 p->sched_remote_wakeup = !!(wake_flags & WF_MIGRATED);
3472 WRITE_ONCE(rq->ttwu_pending, 1);
3473 __smp_call_single_queue(cpu, &p->wake_entry.llist);
3476 void wake_up_if_idle(int cpu)
3478 struct rq *rq = cpu_rq(cpu);
3483 if (!is_idle_task(rcu_dereference(rq->curr)))
3486 if (set_nr_if_polling(rq->idle)) {
3487 trace_sched_wake_idle_without_ipi(cpu);
3489 rq_lock_irqsave(rq, &rf);
3490 if (is_idle_task(rq->curr))
3491 smp_send_reschedule(cpu);
3492 /* Else CPU is not idle, do nothing here: */
3493 rq_unlock_irqrestore(rq, &rf);
3500 bool cpus_share_cache(int this_cpu, int that_cpu)
3502 return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu);
3505 static inline bool ttwu_queue_cond(int cpu, int wake_flags)
3508 * Do not complicate things with the async wake_list while the CPU is
3511 if (!cpu_active(cpu))
3515 * If the CPU does not share cache, then queue the task on the
3516 * remote rqs wakelist to avoid accessing remote data.
3518 if (!cpus_share_cache(smp_processor_id(), cpu))
3522 * If the task is descheduling and the only running task on the
3523 * CPU then use the wakelist to offload the task activation to
3524 * the soon-to-be-idle CPU as the current CPU is likely busy.
3525 * nr_running is checked to avoid unnecessary task stacking.
3527 if ((wake_flags & WF_ON_CPU) && cpu_rq(cpu)->nr_running <= 1)
3533 static bool ttwu_queue_wakelist(struct task_struct *p, int cpu, int wake_flags)
3535 if (sched_feat(TTWU_QUEUE) && ttwu_queue_cond(cpu, wake_flags)) {
3536 if (WARN_ON_ONCE(cpu == smp_processor_id()))
3539 sched_clock_cpu(cpu); /* Sync clocks across CPUs */
3540 __ttwu_queue_wakelist(p, cpu, wake_flags);
3547 #else /* !CONFIG_SMP */
3549 static inline bool ttwu_queue_wakelist(struct task_struct *p, int cpu, int wake_flags)
3554 #endif /* CONFIG_SMP */
3556 static void ttwu_queue(struct task_struct *p, int cpu, int wake_flags)
3558 struct rq *rq = cpu_rq(cpu);
3561 if (ttwu_queue_wakelist(p, cpu, wake_flags))
3565 update_rq_clock(rq);
3566 ttwu_do_activate(rq, p, wake_flags, &rf);
3571 * Notes on Program-Order guarantees on SMP systems.
3575 * The basic program-order guarantee on SMP systems is that when a task [t]
3576 * migrates, all its activity on its old CPU [c0] happens-before any subsequent
3577 * execution on its new CPU [c1].
3579 * For migration (of runnable tasks) this is provided by the following means:
3581 * A) UNLOCK of the rq(c0)->lock scheduling out task t
3582 * B) migration for t is required to synchronize *both* rq(c0)->lock and
3583 * rq(c1)->lock (if not at the same time, then in that order).
3584 * C) LOCK of the rq(c1)->lock scheduling in task
3586 * Release/acquire chaining guarantees that B happens after A and C after B.
3587 * Note: the CPU doing B need not be c0 or c1
3596 * UNLOCK rq(0)->lock
3598 * LOCK rq(0)->lock // orders against CPU0
3600 * UNLOCK rq(0)->lock
3604 * UNLOCK rq(1)->lock
3606 * LOCK rq(1)->lock // orders against CPU2
3609 * UNLOCK rq(1)->lock
3612 * BLOCKING -- aka. SLEEP + WAKEUP
3614 * For blocking we (obviously) need to provide the same guarantee as for
3615 * migration. However the means are completely different as there is no lock
3616 * chain to provide order. Instead we do:
3618 * 1) smp_store_release(X->on_cpu, 0) -- finish_task()
3619 * 2) smp_cond_load_acquire(!X->on_cpu) -- try_to_wake_up()
3623 * CPU0 (schedule) CPU1 (try_to_wake_up) CPU2 (schedule)
3625 * LOCK rq(0)->lock LOCK X->pi_lock
3628 * smp_store_release(X->on_cpu, 0);
3630 * smp_cond_load_acquire(&X->on_cpu, !VAL);
3636 * X->state = RUNNING
3637 * UNLOCK rq(2)->lock
3639 * LOCK rq(2)->lock // orders against CPU1
3642 * UNLOCK rq(2)->lock
3645 * UNLOCK rq(0)->lock
3648 * However, for wakeups there is a second guarantee we must provide, namely we
3649 * must ensure that CONDITION=1 done by the caller can not be reordered with
3650 * accesses to the task state; see try_to_wake_up() and set_current_state().
3654 * try_to_wake_up - wake up a thread
3655 * @p: the thread to be awakened
3656 * @state: the mask of task states that can be woken
3657 * @wake_flags: wake modifier flags (WF_*)
3659 * Conceptually does:
3661 * If (@state & @p->state) @p->state = TASK_RUNNING.
3663 * If the task was not queued/runnable, also place it back on a runqueue.
3665 * This function is atomic against schedule() which would dequeue the task.
3667 * It issues a full memory barrier before accessing @p->state, see the comment
3668 * with set_current_state().
3670 * Uses p->pi_lock to serialize against concurrent wake-ups.
3672 * Relies on p->pi_lock stabilizing:
3675 * - p->sched_task_group
3676 * in order to do migration, see its use of select_task_rq()/set_task_cpu().
3678 * Tries really hard to only take one task_rq(p)->lock for performance.
3679 * Takes rq->lock in:
3680 * - ttwu_runnable() -- old rq, unavoidable, see comment there;
3681 * - ttwu_queue() -- new rq, for enqueue of the task;
3682 * - psi_ttwu_dequeue() -- much sadness :-( accounting will kill us.
3684 * As a consequence we race really badly with just about everything. See the
3685 * many memory barriers and their comments for details.
3687 * Return: %true if @p->state changes (an actual wakeup was done),
3691 try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags)
3693 unsigned long flags;
3694 int cpu, success = 0;
3699 * We're waking current, this means 'p->on_rq' and 'task_cpu(p)
3700 * == smp_processor_id()'. Together this means we can special
3701 * case the whole 'p->on_rq && ttwu_runnable()' case below
3702 * without taking any locks.
3705 * - we rely on Program-Order guarantees for all the ordering,
3706 * - we're serialized against set_special_state() by virtue of
3707 * it disabling IRQs (this allows not taking ->pi_lock).
3709 if (!(p->state & state))
3713 trace_sched_waking(p);
3714 p->state = TASK_RUNNING;
3715 trace_sched_wakeup(p);
3720 * If we are going to wake up a thread waiting for CONDITION we
3721 * need to ensure that CONDITION=1 done by the caller can not be
3722 * reordered with p->state check below. This pairs with smp_store_mb()
3723 * in set_current_state() that the waiting thread does.
3725 raw_spin_lock_irqsave(&p->pi_lock, flags);
3726 smp_mb__after_spinlock();
3727 if (!(p->state & state))
3730 trace_sched_waking(p);
3732 /* We're going to change ->state: */
3736 * Ensure we load p->on_rq _after_ p->state, otherwise it would
3737 * be possible to, falsely, observe p->on_rq == 0 and get stuck
3738 * in smp_cond_load_acquire() below.
3740 * sched_ttwu_pending() try_to_wake_up()
3741 * STORE p->on_rq = 1 LOAD p->state
3744 * __schedule() (switch to task 'p')
3745 * LOCK rq->lock smp_rmb();
3746 * smp_mb__after_spinlock();
3750 * STORE p->state = UNINTERRUPTIBLE LOAD p->on_rq
3752 * Pairs with the LOCK+smp_mb__after_spinlock() on rq->lock in
3753 * __schedule(). See the comment for smp_mb__after_spinlock().
3755 * A similar smb_rmb() lives in try_invoke_on_locked_down_task().
3758 if (READ_ONCE(p->on_rq) && ttwu_runnable(p, wake_flags))
3763 * Ensure we load p->on_cpu _after_ p->on_rq, otherwise it would be
3764 * possible to, falsely, observe p->on_cpu == 0.
3766 * One must be running (->on_cpu == 1) in order to remove oneself
3767 * from the runqueue.
3769 * __schedule() (switch to task 'p') try_to_wake_up()
3770 * STORE p->on_cpu = 1 LOAD p->on_rq
3773 * __schedule() (put 'p' to sleep)
3774 * LOCK rq->lock smp_rmb();
3775 * smp_mb__after_spinlock();
3776 * STORE p->on_rq = 0 LOAD p->on_cpu
3778 * Pairs with the LOCK+smp_mb__after_spinlock() on rq->lock in
3779 * __schedule(). See the comment for smp_mb__after_spinlock().
3781 * Form a control-dep-acquire with p->on_rq == 0 above, to ensure
3782 * schedule()'s deactivate_task() has 'happened' and p will no longer
3783 * care about it's own p->state. See the comment in __schedule().
3785 smp_acquire__after_ctrl_dep();
3788 * We're doing the wakeup (@success == 1), they did a dequeue (p->on_rq
3789 * == 0), which means we need to do an enqueue, change p->state to
3790 * TASK_WAKING such that we can unlock p->pi_lock before doing the
3791 * enqueue, such as ttwu_queue_wakelist().
3793 p->state = TASK_WAKING;
3796 * If the owning (remote) CPU is still in the middle of schedule() with
3797 * this task as prev, considering queueing p on the remote CPUs wake_list
3798 * which potentially sends an IPI instead of spinning on p->on_cpu to
3799 * let the waker make forward progress. This is safe because IRQs are
3800 * disabled and the IPI will deliver after on_cpu is cleared.
3802 * Ensure we load task_cpu(p) after p->on_cpu:
3804 * set_task_cpu(p, cpu);
3805 * STORE p->cpu = @cpu
3806 * __schedule() (switch to task 'p')
3808 * smp_mb__after_spin_lock() smp_cond_load_acquire(&p->on_cpu)
3809 * STORE p->on_cpu = 1 LOAD p->cpu
3811 * to ensure we observe the correct CPU on which the task is currently
3814 if (smp_load_acquire(&p->on_cpu) &&
3815 ttwu_queue_wakelist(p, task_cpu(p), wake_flags | WF_ON_CPU))
3819 * If the owning (remote) CPU is still in the middle of schedule() with
3820 * this task as prev, wait until it's done referencing the task.
3822 * Pairs with the smp_store_release() in finish_task().
3824 * This ensures that tasks getting woken will be fully ordered against
3825 * their previous state and preserve Program Order.
3827 smp_cond_load_acquire(&p->on_cpu, !VAL);
3829 cpu = select_task_rq(p, p->wake_cpu, wake_flags | WF_TTWU);
3830 if (task_cpu(p) != cpu) {
3832 delayacct_blkio_end(p);
3833 atomic_dec(&task_rq(p)->nr_iowait);
3836 wake_flags |= WF_MIGRATED;
3837 psi_ttwu_dequeue(p);
3838 set_task_cpu(p, cpu);
3842 #endif /* CONFIG_SMP */
3844 ttwu_queue(p, cpu, wake_flags);
3846 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
3849 ttwu_stat(p, task_cpu(p), wake_flags);
3856 * try_invoke_on_locked_down_task - Invoke a function on task in fixed state
3857 * @p: Process for which the function is to be invoked, can be @current.
3858 * @func: Function to invoke.
3859 * @arg: Argument to function.
3861 * If the specified task can be quickly locked into a definite state
3862 * (either sleeping or on a given runqueue), arrange to keep it in that
3863 * state while invoking @func(@arg). This function can use ->on_rq and
3864 * task_curr() to work out what the state is, if required. Given that
3865 * @func can be invoked with a runqueue lock held, it had better be quite
3869 * @false if the task slipped out from under the locks.
3870 * @true if the task was locked onto a runqueue or is sleeping.
3871 * However, @func can override this by returning @false.
3873 bool try_invoke_on_locked_down_task(struct task_struct *p, bool (*func)(struct task_struct *t, void *arg), void *arg)
3879 raw_spin_lock_irqsave(&p->pi_lock, rf.flags);
3881 rq = __task_rq_lock(p, &rf);
3882 if (task_rq(p) == rq)
3891 smp_rmb(); // See smp_rmb() comment in try_to_wake_up().
3896 raw_spin_unlock_irqrestore(&p->pi_lock, rf.flags);
3901 * wake_up_process - Wake up a specific process
3902 * @p: The process to be woken up.
3904 * Attempt to wake up the nominated process and move it to the set of runnable
3907 * Return: 1 if the process was woken up, 0 if it was already running.
3909 * This function executes a full memory barrier before accessing the task state.
3911 int wake_up_process(struct task_struct *p)
3913 return try_to_wake_up(p, TASK_NORMAL, 0);
3915 EXPORT_SYMBOL(wake_up_process);
3917 int wake_up_state(struct task_struct *p, unsigned int state)
3919 return try_to_wake_up(p, state, 0);
3923 * Perform scheduler related setup for a newly forked process p.
3924 * p is forked by current.
3926 * __sched_fork() is basic setup used by init_idle() too:
3928 static void __sched_fork(unsigned long clone_flags, struct task_struct *p)
3933 p->se.exec_start = 0;
3934 p->se.sum_exec_runtime = 0;
3935 p->se.prev_sum_exec_runtime = 0;
3936 p->se.nr_migrations = 0;
3938 INIT_LIST_HEAD(&p->se.group_node);
3940 #ifdef CONFIG_FAIR_GROUP_SCHED
3941 p->se.cfs_rq = NULL;
3944 #ifdef CONFIG_SCHEDSTATS
3945 /* Even if schedstat is disabled, there should not be garbage */
3946 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
3949 RB_CLEAR_NODE(&p->dl.rb_node);
3950 init_dl_task_timer(&p->dl);
3951 init_dl_inactive_task_timer(&p->dl);
3952 __dl_clear_params(p);
3954 INIT_LIST_HEAD(&p->rt.run_list);
3956 p->rt.time_slice = sched_rr_timeslice;
3960 #ifdef CONFIG_PREEMPT_NOTIFIERS
3961 INIT_HLIST_HEAD(&p->preempt_notifiers);
3964 #ifdef CONFIG_COMPACTION
3965 p->capture_control = NULL;
3967 init_numa_balancing(clone_flags, p);
3969 p->wake_entry.u_flags = CSD_TYPE_TTWU;
3970 p->migration_pending = NULL;
3974 DEFINE_STATIC_KEY_FALSE(sched_numa_balancing);
3976 #ifdef CONFIG_NUMA_BALANCING
3978 void set_numabalancing_state(bool enabled)
3981 static_branch_enable(&sched_numa_balancing);
3983 static_branch_disable(&sched_numa_balancing);
3986 #ifdef CONFIG_PROC_SYSCTL
3987 int sysctl_numa_balancing(struct ctl_table *table, int write,
3988 void *buffer, size_t *lenp, loff_t *ppos)
3992 int state = static_branch_likely(&sched_numa_balancing);
3994 if (write && !capable(CAP_SYS_ADMIN))
3999 err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
4003 set_numabalancing_state(state);
4009 #ifdef CONFIG_SCHEDSTATS
4011 DEFINE_STATIC_KEY_FALSE(sched_schedstats);
4013 static void set_schedstats(bool enabled)
4016 static_branch_enable(&sched_schedstats);
4018 static_branch_disable(&sched_schedstats);
4021 void force_schedstat_enabled(void)
4023 if (!schedstat_enabled()) {
4024 pr_info("kernel profiling enabled schedstats, disable via kernel.sched_schedstats.\n");
4025 static_branch_enable(&sched_schedstats);
4029 static int __init setup_schedstats(char *str)
4035 if (!strcmp(str, "enable")) {
4036 set_schedstats(true);
4038 } else if (!strcmp(str, "disable")) {
4039 set_schedstats(false);
4044 pr_warn("Unable to parse schedstats=\n");
4048 __setup("schedstats=", setup_schedstats);
4050 #ifdef CONFIG_PROC_SYSCTL
4051 int sysctl_schedstats(struct ctl_table *table, int write, void *buffer,
4052 size_t *lenp, loff_t *ppos)
4056 int state = static_branch_likely(&sched_schedstats);
4058 if (write && !capable(CAP_SYS_ADMIN))
4063 err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos);
4067 set_schedstats(state);
4070 #endif /* CONFIG_PROC_SYSCTL */
4071 #endif /* CONFIG_SCHEDSTATS */
4074 * fork()/clone()-time setup:
4076 int sched_fork(unsigned long clone_flags, struct task_struct *p)
4078 unsigned long flags;
4080 __sched_fork(clone_flags, p);
4082 * We mark the process as NEW here. This guarantees that
4083 * nobody will actually run it, and a signal or other external
4084 * event cannot wake it up and insert it on the runqueue either.
4086 p->state = TASK_NEW;
4089 * Make sure we do not leak PI boosting priority to the child.
4091 p->prio = current->normal_prio;
4096 * Revert to default priority/policy on fork if requested.
4098 if (unlikely(p->sched_reset_on_fork)) {
4099 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
4100 p->policy = SCHED_NORMAL;
4101 p->static_prio = NICE_TO_PRIO(0);
4103 } else if (PRIO_TO_NICE(p->static_prio) < 0)
4104 p->static_prio = NICE_TO_PRIO(0);
4106 p->prio = p->normal_prio = __normal_prio(p);
4107 set_load_weight(p, false);
4110 * We don't need the reset flag anymore after the fork. It has
4111 * fulfilled its duty:
4113 p->sched_reset_on_fork = 0;
4116 if (dl_prio(p->prio))
4118 else if (rt_prio(p->prio))
4119 p->sched_class = &rt_sched_class;
4121 p->sched_class = &fair_sched_class;
4123 init_entity_runnable_average(&p->se);
4126 * The child is not yet in the pid-hash so no cgroup attach races,
4127 * and the cgroup is pinned to this child due to cgroup_fork()
4128 * is ran before sched_fork().
4130 * Silence PROVE_RCU.
4132 raw_spin_lock_irqsave(&p->pi_lock, flags);
4135 * We're setting the CPU for the first time, we don't migrate,
4136 * so use __set_task_cpu().
4138 __set_task_cpu(p, smp_processor_id());
4139 if (p->sched_class->task_fork)
4140 p->sched_class->task_fork(p);
4141 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4143 #ifdef CONFIG_SCHED_INFO
4144 if (likely(sched_info_on()))
4145 memset(&p->sched_info, 0, sizeof(p->sched_info));
4147 #if defined(CONFIG_SMP)
4150 init_task_preempt_count(p);
4152 plist_node_init(&p->pushable_tasks, MAX_PRIO);
4153 RB_CLEAR_NODE(&p->pushable_dl_tasks);
4158 void sched_post_fork(struct task_struct *p)
4160 uclamp_post_fork(p);
4163 unsigned long to_ratio(u64 period, u64 runtime)
4165 if (runtime == RUNTIME_INF)
4169 * Doing this here saves a lot of checks in all
4170 * the calling paths, and returning zero seems
4171 * safe for them anyway.
4176 return div64_u64(runtime << BW_SHIFT, period);
4180 * wake_up_new_task - wake up a newly created task for the first time.
4182 * This function will do some initial scheduler statistics housekeeping
4183 * that must be done for every newly created context, then puts the task
4184 * on the runqueue and wakes it.
4186 void wake_up_new_task(struct task_struct *p)
4191 raw_spin_lock_irqsave(&p->pi_lock, rf.flags);
4192 p->state = TASK_RUNNING;
4195 * Fork balancing, do it here and not earlier because:
4196 * - cpus_ptr can change in the fork path
4197 * - any previously selected CPU might disappear through hotplug
4199 * Use __set_task_cpu() to avoid calling sched_class::migrate_task_rq,
4200 * as we're not fully set-up yet.
4202 p->recent_used_cpu = task_cpu(p);
4204 __set_task_cpu(p, select_task_rq(p, task_cpu(p), WF_FORK));
4206 rq = __task_rq_lock(p, &rf);
4207 update_rq_clock(rq);
4208 post_init_entity_util_avg(p);
4210 activate_task(rq, p, ENQUEUE_NOCLOCK);
4211 trace_sched_wakeup_new(p);
4212 check_preempt_curr(rq, p, WF_FORK);
4214 if (p->sched_class->task_woken) {
4216 * Nothing relies on rq->lock after this, so it's fine to
4219 rq_unpin_lock(rq, &rf);
4220 p->sched_class->task_woken(rq, p);
4221 rq_repin_lock(rq, &rf);
4224 task_rq_unlock(rq, p, &rf);
4227 #ifdef CONFIG_PREEMPT_NOTIFIERS
4229 static DEFINE_STATIC_KEY_FALSE(preempt_notifier_key);
4231 void preempt_notifier_inc(void)
4233 static_branch_inc(&preempt_notifier_key);
4235 EXPORT_SYMBOL_GPL(preempt_notifier_inc);
4237 void preempt_notifier_dec(void)
4239 static_branch_dec(&preempt_notifier_key);
4241 EXPORT_SYMBOL_GPL(preempt_notifier_dec);
4244 * preempt_notifier_register - tell me when current is being preempted & rescheduled
4245 * @notifier: notifier struct to register
4247 void preempt_notifier_register(struct preempt_notifier *notifier)
4249 if (!static_branch_unlikely(&preempt_notifier_key))
4250 WARN(1, "registering preempt_notifier while notifiers disabled\n");
4252 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
4254 EXPORT_SYMBOL_GPL(preempt_notifier_register);
4257 * preempt_notifier_unregister - no longer interested in preemption notifications
4258 * @notifier: notifier struct to unregister
4260 * This is *not* safe to call from within a preemption notifier.
4262 void preempt_notifier_unregister(struct preempt_notifier *notifier)
4264 hlist_del(¬ifier->link);
4266 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
4268 static void __fire_sched_in_preempt_notifiers(struct task_struct *curr)
4270 struct preempt_notifier *notifier;
4272 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
4273 notifier->ops->sched_in(notifier, raw_smp_processor_id());
4276 static __always_inline void fire_sched_in_preempt_notifiers(struct task_struct *curr)
4278 if (static_branch_unlikely(&preempt_notifier_key))
4279 __fire_sched_in_preempt_notifiers(curr);
4283 __fire_sched_out_preempt_notifiers(struct task_struct *curr,
4284 struct task_struct *next)
4286 struct preempt_notifier *notifier;
4288 hlist_for_each_entry(notifier, &curr->preempt_notifiers, link)
4289 notifier->ops->sched_out(notifier, next);
4292 static __always_inline void
4293 fire_sched_out_preempt_notifiers(struct task_struct *curr,
4294 struct task_struct *next)
4296 if (static_branch_unlikely(&preempt_notifier_key))
4297 __fire_sched_out_preempt_notifiers(curr, next);
4300 #else /* !CONFIG_PREEMPT_NOTIFIERS */
4302 static inline void fire_sched_in_preempt_notifiers(struct task_struct *curr)
4307 fire_sched_out_preempt_notifiers(struct task_struct *curr,
4308 struct task_struct *next)
4312 #endif /* CONFIG_PREEMPT_NOTIFIERS */
4314 static inline void prepare_task(struct task_struct *next)
4318 * Claim the task as running, we do this before switching to it
4319 * such that any running task will have this set.
4321 * See the ttwu() WF_ON_CPU case and its ordering comment.
4323 WRITE_ONCE(next->on_cpu, 1);
4327 static inline void finish_task(struct task_struct *prev)
4331 * This must be the very last reference to @prev from this CPU. After
4332 * p->on_cpu is cleared, the task can be moved to a different CPU. We
4333 * must ensure this doesn't happen until the switch is completely
4336 * In particular, the load of prev->state in finish_task_switch() must
4337 * happen before this.
4339 * Pairs with the smp_cond_load_acquire() in try_to_wake_up().
4341 smp_store_release(&prev->on_cpu, 0);
4347 static void do_balance_callbacks(struct rq *rq, struct callback_head *head)
4349 void (*func)(struct rq *rq);
4350 struct callback_head *next;
4352 lockdep_assert_rq_held(rq);
4355 func = (void (*)(struct rq *))head->func;
4364 static void balance_push(struct rq *rq);
4366 struct callback_head balance_push_callback = {
4368 .func = (void (*)(struct callback_head *))balance_push,
4371 static inline struct callback_head *splice_balance_callbacks(struct rq *rq)
4373 struct callback_head *head = rq->balance_callback;
4375 lockdep_assert_rq_held(rq);
4377 rq->balance_callback = NULL;
4382 static void __balance_callbacks(struct rq *rq)
4384 do_balance_callbacks(rq, splice_balance_callbacks(rq));
4387 static inline void balance_callbacks(struct rq *rq, struct callback_head *head)
4389 unsigned long flags;
4391 if (unlikely(head)) {
4392 raw_spin_rq_lock_irqsave(rq, flags);
4393 do_balance_callbacks(rq, head);
4394 raw_spin_rq_unlock_irqrestore(rq, flags);
4400 static inline void __balance_callbacks(struct rq *rq)
4404 static inline struct callback_head *splice_balance_callbacks(struct rq *rq)
4409 static inline void balance_callbacks(struct rq *rq, struct callback_head *head)
4416 prepare_lock_switch(struct rq *rq, struct task_struct *next, struct rq_flags *rf)
4419 * Since the runqueue lock will be released by the next
4420 * task (which is an invalid locking op but in the case
4421 * of the scheduler it's an obvious special-case), so we
4422 * do an early lockdep release here:
4424 rq_unpin_lock(rq, rf);
4425 spin_release(&__rq_lockp(rq)->dep_map, _THIS_IP_);
4426 #ifdef CONFIG_DEBUG_SPINLOCK
4427 /* this is a valid case when another task releases the spinlock */
4428 rq_lockp(rq)->owner = next;
4432 static inline void finish_lock_switch(struct rq *rq)
4435 * If we are tracking spinlock dependencies then we have to
4436 * fix up the runqueue lock - which gets 'carried over' from
4437 * prev into current:
4439 spin_acquire(&__rq_lockp(rq)->dep_map, 0, 0, _THIS_IP_);
4440 __balance_callbacks(rq);
4441 raw_spin_rq_unlock_irq(rq);
4445 * NOP if the arch has not defined these:
4448 #ifndef prepare_arch_switch
4449 # define prepare_arch_switch(next) do { } while (0)
4452 #ifndef finish_arch_post_lock_switch
4453 # define finish_arch_post_lock_switch() do { } while (0)
4456 static inline void kmap_local_sched_out(void)
4458 #ifdef CONFIG_KMAP_LOCAL
4459 if (unlikely(current->kmap_ctrl.idx))
4460 __kmap_local_sched_out();
4464 static inline void kmap_local_sched_in(void)
4466 #ifdef CONFIG_KMAP_LOCAL
4467 if (unlikely(current->kmap_ctrl.idx))
4468 __kmap_local_sched_in();
4473 * prepare_task_switch - prepare to switch tasks
4474 * @rq: the runqueue preparing to switch
4475 * @prev: the current task that is being switched out
4476 * @next: the task we are going to switch to.
4478 * This is called with the rq lock held and interrupts off. It must
4479 * be paired with a subsequent finish_task_switch after the context
4482 * prepare_task_switch sets up locking and calls architecture specific
4486 prepare_task_switch(struct rq *rq, struct task_struct *prev,
4487 struct task_struct *next)
4489 kcov_prepare_switch(prev);
4490 sched_info_switch(rq, prev, next);
4491 perf_event_task_sched_out(prev, next);
4493 fire_sched_out_preempt_notifiers(prev, next);
4494 kmap_local_sched_out();
4496 prepare_arch_switch(next);
4500 * finish_task_switch - clean up after a task-switch
4501 * @prev: the thread we just switched away from.
4503 * finish_task_switch must be called after the context switch, paired
4504 * with a prepare_task_switch call before the context switch.
4505 * finish_task_switch will reconcile locking set up by prepare_task_switch,
4506 * and do any other architecture-specific cleanup actions.
4508 * Note that we may have delayed dropping an mm in context_switch(). If
4509 * so, we finish that here outside of the runqueue lock. (Doing it
4510 * with the lock held can cause deadlocks; see schedule() for
4513 * The context switch have flipped the stack from under us and restored the
4514 * local variables which were saved when this task called schedule() in the
4515 * past. prev == current is still correct but we need to recalculate this_rq
4516 * because prev may have moved to another CPU.
4518 static struct rq *finish_task_switch(struct task_struct *prev)
4519 __releases(rq->lock)
4521 struct rq *rq = this_rq();
4522 struct mm_struct *mm = rq->prev_mm;
4526 * The previous task will have left us with a preempt_count of 2
4527 * because it left us after:
4530 * preempt_disable(); // 1
4532 * raw_spin_lock_irq(&rq->lock) // 2
4534 * Also, see FORK_PREEMPT_COUNT.
4536 if (WARN_ONCE(preempt_count() != 2*PREEMPT_DISABLE_OFFSET,
4537 "corrupted preempt_count: %s/%d/0x%x\n",
4538 current->comm, current->pid, preempt_count()))
4539 preempt_count_set(FORK_PREEMPT_COUNT);
4544 * A task struct has one reference for the use as "current".
4545 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
4546 * schedule one last time. The schedule call will never return, and
4547 * the scheduled task must drop that reference.
4549 * We must observe prev->state before clearing prev->on_cpu (in
4550 * finish_task), otherwise a concurrent wakeup can get prev
4551 * running on another CPU and we could rave with its RUNNING -> DEAD
4552 * transition, resulting in a double drop.
4554 prev_state = prev->state;
4555 vtime_task_switch(prev);
4556 perf_event_task_sched_in(prev, current);
4558 finish_lock_switch(rq);
4559 finish_arch_post_lock_switch();
4560 kcov_finish_switch(current);
4562 * kmap_local_sched_out() is invoked with rq::lock held and
4563 * interrupts disabled. There is no requirement for that, but the
4564 * sched out code does not have an interrupt enabled section.
4565 * Restoring the maps on sched in does not require interrupts being
4568 kmap_local_sched_in();
4570 fire_sched_in_preempt_notifiers(current);
4572 * When switching through a kernel thread, the loop in
4573 * membarrier_{private,global}_expedited() may have observed that
4574 * kernel thread and not issued an IPI. It is therefore possible to
4575 * schedule between user->kernel->user threads without passing though
4576 * switch_mm(). Membarrier requires a barrier after storing to
4577 * rq->curr, before returning to userspace, so provide them here:
4579 * - a full memory barrier for {PRIVATE,GLOBAL}_EXPEDITED, implicitly
4580 * provided by mmdrop(),
4581 * - a sync_core for SYNC_CORE.
4584 membarrier_mm_sync_core_before_usermode(mm);
4587 if (unlikely(prev_state == TASK_DEAD)) {
4588 if (prev->sched_class->task_dead)
4589 prev->sched_class->task_dead(prev);
4592 * Remove function-return probe instances associated with this
4593 * task and put them back on the free list.
4595 kprobe_flush_task(prev);
4597 /* Task is done with its stack. */
4598 put_task_stack(prev);
4600 put_task_struct_rcu_user(prev);
4603 tick_nohz_task_switch();
4608 * schedule_tail - first thing a freshly forked thread must call.
4609 * @prev: the thread we just switched away from.
4611 asmlinkage __visible void schedule_tail(struct task_struct *prev)
4612 __releases(rq->lock)
4615 * New tasks start with FORK_PREEMPT_COUNT, see there and
4616 * finish_task_switch() for details.
4618 * finish_task_switch() will drop rq->lock() and lower preempt_count
4619 * and the preempt_enable() will end up enabling preemption (on
4620 * PREEMPT_COUNT kernels).
4623 finish_task_switch(prev);
4626 if (current->set_child_tid)
4627 put_user(task_pid_vnr(current), current->set_child_tid);
4629 calculate_sigpending();
4633 * context_switch - switch to the new MM and the new thread's register state.
4635 static __always_inline struct rq *
4636 context_switch(struct rq *rq, struct task_struct *prev,
4637 struct task_struct *next, struct rq_flags *rf)
4639 prepare_task_switch(rq, prev, next);
4642 * For paravirt, this is coupled with an exit in switch_to to
4643 * combine the page table reload and the switch backend into
4646 arch_start_context_switch(prev);
4649 * kernel -> kernel lazy + transfer active
4650 * user -> kernel lazy + mmgrab() active
4652 * kernel -> user switch + mmdrop() active
4653 * user -> user switch
4655 if (!next->mm) { // to kernel
4656 enter_lazy_tlb(prev->active_mm, next);
4658 next->active_mm = prev->active_mm;
4659 if (prev->mm) // from user
4660 mmgrab(prev->active_mm);
4662 prev->active_mm = NULL;
4664 membarrier_switch_mm(rq, prev->active_mm, next->mm);
4666 * sys_membarrier() requires an smp_mb() between setting
4667 * rq->curr / membarrier_switch_mm() and returning to userspace.
4669 * The below provides this either through switch_mm(), or in
4670 * case 'prev->active_mm == next->mm' through
4671 * finish_task_switch()'s mmdrop().
4673 switch_mm_irqs_off(prev->active_mm, next->mm, next);
4675 if (!prev->mm) { // from kernel
4676 /* will mmdrop() in finish_task_switch(). */
4677 rq->prev_mm = prev->active_mm;
4678 prev->active_mm = NULL;
4682 rq->clock_update_flags &= ~(RQCF_ACT_SKIP|RQCF_REQ_SKIP);
4684 prepare_lock_switch(rq, next, rf);
4686 /* Here we just switch the register state and the stack. */
4687 switch_to(prev, next, prev);
4690 return finish_task_switch(prev);
4694 * nr_running and nr_context_switches:
4696 * externally visible scheduler statistics: current number of runnable
4697 * threads, total number of context switches performed since bootup.
4699 unsigned int nr_running(void)
4701 unsigned int i, sum = 0;
4703 for_each_online_cpu(i)
4704 sum += cpu_rq(i)->nr_running;
4710 * Check if only the current task is running on the CPU.
4712 * Caution: this function does not check that the caller has disabled
4713 * preemption, thus the result might have a time-of-check-to-time-of-use
4714 * race. The caller is responsible to use it correctly, for example:
4716 * - from a non-preemptible section (of course)
4718 * - from a thread that is bound to a single CPU
4720 * - in a loop with very short iterations (e.g. a polling loop)
4722 bool single_task_running(void)
4724 return raw_rq()->nr_running == 1;
4726 EXPORT_SYMBOL(single_task_running);
4728 unsigned long long nr_context_switches(void)
4731 unsigned long long sum = 0;
4733 for_each_possible_cpu(i)
4734 sum += cpu_rq(i)->nr_switches;
4740 * Consumers of these two interfaces, like for example the cpuidle menu
4741 * governor, are using nonsensical data. Preferring shallow idle state selection
4742 * for a CPU that has IO-wait which might not even end up running the task when
4743 * it does become runnable.
4746 unsigned int nr_iowait_cpu(int cpu)
4748 return atomic_read(&cpu_rq(cpu)->nr_iowait);
4752 * IO-wait accounting, and how it's mostly bollocks (on SMP).
4754 * The idea behind IO-wait account is to account the idle time that we could
4755 * have spend running if it were not for IO. That is, if we were to improve the
4756 * storage performance, we'd have a proportional reduction in IO-wait time.
4758 * This all works nicely on UP, where, when a task blocks on IO, we account
4759 * idle time as IO-wait, because if the storage were faster, it could've been
4760 * running and we'd not be idle.
4762 * This has been extended to SMP, by doing the same for each CPU. This however
4765 * Imagine for instance the case where two tasks block on one CPU, only the one
4766 * CPU will have IO-wait accounted, while the other has regular idle. Even
4767 * though, if the storage were faster, both could've ran at the same time,
4768 * utilising both CPUs.
4770 * This means, that when looking globally, the current IO-wait accounting on
4771 * SMP is a lower bound, by reason of under accounting.
4773 * Worse, since the numbers are provided per CPU, they are sometimes
4774 * interpreted per CPU, and that is nonsensical. A blocked task isn't strictly
4775 * associated with any one particular CPU, it can wake to another CPU than it
4776 * blocked on. This means the per CPU IO-wait number is meaningless.
4778 * Task CPU affinities can make all that even more 'interesting'.
4781 unsigned int nr_iowait(void)
4783 unsigned int i, sum = 0;
4785 for_each_possible_cpu(i)
4786 sum += nr_iowait_cpu(i);
4794 * sched_exec - execve() is a valuable balancing opportunity, because at
4795 * this point the task has the smallest effective memory and cache footprint.
4797 void sched_exec(void)
4799 struct task_struct *p = current;
4800 unsigned long flags;
4803 raw_spin_lock_irqsave(&p->pi_lock, flags);
4804 dest_cpu = p->sched_class->select_task_rq(p, task_cpu(p), WF_EXEC);
4805 if (dest_cpu == smp_processor_id())
4808 if (likely(cpu_active(dest_cpu))) {
4809 struct migration_arg arg = { p, dest_cpu };
4811 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4812 stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg);
4816 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4821 DEFINE_PER_CPU(struct kernel_stat, kstat);
4822 DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat);
4824 EXPORT_PER_CPU_SYMBOL(kstat);
4825 EXPORT_PER_CPU_SYMBOL(kernel_cpustat);
4828 * The function fair_sched_class.update_curr accesses the struct curr
4829 * and its field curr->exec_start; when called from task_sched_runtime(),
4830 * we observe a high rate of cache misses in practice.
4831 * Prefetching this data results in improved performance.
4833 static inline void prefetch_curr_exec_start(struct task_struct *p)
4835 #ifdef CONFIG_FAIR_GROUP_SCHED
4836 struct sched_entity *curr = (&p->se)->cfs_rq->curr;
4838 struct sched_entity *curr = (&task_rq(p)->cfs)->curr;
4841 prefetch(&curr->exec_start);
4845 * Return accounted runtime for the task.
4846 * In case the task is currently running, return the runtime plus current's
4847 * pending runtime that have not been accounted yet.
4849 unsigned long long task_sched_runtime(struct task_struct *p)
4855 #if defined(CONFIG_64BIT) && defined(CONFIG_SMP)
4857 * 64-bit doesn't need locks to atomically read a 64-bit value.
4858 * So we have a optimization chance when the task's delta_exec is 0.
4859 * Reading ->on_cpu is racy, but this is ok.
4861 * If we race with it leaving CPU, we'll take a lock. So we're correct.
4862 * If we race with it entering CPU, unaccounted time is 0. This is
4863 * indistinguishable from the read occurring a few cycles earlier.
4864 * If we see ->on_cpu without ->on_rq, the task is leaving, and has
4865 * been accounted, so we're correct here as well.
4867 if (!p->on_cpu || !task_on_rq_queued(p))
4868 return p->se.sum_exec_runtime;
4871 rq = task_rq_lock(p, &rf);
4873 * Must be ->curr _and_ ->on_rq. If dequeued, we would
4874 * project cycles that may never be accounted to this
4875 * thread, breaking clock_gettime().
4877 if (task_current(rq, p) && task_on_rq_queued(p)) {
4878 prefetch_curr_exec_start(p);
4879 update_rq_clock(rq);
4880 p->sched_class->update_curr(rq);
4882 ns = p->se.sum_exec_runtime;
4883 task_rq_unlock(rq, p, &rf);
4888 #ifdef CONFIG_SCHED_DEBUG
4889 static u64 cpu_resched_latency(struct rq *rq)
4891 int latency_warn_ms = READ_ONCE(sysctl_resched_latency_warn_ms);
4892 u64 resched_latency, now = rq_clock(rq);
4893 static bool warned_once;
4895 if (sysctl_resched_latency_warn_once && warned_once)
4898 if (!need_resched() || !latency_warn_ms)
4901 if (system_state == SYSTEM_BOOTING)
4904 if (!rq->last_seen_need_resched_ns) {
4905 rq->last_seen_need_resched_ns = now;
4906 rq->ticks_without_resched = 0;
4910 rq->ticks_without_resched++;
4911 resched_latency = now - rq->last_seen_need_resched_ns;
4912 if (resched_latency <= latency_warn_ms * NSEC_PER_MSEC)
4917 return resched_latency;
4920 static int __init setup_resched_latency_warn_ms(char *str)
4924 if ((kstrtol(str, 0, &val))) {
4925 pr_warn("Unable to set resched_latency_warn_ms\n");
4929 sysctl_resched_latency_warn_ms = val;
4932 __setup("resched_latency_warn_ms=", setup_resched_latency_warn_ms);
4934 static inline u64 cpu_resched_latency(struct rq *rq) { return 0; }
4935 #endif /* CONFIG_SCHED_DEBUG */
4938 * This function gets called by the timer code, with HZ frequency.
4939 * We call it with interrupts disabled.
4941 void scheduler_tick(void)
4943 int cpu = smp_processor_id();
4944 struct rq *rq = cpu_rq(cpu);
4945 struct task_struct *curr = rq->curr;
4947 unsigned long thermal_pressure;
4948 u64 resched_latency;
4950 arch_scale_freq_tick();
4955 update_rq_clock(rq);
4956 thermal_pressure = arch_scale_thermal_pressure(cpu_of(rq));
4957 update_thermal_load_avg(rq_clock_thermal(rq), rq, thermal_pressure);
4958 curr->sched_class->task_tick(rq, curr, 0);
4959 if (sched_feat(LATENCY_WARN))
4960 resched_latency = cpu_resched_latency(rq);
4961 calc_global_load_tick(rq);
4965 if (sched_feat(LATENCY_WARN) && resched_latency)
4966 resched_latency_warn(cpu, resched_latency);
4968 perf_event_task_tick();
4971 rq->idle_balance = idle_cpu(cpu);
4972 trigger_load_balance(rq);
4976 #ifdef CONFIG_NO_HZ_FULL
4981 struct delayed_work work;
4983 /* Values for ->state, see diagram below. */
4984 #define TICK_SCHED_REMOTE_OFFLINE 0
4985 #define TICK_SCHED_REMOTE_OFFLINING 1
4986 #define TICK_SCHED_REMOTE_RUNNING 2
4989 * State diagram for ->state:
4992 * TICK_SCHED_REMOTE_OFFLINE
4995 * | | sched_tick_remote()
4998 * +--TICK_SCHED_REMOTE_OFFLINING
5001 * sched_tick_start() | | sched_tick_stop()
5004 * TICK_SCHED_REMOTE_RUNNING
5007 * Other transitions get WARN_ON_ONCE(), except that sched_tick_remote()
5008 * and sched_tick_start() are happy to leave the state in RUNNING.
5011 static struct tick_work __percpu *tick_work_cpu;
5013 static void sched_tick_remote(struct work_struct *work)
5015 struct delayed_work *dwork = to_delayed_work(work);
5016 struct tick_work *twork = container_of(dwork, struct tick_work, work);
5017 int cpu = twork->cpu;
5018 struct rq *rq = cpu_rq(cpu);
5019 struct task_struct *curr;
5025 * Handle the tick only if it appears the remote CPU is running in full
5026 * dynticks mode. The check is racy by nature, but missing a tick or
5027 * having one too much is no big deal because the scheduler tick updates
5028 * statistics and checks timeslices in a time-independent way, regardless
5029 * of when exactly it is running.
5031 if (!tick_nohz_tick_stopped_cpu(cpu))
5034 rq_lock_irq(rq, &rf);
5036 if (cpu_is_offline(cpu))
5039 update_rq_clock(rq);
5041 if (!is_idle_task(curr)) {
5043 * Make sure the next tick runs within a reasonable
5046 delta = rq_clock_task(rq) - curr->se.exec_start;
5047 WARN_ON_ONCE(delta > (u64)NSEC_PER_SEC * 3);
5049 curr->sched_class->task_tick(rq, curr, 0);
5051 calc_load_nohz_remote(rq);
5053 rq_unlock_irq(rq, &rf);
5057 * Run the remote tick once per second (1Hz). This arbitrary
5058 * frequency is large enough to avoid overload but short enough
5059 * to keep scheduler internal stats reasonably up to date. But
5060 * first update state to reflect hotplug activity if required.
5062 os = atomic_fetch_add_unless(&twork->state, -1, TICK_SCHED_REMOTE_RUNNING);
5063 WARN_ON_ONCE(os == TICK_SCHED_REMOTE_OFFLINE);
5064 if (os == TICK_SCHED_REMOTE_RUNNING)
5065 queue_delayed_work(system_unbound_wq, dwork, HZ);
5068 static void sched_tick_start(int cpu)
5071 struct tick_work *twork;
5073 if (housekeeping_cpu(cpu, HK_FLAG_TICK))
5076 WARN_ON_ONCE(!tick_work_cpu);
5078 twork = per_cpu_ptr(tick_work_cpu, cpu);
5079 os = atomic_xchg(&twork->state, TICK_SCHED_REMOTE_RUNNING);
5080 WARN_ON_ONCE(os == TICK_SCHED_REMOTE_RUNNING);
5081 if (os == TICK_SCHED_REMOTE_OFFLINE) {
5083 INIT_DELAYED_WORK(&twork->work, sched_tick_remote);
5084 queue_delayed_work(system_unbound_wq, &twork->work, HZ);
5088 #ifdef CONFIG_HOTPLUG_CPU
5089 static void sched_tick_stop(int cpu)
5091 struct tick_work *twork;
5094 if (housekeeping_cpu(cpu, HK_FLAG_TICK))
5097 WARN_ON_ONCE(!tick_work_cpu);
5099 twork = per_cpu_ptr(tick_work_cpu, cpu);
5100 /* There cannot be competing actions, but don't rely on stop-machine. */
5101 os = atomic_xchg(&twork->state, TICK_SCHED_REMOTE_OFFLINING);
5102 WARN_ON_ONCE(os != TICK_SCHED_REMOTE_RUNNING);
5103 /* Don't cancel, as this would mess up the state machine. */
5105 #endif /* CONFIG_HOTPLUG_CPU */
5107 int __init sched_tick_offload_init(void)
5109 tick_work_cpu = alloc_percpu(struct tick_work);
5110 BUG_ON(!tick_work_cpu);
5114 #else /* !CONFIG_NO_HZ_FULL */
5115 static inline void sched_tick_start(int cpu) { }
5116 static inline void sched_tick_stop(int cpu) { }
5119 #if defined(CONFIG_PREEMPTION) && (defined(CONFIG_DEBUG_PREEMPT) || \
5120 defined(CONFIG_TRACE_PREEMPT_TOGGLE))
5122 * If the value passed in is equal to the current preempt count
5123 * then we just disabled preemption. Start timing the latency.
5125 static inline void preempt_latency_start(int val)
5127 if (preempt_count() == val) {
5128 unsigned long ip = get_lock_parent_ip();
5129 #ifdef CONFIG_DEBUG_PREEMPT
5130 current->preempt_disable_ip = ip;
5132 trace_preempt_off(CALLER_ADDR0, ip);
5136 void preempt_count_add(int val)
5138 #ifdef CONFIG_DEBUG_PREEMPT
5142 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
5145 __preempt_count_add(val);
5146 #ifdef CONFIG_DEBUG_PREEMPT
5148 * Spinlock count overflowing soon?
5150 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
5153 preempt_latency_start(val);
5155 EXPORT_SYMBOL(preempt_count_add);
5156 NOKPROBE_SYMBOL(preempt_count_add);
5159 * If the value passed in equals to the current preempt count
5160 * then we just enabled preemption. Stop timing the latency.
5162 static inline void preempt_latency_stop(int val)
5164 if (preempt_count() == val)
5165 trace_preempt_on(CALLER_ADDR0, get_lock_parent_ip());
5168 void preempt_count_sub(int val)
5170 #ifdef CONFIG_DEBUG_PREEMPT
5174 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
5177 * Is the spinlock portion underflowing?
5179 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
5180 !(preempt_count() & PREEMPT_MASK)))
5184 preempt_latency_stop(val);
5185 __preempt_count_sub(val);
5187 EXPORT_SYMBOL(preempt_count_sub);
5188 NOKPROBE_SYMBOL(preempt_count_sub);
5191 static inline void preempt_latency_start(int val) { }
5192 static inline void preempt_latency_stop(int val) { }
5195 static inline unsigned long get_preempt_disable_ip(struct task_struct *p)
5197 #ifdef CONFIG_DEBUG_PREEMPT
5198 return p->preempt_disable_ip;
5205 * Print scheduling while atomic bug:
5207 static noinline void __schedule_bug(struct task_struct *prev)
5209 /* Save this before calling printk(), since that will clobber it */
5210 unsigned long preempt_disable_ip = get_preempt_disable_ip(current);
5212 if (oops_in_progress)
5215 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
5216 prev->comm, prev->pid, preempt_count());
5218 debug_show_held_locks(prev);
5220 if (irqs_disabled())
5221 print_irqtrace_events(prev);
5222 if (IS_ENABLED(CONFIG_DEBUG_PREEMPT)
5223 && in_atomic_preempt_off()) {
5224 pr_err("Preemption disabled at:");
5225 print_ip_sym(KERN_ERR, preempt_disable_ip);
5228 panic("scheduling while atomic\n");
5231 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
5235 * Various schedule()-time debugging checks and statistics:
5237 static inline void schedule_debug(struct task_struct *prev, bool preempt)
5239 #ifdef CONFIG_SCHED_STACK_END_CHECK
5240 if (task_stack_end_corrupted(prev))
5241 panic("corrupted stack end detected inside scheduler\n");
5243 if (task_scs_end_corrupted(prev))
5244 panic("corrupted shadow stack detected inside scheduler\n");
5247 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
5248 if (!preempt && prev->state && prev->non_block_count) {
5249 printk(KERN_ERR "BUG: scheduling in a non-blocking section: %s/%d/%i\n",
5250 prev->comm, prev->pid, prev->non_block_count);
5252 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
5256 if (unlikely(in_atomic_preempt_off())) {
5257 __schedule_bug(prev);
5258 preempt_count_set(PREEMPT_DISABLED);
5261 SCHED_WARN_ON(ct_state() == CONTEXT_USER);
5263 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
5265 schedstat_inc(this_rq()->sched_count);
5268 static void put_prev_task_balance(struct rq *rq, struct task_struct *prev,
5269 struct rq_flags *rf)
5272 const struct sched_class *class;
5274 * We must do the balancing pass before put_prev_task(), such
5275 * that when we release the rq->lock the task is in the same
5276 * state as before we took rq->lock.
5278 * We can terminate the balance pass as soon as we know there is
5279 * a runnable task of @class priority or higher.
5281 for_class_range(class, prev->sched_class, &idle_sched_class) {
5282 if (class->balance(rq, prev, rf))
5287 put_prev_task(rq, prev);
5291 * Pick up the highest-prio task:
5293 static inline struct task_struct *
5294 __pick_next_task(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
5296 const struct sched_class *class;
5297 struct task_struct *p;
5300 * Optimization: we know that if all tasks are in the fair class we can
5301 * call that function directly, but only if the @prev task wasn't of a
5302 * higher scheduling class, because otherwise those lose the
5303 * opportunity to pull in more work from other CPUs.
5305 if (likely(prev->sched_class <= &fair_sched_class &&
5306 rq->nr_running == rq->cfs.h_nr_running)) {
5308 p = pick_next_task_fair(rq, prev, rf);
5309 if (unlikely(p == RETRY_TASK))
5312 /* Assume the next prioritized class is idle_sched_class */
5314 put_prev_task(rq, prev);
5315 p = pick_next_task_idle(rq);
5322 put_prev_task_balance(rq, prev, rf);
5324 for_each_class(class) {
5325 p = class->pick_next_task(rq);
5330 /* The idle class should always have a runnable task: */
5334 #ifdef CONFIG_SCHED_CORE
5335 static inline bool is_task_rq_idle(struct task_struct *t)
5337 return (task_rq(t)->idle == t);
5340 static inline bool cookie_equals(struct task_struct *a, unsigned long cookie)
5342 return is_task_rq_idle(a) || (a->core_cookie == cookie);
5345 static inline bool cookie_match(struct task_struct *a, struct task_struct *b)
5347 if (is_task_rq_idle(a) || is_task_rq_idle(b))
5350 return a->core_cookie == b->core_cookie;
5353 // XXX fairness/fwd progress conditions
5356 * - NULL if there is no runnable task for this class.
5357 * - the highest priority task for this runqueue if it matches
5358 * rq->core->core_cookie or its priority is greater than max.
5359 * - Else returns idle_task.
5361 static struct task_struct *
5362 pick_task(struct rq *rq, const struct sched_class *class, struct task_struct *max, bool in_fi)
5364 struct task_struct *class_pick, *cookie_pick;
5365 unsigned long cookie = rq->core->core_cookie;
5367 class_pick = class->pick_task(rq);
5373 * If class_pick is tagged, return it only if it has
5374 * higher priority than max.
5376 if (max && class_pick->core_cookie &&
5377 prio_less(class_pick, max, in_fi))
5378 return idle_sched_class.pick_task(rq);
5384 * If class_pick is idle or matches cookie, return early.
5386 if (cookie_equals(class_pick, cookie))
5389 cookie_pick = sched_core_find(rq, cookie);
5392 * If class > max && class > cookie, it is the highest priority task on
5393 * the core (so far) and it must be selected, otherwise we must go with
5394 * the cookie pick in order to satisfy the constraint.
5396 if (prio_less(cookie_pick, class_pick, in_fi) &&
5397 (!max || prio_less(max, class_pick, in_fi)))
5403 extern void task_vruntime_update(struct rq *rq, struct task_struct *p, bool in_fi);
5405 static struct task_struct *
5406 pick_next_task(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
5408 struct task_struct *next, *max = NULL;
5409 const struct sched_class *class;
5410 const struct cpumask *smt_mask;
5411 bool fi_before = false;
5412 int i, j, cpu, occ = 0;
5415 if (!sched_core_enabled(rq))
5416 return __pick_next_task(rq, prev, rf);
5420 /* Stopper task is switching into idle, no need core-wide selection. */
5421 if (cpu_is_offline(cpu)) {
5423 * Reset core_pick so that we don't enter the fastpath when
5424 * coming online. core_pick would already be migrated to
5425 * another cpu during offline.
5427 rq->core_pick = NULL;
5428 return __pick_next_task(rq, prev, rf);
5432 * If there were no {en,de}queues since we picked (IOW, the task
5433 * pointers are all still valid), and we haven't scheduled the last
5434 * pick yet, do so now.
5436 * rq->core_pick can be NULL if no selection was made for a CPU because
5437 * it was either offline or went offline during a sibling's core-wide
5438 * selection. In this case, do a core-wide selection.
5440 if (rq->core->core_pick_seq == rq->core->core_task_seq &&
5441 rq->core->core_pick_seq != rq->core_sched_seq &&
5443 WRITE_ONCE(rq->core_sched_seq, rq->core->core_pick_seq);
5445 next = rq->core_pick;
5447 put_prev_task(rq, prev);
5448 set_next_task(rq, next);
5451 rq->core_pick = NULL;
5455 put_prev_task_balance(rq, prev, rf);
5457 smt_mask = cpu_smt_mask(cpu);
5458 need_sync = !!rq->core->core_cookie;
5461 rq->core->core_cookie = 0UL;
5462 if (rq->core->core_forceidle) {
5465 rq->core->core_forceidle = false;
5469 * core->core_task_seq, core->core_pick_seq, rq->core_sched_seq
5471 * @task_seq guards the task state ({en,de}queues)
5472 * @pick_seq is the @task_seq we did a selection on
5473 * @sched_seq is the @pick_seq we scheduled
5475 * However, preemptions can cause multiple picks on the same task set.
5476 * 'Fix' this by also increasing @task_seq for every pick.
5478 rq->core->core_task_seq++;
5481 * Optimize for common case where this CPU has no cookies
5482 * and there are no cookied tasks running on siblings.
5485 for_each_class(class) {
5486 next = class->pick_task(rq);
5491 if (!next->core_cookie) {
5492 rq->core_pick = NULL;
5494 * For robustness, update the min_vruntime_fi for
5495 * unconstrained picks as well.
5497 WARN_ON_ONCE(fi_before);
5498 task_vruntime_update(rq, next, false);
5503 for_each_cpu(i, smt_mask) {
5504 struct rq *rq_i = cpu_rq(i);
5506 rq_i->core_pick = NULL;
5509 update_rq_clock(rq_i);
5513 * Try and select tasks for each sibling in descending sched_class
5516 for_each_class(class) {
5518 for_each_cpu_wrap(i, smt_mask, cpu) {
5519 struct rq *rq_i = cpu_rq(i);
5520 struct task_struct *p;
5522 if (rq_i->core_pick)
5526 * If this sibling doesn't yet have a suitable task to
5527 * run; ask for the most eligible task, given the
5528 * highest priority task already selected for this
5531 p = pick_task(rq_i, class, max, fi_before);
5535 if (!is_task_rq_idle(p))
5538 rq_i->core_pick = p;
5539 if (rq_i->idle == p && rq_i->nr_running) {
5540 rq->core->core_forceidle = true;
5542 rq->core->core_forceidle_seq++;
5546 * If this new candidate is of higher priority than the
5547 * previous; and they're incompatible; we need to wipe
5548 * the slate and start over. pick_task makes sure that
5549 * p's priority is more than max if it doesn't match
5552 * NOTE: this is a linear max-filter and is thus bounded
5553 * in execution time.
5555 if (!max || !cookie_match(max, p)) {
5556 struct task_struct *old_max = max;
5558 rq->core->core_cookie = p->core_cookie;
5562 rq->core->core_forceidle = false;
5563 for_each_cpu(j, smt_mask) {
5567 cpu_rq(j)->core_pick = NULL;
5576 rq->core->core_pick_seq = rq->core->core_task_seq;
5577 next = rq->core_pick;
5578 rq->core_sched_seq = rq->core->core_pick_seq;
5580 /* Something should have been selected for current CPU */
5581 WARN_ON_ONCE(!next);
5584 * Reschedule siblings
5586 * NOTE: L1TF -- at this point we're no longer running the old task and
5587 * sending an IPI (below) ensures the sibling will no longer be running
5588 * their task. This ensures there is no inter-sibling overlap between
5589 * non-matching user state.
5591 for_each_cpu(i, smt_mask) {
5592 struct rq *rq_i = cpu_rq(i);
5595 * An online sibling might have gone offline before a task
5596 * could be picked for it, or it might be offline but later
5597 * happen to come online, but its too late and nothing was
5598 * picked for it. That's Ok - it will pick tasks for itself,
5601 if (!rq_i->core_pick)
5605 * Update for new !FI->FI transitions, or if continuing to be in !FI:
5606 * fi_before fi update?
5612 if (!(fi_before && rq->core->core_forceidle))
5613 task_vruntime_update(rq_i, rq_i->core_pick, rq->core->core_forceidle);
5615 rq_i->core_pick->core_occupation = occ;
5618 rq_i->core_pick = NULL;
5622 /* Did we break L1TF mitigation requirements? */
5623 WARN_ON_ONCE(!cookie_match(next, rq_i->core_pick));
5625 if (rq_i->curr == rq_i->core_pick) {
5626 rq_i->core_pick = NULL;
5634 set_next_task(rq, next);
5638 static bool try_steal_cookie(int this, int that)
5640 struct rq *dst = cpu_rq(this), *src = cpu_rq(that);
5641 struct task_struct *p;
5642 unsigned long cookie;
5643 bool success = false;
5645 local_irq_disable();
5646 double_rq_lock(dst, src);
5648 cookie = dst->core->core_cookie;
5652 if (dst->curr != dst->idle)
5655 p = sched_core_find(src, cookie);
5660 if (p == src->core_pick || p == src->curr)
5663 if (!cpumask_test_cpu(this, &p->cpus_mask))
5666 if (p->core_occupation > dst->idle->core_occupation)
5669 p->on_rq = TASK_ON_RQ_MIGRATING;
5670 deactivate_task(src, p, 0);
5671 set_task_cpu(p, this);
5672 activate_task(dst, p, 0);
5673 p->on_rq = TASK_ON_RQ_QUEUED;
5681 p = sched_core_next(p, cookie);
5685 double_rq_unlock(dst, src);
5691 static bool steal_cookie_task(int cpu, struct sched_domain *sd)
5695 for_each_cpu_wrap(i, sched_domain_span(sd), cpu) {
5702 if (try_steal_cookie(cpu, i))
5709 static void sched_core_balance(struct rq *rq)
5711 struct sched_domain *sd;
5712 int cpu = cpu_of(rq);
5716 raw_spin_rq_unlock_irq(rq);
5717 for_each_domain(cpu, sd) {
5721 if (steal_cookie_task(cpu, sd))
5724 raw_spin_rq_lock_irq(rq);
5729 static DEFINE_PER_CPU(struct callback_head, core_balance_head);
5731 void queue_core_balance(struct rq *rq)
5733 if (!sched_core_enabled(rq))
5736 if (!rq->core->core_cookie)
5739 if (!rq->nr_running) /* not forced idle */
5742 queue_balance_callback(rq, &per_cpu(core_balance_head, rq->cpu), sched_core_balance);
5745 static inline void sched_core_cpu_starting(unsigned int cpu)
5747 const struct cpumask *smt_mask = cpu_smt_mask(cpu);
5748 struct rq *rq, *core_rq = NULL;
5751 core_rq = cpu_rq(cpu)->core;
5754 for_each_cpu(i, smt_mask) {
5756 if (rq->core && rq->core == rq)
5761 core_rq = cpu_rq(cpu);
5763 for_each_cpu(i, smt_mask) {
5766 WARN_ON_ONCE(rq->core && rq->core != core_rq);
5771 #else /* !CONFIG_SCHED_CORE */
5773 static inline void sched_core_cpu_starting(unsigned int cpu) {}
5775 static struct task_struct *
5776 pick_next_task(struct rq *rq, struct task_struct *prev, struct rq_flags *rf)
5778 return __pick_next_task(rq, prev, rf);
5781 #endif /* CONFIG_SCHED_CORE */
5784 * __schedule() is the main scheduler function.
5786 * The main means of driving the scheduler and thus entering this function are:
5788 * 1. Explicit blocking: mutex, semaphore, waitqueue, etc.
5790 * 2. TIF_NEED_RESCHED flag is checked on interrupt and userspace return
5791 * paths. For example, see arch/x86/entry_64.S.
5793 * To drive preemption between tasks, the scheduler sets the flag in timer
5794 * interrupt handler scheduler_tick().
5796 * 3. Wakeups don't really cause entry into schedule(). They add a
5797 * task to the run-queue and that's it.
5799 * Now, if the new task added to the run-queue preempts the current
5800 * task, then the wakeup sets TIF_NEED_RESCHED and schedule() gets
5801 * called on the nearest possible occasion:
5803 * - If the kernel is preemptible (CONFIG_PREEMPTION=y):
5805 * - in syscall or exception context, at the next outmost
5806 * preempt_enable(). (this might be as soon as the wake_up()'s
5809 * - in IRQ context, return from interrupt-handler to
5810 * preemptible context
5812 * - If the kernel is not preemptible (CONFIG_PREEMPTION is not set)
5815 * - cond_resched() call
5816 * - explicit schedule() call
5817 * - return from syscall or exception to user-space
5818 * - return from interrupt-handler to user-space
5820 * WARNING: must be called with preemption disabled!
5822 static void __sched notrace __schedule(bool preempt)
5824 struct task_struct *prev, *next;
5825 unsigned long *switch_count;
5826 unsigned long prev_state;
5831 cpu = smp_processor_id();
5835 schedule_debug(prev, preempt);
5837 if (sched_feat(HRTICK) || sched_feat(HRTICK_DL))
5840 local_irq_disable();
5841 rcu_note_context_switch(preempt);
5844 * Make sure that signal_pending_state()->signal_pending() below
5845 * can't be reordered with __set_current_state(TASK_INTERRUPTIBLE)
5846 * done by the caller to avoid the race with signal_wake_up():
5848 * __set_current_state(@state) signal_wake_up()
5849 * schedule() set_tsk_thread_flag(p, TIF_SIGPENDING)
5850 * wake_up_state(p, state)
5851 * LOCK rq->lock LOCK p->pi_state
5852 * smp_mb__after_spinlock() smp_mb__after_spinlock()
5853 * if (signal_pending_state()) if (p->state & @state)
5855 * Also, the membarrier system call requires a full memory barrier
5856 * after coming from user-space, before storing to rq->curr.
5859 smp_mb__after_spinlock();
5861 /* Promote REQ to ACT */
5862 rq->clock_update_flags <<= 1;
5863 update_rq_clock(rq);
5865 switch_count = &prev->nivcsw;
5868 * We must load prev->state once (task_struct::state is volatile), such
5871 * - we form a control dependency vs deactivate_task() below.
5872 * - ptrace_{,un}freeze_traced() can change ->state underneath us.
5874 prev_state = prev->state;
5875 if (!preempt && prev_state) {
5876 if (signal_pending_state(prev_state, prev)) {
5877 prev->state = TASK_RUNNING;
5879 prev->sched_contributes_to_load =
5880 (prev_state & TASK_UNINTERRUPTIBLE) &&
5881 !(prev_state & TASK_NOLOAD) &&
5882 !(prev->flags & PF_FROZEN);
5884 if (prev->sched_contributes_to_load)
5885 rq->nr_uninterruptible++;
5888 * __schedule() ttwu()
5889 * prev_state = prev->state; if (p->on_rq && ...)
5890 * if (prev_state) goto out;
5891 * p->on_rq = 0; smp_acquire__after_ctrl_dep();
5892 * p->state = TASK_WAKING
5894 * Where __schedule() and ttwu() have matching control dependencies.
5896 * After this, schedule() must not care about p->state any more.
5898 deactivate_task(rq, prev, DEQUEUE_SLEEP | DEQUEUE_NOCLOCK);
5900 if (prev->in_iowait) {
5901 atomic_inc(&rq->nr_iowait);
5902 delayacct_blkio_start();
5905 switch_count = &prev->nvcsw;
5908 next = pick_next_task(rq, prev, &rf);
5909 clear_tsk_need_resched(prev);
5910 clear_preempt_need_resched();
5911 #ifdef CONFIG_SCHED_DEBUG
5912 rq->last_seen_need_resched_ns = 0;
5915 if (likely(prev != next)) {
5918 * RCU users of rcu_dereference(rq->curr) may not see
5919 * changes to task_struct made by pick_next_task().
5921 RCU_INIT_POINTER(rq->curr, next);
5923 * The membarrier system call requires each architecture
5924 * to have a full memory barrier after updating
5925 * rq->curr, before returning to user-space.
5927 * Here are the schemes providing that barrier on the
5928 * various architectures:
5929 * - mm ? switch_mm() : mmdrop() for x86, s390, sparc, PowerPC.
5930 * switch_mm() rely on membarrier_arch_switch_mm() on PowerPC.
5931 * - finish_lock_switch() for weakly-ordered
5932 * architectures where spin_unlock is a full barrier,
5933 * - switch_to() for arm64 (weakly-ordered, spin_unlock
5934 * is a RELEASE barrier),
5938 migrate_disable_switch(rq, prev);
5939 psi_sched_switch(prev, next, !task_on_rq_queued(prev));
5941 trace_sched_switch(preempt, prev, next);
5943 /* Also unlocks the rq: */
5944 rq = context_switch(rq, prev, next, &rf);
5946 rq->clock_update_flags &= ~(RQCF_ACT_SKIP|RQCF_REQ_SKIP);
5948 rq_unpin_lock(rq, &rf);
5949 __balance_callbacks(rq);
5950 raw_spin_rq_unlock_irq(rq);
5954 void __noreturn do_task_dead(void)
5956 /* Causes final put_task_struct in finish_task_switch(): */
5957 set_special_state(TASK_DEAD);
5959 /* Tell freezer to ignore us: */
5960 current->flags |= PF_NOFREEZE;
5965 /* Avoid "noreturn function does return" - but don't continue if BUG() is a NOP: */
5970 static inline void sched_submit_work(struct task_struct *tsk)
5972 unsigned int task_flags;
5977 task_flags = tsk->flags;
5979 * If a worker went to sleep, notify and ask workqueue whether
5980 * it wants to wake up a task to maintain concurrency.
5981 * As this function is called inside the schedule() context,
5982 * we disable preemption to avoid it calling schedule() again
5983 * in the possible wakeup of a kworker and because wq_worker_sleeping()
5986 if (task_flags & (PF_WQ_WORKER | PF_IO_WORKER)) {
5988 if (task_flags & PF_WQ_WORKER)
5989 wq_worker_sleeping(tsk);
5991 io_wq_worker_sleeping(tsk);
5992 preempt_enable_no_resched();
5995 if (tsk_is_pi_blocked(tsk))
5999 * If we are going to sleep and we have plugged IO queued,
6000 * make sure to submit it to avoid deadlocks.
6002 if (blk_needs_flush_plug(tsk))
6003 blk_schedule_flush_plug(tsk);
6006 static void sched_update_worker(struct task_struct *tsk)
6008 if (tsk->flags & (PF_WQ_WORKER | PF_IO_WORKER)) {
6009 if (tsk->flags & PF_WQ_WORKER)
6010 wq_worker_running(tsk);
6012 io_wq_worker_running(tsk);
6016 asmlinkage __visible void __sched schedule(void)
6018 struct task_struct *tsk = current;
6020 sched_submit_work(tsk);
6024 sched_preempt_enable_no_resched();
6025 } while (need_resched());
6026 sched_update_worker(tsk);
6028 EXPORT_SYMBOL(schedule);
6031 * synchronize_rcu_tasks() makes sure that no task is stuck in preempted
6032 * state (have scheduled out non-voluntarily) by making sure that all
6033 * tasks have either left the run queue or have gone into user space.
6034 * As idle tasks do not do either, they must not ever be preempted
6035 * (schedule out non-voluntarily).
6037 * schedule_idle() is similar to schedule_preempt_disable() except that it
6038 * never enables preemption because it does not call sched_submit_work().
6040 void __sched schedule_idle(void)
6043 * As this skips calling sched_submit_work(), which the idle task does
6044 * regardless because that function is a nop when the task is in a
6045 * TASK_RUNNING state, make sure this isn't used someplace that the
6046 * current task can be in any other state. Note, idle is always in the
6047 * TASK_RUNNING state.
6049 WARN_ON_ONCE(current->state);
6052 } while (need_resched());
6055 #if defined(CONFIG_CONTEXT_TRACKING) && !defined(CONFIG_HAVE_CONTEXT_TRACKING_OFFSTACK)
6056 asmlinkage __visible void __sched schedule_user(void)
6059 * If we come here after a random call to set_need_resched(),
6060 * or we have been woken up remotely but the IPI has not yet arrived,
6061 * we haven't yet exited the RCU idle mode. Do it here manually until
6062 * we find a better solution.
6064 * NB: There are buggy callers of this function. Ideally we
6065 * should warn if prev_state != CONTEXT_USER, but that will trigger
6066 * too frequently to make sense yet.
6068 enum ctx_state prev_state = exception_enter();
6070 exception_exit(prev_state);
6075 * schedule_preempt_disabled - called with preemption disabled
6077 * Returns with preemption disabled. Note: preempt_count must be 1
6079 void __sched schedule_preempt_disabled(void)
6081 sched_preempt_enable_no_resched();
6086 static void __sched notrace preempt_schedule_common(void)
6090 * Because the function tracer can trace preempt_count_sub()
6091 * and it also uses preempt_enable/disable_notrace(), if
6092 * NEED_RESCHED is set, the preempt_enable_notrace() called
6093 * by the function tracer will call this function again and
6094 * cause infinite recursion.
6096 * Preemption must be disabled here before the function
6097 * tracer can trace. Break up preempt_disable() into two
6098 * calls. One to disable preemption without fear of being
6099 * traced. The other to still record the preemption latency,
6100 * which can also be traced by the function tracer.
6102 preempt_disable_notrace();
6103 preempt_latency_start(1);
6105 preempt_latency_stop(1);
6106 preempt_enable_no_resched_notrace();
6109 * Check again in case we missed a preemption opportunity
6110 * between schedule and now.
6112 } while (need_resched());
6115 #ifdef CONFIG_PREEMPTION
6117 * This is the entry point to schedule() from in-kernel preemption
6118 * off of preempt_enable.
6120 asmlinkage __visible void __sched notrace preempt_schedule(void)
6123 * If there is a non-zero preempt_count or interrupts are disabled,
6124 * we do not want to preempt the current task. Just return..
6126 if (likely(!preemptible()))
6129 preempt_schedule_common();
6131 NOKPROBE_SYMBOL(preempt_schedule);
6132 EXPORT_SYMBOL(preempt_schedule);
6134 #ifdef CONFIG_PREEMPT_DYNAMIC
6135 DEFINE_STATIC_CALL(preempt_schedule, __preempt_schedule_func);
6136 EXPORT_STATIC_CALL_TRAMP(preempt_schedule);
6141 * preempt_schedule_notrace - preempt_schedule called by tracing
6143 * The tracing infrastructure uses preempt_enable_notrace to prevent
6144 * recursion and tracing preempt enabling caused by the tracing
6145 * infrastructure itself. But as tracing can happen in areas coming
6146 * from userspace or just about to enter userspace, a preempt enable
6147 * can occur before user_exit() is called. This will cause the scheduler
6148 * to be called when the system is still in usermode.
6150 * To prevent this, the preempt_enable_notrace will use this function
6151 * instead of preempt_schedule() to exit user context if needed before
6152 * calling the scheduler.
6154 asmlinkage __visible void __sched notrace preempt_schedule_notrace(void)
6156 enum ctx_state prev_ctx;
6158 if (likely(!preemptible()))
6163 * Because the function tracer can trace preempt_count_sub()
6164 * and it also uses preempt_enable/disable_notrace(), if
6165 * NEED_RESCHED is set, the preempt_enable_notrace() called
6166 * by the function tracer will call this function again and
6167 * cause infinite recursion.
6169 * Preemption must be disabled here before the function
6170 * tracer can trace. Break up preempt_disable() into two
6171 * calls. One to disable preemption without fear of being
6172 * traced. The other to still record the preemption latency,
6173 * which can also be traced by the function tracer.
6175 preempt_disable_notrace();
6176 preempt_latency_start(1);
6178 * Needs preempt disabled in case user_exit() is traced
6179 * and the tracer calls preempt_enable_notrace() causing
6180 * an infinite recursion.
6182 prev_ctx = exception_enter();
6184 exception_exit(prev_ctx);
6186 preempt_latency_stop(1);
6187 preempt_enable_no_resched_notrace();
6188 } while (need_resched());
6190 EXPORT_SYMBOL_GPL(preempt_schedule_notrace);
6192 #ifdef CONFIG_PREEMPT_DYNAMIC
6193 DEFINE_STATIC_CALL(preempt_schedule_notrace, __preempt_schedule_notrace_func);
6194 EXPORT_STATIC_CALL_TRAMP(preempt_schedule_notrace);
6197 #endif /* CONFIG_PREEMPTION */
6199 #ifdef CONFIG_PREEMPT_DYNAMIC
6201 #include <linux/entry-common.h>
6206 * SC:preempt_schedule
6207 * SC:preempt_schedule_notrace
6208 * SC:irqentry_exit_cond_resched
6212 * cond_resched <- __cond_resched
6213 * might_resched <- RET0
6214 * preempt_schedule <- NOP
6215 * preempt_schedule_notrace <- NOP
6216 * irqentry_exit_cond_resched <- NOP
6219 * cond_resched <- __cond_resched
6220 * might_resched <- __cond_resched
6221 * preempt_schedule <- NOP
6222 * preempt_schedule_notrace <- NOP
6223 * irqentry_exit_cond_resched <- NOP
6226 * cond_resched <- RET0
6227 * might_resched <- RET0
6228 * preempt_schedule <- preempt_schedule
6229 * preempt_schedule_notrace <- preempt_schedule_notrace
6230 * irqentry_exit_cond_resched <- irqentry_exit_cond_resched
6234 preempt_dynamic_none = 0,
6235 preempt_dynamic_voluntary,
6236 preempt_dynamic_full,
6239 int preempt_dynamic_mode = preempt_dynamic_full;
6241 int sched_dynamic_mode(const char *str)
6243 if (!strcmp(str, "none"))
6244 return preempt_dynamic_none;
6246 if (!strcmp(str, "voluntary"))
6247 return preempt_dynamic_voluntary;
6249 if (!strcmp(str, "full"))
6250 return preempt_dynamic_full;
6255 void sched_dynamic_update(int mode)
6258 * Avoid {NONE,VOLUNTARY} -> FULL transitions from ever ending up in
6259 * the ZERO state, which is invalid.
6261 static_call_update(cond_resched, __cond_resched);
6262 static_call_update(might_resched, __cond_resched);
6263 static_call_update(preempt_schedule, __preempt_schedule_func);
6264 static_call_update(preempt_schedule_notrace, __preempt_schedule_notrace_func);
6265 static_call_update(irqentry_exit_cond_resched, irqentry_exit_cond_resched);
6268 case preempt_dynamic_none:
6269 static_call_update(cond_resched, __cond_resched);
6270 static_call_update(might_resched, (void *)&__static_call_return0);
6271 static_call_update(preempt_schedule, NULL);
6272 static_call_update(preempt_schedule_notrace, NULL);
6273 static_call_update(irqentry_exit_cond_resched, NULL);
6274 pr_info("Dynamic Preempt: none\n");
6277 case preempt_dynamic_voluntary:
6278 static_call_update(cond_resched, __cond_resched);
6279 static_call_update(might_resched, __cond_resched);
6280 static_call_update(preempt_schedule, NULL);
6281 static_call_update(preempt_schedule_notrace, NULL);
6282 static_call_update(irqentry_exit_cond_resched, NULL);
6283 pr_info("Dynamic Preempt: voluntary\n");
6286 case preempt_dynamic_full:
6287 static_call_update(cond_resched, (void *)&__static_call_return0);
6288 static_call_update(might_resched, (void *)&__static_call_return0);
6289 static_call_update(preempt_schedule, __preempt_schedule_func);
6290 static_call_update(preempt_schedule_notrace, __preempt_schedule_notrace_func);
6291 static_call_update(irqentry_exit_cond_resched, irqentry_exit_cond_resched);
6292 pr_info("Dynamic Preempt: full\n");
6296 preempt_dynamic_mode = mode;
6299 static int __init setup_preempt_mode(char *str)
6301 int mode = sched_dynamic_mode(str);
6303 pr_warn("Dynamic Preempt: unsupported mode: %s\n", str);
6307 sched_dynamic_update(mode);
6310 __setup("preempt=", setup_preempt_mode);
6312 #endif /* CONFIG_PREEMPT_DYNAMIC */
6315 * This is the entry point to schedule() from kernel preemption
6316 * off of irq context.
6317 * Note, that this is called and return with irqs disabled. This will
6318 * protect us against recursive calling from irq.
6320 asmlinkage __visible void __sched preempt_schedule_irq(void)
6322 enum ctx_state prev_state;
6324 /* Catch callers which need to be fixed */
6325 BUG_ON(preempt_count() || !irqs_disabled());
6327 prev_state = exception_enter();
6333 local_irq_disable();
6334 sched_preempt_enable_no_resched();
6335 } while (need_resched());
6337 exception_exit(prev_state);
6340 int default_wake_function(wait_queue_entry_t *curr, unsigned mode, int wake_flags,
6343 WARN_ON_ONCE(IS_ENABLED(CONFIG_SCHED_DEBUG) && wake_flags & ~WF_SYNC);
6344 return try_to_wake_up(curr->private, mode, wake_flags);
6346 EXPORT_SYMBOL(default_wake_function);
6348 #ifdef CONFIG_RT_MUTEXES
6350 static inline int __rt_effective_prio(struct task_struct *pi_task, int prio)
6353 prio = min(prio, pi_task->prio);
6358 static inline int rt_effective_prio(struct task_struct *p, int prio)
6360 struct task_struct *pi_task = rt_mutex_get_top_task(p);
6362 return __rt_effective_prio(pi_task, prio);
6366 * rt_mutex_setprio - set the current priority of a task
6368 * @pi_task: donor task
6370 * This function changes the 'effective' priority of a task. It does
6371 * not touch ->normal_prio like __setscheduler().
6373 * Used by the rt_mutex code to implement priority inheritance
6374 * logic. Call site only calls if the priority of the task changed.
6376 void rt_mutex_setprio(struct task_struct *p, struct task_struct *pi_task)
6378 int prio, oldprio, queued, running, queue_flag =
6379 DEQUEUE_SAVE | DEQUEUE_MOVE | DEQUEUE_NOCLOCK;
6380 const struct sched_class *prev_class;
6384 /* XXX used to be waiter->prio, not waiter->task->prio */
6385 prio = __rt_effective_prio(pi_task, p->normal_prio);
6388 * If nothing changed; bail early.
6390 if (p->pi_top_task == pi_task && prio == p->prio && !dl_prio(prio))
6393 rq = __task_rq_lock(p, &rf);
6394 update_rq_clock(rq);
6396 * Set under pi_lock && rq->lock, such that the value can be used under
6399 * Note that there is loads of tricky to make this pointer cache work
6400 * right. rt_mutex_slowunlock()+rt_mutex_postunlock() work together to
6401 * ensure a task is de-boosted (pi_task is set to NULL) before the
6402 * task is allowed to run again (and can exit). This ensures the pointer
6403 * points to a blocked task -- which guarantees the task is present.
6405 p->pi_top_task = pi_task;
6408 * For FIFO/RR we only need to set prio, if that matches we're done.
6410 if (prio == p->prio && !dl_prio(prio))
6414 * Idle task boosting is a nono in general. There is one
6415 * exception, when PREEMPT_RT and NOHZ is active:
6417 * The idle task calls get_next_timer_interrupt() and holds
6418 * the timer wheel base->lock on the CPU and another CPU wants
6419 * to access the timer (probably to cancel it). We can safely
6420 * ignore the boosting request, as the idle CPU runs this code
6421 * with interrupts disabled and will complete the lock
6422 * protected section without being interrupted. So there is no
6423 * real need to boost.
6425 if (unlikely(p == rq->idle)) {
6426 WARN_ON(p != rq->curr);
6427 WARN_ON(p->pi_blocked_on);
6431 trace_sched_pi_setprio(p, pi_task);
6434 if (oldprio == prio)
6435 queue_flag &= ~DEQUEUE_MOVE;
6437 prev_class = p->sched_class;
6438 queued = task_on_rq_queued(p);
6439 running = task_current(rq, p);
6441 dequeue_task(rq, p, queue_flag);
6443 put_prev_task(rq, p);
6446 * Boosting condition are:
6447 * 1. -rt task is running and holds mutex A
6448 * --> -dl task blocks on mutex A
6450 * 2. -dl task is running and holds mutex A
6451 * --> -dl task blocks on mutex A and could preempt the
6454 if (dl_prio(prio)) {
6455 if (!dl_prio(p->normal_prio) ||
6456 (pi_task && dl_prio(pi_task->prio) &&
6457 dl_entity_preempt(&pi_task->dl, &p->dl))) {
6458 p->dl.pi_se = pi_task->dl.pi_se;
6459 queue_flag |= ENQUEUE_REPLENISH;
6461 p->dl.pi_se = &p->dl;
6463 p->sched_class = &dl_sched_class;
6464 } else if (rt_prio(prio)) {
6465 if (dl_prio(oldprio))
6466 p->dl.pi_se = &p->dl;
6468 queue_flag |= ENQUEUE_HEAD;
6469 p->sched_class = &rt_sched_class;
6471 if (dl_prio(oldprio))
6472 p->dl.pi_se = &p->dl;
6473 if (rt_prio(oldprio))
6475 p->sched_class = &fair_sched_class;
6481 enqueue_task(rq, p, queue_flag);
6483 set_next_task(rq, p);
6485 check_class_changed(rq, p, prev_class, oldprio);
6487 /* Avoid rq from going away on us: */
6490 rq_unpin_lock(rq, &rf);
6491 __balance_callbacks(rq);
6492 raw_spin_rq_unlock(rq);
6497 static inline int rt_effective_prio(struct task_struct *p, int prio)
6503 void set_user_nice(struct task_struct *p, long nice)
6505 bool queued, running;
6510 if (task_nice(p) == nice || nice < MIN_NICE || nice > MAX_NICE)
6513 * We have to be careful, if called from sys_setpriority(),
6514 * the task might be in the middle of scheduling on another CPU.
6516 rq = task_rq_lock(p, &rf);
6517 update_rq_clock(rq);
6520 * The RT priorities are set via sched_setscheduler(), but we still
6521 * allow the 'normal' nice value to be set - but as expected
6522 * it won't have any effect on scheduling until the task is
6523 * SCHED_DEADLINE, SCHED_FIFO or SCHED_RR:
6525 if (task_has_dl_policy(p) || task_has_rt_policy(p)) {
6526 p->static_prio = NICE_TO_PRIO(nice);
6529 queued = task_on_rq_queued(p);
6530 running = task_current(rq, p);
6532 dequeue_task(rq, p, DEQUEUE_SAVE | DEQUEUE_NOCLOCK);
6534 put_prev_task(rq, p);
6536 p->static_prio = NICE_TO_PRIO(nice);
6537 set_load_weight(p, true);
6539 p->prio = effective_prio(p);
6542 enqueue_task(rq, p, ENQUEUE_RESTORE | ENQUEUE_NOCLOCK);
6544 set_next_task(rq, p);
6547 * If the task increased its priority or is running and
6548 * lowered its priority, then reschedule its CPU:
6550 p->sched_class->prio_changed(rq, p, old_prio);
6553 task_rq_unlock(rq, p, &rf);
6555 EXPORT_SYMBOL(set_user_nice);
6558 * can_nice - check if a task can reduce its nice value
6562 int can_nice(const struct task_struct *p, const int nice)
6564 /* Convert nice value [19,-20] to rlimit style value [1,40]: */
6565 int nice_rlim = nice_to_rlimit(nice);
6567 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
6568 capable(CAP_SYS_NICE));
6571 #ifdef __ARCH_WANT_SYS_NICE
6574 * sys_nice - change the priority of the current process.
6575 * @increment: priority increment
6577 * sys_setpriority is a more generic, but much slower function that
6578 * does similar things.
6580 SYSCALL_DEFINE1(nice, int, increment)
6585 * Setpriority might change our priority at the same moment.
6586 * We don't have to worry. Conceptually one call occurs first
6587 * and we have a single winner.
6589 increment = clamp(increment, -NICE_WIDTH, NICE_WIDTH);
6590 nice = task_nice(current) + increment;
6592 nice = clamp_val(nice, MIN_NICE, MAX_NICE);
6593 if (increment < 0 && !can_nice(current, nice))
6596 retval = security_task_setnice(current, nice);
6600 set_user_nice(current, nice);
6607 * task_prio - return the priority value of a given task.
6608 * @p: the task in question.
6610 * Return: The priority value as seen by users in /proc.
6612 * sched policy return value kernel prio user prio/nice
6614 * normal, batch, idle [0 ... 39] [100 ... 139] 0/[-20 ... 19]
6615 * fifo, rr [-2 ... -100] [98 ... 0] [1 ... 99]
6616 * deadline -101 -1 0
6618 int task_prio(const struct task_struct *p)
6620 return p->prio - MAX_RT_PRIO;
6624 * idle_cpu - is a given CPU idle currently?
6625 * @cpu: the processor in question.
6627 * Return: 1 if the CPU is currently idle. 0 otherwise.
6629 int idle_cpu(int cpu)
6631 struct rq *rq = cpu_rq(cpu);
6633 if (rq->curr != rq->idle)
6640 if (rq->ttwu_pending)
6648 * available_idle_cpu - is a given CPU idle for enqueuing work.
6649 * @cpu: the CPU in question.
6651 * Return: 1 if the CPU is currently idle. 0 otherwise.
6653 int available_idle_cpu(int cpu)
6658 if (vcpu_is_preempted(cpu))
6665 * idle_task - return the idle task for a given CPU.
6666 * @cpu: the processor in question.
6668 * Return: The idle task for the CPU @cpu.
6670 struct task_struct *idle_task(int cpu)
6672 return cpu_rq(cpu)->idle;
6677 * This function computes an effective utilization for the given CPU, to be
6678 * used for frequency selection given the linear relation: f = u * f_max.
6680 * The scheduler tracks the following metrics:
6682 * cpu_util_{cfs,rt,dl,irq}()
6685 * Where the cfs,rt and dl util numbers are tracked with the same metric and
6686 * synchronized windows and are thus directly comparable.
6688 * The cfs,rt,dl utilization are the running times measured with rq->clock_task
6689 * which excludes things like IRQ and steal-time. These latter are then accrued
6690 * in the irq utilization.
6692 * The DL bandwidth number otoh is not a measured metric but a value computed
6693 * based on the task model parameters and gives the minimal utilization
6694 * required to meet deadlines.
6696 unsigned long effective_cpu_util(int cpu, unsigned long util_cfs,
6697 unsigned long max, enum cpu_util_type type,
6698 struct task_struct *p)
6700 unsigned long dl_util, util, irq;
6701 struct rq *rq = cpu_rq(cpu);
6703 if (!uclamp_is_used() &&
6704 type == FREQUENCY_UTIL && rt_rq_is_runnable(&rq->rt)) {
6709 * Early check to see if IRQ/steal time saturates the CPU, can be
6710 * because of inaccuracies in how we track these -- see
6711 * update_irq_load_avg().
6713 irq = cpu_util_irq(rq);
6714 if (unlikely(irq >= max))
6718 * Because the time spend on RT/DL tasks is visible as 'lost' time to
6719 * CFS tasks and we use the same metric to track the effective
6720 * utilization (PELT windows are synchronized) we can directly add them
6721 * to obtain the CPU's actual utilization.
6723 * CFS and RT utilization can be boosted or capped, depending on
6724 * utilization clamp constraints requested by currently RUNNABLE
6726 * When there are no CFS RUNNABLE tasks, clamps are released and
6727 * frequency will be gracefully reduced with the utilization decay.
6729 util = util_cfs + cpu_util_rt(rq);
6730 if (type == FREQUENCY_UTIL)
6731 util = uclamp_rq_util_with(rq, util, p);
6733 dl_util = cpu_util_dl(rq);
6736 * For frequency selection we do not make cpu_util_dl() a permanent part
6737 * of this sum because we want to use cpu_bw_dl() later on, but we need
6738 * to check if the CFS+RT+DL sum is saturated (ie. no idle time) such
6739 * that we select f_max when there is no idle time.
6741 * NOTE: numerical errors or stop class might cause us to not quite hit
6742 * saturation when we should -- something for later.
6744 if (util + dl_util >= max)
6748 * OTOH, for energy computation we need the estimated running time, so
6749 * include util_dl and ignore dl_bw.
6751 if (type == ENERGY_UTIL)
6755 * There is still idle time; further improve the number by using the
6756 * irq metric. Because IRQ/steal time is hidden from the task clock we
6757 * need to scale the task numbers:
6760 * U' = irq + --------- * U
6763 util = scale_irq_capacity(util, irq, max);
6767 * Bandwidth required by DEADLINE must always be granted while, for
6768 * FAIR and RT, we use blocked utilization of IDLE CPUs as a mechanism
6769 * to gracefully reduce the frequency when no tasks show up for longer
6772 * Ideally we would like to set bw_dl as min/guaranteed freq and util +
6773 * bw_dl as requested freq. However, cpufreq is not yet ready for such
6774 * an interface. So, we only do the latter for now.
6776 if (type == FREQUENCY_UTIL)
6777 util += cpu_bw_dl(rq);
6779 return min(max, util);
6782 unsigned long sched_cpu_util(int cpu, unsigned long max)
6784 return effective_cpu_util(cpu, cpu_util_cfs(cpu_rq(cpu)), max,
6787 #endif /* CONFIG_SMP */
6790 * find_process_by_pid - find a process with a matching PID value.
6791 * @pid: the pid in question.
6793 * The task of @pid, if found. %NULL otherwise.
6795 static struct task_struct *find_process_by_pid(pid_t pid)
6797 return pid ? find_task_by_vpid(pid) : current;
6801 * sched_setparam() passes in -1 for its policy, to let the functions
6802 * it calls know not to change it.
6804 #define SETPARAM_POLICY -1
6806 static void __setscheduler_params(struct task_struct *p,
6807 const struct sched_attr *attr)
6809 int policy = attr->sched_policy;
6811 if (policy == SETPARAM_POLICY)
6816 if (dl_policy(policy))
6817 __setparam_dl(p, attr);
6818 else if (fair_policy(policy))
6819 p->static_prio = NICE_TO_PRIO(attr->sched_nice);
6822 * __sched_setscheduler() ensures attr->sched_priority == 0 when
6823 * !rt_policy. Always setting this ensures that things like
6824 * getparam()/getattr() don't report silly values for !rt tasks.
6826 p->rt_priority = attr->sched_priority;
6827 p->normal_prio = normal_prio(p);
6828 set_load_weight(p, true);
6831 /* Actually do priority change: must hold pi & rq lock. */
6832 static void __setscheduler(struct rq *rq, struct task_struct *p,
6833 const struct sched_attr *attr, bool keep_boost)
6836 * If params can't change scheduling class changes aren't allowed
6839 if (attr->sched_flags & SCHED_FLAG_KEEP_PARAMS)
6842 __setscheduler_params(p, attr);
6845 * Keep a potential priority boosting if called from
6846 * sched_setscheduler().
6848 p->prio = normal_prio(p);
6850 p->prio = rt_effective_prio(p, p->prio);
6852 if (dl_prio(p->prio))
6853 p->sched_class = &dl_sched_class;
6854 else if (rt_prio(p->prio))
6855 p->sched_class = &rt_sched_class;
6857 p->sched_class = &fair_sched_class;
6861 * Check the target process has a UID that matches the current process's:
6863 static bool check_same_owner(struct task_struct *p)
6865 const struct cred *cred = current_cred(), *pcred;
6869 pcred = __task_cred(p);
6870 match = (uid_eq(cred->euid, pcred->euid) ||
6871 uid_eq(cred->euid, pcred->uid));
6876 static int __sched_setscheduler(struct task_struct *p,
6877 const struct sched_attr *attr,
6880 int newprio = dl_policy(attr->sched_policy) ? MAX_DL_PRIO - 1 :
6881 MAX_RT_PRIO - 1 - attr->sched_priority;
6882 int retval, oldprio, oldpolicy = -1, queued, running;
6883 int new_effective_prio, policy = attr->sched_policy;
6884 const struct sched_class *prev_class;
6885 struct callback_head *head;
6888 int queue_flags = DEQUEUE_SAVE | DEQUEUE_MOVE | DEQUEUE_NOCLOCK;
6891 /* The pi code expects interrupts enabled */
6892 BUG_ON(pi && in_interrupt());
6894 /* Double check policy once rq lock held: */
6896 reset_on_fork = p->sched_reset_on_fork;
6897 policy = oldpolicy = p->policy;
6899 reset_on_fork = !!(attr->sched_flags & SCHED_FLAG_RESET_ON_FORK);
6901 if (!valid_policy(policy))
6905 if (attr->sched_flags & ~(SCHED_FLAG_ALL | SCHED_FLAG_SUGOV))
6909 * Valid priorities for SCHED_FIFO and SCHED_RR are
6910 * 1..MAX_RT_PRIO-1, valid priority for SCHED_NORMAL,
6911 * SCHED_BATCH and SCHED_IDLE is 0.
6913 if (attr->sched_priority > MAX_RT_PRIO-1)
6915 if ((dl_policy(policy) && !__checkparam_dl(attr)) ||
6916 (rt_policy(policy) != (attr->sched_priority != 0)))
6920 * Allow unprivileged RT tasks to decrease priority:
6922 if (user && !capable(CAP_SYS_NICE)) {
6923 if (fair_policy(policy)) {
6924 if (attr->sched_nice < task_nice(p) &&
6925 !can_nice(p, attr->sched_nice))
6929 if (rt_policy(policy)) {
6930 unsigned long rlim_rtprio =
6931 task_rlimit(p, RLIMIT_RTPRIO);
6933 /* Can't set/change the rt policy: */
6934 if (policy != p->policy && !rlim_rtprio)
6937 /* Can't increase priority: */
6938 if (attr->sched_priority > p->rt_priority &&
6939 attr->sched_priority > rlim_rtprio)
6944 * Can't set/change SCHED_DEADLINE policy at all for now
6945 * (safest behavior); in the future we would like to allow
6946 * unprivileged DL tasks to increase their relative deadline
6947 * or reduce their runtime (both ways reducing utilization)
6949 if (dl_policy(policy))
6953 * Treat SCHED_IDLE as nice 20. Only allow a switch to
6954 * SCHED_NORMAL if the RLIMIT_NICE would normally permit it.
6956 if (task_has_idle_policy(p) && !idle_policy(policy)) {
6957 if (!can_nice(p, task_nice(p)))
6961 /* Can't change other user's priorities: */
6962 if (!check_same_owner(p))
6965 /* Normal users shall not reset the sched_reset_on_fork flag: */
6966 if (p->sched_reset_on_fork && !reset_on_fork)
6971 if (attr->sched_flags & SCHED_FLAG_SUGOV)
6974 retval = security_task_setscheduler(p);
6979 /* Update task specific "requested" clamps */
6980 if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP) {
6981 retval = uclamp_validate(p, attr);
6990 * Make sure no PI-waiters arrive (or leave) while we are
6991 * changing the priority of the task:
6993 * To be able to change p->policy safely, the appropriate
6994 * runqueue lock must be held.
6996 rq = task_rq_lock(p, &rf);
6997 update_rq_clock(rq);
7000 * Changing the policy of the stop threads its a very bad idea:
7002 if (p == rq->stop) {
7008 * If not changing anything there's no need to proceed further,
7009 * but store a possible modification of reset_on_fork.
7011 if (unlikely(policy == p->policy)) {
7012 if (fair_policy(policy) && attr->sched_nice != task_nice(p))
7014 if (rt_policy(policy) && attr->sched_priority != p->rt_priority)
7016 if (dl_policy(policy) && dl_param_changed(p, attr))
7018 if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP)
7021 p->sched_reset_on_fork = reset_on_fork;
7028 #ifdef CONFIG_RT_GROUP_SCHED
7030 * Do not allow realtime tasks into groups that have no runtime
7033 if (rt_bandwidth_enabled() && rt_policy(policy) &&
7034 task_group(p)->rt_bandwidth.rt_runtime == 0 &&
7035 !task_group_is_autogroup(task_group(p))) {
7041 if (dl_bandwidth_enabled() && dl_policy(policy) &&
7042 !(attr->sched_flags & SCHED_FLAG_SUGOV)) {
7043 cpumask_t *span = rq->rd->span;
7046 * Don't allow tasks with an affinity mask smaller than
7047 * the entire root_domain to become SCHED_DEADLINE. We
7048 * will also fail if there's no bandwidth available.
7050 if (!cpumask_subset(span, p->cpus_ptr) ||
7051 rq->rd->dl_bw.bw == 0) {
7059 /* Re-check policy now with rq lock held: */
7060 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
7061 policy = oldpolicy = -1;
7062 task_rq_unlock(rq, p, &rf);
7064 cpuset_read_unlock();
7069 * If setscheduling to SCHED_DEADLINE (or changing the parameters
7070 * of a SCHED_DEADLINE task) we need to check if enough bandwidth
7073 if ((dl_policy(policy) || dl_task(p)) && sched_dl_overflow(p, policy, attr)) {
7078 p->sched_reset_on_fork = reset_on_fork;
7083 * Take priority boosted tasks into account. If the new
7084 * effective priority is unchanged, we just store the new
7085 * normal parameters and do not touch the scheduler class and
7086 * the runqueue. This will be done when the task deboost
7089 new_effective_prio = rt_effective_prio(p, newprio);
7090 if (new_effective_prio == oldprio)
7091 queue_flags &= ~DEQUEUE_MOVE;
7094 queued = task_on_rq_queued(p);
7095 running = task_current(rq, p);
7097 dequeue_task(rq, p, queue_flags);
7099 put_prev_task(rq, p);
7101 prev_class = p->sched_class;
7103 __setscheduler(rq, p, attr, pi);
7104 __setscheduler_uclamp(p, attr);
7108 * We enqueue to tail when the priority of a task is
7109 * increased (user space view).
7111 if (oldprio < p->prio)
7112 queue_flags |= ENQUEUE_HEAD;
7114 enqueue_task(rq, p, queue_flags);
7117 set_next_task(rq, p);
7119 check_class_changed(rq, p, prev_class, oldprio);
7121 /* Avoid rq from going away on us: */
7123 head = splice_balance_callbacks(rq);
7124 task_rq_unlock(rq, p, &rf);
7127 cpuset_read_unlock();
7128 rt_mutex_adjust_pi(p);
7131 /* Run balance callbacks after we've adjusted the PI chain: */
7132 balance_callbacks(rq, head);
7138 task_rq_unlock(rq, p, &rf);
7140 cpuset_read_unlock();
7144 static int _sched_setscheduler(struct task_struct *p, int policy,
7145 const struct sched_param *param, bool check)
7147 struct sched_attr attr = {
7148 .sched_policy = policy,
7149 .sched_priority = param->sched_priority,
7150 .sched_nice = PRIO_TO_NICE(p->static_prio),
7153 /* Fixup the legacy SCHED_RESET_ON_FORK hack. */
7154 if ((policy != SETPARAM_POLICY) && (policy & SCHED_RESET_ON_FORK)) {
7155 attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
7156 policy &= ~SCHED_RESET_ON_FORK;
7157 attr.sched_policy = policy;
7160 return __sched_setscheduler(p, &attr, check, true);
7163 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
7164 * @p: the task in question.
7165 * @policy: new policy.
7166 * @param: structure containing the new RT priority.
7168 * Use sched_set_fifo(), read its comment.
7170 * Return: 0 on success. An error code otherwise.
7172 * NOTE that the task may be already dead.
7174 int sched_setscheduler(struct task_struct *p, int policy,
7175 const struct sched_param *param)
7177 return _sched_setscheduler(p, policy, param, true);
7180 int sched_setattr(struct task_struct *p, const struct sched_attr *attr)
7182 return __sched_setscheduler(p, attr, true, true);
7185 int sched_setattr_nocheck(struct task_struct *p, const struct sched_attr *attr)
7187 return __sched_setscheduler(p, attr, false, true);
7189 EXPORT_SYMBOL_GPL(sched_setattr_nocheck);
7192 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
7193 * @p: the task in question.
7194 * @policy: new policy.
7195 * @param: structure containing the new RT priority.
7197 * Just like sched_setscheduler, only don't bother checking if the
7198 * current context has permission. For example, this is needed in
7199 * stop_machine(): we create temporary high priority worker threads,
7200 * but our caller might not have that capability.
7202 * Return: 0 on success. An error code otherwise.
7204 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
7205 const struct sched_param *param)
7207 return _sched_setscheduler(p, policy, param, false);
7211 * SCHED_FIFO is a broken scheduler model; that is, it is fundamentally
7212 * incapable of resource management, which is the one thing an OS really should
7215 * This is of course the reason it is limited to privileged users only.
7217 * Worse still; it is fundamentally impossible to compose static priority
7218 * workloads. You cannot take two correctly working static prio workloads
7219 * and smash them together and still expect them to work.
7221 * For this reason 'all' FIFO tasks the kernel creates are basically at:
7225 * The administrator _MUST_ configure the system, the kernel simply doesn't
7226 * know enough information to make a sensible choice.
7228 void sched_set_fifo(struct task_struct *p)
7230 struct sched_param sp = { .sched_priority = MAX_RT_PRIO / 2 };
7231 WARN_ON_ONCE(sched_setscheduler_nocheck(p, SCHED_FIFO, &sp) != 0);
7233 EXPORT_SYMBOL_GPL(sched_set_fifo);
7236 * For when you don't much care about FIFO, but want to be above SCHED_NORMAL.
7238 void sched_set_fifo_low(struct task_struct *p)
7240 struct sched_param sp = { .sched_priority = 1 };
7241 WARN_ON_ONCE(sched_setscheduler_nocheck(p, SCHED_FIFO, &sp) != 0);
7243 EXPORT_SYMBOL_GPL(sched_set_fifo_low);
7245 void sched_set_normal(struct task_struct *p, int nice)
7247 struct sched_attr attr = {
7248 .sched_policy = SCHED_NORMAL,
7251 WARN_ON_ONCE(sched_setattr_nocheck(p, &attr) != 0);
7253 EXPORT_SYMBOL_GPL(sched_set_normal);
7256 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
7258 struct sched_param lparam;
7259 struct task_struct *p;
7262 if (!param || pid < 0)
7264 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
7269 p = find_process_by_pid(pid);
7275 retval = sched_setscheduler(p, policy, &lparam);
7283 * Mimics kernel/events/core.c perf_copy_attr().
7285 static int sched_copy_attr(struct sched_attr __user *uattr, struct sched_attr *attr)
7290 /* Zero the full structure, so that a short copy will be nice: */
7291 memset(attr, 0, sizeof(*attr));
7293 ret = get_user(size, &uattr->size);
7297 /* ABI compatibility quirk: */
7299 size = SCHED_ATTR_SIZE_VER0;
7300 if (size < SCHED_ATTR_SIZE_VER0 || size > PAGE_SIZE)
7303 ret = copy_struct_from_user(attr, sizeof(*attr), uattr, size);
7310 if ((attr->sched_flags & SCHED_FLAG_UTIL_CLAMP) &&
7311 size < SCHED_ATTR_SIZE_VER1)
7315 * XXX: Do we want to be lenient like existing syscalls; or do we want
7316 * to be strict and return an error on out-of-bounds values?
7318 attr->sched_nice = clamp(attr->sched_nice, MIN_NICE, MAX_NICE);
7323 put_user(sizeof(*attr), &uattr->size);
7328 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
7329 * @pid: the pid in question.
7330 * @policy: new policy.
7331 * @param: structure containing the new RT priority.
7333 * Return: 0 on success. An error code otherwise.
7335 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy, struct sched_param __user *, param)
7340 return do_sched_setscheduler(pid, policy, param);
7344 * sys_sched_setparam - set/change the RT priority of a thread
7345 * @pid: the pid in question.
7346 * @param: structure containing the new RT priority.
7348 * Return: 0 on success. An error code otherwise.
7350 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
7352 return do_sched_setscheduler(pid, SETPARAM_POLICY, param);
7356 * sys_sched_setattr - same as above, but with extended sched_attr
7357 * @pid: the pid in question.
7358 * @uattr: structure containing the extended parameters.
7359 * @flags: for future extension.
7361 SYSCALL_DEFINE3(sched_setattr, pid_t, pid, struct sched_attr __user *, uattr,
7362 unsigned int, flags)
7364 struct sched_attr attr;
7365 struct task_struct *p;
7368 if (!uattr || pid < 0 || flags)
7371 retval = sched_copy_attr(uattr, &attr);
7375 if ((int)attr.sched_policy < 0)
7377 if (attr.sched_flags & SCHED_FLAG_KEEP_POLICY)
7378 attr.sched_policy = SETPARAM_POLICY;
7382 p = find_process_by_pid(pid);
7388 retval = sched_setattr(p, &attr);
7396 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
7397 * @pid: the pid in question.
7399 * Return: On success, the policy of the thread. Otherwise, a negative error
7402 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
7404 struct task_struct *p;
7412 p = find_process_by_pid(pid);
7414 retval = security_task_getscheduler(p);
7417 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
7424 * sys_sched_getparam - get the RT priority of a thread
7425 * @pid: the pid in question.
7426 * @param: structure containing the RT priority.
7428 * Return: On success, 0 and the RT priority is in @param. Otherwise, an error
7431 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
7433 struct sched_param lp = { .sched_priority = 0 };
7434 struct task_struct *p;
7437 if (!param || pid < 0)
7441 p = find_process_by_pid(pid);
7446 retval = security_task_getscheduler(p);
7450 if (task_has_rt_policy(p))
7451 lp.sched_priority = p->rt_priority;
7455 * This one might sleep, we cannot do it with a spinlock held ...
7457 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
7467 * Copy the kernel size attribute structure (which might be larger
7468 * than what user-space knows about) to user-space.
7470 * Note that all cases are valid: user-space buffer can be larger or
7471 * smaller than the kernel-space buffer. The usual case is that both
7472 * have the same size.
7475 sched_attr_copy_to_user(struct sched_attr __user *uattr,
7476 struct sched_attr *kattr,
7479 unsigned int ksize = sizeof(*kattr);
7481 if (!access_ok(uattr, usize))
7485 * sched_getattr() ABI forwards and backwards compatibility:
7487 * If usize == ksize then we just copy everything to user-space and all is good.
7489 * If usize < ksize then we only copy as much as user-space has space for,
7490 * this keeps ABI compatibility as well. We skip the rest.
7492 * If usize > ksize then user-space is using a newer version of the ABI,
7493 * which part the kernel doesn't know about. Just ignore it - tooling can
7494 * detect the kernel's knowledge of attributes from the attr->size value
7495 * which is set to ksize in this case.
7497 kattr->size = min(usize, ksize);
7499 if (copy_to_user(uattr, kattr, kattr->size))
7506 * sys_sched_getattr - similar to sched_getparam, but with sched_attr
7507 * @pid: the pid in question.
7508 * @uattr: structure containing the extended parameters.
7509 * @usize: sizeof(attr) for fwd/bwd comp.
7510 * @flags: for future extension.
7512 SYSCALL_DEFINE4(sched_getattr, pid_t, pid, struct sched_attr __user *, uattr,
7513 unsigned int, usize, unsigned int, flags)
7515 struct sched_attr kattr = { };
7516 struct task_struct *p;
7519 if (!uattr || pid < 0 || usize > PAGE_SIZE ||
7520 usize < SCHED_ATTR_SIZE_VER0 || flags)
7524 p = find_process_by_pid(pid);
7529 retval = security_task_getscheduler(p);
7533 kattr.sched_policy = p->policy;
7534 if (p->sched_reset_on_fork)
7535 kattr.sched_flags |= SCHED_FLAG_RESET_ON_FORK;
7536 if (task_has_dl_policy(p))
7537 __getparam_dl(p, &kattr);
7538 else if (task_has_rt_policy(p))
7539 kattr.sched_priority = p->rt_priority;
7541 kattr.sched_nice = task_nice(p);
7543 #ifdef CONFIG_UCLAMP_TASK
7545 * This could race with another potential updater, but this is fine
7546 * because it'll correctly read the old or the new value. We don't need
7547 * to guarantee who wins the race as long as it doesn't return garbage.
7549 kattr.sched_util_min = p->uclamp_req[UCLAMP_MIN].value;
7550 kattr.sched_util_max = p->uclamp_req[UCLAMP_MAX].value;
7555 return sched_attr_copy_to_user(uattr, &kattr, usize);
7562 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
7564 cpumask_var_t cpus_allowed, new_mask;
7565 struct task_struct *p;
7570 p = find_process_by_pid(pid);
7576 /* Prevent p going away */
7580 if (p->flags & PF_NO_SETAFFINITY) {
7584 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
7588 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
7590 goto out_free_cpus_allowed;
7593 if (!check_same_owner(p)) {
7595 if (!ns_capable(__task_cred(p)->user_ns, CAP_SYS_NICE)) {
7597 goto out_free_new_mask;
7602 retval = security_task_setscheduler(p);
7604 goto out_free_new_mask;
7607 cpuset_cpus_allowed(p, cpus_allowed);
7608 cpumask_and(new_mask, in_mask, cpus_allowed);
7611 * Since bandwidth control happens on root_domain basis,
7612 * if admission test is enabled, we only admit -deadline
7613 * tasks allowed to run on all the CPUs in the task's
7617 if (task_has_dl_policy(p) && dl_bandwidth_enabled()) {
7619 if (!cpumask_subset(task_rq(p)->rd->span, new_mask)) {
7622 goto out_free_new_mask;
7628 retval = __set_cpus_allowed_ptr(p, new_mask, SCA_CHECK);
7631 cpuset_cpus_allowed(p, cpus_allowed);
7632 if (!cpumask_subset(new_mask, cpus_allowed)) {
7634 * We must have raced with a concurrent cpuset
7635 * update. Just reset the cpus_allowed to the
7636 * cpuset's cpus_allowed
7638 cpumask_copy(new_mask, cpus_allowed);
7643 free_cpumask_var(new_mask);
7644 out_free_cpus_allowed:
7645 free_cpumask_var(cpus_allowed);
7651 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
7652 struct cpumask *new_mask)
7654 if (len < cpumask_size())
7655 cpumask_clear(new_mask);
7656 else if (len > cpumask_size())
7657 len = cpumask_size();
7659 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
7663 * sys_sched_setaffinity - set the CPU affinity of a process
7664 * @pid: pid of the process
7665 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
7666 * @user_mask_ptr: user-space pointer to the new CPU mask
7668 * Return: 0 on success. An error code otherwise.
7670 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
7671 unsigned long __user *, user_mask_ptr)
7673 cpumask_var_t new_mask;
7676 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
7679 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
7681 retval = sched_setaffinity(pid, new_mask);
7682 free_cpumask_var(new_mask);
7686 long sched_getaffinity(pid_t pid, struct cpumask *mask)
7688 struct task_struct *p;
7689 unsigned long flags;
7695 p = find_process_by_pid(pid);
7699 retval = security_task_getscheduler(p);
7703 raw_spin_lock_irqsave(&p->pi_lock, flags);
7704 cpumask_and(mask, &p->cpus_mask, cpu_active_mask);
7705 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
7714 * sys_sched_getaffinity - get the CPU affinity of a process
7715 * @pid: pid of the process
7716 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
7717 * @user_mask_ptr: user-space pointer to hold the current CPU mask
7719 * Return: size of CPU mask copied to user_mask_ptr on success. An
7720 * error code otherwise.
7722 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
7723 unsigned long __user *, user_mask_ptr)
7728 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
7730 if (len & (sizeof(unsigned long)-1))
7733 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
7736 ret = sched_getaffinity(pid, mask);
7738 unsigned int retlen = min(len, cpumask_size());
7740 if (copy_to_user(user_mask_ptr, mask, retlen))
7745 free_cpumask_var(mask);
7750 static void do_sched_yield(void)
7755 rq = this_rq_lock_irq(&rf);
7757 schedstat_inc(rq->yld_count);
7758 current->sched_class->yield_task(rq);
7761 rq_unlock_irq(rq, &rf);
7762 sched_preempt_enable_no_resched();
7768 * sys_sched_yield - yield the current processor to other threads.
7770 * This function yields the current CPU to other tasks. If there are no
7771 * other threads running on this CPU then this function will return.
7775 SYSCALL_DEFINE0(sched_yield)
7781 #if !defined(CONFIG_PREEMPTION) || defined(CONFIG_PREEMPT_DYNAMIC)
7782 int __sched __cond_resched(void)
7784 if (should_resched(0)) {
7785 preempt_schedule_common();
7788 #ifndef CONFIG_PREEMPT_RCU
7793 EXPORT_SYMBOL(__cond_resched);
7796 #ifdef CONFIG_PREEMPT_DYNAMIC
7797 DEFINE_STATIC_CALL_RET0(cond_resched, __cond_resched);
7798 EXPORT_STATIC_CALL_TRAMP(cond_resched);
7800 DEFINE_STATIC_CALL_RET0(might_resched, __cond_resched);
7801 EXPORT_STATIC_CALL_TRAMP(might_resched);
7805 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
7806 * call schedule, and on return reacquire the lock.
7808 * This works OK both with and without CONFIG_PREEMPTION. We do strange low-level
7809 * operations here to prevent schedule() from being called twice (once via
7810 * spin_unlock(), once by hand).
7812 int __cond_resched_lock(spinlock_t *lock)
7814 int resched = should_resched(PREEMPT_LOCK_OFFSET);
7817 lockdep_assert_held(lock);
7819 if (spin_needbreak(lock) || resched) {
7822 preempt_schedule_common();
7830 EXPORT_SYMBOL(__cond_resched_lock);
7832 int __cond_resched_rwlock_read(rwlock_t *lock)
7834 int resched = should_resched(PREEMPT_LOCK_OFFSET);
7837 lockdep_assert_held_read(lock);
7839 if (rwlock_needbreak(lock) || resched) {
7842 preempt_schedule_common();
7850 EXPORT_SYMBOL(__cond_resched_rwlock_read);
7852 int __cond_resched_rwlock_write(rwlock_t *lock)
7854 int resched = should_resched(PREEMPT_LOCK_OFFSET);
7857 lockdep_assert_held_write(lock);
7859 if (rwlock_needbreak(lock) || resched) {
7862 preempt_schedule_common();
7870 EXPORT_SYMBOL(__cond_resched_rwlock_write);
7873 * yield - yield the current processor to other threads.
7875 * Do not ever use this function, there's a 99% chance you're doing it wrong.
7877 * The scheduler is at all times free to pick the calling task as the most
7878 * eligible task to run, if removing the yield() call from your code breaks
7879 * it, it's already broken.
7881 * Typical broken usage is:
7886 * where one assumes that yield() will let 'the other' process run that will
7887 * make event true. If the current task is a SCHED_FIFO task that will never
7888 * happen. Never use yield() as a progress guarantee!!
7890 * If you want to use yield() to wait for something, use wait_event().
7891 * If you want to use yield() to be 'nice' for others, use cond_resched().
7892 * If you still want to use yield(), do not!
7894 void __sched yield(void)
7896 set_current_state(TASK_RUNNING);
7899 EXPORT_SYMBOL(yield);
7902 * yield_to - yield the current processor to another thread in
7903 * your thread group, or accelerate that thread toward the
7904 * processor it's on.
7906 * @preempt: whether task preemption is allowed or not
7908 * It's the caller's job to ensure that the target task struct
7909 * can't go away on us before we can do any checks.
7912 * true (>0) if we indeed boosted the target task.
7913 * false (0) if we failed to boost the target.
7914 * -ESRCH if there's no task to yield to.
7916 int __sched yield_to(struct task_struct *p, bool preempt)
7918 struct task_struct *curr = current;
7919 struct rq *rq, *p_rq;
7920 unsigned long flags;
7923 local_irq_save(flags);
7929 * If we're the only runnable task on the rq and target rq also
7930 * has only one task, there's absolutely no point in yielding.
7932 if (rq->nr_running == 1 && p_rq->nr_running == 1) {
7937 double_rq_lock(rq, p_rq);
7938 if (task_rq(p) != p_rq) {
7939 double_rq_unlock(rq, p_rq);
7943 if (!curr->sched_class->yield_to_task)
7946 if (curr->sched_class != p->sched_class)
7949 if (task_running(p_rq, p) || p->state)
7952 yielded = curr->sched_class->yield_to_task(rq, p);
7954 schedstat_inc(rq->yld_count);
7956 * Make p's CPU reschedule; pick_next_entity takes care of
7959 if (preempt && rq != p_rq)
7964 double_rq_unlock(rq, p_rq);
7966 local_irq_restore(flags);
7973 EXPORT_SYMBOL_GPL(yield_to);
7975 int io_schedule_prepare(void)
7977 int old_iowait = current->in_iowait;
7979 current->in_iowait = 1;
7980 blk_schedule_flush_plug(current);
7985 void io_schedule_finish(int token)
7987 current->in_iowait = token;
7991 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
7992 * that process accounting knows that this is a task in IO wait state.
7994 long __sched io_schedule_timeout(long timeout)
7999 token = io_schedule_prepare();
8000 ret = schedule_timeout(timeout);
8001 io_schedule_finish(token);
8005 EXPORT_SYMBOL(io_schedule_timeout);
8007 void __sched io_schedule(void)
8011 token = io_schedule_prepare();
8013 io_schedule_finish(token);
8015 EXPORT_SYMBOL(io_schedule);
8018 * sys_sched_get_priority_max - return maximum RT priority.
8019 * @policy: scheduling class.
8021 * Return: On success, this syscall returns the maximum
8022 * rt_priority that can be used by a given scheduling class.
8023 * On failure, a negative error code is returned.
8025 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
8032 ret = MAX_RT_PRIO-1;
8034 case SCHED_DEADLINE:
8045 * sys_sched_get_priority_min - return minimum RT priority.
8046 * @policy: scheduling class.
8048 * Return: On success, this syscall returns the minimum
8049 * rt_priority that can be used by a given scheduling class.
8050 * On failure, a negative error code is returned.
8052 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
8061 case SCHED_DEADLINE:
8070 static int sched_rr_get_interval(pid_t pid, struct timespec64 *t)
8072 struct task_struct *p;
8073 unsigned int time_slice;
8083 p = find_process_by_pid(pid);
8087 retval = security_task_getscheduler(p);
8091 rq = task_rq_lock(p, &rf);
8093 if (p->sched_class->get_rr_interval)
8094 time_slice = p->sched_class->get_rr_interval(rq, p);
8095 task_rq_unlock(rq, p, &rf);
8098 jiffies_to_timespec64(time_slice, t);
8107 * sys_sched_rr_get_interval - return the default timeslice of a process.
8108 * @pid: pid of the process.
8109 * @interval: userspace pointer to the timeslice value.
8111 * this syscall writes the default timeslice value of a given process
8112 * into the user-space timespec buffer. A value of '0' means infinity.
8114 * Return: On success, 0 and the timeslice is in @interval. Otherwise,
8117 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
8118 struct __kernel_timespec __user *, interval)
8120 struct timespec64 t;
8121 int retval = sched_rr_get_interval(pid, &t);
8124 retval = put_timespec64(&t, interval);
8129 #ifdef CONFIG_COMPAT_32BIT_TIME
8130 SYSCALL_DEFINE2(sched_rr_get_interval_time32, pid_t, pid,
8131 struct old_timespec32 __user *, interval)
8133 struct timespec64 t;
8134 int retval = sched_rr_get_interval(pid, &t);
8137 retval = put_old_timespec32(&t, interval);
8142 void sched_show_task(struct task_struct *p)
8144 unsigned long free = 0;
8147 if (!try_get_task_stack(p))
8150 pr_info("task:%-15.15s state:%c", p->comm, task_state_to_char(p));
8152 if (p->state == TASK_RUNNING)
8153 pr_cont(" running task ");
8154 #ifdef CONFIG_DEBUG_STACK_USAGE
8155 free = stack_not_used(p);
8160 ppid = task_pid_nr(rcu_dereference(p->real_parent));
8162 pr_cont(" stack:%5lu pid:%5d ppid:%6d flags:0x%08lx\n",
8163 free, task_pid_nr(p), ppid,
8164 (unsigned long)task_thread_info(p)->flags);
8166 print_worker_info(KERN_INFO, p);
8167 print_stop_info(KERN_INFO, p);
8168 show_stack(p, NULL, KERN_INFO);
8171 EXPORT_SYMBOL_GPL(sched_show_task);
8174 state_filter_match(unsigned long state_filter, struct task_struct *p)
8176 /* no filter, everything matches */
8180 /* filter, but doesn't match */
8181 if (!(p->state & state_filter))
8185 * When looking for TASK_UNINTERRUPTIBLE skip TASK_IDLE (allows
8188 if (state_filter == TASK_UNINTERRUPTIBLE && p->state == TASK_IDLE)
8195 void show_state_filter(unsigned long state_filter)
8197 struct task_struct *g, *p;
8200 for_each_process_thread(g, p) {
8202 * reset the NMI-timeout, listing all files on a slow
8203 * console might take a lot of time:
8204 * Also, reset softlockup watchdogs on all CPUs, because
8205 * another CPU might be blocked waiting for us to process
8208 touch_nmi_watchdog();
8209 touch_all_softlockup_watchdogs();
8210 if (state_filter_match(state_filter, p))
8214 #ifdef CONFIG_SCHED_DEBUG
8216 sysrq_sched_debug_show();
8220 * Only show locks if all tasks are dumped:
8223 debug_show_all_locks();
8227 * init_idle - set up an idle thread for a given CPU
8228 * @idle: task in question
8229 * @cpu: CPU the idle task belongs to
8231 * NOTE: this function does not set the idle thread's NEED_RESCHED
8232 * flag, to make booting more robust.
8234 void __init init_idle(struct task_struct *idle, int cpu)
8236 struct rq *rq = cpu_rq(cpu);
8237 unsigned long flags;
8239 __sched_fork(0, idle);
8242 * The idle task doesn't need the kthread struct to function, but it
8243 * is dressed up as a per-CPU kthread and thus needs to play the part
8244 * if we want to avoid special-casing it in code that deals with per-CPU
8247 set_kthread_struct(idle);
8249 raw_spin_lock_irqsave(&idle->pi_lock, flags);
8250 raw_spin_rq_lock(rq);
8252 idle->state = TASK_RUNNING;
8253 idle->se.exec_start = sched_clock();
8255 * PF_KTHREAD should already be set at this point; regardless, make it
8256 * look like a proper per-CPU kthread.
8258 idle->flags |= PF_IDLE | PF_KTHREAD | PF_NO_SETAFFINITY;
8259 kthread_set_per_cpu(idle, cpu);
8261 scs_task_reset(idle);
8262 kasan_unpoison_task_stack(idle);
8266 * It's possible that init_idle() gets called multiple times on a task,
8267 * in that case do_set_cpus_allowed() will not do the right thing.
8269 * And since this is boot we can forgo the serialization.
8271 set_cpus_allowed_common(idle, cpumask_of(cpu), 0);
8274 * We're having a chicken and egg problem, even though we are
8275 * holding rq->lock, the CPU isn't yet set to this CPU so the
8276 * lockdep check in task_group() will fail.
8278 * Similar case to sched_fork(). / Alternatively we could
8279 * use task_rq_lock() here and obtain the other rq->lock.
8284 __set_task_cpu(idle, cpu);
8288 rcu_assign_pointer(rq->curr, idle);
8289 idle->on_rq = TASK_ON_RQ_QUEUED;
8293 raw_spin_rq_unlock(rq);
8294 raw_spin_unlock_irqrestore(&idle->pi_lock, flags);
8296 /* Set the preempt count _outside_ the spinlocks! */
8297 init_idle_preempt_count(idle, cpu);
8300 * The idle tasks have their own, simple scheduling class:
8302 idle->sched_class = &idle_sched_class;
8303 ftrace_graph_init_idle_task(idle, cpu);
8304 vtime_init_idle(idle, cpu);
8306 sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu);
8312 int cpuset_cpumask_can_shrink(const struct cpumask *cur,
8313 const struct cpumask *trial)
8317 if (!cpumask_weight(cur))
8320 ret = dl_cpuset_cpumask_can_shrink(cur, trial);
8325 int task_can_attach(struct task_struct *p,
8326 const struct cpumask *cs_cpus_allowed)
8331 * Kthreads which disallow setaffinity shouldn't be moved
8332 * to a new cpuset; we don't want to change their CPU
8333 * affinity and isolating such threads by their set of
8334 * allowed nodes is unnecessary. Thus, cpusets are not
8335 * applicable for such threads. This prevents checking for
8336 * success of set_cpus_allowed_ptr() on all attached tasks
8337 * before cpus_mask may be changed.
8339 if (p->flags & PF_NO_SETAFFINITY) {
8344 if (dl_task(p) && !cpumask_intersects(task_rq(p)->rd->span,
8346 ret = dl_task_can_attach(p, cs_cpus_allowed);
8352 bool sched_smp_initialized __read_mostly;
8354 #ifdef CONFIG_NUMA_BALANCING
8355 /* Migrate current task p to target_cpu */
8356 int migrate_task_to(struct task_struct *p, int target_cpu)
8358 struct migration_arg arg = { p, target_cpu };
8359 int curr_cpu = task_cpu(p);
8361 if (curr_cpu == target_cpu)
8364 if (!cpumask_test_cpu(target_cpu, p->cpus_ptr))
8367 /* TODO: This is not properly updating schedstats */
8369 trace_sched_move_numa(p, curr_cpu, target_cpu);
8370 return stop_one_cpu(curr_cpu, migration_cpu_stop, &arg);
8374 * Requeue a task on a given node and accurately track the number of NUMA
8375 * tasks on the runqueues
8377 void sched_setnuma(struct task_struct *p, int nid)
8379 bool queued, running;
8383 rq = task_rq_lock(p, &rf);
8384 queued = task_on_rq_queued(p);
8385 running = task_current(rq, p);
8388 dequeue_task(rq, p, DEQUEUE_SAVE);
8390 put_prev_task(rq, p);
8392 p->numa_preferred_nid = nid;
8395 enqueue_task(rq, p, ENQUEUE_RESTORE | ENQUEUE_NOCLOCK);
8397 set_next_task(rq, p);
8398 task_rq_unlock(rq, p, &rf);
8400 #endif /* CONFIG_NUMA_BALANCING */
8402 #ifdef CONFIG_HOTPLUG_CPU
8404 * Ensure that the idle task is using init_mm right before its CPU goes
8407 void idle_task_exit(void)
8409 struct mm_struct *mm = current->active_mm;
8411 BUG_ON(cpu_online(smp_processor_id()));
8412 BUG_ON(current != this_rq()->idle);
8414 if (mm != &init_mm) {
8415 switch_mm(mm, &init_mm, current);
8416 finish_arch_post_lock_switch();
8419 /* finish_cpu(), as ran on the BP, will clean up the active_mm state */
8422 static int __balance_push_cpu_stop(void *arg)
8424 struct task_struct *p = arg;
8425 struct rq *rq = this_rq();
8429 raw_spin_lock_irq(&p->pi_lock);
8432 update_rq_clock(rq);
8434 if (task_rq(p) == rq && task_on_rq_queued(p)) {
8435 cpu = select_fallback_rq(rq->cpu, p);
8436 rq = __migrate_task(rq, &rf, p, cpu);
8440 raw_spin_unlock_irq(&p->pi_lock);
8447 static DEFINE_PER_CPU(struct cpu_stop_work, push_work);
8450 * Ensure we only run per-cpu kthreads once the CPU goes !active.
8452 * This is enabled below SCHED_AP_ACTIVE; when !cpu_active(), but only
8453 * effective when the hotplug motion is down.
8455 static void balance_push(struct rq *rq)
8457 struct task_struct *push_task = rq->curr;
8459 lockdep_assert_rq_held(rq);
8460 SCHED_WARN_ON(rq->cpu != smp_processor_id());
8463 * Ensure the thing is persistent until balance_push_set(.on = false);
8465 rq->balance_callback = &balance_push_callback;
8468 * Only active while going offline.
8470 if (!cpu_dying(rq->cpu))
8474 * Both the cpu-hotplug and stop task are in this case and are
8475 * required to complete the hotplug process.
8477 if (kthread_is_per_cpu(push_task) ||
8478 is_migration_disabled(push_task)) {
8481 * If this is the idle task on the outgoing CPU try to wake
8482 * up the hotplug control thread which might wait for the
8483 * last task to vanish. The rcuwait_active() check is
8484 * accurate here because the waiter is pinned on this CPU
8485 * and can't obviously be running in parallel.
8487 * On RT kernels this also has to check whether there are
8488 * pinned and scheduled out tasks on the runqueue. They
8489 * need to leave the migrate disabled section first.
8491 if (!rq->nr_running && !rq_has_pinned_tasks(rq) &&
8492 rcuwait_active(&rq->hotplug_wait)) {
8493 raw_spin_rq_unlock(rq);
8494 rcuwait_wake_up(&rq->hotplug_wait);
8495 raw_spin_rq_lock(rq);
8500 get_task_struct(push_task);
8502 * Temporarily drop rq->lock such that we can wake-up the stop task.
8503 * Both preemption and IRQs are still disabled.
8505 raw_spin_rq_unlock(rq);
8506 stop_one_cpu_nowait(rq->cpu, __balance_push_cpu_stop, push_task,
8507 this_cpu_ptr(&push_work));
8509 * At this point need_resched() is true and we'll take the loop in
8510 * schedule(). The next pick is obviously going to be the stop task
8511 * which kthread_is_per_cpu() and will push this task away.
8513 raw_spin_rq_lock(rq);
8516 static void balance_push_set(int cpu, bool on)
8518 struct rq *rq = cpu_rq(cpu);
8521 rq_lock_irqsave(rq, &rf);
8523 WARN_ON_ONCE(rq->balance_callback);
8524 rq->balance_callback = &balance_push_callback;
8525 } else if (rq->balance_callback == &balance_push_callback) {
8526 rq->balance_callback = NULL;
8528 rq_unlock_irqrestore(rq, &rf);
8532 * Invoked from a CPUs hotplug control thread after the CPU has been marked
8533 * inactive. All tasks which are not per CPU kernel threads are either
8534 * pushed off this CPU now via balance_push() or placed on a different CPU
8535 * during wakeup. Wait until the CPU is quiescent.
8537 static void balance_hotplug_wait(void)
8539 struct rq *rq = this_rq();
8541 rcuwait_wait_event(&rq->hotplug_wait,
8542 rq->nr_running == 1 && !rq_has_pinned_tasks(rq),
8543 TASK_UNINTERRUPTIBLE);
8548 static inline void balance_push(struct rq *rq)
8552 static inline void balance_push_set(int cpu, bool on)
8556 static inline void balance_hotplug_wait(void)
8560 #endif /* CONFIG_HOTPLUG_CPU */
8562 void set_rq_online(struct rq *rq)
8565 const struct sched_class *class;
8567 cpumask_set_cpu(rq->cpu, rq->rd->online);
8570 for_each_class(class) {
8571 if (class->rq_online)
8572 class->rq_online(rq);
8577 void set_rq_offline(struct rq *rq)
8580 const struct sched_class *class;
8582 for_each_class(class) {
8583 if (class->rq_offline)
8584 class->rq_offline(rq);
8587 cpumask_clear_cpu(rq->cpu, rq->rd->online);
8593 * used to mark begin/end of suspend/resume:
8595 static int num_cpus_frozen;
8598 * Update cpusets according to cpu_active mask. If cpusets are
8599 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
8600 * around partition_sched_domains().
8602 * If we come here as part of a suspend/resume, don't touch cpusets because we
8603 * want to restore it back to its original state upon resume anyway.
8605 static void cpuset_cpu_active(void)
8607 if (cpuhp_tasks_frozen) {
8609 * num_cpus_frozen tracks how many CPUs are involved in suspend
8610 * resume sequence. As long as this is not the last online
8611 * operation in the resume sequence, just build a single sched
8612 * domain, ignoring cpusets.
8614 partition_sched_domains(1, NULL, NULL);
8615 if (--num_cpus_frozen)
8618 * This is the last CPU online operation. So fall through and
8619 * restore the original sched domains by considering the
8620 * cpuset configurations.
8622 cpuset_force_rebuild();
8624 cpuset_update_active_cpus();
8627 static int cpuset_cpu_inactive(unsigned int cpu)
8629 if (!cpuhp_tasks_frozen) {
8630 if (dl_cpu_busy(cpu))
8632 cpuset_update_active_cpus();
8635 partition_sched_domains(1, NULL, NULL);
8640 int sched_cpu_activate(unsigned int cpu)
8642 struct rq *rq = cpu_rq(cpu);
8646 * Clear the balance_push callback and prepare to schedule
8649 balance_push_set(cpu, false);
8651 #ifdef CONFIG_SCHED_SMT
8653 * When going up, increment the number of cores with SMT present.
8655 if (cpumask_weight(cpu_smt_mask(cpu)) == 2)
8656 static_branch_inc_cpuslocked(&sched_smt_present);
8658 set_cpu_active(cpu, true);
8660 if (sched_smp_initialized) {
8661 sched_domains_numa_masks_set(cpu);
8662 cpuset_cpu_active();
8666 * Put the rq online, if not already. This happens:
8668 * 1) In the early boot process, because we build the real domains
8669 * after all CPUs have been brought up.
8671 * 2) At runtime, if cpuset_cpu_active() fails to rebuild the
8674 rq_lock_irqsave(rq, &rf);
8676 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
8679 rq_unlock_irqrestore(rq, &rf);
8684 int sched_cpu_deactivate(unsigned int cpu)
8686 struct rq *rq = cpu_rq(cpu);
8691 * Remove CPU from nohz.idle_cpus_mask to prevent participating in
8692 * load balancing when not active
8694 nohz_balance_exit_idle(rq);
8696 set_cpu_active(cpu, false);
8699 * From this point forward, this CPU will refuse to run any task that
8700 * is not: migrate_disable() or KTHREAD_IS_PER_CPU, and will actively
8701 * push those tasks away until this gets cleared, see
8702 * sched_cpu_dying().
8704 balance_push_set(cpu, true);
8707 * We've cleared cpu_active_mask / set balance_push, wait for all
8708 * preempt-disabled and RCU users of this state to go away such that
8709 * all new such users will observe it.
8711 * Specifically, we rely on ttwu to no longer target this CPU, see
8712 * ttwu_queue_cond() and is_cpu_allowed().
8714 * Do sync before park smpboot threads to take care the rcu boost case.
8718 rq_lock_irqsave(rq, &rf);
8720 update_rq_clock(rq);
8721 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
8724 rq_unlock_irqrestore(rq, &rf);
8726 #ifdef CONFIG_SCHED_SMT
8728 * When going down, decrement the number of cores with SMT present.
8730 if (cpumask_weight(cpu_smt_mask(cpu)) == 2)
8731 static_branch_dec_cpuslocked(&sched_smt_present);
8734 if (!sched_smp_initialized)
8737 ret = cpuset_cpu_inactive(cpu);
8739 balance_push_set(cpu, false);
8740 set_cpu_active(cpu, true);
8743 sched_domains_numa_masks_clear(cpu);
8747 static void sched_rq_cpu_starting(unsigned int cpu)
8749 struct rq *rq = cpu_rq(cpu);
8751 rq->calc_load_update = calc_load_update;
8752 update_max_interval();
8755 int sched_cpu_starting(unsigned int cpu)
8757 sched_core_cpu_starting(cpu);
8758 sched_rq_cpu_starting(cpu);
8759 sched_tick_start(cpu);
8763 #ifdef CONFIG_HOTPLUG_CPU
8766 * Invoked immediately before the stopper thread is invoked to bring the
8767 * CPU down completely. At this point all per CPU kthreads except the
8768 * hotplug thread (current) and the stopper thread (inactive) have been
8769 * either parked or have been unbound from the outgoing CPU. Ensure that
8770 * any of those which might be on the way out are gone.
8772 * If after this point a bound task is being woken on this CPU then the
8773 * responsible hotplug callback has failed to do it's job.
8774 * sched_cpu_dying() will catch it with the appropriate fireworks.
8776 int sched_cpu_wait_empty(unsigned int cpu)
8778 balance_hotplug_wait();
8783 * Since this CPU is going 'away' for a while, fold any nr_active delta we
8784 * might have. Called from the CPU stopper task after ensuring that the
8785 * stopper is the last running task on the CPU, so nr_active count is
8786 * stable. We need to take the teardown thread which is calling this into
8787 * account, so we hand in adjust = 1 to the load calculation.
8789 * Also see the comment "Global load-average calculations".
8791 static void calc_load_migrate(struct rq *rq)
8793 long delta = calc_load_fold_active(rq, 1);
8796 atomic_long_add(delta, &calc_load_tasks);
8799 static void dump_rq_tasks(struct rq *rq, const char *loglvl)
8801 struct task_struct *g, *p;
8802 int cpu = cpu_of(rq);
8804 lockdep_assert_rq_held(rq);
8806 printk("%sCPU%d enqueued tasks (%u total):\n", loglvl, cpu, rq->nr_running);
8807 for_each_process_thread(g, p) {
8808 if (task_cpu(p) != cpu)
8811 if (!task_on_rq_queued(p))
8814 printk("%s\tpid: %d, name: %s\n", loglvl, p->pid, p->comm);
8818 int sched_cpu_dying(unsigned int cpu)
8820 struct rq *rq = cpu_rq(cpu);
8823 /* Handle pending wakeups and then migrate everything off */
8824 sched_tick_stop(cpu);
8826 rq_lock_irqsave(rq, &rf);
8827 if (rq->nr_running != 1 || rq_has_pinned_tasks(rq)) {
8828 WARN(true, "Dying CPU not properly vacated!");
8829 dump_rq_tasks(rq, KERN_WARNING);
8831 rq_unlock_irqrestore(rq, &rf);
8833 calc_load_migrate(rq);
8834 update_max_interval();
8840 void __init sched_init_smp(void)
8845 * There's no userspace yet to cause hotplug operations; hence all the
8846 * CPU masks are stable and all blatant races in the below code cannot
8849 mutex_lock(&sched_domains_mutex);
8850 sched_init_domains(cpu_active_mask);
8851 mutex_unlock(&sched_domains_mutex);
8853 /* Move init over to a non-isolated CPU */
8854 if (set_cpus_allowed_ptr(current, housekeeping_cpumask(HK_FLAG_DOMAIN)) < 0)
8856 current->flags &= ~PF_NO_SETAFFINITY;
8857 sched_init_granularity();
8859 init_sched_rt_class();
8860 init_sched_dl_class();
8862 sched_smp_initialized = true;
8865 static int __init migration_init(void)
8867 sched_cpu_starting(smp_processor_id());
8870 early_initcall(migration_init);
8873 void __init sched_init_smp(void)
8875 sched_init_granularity();
8877 #endif /* CONFIG_SMP */
8879 int in_sched_functions(unsigned long addr)
8881 return in_lock_functions(addr) ||
8882 (addr >= (unsigned long)__sched_text_start
8883 && addr < (unsigned long)__sched_text_end);
8886 #ifdef CONFIG_CGROUP_SCHED
8888 * Default task group.
8889 * Every task in system belongs to this group at bootup.
8891 struct task_group root_task_group;
8892 LIST_HEAD(task_groups);
8894 /* Cacheline aligned slab cache for task_group */
8895 static struct kmem_cache *task_group_cache __read_mostly;
8898 DECLARE_PER_CPU(cpumask_var_t, load_balance_mask);
8899 DECLARE_PER_CPU(cpumask_var_t, select_idle_mask);
8901 void __init sched_init(void)
8903 unsigned long ptr = 0;
8906 /* Make sure the linker didn't screw up */
8907 BUG_ON(&idle_sched_class + 1 != &fair_sched_class ||
8908 &fair_sched_class + 1 != &rt_sched_class ||
8909 &rt_sched_class + 1 != &dl_sched_class);
8911 BUG_ON(&dl_sched_class + 1 != &stop_sched_class);
8916 #ifdef CONFIG_FAIR_GROUP_SCHED
8917 ptr += 2 * nr_cpu_ids * sizeof(void **);
8919 #ifdef CONFIG_RT_GROUP_SCHED
8920 ptr += 2 * nr_cpu_ids * sizeof(void **);
8923 ptr = (unsigned long)kzalloc(ptr, GFP_NOWAIT);
8925 #ifdef CONFIG_FAIR_GROUP_SCHED
8926 root_task_group.se = (struct sched_entity **)ptr;
8927 ptr += nr_cpu_ids * sizeof(void **);
8929 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
8930 ptr += nr_cpu_ids * sizeof(void **);
8932 root_task_group.shares = ROOT_TASK_GROUP_LOAD;
8933 init_cfs_bandwidth(&root_task_group.cfs_bandwidth);
8934 #endif /* CONFIG_FAIR_GROUP_SCHED */
8935 #ifdef CONFIG_RT_GROUP_SCHED
8936 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
8937 ptr += nr_cpu_ids * sizeof(void **);
8939 root_task_group.rt_rq = (struct rt_rq **)ptr;
8940 ptr += nr_cpu_ids * sizeof(void **);
8942 #endif /* CONFIG_RT_GROUP_SCHED */
8944 #ifdef CONFIG_CPUMASK_OFFSTACK
8945 for_each_possible_cpu(i) {
8946 per_cpu(load_balance_mask, i) = (cpumask_var_t)kzalloc_node(
8947 cpumask_size(), GFP_KERNEL, cpu_to_node(i));
8948 per_cpu(select_idle_mask, i) = (cpumask_var_t)kzalloc_node(
8949 cpumask_size(), GFP_KERNEL, cpu_to_node(i));
8951 #endif /* CONFIG_CPUMASK_OFFSTACK */
8953 init_rt_bandwidth(&def_rt_bandwidth, global_rt_period(), global_rt_runtime());
8954 init_dl_bandwidth(&def_dl_bandwidth, global_rt_period(), global_rt_runtime());
8957 init_defrootdomain();
8960 #ifdef CONFIG_RT_GROUP_SCHED
8961 init_rt_bandwidth(&root_task_group.rt_bandwidth,
8962 global_rt_period(), global_rt_runtime());
8963 #endif /* CONFIG_RT_GROUP_SCHED */
8965 #ifdef CONFIG_CGROUP_SCHED
8966 task_group_cache = KMEM_CACHE(task_group, 0);
8968 list_add(&root_task_group.list, &task_groups);
8969 INIT_LIST_HEAD(&root_task_group.children);
8970 INIT_LIST_HEAD(&root_task_group.siblings);
8971 autogroup_init(&init_task);
8972 #endif /* CONFIG_CGROUP_SCHED */
8974 for_each_possible_cpu(i) {
8978 raw_spin_lock_init(&rq->__lock);
8980 rq->calc_load_active = 0;
8981 rq->calc_load_update = jiffies + LOAD_FREQ;
8982 init_cfs_rq(&rq->cfs);
8983 init_rt_rq(&rq->rt);
8984 init_dl_rq(&rq->dl);
8985 #ifdef CONFIG_FAIR_GROUP_SCHED
8986 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
8987 rq->tmp_alone_branch = &rq->leaf_cfs_rq_list;
8989 * How much CPU bandwidth does root_task_group get?
8991 * In case of task-groups formed thr' the cgroup filesystem, it
8992 * gets 100% of the CPU resources in the system. This overall
8993 * system CPU resource is divided among the tasks of
8994 * root_task_group and its child task-groups in a fair manner,
8995 * based on each entity's (task or task-group's) weight
8996 * (se->load.weight).
8998 * In other words, if root_task_group has 10 tasks of weight
8999 * 1024) and two child groups A0 and A1 (of weight 1024 each),
9000 * then A0's share of the CPU resource is:
9002 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
9004 * We achieve this by letting root_task_group's tasks sit
9005 * directly in rq->cfs (i.e root_task_group->se[] = NULL).
9007 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL);
9008 #endif /* CONFIG_FAIR_GROUP_SCHED */
9010 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
9011 #ifdef CONFIG_RT_GROUP_SCHED
9012 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL);
9017 rq->cpu_capacity = rq->cpu_capacity_orig = SCHED_CAPACITY_SCALE;
9018 rq->balance_callback = &balance_push_callback;
9019 rq->active_balance = 0;
9020 rq->next_balance = jiffies;
9025 rq->avg_idle = 2*sysctl_sched_migration_cost;
9026 rq->max_idle_balance_cost = sysctl_sched_migration_cost;
9028 INIT_LIST_HEAD(&rq->cfs_tasks);
9030 rq_attach_root(rq, &def_root_domain);
9031 #ifdef CONFIG_NO_HZ_COMMON
9032 rq->last_blocked_load_update_tick = jiffies;
9033 atomic_set(&rq->nohz_flags, 0);
9035 INIT_CSD(&rq->nohz_csd, nohz_csd_func, rq);
9037 #ifdef CONFIG_HOTPLUG_CPU
9038 rcuwait_init(&rq->hotplug_wait);
9040 #endif /* CONFIG_SMP */
9042 atomic_set(&rq->nr_iowait, 0);
9044 #ifdef CONFIG_SCHED_CORE
9046 rq->core_pick = NULL;
9047 rq->core_enabled = 0;
9048 rq->core_tree = RB_ROOT;
9049 rq->core_forceidle = false;
9051 rq->core_cookie = 0UL;
9055 set_load_weight(&init_task, false);
9058 * The boot idle thread does lazy MMU switching as well:
9061 enter_lazy_tlb(&init_mm, current);
9064 * Make us the idle thread. Technically, schedule() should not be
9065 * called from this thread, however somewhere below it might be,
9066 * but because we are the idle thread, we just pick up running again
9067 * when this runqueue becomes "idle".
9069 init_idle(current, smp_processor_id());
9071 calc_load_update = jiffies + LOAD_FREQ;
9074 idle_thread_set_boot_cpu();
9075 balance_push_set(smp_processor_id(), false);
9077 init_sched_fair_class();
9083 scheduler_running = 1;
9086 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
9087 static inline int preempt_count_equals(int preempt_offset)
9089 int nested = preempt_count() + rcu_preempt_depth();
9091 return (nested == preempt_offset);
9094 void __might_sleep(const char *file, int line, int preempt_offset)
9097 * Blocking primitives will set (and therefore destroy) current->state,
9098 * since we will exit with TASK_RUNNING make sure we enter with it,
9099 * otherwise we will destroy state.
9101 WARN_ONCE(current->state != TASK_RUNNING && current->task_state_change,
9102 "do not call blocking ops when !TASK_RUNNING; "
9103 "state=%lx set at [<%p>] %pS\n",
9105 (void *)current->task_state_change,
9106 (void *)current->task_state_change);
9108 ___might_sleep(file, line, preempt_offset);
9110 EXPORT_SYMBOL(__might_sleep);
9112 void ___might_sleep(const char *file, int line, int preempt_offset)
9114 /* Ratelimiting timestamp: */
9115 static unsigned long prev_jiffy;
9117 unsigned long preempt_disable_ip;
9119 /* WARN_ON_ONCE() by default, no rate limit required: */
9122 if ((preempt_count_equals(preempt_offset) && !irqs_disabled() &&
9123 !is_idle_task(current) && !current->non_block_count) ||
9124 system_state == SYSTEM_BOOTING || system_state > SYSTEM_RUNNING ||
9128 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
9130 prev_jiffy = jiffies;
9132 /* Save this before calling printk(), since that will clobber it: */
9133 preempt_disable_ip = get_preempt_disable_ip(current);
9136 "BUG: sleeping function called from invalid context at %s:%d\n",
9139 "in_atomic(): %d, irqs_disabled(): %d, non_block: %d, pid: %d, name: %s\n",
9140 in_atomic(), irqs_disabled(), current->non_block_count,
9141 current->pid, current->comm);
9143 if (task_stack_end_corrupted(current))
9144 printk(KERN_EMERG "Thread overran stack, or stack corrupted\n");
9146 debug_show_held_locks(current);
9147 if (irqs_disabled())
9148 print_irqtrace_events(current);
9149 if (IS_ENABLED(CONFIG_DEBUG_PREEMPT)
9150 && !preempt_count_equals(preempt_offset)) {
9151 pr_err("Preemption disabled at:");
9152 print_ip_sym(KERN_ERR, preempt_disable_ip);
9155 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
9157 EXPORT_SYMBOL(___might_sleep);
9159 void __cant_sleep(const char *file, int line, int preempt_offset)
9161 static unsigned long prev_jiffy;
9163 if (irqs_disabled())
9166 if (!IS_ENABLED(CONFIG_PREEMPT_COUNT))
9169 if (preempt_count() > preempt_offset)
9172 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
9174 prev_jiffy = jiffies;
9176 printk(KERN_ERR "BUG: assuming atomic context at %s:%d\n", file, line);
9177 printk(KERN_ERR "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
9178 in_atomic(), irqs_disabled(),
9179 current->pid, current->comm);
9181 debug_show_held_locks(current);
9183 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
9185 EXPORT_SYMBOL_GPL(__cant_sleep);
9188 void __cant_migrate(const char *file, int line)
9190 static unsigned long prev_jiffy;
9192 if (irqs_disabled())
9195 if (is_migration_disabled(current))
9198 if (!IS_ENABLED(CONFIG_PREEMPT_COUNT))
9201 if (preempt_count() > 0)
9204 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
9206 prev_jiffy = jiffies;
9208 pr_err("BUG: assuming non migratable context at %s:%d\n", file, line);
9209 pr_err("in_atomic(): %d, irqs_disabled(): %d, migration_disabled() %u pid: %d, name: %s\n",
9210 in_atomic(), irqs_disabled(), is_migration_disabled(current),
9211 current->pid, current->comm);
9213 debug_show_held_locks(current);
9215 add_taint(TAINT_WARN, LOCKDEP_STILL_OK);
9217 EXPORT_SYMBOL_GPL(__cant_migrate);
9221 #ifdef CONFIG_MAGIC_SYSRQ
9222 void normalize_rt_tasks(void)
9224 struct task_struct *g, *p;
9225 struct sched_attr attr = {
9226 .sched_policy = SCHED_NORMAL,
9229 read_lock(&tasklist_lock);
9230 for_each_process_thread(g, p) {
9232 * Only normalize user tasks:
9234 if (p->flags & PF_KTHREAD)
9237 p->se.exec_start = 0;
9238 schedstat_set(p->se.statistics.wait_start, 0);
9239 schedstat_set(p->se.statistics.sleep_start, 0);
9240 schedstat_set(p->se.statistics.block_start, 0);
9242 if (!dl_task(p) && !rt_task(p)) {
9244 * Renice negative nice level userspace
9247 if (task_nice(p) < 0)
9248 set_user_nice(p, 0);
9252 __sched_setscheduler(p, &attr, false, false);
9254 read_unlock(&tasklist_lock);
9257 #endif /* CONFIG_MAGIC_SYSRQ */
9259 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
9261 * These functions are only useful for the IA64 MCA handling, or kdb.
9263 * They can only be called when the whole system has been
9264 * stopped - every CPU needs to be quiescent, and no scheduling
9265 * activity can take place. Using them for anything else would
9266 * be a serious bug, and as a result, they aren't even visible
9267 * under any other configuration.
9271 * curr_task - return the current task for a given CPU.
9272 * @cpu: the processor in question.
9274 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
9276 * Return: The current task for @cpu.
9278 struct task_struct *curr_task(int cpu)
9280 return cpu_curr(cpu);
9283 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
9287 * ia64_set_curr_task - set the current task for a given CPU.
9288 * @cpu: the processor in question.
9289 * @p: the task pointer to set.
9291 * Description: This function must only be used when non-maskable interrupts
9292 * are serviced on a separate stack. It allows the architecture to switch the
9293 * notion of the current task on a CPU in a non-blocking manner. This function
9294 * must be called with all CPU's synchronized, and interrupts disabled, the
9295 * and caller must save the original value of the current task (see
9296 * curr_task() above) and restore that value before reenabling interrupts and
9297 * re-starting the system.
9299 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
9301 void ia64_set_curr_task(int cpu, struct task_struct *p)
9308 #ifdef CONFIG_CGROUP_SCHED
9309 /* task_group_lock serializes the addition/removal of task groups */
9310 static DEFINE_SPINLOCK(task_group_lock);
9312 static inline void alloc_uclamp_sched_group(struct task_group *tg,
9313 struct task_group *parent)
9315 #ifdef CONFIG_UCLAMP_TASK_GROUP
9316 enum uclamp_id clamp_id;
9318 for_each_clamp_id(clamp_id) {
9319 uclamp_se_set(&tg->uclamp_req[clamp_id],
9320 uclamp_none(clamp_id), false);
9321 tg->uclamp[clamp_id] = parent->uclamp[clamp_id];
9326 static void sched_free_group(struct task_group *tg)
9328 free_fair_sched_group(tg);
9329 free_rt_sched_group(tg);
9331 kmem_cache_free(task_group_cache, tg);
9334 /* allocate runqueue etc for a new task group */
9335 struct task_group *sched_create_group(struct task_group *parent)
9337 struct task_group *tg;
9339 tg = kmem_cache_alloc(task_group_cache, GFP_KERNEL | __GFP_ZERO);
9341 return ERR_PTR(-ENOMEM);
9343 if (!alloc_fair_sched_group(tg, parent))
9346 if (!alloc_rt_sched_group(tg, parent))
9349 alloc_uclamp_sched_group(tg, parent);
9354 sched_free_group(tg);
9355 return ERR_PTR(-ENOMEM);
9358 void sched_online_group(struct task_group *tg, struct task_group *parent)
9360 unsigned long flags;
9362 spin_lock_irqsave(&task_group_lock, flags);
9363 list_add_rcu(&tg->list, &task_groups);
9365 /* Root should already exist: */
9368 tg->parent = parent;
9369 INIT_LIST_HEAD(&tg->children);
9370 list_add_rcu(&tg->siblings, &parent->children);
9371 spin_unlock_irqrestore(&task_group_lock, flags);
9373 online_fair_sched_group(tg);
9376 /* rcu callback to free various structures associated with a task group */
9377 static void sched_free_group_rcu(struct rcu_head *rhp)
9379 /* Now it should be safe to free those cfs_rqs: */
9380 sched_free_group(container_of(rhp, struct task_group, rcu));
9383 void sched_destroy_group(struct task_group *tg)
9385 /* Wait for possible concurrent references to cfs_rqs complete: */
9386 call_rcu(&tg->rcu, sched_free_group_rcu);
9389 void sched_offline_group(struct task_group *tg)
9391 unsigned long flags;
9393 /* End participation in shares distribution: */
9394 unregister_fair_sched_group(tg);
9396 spin_lock_irqsave(&task_group_lock, flags);
9397 list_del_rcu(&tg->list);
9398 list_del_rcu(&tg->siblings);
9399 spin_unlock_irqrestore(&task_group_lock, flags);
9402 static void sched_change_group(struct task_struct *tsk, int type)
9404 struct task_group *tg;
9407 * All callers are synchronized by task_rq_lock(); we do not use RCU
9408 * which is pointless here. Thus, we pass "true" to task_css_check()
9409 * to prevent lockdep warnings.
9411 tg = container_of(task_css_check(tsk, cpu_cgrp_id, true),
9412 struct task_group, css);
9413 tg = autogroup_task_group(tsk, tg);
9414 tsk->sched_task_group = tg;
9416 #ifdef CONFIG_FAIR_GROUP_SCHED
9417 if (tsk->sched_class->task_change_group)
9418 tsk->sched_class->task_change_group(tsk, type);
9421 set_task_rq(tsk, task_cpu(tsk));
9425 * Change task's runqueue when it moves between groups.
9427 * The caller of this function should have put the task in its new group by
9428 * now. This function just updates tsk->se.cfs_rq and tsk->se.parent to reflect
9431 void sched_move_task(struct task_struct *tsk)
9433 int queued, running, queue_flags =
9434 DEQUEUE_SAVE | DEQUEUE_MOVE | DEQUEUE_NOCLOCK;
9438 rq = task_rq_lock(tsk, &rf);
9439 update_rq_clock(rq);
9441 running = task_current(rq, tsk);
9442 queued = task_on_rq_queued(tsk);
9445 dequeue_task(rq, tsk, queue_flags);
9447 put_prev_task(rq, tsk);
9449 sched_change_group(tsk, TASK_MOVE_GROUP);
9452 enqueue_task(rq, tsk, queue_flags);
9454 set_next_task(rq, tsk);
9456 * After changing group, the running task may have joined a
9457 * throttled one but it's still the running task. Trigger a
9458 * resched to make sure that task can still run.
9463 task_rq_unlock(rq, tsk, &rf);
9466 static inline struct task_group *css_tg(struct cgroup_subsys_state *css)
9468 return css ? container_of(css, struct task_group, css) : NULL;
9471 static struct cgroup_subsys_state *
9472 cpu_cgroup_css_alloc(struct cgroup_subsys_state *parent_css)
9474 struct task_group *parent = css_tg(parent_css);
9475 struct task_group *tg;
9478 /* This is early initialization for the top cgroup */
9479 return &root_task_group.css;
9482 tg = sched_create_group(parent);
9484 return ERR_PTR(-ENOMEM);
9489 /* Expose task group only after completing cgroup initialization */
9490 static int cpu_cgroup_css_online(struct cgroup_subsys_state *css)
9492 struct task_group *tg = css_tg(css);
9493 struct task_group *parent = css_tg(css->parent);
9496 sched_online_group(tg, parent);
9498 #ifdef CONFIG_UCLAMP_TASK_GROUP
9499 /* Propagate the effective uclamp value for the new group */
9500 mutex_lock(&uclamp_mutex);
9502 cpu_util_update_eff(css);
9504 mutex_unlock(&uclamp_mutex);
9510 static void cpu_cgroup_css_released(struct cgroup_subsys_state *css)
9512 struct task_group *tg = css_tg(css);
9514 sched_offline_group(tg);
9517 static void cpu_cgroup_css_free(struct cgroup_subsys_state *css)
9519 struct task_group *tg = css_tg(css);
9522 * Relies on the RCU grace period between css_released() and this.
9524 sched_free_group(tg);
9528 * This is called before wake_up_new_task(), therefore we really only
9529 * have to set its group bits, all the other stuff does not apply.
9531 static void cpu_cgroup_fork(struct task_struct *task)
9536 rq = task_rq_lock(task, &rf);
9538 update_rq_clock(rq);
9539 sched_change_group(task, TASK_SET_GROUP);
9541 task_rq_unlock(rq, task, &rf);
9544 static int cpu_cgroup_can_attach(struct cgroup_taskset *tset)
9546 struct task_struct *task;
9547 struct cgroup_subsys_state *css;
9550 cgroup_taskset_for_each(task, css, tset) {
9551 #ifdef CONFIG_RT_GROUP_SCHED
9552 if (!sched_rt_can_attach(css_tg(css), task))
9556 * Serialize against wake_up_new_task() such that if it's
9557 * running, we're sure to observe its full state.
9559 raw_spin_lock_irq(&task->pi_lock);
9561 * Avoid calling sched_move_task() before wake_up_new_task()
9562 * has happened. This would lead to problems with PELT, due to
9563 * move wanting to detach+attach while we're not attached yet.
9565 if (task->state == TASK_NEW)
9567 raw_spin_unlock_irq(&task->pi_lock);
9575 static void cpu_cgroup_attach(struct cgroup_taskset *tset)
9577 struct task_struct *task;
9578 struct cgroup_subsys_state *css;
9580 cgroup_taskset_for_each(task, css, tset)
9581 sched_move_task(task);
9584 #ifdef CONFIG_UCLAMP_TASK_GROUP
9585 static void cpu_util_update_eff(struct cgroup_subsys_state *css)
9587 struct cgroup_subsys_state *top_css = css;
9588 struct uclamp_se *uc_parent = NULL;
9589 struct uclamp_se *uc_se = NULL;
9590 unsigned int eff[UCLAMP_CNT];
9591 enum uclamp_id clamp_id;
9592 unsigned int clamps;
9594 lockdep_assert_held(&uclamp_mutex);
9595 SCHED_WARN_ON(!rcu_read_lock_held());
9597 css_for_each_descendant_pre(css, top_css) {
9598 uc_parent = css_tg(css)->parent
9599 ? css_tg(css)->parent->uclamp : NULL;
9601 for_each_clamp_id(clamp_id) {
9602 /* Assume effective clamps matches requested clamps */
9603 eff[clamp_id] = css_tg(css)->uclamp_req[clamp_id].value;
9604 /* Cap effective clamps with parent's effective clamps */
9606 eff[clamp_id] > uc_parent[clamp_id].value) {
9607 eff[clamp_id] = uc_parent[clamp_id].value;
9610 /* Ensure protection is always capped by limit */
9611 eff[UCLAMP_MIN] = min(eff[UCLAMP_MIN], eff[UCLAMP_MAX]);
9613 /* Propagate most restrictive effective clamps */
9615 uc_se = css_tg(css)->uclamp;
9616 for_each_clamp_id(clamp_id) {
9617 if (eff[clamp_id] == uc_se[clamp_id].value)
9619 uc_se[clamp_id].value = eff[clamp_id];
9620 uc_se[clamp_id].bucket_id = uclamp_bucket_id(eff[clamp_id]);
9621 clamps |= (0x1 << clamp_id);
9624 css = css_rightmost_descendant(css);
9628 /* Immediately update descendants RUNNABLE tasks */
9629 uclamp_update_active_tasks(css, clamps);
9634 * Integer 10^N with a given N exponent by casting to integer the literal "1eN"
9635 * C expression. Since there is no way to convert a macro argument (N) into a
9636 * character constant, use two levels of macros.
9638 #define _POW10(exp) ((unsigned int)1e##exp)
9639 #define POW10(exp) _POW10(exp)
9641 struct uclamp_request {
9642 #define UCLAMP_PERCENT_SHIFT 2
9643 #define UCLAMP_PERCENT_SCALE (100 * POW10(UCLAMP_PERCENT_SHIFT))
9649 static inline struct uclamp_request
9650 capacity_from_percent(char *buf)
9652 struct uclamp_request req = {
9653 .percent = UCLAMP_PERCENT_SCALE,
9654 .util = SCHED_CAPACITY_SCALE,
9659 if (strcmp(buf, "max")) {
9660 req.ret = cgroup_parse_float(buf, UCLAMP_PERCENT_SHIFT,
9664 if ((u64)req.percent > UCLAMP_PERCENT_SCALE) {
9669 req.util = req.percent << SCHED_CAPACITY_SHIFT;
9670 req.util = DIV_ROUND_CLOSEST_ULL(req.util, UCLAMP_PERCENT_SCALE);
9676 static ssize_t cpu_uclamp_write(struct kernfs_open_file *of, char *buf,
9677 size_t nbytes, loff_t off,
9678 enum uclamp_id clamp_id)
9680 struct uclamp_request req;
9681 struct task_group *tg;
9683 req = capacity_from_percent(buf);
9687 static_branch_enable(&sched_uclamp_used);
9689 mutex_lock(&uclamp_mutex);
9692 tg = css_tg(of_css(of));
9693 if (tg->uclamp_req[clamp_id].value != req.util)
9694 uclamp_se_set(&tg->uclamp_req[clamp_id], req.util, false);
9697 * Because of not recoverable conversion rounding we keep track of the
9698 * exact requested value
9700 tg->uclamp_pct[clamp_id] = req.percent;
9702 /* Update effective clamps to track the most restrictive value */
9703 cpu_util_update_eff(of_css(of));
9706 mutex_unlock(&uclamp_mutex);
9711 static ssize_t cpu_uclamp_min_write(struct kernfs_open_file *of,
9712 char *buf, size_t nbytes,
9715 return cpu_uclamp_write(of, buf, nbytes, off, UCLAMP_MIN);
9718 static ssize_t cpu_uclamp_max_write(struct kernfs_open_file *of,
9719 char *buf, size_t nbytes,
9722 return cpu_uclamp_write(of, buf, nbytes, off, UCLAMP_MAX);
9725 static inline void cpu_uclamp_print(struct seq_file *sf,
9726 enum uclamp_id clamp_id)
9728 struct task_group *tg;
9734 tg = css_tg(seq_css(sf));
9735 util_clamp = tg->uclamp_req[clamp_id].value;
9738 if (util_clamp == SCHED_CAPACITY_SCALE) {
9739 seq_puts(sf, "max\n");
9743 percent = tg->uclamp_pct[clamp_id];
9744 percent = div_u64_rem(percent, POW10(UCLAMP_PERCENT_SHIFT), &rem);
9745 seq_printf(sf, "%llu.%0*u\n", percent, UCLAMP_PERCENT_SHIFT, rem);
9748 static int cpu_uclamp_min_show(struct seq_file *sf, void *v)
9750 cpu_uclamp_print(sf, UCLAMP_MIN);
9754 static int cpu_uclamp_max_show(struct seq_file *sf, void *v)
9756 cpu_uclamp_print(sf, UCLAMP_MAX);
9759 #endif /* CONFIG_UCLAMP_TASK_GROUP */
9761 #ifdef CONFIG_FAIR_GROUP_SCHED
9762 static int cpu_shares_write_u64(struct cgroup_subsys_state *css,
9763 struct cftype *cftype, u64 shareval)
9765 if (shareval > scale_load_down(ULONG_MAX))
9766 shareval = MAX_SHARES;
9767 return sched_group_set_shares(css_tg(css), scale_load(shareval));
9770 static u64 cpu_shares_read_u64(struct cgroup_subsys_state *css,
9773 struct task_group *tg = css_tg(css);
9775 return (u64) scale_load_down(tg->shares);
9778 #ifdef CONFIG_CFS_BANDWIDTH
9779 static DEFINE_MUTEX(cfs_constraints_mutex);
9781 const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */
9782 static const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */
9783 /* More than 203 days if BW_SHIFT equals 20. */
9784 static const u64 max_cfs_runtime = MAX_BW * NSEC_PER_USEC;
9786 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime);
9788 static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota)
9790 int i, ret = 0, runtime_enabled, runtime_was_enabled;
9791 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
9793 if (tg == &root_task_group)
9797 * Ensure we have at some amount of bandwidth every period. This is
9798 * to prevent reaching a state of large arrears when throttled via
9799 * entity_tick() resulting in prolonged exit starvation.
9801 if (quota < min_cfs_quota_period || period < min_cfs_quota_period)
9805 * Likewise, bound things on the other side by preventing insane quota
9806 * periods. This also allows us to normalize in computing quota
9809 if (period > max_cfs_quota_period)
9813 * Bound quota to defend quota against overflow during bandwidth shift.
9815 if (quota != RUNTIME_INF && quota > max_cfs_runtime)
9819 * Prevent race between setting of cfs_rq->runtime_enabled and
9820 * unthrottle_offline_cfs_rqs().
9823 mutex_lock(&cfs_constraints_mutex);
9824 ret = __cfs_schedulable(tg, period, quota);
9828 runtime_enabled = quota != RUNTIME_INF;
9829 runtime_was_enabled = cfs_b->quota != RUNTIME_INF;
9831 * If we need to toggle cfs_bandwidth_used, off->on must occur
9832 * before making related changes, and on->off must occur afterwards
9834 if (runtime_enabled && !runtime_was_enabled)
9835 cfs_bandwidth_usage_inc();
9836 raw_spin_lock_irq(&cfs_b->lock);
9837 cfs_b->period = ns_to_ktime(period);
9838 cfs_b->quota = quota;
9840 __refill_cfs_bandwidth_runtime(cfs_b);
9842 /* Restart the period timer (if active) to handle new period expiry: */
9843 if (runtime_enabled)
9844 start_cfs_bandwidth(cfs_b);
9846 raw_spin_unlock_irq(&cfs_b->lock);
9848 for_each_online_cpu(i) {
9849 struct cfs_rq *cfs_rq = tg->cfs_rq[i];
9850 struct rq *rq = cfs_rq->rq;
9853 rq_lock_irq(rq, &rf);
9854 cfs_rq->runtime_enabled = runtime_enabled;
9855 cfs_rq->runtime_remaining = 0;
9857 if (cfs_rq->throttled)
9858 unthrottle_cfs_rq(cfs_rq);
9859 rq_unlock_irq(rq, &rf);
9861 if (runtime_was_enabled && !runtime_enabled)
9862 cfs_bandwidth_usage_dec();
9864 mutex_unlock(&cfs_constraints_mutex);
9870 static int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us)
9874 period = ktime_to_ns(tg->cfs_bandwidth.period);
9875 if (cfs_quota_us < 0)
9876 quota = RUNTIME_INF;
9877 else if ((u64)cfs_quota_us <= U64_MAX / NSEC_PER_USEC)
9878 quota = (u64)cfs_quota_us * NSEC_PER_USEC;
9882 return tg_set_cfs_bandwidth(tg, period, quota);
9885 static long tg_get_cfs_quota(struct task_group *tg)
9889 if (tg->cfs_bandwidth.quota == RUNTIME_INF)
9892 quota_us = tg->cfs_bandwidth.quota;
9893 do_div(quota_us, NSEC_PER_USEC);
9898 static int tg_set_cfs_period(struct task_group *tg, long cfs_period_us)
9902 if ((u64)cfs_period_us > U64_MAX / NSEC_PER_USEC)
9905 period = (u64)cfs_period_us * NSEC_PER_USEC;
9906 quota = tg->cfs_bandwidth.quota;
9908 return tg_set_cfs_bandwidth(tg, period, quota);
9911 static long tg_get_cfs_period(struct task_group *tg)
9915 cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period);
9916 do_div(cfs_period_us, NSEC_PER_USEC);
9918 return cfs_period_us;
9921 static s64 cpu_cfs_quota_read_s64(struct cgroup_subsys_state *css,
9924 return tg_get_cfs_quota(css_tg(css));
9927 static int cpu_cfs_quota_write_s64(struct cgroup_subsys_state *css,
9928 struct cftype *cftype, s64 cfs_quota_us)
9930 return tg_set_cfs_quota(css_tg(css), cfs_quota_us);
9933 static u64 cpu_cfs_period_read_u64(struct cgroup_subsys_state *css,
9936 return tg_get_cfs_period(css_tg(css));
9939 static int cpu_cfs_period_write_u64(struct cgroup_subsys_state *css,
9940 struct cftype *cftype, u64 cfs_period_us)
9942 return tg_set_cfs_period(css_tg(css), cfs_period_us);
9945 struct cfs_schedulable_data {
9946 struct task_group *tg;
9951 * normalize group quota/period to be quota/max_period
9952 * note: units are usecs
9954 static u64 normalize_cfs_quota(struct task_group *tg,
9955 struct cfs_schedulable_data *d)
9963 period = tg_get_cfs_period(tg);
9964 quota = tg_get_cfs_quota(tg);
9967 /* note: these should typically be equivalent */
9968 if (quota == RUNTIME_INF || quota == -1)
9971 return to_ratio(period, quota);
9974 static int tg_cfs_schedulable_down(struct task_group *tg, void *data)
9976 struct cfs_schedulable_data *d = data;
9977 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
9978 s64 quota = 0, parent_quota = -1;
9981 quota = RUNTIME_INF;
9983 struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth;
9985 quota = normalize_cfs_quota(tg, d);
9986 parent_quota = parent_b->hierarchical_quota;
9989 * Ensure max(child_quota) <= parent_quota. On cgroup2,
9990 * always take the min. On cgroup1, only inherit when no
9993 if (cgroup_subsys_on_dfl(cpu_cgrp_subsys)) {
9994 quota = min(quota, parent_quota);
9996 if (quota == RUNTIME_INF)
9997 quota = parent_quota;
9998 else if (parent_quota != RUNTIME_INF && quota > parent_quota)
10002 cfs_b->hierarchical_quota = quota;
10007 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota)
10010 struct cfs_schedulable_data data = {
10016 if (quota != RUNTIME_INF) {
10017 do_div(data.period, NSEC_PER_USEC);
10018 do_div(data.quota, NSEC_PER_USEC);
10022 ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data);
10028 static int cpu_cfs_stat_show(struct seq_file *sf, void *v)
10030 struct task_group *tg = css_tg(seq_css(sf));
10031 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
10033 seq_printf(sf, "nr_periods %d\n", cfs_b->nr_periods);
10034 seq_printf(sf, "nr_throttled %d\n", cfs_b->nr_throttled);
10035 seq_printf(sf, "throttled_time %llu\n", cfs_b->throttled_time);
10037 if (schedstat_enabled() && tg != &root_task_group) {
10041 for_each_possible_cpu(i)
10042 ws += schedstat_val(tg->se[i]->statistics.wait_sum);
10044 seq_printf(sf, "wait_sum %llu\n", ws);
10049 #endif /* CONFIG_CFS_BANDWIDTH */
10050 #endif /* CONFIG_FAIR_GROUP_SCHED */
10052 #ifdef CONFIG_RT_GROUP_SCHED
10053 static int cpu_rt_runtime_write(struct cgroup_subsys_state *css,
10054 struct cftype *cft, s64 val)
10056 return sched_group_set_rt_runtime(css_tg(css), val);
10059 static s64 cpu_rt_runtime_read(struct cgroup_subsys_state *css,
10060 struct cftype *cft)
10062 return sched_group_rt_runtime(css_tg(css));
10065 static int cpu_rt_period_write_uint(struct cgroup_subsys_state *css,
10066 struct cftype *cftype, u64 rt_period_us)
10068 return sched_group_set_rt_period(css_tg(css), rt_period_us);
10071 static u64 cpu_rt_period_read_uint(struct cgroup_subsys_state *css,
10072 struct cftype *cft)
10074 return sched_group_rt_period(css_tg(css));
10076 #endif /* CONFIG_RT_GROUP_SCHED */
10078 static struct cftype cpu_legacy_files[] = {
10079 #ifdef CONFIG_FAIR_GROUP_SCHED
10082 .read_u64 = cpu_shares_read_u64,
10083 .write_u64 = cpu_shares_write_u64,
10086 #ifdef CONFIG_CFS_BANDWIDTH
10088 .name = "cfs_quota_us",
10089 .read_s64 = cpu_cfs_quota_read_s64,
10090 .write_s64 = cpu_cfs_quota_write_s64,
10093 .name = "cfs_period_us",
10094 .read_u64 = cpu_cfs_period_read_u64,
10095 .write_u64 = cpu_cfs_period_write_u64,
10099 .seq_show = cpu_cfs_stat_show,
10102 #ifdef CONFIG_RT_GROUP_SCHED
10104 .name = "rt_runtime_us",
10105 .read_s64 = cpu_rt_runtime_read,
10106 .write_s64 = cpu_rt_runtime_write,
10109 .name = "rt_period_us",
10110 .read_u64 = cpu_rt_period_read_uint,
10111 .write_u64 = cpu_rt_period_write_uint,
10114 #ifdef CONFIG_UCLAMP_TASK_GROUP
10116 .name = "uclamp.min",
10117 .flags = CFTYPE_NOT_ON_ROOT,
10118 .seq_show = cpu_uclamp_min_show,
10119 .write = cpu_uclamp_min_write,
10122 .name = "uclamp.max",
10123 .flags = CFTYPE_NOT_ON_ROOT,
10124 .seq_show = cpu_uclamp_max_show,
10125 .write = cpu_uclamp_max_write,
10128 { } /* Terminate */
10131 static int cpu_extra_stat_show(struct seq_file *sf,
10132 struct cgroup_subsys_state *css)
10134 #ifdef CONFIG_CFS_BANDWIDTH
10136 struct task_group *tg = css_tg(css);
10137 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
10138 u64 throttled_usec;
10140 throttled_usec = cfs_b->throttled_time;
10141 do_div(throttled_usec, NSEC_PER_USEC);
10143 seq_printf(sf, "nr_periods %d\n"
10144 "nr_throttled %d\n"
10145 "throttled_usec %llu\n",
10146 cfs_b->nr_periods, cfs_b->nr_throttled,
10153 #ifdef CONFIG_FAIR_GROUP_SCHED
10154 static u64 cpu_weight_read_u64(struct cgroup_subsys_state *css,
10155 struct cftype *cft)
10157 struct task_group *tg = css_tg(css);
10158 u64 weight = scale_load_down(tg->shares);
10160 return DIV_ROUND_CLOSEST_ULL(weight * CGROUP_WEIGHT_DFL, 1024);
10163 static int cpu_weight_write_u64(struct cgroup_subsys_state *css,
10164 struct cftype *cft, u64 weight)
10167 * cgroup weight knobs should use the common MIN, DFL and MAX
10168 * values which are 1, 100 and 10000 respectively. While it loses
10169 * a bit of range on both ends, it maps pretty well onto the shares
10170 * value used by scheduler and the round-trip conversions preserve
10171 * the original value over the entire range.
10173 if (weight < CGROUP_WEIGHT_MIN || weight > CGROUP_WEIGHT_MAX)
10176 weight = DIV_ROUND_CLOSEST_ULL(weight * 1024, CGROUP_WEIGHT_DFL);
10178 return sched_group_set_shares(css_tg(css), scale_load(weight));
10181 static s64 cpu_weight_nice_read_s64(struct cgroup_subsys_state *css,
10182 struct cftype *cft)
10184 unsigned long weight = scale_load_down(css_tg(css)->shares);
10185 int last_delta = INT_MAX;
10188 /* find the closest nice value to the current weight */
10189 for (prio = 0; prio < ARRAY_SIZE(sched_prio_to_weight); prio++) {
10190 delta = abs(sched_prio_to_weight[prio] - weight);
10191 if (delta >= last_delta)
10193 last_delta = delta;
10196 return PRIO_TO_NICE(prio - 1 + MAX_RT_PRIO);
10199 static int cpu_weight_nice_write_s64(struct cgroup_subsys_state *css,
10200 struct cftype *cft, s64 nice)
10202 unsigned long weight;
10205 if (nice < MIN_NICE || nice > MAX_NICE)
10208 idx = NICE_TO_PRIO(nice) - MAX_RT_PRIO;
10209 idx = array_index_nospec(idx, 40);
10210 weight = sched_prio_to_weight[idx];
10212 return sched_group_set_shares(css_tg(css), scale_load(weight));
10216 static void __maybe_unused cpu_period_quota_print(struct seq_file *sf,
10217 long period, long quota)
10220 seq_puts(sf, "max");
10222 seq_printf(sf, "%ld", quota);
10224 seq_printf(sf, " %ld\n", period);
10227 /* caller should put the current value in *@periodp before calling */
10228 static int __maybe_unused cpu_period_quota_parse(char *buf,
10229 u64 *periodp, u64 *quotap)
10231 char tok[21]; /* U64_MAX */
10233 if (sscanf(buf, "%20s %llu", tok, periodp) < 1)
10236 *periodp *= NSEC_PER_USEC;
10238 if (sscanf(tok, "%llu", quotap))
10239 *quotap *= NSEC_PER_USEC;
10240 else if (!strcmp(tok, "max"))
10241 *quotap = RUNTIME_INF;
10248 #ifdef CONFIG_CFS_BANDWIDTH
10249 static int cpu_max_show(struct seq_file *sf, void *v)
10251 struct task_group *tg = css_tg(seq_css(sf));
10253 cpu_period_quota_print(sf, tg_get_cfs_period(tg), tg_get_cfs_quota(tg));
10257 static ssize_t cpu_max_write(struct kernfs_open_file *of,
10258 char *buf, size_t nbytes, loff_t off)
10260 struct task_group *tg = css_tg(of_css(of));
10261 u64 period = tg_get_cfs_period(tg);
10265 ret = cpu_period_quota_parse(buf, &period, "a);
10267 ret = tg_set_cfs_bandwidth(tg, period, quota);
10268 return ret ?: nbytes;
10272 static struct cftype cpu_files[] = {
10273 #ifdef CONFIG_FAIR_GROUP_SCHED
10276 .flags = CFTYPE_NOT_ON_ROOT,
10277 .read_u64 = cpu_weight_read_u64,
10278 .write_u64 = cpu_weight_write_u64,
10281 .name = "weight.nice",
10282 .flags = CFTYPE_NOT_ON_ROOT,
10283 .read_s64 = cpu_weight_nice_read_s64,
10284 .write_s64 = cpu_weight_nice_write_s64,
10287 #ifdef CONFIG_CFS_BANDWIDTH
10290 .flags = CFTYPE_NOT_ON_ROOT,
10291 .seq_show = cpu_max_show,
10292 .write = cpu_max_write,
10295 #ifdef CONFIG_UCLAMP_TASK_GROUP
10297 .name = "uclamp.min",
10298 .flags = CFTYPE_NOT_ON_ROOT,
10299 .seq_show = cpu_uclamp_min_show,
10300 .write = cpu_uclamp_min_write,
10303 .name = "uclamp.max",
10304 .flags = CFTYPE_NOT_ON_ROOT,
10305 .seq_show = cpu_uclamp_max_show,
10306 .write = cpu_uclamp_max_write,
10309 { } /* terminate */
10312 struct cgroup_subsys cpu_cgrp_subsys = {
10313 .css_alloc = cpu_cgroup_css_alloc,
10314 .css_online = cpu_cgroup_css_online,
10315 .css_released = cpu_cgroup_css_released,
10316 .css_free = cpu_cgroup_css_free,
10317 .css_extra_stat_show = cpu_extra_stat_show,
10318 .fork = cpu_cgroup_fork,
10319 .can_attach = cpu_cgroup_can_attach,
10320 .attach = cpu_cgroup_attach,
10321 .legacy_cftypes = cpu_legacy_files,
10322 .dfl_cftypes = cpu_files,
10323 .early_init = true,
10327 #endif /* CONFIG_CGROUP_SCHED */
10329 void dump_cpu_task(int cpu)
10331 pr_info("Task dump for CPU %d:\n", cpu);
10332 sched_show_task(cpu_curr(cpu));
10336 * Nice levels are multiplicative, with a gentle 10% change for every
10337 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
10338 * nice 1, it will get ~10% less CPU time than another CPU-bound task
10339 * that remained on nice 0.
10341 * The "10% effect" is relative and cumulative: from _any_ nice level,
10342 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
10343 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
10344 * If a task goes up by ~10% and another task goes down by ~10% then
10345 * the relative distance between them is ~25%.)
10347 const int sched_prio_to_weight[40] = {
10348 /* -20 */ 88761, 71755, 56483, 46273, 36291,
10349 /* -15 */ 29154, 23254, 18705, 14949, 11916,
10350 /* -10 */ 9548, 7620, 6100, 4904, 3906,
10351 /* -5 */ 3121, 2501, 1991, 1586, 1277,
10352 /* 0 */ 1024, 820, 655, 526, 423,
10353 /* 5 */ 335, 272, 215, 172, 137,
10354 /* 10 */ 110, 87, 70, 56, 45,
10355 /* 15 */ 36, 29, 23, 18, 15,
10359 * Inverse (2^32/x) values of the sched_prio_to_weight[] array, precalculated.
10361 * In cases where the weight does not change often, we can use the
10362 * precalculated inverse to speed up arithmetics by turning divisions
10363 * into multiplications:
10365 const u32 sched_prio_to_wmult[40] = {
10366 /* -20 */ 48388, 59856, 76040, 92818, 118348,
10367 /* -15 */ 147320, 184698, 229616, 287308, 360437,
10368 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
10369 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
10370 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
10371 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
10372 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
10373 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
10376 void call_trace_sched_update_nr_running(struct rq *rq, int count)
10378 trace_sched_update_nr_running_tp(rq, count);