4 * Kernel scheduler and related syscalls
6 * Copyright (C) 1991-2002 Linus Torvalds
8 * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and
9 * make semaphores SMP safe
10 * 1998-11-19 Implemented schedule_timeout() and related stuff
12 * 2002-01-04 New ultra-scalable O(1) scheduler by Ingo Molnar:
13 * hybrid priority-list and round-robin design with
14 * an array-switch method of distributing timeslices
15 * and per-CPU runqueues. Cleanups and useful suggestions
16 * by Davide Libenzi, preemptible kernel bits by Robert Love.
17 * 2003-09-03 Interactivity tuning by Con Kolivas.
18 * 2004-04-02 Scheduler domains code by Nick Piggin
19 * 2007-04-15 Work begun on replacing all interactivity tuning with a
20 * fair scheduling design by Con Kolivas.
21 * 2007-05-05 Load balancing (smp-nice) and other improvements
23 * 2007-05-06 Interactivity improvements to CFS by Mike Galbraith
24 * 2007-07-01 Group scheduling enhancements by Srivatsa Vaddagiri
25 * 2007-11-29 RT balancing improvements by Steven Rostedt, Gregory Haskins,
26 * Thomas Gleixner, Mike Kravetz
30 #include <linux/module.h>
31 #include <linux/nmi.h>
32 #include <linux/init.h>
33 #include <linux/uaccess.h>
34 #include <linux/highmem.h>
35 #include <asm/mmu_context.h>
36 #include <linux/interrupt.h>
37 #include <linux/capability.h>
38 #include <linux/completion.h>
39 #include <linux/kernel_stat.h>
40 #include <linux/debug_locks.h>
41 #include <linux/perf_event.h>
42 #include <linux/security.h>
43 #include <linux/notifier.h>
44 #include <linux/profile.h>
45 #include <linux/freezer.h>
46 #include <linux/vmalloc.h>
47 #include <linux/blkdev.h>
48 #include <linux/delay.h>
49 #include <linux/pid_namespace.h>
50 #include <linux/smp.h>
51 #include <linux/threads.h>
52 #include <linux/timer.h>
53 #include <linux/rcupdate.h>
54 #include <linux/cpu.h>
55 #include <linux/cpuset.h>
56 #include <linux/percpu.h>
57 #include <linux/proc_fs.h>
58 #include <linux/seq_file.h>
59 #include <linux/sysctl.h>
60 #include <linux/syscalls.h>
61 #include <linux/times.h>
62 #include <linux/tsacct_kern.h>
63 #include <linux/kprobes.h>
64 #include <linux/delayacct.h>
65 #include <linux/unistd.h>
66 #include <linux/pagemap.h>
67 #include <linux/hrtimer.h>
68 #include <linux/tick.h>
69 #include <linux/debugfs.h>
70 #include <linux/ctype.h>
71 #include <linux/ftrace.h>
72 #include <linux/slab.h>
73 #include <linux/init_task.h>
76 #include <asm/irq_regs.h>
77 #ifdef CONFIG_PARAVIRT
78 #include <asm/paravirt.h>
82 #include "../workqueue_sched.h"
84 #define CREATE_TRACE_POINTS
85 #include <trace/events/sched.h>
87 void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period)
90 ktime_t soft, hard, now;
93 if (hrtimer_active(period_timer))
96 now = hrtimer_cb_get_time(period_timer);
97 hrtimer_forward(period_timer, now, period);
99 soft = hrtimer_get_softexpires(period_timer);
100 hard = hrtimer_get_expires(period_timer);
101 delta = ktime_to_ns(ktime_sub(hard, soft));
102 __hrtimer_start_range_ns(period_timer, soft, delta,
103 HRTIMER_MODE_ABS_PINNED, 0);
107 DEFINE_MUTEX(sched_domains_mutex);
108 DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
110 static void update_rq_clock_task(struct rq *rq, s64 delta);
112 void update_rq_clock(struct rq *rq)
116 if (rq->skip_clock_update > 0)
119 delta = sched_clock_cpu(cpu_of(rq)) - rq->clock;
121 update_rq_clock_task(rq, delta);
125 * Debugging: various feature bits
128 #define SCHED_FEAT(name, enabled) \
129 (1UL << __SCHED_FEAT_##name) * enabled |
131 const_debug unsigned int sysctl_sched_features =
132 #include "features.h"
137 #ifdef CONFIG_SCHED_DEBUG
138 #define SCHED_FEAT(name, enabled) \
141 static __read_mostly char *sched_feat_names[] = {
142 #include "features.h"
148 static int sched_feat_show(struct seq_file *m, void *v)
152 for (i = 0; i < __SCHED_FEAT_NR; i++) {
153 if (!(sysctl_sched_features & (1UL << i)))
155 seq_printf(m, "%s ", sched_feat_names[i]);
162 #ifdef HAVE_JUMP_LABEL
164 #define jump_label_key__true jump_label_key_enabled
165 #define jump_label_key__false jump_label_key_disabled
167 #define SCHED_FEAT(name, enabled) \
168 jump_label_key__##enabled ,
170 struct jump_label_key sched_feat_keys[__SCHED_FEAT_NR] = {
171 #include "features.h"
176 static void sched_feat_disable(int i)
178 if (jump_label_enabled(&sched_feat_keys[i]))
179 jump_label_dec(&sched_feat_keys[i]);
182 static void sched_feat_enable(int i)
184 if (!jump_label_enabled(&sched_feat_keys[i]))
185 jump_label_inc(&sched_feat_keys[i]);
188 static void sched_feat_disable(int i) { };
189 static void sched_feat_enable(int i) { };
190 #endif /* HAVE_JUMP_LABEL */
193 sched_feat_write(struct file *filp, const char __user *ubuf,
194 size_t cnt, loff_t *ppos)
204 if (copy_from_user(&buf, ubuf, cnt))
210 if (strncmp(cmp, "NO_", 3) == 0) {
215 for (i = 0; i < __SCHED_FEAT_NR; i++) {
216 if (strcmp(cmp, sched_feat_names[i]) == 0) {
218 sysctl_sched_features &= ~(1UL << i);
219 sched_feat_disable(i);
221 sysctl_sched_features |= (1UL << i);
222 sched_feat_enable(i);
228 if (i == __SCHED_FEAT_NR)
236 static int sched_feat_open(struct inode *inode, struct file *filp)
238 return single_open(filp, sched_feat_show, NULL);
241 static const struct file_operations sched_feat_fops = {
242 .open = sched_feat_open,
243 .write = sched_feat_write,
246 .release = single_release,
249 static __init int sched_init_debug(void)
251 debugfs_create_file("sched_features", 0644, NULL, NULL,
256 late_initcall(sched_init_debug);
257 #endif /* CONFIG_SCHED_DEBUG */
260 * Number of tasks to iterate in a single balance run.
261 * Limited because this is done with IRQs disabled.
263 const_debug unsigned int sysctl_sched_nr_migrate = 32;
266 * period over which we average the RT time consumption, measured
271 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
274 * period over which we measure -rt task cpu usage in us.
277 unsigned int sysctl_sched_rt_period = 1000000;
279 __read_mostly int scheduler_running;
282 * part of the period that we allow rt tasks to run in us.
285 int sysctl_sched_rt_runtime = 950000;
290 * __task_rq_lock - lock the rq @p resides on.
292 static inline struct rq *__task_rq_lock(struct task_struct *p)
297 lockdep_assert_held(&p->pi_lock);
301 raw_spin_lock(&rq->lock);
302 if (likely(rq == task_rq(p)))
304 raw_spin_unlock(&rq->lock);
309 * task_rq_lock - lock p->pi_lock and lock the rq @p resides on.
311 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
312 __acquires(p->pi_lock)
318 raw_spin_lock_irqsave(&p->pi_lock, *flags);
320 raw_spin_lock(&rq->lock);
321 if (likely(rq == task_rq(p)))
323 raw_spin_unlock(&rq->lock);
324 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
328 static void __task_rq_unlock(struct rq *rq)
331 raw_spin_unlock(&rq->lock);
335 task_rq_unlock(struct rq *rq, struct task_struct *p, unsigned long *flags)
337 __releases(p->pi_lock)
339 raw_spin_unlock(&rq->lock);
340 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
344 * this_rq_lock - lock this runqueue and disable interrupts.
346 static struct rq *this_rq_lock(void)
353 raw_spin_lock(&rq->lock);
358 #ifdef CONFIG_SCHED_HRTICK
360 * Use HR-timers to deliver accurate preemption points.
362 * Its all a bit involved since we cannot program an hrt while holding the
363 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
366 * When we get rescheduled we reprogram the hrtick_timer outside of the
370 static void hrtick_clear(struct rq *rq)
372 if (hrtimer_active(&rq->hrtick_timer))
373 hrtimer_cancel(&rq->hrtick_timer);
377 * High-resolution timer tick.
378 * Runs from hardirq context with interrupts disabled.
380 static enum hrtimer_restart hrtick(struct hrtimer *timer)
382 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
384 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
386 raw_spin_lock(&rq->lock);
388 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
389 raw_spin_unlock(&rq->lock);
391 return HRTIMER_NORESTART;
396 * called from hardirq (IPI) context
398 static void __hrtick_start(void *arg)
402 raw_spin_lock(&rq->lock);
403 hrtimer_restart(&rq->hrtick_timer);
404 rq->hrtick_csd_pending = 0;
405 raw_spin_unlock(&rq->lock);
409 * Called to set the hrtick timer state.
411 * called with rq->lock held and irqs disabled
413 void hrtick_start(struct rq *rq, u64 delay)
415 struct hrtimer *timer = &rq->hrtick_timer;
416 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
418 hrtimer_set_expires(timer, time);
420 if (rq == this_rq()) {
421 hrtimer_restart(timer);
422 } else if (!rq->hrtick_csd_pending) {
423 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0);
424 rq->hrtick_csd_pending = 1;
429 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
431 int cpu = (int)(long)hcpu;
434 case CPU_UP_CANCELED:
435 case CPU_UP_CANCELED_FROZEN:
436 case CPU_DOWN_PREPARE:
437 case CPU_DOWN_PREPARE_FROZEN:
439 case CPU_DEAD_FROZEN:
440 hrtick_clear(cpu_rq(cpu));
447 static __init void init_hrtick(void)
449 hotcpu_notifier(hotplug_hrtick, 0);
453 * Called to set the hrtick timer state.
455 * called with rq->lock held and irqs disabled
457 void hrtick_start(struct rq *rq, u64 delay)
459 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
460 HRTIMER_MODE_REL_PINNED, 0);
463 static inline void init_hrtick(void)
466 #endif /* CONFIG_SMP */
468 static void init_rq_hrtick(struct rq *rq)
471 rq->hrtick_csd_pending = 0;
473 rq->hrtick_csd.flags = 0;
474 rq->hrtick_csd.func = __hrtick_start;
475 rq->hrtick_csd.info = rq;
478 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
479 rq->hrtick_timer.function = hrtick;
481 #else /* CONFIG_SCHED_HRTICK */
482 static inline void hrtick_clear(struct rq *rq)
486 static inline void init_rq_hrtick(struct rq *rq)
490 static inline void init_hrtick(void)
493 #endif /* CONFIG_SCHED_HRTICK */
496 * resched_task - mark a task 'to be rescheduled now'.
498 * On UP this means the setting of the need_resched flag, on SMP it
499 * might also involve a cross-CPU call to trigger the scheduler on
504 #ifndef tsk_is_polling
505 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
508 void resched_task(struct task_struct *p)
512 assert_raw_spin_locked(&task_rq(p)->lock);
514 if (test_tsk_need_resched(p))
517 set_tsk_need_resched(p);
520 if (cpu == smp_processor_id())
523 /* NEED_RESCHED must be visible before we test polling */
525 if (!tsk_is_polling(p))
526 smp_send_reschedule(cpu);
529 void resched_cpu(int cpu)
531 struct rq *rq = cpu_rq(cpu);
534 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
536 resched_task(cpu_curr(cpu));
537 raw_spin_unlock_irqrestore(&rq->lock, flags);
542 * In the semi idle case, use the nearest busy cpu for migrating timers
543 * from an idle cpu. This is good for power-savings.
545 * We don't do similar optimization for completely idle system, as
546 * selecting an idle cpu will add more delays to the timers than intended
547 * (as that cpu's timer base may not be uptodate wrt jiffies etc).
549 int get_nohz_timer_target(void)
551 int cpu = smp_processor_id();
553 struct sched_domain *sd;
556 for_each_domain(cpu, sd) {
557 for_each_cpu(i, sched_domain_span(sd)) {
569 * When add_timer_on() enqueues a timer into the timer wheel of an
570 * idle CPU then this timer might expire before the next timer event
571 * which is scheduled to wake up that CPU. In case of a completely
572 * idle system the next event might even be infinite time into the
573 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
574 * leaves the inner idle loop so the newly added timer is taken into
575 * account when the CPU goes back to idle and evaluates the timer
576 * wheel for the next timer event.
578 void wake_up_idle_cpu(int cpu)
580 struct rq *rq = cpu_rq(cpu);
582 if (cpu == smp_processor_id())
586 * This is safe, as this function is called with the timer
587 * wheel base lock of (cpu) held. When the CPU is on the way
588 * to idle and has not yet set rq->curr to idle then it will
589 * be serialized on the timer wheel base lock and take the new
590 * timer into account automatically.
592 if (rq->curr != rq->idle)
596 * We can set TIF_RESCHED on the idle task of the other CPU
597 * lockless. The worst case is that the other CPU runs the
598 * idle task through an additional NOOP schedule()
600 set_tsk_need_resched(rq->idle);
602 /* NEED_RESCHED must be visible before we test polling */
604 if (!tsk_is_polling(rq->idle))
605 smp_send_reschedule(cpu);
608 static inline bool got_nohz_idle_kick(void)
610 int cpu = smp_processor_id();
611 return idle_cpu(cpu) && test_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu));
614 #else /* CONFIG_NO_HZ */
616 static inline bool got_nohz_idle_kick(void)
621 #endif /* CONFIG_NO_HZ */
623 void sched_avg_update(struct rq *rq)
625 s64 period = sched_avg_period();
627 while ((s64)(rq->clock - rq->age_stamp) > period) {
629 * Inline assembly required to prevent the compiler
630 * optimising this loop into a divmod call.
631 * See __iter_div_u64_rem() for another example of this.
633 asm("" : "+rm" (rq->age_stamp));
634 rq->age_stamp += period;
639 #else /* !CONFIG_SMP */
640 void resched_task(struct task_struct *p)
642 assert_raw_spin_locked(&task_rq(p)->lock);
643 set_tsk_need_resched(p);
645 #endif /* CONFIG_SMP */
647 #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \
648 (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH)))
650 * Iterate task_group tree rooted at *from, calling @down when first entering a
651 * node and @up when leaving it for the final time.
653 * Caller must hold rcu_lock or sufficient equivalent.
655 int walk_tg_tree_from(struct task_group *from,
656 tg_visitor down, tg_visitor up, void *data)
658 struct task_group *parent, *child;
664 ret = (*down)(parent, data);
667 list_for_each_entry_rcu(child, &parent->children, siblings) {
674 ret = (*up)(parent, data);
675 if (ret || parent == from)
679 parent = parent->parent;
686 int tg_nop(struct task_group *tg, void *data)
692 void update_cpu_load(struct rq *this_rq);
694 static void set_load_weight(struct task_struct *p)
696 int prio = p->static_prio - MAX_RT_PRIO;
697 struct load_weight *load = &p->se.load;
700 * SCHED_IDLE tasks get minimal weight:
702 if (p->policy == SCHED_IDLE) {
703 load->weight = scale_load(WEIGHT_IDLEPRIO);
704 load->inv_weight = WMULT_IDLEPRIO;
708 load->weight = scale_load(prio_to_weight[prio]);
709 load->inv_weight = prio_to_wmult[prio];
712 static void enqueue_task(struct rq *rq, struct task_struct *p, int flags)
715 sched_info_queued(p);
716 p->sched_class->enqueue_task(rq, p, flags);
719 static void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
722 sched_info_dequeued(p);
723 p->sched_class->dequeue_task(rq, p, flags);
727 * activate_task - move a task to the runqueue.
729 void activate_task(struct rq *rq, struct task_struct *p, int flags)
731 if (task_contributes_to_load(p))
732 rq->nr_uninterruptible--;
734 enqueue_task(rq, p, flags);
738 * deactivate_task - remove a task from the runqueue.
740 void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
742 if (task_contributes_to_load(p))
743 rq->nr_uninterruptible++;
745 dequeue_task(rq, p, flags);
748 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
751 * There are no locks covering percpu hardirq/softirq time.
752 * They are only modified in account_system_vtime, on corresponding CPU
753 * with interrupts disabled. So, writes are safe.
754 * They are read and saved off onto struct rq in update_rq_clock().
755 * This may result in other CPU reading this CPU's irq time and can
756 * race with irq/account_system_vtime on this CPU. We would either get old
757 * or new value with a side effect of accounting a slice of irq time to wrong
758 * task when irq is in progress while we read rq->clock. That is a worthy
759 * compromise in place of having locks on each irq in account_system_time.
761 static DEFINE_PER_CPU(u64, cpu_hardirq_time);
762 static DEFINE_PER_CPU(u64, cpu_softirq_time);
764 static DEFINE_PER_CPU(u64, irq_start_time);
765 static int sched_clock_irqtime;
767 void enable_sched_clock_irqtime(void)
769 sched_clock_irqtime = 1;
772 void disable_sched_clock_irqtime(void)
774 sched_clock_irqtime = 0;
778 static DEFINE_PER_CPU(seqcount_t, irq_time_seq);
780 static inline void irq_time_write_begin(void)
782 __this_cpu_inc(irq_time_seq.sequence);
786 static inline void irq_time_write_end(void)
789 __this_cpu_inc(irq_time_seq.sequence);
792 static inline u64 irq_time_read(int cpu)
798 seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu));
799 irq_time = per_cpu(cpu_softirq_time, cpu) +
800 per_cpu(cpu_hardirq_time, cpu);
801 } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq));
805 #else /* CONFIG_64BIT */
806 static inline void irq_time_write_begin(void)
810 static inline void irq_time_write_end(void)
814 static inline u64 irq_time_read(int cpu)
816 return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu);
818 #endif /* CONFIG_64BIT */
821 * Called before incrementing preempt_count on {soft,}irq_enter
822 * and before decrementing preempt_count on {soft,}irq_exit.
824 void account_system_vtime(struct task_struct *curr)
830 if (!sched_clock_irqtime)
833 local_irq_save(flags);
835 cpu = smp_processor_id();
836 delta = sched_clock_cpu(cpu) - __this_cpu_read(irq_start_time);
837 __this_cpu_add(irq_start_time, delta);
839 irq_time_write_begin();
841 * We do not account for softirq time from ksoftirqd here.
842 * We want to continue accounting softirq time to ksoftirqd thread
843 * in that case, so as not to confuse scheduler with a special task
844 * that do not consume any time, but still wants to run.
847 __this_cpu_add(cpu_hardirq_time, delta);
848 else if (in_serving_softirq() && curr != this_cpu_ksoftirqd())
849 __this_cpu_add(cpu_softirq_time, delta);
851 irq_time_write_end();
852 local_irq_restore(flags);
854 EXPORT_SYMBOL_GPL(account_system_vtime);
856 #endif /* CONFIG_IRQ_TIME_ACCOUNTING */
858 #ifdef CONFIG_PARAVIRT
859 static inline u64 steal_ticks(u64 steal)
861 if (unlikely(steal > NSEC_PER_SEC))
862 return div_u64(steal, TICK_NSEC);
864 return __iter_div_u64_rem(steal, TICK_NSEC, &steal);
868 static void update_rq_clock_task(struct rq *rq, s64 delta)
871 * In theory, the compile should just see 0 here, and optimize out the call
872 * to sched_rt_avg_update. But I don't trust it...
874 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
875 s64 steal = 0, irq_delta = 0;
877 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
878 irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time;
881 * Since irq_time is only updated on {soft,}irq_exit, we might run into
882 * this case when a previous update_rq_clock() happened inside a
885 * When this happens, we stop ->clock_task and only update the
886 * prev_irq_time stamp to account for the part that fit, so that a next
887 * update will consume the rest. This ensures ->clock_task is
890 * It does however cause some slight miss-attribution of {soft,}irq
891 * time, a more accurate solution would be to update the irq_time using
892 * the current rq->clock timestamp, except that would require using
895 if (irq_delta > delta)
898 rq->prev_irq_time += irq_delta;
901 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
902 if (static_branch((¶virt_steal_rq_enabled))) {
905 steal = paravirt_steal_clock(cpu_of(rq));
906 steal -= rq->prev_steal_time_rq;
908 if (unlikely(steal > delta))
911 st = steal_ticks(steal);
912 steal = st * TICK_NSEC;
914 rq->prev_steal_time_rq += steal;
920 rq->clock_task += delta;
922 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
923 if ((irq_delta + steal) && sched_feat(NONTASK_POWER))
924 sched_rt_avg_update(rq, irq_delta + steal);
928 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
929 static int irqtime_account_hi_update(void)
931 u64 *cpustat = kcpustat_this_cpu->cpustat;
936 local_irq_save(flags);
937 latest_ns = this_cpu_read(cpu_hardirq_time);
938 if (nsecs_to_cputime64(latest_ns) > cpustat[CPUTIME_IRQ])
940 local_irq_restore(flags);
944 static int irqtime_account_si_update(void)
946 u64 *cpustat = kcpustat_this_cpu->cpustat;
951 local_irq_save(flags);
952 latest_ns = this_cpu_read(cpu_softirq_time);
953 if (nsecs_to_cputime64(latest_ns) > cpustat[CPUTIME_SOFTIRQ])
955 local_irq_restore(flags);
959 #else /* CONFIG_IRQ_TIME_ACCOUNTING */
961 #define sched_clock_irqtime (0)
965 void sched_set_stop_task(int cpu, struct task_struct *stop)
967 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
968 struct task_struct *old_stop = cpu_rq(cpu)->stop;
972 * Make it appear like a SCHED_FIFO task, its something
973 * userspace knows about and won't get confused about.
975 * Also, it will make PI more or less work without too
976 * much confusion -- but then, stop work should not
977 * rely on PI working anyway.
979 sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m);
981 stop->sched_class = &stop_sched_class;
984 cpu_rq(cpu)->stop = stop;
988 * Reset it back to a normal scheduling class so that
989 * it can die in pieces.
991 old_stop->sched_class = &rt_sched_class;
996 * __normal_prio - return the priority that is based on the static prio
998 static inline int __normal_prio(struct task_struct *p)
1000 return p->static_prio;
1004 * Calculate the expected normal priority: i.e. priority
1005 * without taking RT-inheritance into account. Might be
1006 * boosted by interactivity modifiers. Changes upon fork,
1007 * setprio syscalls, and whenever the interactivity
1008 * estimator recalculates.
1010 static inline int normal_prio(struct task_struct *p)
1014 if (task_has_rt_policy(p))
1015 prio = MAX_RT_PRIO-1 - p->rt_priority;
1017 prio = __normal_prio(p);
1022 * Calculate the current priority, i.e. the priority
1023 * taken into account by the scheduler. This value might
1024 * be boosted by RT tasks, or might be boosted by
1025 * interactivity modifiers. Will be RT if the task got
1026 * RT-boosted. If not then it returns p->normal_prio.
1028 static int effective_prio(struct task_struct *p)
1030 p->normal_prio = normal_prio(p);
1032 * If we are RT tasks or we were boosted to RT priority,
1033 * keep the priority unchanged. Otherwise, update priority
1034 * to the normal priority:
1036 if (!rt_prio(p->prio))
1037 return p->normal_prio;
1042 * task_curr - is this task currently executing on a CPU?
1043 * @p: the task in question.
1045 inline int task_curr(const struct task_struct *p)
1047 return cpu_curr(task_cpu(p)) == p;
1050 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1051 const struct sched_class *prev_class,
1054 if (prev_class != p->sched_class) {
1055 if (prev_class->switched_from)
1056 prev_class->switched_from(rq, p);
1057 p->sched_class->switched_to(rq, p);
1058 } else if (oldprio != p->prio)
1059 p->sched_class->prio_changed(rq, p, oldprio);
1062 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
1064 const struct sched_class *class;
1066 if (p->sched_class == rq->curr->sched_class) {
1067 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
1069 for_each_class(class) {
1070 if (class == rq->curr->sched_class)
1072 if (class == p->sched_class) {
1073 resched_task(rq->curr);
1080 * A queue event has occurred, and we're going to schedule. In
1081 * this case, we can save a useless back to back clock update.
1083 if (rq->curr->on_rq && test_tsk_need_resched(rq->curr))
1084 rq->skip_clock_update = 1;
1088 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1090 #ifdef CONFIG_SCHED_DEBUG
1092 * We should never call set_task_cpu() on a blocked task,
1093 * ttwu() will sort out the placement.
1095 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
1096 !(task_thread_info(p)->preempt_count & PREEMPT_ACTIVE));
1098 #ifdef CONFIG_LOCKDEP
1100 * The caller should hold either p->pi_lock or rq->lock, when changing
1101 * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks.
1103 * sched_move_task() holds both and thus holding either pins the cgroup,
1104 * see set_task_rq().
1106 * Furthermore, all task_rq users should acquire both locks, see
1109 WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) ||
1110 lockdep_is_held(&task_rq(p)->lock)));
1114 trace_sched_migrate_task(p, new_cpu);
1116 if (task_cpu(p) != new_cpu) {
1117 p->se.nr_migrations++;
1118 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, NULL, 0);
1121 __set_task_cpu(p, new_cpu);
1124 struct migration_arg {
1125 struct task_struct *task;
1129 static int migration_cpu_stop(void *data);
1132 * wait_task_inactive - wait for a thread to unschedule.
1134 * If @match_state is nonzero, it's the @p->state value just checked and
1135 * not expected to change. If it changes, i.e. @p might have woken up,
1136 * then return zero. When we succeed in waiting for @p to be off its CPU,
1137 * we return a positive number (its total switch count). If a second call
1138 * a short while later returns the same number, the caller can be sure that
1139 * @p has remained unscheduled the whole time.
1141 * The caller must ensure that the task *will* unschedule sometime soon,
1142 * else this function might spin for a *long* time. This function can't
1143 * be called with interrupts off, or it may introduce deadlock with
1144 * smp_call_function() if an IPI is sent by the same process we are
1145 * waiting to become inactive.
1147 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
1149 unsigned long flags;
1156 * We do the initial early heuristics without holding
1157 * any task-queue locks at all. We'll only try to get
1158 * the runqueue lock when things look like they will
1164 * If the task is actively running on another CPU
1165 * still, just relax and busy-wait without holding
1168 * NOTE! Since we don't hold any locks, it's not
1169 * even sure that "rq" stays as the right runqueue!
1170 * But we don't care, since "task_running()" will
1171 * return false if the runqueue has changed and p
1172 * is actually now running somewhere else!
1174 while (task_running(rq, p)) {
1175 if (match_state && unlikely(p->state != match_state))
1181 * Ok, time to look more closely! We need the rq
1182 * lock now, to be *sure*. If we're wrong, we'll
1183 * just go back and repeat.
1185 rq = task_rq_lock(p, &flags);
1186 trace_sched_wait_task(p);
1187 running = task_running(rq, p);
1190 if (!match_state || p->state == match_state)
1191 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
1192 task_rq_unlock(rq, p, &flags);
1195 * If it changed from the expected state, bail out now.
1197 if (unlikely(!ncsw))
1201 * Was it really running after all now that we
1202 * checked with the proper locks actually held?
1204 * Oops. Go back and try again..
1206 if (unlikely(running)) {
1212 * It's not enough that it's not actively running,
1213 * it must be off the runqueue _entirely_, and not
1216 * So if it was still runnable (but just not actively
1217 * running right now), it's preempted, and we should
1218 * yield - it could be a while.
1220 if (unlikely(on_rq)) {
1221 ktime_t to = ktime_set(0, NSEC_PER_SEC/HZ);
1223 set_current_state(TASK_UNINTERRUPTIBLE);
1224 schedule_hrtimeout(&to, HRTIMER_MODE_REL);
1229 * Ahh, all good. It wasn't running, and it wasn't
1230 * runnable, which means that it will never become
1231 * running in the future either. We're all done!
1240 * kick_process - kick a running thread to enter/exit the kernel
1241 * @p: the to-be-kicked thread
1243 * Cause a process which is running on another CPU to enter
1244 * kernel-mode, without any delay. (to get signals handled.)
1246 * NOTE: this function doesn't have to take the runqueue lock,
1247 * because all it wants to ensure is that the remote task enters
1248 * the kernel. If the IPI races and the task has been migrated
1249 * to another CPU then no harm is done and the purpose has been
1252 void kick_process(struct task_struct *p)
1258 if ((cpu != smp_processor_id()) && task_curr(p))
1259 smp_send_reschedule(cpu);
1262 EXPORT_SYMBOL_GPL(kick_process);
1263 #endif /* CONFIG_SMP */
1267 * ->cpus_allowed is protected by both rq->lock and p->pi_lock
1269 static int select_fallback_rq(int cpu, struct task_struct *p)
1272 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(cpu));
1274 /* Look for allowed, online CPU in same node. */
1275 for_each_cpu_and(dest_cpu, nodemask, cpu_active_mask)
1276 if (cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
1279 /* Any allowed, online CPU? */
1280 dest_cpu = cpumask_any_and(tsk_cpus_allowed(p), cpu_active_mask);
1281 if (dest_cpu < nr_cpu_ids)
1284 /* No more Mr. Nice Guy. */
1285 dest_cpu = cpuset_cpus_allowed_fallback(p);
1287 * Don't tell them about moving exiting tasks or
1288 * kernel threads (both mm NULL), since they never
1291 if (p->mm && printk_ratelimit()) {
1292 printk(KERN_INFO "process %d (%s) no longer affine to cpu%d\n",
1293 task_pid_nr(p), p->comm, cpu);
1300 * The caller (fork, wakeup) owns p->pi_lock, ->cpus_allowed is stable.
1303 int select_task_rq(struct task_struct *p, int sd_flags, int wake_flags)
1305 int cpu = p->sched_class->select_task_rq(p, sd_flags, wake_flags);
1308 * In order not to call set_task_cpu() on a blocking task we need
1309 * to rely on ttwu() to place the task on a valid ->cpus_allowed
1312 * Since this is common to all placement strategies, this lives here.
1314 * [ this allows ->select_task() to simply return task_cpu(p) and
1315 * not worry about this generic constraint ]
1317 if (unlikely(!cpumask_test_cpu(cpu, tsk_cpus_allowed(p)) ||
1319 cpu = select_fallback_rq(task_cpu(p), p);
1324 static void update_avg(u64 *avg, u64 sample)
1326 s64 diff = sample - *avg;
1332 ttwu_stat(struct task_struct *p, int cpu, int wake_flags)
1334 #ifdef CONFIG_SCHEDSTATS
1335 struct rq *rq = this_rq();
1338 int this_cpu = smp_processor_id();
1340 if (cpu == this_cpu) {
1341 schedstat_inc(rq, ttwu_local);
1342 schedstat_inc(p, se.statistics.nr_wakeups_local);
1344 struct sched_domain *sd;
1346 schedstat_inc(p, se.statistics.nr_wakeups_remote);
1348 for_each_domain(this_cpu, sd) {
1349 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
1350 schedstat_inc(sd, ttwu_wake_remote);
1357 if (wake_flags & WF_MIGRATED)
1358 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
1360 #endif /* CONFIG_SMP */
1362 schedstat_inc(rq, ttwu_count);
1363 schedstat_inc(p, se.statistics.nr_wakeups);
1365 if (wake_flags & WF_SYNC)
1366 schedstat_inc(p, se.statistics.nr_wakeups_sync);
1368 #endif /* CONFIG_SCHEDSTATS */
1371 static void ttwu_activate(struct rq *rq, struct task_struct *p, int en_flags)
1373 activate_task(rq, p, en_flags);
1376 /* if a worker is waking up, notify workqueue */
1377 if (p->flags & PF_WQ_WORKER)
1378 wq_worker_waking_up(p, cpu_of(rq));
1382 * Mark the task runnable and perform wakeup-preemption.
1385 ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags)
1387 trace_sched_wakeup(p, true);
1388 check_preempt_curr(rq, p, wake_flags);
1390 p->state = TASK_RUNNING;
1392 if (p->sched_class->task_woken)
1393 p->sched_class->task_woken(rq, p);
1395 if (rq->idle_stamp) {
1396 u64 delta = rq->clock - rq->idle_stamp;
1397 u64 max = 2*sysctl_sched_migration_cost;
1402 update_avg(&rq->avg_idle, delta);
1409 ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags)
1412 if (p->sched_contributes_to_load)
1413 rq->nr_uninterruptible--;
1416 ttwu_activate(rq, p, ENQUEUE_WAKEUP | ENQUEUE_WAKING);
1417 ttwu_do_wakeup(rq, p, wake_flags);
1421 * Called in case the task @p isn't fully descheduled from its runqueue,
1422 * in this case we must do a remote wakeup. Its a 'light' wakeup though,
1423 * since all we need to do is flip p->state to TASK_RUNNING, since
1424 * the task is still ->on_rq.
1426 static int ttwu_remote(struct task_struct *p, int wake_flags)
1431 rq = __task_rq_lock(p);
1433 ttwu_do_wakeup(rq, p, wake_flags);
1436 __task_rq_unlock(rq);
1442 static void sched_ttwu_pending(void)
1444 struct rq *rq = this_rq();
1445 struct llist_node *llist = llist_del_all(&rq->wake_list);
1446 struct task_struct *p;
1448 raw_spin_lock(&rq->lock);
1451 p = llist_entry(llist, struct task_struct, wake_entry);
1452 llist = llist_next(llist);
1453 ttwu_do_activate(rq, p, 0);
1456 raw_spin_unlock(&rq->lock);
1459 void scheduler_ipi(void)
1461 if (llist_empty(&this_rq()->wake_list) && !got_nohz_idle_kick())
1465 * Not all reschedule IPI handlers call irq_enter/irq_exit, since
1466 * traditionally all their work was done from the interrupt return
1467 * path. Now that we actually do some work, we need to make sure
1470 * Some archs already do call them, luckily irq_enter/exit nest
1473 * Arguably we should visit all archs and update all handlers,
1474 * however a fair share of IPIs are still resched only so this would
1475 * somewhat pessimize the simple resched case.
1478 sched_ttwu_pending();
1481 * Check if someone kicked us for doing the nohz idle load balance.
1483 if (unlikely(got_nohz_idle_kick() && !need_resched())) {
1484 this_rq()->idle_balance = 1;
1485 raise_softirq_irqoff(SCHED_SOFTIRQ);
1490 static void ttwu_queue_remote(struct task_struct *p, int cpu)
1492 if (llist_add(&p->wake_entry, &cpu_rq(cpu)->wake_list))
1493 smp_send_reschedule(cpu);
1496 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1497 static int ttwu_activate_remote(struct task_struct *p, int wake_flags)
1502 rq = __task_rq_lock(p);
1504 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1505 ttwu_do_wakeup(rq, p, wake_flags);
1508 __task_rq_unlock(rq);
1513 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1515 static inline int ttwu_share_cache(int this_cpu, int that_cpu)
1517 return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu);
1519 #endif /* CONFIG_SMP */
1521 static void ttwu_queue(struct task_struct *p, int cpu)
1523 struct rq *rq = cpu_rq(cpu);
1525 #if defined(CONFIG_SMP)
1526 if (sched_feat(TTWU_QUEUE) && !ttwu_share_cache(smp_processor_id(), cpu)) {
1527 sched_clock_cpu(cpu); /* sync clocks x-cpu */
1528 ttwu_queue_remote(p, cpu);
1533 raw_spin_lock(&rq->lock);
1534 ttwu_do_activate(rq, p, 0);
1535 raw_spin_unlock(&rq->lock);
1539 * try_to_wake_up - wake up a thread
1540 * @p: the thread to be awakened
1541 * @state: the mask of task states that can be woken
1542 * @wake_flags: wake modifier flags (WF_*)
1544 * Put it on the run-queue if it's not already there. The "current"
1545 * thread is always on the run-queue (except when the actual
1546 * re-schedule is in progress), and as such you're allowed to do
1547 * the simpler "current->state = TASK_RUNNING" to mark yourself
1548 * runnable without the overhead of this.
1550 * Returns %true if @p was woken up, %false if it was already running
1551 * or @state didn't match @p's state.
1554 try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags)
1556 unsigned long flags;
1557 int cpu, success = 0;
1560 raw_spin_lock_irqsave(&p->pi_lock, flags);
1561 if (!(p->state & state))
1564 success = 1; /* we're going to change ->state */
1567 if (p->on_rq && ttwu_remote(p, wake_flags))
1572 * If the owning (remote) cpu is still in the middle of schedule() with
1573 * this task as prev, wait until its done referencing the task.
1576 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1578 * In case the architecture enables interrupts in
1579 * context_switch(), we cannot busy wait, since that
1580 * would lead to deadlocks when an interrupt hits and
1581 * tries to wake up @prev. So bail and do a complete
1584 if (ttwu_activate_remote(p, wake_flags))
1591 * Pairs with the smp_wmb() in finish_lock_switch().
1595 p->sched_contributes_to_load = !!task_contributes_to_load(p);
1596 p->state = TASK_WAKING;
1598 if (p->sched_class->task_waking)
1599 p->sched_class->task_waking(p);
1601 cpu = select_task_rq(p, SD_BALANCE_WAKE, wake_flags);
1602 if (task_cpu(p) != cpu) {
1603 wake_flags |= WF_MIGRATED;
1604 set_task_cpu(p, cpu);
1606 #endif /* CONFIG_SMP */
1610 ttwu_stat(p, cpu, wake_flags);
1612 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1618 * try_to_wake_up_local - try to wake up a local task with rq lock held
1619 * @p: the thread to be awakened
1621 * Put @p on the run-queue if it's not already there. The caller must
1622 * ensure that this_rq() is locked, @p is bound to this_rq() and not
1625 static void try_to_wake_up_local(struct task_struct *p)
1627 struct rq *rq = task_rq(p);
1629 BUG_ON(rq != this_rq());
1630 BUG_ON(p == current);
1631 lockdep_assert_held(&rq->lock);
1633 if (!raw_spin_trylock(&p->pi_lock)) {
1634 raw_spin_unlock(&rq->lock);
1635 raw_spin_lock(&p->pi_lock);
1636 raw_spin_lock(&rq->lock);
1639 if (!(p->state & TASK_NORMAL))
1643 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1645 ttwu_do_wakeup(rq, p, 0);
1646 ttwu_stat(p, smp_processor_id(), 0);
1648 raw_spin_unlock(&p->pi_lock);
1652 * wake_up_process - Wake up a specific process
1653 * @p: The process to be woken up.
1655 * Attempt to wake up the nominated process and move it to the set of runnable
1656 * processes. Returns 1 if the process was woken up, 0 if it was already
1659 * It may be assumed that this function implies a write memory barrier before
1660 * changing the task state if and only if any tasks are woken up.
1662 int wake_up_process(struct task_struct *p)
1664 return try_to_wake_up(p, TASK_ALL, 0);
1666 EXPORT_SYMBOL(wake_up_process);
1668 int wake_up_state(struct task_struct *p, unsigned int state)
1670 return try_to_wake_up(p, state, 0);
1674 * Perform scheduler related setup for a newly forked process p.
1675 * p is forked by current.
1677 * __sched_fork() is basic setup used by init_idle() too:
1679 static void __sched_fork(struct task_struct *p)
1684 p->se.exec_start = 0;
1685 p->se.sum_exec_runtime = 0;
1686 p->se.prev_sum_exec_runtime = 0;
1687 p->se.nr_migrations = 0;
1689 INIT_LIST_HEAD(&p->se.group_node);
1691 #ifdef CONFIG_SCHEDSTATS
1692 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
1695 INIT_LIST_HEAD(&p->rt.run_list);
1697 #ifdef CONFIG_PREEMPT_NOTIFIERS
1698 INIT_HLIST_HEAD(&p->preempt_notifiers);
1703 * fork()/clone()-time setup:
1705 void sched_fork(struct task_struct *p)
1707 unsigned long flags;
1708 int cpu = get_cpu();
1712 * We mark the process as running here. This guarantees that
1713 * nobody will actually run it, and a signal or other external
1714 * event cannot wake it up and insert it on the runqueue either.
1716 p->state = TASK_RUNNING;
1719 * Make sure we do not leak PI boosting priority to the child.
1721 p->prio = current->normal_prio;
1724 * Revert to default priority/policy on fork if requested.
1726 if (unlikely(p->sched_reset_on_fork)) {
1727 if (task_has_rt_policy(p)) {
1728 p->policy = SCHED_NORMAL;
1729 p->static_prio = NICE_TO_PRIO(0);
1731 } else if (PRIO_TO_NICE(p->static_prio) < 0)
1732 p->static_prio = NICE_TO_PRIO(0);
1734 p->prio = p->normal_prio = __normal_prio(p);
1738 * We don't need the reset flag anymore after the fork. It has
1739 * fulfilled its duty:
1741 p->sched_reset_on_fork = 0;
1744 if (!rt_prio(p->prio))
1745 p->sched_class = &fair_sched_class;
1747 if (p->sched_class->task_fork)
1748 p->sched_class->task_fork(p);
1751 * The child is not yet in the pid-hash so no cgroup attach races,
1752 * and the cgroup is pinned to this child due to cgroup_fork()
1753 * is ran before sched_fork().
1755 * Silence PROVE_RCU.
1757 raw_spin_lock_irqsave(&p->pi_lock, flags);
1758 set_task_cpu(p, cpu);
1759 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1761 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
1762 if (likely(sched_info_on()))
1763 memset(&p->sched_info, 0, sizeof(p->sched_info));
1765 #if defined(CONFIG_SMP)
1768 #ifdef CONFIG_PREEMPT_COUNT
1769 /* Want to start with kernel preemption disabled. */
1770 task_thread_info(p)->preempt_count = 1;
1773 plist_node_init(&p->pushable_tasks, MAX_PRIO);
1780 * wake_up_new_task - wake up a newly created task for the first time.
1782 * This function will do some initial scheduler statistics housekeeping
1783 * that must be done for every newly created context, then puts the task
1784 * on the runqueue and wakes it.
1786 void wake_up_new_task(struct task_struct *p)
1788 unsigned long flags;
1791 raw_spin_lock_irqsave(&p->pi_lock, flags);
1794 * Fork balancing, do it here and not earlier because:
1795 * - cpus_allowed can change in the fork path
1796 * - any previously selected cpu might disappear through hotplug
1798 set_task_cpu(p, select_task_rq(p, SD_BALANCE_FORK, 0));
1801 rq = __task_rq_lock(p);
1802 activate_task(rq, p, 0);
1804 trace_sched_wakeup_new(p, true);
1805 check_preempt_curr(rq, p, WF_FORK);
1807 if (p->sched_class->task_woken)
1808 p->sched_class->task_woken(rq, p);
1810 task_rq_unlock(rq, p, &flags);
1813 #ifdef CONFIG_PREEMPT_NOTIFIERS
1816 * preempt_notifier_register - tell me when current is being preempted & rescheduled
1817 * @notifier: notifier struct to register
1819 void preempt_notifier_register(struct preempt_notifier *notifier)
1821 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
1823 EXPORT_SYMBOL_GPL(preempt_notifier_register);
1826 * preempt_notifier_unregister - no longer interested in preemption notifications
1827 * @notifier: notifier struct to unregister
1829 * This is safe to call from within a preemption notifier.
1831 void preempt_notifier_unregister(struct preempt_notifier *notifier)
1833 hlist_del(¬ifier->link);
1835 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
1837 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
1839 struct preempt_notifier *notifier;
1840 struct hlist_node *node;
1842 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
1843 notifier->ops->sched_in(notifier, raw_smp_processor_id());
1847 fire_sched_out_preempt_notifiers(struct task_struct *curr,
1848 struct task_struct *next)
1850 struct preempt_notifier *notifier;
1851 struct hlist_node *node;
1853 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
1854 notifier->ops->sched_out(notifier, next);
1857 #else /* !CONFIG_PREEMPT_NOTIFIERS */
1859 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
1864 fire_sched_out_preempt_notifiers(struct task_struct *curr,
1865 struct task_struct *next)
1869 #endif /* CONFIG_PREEMPT_NOTIFIERS */
1872 * prepare_task_switch - prepare to switch tasks
1873 * @rq: the runqueue preparing to switch
1874 * @prev: the current task that is being switched out
1875 * @next: the task we are going to switch to.
1877 * This is called with the rq lock held and interrupts off. It must
1878 * be paired with a subsequent finish_task_switch after the context
1881 * prepare_task_switch sets up locking and calls architecture specific
1885 prepare_task_switch(struct rq *rq, struct task_struct *prev,
1886 struct task_struct *next)
1888 sched_info_switch(prev, next);
1889 perf_event_task_sched_out(prev, next);
1890 fire_sched_out_preempt_notifiers(prev, next);
1891 prepare_lock_switch(rq, next);
1892 prepare_arch_switch(next);
1893 trace_sched_switch(prev, next);
1897 * finish_task_switch - clean up after a task-switch
1898 * @rq: runqueue associated with task-switch
1899 * @prev: the thread we just switched away from.
1901 * finish_task_switch must be called after the context switch, paired
1902 * with a prepare_task_switch call before the context switch.
1903 * finish_task_switch will reconcile locking set up by prepare_task_switch,
1904 * and do any other architecture-specific cleanup actions.
1906 * Note that we may have delayed dropping an mm in context_switch(). If
1907 * so, we finish that here outside of the runqueue lock. (Doing it
1908 * with the lock held can cause deadlocks; see schedule() for
1911 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
1912 __releases(rq->lock)
1914 struct mm_struct *mm = rq->prev_mm;
1920 * A task struct has one reference for the use as "current".
1921 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
1922 * schedule one last time. The schedule call will never return, and
1923 * the scheduled task must drop that reference.
1924 * The test for TASK_DEAD must occur while the runqueue locks are
1925 * still held, otherwise prev could be scheduled on another cpu, die
1926 * there before we look at prev->state, and then the reference would
1928 * Manfred Spraul <manfred@colorfullife.com>
1930 prev_state = prev->state;
1931 finish_arch_switch(prev);
1932 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1933 local_irq_disable();
1934 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1935 perf_event_task_sched_in(prev, current);
1936 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1938 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1939 finish_lock_switch(rq, prev);
1941 fire_sched_in_preempt_notifiers(current);
1944 if (unlikely(prev_state == TASK_DEAD)) {
1946 * Remove function-return probe instances associated with this
1947 * task and put them back on the free list.
1949 kprobe_flush_task(prev);
1950 put_task_struct(prev);
1956 /* assumes rq->lock is held */
1957 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
1959 if (prev->sched_class->pre_schedule)
1960 prev->sched_class->pre_schedule(rq, prev);
1963 /* rq->lock is NOT held, but preemption is disabled */
1964 static inline void post_schedule(struct rq *rq)
1966 if (rq->post_schedule) {
1967 unsigned long flags;
1969 raw_spin_lock_irqsave(&rq->lock, flags);
1970 if (rq->curr->sched_class->post_schedule)
1971 rq->curr->sched_class->post_schedule(rq);
1972 raw_spin_unlock_irqrestore(&rq->lock, flags);
1974 rq->post_schedule = 0;
1980 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
1984 static inline void post_schedule(struct rq *rq)
1991 * schedule_tail - first thing a freshly forked thread must call.
1992 * @prev: the thread we just switched away from.
1994 asmlinkage void schedule_tail(struct task_struct *prev)
1995 __releases(rq->lock)
1997 struct rq *rq = this_rq();
1999 finish_task_switch(rq, prev);
2002 * FIXME: do we need to worry about rq being invalidated by the
2007 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2008 /* In this case, finish_task_switch does not reenable preemption */
2011 if (current->set_child_tid)
2012 put_user(task_pid_vnr(current), current->set_child_tid);
2016 * context_switch - switch to the new MM and the new
2017 * thread's register state.
2020 context_switch(struct rq *rq, struct task_struct *prev,
2021 struct task_struct *next)
2023 struct mm_struct *mm, *oldmm;
2025 prepare_task_switch(rq, prev, next);
2028 oldmm = prev->active_mm;
2030 * For paravirt, this is coupled with an exit in switch_to to
2031 * combine the page table reload and the switch backend into
2034 arch_start_context_switch(prev);
2037 next->active_mm = oldmm;
2038 atomic_inc(&oldmm->mm_count);
2039 enter_lazy_tlb(oldmm, next);
2041 switch_mm(oldmm, mm, next);
2044 prev->active_mm = NULL;
2045 rq->prev_mm = oldmm;
2048 * Since the runqueue lock will be released by the next
2049 * task (which is an invalid locking op but in the case
2050 * of the scheduler it's an obvious special-case), so we
2051 * do an early lockdep release here:
2053 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2054 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2057 /* Here we just switch the register state and the stack. */
2058 switch_to(prev, next, prev);
2062 * this_rq must be evaluated again because prev may have moved
2063 * CPUs since it called schedule(), thus the 'rq' on its stack
2064 * frame will be invalid.
2066 finish_task_switch(this_rq(), prev);
2070 * nr_running, nr_uninterruptible and nr_context_switches:
2072 * externally visible scheduler statistics: current number of runnable
2073 * threads, current number of uninterruptible-sleeping threads, total
2074 * number of context switches performed since bootup.
2076 unsigned long nr_running(void)
2078 unsigned long i, sum = 0;
2080 for_each_online_cpu(i)
2081 sum += cpu_rq(i)->nr_running;
2086 unsigned long nr_uninterruptible(void)
2088 unsigned long i, sum = 0;
2090 for_each_possible_cpu(i)
2091 sum += cpu_rq(i)->nr_uninterruptible;
2094 * Since we read the counters lockless, it might be slightly
2095 * inaccurate. Do not allow it to go below zero though:
2097 if (unlikely((long)sum < 0))
2103 unsigned long long nr_context_switches(void)
2106 unsigned long long sum = 0;
2108 for_each_possible_cpu(i)
2109 sum += cpu_rq(i)->nr_switches;
2114 unsigned long nr_iowait(void)
2116 unsigned long i, sum = 0;
2118 for_each_possible_cpu(i)
2119 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2124 unsigned long nr_iowait_cpu(int cpu)
2126 struct rq *this = cpu_rq(cpu);
2127 return atomic_read(&this->nr_iowait);
2130 unsigned long this_cpu_load(void)
2132 struct rq *this = this_rq();
2133 return this->cpu_load[0];
2137 /* Variables and functions for calc_load */
2138 static atomic_long_t calc_load_tasks;
2139 static unsigned long calc_load_update;
2140 unsigned long avenrun[3];
2141 EXPORT_SYMBOL(avenrun);
2143 static long calc_load_fold_active(struct rq *this_rq)
2145 long nr_active, delta = 0;
2147 nr_active = this_rq->nr_running;
2148 nr_active += (long) this_rq->nr_uninterruptible;
2150 if (nr_active != this_rq->calc_load_active) {
2151 delta = nr_active - this_rq->calc_load_active;
2152 this_rq->calc_load_active = nr_active;
2158 static unsigned long
2159 calc_load(unsigned long load, unsigned long exp, unsigned long active)
2162 load += active * (FIXED_1 - exp);
2163 load += 1UL << (FSHIFT - 1);
2164 return load >> FSHIFT;
2169 * For NO_HZ we delay the active fold to the next LOAD_FREQ update.
2171 * When making the ILB scale, we should try to pull this in as well.
2173 static atomic_long_t calc_load_tasks_idle;
2175 void calc_load_account_idle(struct rq *this_rq)
2179 delta = calc_load_fold_active(this_rq);
2181 atomic_long_add(delta, &calc_load_tasks_idle);
2184 static long calc_load_fold_idle(void)
2189 * Its got a race, we don't care...
2191 if (atomic_long_read(&calc_load_tasks_idle))
2192 delta = atomic_long_xchg(&calc_load_tasks_idle, 0);
2198 * fixed_power_int - compute: x^n, in O(log n) time
2200 * @x: base of the power
2201 * @frac_bits: fractional bits of @x
2202 * @n: power to raise @x to.
2204 * By exploiting the relation between the definition of the natural power
2205 * function: x^n := x*x*...*x (x multiplied by itself for n times), and
2206 * the binary encoding of numbers used by computers: n := \Sum n_i * 2^i,
2207 * (where: n_i \elem {0, 1}, the binary vector representing n),
2208 * we find: x^n := x^(\Sum n_i * 2^i) := \Prod x^(n_i * 2^i), which is
2209 * of course trivially computable in O(log_2 n), the length of our binary
2212 static unsigned long
2213 fixed_power_int(unsigned long x, unsigned int frac_bits, unsigned int n)
2215 unsigned long result = 1UL << frac_bits;
2220 result += 1UL << (frac_bits - 1);
2221 result >>= frac_bits;
2227 x += 1UL << (frac_bits - 1);
2235 * a1 = a0 * e + a * (1 - e)
2237 * a2 = a1 * e + a * (1 - e)
2238 * = (a0 * e + a * (1 - e)) * e + a * (1 - e)
2239 * = a0 * e^2 + a * (1 - e) * (1 + e)
2241 * a3 = a2 * e + a * (1 - e)
2242 * = (a0 * e^2 + a * (1 - e) * (1 + e)) * e + a * (1 - e)
2243 * = a0 * e^3 + a * (1 - e) * (1 + e + e^2)
2247 * an = a0 * e^n + a * (1 - e) * (1 + e + ... + e^n-1) [1]
2248 * = a0 * e^n + a * (1 - e) * (1 - e^n)/(1 - e)
2249 * = a0 * e^n + a * (1 - e^n)
2251 * [1] application of the geometric series:
2254 * S_n := \Sum x^i = -------------
2257 static unsigned long
2258 calc_load_n(unsigned long load, unsigned long exp,
2259 unsigned long active, unsigned int n)
2262 return calc_load(load, fixed_power_int(exp, FSHIFT, n), active);
2266 * NO_HZ can leave us missing all per-cpu ticks calling
2267 * calc_load_account_active(), but since an idle CPU folds its delta into
2268 * calc_load_tasks_idle per calc_load_account_idle(), all we need to do is fold
2269 * in the pending idle delta if our idle period crossed a load cycle boundary.
2271 * Once we've updated the global active value, we need to apply the exponential
2272 * weights adjusted to the number of cycles missed.
2274 static void calc_global_nohz(unsigned long ticks)
2276 long delta, active, n;
2278 if (time_before(jiffies, calc_load_update))
2282 * If we crossed a calc_load_update boundary, make sure to fold
2283 * any pending idle changes, the respective CPUs might have
2284 * missed the tick driven calc_load_account_active() update
2287 delta = calc_load_fold_idle();
2289 atomic_long_add(delta, &calc_load_tasks);
2292 * If we were idle for multiple load cycles, apply them.
2294 if (ticks >= LOAD_FREQ) {
2295 n = ticks / LOAD_FREQ;
2297 active = atomic_long_read(&calc_load_tasks);
2298 active = active > 0 ? active * FIXED_1 : 0;
2300 avenrun[0] = calc_load_n(avenrun[0], EXP_1, active, n);
2301 avenrun[1] = calc_load_n(avenrun[1], EXP_5, active, n);
2302 avenrun[2] = calc_load_n(avenrun[2], EXP_15, active, n);
2304 calc_load_update += n * LOAD_FREQ;
2308 * Its possible the remainder of the above division also crosses
2309 * a LOAD_FREQ period, the regular check in calc_global_load()
2310 * which comes after this will take care of that.
2312 * Consider us being 11 ticks before a cycle completion, and us
2313 * sleeping for 4*LOAD_FREQ + 22 ticks, then the above code will
2314 * age us 4 cycles, and the test in calc_global_load() will
2315 * pick up the final one.
2319 void calc_load_account_idle(struct rq *this_rq)
2323 static inline long calc_load_fold_idle(void)
2328 static void calc_global_nohz(unsigned long ticks)
2334 * get_avenrun - get the load average array
2335 * @loads: pointer to dest load array
2336 * @offset: offset to add
2337 * @shift: shift count to shift the result left
2339 * These values are estimates at best, so no need for locking.
2341 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
2343 loads[0] = (avenrun[0] + offset) << shift;
2344 loads[1] = (avenrun[1] + offset) << shift;
2345 loads[2] = (avenrun[2] + offset) << shift;
2349 * calc_load - update the avenrun load estimates 10 ticks after the
2350 * CPUs have updated calc_load_tasks.
2352 void calc_global_load(unsigned long ticks)
2356 calc_global_nohz(ticks);
2358 if (time_before(jiffies, calc_load_update + 10))
2361 active = atomic_long_read(&calc_load_tasks);
2362 active = active > 0 ? active * FIXED_1 : 0;
2364 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
2365 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
2366 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
2368 calc_load_update += LOAD_FREQ;
2372 * Called from update_cpu_load() to periodically update this CPU's
2375 static void calc_load_account_active(struct rq *this_rq)
2379 if (time_before(jiffies, this_rq->calc_load_update))
2382 delta = calc_load_fold_active(this_rq);
2383 delta += calc_load_fold_idle();
2385 atomic_long_add(delta, &calc_load_tasks);
2387 this_rq->calc_load_update += LOAD_FREQ;
2391 * The exact cpuload at various idx values, calculated at every tick would be
2392 * load = (2^idx - 1) / 2^idx * load + 1 / 2^idx * cur_load
2394 * If a cpu misses updates for n-1 ticks (as it was idle) and update gets called
2395 * on nth tick when cpu may be busy, then we have:
2396 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
2397 * load = (2^idx - 1) / 2^idx) * load + 1 / 2^idx * cur_load
2399 * decay_load_missed() below does efficient calculation of
2400 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
2401 * avoiding 0..n-1 loop doing load = ((2^idx - 1) / 2^idx) * load
2403 * The calculation is approximated on a 128 point scale.
2404 * degrade_zero_ticks is the number of ticks after which load at any
2405 * particular idx is approximated to be zero.
2406 * degrade_factor is a precomputed table, a row for each load idx.
2407 * Each column corresponds to degradation factor for a power of two ticks,
2408 * based on 128 point scale.
2410 * row 2, col 3 (=12) says that the degradation at load idx 2 after
2411 * 8 ticks is 12/128 (which is an approximation of exact factor 3^8/4^8).
2413 * With this power of 2 load factors, we can degrade the load n times
2414 * by looking at 1 bits in n and doing as many mult/shift instead of
2415 * n mult/shifts needed by the exact degradation.
2417 #define DEGRADE_SHIFT 7
2418 static const unsigned char
2419 degrade_zero_ticks[CPU_LOAD_IDX_MAX] = {0, 8, 32, 64, 128};
2420 static const unsigned char
2421 degrade_factor[CPU_LOAD_IDX_MAX][DEGRADE_SHIFT + 1] = {
2422 {0, 0, 0, 0, 0, 0, 0, 0},
2423 {64, 32, 8, 0, 0, 0, 0, 0},
2424 {96, 72, 40, 12, 1, 0, 0},
2425 {112, 98, 75, 43, 15, 1, 0},
2426 {120, 112, 98, 76, 45, 16, 2} };
2429 * Update cpu_load for any missed ticks, due to tickless idle. The backlog
2430 * would be when CPU is idle and so we just decay the old load without
2431 * adding any new load.
2433 static unsigned long
2434 decay_load_missed(unsigned long load, unsigned long missed_updates, int idx)
2438 if (!missed_updates)
2441 if (missed_updates >= degrade_zero_ticks[idx])
2445 return load >> missed_updates;
2447 while (missed_updates) {
2448 if (missed_updates % 2)
2449 load = (load * degrade_factor[idx][j]) >> DEGRADE_SHIFT;
2451 missed_updates >>= 1;
2458 * Update rq->cpu_load[] statistics. This function is usually called every
2459 * scheduler tick (TICK_NSEC). With tickless idle this will not be called
2460 * every tick. We fix it up based on jiffies.
2462 void update_cpu_load(struct rq *this_rq)
2464 unsigned long this_load = this_rq->load.weight;
2465 unsigned long curr_jiffies = jiffies;
2466 unsigned long pending_updates;
2469 this_rq->nr_load_updates++;
2471 /* Avoid repeated calls on same jiffy, when moving in and out of idle */
2472 if (curr_jiffies == this_rq->last_load_update_tick)
2475 pending_updates = curr_jiffies - this_rq->last_load_update_tick;
2476 this_rq->last_load_update_tick = curr_jiffies;
2478 /* Update our load: */
2479 this_rq->cpu_load[0] = this_load; /* Fasttrack for idx 0 */
2480 for (i = 1, scale = 2; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
2481 unsigned long old_load, new_load;
2483 /* scale is effectively 1 << i now, and >> i divides by scale */
2485 old_load = this_rq->cpu_load[i];
2486 old_load = decay_load_missed(old_load, pending_updates - 1, i);
2487 new_load = this_load;
2489 * Round up the averaging division if load is increasing. This
2490 * prevents us from getting stuck on 9 if the load is 10, for
2493 if (new_load > old_load)
2494 new_load += scale - 1;
2496 this_rq->cpu_load[i] = (old_load * (scale - 1) + new_load) >> i;
2499 sched_avg_update(this_rq);
2502 static void update_cpu_load_active(struct rq *this_rq)
2504 update_cpu_load(this_rq);
2506 calc_load_account_active(this_rq);
2512 * sched_exec - execve() is a valuable balancing opportunity, because at
2513 * this point the task has the smallest effective memory and cache footprint.
2515 void sched_exec(void)
2517 struct task_struct *p = current;
2518 unsigned long flags;
2521 raw_spin_lock_irqsave(&p->pi_lock, flags);
2522 dest_cpu = p->sched_class->select_task_rq(p, SD_BALANCE_EXEC, 0);
2523 if (dest_cpu == smp_processor_id())
2526 if (likely(cpu_active(dest_cpu))) {
2527 struct migration_arg arg = { p, dest_cpu };
2529 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2530 stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg);
2534 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2539 DEFINE_PER_CPU(struct kernel_stat, kstat);
2540 DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat);
2542 EXPORT_PER_CPU_SYMBOL(kstat);
2543 EXPORT_PER_CPU_SYMBOL(kernel_cpustat);
2546 * Return any ns on the sched_clock that have not yet been accounted in
2547 * @p in case that task is currently running.
2549 * Called with task_rq_lock() held on @rq.
2551 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
2555 if (task_current(rq, p)) {
2556 update_rq_clock(rq);
2557 ns = rq->clock_task - p->se.exec_start;
2565 unsigned long long task_delta_exec(struct task_struct *p)
2567 unsigned long flags;
2571 rq = task_rq_lock(p, &flags);
2572 ns = do_task_delta_exec(p, rq);
2573 task_rq_unlock(rq, p, &flags);
2579 * Return accounted runtime for the task.
2580 * In case the task is currently running, return the runtime plus current's
2581 * pending runtime that have not been accounted yet.
2583 unsigned long long task_sched_runtime(struct task_struct *p)
2585 unsigned long flags;
2589 rq = task_rq_lock(p, &flags);
2590 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
2591 task_rq_unlock(rq, p, &flags);
2596 #ifdef CONFIG_CGROUP_CPUACCT
2597 struct cgroup_subsys cpuacct_subsys;
2598 struct cpuacct root_cpuacct;
2601 static inline void task_group_account_field(struct task_struct *p, int index,
2604 #ifdef CONFIG_CGROUP_CPUACCT
2605 struct kernel_cpustat *kcpustat;
2609 * Since all updates are sure to touch the root cgroup, we
2610 * get ourselves ahead and touch it first. If the root cgroup
2611 * is the only cgroup, then nothing else should be necessary.
2614 __get_cpu_var(kernel_cpustat).cpustat[index] += tmp;
2616 #ifdef CONFIG_CGROUP_CPUACCT
2617 if (unlikely(!cpuacct_subsys.active))
2622 while (ca && (ca != &root_cpuacct)) {
2623 kcpustat = this_cpu_ptr(ca->cpustat);
2624 kcpustat->cpustat[index] += tmp;
2633 * Account user cpu time to a process.
2634 * @p: the process that the cpu time gets accounted to
2635 * @cputime: the cpu time spent in user space since the last update
2636 * @cputime_scaled: cputime scaled by cpu frequency
2638 void account_user_time(struct task_struct *p, cputime_t cputime,
2639 cputime_t cputime_scaled)
2643 /* Add user time to process. */
2644 p->utime += cputime;
2645 p->utimescaled += cputime_scaled;
2646 account_group_user_time(p, cputime);
2648 index = (TASK_NICE(p) > 0) ? CPUTIME_NICE : CPUTIME_USER;
2650 /* Add user time to cpustat. */
2651 task_group_account_field(p, index, (__force u64) cputime);
2653 /* Account for user time used */
2654 acct_update_integrals(p);
2658 * Account guest cpu time to a process.
2659 * @p: the process that the cpu time gets accounted to
2660 * @cputime: the cpu time spent in virtual machine since the last update
2661 * @cputime_scaled: cputime scaled by cpu frequency
2663 static void account_guest_time(struct task_struct *p, cputime_t cputime,
2664 cputime_t cputime_scaled)
2666 u64 *cpustat = kcpustat_this_cpu->cpustat;
2668 /* Add guest time to process. */
2669 p->utime += cputime;
2670 p->utimescaled += cputime_scaled;
2671 account_group_user_time(p, cputime);
2672 p->gtime += cputime;
2674 /* Add guest time to cpustat. */
2675 if (TASK_NICE(p) > 0) {
2676 cpustat[CPUTIME_NICE] += (__force u64) cputime;
2677 cpustat[CPUTIME_GUEST_NICE] += (__force u64) cputime;
2679 cpustat[CPUTIME_USER] += (__force u64) cputime;
2680 cpustat[CPUTIME_GUEST] += (__force u64) cputime;
2685 * Account system cpu time to a process and desired cpustat field
2686 * @p: the process that the cpu time gets accounted to
2687 * @cputime: the cpu time spent in kernel space since the last update
2688 * @cputime_scaled: cputime scaled by cpu frequency
2689 * @target_cputime64: pointer to cpustat field that has to be updated
2692 void __account_system_time(struct task_struct *p, cputime_t cputime,
2693 cputime_t cputime_scaled, int index)
2695 /* Add system time to process. */
2696 p->stime += cputime;
2697 p->stimescaled += cputime_scaled;
2698 account_group_system_time(p, cputime);
2700 /* Add system time to cpustat. */
2701 task_group_account_field(p, index, (__force u64) cputime);
2703 /* Account for system time used */
2704 acct_update_integrals(p);
2708 * Account system cpu time to a process.
2709 * @p: the process that the cpu time gets accounted to
2710 * @hardirq_offset: the offset to subtract from hardirq_count()
2711 * @cputime: the cpu time spent in kernel space since the last update
2712 * @cputime_scaled: cputime scaled by cpu frequency
2714 void account_system_time(struct task_struct *p, int hardirq_offset,
2715 cputime_t cputime, cputime_t cputime_scaled)
2719 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
2720 account_guest_time(p, cputime, cputime_scaled);
2724 if (hardirq_count() - hardirq_offset)
2725 index = CPUTIME_IRQ;
2726 else if (in_serving_softirq())
2727 index = CPUTIME_SOFTIRQ;
2729 index = CPUTIME_SYSTEM;
2731 __account_system_time(p, cputime, cputime_scaled, index);
2735 * Account for involuntary wait time.
2736 * @cputime: the cpu time spent in involuntary wait
2738 void account_steal_time(cputime_t cputime)
2740 u64 *cpustat = kcpustat_this_cpu->cpustat;
2742 cpustat[CPUTIME_STEAL] += (__force u64) cputime;
2746 * Account for idle time.
2747 * @cputime: the cpu time spent in idle wait
2749 void account_idle_time(cputime_t cputime)
2751 u64 *cpustat = kcpustat_this_cpu->cpustat;
2752 struct rq *rq = this_rq();
2754 if (atomic_read(&rq->nr_iowait) > 0)
2755 cpustat[CPUTIME_IOWAIT] += (__force u64) cputime;
2757 cpustat[CPUTIME_IDLE] += (__force u64) cputime;
2760 static __always_inline bool steal_account_process_tick(void)
2762 #ifdef CONFIG_PARAVIRT
2763 if (static_branch(¶virt_steal_enabled)) {
2766 steal = paravirt_steal_clock(smp_processor_id());
2767 steal -= this_rq()->prev_steal_time;
2769 st = steal_ticks(steal);
2770 this_rq()->prev_steal_time += st * TICK_NSEC;
2772 account_steal_time(st);
2779 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
2781 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
2783 * Account a tick to a process and cpustat
2784 * @p: the process that the cpu time gets accounted to
2785 * @user_tick: is the tick from userspace
2786 * @rq: the pointer to rq
2788 * Tick demultiplexing follows the order
2789 * - pending hardirq update
2790 * - pending softirq update
2794 * - check for guest_time
2795 * - else account as system_time
2797 * Check for hardirq is done both for system and user time as there is
2798 * no timer going off while we are on hardirq and hence we may never get an
2799 * opportunity to update it solely in system time.
2800 * p->stime and friends are only updated on system time and not on irq
2801 * softirq as those do not count in task exec_runtime any more.
2803 static void irqtime_account_process_tick(struct task_struct *p, int user_tick,
2806 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
2807 u64 *cpustat = kcpustat_this_cpu->cpustat;
2809 if (steal_account_process_tick())
2812 if (irqtime_account_hi_update()) {
2813 cpustat[CPUTIME_IRQ] += (__force u64) cputime_one_jiffy;
2814 } else if (irqtime_account_si_update()) {
2815 cpustat[CPUTIME_SOFTIRQ] += (__force u64) cputime_one_jiffy;
2816 } else if (this_cpu_ksoftirqd() == p) {
2818 * ksoftirqd time do not get accounted in cpu_softirq_time.
2819 * So, we have to handle it separately here.
2820 * Also, p->stime needs to be updated for ksoftirqd.
2822 __account_system_time(p, cputime_one_jiffy, one_jiffy_scaled,
2824 } else if (user_tick) {
2825 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
2826 } else if (p == rq->idle) {
2827 account_idle_time(cputime_one_jiffy);
2828 } else if (p->flags & PF_VCPU) { /* System time or guest time */
2829 account_guest_time(p, cputime_one_jiffy, one_jiffy_scaled);
2831 __account_system_time(p, cputime_one_jiffy, one_jiffy_scaled,
2836 static void irqtime_account_idle_ticks(int ticks)
2839 struct rq *rq = this_rq();
2841 for (i = 0; i < ticks; i++)
2842 irqtime_account_process_tick(current, 0, rq);
2844 #else /* CONFIG_IRQ_TIME_ACCOUNTING */
2845 static void irqtime_account_idle_ticks(int ticks) {}
2846 static void irqtime_account_process_tick(struct task_struct *p, int user_tick,
2848 #endif /* CONFIG_IRQ_TIME_ACCOUNTING */
2851 * Account a single tick of cpu time.
2852 * @p: the process that the cpu time gets accounted to
2853 * @user_tick: indicates if the tick is a user or a system tick
2855 void account_process_tick(struct task_struct *p, int user_tick)
2857 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
2858 struct rq *rq = this_rq();
2860 if (sched_clock_irqtime) {
2861 irqtime_account_process_tick(p, user_tick, rq);
2865 if (steal_account_process_tick())
2869 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
2870 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
2871 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
2874 account_idle_time(cputime_one_jiffy);
2878 * Account multiple ticks of steal time.
2879 * @p: the process from which the cpu time has been stolen
2880 * @ticks: number of stolen ticks
2882 void account_steal_ticks(unsigned long ticks)
2884 account_steal_time(jiffies_to_cputime(ticks));
2888 * Account multiple ticks of idle time.
2889 * @ticks: number of stolen ticks
2891 void account_idle_ticks(unsigned long ticks)
2894 if (sched_clock_irqtime) {
2895 irqtime_account_idle_ticks(ticks);
2899 account_idle_time(jiffies_to_cputime(ticks));
2905 * Use precise platform statistics if available:
2907 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
2908 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2914 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2916 struct task_cputime cputime;
2918 thread_group_cputime(p, &cputime);
2920 *ut = cputime.utime;
2921 *st = cputime.stime;
2925 #ifndef nsecs_to_cputime
2926 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
2929 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2931 cputime_t rtime, utime = p->utime, total = utime + p->stime;
2934 * Use CFS's precise accounting:
2936 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
2939 u64 temp = (__force u64) rtime;
2941 temp *= (__force u64) utime;
2942 do_div(temp, (__force u32) total);
2943 utime = (__force cputime_t) temp;
2948 * Compare with previous values, to keep monotonicity:
2950 p->prev_utime = max(p->prev_utime, utime);
2951 p->prev_stime = max(p->prev_stime, rtime - p->prev_utime);
2953 *ut = p->prev_utime;
2954 *st = p->prev_stime;
2958 * Must be called with siglock held.
2960 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2962 struct signal_struct *sig = p->signal;
2963 struct task_cputime cputime;
2964 cputime_t rtime, utime, total;
2966 thread_group_cputime(p, &cputime);
2968 total = cputime.utime + cputime.stime;
2969 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
2972 u64 temp = (__force u64) rtime;
2974 temp *= (__force u64) cputime.utime;
2975 do_div(temp, (__force u32) total);
2976 utime = (__force cputime_t) temp;
2980 sig->prev_utime = max(sig->prev_utime, utime);
2981 sig->prev_stime = max(sig->prev_stime, rtime - sig->prev_utime);
2983 *ut = sig->prev_utime;
2984 *st = sig->prev_stime;
2989 * This function gets called by the timer code, with HZ frequency.
2990 * We call it with interrupts disabled.
2992 void scheduler_tick(void)
2994 int cpu = smp_processor_id();
2995 struct rq *rq = cpu_rq(cpu);
2996 struct task_struct *curr = rq->curr;
3000 raw_spin_lock(&rq->lock);
3001 update_rq_clock(rq);
3002 update_cpu_load_active(rq);
3003 curr->sched_class->task_tick(rq, curr, 0);
3004 raw_spin_unlock(&rq->lock);
3006 perf_event_task_tick();
3009 rq->idle_balance = idle_cpu(cpu);
3010 trigger_load_balance(rq, cpu);
3014 notrace unsigned long get_parent_ip(unsigned long addr)
3016 if (in_lock_functions(addr)) {
3017 addr = CALLER_ADDR2;
3018 if (in_lock_functions(addr))
3019 addr = CALLER_ADDR3;
3024 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
3025 defined(CONFIG_PREEMPT_TRACER))
3027 void __kprobes add_preempt_count(int val)
3029 #ifdef CONFIG_DEBUG_PREEMPT
3033 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3036 preempt_count() += val;
3037 #ifdef CONFIG_DEBUG_PREEMPT
3039 * Spinlock count overflowing soon?
3041 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
3044 if (preempt_count() == val)
3045 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3047 EXPORT_SYMBOL(add_preempt_count);
3049 void __kprobes sub_preempt_count(int val)
3051 #ifdef CONFIG_DEBUG_PREEMPT
3055 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
3058 * Is the spinlock portion underflowing?
3060 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
3061 !(preempt_count() & PREEMPT_MASK)))
3065 if (preempt_count() == val)
3066 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3067 preempt_count() -= val;
3069 EXPORT_SYMBOL(sub_preempt_count);
3074 * Print scheduling while atomic bug:
3076 static noinline void __schedule_bug(struct task_struct *prev)
3078 struct pt_regs *regs = get_irq_regs();
3080 if (oops_in_progress)
3083 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
3084 prev->comm, prev->pid, preempt_count());
3086 debug_show_held_locks(prev);
3088 if (irqs_disabled())
3089 print_irqtrace_events(prev);
3098 * Various schedule()-time debugging checks and statistics:
3100 static inline void schedule_debug(struct task_struct *prev)
3103 * Test if we are atomic. Since do_exit() needs to call into
3104 * schedule() atomically, we ignore that path for now.
3105 * Otherwise, whine if we are scheduling when we should not be.
3107 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
3108 __schedule_bug(prev);
3111 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
3113 schedstat_inc(this_rq(), sched_count);
3116 static void put_prev_task(struct rq *rq, struct task_struct *prev)
3118 if (prev->on_rq || rq->skip_clock_update < 0)
3119 update_rq_clock(rq);
3120 prev->sched_class->put_prev_task(rq, prev);
3124 * Pick up the highest-prio task:
3126 static inline struct task_struct *
3127 pick_next_task(struct rq *rq)
3129 const struct sched_class *class;
3130 struct task_struct *p;
3133 * Optimization: we know that if all tasks are in
3134 * the fair class we can call that function directly:
3136 if (likely(rq->nr_running == rq->cfs.h_nr_running)) {
3137 p = fair_sched_class.pick_next_task(rq);
3142 for_each_class(class) {
3143 p = class->pick_next_task(rq);
3148 BUG(); /* the idle class will always have a runnable task */
3152 * __schedule() is the main scheduler function.
3154 static void __sched __schedule(void)
3156 struct task_struct *prev, *next;
3157 unsigned long *switch_count;
3163 cpu = smp_processor_id();
3165 rcu_note_context_switch(cpu);
3168 schedule_debug(prev);
3170 if (sched_feat(HRTICK))
3173 raw_spin_lock_irq(&rq->lock);
3175 switch_count = &prev->nivcsw;
3176 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
3177 if (unlikely(signal_pending_state(prev->state, prev))) {
3178 prev->state = TASK_RUNNING;
3180 deactivate_task(rq, prev, DEQUEUE_SLEEP);
3184 * If a worker went to sleep, notify and ask workqueue
3185 * whether it wants to wake up a task to maintain
3188 if (prev->flags & PF_WQ_WORKER) {
3189 struct task_struct *to_wakeup;
3191 to_wakeup = wq_worker_sleeping(prev, cpu);
3193 try_to_wake_up_local(to_wakeup);
3196 switch_count = &prev->nvcsw;
3199 pre_schedule(rq, prev);
3201 if (unlikely(!rq->nr_running))
3202 idle_balance(cpu, rq);
3204 put_prev_task(rq, prev);
3205 next = pick_next_task(rq);
3206 clear_tsk_need_resched(prev);
3207 rq->skip_clock_update = 0;
3209 if (likely(prev != next)) {
3214 context_switch(rq, prev, next); /* unlocks the rq */
3216 * The context switch have flipped the stack from under us
3217 * and restored the local variables which were saved when
3218 * this task called schedule() in the past. prev == current
3219 * is still correct, but it can be moved to another cpu/rq.
3221 cpu = smp_processor_id();
3224 raw_spin_unlock_irq(&rq->lock);
3228 preempt_enable_no_resched();
3233 static inline void sched_submit_work(struct task_struct *tsk)
3238 * If we are going to sleep and we have plugged IO queued,
3239 * make sure to submit it to avoid deadlocks.
3241 if (blk_needs_flush_plug(tsk))
3242 blk_schedule_flush_plug(tsk);
3245 asmlinkage void __sched schedule(void)
3247 struct task_struct *tsk = current;
3249 sched_submit_work(tsk);
3252 EXPORT_SYMBOL(schedule);
3254 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
3256 static inline bool owner_running(struct mutex *lock, struct task_struct *owner)
3258 if (lock->owner != owner)
3262 * Ensure we emit the owner->on_cpu, dereference _after_ checking
3263 * lock->owner still matches owner, if that fails, owner might
3264 * point to free()d memory, if it still matches, the rcu_read_lock()
3265 * ensures the memory stays valid.
3269 return owner->on_cpu;
3273 * Look out! "owner" is an entirely speculative pointer
3274 * access and not reliable.
3276 int mutex_spin_on_owner(struct mutex *lock, struct task_struct *owner)
3278 if (!sched_feat(OWNER_SPIN))
3282 while (owner_running(lock, owner)) {
3286 arch_mutex_cpu_relax();
3291 * We break out the loop above on need_resched() and when the
3292 * owner changed, which is a sign for heavy contention. Return
3293 * success only when lock->owner is NULL.
3295 return lock->owner == NULL;
3299 #ifdef CONFIG_PREEMPT
3301 * this is the entry point to schedule() from in-kernel preemption
3302 * off of preempt_enable. Kernel preemptions off return from interrupt
3303 * occur there and call schedule directly.
3305 asmlinkage void __sched notrace preempt_schedule(void)
3307 struct thread_info *ti = current_thread_info();
3310 * If there is a non-zero preempt_count or interrupts are disabled,
3311 * we do not want to preempt the current task. Just return..
3313 if (likely(ti->preempt_count || irqs_disabled()))
3317 add_preempt_count_notrace(PREEMPT_ACTIVE);
3319 sub_preempt_count_notrace(PREEMPT_ACTIVE);
3322 * Check again in case we missed a preemption opportunity
3323 * between schedule and now.
3326 } while (need_resched());
3328 EXPORT_SYMBOL(preempt_schedule);
3331 * this is the entry point to schedule() from kernel preemption
3332 * off of irq context.
3333 * Note, that this is called and return with irqs disabled. This will
3334 * protect us against recursive calling from irq.
3336 asmlinkage void __sched preempt_schedule_irq(void)
3338 struct thread_info *ti = current_thread_info();
3340 /* Catch callers which need to be fixed */
3341 BUG_ON(ti->preempt_count || !irqs_disabled());
3344 add_preempt_count(PREEMPT_ACTIVE);
3347 local_irq_disable();
3348 sub_preempt_count(PREEMPT_ACTIVE);
3351 * Check again in case we missed a preemption opportunity
3352 * between schedule and now.
3355 } while (need_resched());
3358 #endif /* CONFIG_PREEMPT */
3360 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3363 return try_to_wake_up(curr->private, mode, wake_flags);
3365 EXPORT_SYMBOL(default_wake_function);
3368 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
3369 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
3370 * number) then we wake all the non-exclusive tasks and one exclusive task.
3372 * There are circumstances in which we can try to wake a task which has already
3373 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
3374 * zero in this (rare) case, and we handle it by continuing to scan the queue.
3376 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
3377 int nr_exclusive, int wake_flags, void *key)
3379 wait_queue_t *curr, *next;
3381 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
3382 unsigned flags = curr->flags;
3384 if (curr->func(curr, mode, wake_flags, key) &&
3385 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
3391 * __wake_up - wake up threads blocked on a waitqueue.
3393 * @mode: which threads
3394 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3395 * @key: is directly passed to the wakeup function
3397 * It may be assumed that this function implies a write memory barrier before
3398 * changing the task state if and only if any tasks are woken up.
3400 void __wake_up(wait_queue_head_t *q, unsigned int mode,
3401 int nr_exclusive, void *key)
3403 unsigned long flags;
3405 spin_lock_irqsave(&q->lock, flags);
3406 __wake_up_common(q, mode, nr_exclusive, 0, key);
3407 spin_unlock_irqrestore(&q->lock, flags);
3409 EXPORT_SYMBOL(__wake_up);
3412 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
3414 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
3416 __wake_up_common(q, mode, 1, 0, NULL);
3418 EXPORT_SYMBOL_GPL(__wake_up_locked);
3420 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
3422 __wake_up_common(q, mode, 1, 0, key);
3424 EXPORT_SYMBOL_GPL(__wake_up_locked_key);
3427 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
3429 * @mode: which threads
3430 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3431 * @key: opaque value to be passed to wakeup targets
3433 * The sync wakeup differs that the waker knows that it will schedule
3434 * away soon, so while the target thread will be woken up, it will not
3435 * be migrated to another CPU - ie. the two threads are 'synchronized'
3436 * with each other. This can prevent needless bouncing between CPUs.
3438 * On UP it can prevent extra preemption.
3440 * It may be assumed that this function implies a write memory barrier before
3441 * changing the task state if and only if any tasks are woken up.
3443 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
3444 int nr_exclusive, void *key)
3446 unsigned long flags;
3447 int wake_flags = WF_SYNC;
3452 if (unlikely(!nr_exclusive))
3455 spin_lock_irqsave(&q->lock, flags);
3456 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
3457 spin_unlock_irqrestore(&q->lock, flags);
3459 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
3462 * __wake_up_sync - see __wake_up_sync_key()
3464 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
3466 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
3468 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
3471 * complete: - signals a single thread waiting on this completion
3472 * @x: holds the state of this particular completion
3474 * This will wake up a single thread waiting on this completion. Threads will be
3475 * awakened in the same order in which they were queued.
3477 * See also complete_all(), wait_for_completion() and related routines.
3479 * It may be assumed that this function implies a write memory barrier before
3480 * changing the task state if and only if any tasks are woken up.
3482 void complete(struct completion *x)
3484 unsigned long flags;
3486 spin_lock_irqsave(&x->wait.lock, flags);
3488 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
3489 spin_unlock_irqrestore(&x->wait.lock, flags);
3491 EXPORT_SYMBOL(complete);
3494 * complete_all: - signals all threads waiting on this completion
3495 * @x: holds the state of this particular completion
3497 * This will wake up all threads waiting on this particular completion event.
3499 * It may be assumed that this function implies a write memory barrier before
3500 * changing the task state if and only if any tasks are woken up.
3502 void complete_all(struct completion *x)
3504 unsigned long flags;
3506 spin_lock_irqsave(&x->wait.lock, flags);
3507 x->done += UINT_MAX/2;
3508 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
3509 spin_unlock_irqrestore(&x->wait.lock, flags);
3511 EXPORT_SYMBOL(complete_all);
3513 static inline long __sched
3514 do_wait_for_common(struct completion *x, long timeout, int state)
3517 DECLARE_WAITQUEUE(wait, current);
3519 __add_wait_queue_tail_exclusive(&x->wait, &wait);
3521 if (signal_pending_state(state, current)) {
3522 timeout = -ERESTARTSYS;
3525 __set_current_state(state);
3526 spin_unlock_irq(&x->wait.lock);
3527 timeout = schedule_timeout(timeout);
3528 spin_lock_irq(&x->wait.lock);
3529 } while (!x->done && timeout);
3530 __remove_wait_queue(&x->wait, &wait);
3535 return timeout ?: 1;
3539 wait_for_common(struct completion *x, long timeout, int state)
3543 spin_lock_irq(&x->wait.lock);
3544 timeout = do_wait_for_common(x, timeout, state);
3545 spin_unlock_irq(&x->wait.lock);
3550 * wait_for_completion: - waits for completion of a task
3551 * @x: holds the state of this particular completion
3553 * This waits to be signaled for completion of a specific task. It is NOT
3554 * interruptible and there is no timeout.
3556 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
3557 * and interrupt capability. Also see complete().
3559 void __sched wait_for_completion(struct completion *x)
3561 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
3563 EXPORT_SYMBOL(wait_for_completion);
3566 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
3567 * @x: holds the state of this particular completion
3568 * @timeout: timeout value in jiffies
3570 * This waits for either a completion of a specific task to be signaled or for a
3571 * specified timeout to expire. The timeout is in jiffies. It is not
3574 * The return value is 0 if timed out, and positive (at least 1, or number of
3575 * jiffies left till timeout) if completed.
3577 unsigned long __sched
3578 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
3580 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
3582 EXPORT_SYMBOL(wait_for_completion_timeout);
3585 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
3586 * @x: holds the state of this particular completion
3588 * This waits for completion of a specific task to be signaled. It is
3591 * The return value is -ERESTARTSYS if interrupted, 0 if completed.
3593 int __sched wait_for_completion_interruptible(struct completion *x)
3595 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
3596 if (t == -ERESTARTSYS)
3600 EXPORT_SYMBOL(wait_for_completion_interruptible);
3603 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
3604 * @x: holds the state of this particular completion
3605 * @timeout: timeout value in jiffies
3607 * This waits for either a completion of a specific task to be signaled or for a
3608 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
3610 * The return value is -ERESTARTSYS if interrupted, 0 if timed out,
3611 * positive (at least 1, or number of jiffies left till timeout) if completed.
3614 wait_for_completion_interruptible_timeout(struct completion *x,
3615 unsigned long timeout)
3617 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
3619 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
3622 * wait_for_completion_killable: - waits for completion of a task (killable)
3623 * @x: holds the state of this particular completion
3625 * This waits to be signaled for completion of a specific task. It can be
3626 * interrupted by a kill signal.
3628 * The return value is -ERESTARTSYS if interrupted, 0 if completed.
3630 int __sched wait_for_completion_killable(struct completion *x)
3632 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
3633 if (t == -ERESTARTSYS)
3637 EXPORT_SYMBOL(wait_for_completion_killable);
3640 * wait_for_completion_killable_timeout: - waits for completion of a task (w/(to,killable))
3641 * @x: holds the state of this particular completion
3642 * @timeout: timeout value in jiffies
3644 * This waits for either a completion of a specific task to be
3645 * signaled or for a specified timeout to expire. It can be
3646 * interrupted by a kill signal. The timeout is in jiffies.
3648 * The return value is -ERESTARTSYS if interrupted, 0 if timed out,
3649 * positive (at least 1, or number of jiffies left till timeout) if completed.
3652 wait_for_completion_killable_timeout(struct completion *x,
3653 unsigned long timeout)
3655 return wait_for_common(x, timeout, TASK_KILLABLE);
3657 EXPORT_SYMBOL(wait_for_completion_killable_timeout);
3660 * try_wait_for_completion - try to decrement a completion without blocking
3661 * @x: completion structure
3663 * Returns: 0 if a decrement cannot be done without blocking
3664 * 1 if a decrement succeeded.
3666 * If a completion is being used as a counting completion,
3667 * attempt to decrement the counter without blocking. This
3668 * enables us to avoid waiting if the resource the completion
3669 * is protecting is not available.
3671 bool try_wait_for_completion(struct completion *x)
3673 unsigned long flags;
3676 spin_lock_irqsave(&x->wait.lock, flags);
3681 spin_unlock_irqrestore(&x->wait.lock, flags);
3684 EXPORT_SYMBOL(try_wait_for_completion);
3687 * completion_done - Test to see if a completion has any waiters
3688 * @x: completion structure
3690 * Returns: 0 if there are waiters (wait_for_completion() in progress)
3691 * 1 if there are no waiters.
3694 bool completion_done(struct completion *x)
3696 unsigned long flags;
3699 spin_lock_irqsave(&x->wait.lock, flags);
3702 spin_unlock_irqrestore(&x->wait.lock, flags);
3705 EXPORT_SYMBOL(completion_done);
3708 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
3710 unsigned long flags;
3713 init_waitqueue_entry(&wait, current);
3715 __set_current_state(state);
3717 spin_lock_irqsave(&q->lock, flags);
3718 __add_wait_queue(q, &wait);
3719 spin_unlock(&q->lock);
3720 timeout = schedule_timeout(timeout);
3721 spin_lock_irq(&q->lock);
3722 __remove_wait_queue(q, &wait);
3723 spin_unlock_irqrestore(&q->lock, flags);
3728 void __sched interruptible_sleep_on(wait_queue_head_t *q)
3730 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
3732 EXPORT_SYMBOL(interruptible_sleep_on);
3735 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
3737 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
3739 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
3741 void __sched sleep_on(wait_queue_head_t *q)
3743 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
3745 EXPORT_SYMBOL(sleep_on);
3747 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
3749 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
3751 EXPORT_SYMBOL(sleep_on_timeout);
3753 #ifdef CONFIG_RT_MUTEXES
3756 * rt_mutex_setprio - set the current priority of a task
3758 * @prio: prio value (kernel-internal form)
3760 * This function changes the 'effective' priority of a task. It does
3761 * not touch ->normal_prio like __setscheduler().
3763 * Used by the rt_mutex code to implement priority inheritance logic.
3765 void rt_mutex_setprio(struct task_struct *p, int prio)
3767 int oldprio, on_rq, running;
3769 const struct sched_class *prev_class;
3771 BUG_ON(prio < 0 || prio > MAX_PRIO);
3773 rq = __task_rq_lock(p);
3775 trace_sched_pi_setprio(p, prio);
3777 prev_class = p->sched_class;
3779 running = task_current(rq, p);
3781 dequeue_task(rq, p, 0);
3783 p->sched_class->put_prev_task(rq, p);
3786 p->sched_class = &rt_sched_class;
3788 p->sched_class = &fair_sched_class;
3793 p->sched_class->set_curr_task(rq);
3795 enqueue_task(rq, p, oldprio < prio ? ENQUEUE_HEAD : 0);
3797 check_class_changed(rq, p, prev_class, oldprio);
3798 __task_rq_unlock(rq);
3803 void set_user_nice(struct task_struct *p, long nice)
3805 int old_prio, delta, on_rq;
3806 unsigned long flags;
3809 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
3812 * We have to be careful, if called from sys_setpriority(),
3813 * the task might be in the middle of scheduling on another CPU.
3815 rq = task_rq_lock(p, &flags);
3817 * The RT priorities are set via sched_setscheduler(), but we still
3818 * allow the 'normal' nice value to be set - but as expected
3819 * it wont have any effect on scheduling until the task is
3820 * SCHED_FIFO/SCHED_RR:
3822 if (task_has_rt_policy(p)) {
3823 p->static_prio = NICE_TO_PRIO(nice);
3828 dequeue_task(rq, p, 0);
3830 p->static_prio = NICE_TO_PRIO(nice);
3833 p->prio = effective_prio(p);
3834 delta = p->prio - old_prio;
3837 enqueue_task(rq, p, 0);
3839 * If the task increased its priority or is running and
3840 * lowered its priority, then reschedule its CPU:
3842 if (delta < 0 || (delta > 0 && task_running(rq, p)))
3843 resched_task(rq->curr);
3846 task_rq_unlock(rq, p, &flags);
3848 EXPORT_SYMBOL(set_user_nice);
3851 * can_nice - check if a task can reduce its nice value
3855 int can_nice(const struct task_struct *p, const int nice)
3857 /* convert nice value [19,-20] to rlimit style value [1,40] */
3858 int nice_rlim = 20 - nice;
3860 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
3861 capable(CAP_SYS_NICE));
3864 #ifdef __ARCH_WANT_SYS_NICE
3867 * sys_nice - change the priority of the current process.
3868 * @increment: priority increment
3870 * sys_setpriority is a more generic, but much slower function that
3871 * does similar things.
3873 SYSCALL_DEFINE1(nice, int, increment)
3878 * Setpriority might change our priority at the same moment.
3879 * We don't have to worry. Conceptually one call occurs first
3880 * and we have a single winner.
3882 if (increment < -40)
3887 nice = TASK_NICE(current) + increment;
3893 if (increment < 0 && !can_nice(current, nice))
3896 retval = security_task_setnice(current, nice);
3900 set_user_nice(current, nice);
3907 * task_prio - return the priority value of a given task.
3908 * @p: the task in question.
3910 * This is the priority value as seen by users in /proc.
3911 * RT tasks are offset by -200. Normal tasks are centered
3912 * around 0, value goes from -16 to +15.
3914 int task_prio(const struct task_struct *p)
3916 return p->prio - MAX_RT_PRIO;
3920 * task_nice - return the nice value of a given task.
3921 * @p: the task in question.
3923 int task_nice(const struct task_struct *p)
3925 return TASK_NICE(p);
3927 EXPORT_SYMBOL(task_nice);
3930 * idle_cpu - is a given cpu idle currently?
3931 * @cpu: the processor in question.
3933 int idle_cpu(int cpu)
3935 struct rq *rq = cpu_rq(cpu);
3937 if (rq->curr != rq->idle)
3944 if (!llist_empty(&rq->wake_list))
3952 * idle_task - return the idle task for a given cpu.
3953 * @cpu: the processor in question.
3955 struct task_struct *idle_task(int cpu)
3957 return cpu_rq(cpu)->idle;
3961 * find_process_by_pid - find a process with a matching PID value.
3962 * @pid: the pid in question.
3964 static struct task_struct *find_process_by_pid(pid_t pid)
3966 return pid ? find_task_by_vpid(pid) : current;
3969 /* Actually do priority change: must hold rq lock. */
3971 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
3974 p->rt_priority = prio;
3975 p->normal_prio = normal_prio(p);
3976 /* we are holding p->pi_lock already */
3977 p->prio = rt_mutex_getprio(p);
3978 if (rt_prio(p->prio))
3979 p->sched_class = &rt_sched_class;
3981 p->sched_class = &fair_sched_class;
3986 * check the target process has a UID that matches the current process's
3988 static bool check_same_owner(struct task_struct *p)
3990 const struct cred *cred = current_cred(), *pcred;
3994 pcred = __task_cred(p);
3995 if (cred->user->user_ns == pcred->user->user_ns)
3996 match = (cred->euid == pcred->euid ||
3997 cred->euid == pcred->uid);
4004 static int __sched_setscheduler(struct task_struct *p, int policy,
4005 const struct sched_param *param, bool user)
4007 int retval, oldprio, oldpolicy = -1, on_rq, running;
4008 unsigned long flags;
4009 const struct sched_class *prev_class;
4013 /* may grab non-irq protected spin_locks */
4014 BUG_ON(in_interrupt());
4016 /* double check policy once rq lock held */
4018 reset_on_fork = p->sched_reset_on_fork;
4019 policy = oldpolicy = p->policy;
4021 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
4022 policy &= ~SCHED_RESET_ON_FORK;
4024 if (policy != SCHED_FIFO && policy != SCHED_RR &&
4025 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
4026 policy != SCHED_IDLE)
4031 * Valid priorities for SCHED_FIFO and SCHED_RR are
4032 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4033 * SCHED_BATCH and SCHED_IDLE is 0.
4035 if (param->sched_priority < 0 ||
4036 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
4037 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
4039 if (rt_policy(policy) != (param->sched_priority != 0))
4043 * Allow unprivileged RT tasks to decrease priority:
4045 if (user && !capable(CAP_SYS_NICE)) {
4046 if (rt_policy(policy)) {
4047 unsigned long rlim_rtprio =
4048 task_rlimit(p, RLIMIT_RTPRIO);
4050 /* can't set/change the rt policy */
4051 if (policy != p->policy && !rlim_rtprio)
4054 /* can't increase priority */
4055 if (param->sched_priority > p->rt_priority &&
4056 param->sched_priority > rlim_rtprio)
4061 * Treat SCHED_IDLE as nice 20. Only allow a switch to
4062 * SCHED_NORMAL if the RLIMIT_NICE would normally permit it.
4064 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) {
4065 if (!can_nice(p, TASK_NICE(p)))
4069 /* can't change other user's priorities */
4070 if (!check_same_owner(p))
4073 /* Normal users shall not reset the sched_reset_on_fork flag */
4074 if (p->sched_reset_on_fork && !reset_on_fork)
4079 retval = security_task_setscheduler(p);
4085 * make sure no PI-waiters arrive (or leave) while we are
4086 * changing the priority of the task:
4088 * To be able to change p->policy safely, the appropriate
4089 * runqueue lock must be held.
4091 rq = task_rq_lock(p, &flags);
4094 * Changing the policy of the stop threads its a very bad idea
4096 if (p == rq->stop) {
4097 task_rq_unlock(rq, p, &flags);
4102 * If not changing anything there's no need to proceed further:
4104 if (unlikely(policy == p->policy && (!rt_policy(policy) ||
4105 param->sched_priority == p->rt_priority))) {
4107 __task_rq_unlock(rq);
4108 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4112 #ifdef CONFIG_RT_GROUP_SCHED
4115 * Do not allow realtime tasks into groups that have no runtime
4118 if (rt_bandwidth_enabled() && rt_policy(policy) &&
4119 task_group(p)->rt_bandwidth.rt_runtime == 0 &&
4120 !task_group_is_autogroup(task_group(p))) {
4121 task_rq_unlock(rq, p, &flags);
4127 /* recheck policy now with rq lock held */
4128 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
4129 policy = oldpolicy = -1;
4130 task_rq_unlock(rq, p, &flags);
4134 running = task_current(rq, p);
4136 deactivate_task(rq, p, 0);
4138 p->sched_class->put_prev_task(rq, p);
4140 p->sched_reset_on_fork = reset_on_fork;
4143 prev_class = p->sched_class;
4144 __setscheduler(rq, p, policy, param->sched_priority);
4147 p->sched_class->set_curr_task(rq);
4149 activate_task(rq, p, 0);
4151 check_class_changed(rq, p, prev_class, oldprio);
4152 task_rq_unlock(rq, p, &flags);
4154 rt_mutex_adjust_pi(p);
4160 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4161 * @p: the task in question.
4162 * @policy: new policy.
4163 * @param: structure containing the new RT priority.
4165 * NOTE that the task may be already dead.
4167 int sched_setscheduler(struct task_struct *p, int policy,
4168 const struct sched_param *param)
4170 return __sched_setscheduler(p, policy, param, true);
4172 EXPORT_SYMBOL_GPL(sched_setscheduler);
4175 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
4176 * @p: the task in question.
4177 * @policy: new policy.
4178 * @param: structure containing the new RT priority.
4180 * Just like sched_setscheduler, only don't bother checking if the
4181 * current context has permission. For example, this is needed in
4182 * stop_machine(): we create temporary high priority worker threads,
4183 * but our caller might not have that capability.
4185 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
4186 const struct sched_param *param)
4188 return __sched_setscheduler(p, policy, param, false);
4192 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
4194 struct sched_param lparam;
4195 struct task_struct *p;
4198 if (!param || pid < 0)
4200 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
4205 p = find_process_by_pid(pid);
4207 retval = sched_setscheduler(p, policy, &lparam);
4214 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4215 * @pid: the pid in question.
4216 * @policy: new policy.
4217 * @param: structure containing the new RT priority.
4219 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
4220 struct sched_param __user *, param)
4222 /* negative values for policy are not valid */
4226 return do_sched_setscheduler(pid, policy, param);
4230 * sys_sched_setparam - set/change the RT priority of a thread
4231 * @pid: the pid in question.
4232 * @param: structure containing the new RT priority.
4234 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
4236 return do_sched_setscheduler(pid, -1, param);
4240 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4241 * @pid: the pid in question.
4243 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
4245 struct task_struct *p;
4253 p = find_process_by_pid(pid);
4255 retval = security_task_getscheduler(p);
4258 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
4265 * sys_sched_getparam - get the RT priority of a thread
4266 * @pid: the pid in question.
4267 * @param: structure containing the RT priority.
4269 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
4271 struct sched_param lp;
4272 struct task_struct *p;
4275 if (!param || pid < 0)
4279 p = find_process_by_pid(pid);
4284 retval = security_task_getscheduler(p);
4288 lp.sched_priority = p->rt_priority;
4292 * This one might sleep, we cannot do it with a spinlock held ...
4294 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
4303 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4305 cpumask_var_t cpus_allowed, new_mask;
4306 struct task_struct *p;
4312 p = find_process_by_pid(pid);
4319 /* Prevent p going away */
4323 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4327 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4329 goto out_free_cpus_allowed;
4332 if (!check_same_owner(p) && !task_ns_capable(p, CAP_SYS_NICE))
4335 retval = security_task_setscheduler(p);
4339 cpuset_cpus_allowed(p, cpus_allowed);
4340 cpumask_and(new_mask, in_mask, cpus_allowed);
4342 retval = set_cpus_allowed_ptr(p, new_mask);
4345 cpuset_cpus_allowed(p, cpus_allowed);
4346 if (!cpumask_subset(new_mask, cpus_allowed)) {
4348 * We must have raced with a concurrent cpuset
4349 * update. Just reset the cpus_allowed to the
4350 * cpuset's cpus_allowed
4352 cpumask_copy(new_mask, cpus_allowed);
4357 free_cpumask_var(new_mask);
4358 out_free_cpus_allowed:
4359 free_cpumask_var(cpus_allowed);
4366 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4367 struct cpumask *new_mask)
4369 if (len < cpumask_size())
4370 cpumask_clear(new_mask);
4371 else if (len > cpumask_size())
4372 len = cpumask_size();
4374 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4378 * sys_sched_setaffinity - set the cpu affinity of a process
4379 * @pid: pid of the process
4380 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4381 * @user_mask_ptr: user-space pointer to the new cpu mask
4383 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4384 unsigned long __user *, user_mask_ptr)
4386 cpumask_var_t new_mask;
4389 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4392 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4394 retval = sched_setaffinity(pid, new_mask);
4395 free_cpumask_var(new_mask);
4399 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4401 struct task_struct *p;
4402 unsigned long flags;
4409 p = find_process_by_pid(pid);
4413 retval = security_task_getscheduler(p);
4417 raw_spin_lock_irqsave(&p->pi_lock, flags);
4418 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
4419 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4429 * sys_sched_getaffinity - get the cpu affinity of a process
4430 * @pid: pid of the process
4431 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4432 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4434 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4435 unsigned long __user *, user_mask_ptr)
4440 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
4442 if (len & (sizeof(unsigned long)-1))
4445 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4448 ret = sched_getaffinity(pid, mask);
4450 size_t retlen = min_t(size_t, len, cpumask_size());
4452 if (copy_to_user(user_mask_ptr, mask, retlen))
4457 free_cpumask_var(mask);
4463 * sys_sched_yield - yield the current processor to other threads.
4465 * This function yields the current CPU to other tasks. If there are no
4466 * other threads running on this CPU then this function will return.
4468 SYSCALL_DEFINE0(sched_yield)
4470 struct rq *rq = this_rq_lock();
4472 schedstat_inc(rq, yld_count);
4473 current->sched_class->yield_task(rq);
4476 * Since we are going to call schedule() anyway, there's
4477 * no need to preempt or enable interrupts:
4479 __release(rq->lock);
4480 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4481 do_raw_spin_unlock(&rq->lock);
4482 preempt_enable_no_resched();
4489 static inline int should_resched(void)
4491 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
4494 static void __cond_resched(void)
4496 add_preempt_count(PREEMPT_ACTIVE);
4498 sub_preempt_count(PREEMPT_ACTIVE);
4501 int __sched _cond_resched(void)
4503 if (should_resched()) {
4509 EXPORT_SYMBOL(_cond_resched);
4512 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4513 * call schedule, and on return reacquire the lock.
4515 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4516 * operations here to prevent schedule() from being called twice (once via
4517 * spin_unlock(), once by hand).
4519 int __cond_resched_lock(spinlock_t *lock)
4521 int resched = should_resched();
4524 lockdep_assert_held(lock);
4526 if (spin_needbreak(lock) || resched) {
4537 EXPORT_SYMBOL(__cond_resched_lock);
4539 int __sched __cond_resched_softirq(void)
4541 BUG_ON(!in_softirq());
4543 if (should_resched()) {
4551 EXPORT_SYMBOL(__cond_resched_softirq);
4554 * yield - yield the current processor to other threads.
4556 * This is a shortcut for kernel-space yielding - it marks the
4557 * thread runnable and calls sys_sched_yield().
4559 void __sched yield(void)
4561 set_current_state(TASK_RUNNING);
4564 EXPORT_SYMBOL(yield);
4567 * yield_to - yield the current processor to another thread in
4568 * your thread group, or accelerate that thread toward the
4569 * processor it's on.
4571 * @preempt: whether task preemption is allowed or not
4573 * It's the caller's job to ensure that the target task struct
4574 * can't go away on us before we can do any checks.
4576 * Returns true if we indeed boosted the target task.
4578 bool __sched yield_to(struct task_struct *p, bool preempt)
4580 struct task_struct *curr = current;
4581 struct rq *rq, *p_rq;
4582 unsigned long flags;
4585 local_irq_save(flags);
4590 double_rq_lock(rq, p_rq);
4591 while (task_rq(p) != p_rq) {
4592 double_rq_unlock(rq, p_rq);
4596 if (!curr->sched_class->yield_to_task)
4599 if (curr->sched_class != p->sched_class)
4602 if (task_running(p_rq, p) || p->state)
4605 yielded = curr->sched_class->yield_to_task(rq, p, preempt);
4607 schedstat_inc(rq, yld_count);
4609 * Make p's CPU reschedule; pick_next_entity takes care of
4612 if (preempt && rq != p_rq)
4613 resched_task(p_rq->curr);
4616 * We might have set it in task_yield_fair(), but are
4617 * not going to schedule(), so don't want to skip
4620 rq->skip_clock_update = 0;
4624 double_rq_unlock(rq, p_rq);
4625 local_irq_restore(flags);
4632 EXPORT_SYMBOL_GPL(yield_to);
4635 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
4636 * that process accounting knows that this is a task in IO wait state.
4638 void __sched io_schedule(void)
4640 struct rq *rq = raw_rq();
4642 delayacct_blkio_start();
4643 atomic_inc(&rq->nr_iowait);
4644 blk_flush_plug(current);
4645 current->in_iowait = 1;
4647 current->in_iowait = 0;
4648 atomic_dec(&rq->nr_iowait);
4649 delayacct_blkio_end();
4651 EXPORT_SYMBOL(io_schedule);
4653 long __sched io_schedule_timeout(long timeout)
4655 struct rq *rq = raw_rq();
4658 delayacct_blkio_start();
4659 atomic_inc(&rq->nr_iowait);
4660 blk_flush_plug(current);
4661 current->in_iowait = 1;
4662 ret = schedule_timeout(timeout);
4663 current->in_iowait = 0;
4664 atomic_dec(&rq->nr_iowait);
4665 delayacct_blkio_end();
4670 * sys_sched_get_priority_max - return maximum RT priority.
4671 * @policy: scheduling class.
4673 * this syscall returns the maximum rt_priority that can be used
4674 * by a given scheduling class.
4676 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
4683 ret = MAX_USER_RT_PRIO-1;
4695 * sys_sched_get_priority_min - return minimum RT priority.
4696 * @policy: scheduling class.
4698 * this syscall returns the minimum rt_priority that can be used
4699 * by a given scheduling class.
4701 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
4719 * sys_sched_rr_get_interval - return the default timeslice of a process.
4720 * @pid: pid of the process.
4721 * @interval: userspace pointer to the timeslice value.
4723 * this syscall writes the default timeslice value of a given process
4724 * into the user-space timespec buffer. A value of '0' means infinity.
4726 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
4727 struct timespec __user *, interval)
4729 struct task_struct *p;
4730 unsigned int time_slice;
4731 unsigned long flags;
4741 p = find_process_by_pid(pid);
4745 retval = security_task_getscheduler(p);
4749 rq = task_rq_lock(p, &flags);
4750 time_slice = p->sched_class->get_rr_interval(rq, p);
4751 task_rq_unlock(rq, p, &flags);
4754 jiffies_to_timespec(time_slice, &t);
4755 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
4763 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
4765 void sched_show_task(struct task_struct *p)
4767 unsigned long free = 0;
4770 state = p->state ? __ffs(p->state) + 1 : 0;
4771 printk(KERN_INFO "%-15.15s %c", p->comm,
4772 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
4773 #if BITS_PER_LONG == 32
4774 if (state == TASK_RUNNING)
4775 printk(KERN_CONT " running ");
4777 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
4779 if (state == TASK_RUNNING)
4780 printk(KERN_CONT " running task ");
4782 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
4784 #ifdef CONFIG_DEBUG_STACK_USAGE
4785 free = stack_not_used(p);
4787 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
4788 task_pid_nr(p), task_pid_nr(rcu_dereference(p->real_parent)),
4789 (unsigned long)task_thread_info(p)->flags);
4791 show_stack(p, NULL);
4794 void show_state_filter(unsigned long state_filter)
4796 struct task_struct *g, *p;
4798 #if BITS_PER_LONG == 32
4800 " task PC stack pid father\n");
4803 " task PC stack pid father\n");
4806 do_each_thread(g, p) {
4808 * reset the NMI-timeout, listing all files on a slow
4809 * console might take a lot of time:
4811 touch_nmi_watchdog();
4812 if (!state_filter || (p->state & state_filter))
4814 } while_each_thread(g, p);
4816 touch_all_softlockup_watchdogs();
4818 #ifdef CONFIG_SCHED_DEBUG
4819 sysrq_sched_debug_show();
4823 * Only show locks if all tasks are dumped:
4826 debug_show_all_locks();
4829 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
4831 idle->sched_class = &idle_sched_class;
4835 * init_idle - set up an idle thread for a given CPU
4836 * @idle: task in question
4837 * @cpu: cpu the idle task belongs to
4839 * NOTE: this function does not set the idle thread's NEED_RESCHED
4840 * flag, to make booting more robust.
4842 void __cpuinit init_idle(struct task_struct *idle, int cpu)
4844 struct rq *rq = cpu_rq(cpu);
4845 unsigned long flags;
4847 raw_spin_lock_irqsave(&rq->lock, flags);
4850 idle->state = TASK_RUNNING;
4851 idle->se.exec_start = sched_clock();
4853 do_set_cpus_allowed(idle, cpumask_of(cpu));
4855 * We're having a chicken and egg problem, even though we are
4856 * holding rq->lock, the cpu isn't yet set to this cpu so the
4857 * lockdep check in task_group() will fail.
4859 * Similar case to sched_fork(). / Alternatively we could
4860 * use task_rq_lock() here and obtain the other rq->lock.
4865 __set_task_cpu(idle, cpu);
4868 rq->curr = rq->idle = idle;
4869 #if defined(CONFIG_SMP)
4872 raw_spin_unlock_irqrestore(&rq->lock, flags);
4874 /* Set the preempt count _outside_ the spinlocks! */
4875 task_thread_info(idle)->preempt_count = 0;
4878 * The idle tasks have their own, simple scheduling class:
4880 idle->sched_class = &idle_sched_class;
4881 ftrace_graph_init_idle_task(idle, cpu);
4882 #if defined(CONFIG_SMP)
4883 sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu);
4888 void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask)
4890 if (p->sched_class && p->sched_class->set_cpus_allowed)
4891 p->sched_class->set_cpus_allowed(p, new_mask);
4893 cpumask_copy(&p->cpus_allowed, new_mask);
4894 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
4898 * This is how migration works:
4900 * 1) we invoke migration_cpu_stop() on the target CPU using
4902 * 2) stopper starts to run (implicitly forcing the migrated thread
4904 * 3) it checks whether the migrated task is still in the wrong runqueue.
4905 * 4) if it's in the wrong runqueue then the migration thread removes
4906 * it and puts it into the right queue.
4907 * 5) stopper completes and stop_one_cpu() returns and the migration
4912 * Change a given task's CPU affinity. Migrate the thread to a
4913 * proper CPU and schedule it away if the CPU it's executing on
4914 * is removed from the allowed bitmask.
4916 * NOTE: the caller must have a valid reference to the task, the
4917 * task must not exit() & deallocate itself prematurely. The
4918 * call is not atomic; no spinlocks may be held.
4920 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
4922 unsigned long flags;
4924 unsigned int dest_cpu;
4927 rq = task_rq_lock(p, &flags);
4929 if (cpumask_equal(&p->cpus_allowed, new_mask))
4932 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
4937 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current)) {
4942 do_set_cpus_allowed(p, new_mask);
4944 /* Can the task run on the task's current CPU? If so, we're done */
4945 if (cpumask_test_cpu(task_cpu(p), new_mask))
4948 dest_cpu = cpumask_any_and(cpu_active_mask, new_mask);
4950 struct migration_arg arg = { p, dest_cpu };
4951 /* Need help from migration thread: drop lock and wait. */
4952 task_rq_unlock(rq, p, &flags);
4953 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
4954 tlb_migrate_finish(p->mm);
4958 task_rq_unlock(rq, p, &flags);
4962 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
4965 * Move (not current) task off this cpu, onto dest cpu. We're doing
4966 * this because either it can't run here any more (set_cpus_allowed()
4967 * away from this CPU, or CPU going down), or because we're
4968 * attempting to rebalance this task on exec (sched_exec).
4970 * So we race with normal scheduler movements, but that's OK, as long
4971 * as the task is no longer on this CPU.
4973 * Returns non-zero if task was successfully migrated.
4975 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
4977 struct rq *rq_dest, *rq_src;
4980 if (unlikely(!cpu_active(dest_cpu)))
4983 rq_src = cpu_rq(src_cpu);
4984 rq_dest = cpu_rq(dest_cpu);
4986 raw_spin_lock(&p->pi_lock);
4987 double_rq_lock(rq_src, rq_dest);
4988 /* Already moved. */
4989 if (task_cpu(p) != src_cpu)
4991 /* Affinity changed (again). */
4992 if (!cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
4996 * If we're not on a rq, the next wake-up will ensure we're
5000 deactivate_task(rq_src, p, 0);
5001 set_task_cpu(p, dest_cpu);
5002 activate_task(rq_dest, p, 0);
5003 check_preempt_curr(rq_dest, p, 0);
5008 double_rq_unlock(rq_src, rq_dest);
5009 raw_spin_unlock(&p->pi_lock);
5014 * migration_cpu_stop - this will be executed by a highprio stopper thread
5015 * and performs thread migration by bumping thread off CPU then
5016 * 'pushing' onto another runqueue.
5018 static int migration_cpu_stop(void *data)
5020 struct migration_arg *arg = data;
5023 * The original target cpu might have gone down and we might
5024 * be on another cpu but it doesn't matter.
5026 local_irq_disable();
5027 __migrate_task(arg->task, raw_smp_processor_id(), arg->dest_cpu);
5032 #ifdef CONFIG_HOTPLUG_CPU
5035 * Ensures that the idle task is using init_mm right before its cpu goes
5038 void idle_task_exit(void)
5040 struct mm_struct *mm = current->active_mm;
5042 BUG_ON(cpu_online(smp_processor_id()));
5045 switch_mm(mm, &init_mm, current);
5050 * While a dead CPU has no uninterruptible tasks queued at this point,
5051 * it might still have a nonzero ->nr_uninterruptible counter, because
5052 * for performance reasons the counter is not stricly tracking tasks to
5053 * their home CPUs. So we just add the counter to another CPU's counter,
5054 * to keep the global sum constant after CPU-down:
5056 static void migrate_nr_uninterruptible(struct rq *rq_src)
5058 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
5060 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
5061 rq_src->nr_uninterruptible = 0;
5065 * remove the tasks which were accounted by rq from calc_load_tasks.
5067 static void calc_global_load_remove(struct rq *rq)
5069 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
5070 rq->calc_load_active = 0;
5074 * Migrate all tasks from the rq, sleeping tasks will be migrated by
5075 * try_to_wake_up()->select_task_rq().
5077 * Called with rq->lock held even though we'er in stop_machine() and
5078 * there's no concurrency possible, we hold the required locks anyway
5079 * because of lock validation efforts.
5081 static void migrate_tasks(unsigned int dead_cpu)
5083 struct rq *rq = cpu_rq(dead_cpu);
5084 struct task_struct *next, *stop = rq->stop;
5088 * Fudge the rq selection such that the below task selection loop
5089 * doesn't get stuck on the currently eligible stop task.
5091 * We're currently inside stop_machine() and the rq is either stuck
5092 * in the stop_machine_cpu_stop() loop, or we're executing this code,
5093 * either way we should never end up calling schedule() until we're
5098 /* Ensure any throttled groups are reachable by pick_next_task */
5099 unthrottle_offline_cfs_rqs(rq);
5103 * There's this thread running, bail when that's the only
5106 if (rq->nr_running == 1)
5109 next = pick_next_task(rq);
5111 next->sched_class->put_prev_task(rq, next);
5113 /* Find suitable destination for @next, with force if needed. */
5114 dest_cpu = select_fallback_rq(dead_cpu, next);
5115 raw_spin_unlock(&rq->lock);
5117 __migrate_task(next, dead_cpu, dest_cpu);
5119 raw_spin_lock(&rq->lock);
5125 #endif /* CONFIG_HOTPLUG_CPU */
5127 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
5129 static struct ctl_table sd_ctl_dir[] = {
5131 .procname = "sched_domain",
5137 static struct ctl_table sd_ctl_root[] = {
5139 .procname = "kernel",
5141 .child = sd_ctl_dir,
5146 static struct ctl_table *sd_alloc_ctl_entry(int n)
5148 struct ctl_table *entry =
5149 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
5154 static void sd_free_ctl_entry(struct ctl_table **tablep)
5156 struct ctl_table *entry;
5159 * In the intermediate directories, both the child directory and
5160 * procname are dynamically allocated and could fail but the mode
5161 * will always be set. In the lowest directory the names are
5162 * static strings and all have proc handlers.
5164 for (entry = *tablep; entry->mode; entry++) {
5166 sd_free_ctl_entry(&entry->child);
5167 if (entry->proc_handler == NULL)
5168 kfree(entry->procname);
5176 set_table_entry(struct ctl_table *entry,
5177 const char *procname, void *data, int maxlen,
5178 mode_t mode, proc_handler *proc_handler)
5180 entry->procname = procname;
5182 entry->maxlen = maxlen;
5184 entry->proc_handler = proc_handler;
5187 static struct ctl_table *
5188 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5190 struct ctl_table *table = sd_alloc_ctl_entry(13);
5195 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5196 sizeof(long), 0644, proc_doulongvec_minmax);
5197 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5198 sizeof(long), 0644, proc_doulongvec_minmax);
5199 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5200 sizeof(int), 0644, proc_dointvec_minmax);
5201 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5202 sizeof(int), 0644, proc_dointvec_minmax);
5203 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5204 sizeof(int), 0644, proc_dointvec_minmax);
5205 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5206 sizeof(int), 0644, proc_dointvec_minmax);
5207 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5208 sizeof(int), 0644, proc_dointvec_minmax);
5209 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5210 sizeof(int), 0644, proc_dointvec_minmax);
5211 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5212 sizeof(int), 0644, proc_dointvec_minmax);
5213 set_table_entry(&table[9], "cache_nice_tries",
5214 &sd->cache_nice_tries,
5215 sizeof(int), 0644, proc_dointvec_minmax);
5216 set_table_entry(&table[10], "flags", &sd->flags,
5217 sizeof(int), 0644, proc_dointvec_minmax);
5218 set_table_entry(&table[11], "name", sd->name,
5219 CORENAME_MAX_SIZE, 0444, proc_dostring);
5220 /* &table[12] is terminator */
5225 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5227 struct ctl_table *entry, *table;
5228 struct sched_domain *sd;
5229 int domain_num = 0, i;
5232 for_each_domain(cpu, sd)
5234 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5239 for_each_domain(cpu, sd) {
5240 snprintf(buf, 32, "domain%d", i);
5241 entry->procname = kstrdup(buf, GFP_KERNEL);
5243 entry->child = sd_alloc_ctl_domain_table(sd);
5250 static struct ctl_table_header *sd_sysctl_header;
5251 static void register_sched_domain_sysctl(void)
5253 int i, cpu_num = num_possible_cpus();
5254 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5257 WARN_ON(sd_ctl_dir[0].child);
5258 sd_ctl_dir[0].child = entry;
5263 for_each_possible_cpu(i) {
5264 snprintf(buf, 32, "cpu%d", i);
5265 entry->procname = kstrdup(buf, GFP_KERNEL);
5267 entry->child = sd_alloc_ctl_cpu_table(i);
5271 WARN_ON(sd_sysctl_header);
5272 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5275 /* may be called multiple times per register */
5276 static void unregister_sched_domain_sysctl(void)
5278 if (sd_sysctl_header)
5279 unregister_sysctl_table(sd_sysctl_header);
5280 sd_sysctl_header = NULL;
5281 if (sd_ctl_dir[0].child)
5282 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5285 static void register_sched_domain_sysctl(void)
5288 static void unregister_sched_domain_sysctl(void)
5293 static void set_rq_online(struct rq *rq)
5296 const struct sched_class *class;
5298 cpumask_set_cpu(rq->cpu, rq->rd->online);
5301 for_each_class(class) {
5302 if (class->rq_online)
5303 class->rq_online(rq);
5308 static void set_rq_offline(struct rq *rq)
5311 const struct sched_class *class;
5313 for_each_class(class) {
5314 if (class->rq_offline)
5315 class->rq_offline(rq);
5318 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5324 * migration_call - callback that gets triggered when a CPU is added.
5325 * Here we can start up the necessary migration thread for the new CPU.
5327 static int __cpuinit
5328 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5330 int cpu = (long)hcpu;
5331 unsigned long flags;
5332 struct rq *rq = cpu_rq(cpu);
5334 switch (action & ~CPU_TASKS_FROZEN) {
5336 case CPU_UP_PREPARE:
5337 rq->calc_load_update = calc_load_update;
5341 /* Update our root-domain */
5342 raw_spin_lock_irqsave(&rq->lock, flags);
5344 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5348 raw_spin_unlock_irqrestore(&rq->lock, flags);
5351 #ifdef CONFIG_HOTPLUG_CPU
5353 sched_ttwu_pending();
5354 /* Update our root-domain */
5355 raw_spin_lock_irqsave(&rq->lock, flags);
5357 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5361 BUG_ON(rq->nr_running != 1); /* the migration thread */
5362 raw_spin_unlock_irqrestore(&rq->lock, flags);
5364 migrate_nr_uninterruptible(rq);
5365 calc_global_load_remove(rq);
5370 update_max_interval();
5376 * Register at high priority so that task migration (migrate_all_tasks)
5377 * happens before everything else. This has to be lower priority than
5378 * the notifier in the perf_event subsystem, though.
5380 static struct notifier_block __cpuinitdata migration_notifier = {
5381 .notifier_call = migration_call,
5382 .priority = CPU_PRI_MIGRATION,
5385 static int __cpuinit sched_cpu_active(struct notifier_block *nfb,
5386 unsigned long action, void *hcpu)
5388 switch (action & ~CPU_TASKS_FROZEN) {
5390 case CPU_DOWN_FAILED:
5391 set_cpu_active((long)hcpu, true);
5398 static int __cpuinit sched_cpu_inactive(struct notifier_block *nfb,
5399 unsigned long action, void *hcpu)
5401 switch (action & ~CPU_TASKS_FROZEN) {
5402 case CPU_DOWN_PREPARE:
5403 set_cpu_active((long)hcpu, false);
5410 static int __init migration_init(void)
5412 void *cpu = (void *)(long)smp_processor_id();
5415 /* Initialize migration for the boot CPU */
5416 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
5417 BUG_ON(err == NOTIFY_BAD);
5418 migration_call(&migration_notifier, CPU_ONLINE, cpu);
5419 register_cpu_notifier(&migration_notifier);
5421 /* Register cpu active notifiers */
5422 cpu_notifier(sched_cpu_active, CPU_PRI_SCHED_ACTIVE);
5423 cpu_notifier(sched_cpu_inactive, CPU_PRI_SCHED_INACTIVE);
5427 early_initcall(migration_init);
5432 static cpumask_var_t sched_domains_tmpmask; /* sched_domains_mutex */
5434 #ifdef CONFIG_SCHED_DEBUG
5436 static __read_mostly int sched_domain_debug_enabled;
5438 static int __init sched_domain_debug_setup(char *str)
5440 sched_domain_debug_enabled = 1;
5444 early_param("sched_debug", sched_domain_debug_setup);
5446 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5447 struct cpumask *groupmask)
5449 struct sched_group *group = sd->groups;
5452 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
5453 cpumask_clear(groupmask);
5455 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5457 if (!(sd->flags & SD_LOAD_BALANCE)) {
5458 printk("does not load-balance\n");
5460 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5465 printk(KERN_CONT "span %s level %s\n", str, sd->name);
5467 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5468 printk(KERN_ERR "ERROR: domain->span does not contain "
5471 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5472 printk(KERN_ERR "ERROR: domain->groups does not contain"
5476 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5480 printk(KERN_ERR "ERROR: group is NULL\n");
5484 if (!group->sgp->power) {
5485 printk(KERN_CONT "\n");
5486 printk(KERN_ERR "ERROR: domain->cpu_power not "
5491 if (!cpumask_weight(sched_group_cpus(group))) {
5492 printk(KERN_CONT "\n");
5493 printk(KERN_ERR "ERROR: empty group\n");
5497 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
5498 printk(KERN_CONT "\n");
5499 printk(KERN_ERR "ERROR: repeated CPUs\n");
5503 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
5505 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
5507 printk(KERN_CONT " %s", str);
5508 if (group->sgp->power != SCHED_POWER_SCALE) {
5509 printk(KERN_CONT " (cpu_power = %d)",
5513 group = group->next;
5514 } while (group != sd->groups);
5515 printk(KERN_CONT "\n");
5517 if (!cpumask_equal(sched_domain_span(sd), groupmask))
5518 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
5521 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
5522 printk(KERN_ERR "ERROR: parent span is not a superset "
5523 "of domain->span\n");
5527 static void sched_domain_debug(struct sched_domain *sd, int cpu)
5531 if (!sched_domain_debug_enabled)
5535 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
5539 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
5542 if (sched_domain_debug_one(sd, cpu, level, sched_domains_tmpmask))
5550 #else /* !CONFIG_SCHED_DEBUG */
5551 # define sched_domain_debug(sd, cpu) do { } while (0)
5552 #endif /* CONFIG_SCHED_DEBUG */
5554 static int sd_degenerate(struct sched_domain *sd)
5556 if (cpumask_weight(sched_domain_span(sd)) == 1)
5559 /* Following flags need at least 2 groups */
5560 if (sd->flags & (SD_LOAD_BALANCE |
5561 SD_BALANCE_NEWIDLE |
5565 SD_SHARE_PKG_RESOURCES)) {
5566 if (sd->groups != sd->groups->next)
5570 /* Following flags don't use groups */
5571 if (sd->flags & (SD_WAKE_AFFINE))
5578 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
5580 unsigned long cflags = sd->flags, pflags = parent->flags;
5582 if (sd_degenerate(parent))
5585 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
5588 /* Flags needing groups don't count if only 1 group in parent */
5589 if (parent->groups == parent->groups->next) {
5590 pflags &= ~(SD_LOAD_BALANCE |
5591 SD_BALANCE_NEWIDLE |
5595 SD_SHARE_PKG_RESOURCES);
5596 if (nr_node_ids == 1)
5597 pflags &= ~SD_SERIALIZE;
5599 if (~cflags & pflags)
5605 static void free_rootdomain(struct rcu_head *rcu)
5607 struct root_domain *rd = container_of(rcu, struct root_domain, rcu);
5609 cpupri_cleanup(&rd->cpupri);
5610 free_cpumask_var(rd->rto_mask);
5611 free_cpumask_var(rd->online);
5612 free_cpumask_var(rd->span);
5616 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
5618 struct root_domain *old_rd = NULL;
5619 unsigned long flags;
5621 raw_spin_lock_irqsave(&rq->lock, flags);
5626 if (cpumask_test_cpu(rq->cpu, old_rd->online))
5629 cpumask_clear_cpu(rq->cpu, old_rd->span);
5632 * If we dont want to free the old_rt yet then
5633 * set old_rd to NULL to skip the freeing later
5636 if (!atomic_dec_and_test(&old_rd->refcount))
5640 atomic_inc(&rd->refcount);
5643 cpumask_set_cpu(rq->cpu, rd->span);
5644 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
5647 raw_spin_unlock_irqrestore(&rq->lock, flags);
5650 call_rcu_sched(&old_rd->rcu, free_rootdomain);
5653 static int init_rootdomain(struct root_domain *rd)
5655 memset(rd, 0, sizeof(*rd));
5657 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
5659 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
5661 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
5664 if (cpupri_init(&rd->cpupri) != 0)
5669 free_cpumask_var(rd->rto_mask);
5671 free_cpumask_var(rd->online);
5673 free_cpumask_var(rd->span);
5679 * By default the system creates a single root-domain with all cpus as
5680 * members (mimicking the global state we have today).
5682 struct root_domain def_root_domain;
5684 static void init_defrootdomain(void)
5686 init_rootdomain(&def_root_domain);
5688 atomic_set(&def_root_domain.refcount, 1);
5691 static struct root_domain *alloc_rootdomain(void)
5693 struct root_domain *rd;
5695 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
5699 if (init_rootdomain(rd) != 0) {
5707 static void free_sched_groups(struct sched_group *sg, int free_sgp)
5709 struct sched_group *tmp, *first;
5718 if (free_sgp && atomic_dec_and_test(&sg->sgp->ref))
5723 } while (sg != first);
5726 static void free_sched_domain(struct rcu_head *rcu)
5728 struct sched_domain *sd = container_of(rcu, struct sched_domain, rcu);
5731 * If its an overlapping domain it has private groups, iterate and
5734 if (sd->flags & SD_OVERLAP) {
5735 free_sched_groups(sd->groups, 1);
5736 } else if (atomic_dec_and_test(&sd->groups->ref)) {
5737 kfree(sd->groups->sgp);
5743 static void destroy_sched_domain(struct sched_domain *sd, int cpu)
5745 call_rcu(&sd->rcu, free_sched_domain);
5748 static void destroy_sched_domains(struct sched_domain *sd, int cpu)
5750 for (; sd; sd = sd->parent)
5751 destroy_sched_domain(sd, cpu);
5755 * Keep a special pointer to the highest sched_domain that has
5756 * SD_SHARE_PKG_RESOURCE set (Last Level Cache Domain) for this
5757 * allows us to avoid some pointer chasing select_idle_sibling().
5759 * Also keep a unique ID per domain (we use the first cpu number in
5760 * the cpumask of the domain), this allows us to quickly tell if
5761 * two cpus are in the same cache domain, see ttwu_share_cache().
5763 DEFINE_PER_CPU(struct sched_domain *, sd_llc);
5764 DEFINE_PER_CPU(int, sd_llc_id);
5766 static void update_top_cache_domain(int cpu)
5768 struct sched_domain *sd;
5771 sd = highest_flag_domain(cpu, SD_SHARE_PKG_RESOURCES);
5773 id = cpumask_first(sched_domain_span(sd));
5775 rcu_assign_pointer(per_cpu(sd_llc, cpu), sd);
5776 per_cpu(sd_llc_id, cpu) = id;
5780 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
5781 * hold the hotplug lock.
5784 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
5786 struct rq *rq = cpu_rq(cpu);
5787 struct sched_domain *tmp;
5789 /* Remove the sched domains which do not contribute to scheduling. */
5790 for (tmp = sd; tmp; ) {
5791 struct sched_domain *parent = tmp->parent;
5795 if (sd_parent_degenerate(tmp, parent)) {
5796 tmp->parent = parent->parent;
5798 parent->parent->child = tmp;
5799 destroy_sched_domain(parent, cpu);
5804 if (sd && sd_degenerate(sd)) {
5807 destroy_sched_domain(tmp, cpu);
5812 sched_domain_debug(sd, cpu);
5814 rq_attach_root(rq, rd);
5816 rcu_assign_pointer(rq->sd, sd);
5817 destroy_sched_domains(tmp, cpu);
5819 update_top_cache_domain(cpu);
5822 /* cpus with isolated domains */
5823 static cpumask_var_t cpu_isolated_map;
5825 /* Setup the mask of cpus configured for isolated domains */
5826 static int __init isolated_cpu_setup(char *str)
5828 alloc_bootmem_cpumask_var(&cpu_isolated_map);
5829 cpulist_parse(str, cpu_isolated_map);
5833 __setup("isolcpus=", isolated_cpu_setup);
5838 * find_next_best_node - find the next node to include in a sched_domain
5839 * @node: node whose sched_domain we're building
5840 * @used_nodes: nodes already in the sched_domain
5842 * Find the next node to include in a given scheduling domain. Simply
5843 * finds the closest node not already in the @used_nodes map.
5845 * Should use nodemask_t.
5847 static int find_next_best_node(int node, nodemask_t *used_nodes)
5849 int i, n, val, min_val, best_node = -1;
5853 for (i = 0; i < nr_node_ids; i++) {
5854 /* Start at @node */
5855 n = (node + i) % nr_node_ids;
5857 if (!nr_cpus_node(n))
5860 /* Skip already used nodes */
5861 if (node_isset(n, *used_nodes))
5864 /* Simple min distance search */
5865 val = node_distance(node, n);
5867 if (val < min_val) {
5873 if (best_node != -1)
5874 node_set(best_node, *used_nodes);
5879 * sched_domain_node_span - get a cpumask for a node's sched_domain
5880 * @node: node whose cpumask we're constructing
5881 * @span: resulting cpumask
5883 * Given a node, construct a good cpumask for its sched_domain to span. It
5884 * should be one that prevents unnecessary balancing, but also spreads tasks
5887 static void sched_domain_node_span(int node, struct cpumask *span)
5889 nodemask_t used_nodes;
5892 cpumask_clear(span);
5893 nodes_clear(used_nodes);
5895 cpumask_or(span, span, cpumask_of_node(node));
5896 node_set(node, used_nodes);
5898 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
5899 int next_node = find_next_best_node(node, &used_nodes);
5902 cpumask_or(span, span, cpumask_of_node(next_node));
5906 static const struct cpumask *cpu_node_mask(int cpu)
5908 lockdep_assert_held(&sched_domains_mutex);
5910 sched_domain_node_span(cpu_to_node(cpu), sched_domains_tmpmask);
5912 return sched_domains_tmpmask;
5915 static const struct cpumask *cpu_allnodes_mask(int cpu)
5917 return cpu_possible_mask;
5919 #endif /* CONFIG_NUMA */
5921 static const struct cpumask *cpu_cpu_mask(int cpu)
5923 return cpumask_of_node(cpu_to_node(cpu));
5926 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
5929 struct sched_domain **__percpu sd;
5930 struct sched_group **__percpu sg;
5931 struct sched_group_power **__percpu sgp;
5935 struct sched_domain ** __percpu sd;
5936 struct root_domain *rd;
5946 struct sched_domain_topology_level;
5948 typedef struct sched_domain *(*sched_domain_init_f)(struct sched_domain_topology_level *tl, int cpu);
5949 typedef const struct cpumask *(*sched_domain_mask_f)(int cpu);
5951 #define SDTL_OVERLAP 0x01
5953 struct sched_domain_topology_level {
5954 sched_domain_init_f init;
5955 sched_domain_mask_f mask;
5957 struct sd_data data;
5961 build_overlap_sched_groups(struct sched_domain *sd, int cpu)
5963 struct sched_group *first = NULL, *last = NULL, *groups = NULL, *sg;
5964 const struct cpumask *span = sched_domain_span(sd);
5965 struct cpumask *covered = sched_domains_tmpmask;
5966 struct sd_data *sdd = sd->private;
5967 struct sched_domain *child;
5970 cpumask_clear(covered);
5972 for_each_cpu(i, span) {
5973 struct cpumask *sg_span;
5975 if (cpumask_test_cpu(i, covered))
5978 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
5979 GFP_KERNEL, cpu_to_node(cpu));
5984 sg_span = sched_group_cpus(sg);
5986 child = *per_cpu_ptr(sdd->sd, i);
5988 child = child->child;
5989 cpumask_copy(sg_span, sched_domain_span(child));
5991 cpumask_set_cpu(i, sg_span);
5993 cpumask_or(covered, covered, sg_span);
5995 sg->sgp = *per_cpu_ptr(sdd->sgp, cpumask_first(sg_span));
5996 atomic_inc(&sg->sgp->ref);
5998 if (cpumask_test_cpu(cpu, sg_span))
6008 sd->groups = groups;
6013 free_sched_groups(first, 0);
6018 static int get_group(int cpu, struct sd_data *sdd, struct sched_group **sg)
6020 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, cpu);
6021 struct sched_domain *child = sd->child;
6024 cpu = cpumask_first(sched_domain_span(child));
6027 *sg = *per_cpu_ptr(sdd->sg, cpu);
6028 (*sg)->sgp = *per_cpu_ptr(sdd->sgp, cpu);
6029 atomic_set(&(*sg)->sgp->ref, 1); /* for claim_allocations */
6036 * build_sched_groups will build a circular linked list of the groups
6037 * covered by the given span, and will set each group's ->cpumask correctly,
6038 * and ->cpu_power to 0.
6040 * Assumes the sched_domain tree is fully constructed
6043 build_sched_groups(struct sched_domain *sd, int cpu)
6045 struct sched_group *first = NULL, *last = NULL;
6046 struct sd_data *sdd = sd->private;
6047 const struct cpumask *span = sched_domain_span(sd);
6048 struct cpumask *covered;
6051 get_group(cpu, sdd, &sd->groups);
6052 atomic_inc(&sd->groups->ref);
6054 if (cpu != cpumask_first(sched_domain_span(sd)))
6057 lockdep_assert_held(&sched_domains_mutex);
6058 covered = sched_domains_tmpmask;
6060 cpumask_clear(covered);
6062 for_each_cpu(i, span) {
6063 struct sched_group *sg;
6064 int group = get_group(i, sdd, &sg);
6067 if (cpumask_test_cpu(i, covered))
6070 cpumask_clear(sched_group_cpus(sg));
6073 for_each_cpu(j, span) {
6074 if (get_group(j, sdd, NULL) != group)
6077 cpumask_set_cpu(j, covered);
6078 cpumask_set_cpu(j, sched_group_cpus(sg));
6093 * Initialize sched groups cpu_power.
6095 * cpu_power indicates the capacity of sched group, which is used while
6096 * distributing the load between different sched groups in a sched domain.
6097 * Typically cpu_power for all the groups in a sched domain will be same unless
6098 * there are asymmetries in the topology. If there are asymmetries, group
6099 * having more cpu_power will pickup more load compared to the group having
6102 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
6104 struct sched_group *sg = sd->groups;
6106 WARN_ON(!sd || !sg);
6109 sg->group_weight = cpumask_weight(sched_group_cpus(sg));
6111 } while (sg != sd->groups);
6113 if (cpu != group_first_cpu(sg))
6116 update_group_power(sd, cpu);
6117 atomic_set(&sg->sgp->nr_busy_cpus, sg->group_weight);
6120 int __weak arch_sd_sibling_asym_packing(void)
6122 return 0*SD_ASYM_PACKING;
6126 * Initializers for schedule domains
6127 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6130 #ifdef CONFIG_SCHED_DEBUG
6131 # define SD_INIT_NAME(sd, type) sd->name = #type
6133 # define SD_INIT_NAME(sd, type) do { } while (0)
6136 #define SD_INIT_FUNC(type) \
6137 static noinline struct sched_domain * \
6138 sd_init_##type(struct sched_domain_topology_level *tl, int cpu) \
6140 struct sched_domain *sd = *per_cpu_ptr(tl->data.sd, cpu); \
6141 *sd = SD_##type##_INIT; \
6142 SD_INIT_NAME(sd, type); \
6143 sd->private = &tl->data; \
6149 SD_INIT_FUNC(ALLNODES)
6152 #ifdef CONFIG_SCHED_SMT
6153 SD_INIT_FUNC(SIBLING)
6155 #ifdef CONFIG_SCHED_MC
6158 #ifdef CONFIG_SCHED_BOOK
6162 static int default_relax_domain_level = -1;
6163 int sched_domain_level_max;
6165 static int __init setup_relax_domain_level(char *str)
6169 val = simple_strtoul(str, NULL, 0);
6170 if (val < sched_domain_level_max)
6171 default_relax_domain_level = val;
6175 __setup("relax_domain_level=", setup_relax_domain_level);
6177 static void set_domain_attribute(struct sched_domain *sd,
6178 struct sched_domain_attr *attr)
6182 if (!attr || attr->relax_domain_level < 0) {
6183 if (default_relax_domain_level < 0)
6186 request = default_relax_domain_level;
6188 request = attr->relax_domain_level;
6189 if (request < sd->level) {
6190 /* turn off idle balance on this domain */
6191 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6193 /* turn on idle balance on this domain */
6194 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6198 static void __sdt_free(const struct cpumask *cpu_map);
6199 static int __sdt_alloc(const struct cpumask *cpu_map);
6201 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6202 const struct cpumask *cpu_map)
6206 if (!atomic_read(&d->rd->refcount))
6207 free_rootdomain(&d->rd->rcu); /* fall through */
6209 free_percpu(d->sd); /* fall through */
6211 __sdt_free(cpu_map); /* fall through */
6217 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6218 const struct cpumask *cpu_map)
6220 memset(d, 0, sizeof(*d));
6222 if (__sdt_alloc(cpu_map))
6223 return sa_sd_storage;
6224 d->sd = alloc_percpu(struct sched_domain *);
6226 return sa_sd_storage;
6227 d->rd = alloc_rootdomain();
6230 return sa_rootdomain;
6234 * NULL the sd_data elements we've used to build the sched_domain and
6235 * sched_group structure so that the subsequent __free_domain_allocs()
6236 * will not free the data we're using.
6238 static void claim_allocations(int cpu, struct sched_domain *sd)
6240 struct sd_data *sdd = sd->private;
6242 WARN_ON_ONCE(*per_cpu_ptr(sdd->sd, cpu) != sd);
6243 *per_cpu_ptr(sdd->sd, cpu) = NULL;
6245 if (atomic_read(&(*per_cpu_ptr(sdd->sg, cpu))->ref))
6246 *per_cpu_ptr(sdd->sg, cpu) = NULL;
6248 if (atomic_read(&(*per_cpu_ptr(sdd->sgp, cpu))->ref))
6249 *per_cpu_ptr(sdd->sgp, cpu) = NULL;
6252 #ifdef CONFIG_SCHED_SMT
6253 static const struct cpumask *cpu_smt_mask(int cpu)
6255 return topology_thread_cpumask(cpu);
6260 * Topology list, bottom-up.
6262 static struct sched_domain_topology_level default_topology[] = {
6263 #ifdef CONFIG_SCHED_SMT
6264 { sd_init_SIBLING, cpu_smt_mask, },
6266 #ifdef CONFIG_SCHED_MC
6267 { sd_init_MC, cpu_coregroup_mask, },
6269 #ifdef CONFIG_SCHED_BOOK
6270 { sd_init_BOOK, cpu_book_mask, },
6272 { sd_init_CPU, cpu_cpu_mask, },
6274 { sd_init_NODE, cpu_node_mask, SDTL_OVERLAP, },
6275 { sd_init_ALLNODES, cpu_allnodes_mask, },
6280 static struct sched_domain_topology_level *sched_domain_topology = default_topology;
6282 static int __sdt_alloc(const struct cpumask *cpu_map)
6284 struct sched_domain_topology_level *tl;
6287 for (tl = sched_domain_topology; tl->init; tl++) {
6288 struct sd_data *sdd = &tl->data;
6290 sdd->sd = alloc_percpu(struct sched_domain *);
6294 sdd->sg = alloc_percpu(struct sched_group *);
6298 sdd->sgp = alloc_percpu(struct sched_group_power *);
6302 for_each_cpu(j, cpu_map) {
6303 struct sched_domain *sd;
6304 struct sched_group *sg;
6305 struct sched_group_power *sgp;
6307 sd = kzalloc_node(sizeof(struct sched_domain) + cpumask_size(),
6308 GFP_KERNEL, cpu_to_node(j));
6312 *per_cpu_ptr(sdd->sd, j) = sd;
6314 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6315 GFP_KERNEL, cpu_to_node(j));
6319 *per_cpu_ptr(sdd->sg, j) = sg;
6321 sgp = kzalloc_node(sizeof(struct sched_group_power),
6322 GFP_KERNEL, cpu_to_node(j));
6326 *per_cpu_ptr(sdd->sgp, j) = sgp;
6333 static void __sdt_free(const struct cpumask *cpu_map)
6335 struct sched_domain_topology_level *tl;
6338 for (tl = sched_domain_topology; tl->init; tl++) {
6339 struct sd_data *sdd = &tl->data;
6341 for_each_cpu(j, cpu_map) {
6342 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, j);
6343 if (sd && (sd->flags & SD_OVERLAP))
6344 free_sched_groups(sd->groups, 0);
6345 kfree(*per_cpu_ptr(sdd->sd, j));
6346 kfree(*per_cpu_ptr(sdd->sg, j));
6347 kfree(*per_cpu_ptr(sdd->sgp, j));
6349 free_percpu(sdd->sd);
6350 free_percpu(sdd->sg);
6351 free_percpu(sdd->sgp);
6355 struct sched_domain *build_sched_domain(struct sched_domain_topology_level *tl,
6356 struct s_data *d, const struct cpumask *cpu_map,
6357 struct sched_domain_attr *attr, struct sched_domain *child,
6360 struct sched_domain *sd = tl->init(tl, cpu);
6364 set_domain_attribute(sd, attr);
6365 cpumask_and(sched_domain_span(sd), cpu_map, tl->mask(cpu));
6367 sd->level = child->level + 1;
6368 sched_domain_level_max = max(sched_domain_level_max, sd->level);
6377 * Build sched domains for a given set of cpus and attach the sched domains
6378 * to the individual cpus
6380 static int build_sched_domains(const struct cpumask *cpu_map,
6381 struct sched_domain_attr *attr)
6383 enum s_alloc alloc_state = sa_none;
6384 struct sched_domain *sd;
6386 int i, ret = -ENOMEM;
6388 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
6389 if (alloc_state != sa_rootdomain)
6392 /* Set up domains for cpus specified by the cpu_map. */
6393 for_each_cpu(i, cpu_map) {
6394 struct sched_domain_topology_level *tl;
6397 for (tl = sched_domain_topology; tl->init; tl++) {
6398 sd = build_sched_domain(tl, &d, cpu_map, attr, sd, i);
6399 if (tl->flags & SDTL_OVERLAP || sched_feat(FORCE_SD_OVERLAP))
6400 sd->flags |= SD_OVERLAP;
6401 if (cpumask_equal(cpu_map, sched_domain_span(sd)))
6408 *per_cpu_ptr(d.sd, i) = sd;
6411 /* Build the groups for the domains */
6412 for_each_cpu(i, cpu_map) {
6413 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6414 sd->span_weight = cpumask_weight(sched_domain_span(sd));
6415 if (sd->flags & SD_OVERLAP) {
6416 if (build_overlap_sched_groups(sd, i))
6419 if (build_sched_groups(sd, i))
6425 /* Calculate CPU power for physical packages and nodes */
6426 for (i = nr_cpumask_bits-1; i >= 0; i--) {
6427 if (!cpumask_test_cpu(i, cpu_map))
6430 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6431 claim_allocations(i, sd);
6432 init_sched_groups_power(i, sd);
6436 /* Attach the domains */
6438 for_each_cpu(i, cpu_map) {
6439 sd = *per_cpu_ptr(d.sd, i);
6440 cpu_attach_domain(sd, d.rd, i);
6446 __free_domain_allocs(&d, alloc_state, cpu_map);
6450 static cpumask_var_t *doms_cur; /* current sched domains */
6451 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
6452 static struct sched_domain_attr *dattr_cur;
6453 /* attribues of custom domains in 'doms_cur' */
6456 * Special case: If a kmalloc of a doms_cur partition (array of
6457 * cpumask) fails, then fallback to a single sched domain,
6458 * as determined by the single cpumask fallback_doms.
6460 static cpumask_var_t fallback_doms;
6463 * arch_update_cpu_topology lets virtualized architectures update the
6464 * cpu core maps. It is supposed to return 1 if the topology changed
6465 * or 0 if it stayed the same.
6467 int __attribute__((weak)) arch_update_cpu_topology(void)
6472 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
6475 cpumask_var_t *doms;
6477 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
6480 for (i = 0; i < ndoms; i++) {
6481 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
6482 free_sched_domains(doms, i);
6489 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
6492 for (i = 0; i < ndoms; i++)
6493 free_cpumask_var(doms[i]);
6498 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
6499 * For now this just excludes isolated cpus, but could be used to
6500 * exclude other special cases in the future.
6502 static int init_sched_domains(const struct cpumask *cpu_map)
6506 arch_update_cpu_topology();
6508 doms_cur = alloc_sched_domains(ndoms_cur);
6510 doms_cur = &fallback_doms;
6511 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
6513 err = build_sched_domains(doms_cur[0], NULL);
6514 register_sched_domain_sysctl();
6520 * Detach sched domains from a group of cpus specified in cpu_map
6521 * These cpus will now be attached to the NULL domain
6523 static void detach_destroy_domains(const struct cpumask *cpu_map)
6528 for_each_cpu(i, cpu_map)
6529 cpu_attach_domain(NULL, &def_root_domain, i);
6533 /* handle null as "default" */
6534 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
6535 struct sched_domain_attr *new, int idx_new)
6537 struct sched_domain_attr tmp;
6544 return !memcmp(cur ? (cur + idx_cur) : &tmp,
6545 new ? (new + idx_new) : &tmp,
6546 sizeof(struct sched_domain_attr));
6550 * Partition sched domains as specified by the 'ndoms_new'
6551 * cpumasks in the array doms_new[] of cpumasks. This compares
6552 * doms_new[] to the current sched domain partitioning, doms_cur[].
6553 * It destroys each deleted domain and builds each new domain.
6555 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
6556 * The masks don't intersect (don't overlap.) We should setup one
6557 * sched domain for each mask. CPUs not in any of the cpumasks will
6558 * not be load balanced. If the same cpumask appears both in the
6559 * current 'doms_cur' domains and in the new 'doms_new', we can leave
6562 * The passed in 'doms_new' should be allocated using
6563 * alloc_sched_domains. This routine takes ownership of it and will
6564 * free_sched_domains it when done with it. If the caller failed the
6565 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
6566 * and partition_sched_domains() will fallback to the single partition
6567 * 'fallback_doms', it also forces the domains to be rebuilt.
6569 * If doms_new == NULL it will be replaced with cpu_online_mask.
6570 * ndoms_new == 0 is a special case for destroying existing domains,
6571 * and it will not create the default domain.
6573 * Call with hotplug lock held
6575 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
6576 struct sched_domain_attr *dattr_new)
6581 mutex_lock(&sched_domains_mutex);
6583 /* always unregister in case we don't destroy any domains */
6584 unregister_sched_domain_sysctl();
6586 /* Let architecture update cpu core mappings. */
6587 new_topology = arch_update_cpu_topology();
6589 n = doms_new ? ndoms_new : 0;
6591 /* Destroy deleted domains */
6592 for (i = 0; i < ndoms_cur; i++) {
6593 for (j = 0; j < n && !new_topology; j++) {
6594 if (cpumask_equal(doms_cur[i], doms_new[j])
6595 && dattrs_equal(dattr_cur, i, dattr_new, j))
6598 /* no match - a current sched domain not in new doms_new[] */
6599 detach_destroy_domains(doms_cur[i]);
6604 if (doms_new == NULL) {
6606 doms_new = &fallback_doms;
6607 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
6608 WARN_ON_ONCE(dattr_new);
6611 /* Build new domains */
6612 for (i = 0; i < ndoms_new; i++) {
6613 for (j = 0; j < ndoms_cur && !new_topology; j++) {
6614 if (cpumask_equal(doms_new[i], doms_cur[j])
6615 && dattrs_equal(dattr_new, i, dattr_cur, j))
6618 /* no match - add a new doms_new */
6619 build_sched_domains(doms_new[i], dattr_new ? dattr_new + i : NULL);
6624 /* Remember the new sched domains */
6625 if (doms_cur != &fallback_doms)
6626 free_sched_domains(doms_cur, ndoms_cur);
6627 kfree(dattr_cur); /* kfree(NULL) is safe */
6628 doms_cur = doms_new;
6629 dattr_cur = dattr_new;
6630 ndoms_cur = ndoms_new;
6632 register_sched_domain_sysctl();
6634 mutex_unlock(&sched_domains_mutex);
6637 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
6638 static void reinit_sched_domains(void)
6642 /* Destroy domains first to force the rebuild */
6643 partition_sched_domains(0, NULL, NULL);
6645 rebuild_sched_domains();
6649 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
6651 unsigned int level = 0;
6653 if (sscanf(buf, "%u", &level) != 1)
6657 * level is always be positive so don't check for
6658 * level < POWERSAVINGS_BALANCE_NONE which is 0
6659 * What happens on 0 or 1 byte write,
6660 * need to check for count as well?
6663 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
6667 sched_smt_power_savings = level;
6669 sched_mc_power_savings = level;
6671 reinit_sched_domains();
6676 #ifdef CONFIG_SCHED_MC
6677 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
6678 struct sysdev_class_attribute *attr,
6681 return sprintf(page, "%u\n", sched_mc_power_savings);
6683 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
6684 struct sysdev_class_attribute *attr,
6685 const char *buf, size_t count)
6687 return sched_power_savings_store(buf, count, 0);
6689 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
6690 sched_mc_power_savings_show,
6691 sched_mc_power_savings_store);
6694 #ifdef CONFIG_SCHED_SMT
6695 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
6696 struct sysdev_class_attribute *attr,
6699 return sprintf(page, "%u\n", sched_smt_power_savings);
6701 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
6702 struct sysdev_class_attribute *attr,
6703 const char *buf, size_t count)
6705 return sched_power_savings_store(buf, count, 1);
6707 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
6708 sched_smt_power_savings_show,
6709 sched_smt_power_savings_store);
6712 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
6716 #ifdef CONFIG_SCHED_SMT
6718 err = sysfs_create_file(&cls->kset.kobj,
6719 &attr_sched_smt_power_savings.attr);
6721 #ifdef CONFIG_SCHED_MC
6722 if (!err && mc_capable())
6723 err = sysfs_create_file(&cls->kset.kobj,
6724 &attr_sched_mc_power_savings.attr);
6728 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
6731 * Update cpusets according to cpu_active mask. If cpusets are
6732 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
6733 * around partition_sched_domains().
6735 static int cpuset_cpu_active(struct notifier_block *nfb, unsigned long action,
6738 switch (action & ~CPU_TASKS_FROZEN) {
6740 case CPU_DOWN_FAILED:
6741 cpuset_update_active_cpus();
6748 static int cpuset_cpu_inactive(struct notifier_block *nfb, unsigned long action,
6751 switch (action & ~CPU_TASKS_FROZEN) {
6752 case CPU_DOWN_PREPARE:
6753 cpuset_update_active_cpus();
6760 void __init sched_init_smp(void)
6762 cpumask_var_t non_isolated_cpus;
6764 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
6765 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
6768 mutex_lock(&sched_domains_mutex);
6769 init_sched_domains(cpu_active_mask);
6770 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
6771 if (cpumask_empty(non_isolated_cpus))
6772 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
6773 mutex_unlock(&sched_domains_mutex);
6776 hotcpu_notifier(cpuset_cpu_active, CPU_PRI_CPUSET_ACTIVE);
6777 hotcpu_notifier(cpuset_cpu_inactive, CPU_PRI_CPUSET_INACTIVE);
6779 /* RT runtime code needs to handle some hotplug events */
6780 hotcpu_notifier(update_runtime, 0);
6784 /* Move init over to a non-isolated CPU */
6785 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
6787 sched_init_granularity();
6788 free_cpumask_var(non_isolated_cpus);
6790 init_sched_rt_class();
6793 void __init sched_init_smp(void)
6795 sched_init_granularity();
6797 #endif /* CONFIG_SMP */
6799 const_debug unsigned int sysctl_timer_migration = 1;
6801 int in_sched_functions(unsigned long addr)
6803 return in_lock_functions(addr) ||
6804 (addr >= (unsigned long)__sched_text_start
6805 && addr < (unsigned long)__sched_text_end);
6808 #ifdef CONFIG_CGROUP_SCHED
6809 struct task_group root_task_group;
6812 DECLARE_PER_CPU(cpumask_var_t, load_balance_tmpmask);
6814 void __init sched_init(void)
6817 unsigned long alloc_size = 0, ptr;
6819 #ifdef CONFIG_FAIR_GROUP_SCHED
6820 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6822 #ifdef CONFIG_RT_GROUP_SCHED
6823 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6825 #ifdef CONFIG_CPUMASK_OFFSTACK
6826 alloc_size += num_possible_cpus() * cpumask_size();
6829 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
6831 #ifdef CONFIG_FAIR_GROUP_SCHED
6832 root_task_group.se = (struct sched_entity **)ptr;
6833 ptr += nr_cpu_ids * sizeof(void **);
6835 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
6836 ptr += nr_cpu_ids * sizeof(void **);
6838 #endif /* CONFIG_FAIR_GROUP_SCHED */
6839 #ifdef CONFIG_RT_GROUP_SCHED
6840 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
6841 ptr += nr_cpu_ids * sizeof(void **);
6843 root_task_group.rt_rq = (struct rt_rq **)ptr;
6844 ptr += nr_cpu_ids * sizeof(void **);
6846 #endif /* CONFIG_RT_GROUP_SCHED */
6847 #ifdef CONFIG_CPUMASK_OFFSTACK
6848 for_each_possible_cpu(i) {
6849 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
6850 ptr += cpumask_size();
6852 #endif /* CONFIG_CPUMASK_OFFSTACK */
6856 init_defrootdomain();
6859 init_rt_bandwidth(&def_rt_bandwidth,
6860 global_rt_period(), global_rt_runtime());
6862 #ifdef CONFIG_RT_GROUP_SCHED
6863 init_rt_bandwidth(&root_task_group.rt_bandwidth,
6864 global_rt_period(), global_rt_runtime());
6865 #endif /* CONFIG_RT_GROUP_SCHED */
6867 #ifdef CONFIG_CGROUP_SCHED
6868 list_add(&root_task_group.list, &task_groups);
6869 INIT_LIST_HEAD(&root_task_group.children);
6870 INIT_LIST_HEAD(&root_task_group.siblings);
6871 autogroup_init(&init_task);
6873 #endif /* CONFIG_CGROUP_SCHED */
6875 #ifdef CONFIG_CGROUP_CPUACCT
6876 root_cpuacct.cpustat = &kernel_cpustat;
6877 root_cpuacct.cpuusage = alloc_percpu(u64);
6878 /* Too early, not expected to fail */
6879 BUG_ON(!root_cpuacct.cpuusage);
6881 for_each_possible_cpu(i) {
6885 raw_spin_lock_init(&rq->lock);
6887 rq->calc_load_active = 0;
6888 rq->calc_load_update = jiffies + LOAD_FREQ;
6889 init_cfs_rq(&rq->cfs);
6890 init_rt_rq(&rq->rt, rq);
6891 #ifdef CONFIG_FAIR_GROUP_SCHED
6892 root_task_group.shares = ROOT_TASK_GROUP_LOAD;
6893 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
6895 * How much cpu bandwidth does root_task_group get?
6897 * In case of task-groups formed thr' the cgroup filesystem, it
6898 * gets 100% of the cpu resources in the system. This overall
6899 * system cpu resource is divided among the tasks of
6900 * root_task_group and its child task-groups in a fair manner,
6901 * based on each entity's (task or task-group's) weight
6902 * (se->load.weight).
6904 * In other words, if root_task_group has 10 tasks of weight
6905 * 1024) and two child groups A0 and A1 (of weight 1024 each),
6906 * then A0's share of the cpu resource is:
6908 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
6910 * We achieve this by letting root_task_group's tasks sit
6911 * directly in rq->cfs (i.e root_task_group->se[] = NULL).
6913 init_cfs_bandwidth(&root_task_group.cfs_bandwidth);
6914 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL);
6915 #endif /* CONFIG_FAIR_GROUP_SCHED */
6917 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
6918 #ifdef CONFIG_RT_GROUP_SCHED
6919 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
6920 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL);
6923 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
6924 rq->cpu_load[j] = 0;
6926 rq->last_load_update_tick = jiffies;
6931 rq->cpu_power = SCHED_POWER_SCALE;
6932 rq->post_schedule = 0;
6933 rq->active_balance = 0;
6934 rq->next_balance = jiffies;
6939 rq->avg_idle = 2*sysctl_sched_migration_cost;
6940 rq_attach_root(rq, &def_root_domain);
6946 atomic_set(&rq->nr_iowait, 0);
6949 set_load_weight(&init_task);
6951 #ifdef CONFIG_PREEMPT_NOTIFIERS
6952 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
6955 #ifdef CONFIG_RT_MUTEXES
6956 plist_head_init(&init_task.pi_waiters);
6960 * The boot idle thread does lazy MMU switching as well:
6962 atomic_inc(&init_mm.mm_count);
6963 enter_lazy_tlb(&init_mm, current);
6966 * Make us the idle thread. Technically, schedule() should not be
6967 * called from this thread, however somewhere below it might be,
6968 * but because we are the idle thread, we just pick up running again
6969 * when this runqueue becomes "idle".
6971 init_idle(current, smp_processor_id());
6973 calc_load_update = jiffies + LOAD_FREQ;
6976 * During early bootup we pretend to be a normal task:
6978 current->sched_class = &fair_sched_class;
6981 zalloc_cpumask_var(&sched_domains_tmpmask, GFP_NOWAIT);
6982 /* May be allocated at isolcpus cmdline parse time */
6983 if (cpu_isolated_map == NULL)
6984 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
6986 init_sched_fair_class();
6988 scheduler_running = 1;
6991 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
6992 static inline int preempt_count_equals(int preempt_offset)
6994 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
6996 return (nested == preempt_offset);
6999 void __might_sleep(const char *file, int line, int preempt_offset)
7001 static unsigned long prev_jiffy; /* ratelimiting */
7003 rcu_sleep_check(); /* WARN_ON_ONCE() by default, no rate limit reqd. */
7004 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
7005 system_state != SYSTEM_RUNNING || oops_in_progress)
7007 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7009 prev_jiffy = jiffies;
7012 "BUG: sleeping function called from invalid context at %s:%d\n",
7015 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7016 in_atomic(), irqs_disabled(),
7017 current->pid, current->comm);
7019 debug_show_held_locks(current);
7020 if (irqs_disabled())
7021 print_irqtrace_events(current);
7024 EXPORT_SYMBOL(__might_sleep);
7027 #ifdef CONFIG_MAGIC_SYSRQ
7028 static void normalize_task(struct rq *rq, struct task_struct *p)
7030 const struct sched_class *prev_class = p->sched_class;
7031 int old_prio = p->prio;
7036 deactivate_task(rq, p, 0);
7037 __setscheduler(rq, p, SCHED_NORMAL, 0);
7039 activate_task(rq, p, 0);
7040 resched_task(rq->curr);
7043 check_class_changed(rq, p, prev_class, old_prio);
7046 void normalize_rt_tasks(void)
7048 struct task_struct *g, *p;
7049 unsigned long flags;
7052 read_lock_irqsave(&tasklist_lock, flags);
7053 do_each_thread(g, p) {
7055 * Only normalize user tasks:
7060 p->se.exec_start = 0;
7061 #ifdef CONFIG_SCHEDSTATS
7062 p->se.statistics.wait_start = 0;
7063 p->se.statistics.sleep_start = 0;
7064 p->se.statistics.block_start = 0;
7069 * Renice negative nice level userspace
7072 if (TASK_NICE(p) < 0 && p->mm)
7073 set_user_nice(p, 0);
7077 raw_spin_lock(&p->pi_lock);
7078 rq = __task_rq_lock(p);
7080 normalize_task(rq, p);
7082 __task_rq_unlock(rq);
7083 raw_spin_unlock(&p->pi_lock);
7084 } while_each_thread(g, p);
7086 read_unlock_irqrestore(&tasklist_lock, flags);
7089 #endif /* CONFIG_MAGIC_SYSRQ */
7091 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
7093 * These functions are only useful for the IA64 MCA handling, or kdb.
7095 * They can only be called when the whole system has been
7096 * stopped - every CPU needs to be quiescent, and no scheduling
7097 * activity can take place. Using them for anything else would
7098 * be a serious bug, and as a result, they aren't even visible
7099 * under any other configuration.
7103 * curr_task - return the current task for a given cpu.
7104 * @cpu: the processor in question.
7106 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7108 struct task_struct *curr_task(int cpu)
7110 return cpu_curr(cpu);
7113 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
7117 * set_curr_task - set the current task for a given cpu.
7118 * @cpu: the processor in question.
7119 * @p: the task pointer to set.
7121 * Description: This function must only be used when non-maskable interrupts
7122 * are serviced on a separate stack. It allows the architecture to switch the
7123 * notion of the current task on a cpu in a non-blocking manner. This function
7124 * must be called with all CPU's synchronized, and interrupts disabled, the
7125 * and caller must save the original value of the current task (see
7126 * curr_task() above) and restore that value before reenabling interrupts and
7127 * re-starting the system.
7129 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7131 void set_curr_task(int cpu, struct task_struct *p)
7138 #ifdef CONFIG_RT_GROUP_SCHED
7139 #else /* !CONFIG_RT_GROUP_SCHED */
7140 #endif /* CONFIG_RT_GROUP_SCHED */
7142 #ifdef CONFIG_CGROUP_SCHED
7143 /* task_group_lock serializes the addition/removal of task groups */
7144 static DEFINE_SPINLOCK(task_group_lock);
7146 static void free_sched_group(struct task_group *tg)
7148 free_fair_sched_group(tg);
7149 free_rt_sched_group(tg);
7154 /* allocate runqueue etc for a new task group */
7155 struct task_group *sched_create_group(struct task_group *parent)
7157 struct task_group *tg;
7158 unsigned long flags;
7160 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
7162 return ERR_PTR(-ENOMEM);
7164 if (!alloc_fair_sched_group(tg, parent))
7167 if (!alloc_rt_sched_group(tg, parent))
7170 spin_lock_irqsave(&task_group_lock, flags);
7171 list_add_rcu(&tg->list, &task_groups);
7173 WARN_ON(!parent); /* root should already exist */
7175 tg->parent = parent;
7176 INIT_LIST_HEAD(&tg->children);
7177 list_add_rcu(&tg->siblings, &parent->children);
7178 spin_unlock_irqrestore(&task_group_lock, flags);
7183 free_sched_group(tg);
7184 return ERR_PTR(-ENOMEM);
7187 /* rcu callback to free various structures associated with a task group */
7188 static void free_sched_group_rcu(struct rcu_head *rhp)
7190 /* now it should be safe to free those cfs_rqs */
7191 free_sched_group(container_of(rhp, struct task_group, rcu));
7194 /* Destroy runqueue etc associated with a task group */
7195 void sched_destroy_group(struct task_group *tg)
7197 unsigned long flags;
7200 /* end participation in shares distribution */
7201 for_each_possible_cpu(i)
7202 unregister_fair_sched_group(tg, i);
7204 spin_lock_irqsave(&task_group_lock, flags);
7205 list_del_rcu(&tg->list);
7206 list_del_rcu(&tg->siblings);
7207 spin_unlock_irqrestore(&task_group_lock, flags);
7209 /* wait for possible concurrent references to cfs_rqs complete */
7210 call_rcu(&tg->rcu, free_sched_group_rcu);
7213 /* change task's runqueue when it moves between groups.
7214 * The caller of this function should have put the task in its new group
7215 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
7216 * reflect its new group.
7218 void sched_move_task(struct task_struct *tsk)
7221 unsigned long flags;
7224 rq = task_rq_lock(tsk, &flags);
7226 running = task_current(rq, tsk);
7230 dequeue_task(rq, tsk, 0);
7231 if (unlikely(running))
7232 tsk->sched_class->put_prev_task(rq, tsk);
7234 #ifdef CONFIG_FAIR_GROUP_SCHED
7235 if (tsk->sched_class->task_move_group)
7236 tsk->sched_class->task_move_group(tsk, on_rq);
7239 set_task_rq(tsk, task_cpu(tsk));
7241 if (unlikely(running))
7242 tsk->sched_class->set_curr_task(rq);
7244 enqueue_task(rq, tsk, 0);
7246 task_rq_unlock(rq, tsk, &flags);
7248 #endif /* CONFIG_CGROUP_SCHED */
7250 #ifdef CONFIG_FAIR_GROUP_SCHED
7253 #if defined(CONFIG_RT_GROUP_SCHED) || defined(CONFIG_CFS_BANDWIDTH)
7254 static unsigned long to_ratio(u64 period, u64 runtime)
7256 if (runtime == RUNTIME_INF)
7259 return div64_u64(runtime << 20, period);
7263 #ifdef CONFIG_RT_GROUP_SCHED
7265 * Ensure that the real time constraints are schedulable.
7267 static DEFINE_MUTEX(rt_constraints_mutex);
7269 /* Must be called with tasklist_lock held */
7270 static inline int tg_has_rt_tasks(struct task_group *tg)
7272 struct task_struct *g, *p;
7274 do_each_thread(g, p) {
7275 if (rt_task(p) && task_rq(p)->rt.tg == tg)
7277 } while_each_thread(g, p);
7282 struct rt_schedulable_data {
7283 struct task_group *tg;
7288 static int tg_rt_schedulable(struct task_group *tg, void *data)
7290 struct rt_schedulable_data *d = data;
7291 struct task_group *child;
7292 unsigned long total, sum = 0;
7293 u64 period, runtime;
7295 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7296 runtime = tg->rt_bandwidth.rt_runtime;
7299 period = d->rt_period;
7300 runtime = d->rt_runtime;
7304 * Cannot have more runtime than the period.
7306 if (runtime > period && runtime != RUNTIME_INF)
7310 * Ensure we don't starve existing RT tasks.
7312 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
7315 total = to_ratio(period, runtime);
7318 * Nobody can have more than the global setting allows.
7320 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
7324 * The sum of our children's runtime should not exceed our own.
7326 list_for_each_entry_rcu(child, &tg->children, siblings) {
7327 period = ktime_to_ns(child->rt_bandwidth.rt_period);
7328 runtime = child->rt_bandwidth.rt_runtime;
7330 if (child == d->tg) {
7331 period = d->rt_period;
7332 runtime = d->rt_runtime;
7335 sum += to_ratio(period, runtime);
7344 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
7348 struct rt_schedulable_data data = {
7350 .rt_period = period,
7351 .rt_runtime = runtime,
7355 ret = walk_tg_tree(tg_rt_schedulable, tg_nop, &data);
7361 static int tg_set_rt_bandwidth(struct task_group *tg,
7362 u64 rt_period, u64 rt_runtime)
7366 mutex_lock(&rt_constraints_mutex);
7367 read_lock(&tasklist_lock);
7368 err = __rt_schedulable(tg, rt_period, rt_runtime);
7372 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7373 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
7374 tg->rt_bandwidth.rt_runtime = rt_runtime;
7376 for_each_possible_cpu(i) {
7377 struct rt_rq *rt_rq = tg->rt_rq[i];
7379 raw_spin_lock(&rt_rq->rt_runtime_lock);
7380 rt_rq->rt_runtime = rt_runtime;
7381 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7383 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7385 read_unlock(&tasklist_lock);
7386 mutex_unlock(&rt_constraints_mutex);
7391 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
7393 u64 rt_runtime, rt_period;
7395 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7396 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
7397 if (rt_runtime_us < 0)
7398 rt_runtime = RUNTIME_INF;
7400 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7403 long sched_group_rt_runtime(struct task_group *tg)
7407 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
7410 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
7411 do_div(rt_runtime_us, NSEC_PER_USEC);
7412 return rt_runtime_us;
7415 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
7417 u64 rt_runtime, rt_period;
7419 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
7420 rt_runtime = tg->rt_bandwidth.rt_runtime;
7425 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7428 long sched_group_rt_period(struct task_group *tg)
7432 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
7433 do_div(rt_period_us, NSEC_PER_USEC);
7434 return rt_period_us;
7437 static int sched_rt_global_constraints(void)
7439 u64 runtime, period;
7442 if (sysctl_sched_rt_period <= 0)
7445 runtime = global_rt_runtime();
7446 period = global_rt_period();
7449 * Sanity check on the sysctl variables.
7451 if (runtime > period && runtime != RUNTIME_INF)
7454 mutex_lock(&rt_constraints_mutex);
7455 read_lock(&tasklist_lock);
7456 ret = __rt_schedulable(NULL, 0, 0);
7457 read_unlock(&tasklist_lock);
7458 mutex_unlock(&rt_constraints_mutex);
7463 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
7465 /* Don't accept realtime tasks when there is no way for them to run */
7466 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
7472 #else /* !CONFIG_RT_GROUP_SCHED */
7473 static int sched_rt_global_constraints(void)
7475 unsigned long flags;
7478 if (sysctl_sched_rt_period <= 0)
7482 * There's always some RT tasks in the root group
7483 * -- migration, kstopmachine etc..
7485 if (sysctl_sched_rt_runtime == 0)
7488 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
7489 for_each_possible_cpu(i) {
7490 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
7492 raw_spin_lock(&rt_rq->rt_runtime_lock);
7493 rt_rq->rt_runtime = global_rt_runtime();
7494 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7496 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
7500 #endif /* CONFIG_RT_GROUP_SCHED */
7502 int sched_rt_handler(struct ctl_table *table, int write,
7503 void __user *buffer, size_t *lenp,
7507 int old_period, old_runtime;
7508 static DEFINE_MUTEX(mutex);
7511 old_period = sysctl_sched_rt_period;
7512 old_runtime = sysctl_sched_rt_runtime;
7514 ret = proc_dointvec(table, write, buffer, lenp, ppos);
7516 if (!ret && write) {
7517 ret = sched_rt_global_constraints();
7519 sysctl_sched_rt_period = old_period;
7520 sysctl_sched_rt_runtime = old_runtime;
7522 def_rt_bandwidth.rt_runtime = global_rt_runtime();
7523 def_rt_bandwidth.rt_period =
7524 ns_to_ktime(global_rt_period());
7527 mutex_unlock(&mutex);
7532 #ifdef CONFIG_CGROUP_SCHED
7534 /* return corresponding task_group object of a cgroup */
7535 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
7537 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
7538 struct task_group, css);
7541 static struct cgroup_subsys_state *
7542 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
7544 struct task_group *tg, *parent;
7546 if (!cgrp->parent) {
7547 /* This is early initialization for the top cgroup */
7548 return &root_task_group.css;
7551 parent = cgroup_tg(cgrp->parent);
7552 tg = sched_create_group(parent);
7554 return ERR_PTR(-ENOMEM);
7560 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
7562 struct task_group *tg = cgroup_tg(cgrp);
7564 sched_destroy_group(tg);
7568 cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
7570 #ifdef CONFIG_RT_GROUP_SCHED
7571 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
7574 /* We don't support RT-tasks being in separate groups */
7575 if (tsk->sched_class != &fair_sched_class)
7582 cpu_cgroup_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
7584 sched_move_task(tsk);
7588 cpu_cgroup_exit(struct cgroup_subsys *ss, struct cgroup *cgrp,
7589 struct cgroup *old_cgrp, struct task_struct *task)
7592 * cgroup_exit() is called in the copy_process() failure path.
7593 * Ignore this case since the task hasn't ran yet, this avoids
7594 * trying to poke a half freed task state from generic code.
7596 if (!(task->flags & PF_EXITING))
7599 sched_move_task(task);
7602 #ifdef CONFIG_FAIR_GROUP_SCHED
7603 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
7606 return sched_group_set_shares(cgroup_tg(cgrp), scale_load(shareval));
7609 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
7611 struct task_group *tg = cgroup_tg(cgrp);
7613 return (u64) scale_load_down(tg->shares);
7616 #ifdef CONFIG_CFS_BANDWIDTH
7617 static DEFINE_MUTEX(cfs_constraints_mutex);
7619 const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */
7620 const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */
7622 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime);
7624 static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota)
7626 int i, ret = 0, runtime_enabled, runtime_was_enabled;
7627 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7629 if (tg == &root_task_group)
7633 * Ensure we have at some amount of bandwidth every period. This is
7634 * to prevent reaching a state of large arrears when throttled via
7635 * entity_tick() resulting in prolonged exit starvation.
7637 if (quota < min_cfs_quota_period || period < min_cfs_quota_period)
7641 * Likewise, bound things on the otherside by preventing insane quota
7642 * periods. This also allows us to normalize in computing quota
7645 if (period > max_cfs_quota_period)
7648 mutex_lock(&cfs_constraints_mutex);
7649 ret = __cfs_schedulable(tg, period, quota);
7653 runtime_enabled = quota != RUNTIME_INF;
7654 runtime_was_enabled = cfs_b->quota != RUNTIME_INF;
7655 account_cfs_bandwidth_used(runtime_enabled, runtime_was_enabled);
7656 raw_spin_lock_irq(&cfs_b->lock);
7657 cfs_b->period = ns_to_ktime(period);
7658 cfs_b->quota = quota;
7660 __refill_cfs_bandwidth_runtime(cfs_b);
7661 /* restart the period timer (if active) to handle new period expiry */
7662 if (runtime_enabled && cfs_b->timer_active) {
7663 /* force a reprogram */
7664 cfs_b->timer_active = 0;
7665 __start_cfs_bandwidth(cfs_b);
7667 raw_spin_unlock_irq(&cfs_b->lock);
7669 for_each_possible_cpu(i) {
7670 struct cfs_rq *cfs_rq = tg->cfs_rq[i];
7671 struct rq *rq = cfs_rq->rq;
7673 raw_spin_lock_irq(&rq->lock);
7674 cfs_rq->runtime_enabled = runtime_enabled;
7675 cfs_rq->runtime_remaining = 0;
7677 if (cfs_rq->throttled)
7678 unthrottle_cfs_rq(cfs_rq);
7679 raw_spin_unlock_irq(&rq->lock);
7682 mutex_unlock(&cfs_constraints_mutex);
7687 int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us)
7691 period = ktime_to_ns(tg->cfs_bandwidth.period);
7692 if (cfs_quota_us < 0)
7693 quota = RUNTIME_INF;
7695 quota = (u64)cfs_quota_us * NSEC_PER_USEC;
7697 return tg_set_cfs_bandwidth(tg, period, quota);
7700 long tg_get_cfs_quota(struct task_group *tg)
7704 if (tg->cfs_bandwidth.quota == RUNTIME_INF)
7707 quota_us = tg->cfs_bandwidth.quota;
7708 do_div(quota_us, NSEC_PER_USEC);
7713 int tg_set_cfs_period(struct task_group *tg, long cfs_period_us)
7717 period = (u64)cfs_period_us * NSEC_PER_USEC;
7718 quota = tg->cfs_bandwidth.quota;
7720 return tg_set_cfs_bandwidth(tg, period, quota);
7723 long tg_get_cfs_period(struct task_group *tg)
7727 cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period);
7728 do_div(cfs_period_us, NSEC_PER_USEC);
7730 return cfs_period_us;
7733 static s64 cpu_cfs_quota_read_s64(struct cgroup *cgrp, struct cftype *cft)
7735 return tg_get_cfs_quota(cgroup_tg(cgrp));
7738 static int cpu_cfs_quota_write_s64(struct cgroup *cgrp, struct cftype *cftype,
7741 return tg_set_cfs_quota(cgroup_tg(cgrp), cfs_quota_us);
7744 static u64 cpu_cfs_period_read_u64(struct cgroup *cgrp, struct cftype *cft)
7746 return tg_get_cfs_period(cgroup_tg(cgrp));
7749 static int cpu_cfs_period_write_u64(struct cgroup *cgrp, struct cftype *cftype,
7752 return tg_set_cfs_period(cgroup_tg(cgrp), cfs_period_us);
7755 struct cfs_schedulable_data {
7756 struct task_group *tg;
7761 * normalize group quota/period to be quota/max_period
7762 * note: units are usecs
7764 static u64 normalize_cfs_quota(struct task_group *tg,
7765 struct cfs_schedulable_data *d)
7773 period = tg_get_cfs_period(tg);
7774 quota = tg_get_cfs_quota(tg);
7777 /* note: these should typically be equivalent */
7778 if (quota == RUNTIME_INF || quota == -1)
7781 return to_ratio(period, quota);
7784 static int tg_cfs_schedulable_down(struct task_group *tg, void *data)
7786 struct cfs_schedulable_data *d = data;
7787 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7788 s64 quota = 0, parent_quota = -1;
7791 quota = RUNTIME_INF;
7793 struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth;
7795 quota = normalize_cfs_quota(tg, d);
7796 parent_quota = parent_b->hierarchal_quota;
7799 * ensure max(child_quota) <= parent_quota, inherit when no
7802 if (quota == RUNTIME_INF)
7803 quota = parent_quota;
7804 else if (parent_quota != RUNTIME_INF && quota > parent_quota)
7807 cfs_b->hierarchal_quota = quota;
7812 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota)
7815 struct cfs_schedulable_data data = {
7821 if (quota != RUNTIME_INF) {
7822 do_div(data.period, NSEC_PER_USEC);
7823 do_div(data.quota, NSEC_PER_USEC);
7827 ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data);
7833 static int cpu_stats_show(struct cgroup *cgrp, struct cftype *cft,
7834 struct cgroup_map_cb *cb)
7836 struct task_group *tg = cgroup_tg(cgrp);
7837 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7839 cb->fill(cb, "nr_periods", cfs_b->nr_periods);
7840 cb->fill(cb, "nr_throttled", cfs_b->nr_throttled);
7841 cb->fill(cb, "throttled_time", cfs_b->throttled_time);
7845 #endif /* CONFIG_CFS_BANDWIDTH */
7846 #endif /* CONFIG_FAIR_GROUP_SCHED */
7848 #ifdef CONFIG_RT_GROUP_SCHED
7849 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
7852 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
7855 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
7857 return sched_group_rt_runtime(cgroup_tg(cgrp));
7860 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
7863 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
7866 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
7868 return sched_group_rt_period(cgroup_tg(cgrp));
7870 #endif /* CONFIG_RT_GROUP_SCHED */
7872 static struct cftype cpu_files[] = {
7873 #ifdef CONFIG_FAIR_GROUP_SCHED
7876 .read_u64 = cpu_shares_read_u64,
7877 .write_u64 = cpu_shares_write_u64,
7880 #ifdef CONFIG_CFS_BANDWIDTH
7882 .name = "cfs_quota_us",
7883 .read_s64 = cpu_cfs_quota_read_s64,
7884 .write_s64 = cpu_cfs_quota_write_s64,
7887 .name = "cfs_period_us",
7888 .read_u64 = cpu_cfs_period_read_u64,
7889 .write_u64 = cpu_cfs_period_write_u64,
7893 .read_map = cpu_stats_show,
7896 #ifdef CONFIG_RT_GROUP_SCHED
7898 .name = "rt_runtime_us",
7899 .read_s64 = cpu_rt_runtime_read,
7900 .write_s64 = cpu_rt_runtime_write,
7903 .name = "rt_period_us",
7904 .read_u64 = cpu_rt_period_read_uint,
7905 .write_u64 = cpu_rt_period_write_uint,
7910 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
7912 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
7915 struct cgroup_subsys cpu_cgroup_subsys = {
7917 .create = cpu_cgroup_create,
7918 .destroy = cpu_cgroup_destroy,
7919 .can_attach_task = cpu_cgroup_can_attach_task,
7920 .attach_task = cpu_cgroup_attach_task,
7921 .exit = cpu_cgroup_exit,
7922 .populate = cpu_cgroup_populate,
7923 .subsys_id = cpu_cgroup_subsys_id,
7927 #endif /* CONFIG_CGROUP_SCHED */
7929 #ifdef CONFIG_CGROUP_CPUACCT
7932 * CPU accounting code for task groups.
7934 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
7935 * (balbir@in.ibm.com).
7938 /* create a new cpu accounting group */
7939 static struct cgroup_subsys_state *cpuacct_create(
7940 struct cgroup_subsys *ss, struct cgroup *cgrp)
7945 return &root_cpuacct.css;
7947 ca = kzalloc(sizeof(*ca), GFP_KERNEL);
7951 ca->cpuusage = alloc_percpu(u64);
7955 ca->cpustat = alloc_percpu(struct kernel_cpustat);
7957 goto out_free_cpuusage;
7962 free_percpu(ca->cpuusage);
7966 return ERR_PTR(-ENOMEM);
7969 /* destroy an existing cpu accounting group */
7971 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
7973 struct cpuacct *ca = cgroup_ca(cgrp);
7975 free_percpu(ca->cpustat);
7976 free_percpu(ca->cpuusage);
7980 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
7982 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
7985 #ifndef CONFIG_64BIT
7987 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
7989 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
7991 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
7999 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
8001 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8003 #ifndef CONFIG_64BIT
8005 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
8007 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8009 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8015 /* return total cpu usage (in nanoseconds) of a group */
8016 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
8018 struct cpuacct *ca = cgroup_ca(cgrp);
8019 u64 totalcpuusage = 0;
8022 for_each_present_cpu(i)
8023 totalcpuusage += cpuacct_cpuusage_read(ca, i);
8025 return totalcpuusage;
8028 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
8031 struct cpuacct *ca = cgroup_ca(cgrp);
8040 for_each_present_cpu(i)
8041 cpuacct_cpuusage_write(ca, i, 0);
8047 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
8050 struct cpuacct *ca = cgroup_ca(cgroup);
8054 for_each_present_cpu(i) {
8055 percpu = cpuacct_cpuusage_read(ca, i);
8056 seq_printf(m, "%llu ", (unsigned long long) percpu);
8058 seq_printf(m, "\n");
8062 static const char *cpuacct_stat_desc[] = {
8063 [CPUACCT_STAT_USER] = "user",
8064 [CPUACCT_STAT_SYSTEM] = "system",
8067 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
8068 struct cgroup_map_cb *cb)
8070 struct cpuacct *ca = cgroup_ca(cgrp);
8074 for_each_online_cpu(cpu) {
8075 struct kernel_cpustat *kcpustat = per_cpu_ptr(ca->cpustat, cpu);
8076 val += kcpustat->cpustat[CPUTIME_USER];
8077 val += kcpustat->cpustat[CPUTIME_NICE];
8079 val = cputime64_to_clock_t(val);
8080 cb->fill(cb, cpuacct_stat_desc[CPUACCT_STAT_USER], val);
8083 for_each_online_cpu(cpu) {
8084 struct kernel_cpustat *kcpustat = per_cpu_ptr(ca->cpustat, cpu);
8085 val += kcpustat->cpustat[CPUTIME_SYSTEM];
8086 val += kcpustat->cpustat[CPUTIME_IRQ];
8087 val += kcpustat->cpustat[CPUTIME_SOFTIRQ];
8090 val = cputime64_to_clock_t(val);
8091 cb->fill(cb, cpuacct_stat_desc[CPUACCT_STAT_SYSTEM], val);
8096 static struct cftype files[] = {
8099 .read_u64 = cpuusage_read,
8100 .write_u64 = cpuusage_write,
8103 .name = "usage_percpu",
8104 .read_seq_string = cpuacct_percpu_seq_read,
8108 .read_map = cpuacct_stats_show,
8112 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
8114 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
8118 * charge this task's execution time to its accounting group.
8120 * called with rq->lock held.
8122 void cpuacct_charge(struct task_struct *tsk, u64 cputime)
8127 if (unlikely(!cpuacct_subsys.active))
8130 cpu = task_cpu(tsk);
8136 for (; ca; ca = parent_ca(ca)) {
8137 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8138 *cpuusage += cputime;
8144 struct cgroup_subsys cpuacct_subsys = {
8146 .create = cpuacct_create,
8147 .destroy = cpuacct_destroy,
8148 .populate = cpuacct_populate,
8149 .subsys_id = cpuacct_subsys_id,
8151 #endif /* CONFIG_CGROUP_CPUACCT */