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 #include <asm/mutex.h>
78 #ifdef CONFIG_PARAVIRT
79 #include <asm/paravirt.h>
83 #include "../workqueue_sched.h"
85 #define CREATE_TRACE_POINTS
86 #include <trace/events/sched.h>
88 void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period)
91 ktime_t soft, hard, now;
94 if (hrtimer_active(period_timer))
97 now = hrtimer_cb_get_time(period_timer);
98 hrtimer_forward(period_timer, now, period);
100 soft = hrtimer_get_softexpires(period_timer);
101 hard = hrtimer_get_expires(period_timer);
102 delta = ktime_to_ns(ktime_sub(hard, soft));
103 __hrtimer_start_range_ns(period_timer, soft, delta,
104 HRTIMER_MODE_ABS_PINNED, 0);
108 DEFINE_MUTEX(sched_domains_mutex);
109 DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
111 static void update_rq_clock_task(struct rq *rq, s64 delta);
113 void update_rq_clock(struct rq *rq)
117 if (rq->skip_clock_update > 0)
120 delta = sched_clock_cpu(cpu_of(rq)) - rq->clock;
122 update_rq_clock_task(rq, delta);
126 * Debugging: various feature bits
129 #define SCHED_FEAT(name, enabled) \
130 (1UL << __SCHED_FEAT_##name) * enabled |
132 const_debug unsigned int sysctl_sched_features =
133 #include "features.h"
138 #ifdef CONFIG_SCHED_DEBUG
139 #define SCHED_FEAT(name, enabled) \
142 static __read_mostly char *sched_feat_names[] = {
143 #include "features.h"
149 static int sched_feat_show(struct seq_file *m, void *v)
153 for (i = 0; i < __SCHED_FEAT_NR; i++) {
154 if (!(sysctl_sched_features & (1UL << i)))
156 seq_printf(m, "%s ", sched_feat_names[i]);
163 #ifdef HAVE_JUMP_LABEL
165 #define jump_label_key__true jump_label_key_enabled
166 #define jump_label_key__false jump_label_key_disabled
168 #define SCHED_FEAT(name, enabled) \
169 jump_label_key__##enabled ,
171 struct jump_label_key sched_feat_keys[__SCHED_FEAT_NR] = {
172 #include "features.h"
177 static void sched_feat_disable(int i)
179 if (jump_label_enabled(&sched_feat_keys[i]))
180 jump_label_dec(&sched_feat_keys[i]);
183 static void sched_feat_enable(int i)
185 if (!jump_label_enabled(&sched_feat_keys[i]))
186 jump_label_inc(&sched_feat_keys[i]);
189 static void sched_feat_disable(int i) { };
190 static void sched_feat_enable(int i) { };
191 #endif /* HAVE_JUMP_LABEL */
194 sched_feat_write(struct file *filp, const char __user *ubuf,
195 size_t cnt, loff_t *ppos)
205 if (copy_from_user(&buf, ubuf, cnt))
211 if (strncmp(cmp, "NO_", 3) == 0) {
216 for (i = 0; i < __SCHED_FEAT_NR; i++) {
217 if (strcmp(cmp, sched_feat_names[i]) == 0) {
219 sysctl_sched_features &= ~(1UL << i);
220 sched_feat_disable(i);
222 sysctl_sched_features |= (1UL << i);
223 sched_feat_enable(i);
229 if (i == __SCHED_FEAT_NR)
237 static int sched_feat_open(struct inode *inode, struct file *filp)
239 return single_open(filp, sched_feat_show, NULL);
242 static const struct file_operations sched_feat_fops = {
243 .open = sched_feat_open,
244 .write = sched_feat_write,
247 .release = single_release,
250 static __init int sched_init_debug(void)
252 debugfs_create_file("sched_features", 0644, NULL, NULL,
257 late_initcall(sched_init_debug);
258 #endif /* CONFIG_SCHED_DEBUG */
261 * Number of tasks to iterate in a single balance run.
262 * Limited because this is done with IRQs disabled.
264 const_debug unsigned int sysctl_sched_nr_migrate = 32;
267 * period over which we average the RT time consumption, measured
272 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
275 * period over which we measure -rt task cpu usage in us.
278 unsigned int sysctl_sched_rt_period = 1000000;
280 __read_mostly int scheduler_running;
283 * part of the period that we allow rt tasks to run in us.
286 int sysctl_sched_rt_runtime = 950000;
291 * __task_rq_lock - lock the rq @p resides on.
293 static inline struct rq *__task_rq_lock(struct task_struct *p)
298 lockdep_assert_held(&p->pi_lock);
302 raw_spin_lock(&rq->lock);
303 if (likely(rq == task_rq(p)))
305 raw_spin_unlock(&rq->lock);
310 * task_rq_lock - lock p->pi_lock and lock the rq @p resides on.
312 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
313 __acquires(p->pi_lock)
319 raw_spin_lock_irqsave(&p->pi_lock, *flags);
321 raw_spin_lock(&rq->lock);
322 if (likely(rq == task_rq(p)))
324 raw_spin_unlock(&rq->lock);
325 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
329 static void __task_rq_unlock(struct rq *rq)
332 raw_spin_unlock(&rq->lock);
336 task_rq_unlock(struct rq *rq, struct task_struct *p, unsigned long *flags)
338 __releases(p->pi_lock)
340 raw_spin_unlock(&rq->lock);
341 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
345 * this_rq_lock - lock this runqueue and disable interrupts.
347 static struct rq *this_rq_lock(void)
354 raw_spin_lock(&rq->lock);
359 #ifdef CONFIG_SCHED_HRTICK
361 * Use HR-timers to deliver accurate preemption points.
363 * Its all a bit involved since we cannot program an hrt while holding the
364 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
367 * When we get rescheduled we reprogram the hrtick_timer outside of the
371 static void hrtick_clear(struct rq *rq)
373 if (hrtimer_active(&rq->hrtick_timer))
374 hrtimer_cancel(&rq->hrtick_timer);
378 * High-resolution timer tick.
379 * Runs from hardirq context with interrupts disabled.
381 static enum hrtimer_restart hrtick(struct hrtimer *timer)
383 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
385 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
387 raw_spin_lock(&rq->lock);
389 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
390 raw_spin_unlock(&rq->lock);
392 return HRTIMER_NORESTART;
397 * called from hardirq (IPI) context
399 static void __hrtick_start(void *arg)
403 raw_spin_lock(&rq->lock);
404 hrtimer_restart(&rq->hrtick_timer);
405 rq->hrtick_csd_pending = 0;
406 raw_spin_unlock(&rq->lock);
410 * Called to set the hrtick timer state.
412 * called with rq->lock held and irqs disabled
414 void hrtick_start(struct rq *rq, u64 delay)
416 struct hrtimer *timer = &rq->hrtick_timer;
417 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
419 hrtimer_set_expires(timer, time);
421 if (rq == this_rq()) {
422 hrtimer_restart(timer);
423 } else if (!rq->hrtick_csd_pending) {
424 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0);
425 rq->hrtick_csd_pending = 1;
430 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
432 int cpu = (int)(long)hcpu;
435 case CPU_UP_CANCELED:
436 case CPU_UP_CANCELED_FROZEN:
437 case CPU_DOWN_PREPARE:
438 case CPU_DOWN_PREPARE_FROZEN:
440 case CPU_DEAD_FROZEN:
441 hrtick_clear(cpu_rq(cpu));
448 static __init void init_hrtick(void)
450 hotcpu_notifier(hotplug_hrtick, 0);
454 * Called to set the hrtick timer state.
456 * called with rq->lock held and irqs disabled
458 void hrtick_start(struct rq *rq, u64 delay)
460 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
461 HRTIMER_MODE_REL_PINNED, 0);
464 static inline void init_hrtick(void)
467 #endif /* CONFIG_SMP */
469 static void init_rq_hrtick(struct rq *rq)
472 rq->hrtick_csd_pending = 0;
474 rq->hrtick_csd.flags = 0;
475 rq->hrtick_csd.func = __hrtick_start;
476 rq->hrtick_csd.info = rq;
479 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
480 rq->hrtick_timer.function = hrtick;
482 #else /* CONFIG_SCHED_HRTICK */
483 static inline void hrtick_clear(struct rq *rq)
487 static inline void init_rq_hrtick(struct rq *rq)
491 static inline void init_hrtick(void)
494 #endif /* CONFIG_SCHED_HRTICK */
497 * resched_task - mark a task 'to be rescheduled now'.
499 * On UP this means the setting of the need_resched flag, on SMP it
500 * might also involve a cross-CPU call to trigger the scheduler on
505 #ifndef tsk_is_polling
506 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
509 void resched_task(struct task_struct *p)
513 assert_raw_spin_locked(&task_rq(p)->lock);
515 if (test_tsk_need_resched(p))
518 set_tsk_need_resched(p);
521 if (cpu == smp_processor_id())
524 /* NEED_RESCHED must be visible before we test polling */
526 if (!tsk_is_polling(p))
527 smp_send_reschedule(cpu);
530 void resched_cpu(int cpu)
532 struct rq *rq = cpu_rq(cpu);
535 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
537 resched_task(cpu_curr(cpu));
538 raw_spin_unlock_irqrestore(&rq->lock, flags);
543 * In the semi idle case, use the nearest busy cpu for migrating timers
544 * from an idle cpu. This is good for power-savings.
546 * We don't do similar optimization for completely idle system, as
547 * selecting an idle cpu will add more delays to the timers than intended
548 * (as that cpu's timer base may not be uptodate wrt jiffies etc).
550 int get_nohz_timer_target(void)
552 int cpu = smp_processor_id();
554 struct sched_domain *sd;
557 for_each_domain(cpu, sd) {
558 for_each_cpu(i, sched_domain_span(sd)) {
570 * When add_timer_on() enqueues a timer into the timer wheel of an
571 * idle CPU then this timer might expire before the next timer event
572 * which is scheduled to wake up that CPU. In case of a completely
573 * idle system the next event might even be infinite time into the
574 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
575 * leaves the inner idle loop so the newly added timer is taken into
576 * account when the CPU goes back to idle and evaluates the timer
577 * wheel for the next timer event.
579 void wake_up_idle_cpu(int cpu)
581 struct rq *rq = cpu_rq(cpu);
583 if (cpu == smp_processor_id())
587 * This is safe, as this function is called with the timer
588 * wheel base lock of (cpu) held. When the CPU is on the way
589 * to idle and has not yet set rq->curr to idle then it will
590 * be serialized on the timer wheel base lock and take the new
591 * timer into account automatically.
593 if (rq->curr != rq->idle)
597 * We can set TIF_RESCHED on the idle task of the other CPU
598 * lockless. The worst case is that the other CPU runs the
599 * idle task through an additional NOOP schedule()
601 set_tsk_need_resched(rq->idle);
603 /* NEED_RESCHED must be visible before we test polling */
605 if (!tsk_is_polling(rq->idle))
606 smp_send_reschedule(cpu);
609 static inline bool got_nohz_idle_kick(void)
611 int cpu = smp_processor_id();
612 return idle_cpu(cpu) && test_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu));
615 #else /* CONFIG_NO_HZ */
617 static inline bool got_nohz_idle_kick(void)
622 #endif /* CONFIG_NO_HZ */
624 void sched_avg_update(struct rq *rq)
626 s64 period = sched_avg_period();
628 while ((s64)(rq->clock - rq->age_stamp) > period) {
630 * Inline assembly required to prevent the compiler
631 * optimising this loop into a divmod call.
632 * See __iter_div_u64_rem() for another example of this.
634 asm("" : "+rm" (rq->age_stamp));
635 rq->age_stamp += period;
640 #else /* !CONFIG_SMP */
641 void resched_task(struct task_struct *p)
643 assert_raw_spin_locked(&task_rq(p)->lock);
644 set_tsk_need_resched(p);
646 #endif /* CONFIG_SMP */
648 #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \
649 (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH)))
651 * Iterate task_group tree rooted at *from, calling @down when first entering a
652 * node and @up when leaving it for the final time.
654 * Caller must hold rcu_lock or sufficient equivalent.
656 int walk_tg_tree_from(struct task_group *from,
657 tg_visitor down, tg_visitor up, void *data)
659 struct task_group *parent, *child;
665 ret = (*down)(parent, data);
668 list_for_each_entry_rcu(child, &parent->children, siblings) {
675 ret = (*up)(parent, data);
676 if (ret || parent == from)
680 parent = parent->parent;
687 int tg_nop(struct task_group *tg, void *data)
693 void update_cpu_load(struct rq *this_rq);
695 static void set_load_weight(struct task_struct *p)
697 int prio = p->static_prio - MAX_RT_PRIO;
698 struct load_weight *load = &p->se.load;
701 * SCHED_IDLE tasks get minimal weight:
703 if (p->policy == SCHED_IDLE) {
704 load->weight = scale_load(WEIGHT_IDLEPRIO);
705 load->inv_weight = WMULT_IDLEPRIO;
709 load->weight = scale_load(prio_to_weight[prio]);
710 load->inv_weight = prio_to_wmult[prio];
713 static void enqueue_task(struct rq *rq, struct task_struct *p, int flags)
716 sched_info_queued(p);
717 p->sched_class->enqueue_task(rq, p, flags);
720 static void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
723 sched_info_dequeued(p);
724 p->sched_class->dequeue_task(rq, p, flags);
727 void activate_task(struct rq *rq, struct task_struct *p, int flags)
729 if (task_contributes_to_load(p))
730 rq->nr_uninterruptible--;
732 enqueue_task(rq, p, flags);
735 void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
737 if (task_contributes_to_load(p))
738 rq->nr_uninterruptible++;
740 dequeue_task(rq, p, flags);
743 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
746 * There are no locks covering percpu hardirq/softirq time.
747 * They are only modified in account_system_vtime, on corresponding CPU
748 * with interrupts disabled. So, writes are safe.
749 * They are read and saved off onto struct rq in update_rq_clock().
750 * This may result in other CPU reading this CPU's irq time and can
751 * race with irq/account_system_vtime on this CPU. We would either get old
752 * or new value with a side effect of accounting a slice of irq time to wrong
753 * task when irq is in progress while we read rq->clock. That is a worthy
754 * compromise in place of having locks on each irq in account_system_time.
756 static DEFINE_PER_CPU(u64, cpu_hardirq_time);
757 static DEFINE_PER_CPU(u64, cpu_softirq_time);
759 static DEFINE_PER_CPU(u64, irq_start_time);
760 static int sched_clock_irqtime;
762 void enable_sched_clock_irqtime(void)
764 sched_clock_irqtime = 1;
767 void disable_sched_clock_irqtime(void)
769 sched_clock_irqtime = 0;
773 static DEFINE_PER_CPU(seqcount_t, irq_time_seq);
775 static inline void irq_time_write_begin(void)
777 __this_cpu_inc(irq_time_seq.sequence);
781 static inline void irq_time_write_end(void)
784 __this_cpu_inc(irq_time_seq.sequence);
787 static inline u64 irq_time_read(int cpu)
793 seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu));
794 irq_time = per_cpu(cpu_softirq_time, cpu) +
795 per_cpu(cpu_hardirq_time, cpu);
796 } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq));
800 #else /* CONFIG_64BIT */
801 static inline void irq_time_write_begin(void)
805 static inline void irq_time_write_end(void)
809 static inline u64 irq_time_read(int cpu)
811 return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu);
813 #endif /* CONFIG_64BIT */
816 * Called before incrementing preempt_count on {soft,}irq_enter
817 * and before decrementing preempt_count on {soft,}irq_exit.
819 void account_system_vtime(struct task_struct *curr)
825 if (!sched_clock_irqtime)
828 local_irq_save(flags);
830 cpu = smp_processor_id();
831 delta = sched_clock_cpu(cpu) - __this_cpu_read(irq_start_time);
832 __this_cpu_add(irq_start_time, delta);
834 irq_time_write_begin();
836 * We do not account for softirq time from ksoftirqd here.
837 * We want to continue accounting softirq time to ksoftirqd thread
838 * in that case, so as not to confuse scheduler with a special task
839 * that do not consume any time, but still wants to run.
842 __this_cpu_add(cpu_hardirq_time, delta);
843 else if (in_serving_softirq() && curr != this_cpu_ksoftirqd())
844 __this_cpu_add(cpu_softirq_time, delta);
846 irq_time_write_end();
847 local_irq_restore(flags);
849 EXPORT_SYMBOL_GPL(account_system_vtime);
851 #endif /* CONFIG_IRQ_TIME_ACCOUNTING */
853 #ifdef CONFIG_PARAVIRT
854 static inline u64 steal_ticks(u64 steal)
856 if (unlikely(steal > NSEC_PER_SEC))
857 return div_u64(steal, TICK_NSEC);
859 return __iter_div_u64_rem(steal, TICK_NSEC, &steal);
863 static void update_rq_clock_task(struct rq *rq, s64 delta)
866 * In theory, the compile should just see 0 here, and optimize out the call
867 * to sched_rt_avg_update. But I don't trust it...
869 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
870 s64 steal = 0, irq_delta = 0;
872 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
873 irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time;
876 * Since irq_time is only updated on {soft,}irq_exit, we might run into
877 * this case when a previous update_rq_clock() happened inside a
880 * When this happens, we stop ->clock_task and only update the
881 * prev_irq_time stamp to account for the part that fit, so that a next
882 * update will consume the rest. This ensures ->clock_task is
885 * It does however cause some slight miss-attribution of {soft,}irq
886 * time, a more accurate solution would be to update the irq_time using
887 * the current rq->clock timestamp, except that would require using
890 if (irq_delta > delta)
893 rq->prev_irq_time += irq_delta;
896 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
897 if (static_branch((¶virt_steal_rq_enabled))) {
900 steal = paravirt_steal_clock(cpu_of(rq));
901 steal -= rq->prev_steal_time_rq;
903 if (unlikely(steal > delta))
906 st = steal_ticks(steal);
907 steal = st * TICK_NSEC;
909 rq->prev_steal_time_rq += steal;
915 rq->clock_task += delta;
917 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
918 if ((irq_delta + steal) && sched_feat(NONTASK_POWER))
919 sched_rt_avg_update(rq, irq_delta + steal);
923 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
924 static int irqtime_account_hi_update(void)
926 u64 *cpustat = kcpustat_this_cpu->cpustat;
931 local_irq_save(flags);
932 latest_ns = this_cpu_read(cpu_hardirq_time);
933 if (nsecs_to_cputime64(latest_ns) > cpustat[CPUTIME_IRQ])
935 local_irq_restore(flags);
939 static int irqtime_account_si_update(void)
941 u64 *cpustat = kcpustat_this_cpu->cpustat;
946 local_irq_save(flags);
947 latest_ns = this_cpu_read(cpu_softirq_time);
948 if (nsecs_to_cputime64(latest_ns) > cpustat[CPUTIME_SOFTIRQ])
950 local_irq_restore(flags);
954 #else /* CONFIG_IRQ_TIME_ACCOUNTING */
956 #define sched_clock_irqtime (0)
960 void sched_set_stop_task(int cpu, struct task_struct *stop)
962 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
963 struct task_struct *old_stop = cpu_rq(cpu)->stop;
967 * Make it appear like a SCHED_FIFO task, its something
968 * userspace knows about and won't get confused about.
970 * Also, it will make PI more or less work without too
971 * much confusion -- but then, stop work should not
972 * rely on PI working anyway.
974 sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m);
976 stop->sched_class = &stop_sched_class;
979 cpu_rq(cpu)->stop = stop;
983 * Reset it back to a normal scheduling class so that
984 * it can die in pieces.
986 old_stop->sched_class = &rt_sched_class;
991 * __normal_prio - return the priority that is based on the static prio
993 static inline int __normal_prio(struct task_struct *p)
995 return p->static_prio;
999 * Calculate the expected normal priority: i.e. priority
1000 * without taking RT-inheritance into account. Might be
1001 * boosted by interactivity modifiers. Changes upon fork,
1002 * setprio syscalls, and whenever the interactivity
1003 * estimator recalculates.
1005 static inline int normal_prio(struct task_struct *p)
1009 if (task_has_rt_policy(p))
1010 prio = MAX_RT_PRIO-1 - p->rt_priority;
1012 prio = __normal_prio(p);
1017 * Calculate the current priority, i.e. the priority
1018 * taken into account by the scheduler. This value might
1019 * be boosted by RT tasks, or might be boosted by
1020 * interactivity modifiers. Will be RT if the task got
1021 * RT-boosted. If not then it returns p->normal_prio.
1023 static int effective_prio(struct task_struct *p)
1025 p->normal_prio = normal_prio(p);
1027 * If we are RT tasks or we were boosted to RT priority,
1028 * keep the priority unchanged. Otherwise, update priority
1029 * to the normal priority:
1031 if (!rt_prio(p->prio))
1032 return p->normal_prio;
1037 * task_curr - is this task currently executing on a CPU?
1038 * @p: the task in question.
1040 inline int task_curr(const struct task_struct *p)
1042 return cpu_curr(task_cpu(p)) == p;
1045 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1046 const struct sched_class *prev_class,
1049 if (prev_class != p->sched_class) {
1050 if (prev_class->switched_from)
1051 prev_class->switched_from(rq, p);
1052 p->sched_class->switched_to(rq, p);
1053 } else if (oldprio != p->prio)
1054 p->sched_class->prio_changed(rq, p, oldprio);
1057 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
1059 const struct sched_class *class;
1061 if (p->sched_class == rq->curr->sched_class) {
1062 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
1064 for_each_class(class) {
1065 if (class == rq->curr->sched_class)
1067 if (class == p->sched_class) {
1068 resched_task(rq->curr);
1075 * A queue event has occurred, and we're going to schedule. In
1076 * this case, we can save a useless back to back clock update.
1078 if (rq->curr->on_rq && test_tsk_need_resched(rq->curr))
1079 rq->skip_clock_update = 1;
1083 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1085 #ifdef CONFIG_SCHED_DEBUG
1087 * We should never call set_task_cpu() on a blocked task,
1088 * ttwu() will sort out the placement.
1090 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
1091 !(task_thread_info(p)->preempt_count & PREEMPT_ACTIVE));
1093 #ifdef CONFIG_LOCKDEP
1095 * The caller should hold either p->pi_lock or rq->lock, when changing
1096 * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks.
1098 * sched_move_task() holds both and thus holding either pins the cgroup,
1099 * see set_task_rq().
1101 * Furthermore, all task_rq users should acquire both locks, see
1104 WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) ||
1105 lockdep_is_held(&task_rq(p)->lock)));
1109 trace_sched_migrate_task(p, new_cpu);
1111 if (task_cpu(p) != new_cpu) {
1112 p->se.nr_migrations++;
1113 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, NULL, 0);
1116 __set_task_cpu(p, new_cpu);
1119 struct migration_arg {
1120 struct task_struct *task;
1124 static int migration_cpu_stop(void *data);
1127 * wait_task_inactive - wait for a thread to unschedule.
1129 * If @match_state is nonzero, it's the @p->state value just checked and
1130 * not expected to change. If it changes, i.e. @p might have woken up,
1131 * then return zero. When we succeed in waiting for @p to be off its CPU,
1132 * we return a positive number (its total switch count). If a second call
1133 * a short while later returns the same number, the caller can be sure that
1134 * @p has remained unscheduled the whole time.
1136 * The caller must ensure that the task *will* unschedule sometime soon,
1137 * else this function might spin for a *long* time. This function can't
1138 * be called with interrupts off, or it may introduce deadlock with
1139 * smp_call_function() if an IPI is sent by the same process we are
1140 * waiting to become inactive.
1142 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
1144 unsigned long flags;
1151 * We do the initial early heuristics without holding
1152 * any task-queue locks at all. We'll only try to get
1153 * the runqueue lock when things look like they will
1159 * If the task is actively running on another CPU
1160 * still, just relax and busy-wait without holding
1163 * NOTE! Since we don't hold any locks, it's not
1164 * even sure that "rq" stays as the right runqueue!
1165 * But we don't care, since "task_running()" will
1166 * return false if the runqueue has changed and p
1167 * is actually now running somewhere else!
1169 while (task_running(rq, p)) {
1170 if (match_state && unlikely(p->state != match_state))
1176 * Ok, time to look more closely! We need the rq
1177 * lock now, to be *sure*. If we're wrong, we'll
1178 * just go back and repeat.
1180 rq = task_rq_lock(p, &flags);
1181 trace_sched_wait_task(p);
1182 running = task_running(rq, p);
1185 if (!match_state || p->state == match_state)
1186 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
1187 task_rq_unlock(rq, p, &flags);
1190 * If it changed from the expected state, bail out now.
1192 if (unlikely(!ncsw))
1196 * Was it really running after all now that we
1197 * checked with the proper locks actually held?
1199 * Oops. Go back and try again..
1201 if (unlikely(running)) {
1207 * It's not enough that it's not actively running,
1208 * it must be off the runqueue _entirely_, and not
1211 * So if it was still runnable (but just not actively
1212 * running right now), it's preempted, and we should
1213 * yield - it could be a while.
1215 if (unlikely(on_rq)) {
1216 ktime_t to = ktime_set(0, NSEC_PER_SEC/HZ);
1218 set_current_state(TASK_UNINTERRUPTIBLE);
1219 schedule_hrtimeout(&to, HRTIMER_MODE_REL);
1224 * Ahh, all good. It wasn't running, and it wasn't
1225 * runnable, which means that it will never become
1226 * running in the future either. We're all done!
1235 * kick_process - kick a running thread to enter/exit the kernel
1236 * @p: the to-be-kicked thread
1238 * Cause a process which is running on another CPU to enter
1239 * kernel-mode, without any delay. (to get signals handled.)
1241 * NOTE: this function doesn't have to take the runqueue lock,
1242 * because all it wants to ensure is that the remote task enters
1243 * the kernel. If the IPI races and the task has been migrated
1244 * to another CPU then no harm is done and the purpose has been
1247 void kick_process(struct task_struct *p)
1253 if ((cpu != smp_processor_id()) && task_curr(p))
1254 smp_send_reschedule(cpu);
1257 EXPORT_SYMBOL_GPL(kick_process);
1258 #endif /* CONFIG_SMP */
1262 * ->cpus_allowed is protected by both rq->lock and p->pi_lock
1264 static int select_fallback_rq(int cpu, struct task_struct *p)
1266 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(cpu));
1267 enum { cpuset, possible, fail } state = cpuset;
1270 /* Look for allowed, online CPU in same node. */
1271 for_each_cpu_mask(dest_cpu, *nodemask) {
1272 if (!cpu_online(dest_cpu))
1274 if (!cpu_active(dest_cpu))
1276 if (cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
1281 /* Any allowed, online CPU? */
1282 for_each_cpu_mask(dest_cpu, *tsk_cpus_allowed(p)) {
1283 if (!cpu_online(dest_cpu))
1285 if (!cpu_active(dest_cpu))
1292 /* No more Mr. Nice Guy. */
1293 cpuset_cpus_allowed_fallback(p);
1298 do_set_cpus_allowed(p, cpu_possible_mask);
1309 if (state != cpuset) {
1311 * Don't tell them about moving exiting tasks or
1312 * kernel threads (both mm NULL), since they never
1315 if (p->mm && printk_ratelimit()) {
1316 printk_sched("process %d (%s) no longer affine to cpu%d\n",
1317 task_pid_nr(p), p->comm, cpu);
1325 * The caller (fork, wakeup) owns p->pi_lock, ->cpus_allowed is stable.
1328 int select_task_rq(struct task_struct *p, int sd_flags, int wake_flags)
1330 int cpu = p->sched_class->select_task_rq(p, sd_flags, wake_flags);
1333 * In order not to call set_task_cpu() on a blocking task we need
1334 * to rely on ttwu() to place the task on a valid ->cpus_allowed
1337 * Since this is common to all placement strategies, this lives here.
1339 * [ this allows ->select_task() to simply return task_cpu(p) and
1340 * not worry about this generic constraint ]
1342 if (unlikely(!cpumask_test_cpu(cpu, tsk_cpus_allowed(p)) ||
1344 cpu = select_fallback_rq(task_cpu(p), p);
1349 static void update_avg(u64 *avg, u64 sample)
1351 s64 diff = sample - *avg;
1357 ttwu_stat(struct task_struct *p, int cpu, int wake_flags)
1359 #ifdef CONFIG_SCHEDSTATS
1360 struct rq *rq = this_rq();
1363 int this_cpu = smp_processor_id();
1365 if (cpu == this_cpu) {
1366 schedstat_inc(rq, ttwu_local);
1367 schedstat_inc(p, se.statistics.nr_wakeups_local);
1369 struct sched_domain *sd;
1371 schedstat_inc(p, se.statistics.nr_wakeups_remote);
1373 for_each_domain(this_cpu, sd) {
1374 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
1375 schedstat_inc(sd, ttwu_wake_remote);
1382 if (wake_flags & WF_MIGRATED)
1383 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
1385 #endif /* CONFIG_SMP */
1387 schedstat_inc(rq, ttwu_count);
1388 schedstat_inc(p, se.statistics.nr_wakeups);
1390 if (wake_flags & WF_SYNC)
1391 schedstat_inc(p, se.statistics.nr_wakeups_sync);
1393 #endif /* CONFIG_SCHEDSTATS */
1396 static void ttwu_activate(struct rq *rq, struct task_struct *p, int en_flags)
1398 activate_task(rq, p, en_flags);
1401 /* if a worker is waking up, notify workqueue */
1402 if (p->flags & PF_WQ_WORKER)
1403 wq_worker_waking_up(p, cpu_of(rq));
1407 * Mark the task runnable and perform wakeup-preemption.
1410 ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags)
1412 trace_sched_wakeup(p, true);
1413 check_preempt_curr(rq, p, wake_flags);
1415 p->state = TASK_RUNNING;
1417 if (p->sched_class->task_woken)
1418 p->sched_class->task_woken(rq, p);
1420 if (rq->idle_stamp) {
1421 u64 delta = rq->clock - rq->idle_stamp;
1422 u64 max = 2*sysctl_sched_migration_cost;
1427 update_avg(&rq->avg_idle, delta);
1434 ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags)
1437 if (p->sched_contributes_to_load)
1438 rq->nr_uninterruptible--;
1441 ttwu_activate(rq, p, ENQUEUE_WAKEUP | ENQUEUE_WAKING);
1442 ttwu_do_wakeup(rq, p, wake_flags);
1446 * Called in case the task @p isn't fully descheduled from its runqueue,
1447 * in this case we must do a remote wakeup. Its a 'light' wakeup though,
1448 * since all we need to do is flip p->state to TASK_RUNNING, since
1449 * the task is still ->on_rq.
1451 static int ttwu_remote(struct task_struct *p, int wake_flags)
1456 rq = __task_rq_lock(p);
1458 ttwu_do_wakeup(rq, p, wake_flags);
1461 __task_rq_unlock(rq);
1467 static void sched_ttwu_pending(void)
1469 struct rq *rq = this_rq();
1470 struct llist_node *llist = llist_del_all(&rq->wake_list);
1471 struct task_struct *p;
1473 raw_spin_lock(&rq->lock);
1476 p = llist_entry(llist, struct task_struct, wake_entry);
1477 llist = llist_next(llist);
1478 ttwu_do_activate(rq, p, 0);
1481 raw_spin_unlock(&rq->lock);
1484 void scheduler_ipi(void)
1486 if (llist_empty(&this_rq()->wake_list) && !got_nohz_idle_kick())
1490 * Not all reschedule IPI handlers call irq_enter/irq_exit, since
1491 * traditionally all their work was done from the interrupt return
1492 * path. Now that we actually do some work, we need to make sure
1495 * Some archs already do call them, luckily irq_enter/exit nest
1498 * Arguably we should visit all archs and update all handlers,
1499 * however a fair share of IPIs are still resched only so this would
1500 * somewhat pessimize the simple resched case.
1503 sched_ttwu_pending();
1506 * Check if someone kicked us for doing the nohz idle load balance.
1508 if (unlikely(got_nohz_idle_kick() && !need_resched())) {
1509 this_rq()->idle_balance = 1;
1510 raise_softirq_irqoff(SCHED_SOFTIRQ);
1515 static void ttwu_queue_remote(struct task_struct *p, int cpu)
1517 if (llist_add(&p->wake_entry, &cpu_rq(cpu)->wake_list))
1518 smp_send_reschedule(cpu);
1521 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1522 static int ttwu_activate_remote(struct task_struct *p, int wake_flags)
1527 rq = __task_rq_lock(p);
1529 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1530 ttwu_do_wakeup(rq, p, wake_flags);
1533 __task_rq_unlock(rq);
1538 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1540 bool cpus_share_cache(int this_cpu, int that_cpu)
1542 return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu);
1544 #endif /* CONFIG_SMP */
1546 static void ttwu_queue(struct task_struct *p, int cpu)
1548 struct rq *rq = cpu_rq(cpu);
1550 #if defined(CONFIG_SMP)
1551 if (sched_feat(TTWU_QUEUE) && !cpus_share_cache(smp_processor_id(), cpu)) {
1552 sched_clock_cpu(cpu); /* sync clocks x-cpu */
1553 ttwu_queue_remote(p, cpu);
1558 raw_spin_lock(&rq->lock);
1559 ttwu_do_activate(rq, p, 0);
1560 raw_spin_unlock(&rq->lock);
1564 * try_to_wake_up - wake up a thread
1565 * @p: the thread to be awakened
1566 * @state: the mask of task states that can be woken
1567 * @wake_flags: wake modifier flags (WF_*)
1569 * Put it on the run-queue if it's not already there. The "current"
1570 * thread is always on the run-queue (except when the actual
1571 * re-schedule is in progress), and as such you're allowed to do
1572 * the simpler "current->state = TASK_RUNNING" to mark yourself
1573 * runnable without the overhead of this.
1575 * Returns %true if @p was woken up, %false if it was already running
1576 * or @state didn't match @p's state.
1579 try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags)
1581 unsigned long flags;
1582 int cpu, success = 0;
1585 raw_spin_lock_irqsave(&p->pi_lock, flags);
1586 if (!(p->state & state))
1589 success = 1; /* we're going to change ->state */
1592 if (p->on_rq && ttwu_remote(p, wake_flags))
1597 * If the owning (remote) cpu is still in the middle of schedule() with
1598 * this task as prev, wait until its done referencing the task.
1601 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1603 * In case the architecture enables interrupts in
1604 * context_switch(), we cannot busy wait, since that
1605 * would lead to deadlocks when an interrupt hits and
1606 * tries to wake up @prev. So bail and do a complete
1609 if (ttwu_activate_remote(p, wake_flags))
1616 * Pairs with the smp_wmb() in finish_lock_switch().
1620 p->sched_contributes_to_load = !!task_contributes_to_load(p);
1621 p->state = TASK_WAKING;
1623 if (p->sched_class->task_waking)
1624 p->sched_class->task_waking(p);
1626 cpu = select_task_rq(p, SD_BALANCE_WAKE, wake_flags);
1627 if (task_cpu(p) != cpu) {
1628 wake_flags |= WF_MIGRATED;
1629 set_task_cpu(p, cpu);
1631 #endif /* CONFIG_SMP */
1635 ttwu_stat(p, cpu, wake_flags);
1637 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1643 * try_to_wake_up_local - try to wake up a local task with rq lock held
1644 * @p: the thread to be awakened
1646 * Put @p on the run-queue if it's not already there. The caller must
1647 * ensure that this_rq() is locked, @p is bound to this_rq() and not
1650 static void try_to_wake_up_local(struct task_struct *p)
1652 struct rq *rq = task_rq(p);
1654 BUG_ON(rq != this_rq());
1655 BUG_ON(p == current);
1656 lockdep_assert_held(&rq->lock);
1658 if (!raw_spin_trylock(&p->pi_lock)) {
1659 raw_spin_unlock(&rq->lock);
1660 raw_spin_lock(&p->pi_lock);
1661 raw_spin_lock(&rq->lock);
1664 if (!(p->state & TASK_NORMAL))
1668 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1670 ttwu_do_wakeup(rq, p, 0);
1671 ttwu_stat(p, smp_processor_id(), 0);
1673 raw_spin_unlock(&p->pi_lock);
1677 * wake_up_process - Wake up a specific process
1678 * @p: The process to be woken up.
1680 * Attempt to wake up the nominated process and move it to the set of runnable
1681 * processes. Returns 1 if the process was woken up, 0 if it was already
1684 * It may be assumed that this function implies a write memory barrier before
1685 * changing the task state if and only if any tasks are woken up.
1687 int wake_up_process(struct task_struct *p)
1689 return try_to_wake_up(p, TASK_ALL, 0);
1691 EXPORT_SYMBOL(wake_up_process);
1693 int wake_up_state(struct task_struct *p, unsigned int state)
1695 return try_to_wake_up(p, state, 0);
1699 * Perform scheduler related setup for a newly forked process p.
1700 * p is forked by current.
1702 * __sched_fork() is basic setup used by init_idle() too:
1704 static void __sched_fork(struct task_struct *p)
1709 p->se.exec_start = 0;
1710 p->se.sum_exec_runtime = 0;
1711 p->se.prev_sum_exec_runtime = 0;
1712 p->se.nr_migrations = 0;
1714 INIT_LIST_HEAD(&p->se.group_node);
1716 #ifdef CONFIG_SCHEDSTATS
1717 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
1720 INIT_LIST_HEAD(&p->rt.run_list);
1722 #ifdef CONFIG_PREEMPT_NOTIFIERS
1723 INIT_HLIST_HEAD(&p->preempt_notifiers);
1728 * fork()/clone()-time setup:
1730 void sched_fork(struct task_struct *p)
1732 unsigned long flags;
1733 int cpu = get_cpu();
1737 * We mark the process as running here. This guarantees that
1738 * nobody will actually run it, and a signal or other external
1739 * event cannot wake it up and insert it on the runqueue either.
1741 p->state = TASK_RUNNING;
1744 * Make sure we do not leak PI boosting priority to the child.
1746 p->prio = current->normal_prio;
1749 * Revert to default priority/policy on fork if requested.
1751 if (unlikely(p->sched_reset_on_fork)) {
1752 if (task_has_rt_policy(p)) {
1753 p->policy = SCHED_NORMAL;
1754 p->static_prio = NICE_TO_PRIO(0);
1756 } else if (PRIO_TO_NICE(p->static_prio) < 0)
1757 p->static_prio = NICE_TO_PRIO(0);
1759 p->prio = p->normal_prio = __normal_prio(p);
1763 * We don't need the reset flag anymore after the fork. It has
1764 * fulfilled its duty:
1766 p->sched_reset_on_fork = 0;
1769 if (!rt_prio(p->prio))
1770 p->sched_class = &fair_sched_class;
1772 if (p->sched_class->task_fork)
1773 p->sched_class->task_fork(p);
1776 * The child is not yet in the pid-hash so no cgroup attach races,
1777 * and the cgroup is pinned to this child due to cgroup_fork()
1778 * is ran before sched_fork().
1780 * Silence PROVE_RCU.
1782 raw_spin_lock_irqsave(&p->pi_lock, flags);
1783 set_task_cpu(p, cpu);
1784 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1786 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
1787 if (likely(sched_info_on()))
1788 memset(&p->sched_info, 0, sizeof(p->sched_info));
1790 #if defined(CONFIG_SMP)
1793 #ifdef CONFIG_PREEMPT_COUNT
1794 /* Want to start with kernel preemption disabled. */
1795 task_thread_info(p)->preempt_count = 1;
1798 plist_node_init(&p->pushable_tasks, MAX_PRIO);
1805 * wake_up_new_task - wake up a newly created task for the first time.
1807 * This function will do some initial scheduler statistics housekeeping
1808 * that must be done for every newly created context, then puts the task
1809 * on the runqueue and wakes it.
1811 void wake_up_new_task(struct task_struct *p)
1813 unsigned long flags;
1816 raw_spin_lock_irqsave(&p->pi_lock, flags);
1819 * Fork balancing, do it here and not earlier because:
1820 * - cpus_allowed can change in the fork path
1821 * - any previously selected cpu might disappear through hotplug
1823 set_task_cpu(p, select_task_rq(p, SD_BALANCE_FORK, 0));
1826 rq = __task_rq_lock(p);
1827 activate_task(rq, p, 0);
1829 trace_sched_wakeup_new(p, true);
1830 check_preempt_curr(rq, p, WF_FORK);
1832 if (p->sched_class->task_woken)
1833 p->sched_class->task_woken(rq, p);
1835 task_rq_unlock(rq, p, &flags);
1838 #ifdef CONFIG_PREEMPT_NOTIFIERS
1841 * preempt_notifier_register - tell me when current is being preempted & rescheduled
1842 * @notifier: notifier struct to register
1844 void preempt_notifier_register(struct preempt_notifier *notifier)
1846 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
1848 EXPORT_SYMBOL_GPL(preempt_notifier_register);
1851 * preempt_notifier_unregister - no longer interested in preemption notifications
1852 * @notifier: notifier struct to unregister
1854 * This is safe to call from within a preemption notifier.
1856 void preempt_notifier_unregister(struct preempt_notifier *notifier)
1858 hlist_del(¬ifier->link);
1860 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
1862 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
1864 struct preempt_notifier *notifier;
1865 struct hlist_node *node;
1867 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
1868 notifier->ops->sched_in(notifier, raw_smp_processor_id());
1872 fire_sched_out_preempt_notifiers(struct task_struct *curr,
1873 struct task_struct *next)
1875 struct preempt_notifier *notifier;
1876 struct hlist_node *node;
1878 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
1879 notifier->ops->sched_out(notifier, next);
1882 #else /* !CONFIG_PREEMPT_NOTIFIERS */
1884 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
1889 fire_sched_out_preempt_notifiers(struct task_struct *curr,
1890 struct task_struct *next)
1894 #endif /* CONFIG_PREEMPT_NOTIFIERS */
1897 * prepare_task_switch - prepare to switch tasks
1898 * @rq: the runqueue preparing to switch
1899 * @prev: the current task that is being switched out
1900 * @next: the task we are going to switch to.
1902 * This is called with the rq lock held and interrupts off. It must
1903 * be paired with a subsequent finish_task_switch after the context
1906 * prepare_task_switch sets up locking and calls architecture specific
1910 prepare_task_switch(struct rq *rq, struct task_struct *prev,
1911 struct task_struct *next)
1913 sched_info_switch(prev, next);
1914 perf_event_task_sched_out(prev, next);
1915 fire_sched_out_preempt_notifiers(prev, next);
1916 prepare_lock_switch(rq, next);
1917 prepare_arch_switch(next);
1918 trace_sched_switch(prev, next);
1922 * finish_task_switch - clean up after a task-switch
1923 * @rq: runqueue associated with task-switch
1924 * @prev: the thread we just switched away from.
1926 * finish_task_switch must be called after the context switch, paired
1927 * with a prepare_task_switch call before the context switch.
1928 * finish_task_switch will reconcile locking set up by prepare_task_switch,
1929 * and do any other architecture-specific cleanup actions.
1931 * Note that we may have delayed dropping an mm in context_switch(). If
1932 * so, we finish that here outside of the runqueue lock. (Doing it
1933 * with the lock held can cause deadlocks; see schedule() for
1936 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
1937 __releases(rq->lock)
1939 struct mm_struct *mm = rq->prev_mm;
1945 * A task struct has one reference for the use as "current".
1946 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
1947 * schedule one last time. The schedule call will never return, and
1948 * the scheduled task must drop that reference.
1949 * The test for TASK_DEAD must occur while the runqueue locks are
1950 * still held, otherwise prev could be scheduled on another cpu, die
1951 * there before we look at prev->state, and then the reference would
1953 * Manfred Spraul <manfred@colorfullife.com>
1955 prev_state = prev->state;
1956 finish_arch_switch(prev);
1957 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1958 local_irq_disable();
1959 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1960 perf_event_task_sched_in(prev, current);
1961 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1963 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1964 finish_lock_switch(rq, prev);
1966 fire_sched_in_preempt_notifiers(current);
1969 if (unlikely(prev_state == TASK_DEAD)) {
1971 * Remove function-return probe instances associated with this
1972 * task and put them back on the free list.
1974 kprobe_flush_task(prev);
1975 put_task_struct(prev);
1981 /* assumes rq->lock is held */
1982 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
1984 if (prev->sched_class->pre_schedule)
1985 prev->sched_class->pre_schedule(rq, prev);
1988 /* rq->lock is NOT held, but preemption is disabled */
1989 static inline void post_schedule(struct rq *rq)
1991 if (rq->post_schedule) {
1992 unsigned long flags;
1994 raw_spin_lock_irqsave(&rq->lock, flags);
1995 if (rq->curr->sched_class->post_schedule)
1996 rq->curr->sched_class->post_schedule(rq);
1997 raw_spin_unlock_irqrestore(&rq->lock, flags);
1999 rq->post_schedule = 0;
2005 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
2009 static inline void post_schedule(struct rq *rq)
2016 * schedule_tail - first thing a freshly forked thread must call.
2017 * @prev: the thread we just switched away from.
2019 asmlinkage void schedule_tail(struct task_struct *prev)
2020 __releases(rq->lock)
2022 struct rq *rq = this_rq();
2024 finish_task_switch(rq, prev);
2027 * FIXME: do we need to worry about rq being invalidated by the
2032 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2033 /* In this case, finish_task_switch does not reenable preemption */
2036 if (current->set_child_tid)
2037 put_user(task_pid_vnr(current), current->set_child_tid);
2041 * context_switch - switch to the new MM and the new
2042 * thread's register state.
2045 context_switch(struct rq *rq, struct task_struct *prev,
2046 struct task_struct *next)
2048 struct mm_struct *mm, *oldmm;
2050 prepare_task_switch(rq, prev, next);
2053 oldmm = prev->active_mm;
2055 * For paravirt, this is coupled with an exit in switch_to to
2056 * combine the page table reload and the switch backend into
2059 arch_start_context_switch(prev);
2062 next->active_mm = oldmm;
2063 atomic_inc(&oldmm->mm_count);
2064 enter_lazy_tlb(oldmm, next);
2066 switch_mm(oldmm, mm, next);
2069 prev->active_mm = NULL;
2070 rq->prev_mm = oldmm;
2073 * Since the runqueue lock will be released by the next
2074 * task (which is an invalid locking op but in the case
2075 * of the scheduler it's an obvious special-case), so we
2076 * do an early lockdep release here:
2078 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2079 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2082 /* Here we just switch the register state and the stack. */
2083 switch_to(prev, next, prev);
2087 * this_rq must be evaluated again because prev may have moved
2088 * CPUs since it called schedule(), thus the 'rq' on its stack
2089 * frame will be invalid.
2091 finish_task_switch(this_rq(), prev);
2095 * nr_running, nr_uninterruptible and nr_context_switches:
2097 * externally visible scheduler statistics: current number of runnable
2098 * threads, current number of uninterruptible-sleeping threads, total
2099 * number of context switches performed since bootup.
2101 unsigned long nr_running(void)
2103 unsigned long i, sum = 0;
2105 for_each_online_cpu(i)
2106 sum += cpu_rq(i)->nr_running;
2111 unsigned long nr_uninterruptible(void)
2113 unsigned long i, sum = 0;
2115 for_each_possible_cpu(i)
2116 sum += cpu_rq(i)->nr_uninterruptible;
2119 * Since we read the counters lockless, it might be slightly
2120 * inaccurate. Do not allow it to go below zero though:
2122 if (unlikely((long)sum < 0))
2128 unsigned long long nr_context_switches(void)
2131 unsigned long long sum = 0;
2133 for_each_possible_cpu(i)
2134 sum += cpu_rq(i)->nr_switches;
2139 unsigned long nr_iowait(void)
2141 unsigned long i, sum = 0;
2143 for_each_possible_cpu(i)
2144 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2149 unsigned long nr_iowait_cpu(int cpu)
2151 struct rq *this = cpu_rq(cpu);
2152 return atomic_read(&this->nr_iowait);
2155 unsigned long this_cpu_load(void)
2157 struct rq *this = this_rq();
2158 return this->cpu_load[0];
2162 /* Variables and functions for calc_load */
2163 static atomic_long_t calc_load_tasks;
2164 static unsigned long calc_load_update;
2165 unsigned long avenrun[3];
2166 EXPORT_SYMBOL(avenrun);
2168 static long calc_load_fold_active(struct rq *this_rq)
2170 long nr_active, delta = 0;
2172 nr_active = this_rq->nr_running;
2173 nr_active += (long) this_rq->nr_uninterruptible;
2175 if (nr_active != this_rq->calc_load_active) {
2176 delta = nr_active - this_rq->calc_load_active;
2177 this_rq->calc_load_active = nr_active;
2183 static unsigned long
2184 calc_load(unsigned long load, unsigned long exp, unsigned long active)
2187 load += active * (FIXED_1 - exp);
2188 load += 1UL << (FSHIFT - 1);
2189 return load >> FSHIFT;
2194 * For NO_HZ we delay the active fold to the next LOAD_FREQ update.
2196 * When making the ILB scale, we should try to pull this in as well.
2198 static atomic_long_t calc_load_tasks_idle;
2200 void calc_load_account_idle(struct rq *this_rq)
2204 delta = calc_load_fold_active(this_rq);
2206 atomic_long_add(delta, &calc_load_tasks_idle);
2209 static long calc_load_fold_idle(void)
2214 * Its got a race, we don't care...
2216 if (atomic_long_read(&calc_load_tasks_idle))
2217 delta = atomic_long_xchg(&calc_load_tasks_idle, 0);
2223 * fixed_power_int - compute: x^n, in O(log n) time
2225 * @x: base of the power
2226 * @frac_bits: fractional bits of @x
2227 * @n: power to raise @x to.
2229 * By exploiting the relation between the definition of the natural power
2230 * function: x^n := x*x*...*x (x multiplied by itself for n times), and
2231 * the binary encoding of numbers used by computers: n := \Sum n_i * 2^i,
2232 * (where: n_i \elem {0, 1}, the binary vector representing n),
2233 * we find: x^n := x^(\Sum n_i * 2^i) := \Prod x^(n_i * 2^i), which is
2234 * of course trivially computable in O(log_2 n), the length of our binary
2237 static unsigned long
2238 fixed_power_int(unsigned long x, unsigned int frac_bits, unsigned int n)
2240 unsigned long result = 1UL << frac_bits;
2245 result += 1UL << (frac_bits - 1);
2246 result >>= frac_bits;
2252 x += 1UL << (frac_bits - 1);
2260 * a1 = a0 * e + a * (1 - e)
2262 * a2 = a1 * e + a * (1 - e)
2263 * = (a0 * e + a * (1 - e)) * e + a * (1 - e)
2264 * = a0 * e^2 + a * (1 - e) * (1 + e)
2266 * a3 = a2 * e + a * (1 - e)
2267 * = (a0 * e^2 + a * (1 - e) * (1 + e)) * e + a * (1 - e)
2268 * = a0 * e^3 + a * (1 - e) * (1 + e + e^2)
2272 * an = a0 * e^n + a * (1 - e) * (1 + e + ... + e^n-1) [1]
2273 * = a0 * e^n + a * (1 - e) * (1 - e^n)/(1 - e)
2274 * = a0 * e^n + a * (1 - e^n)
2276 * [1] application of the geometric series:
2279 * S_n := \Sum x^i = -------------
2282 static unsigned long
2283 calc_load_n(unsigned long load, unsigned long exp,
2284 unsigned long active, unsigned int n)
2287 return calc_load(load, fixed_power_int(exp, FSHIFT, n), active);
2291 * NO_HZ can leave us missing all per-cpu ticks calling
2292 * calc_load_account_active(), but since an idle CPU folds its delta into
2293 * calc_load_tasks_idle per calc_load_account_idle(), all we need to do is fold
2294 * in the pending idle delta if our idle period crossed a load cycle boundary.
2296 * Once we've updated the global active value, we need to apply the exponential
2297 * weights adjusted to the number of cycles missed.
2299 static void calc_global_nohz(void)
2301 long delta, active, n;
2304 * If we crossed a calc_load_update boundary, make sure to fold
2305 * any pending idle changes, the respective CPUs might have
2306 * missed the tick driven calc_load_account_active() update
2309 delta = calc_load_fold_idle();
2311 atomic_long_add(delta, &calc_load_tasks);
2314 * It could be the one fold was all it took, we done!
2316 if (time_before(jiffies, calc_load_update + 10))
2320 * Catch-up, fold however many we are behind still
2322 delta = jiffies - calc_load_update - 10;
2323 n = 1 + (delta / LOAD_FREQ);
2325 active = atomic_long_read(&calc_load_tasks);
2326 active = active > 0 ? active * FIXED_1 : 0;
2328 avenrun[0] = calc_load_n(avenrun[0], EXP_1, active, n);
2329 avenrun[1] = calc_load_n(avenrun[1], EXP_5, active, n);
2330 avenrun[2] = calc_load_n(avenrun[2], EXP_15, active, n);
2332 calc_load_update += n * LOAD_FREQ;
2335 void calc_load_account_idle(struct rq *this_rq)
2339 static inline long calc_load_fold_idle(void)
2344 static void calc_global_nohz(void)
2350 * get_avenrun - get the load average array
2351 * @loads: pointer to dest load array
2352 * @offset: offset to add
2353 * @shift: shift count to shift the result left
2355 * These values are estimates at best, so no need for locking.
2357 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
2359 loads[0] = (avenrun[0] + offset) << shift;
2360 loads[1] = (avenrun[1] + offset) << shift;
2361 loads[2] = (avenrun[2] + offset) << shift;
2365 * calc_load - update the avenrun load estimates 10 ticks after the
2366 * CPUs have updated calc_load_tasks.
2368 void calc_global_load(unsigned long ticks)
2372 if (time_before(jiffies, calc_load_update + 10))
2375 active = atomic_long_read(&calc_load_tasks);
2376 active = active > 0 ? active * FIXED_1 : 0;
2378 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
2379 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
2380 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
2382 calc_load_update += LOAD_FREQ;
2385 * Account one period with whatever state we found before
2386 * folding in the nohz state and ageing the entire idle period.
2388 * This avoids loosing a sample when we go idle between
2389 * calc_load_account_active() (10 ticks ago) and now and thus
2396 * Called from update_cpu_load() to periodically update this CPU's
2399 static void calc_load_account_active(struct rq *this_rq)
2403 if (time_before(jiffies, this_rq->calc_load_update))
2406 delta = calc_load_fold_active(this_rq);
2407 delta += calc_load_fold_idle();
2409 atomic_long_add(delta, &calc_load_tasks);
2411 this_rq->calc_load_update += LOAD_FREQ;
2415 * The exact cpuload at various idx values, calculated at every tick would be
2416 * load = (2^idx - 1) / 2^idx * load + 1 / 2^idx * cur_load
2418 * If a cpu misses updates for n-1 ticks (as it was idle) and update gets called
2419 * on nth tick when cpu may be busy, then we have:
2420 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
2421 * load = (2^idx - 1) / 2^idx) * load + 1 / 2^idx * cur_load
2423 * decay_load_missed() below does efficient calculation of
2424 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
2425 * avoiding 0..n-1 loop doing load = ((2^idx - 1) / 2^idx) * load
2427 * The calculation is approximated on a 128 point scale.
2428 * degrade_zero_ticks is the number of ticks after which load at any
2429 * particular idx is approximated to be zero.
2430 * degrade_factor is a precomputed table, a row for each load idx.
2431 * Each column corresponds to degradation factor for a power of two ticks,
2432 * based on 128 point scale.
2434 * row 2, col 3 (=12) says that the degradation at load idx 2 after
2435 * 8 ticks is 12/128 (which is an approximation of exact factor 3^8/4^8).
2437 * With this power of 2 load factors, we can degrade the load n times
2438 * by looking at 1 bits in n and doing as many mult/shift instead of
2439 * n mult/shifts needed by the exact degradation.
2441 #define DEGRADE_SHIFT 7
2442 static const unsigned char
2443 degrade_zero_ticks[CPU_LOAD_IDX_MAX] = {0, 8, 32, 64, 128};
2444 static const unsigned char
2445 degrade_factor[CPU_LOAD_IDX_MAX][DEGRADE_SHIFT + 1] = {
2446 {0, 0, 0, 0, 0, 0, 0, 0},
2447 {64, 32, 8, 0, 0, 0, 0, 0},
2448 {96, 72, 40, 12, 1, 0, 0},
2449 {112, 98, 75, 43, 15, 1, 0},
2450 {120, 112, 98, 76, 45, 16, 2} };
2453 * Update cpu_load for any missed ticks, due to tickless idle. The backlog
2454 * would be when CPU is idle and so we just decay the old load without
2455 * adding any new load.
2457 static unsigned long
2458 decay_load_missed(unsigned long load, unsigned long missed_updates, int idx)
2462 if (!missed_updates)
2465 if (missed_updates >= degrade_zero_ticks[idx])
2469 return load >> missed_updates;
2471 while (missed_updates) {
2472 if (missed_updates % 2)
2473 load = (load * degrade_factor[idx][j]) >> DEGRADE_SHIFT;
2475 missed_updates >>= 1;
2482 * Update rq->cpu_load[] statistics. This function is usually called every
2483 * scheduler tick (TICK_NSEC). With tickless idle this will not be called
2484 * every tick. We fix it up based on jiffies.
2486 void update_cpu_load(struct rq *this_rq)
2488 unsigned long this_load = this_rq->load.weight;
2489 unsigned long curr_jiffies = jiffies;
2490 unsigned long pending_updates;
2493 this_rq->nr_load_updates++;
2495 /* Avoid repeated calls on same jiffy, when moving in and out of idle */
2496 if (curr_jiffies == this_rq->last_load_update_tick)
2499 pending_updates = curr_jiffies - this_rq->last_load_update_tick;
2500 this_rq->last_load_update_tick = curr_jiffies;
2502 /* Update our load: */
2503 this_rq->cpu_load[0] = this_load; /* Fasttrack for idx 0 */
2504 for (i = 1, scale = 2; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
2505 unsigned long old_load, new_load;
2507 /* scale is effectively 1 << i now, and >> i divides by scale */
2509 old_load = this_rq->cpu_load[i];
2510 old_load = decay_load_missed(old_load, pending_updates - 1, i);
2511 new_load = this_load;
2513 * Round up the averaging division if load is increasing. This
2514 * prevents us from getting stuck on 9 if the load is 10, for
2517 if (new_load > old_load)
2518 new_load += scale - 1;
2520 this_rq->cpu_load[i] = (old_load * (scale - 1) + new_load) >> i;
2523 sched_avg_update(this_rq);
2526 static void update_cpu_load_active(struct rq *this_rq)
2528 update_cpu_load(this_rq);
2530 calc_load_account_active(this_rq);
2536 * sched_exec - execve() is a valuable balancing opportunity, because at
2537 * this point the task has the smallest effective memory and cache footprint.
2539 void sched_exec(void)
2541 struct task_struct *p = current;
2542 unsigned long flags;
2545 raw_spin_lock_irqsave(&p->pi_lock, flags);
2546 dest_cpu = p->sched_class->select_task_rq(p, SD_BALANCE_EXEC, 0);
2547 if (dest_cpu == smp_processor_id())
2550 if (likely(cpu_active(dest_cpu))) {
2551 struct migration_arg arg = { p, dest_cpu };
2553 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2554 stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg);
2558 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2563 DEFINE_PER_CPU(struct kernel_stat, kstat);
2564 DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat);
2566 EXPORT_PER_CPU_SYMBOL(kstat);
2567 EXPORT_PER_CPU_SYMBOL(kernel_cpustat);
2570 * Return any ns on the sched_clock that have not yet been accounted in
2571 * @p in case that task is currently running.
2573 * Called with task_rq_lock() held on @rq.
2575 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
2579 if (task_current(rq, p)) {
2580 update_rq_clock(rq);
2581 ns = rq->clock_task - p->se.exec_start;
2589 unsigned long long task_delta_exec(struct task_struct *p)
2591 unsigned long flags;
2595 rq = task_rq_lock(p, &flags);
2596 ns = do_task_delta_exec(p, rq);
2597 task_rq_unlock(rq, p, &flags);
2603 * Return accounted runtime for the task.
2604 * In case the task is currently running, return the runtime plus current's
2605 * pending runtime that have not been accounted yet.
2607 unsigned long long task_sched_runtime(struct task_struct *p)
2609 unsigned long flags;
2613 rq = task_rq_lock(p, &flags);
2614 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
2615 task_rq_unlock(rq, p, &flags);
2620 #ifdef CONFIG_CGROUP_CPUACCT
2621 struct cgroup_subsys cpuacct_subsys;
2622 struct cpuacct root_cpuacct;
2625 static inline void task_group_account_field(struct task_struct *p, int index,
2628 #ifdef CONFIG_CGROUP_CPUACCT
2629 struct kernel_cpustat *kcpustat;
2633 * Since all updates are sure to touch the root cgroup, we
2634 * get ourselves ahead and touch it first. If the root cgroup
2635 * is the only cgroup, then nothing else should be necessary.
2638 __get_cpu_var(kernel_cpustat).cpustat[index] += tmp;
2640 #ifdef CONFIG_CGROUP_CPUACCT
2641 if (unlikely(!cpuacct_subsys.active))
2646 while (ca && (ca != &root_cpuacct)) {
2647 kcpustat = this_cpu_ptr(ca->cpustat);
2648 kcpustat->cpustat[index] += tmp;
2657 * Account user cpu time to a process.
2658 * @p: the process that the cpu time gets accounted to
2659 * @cputime: the cpu time spent in user space since the last update
2660 * @cputime_scaled: cputime scaled by cpu frequency
2662 void account_user_time(struct task_struct *p, cputime_t cputime,
2663 cputime_t cputime_scaled)
2667 /* Add user time to process. */
2668 p->utime += cputime;
2669 p->utimescaled += cputime_scaled;
2670 account_group_user_time(p, cputime);
2672 index = (TASK_NICE(p) > 0) ? CPUTIME_NICE : CPUTIME_USER;
2674 /* Add user time to cpustat. */
2675 task_group_account_field(p, index, (__force u64) cputime);
2677 /* Account for user time used */
2678 acct_update_integrals(p);
2682 * Account guest cpu time to a process.
2683 * @p: the process that the cpu time gets accounted to
2684 * @cputime: the cpu time spent in virtual machine since the last update
2685 * @cputime_scaled: cputime scaled by cpu frequency
2687 static void account_guest_time(struct task_struct *p, cputime_t cputime,
2688 cputime_t cputime_scaled)
2690 u64 *cpustat = kcpustat_this_cpu->cpustat;
2692 /* Add guest time to process. */
2693 p->utime += cputime;
2694 p->utimescaled += cputime_scaled;
2695 account_group_user_time(p, cputime);
2696 p->gtime += cputime;
2698 /* Add guest time to cpustat. */
2699 if (TASK_NICE(p) > 0) {
2700 cpustat[CPUTIME_NICE] += (__force u64) cputime;
2701 cpustat[CPUTIME_GUEST_NICE] += (__force u64) cputime;
2703 cpustat[CPUTIME_USER] += (__force u64) cputime;
2704 cpustat[CPUTIME_GUEST] += (__force u64) cputime;
2709 * Account system cpu time to a process and desired cpustat field
2710 * @p: the process that the cpu time gets accounted to
2711 * @cputime: the cpu time spent in kernel space since the last update
2712 * @cputime_scaled: cputime scaled by cpu frequency
2713 * @target_cputime64: pointer to cpustat field that has to be updated
2716 void __account_system_time(struct task_struct *p, cputime_t cputime,
2717 cputime_t cputime_scaled, int index)
2719 /* Add system time to process. */
2720 p->stime += cputime;
2721 p->stimescaled += cputime_scaled;
2722 account_group_system_time(p, cputime);
2724 /* Add system time to cpustat. */
2725 task_group_account_field(p, index, (__force u64) cputime);
2727 /* Account for system time used */
2728 acct_update_integrals(p);
2732 * Account system cpu time to a process.
2733 * @p: the process that the cpu time gets accounted to
2734 * @hardirq_offset: the offset to subtract from hardirq_count()
2735 * @cputime: the cpu time spent in kernel space since the last update
2736 * @cputime_scaled: cputime scaled by cpu frequency
2738 void account_system_time(struct task_struct *p, int hardirq_offset,
2739 cputime_t cputime, cputime_t cputime_scaled)
2743 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
2744 account_guest_time(p, cputime, cputime_scaled);
2748 if (hardirq_count() - hardirq_offset)
2749 index = CPUTIME_IRQ;
2750 else if (in_serving_softirq())
2751 index = CPUTIME_SOFTIRQ;
2753 index = CPUTIME_SYSTEM;
2755 __account_system_time(p, cputime, cputime_scaled, index);
2759 * Account for involuntary wait time.
2760 * @cputime: the cpu time spent in involuntary wait
2762 void account_steal_time(cputime_t cputime)
2764 u64 *cpustat = kcpustat_this_cpu->cpustat;
2766 cpustat[CPUTIME_STEAL] += (__force u64) cputime;
2770 * Account for idle time.
2771 * @cputime: the cpu time spent in idle wait
2773 void account_idle_time(cputime_t cputime)
2775 u64 *cpustat = kcpustat_this_cpu->cpustat;
2776 struct rq *rq = this_rq();
2778 if (atomic_read(&rq->nr_iowait) > 0)
2779 cpustat[CPUTIME_IOWAIT] += (__force u64) cputime;
2781 cpustat[CPUTIME_IDLE] += (__force u64) cputime;
2784 static __always_inline bool steal_account_process_tick(void)
2786 #ifdef CONFIG_PARAVIRT
2787 if (static_branch(¶virt_steal_enabled)) {
2790 steal = paravirt_steal_clock(smp_processor_id());
2791 steal -= this_rq()->prev_steal_time;
2793 st = steal_ticks(steal);
2794 this_rq()->prev_steal_time += st * TICK_NSEC;
2796 account_steal_time(st);
2803 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
2805 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
2807 * Account a tick to a process and cpustat
2808 * @p: the process that the cpu time gets accounted to
2809 * @user_tick: is the tick from userspace
2810 * @rq: the pointer to rq
2812 * Tick demultiplexing follows the order
2813 * - pending hardirq update
2814 * - pending softirq update
2818 * - check for guest_time
2819 * - else account as system_time
2821 * Check for hardirq is done both for system and user time as there is
2822 * no timer going off while we are on hardirq and hence we may never get an
2823 * opportunity to update it solely in system time.
2824 * p->stime and friends are only updated on system time and not on irq
2825 * softirq as those do not count in task exec_runtime any more.
2827 static void irqtime_account_process_tick(struct task_struct *p, int user_tick,
2830 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
2831 u64 *cpustat = kcpustat_this_cpu->cpustat;
2833 if (steal_account_process_tick())
2836 if (irqtime_account_hi_update()) {
2837 cpustat[CPUTIME_IRQ] += (__force u64) cputime_one_jiffy;
2838 } else if (irqtime_account_si_update()) {
2839 cpustat[CPUTIME_SOFTIRQ] += (__force u64) cputime_one_jiffy;
2840 } else if (this_cpu_ksoftirqd() == p) {
2842 * ksoftirqd time do not get accounted in cpu_softirq_time.
2843 * So, we have to handle it separately here.
2844 * Also, p->stime needs to be updated for ksoftirqd.
2846 __account_system_time(p, cputime_one_jiffy, one_jiffy_scaled,
2848 } else if (user_tick) {
2849 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
2850 } else if (p == rq->idle) {
2851 account_idle_time(cputime_one_jiffy);
2852 } else if (p->flags & PF_VCPU) { /* System time or guest time */
2853 account_guest_time(p, cputime_one_jiffy, one_jiffy_scaled);
2855 __account_system_time(p, cputime_one_jiffy, one_jiffy_scaled,
2860 static void irqtime_account_idle_ticks(int ticks)
2863 struct rq *rq = this_rq();
2865 for (i = 0; i < ticks; i++)
2866 irqtime_account_process_tick(current, 0, rq);
2868 #else /* CONFIG_IRQ_TIME_ACCOUNTING */
2869 static void irqtime_account_idle_ticks(int ticks) {}
2870 static void irqtime_account_process_tick(struct task_struct *p, int user_tick,
2872 #endif /* CONFIG_IRQ_TIME_ACCOUNTING */
2875 * Account a single tick of cpu time.
2876 * @p: the process that the cpu time gets accounted to
2877 * @user_tick: indicates if the tick is a user or a system tick
2879 void account_process_tick(struct task_struct *p, int user_tick)
2881 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
2882 struct rq *rq = this_rq();
2884 if (sched_clock_irqtime) {
2885 irqtime_account_process_tick(p, user_tick, rq);
2889 if (steal_account_process_tick())
2893 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
2894 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
2895 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
2898 account_idle_time(cputime_one_jiffy);
2902 * Account multiple ticks of steal time.
2903 * @p: the process from which the cpu time has been stolen
2904 * @ticks: number of stolen ticks
2906 void account_steal_ticks(unsigned long ticks)
2908 account_steal_time(jiffies_to_cputime(ticks));
2912 * Account multiple ticks of idle time.
2913 * @ticks: number of stolen ticks
2915 void account_idle_ticks(unsigned long ticks)
2918 if (sched_clock_irqtime) {
2919 irqtime_account_idle_ticks(ticks);
2923 account_idle_time(jiffies_to_cputime(ticks));
2929 * Use precise platform statistics if available:
2931 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
2932 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2938 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2940 struct task_cputime cputime;
2942 thread_group_cputime(p, &cputime);
2944 *ut = cputime.utime;
2945 *st = cputime.stime;
2949 #ifndef nsecs_to_cputime
2950 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
2953 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2955 cputime_t rtime, utime = p->utime, total = utime + p->stime;
2958 * Use CFS's precise accounting:
2960 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
2963 u64 temp = (__force u64) rtime;
2965 temp *= (__force u64) utime;
2966 do_div(temp, (__force u32) total);
2967 utime = (__force cputime_t) temp;
2972 * Compare with previous values, to keep monotonicity:
2974 p->prev_utime = max(p->prev_utime, utime);
2975 p->prev_stime = max(p->prev_stime, rtime - p->prev_utime);
2977 *ut = p->prev_utime;
2978 *st = p->prev_stime;
2982 * Must be called with siglock held.
2984 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2986 struct signal_struct *sig = p->signal;
2987 struct task_cputime cputime;
2988 cputime_t rtime, utime, total;
2990 thread_group_cputime(p, &cputime);
2992 total = cputime.utime + cputime.stime;
2993 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
2996 u64 temp = (__force u64) rtime;
2998 temp *= (__force u64) cputime.utime;
2999 do_div(temp, (__force u32) total);
3000 utime = (__force cputime_t) temp;
3004 sig->prev_utime = max(sig->prev_utime, utime);
3005 sig->prev_stime = max(sig->prev_stime, rtime - sig->prev_utime);
3007 *ut = sig->prev_utime;
3008 *st = sig->prev_stime;
3013 * This function gets called by the timer code, with HZ frequency.
3014 * We call it with interrupts disabled.
3016 void scheduler_tick(void)
3018 int cpu = smp_processor_id();
3019 struct rq *rq = cpu_rq(cpu);
3020 struct task_struct *curr = rq->curr;
3024 raw_spin_lock(&rq->lock);
3025 update_rq_clock(rq);
3026 update_cpu_load_active(rq);
3027 curr->sched_class->task_tick(rq, curr, 0);
3028 raw_spin_unlock(&rq->lock);
3030 perf_event_task_tick();
3033 rq->idle_balance = idle_cpu(cpu);
3034 trigger_load_balance(rq, cpu);
3038 notrace unsigned long get_parent_ip(unsigned long addr)
3040 if (in_lock_functions(addr)) {
3041 addr = CALLER_ADDR2;
3042 if (in_lock_functions(addr))
3043 addr = CALLER_ADDR3;
3048 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
3049 defined(CONFIG_PREEMPT_TRACER))
3051 void __kprobes add_preempt_count(int val)
3053 #ifdef CONFIG_DEBUG_PREEMPT
3057 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3060 preempt_count() += val;
3061 #ifdef CONFIG_DEBUG_PREEMPT
3063 * Spinlock count overflowing soon?
3065 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
3068 if (preempt_count() == val)
3069 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3071 EXPORT_SYMBOL(add_preempt_count);
3073 void __kprobes sub_preempt_count(int val)
3075 #ifdef CONFIG_DEBUG_PREEMPT
3079 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
3082 * Is the spinlock portion underflowing?
3084 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
3085 !(preempt_count() & PREEMPT_MASK)))
3089 if (preempt_count() == val)
3090 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3091 preempt_count() -= val;
3093 EXPORT_SYMBOL(sub_preempt_count);
3098 * Print scheduling while atomic bug:
3100 static noinline void __schedule_bug(struct task_struct *prev)
3102 if (oops_in_progress)
3105 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
3106 prev->comm, prev->pid, preempt_count());
3108 debug_show_held_locks(prev);
3110 if (irqs_disabled())
3111 print_irqtrace_events(prev);
3116 * Various schedule()-time debugging checks and statistics:
3118 static inline void schedule_debug(struct task_struct *prev)
3121 * Test if we are atomic. Since do_exit() needs to call into
3122 * schedule() atomically, we ignore that path for now.
3123 * Otherwise, whine if we are scheduling when we should not be.
3125 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
3126 __schedule_bug(prev);
3129 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
3131 schedstat_inc(this_rq(), sched_count);
3134 static void put_prev_task(struct rq *rq, struct task_struct *prev)
3136 if (prev->on_rq || rq->skip_clock_update < 0)
3137 update_rq_clock(rq);
3138 prev->sched_class->put_prev_task(rq, prev);
3142 * Pick up the highest-prio task:
3144 static inline struct task_struct *
3145 pick_next_task(struct rq *rq)
3147 const struct sched_class *class;
3148 struct task_struct *p;
3151 * Optimization: we know that if all tasks are in
3152 * the fair class we can call that function directly:
3154 if (likely(rq->nr_running == rq->cfs.h_nr_running)) {
3155 p = fair_sched_class.pick_next_task(rq);
3160 for_each_class(class) {
3161 p = class->pick_next_task(rq);
3166 BUG(); /* the idle class will always have a runnable task */
3170 * __schedule() is the main scheduler function.
3172 static void __sched __schedule(void)
3174 struct task_struct *prev, *next;
3175 unsigned long *switch_count;
3181 cpu = smp_processor_id();
3183 rcu_note_context_switch(cpu);
3186 schedule_debug(prev);
3188 if (sched_feat(HRTICK))
3191 raw_spin_lock_irq(&rq->lock);
3193 switch_count = &prev->nivcsw;
3194 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
3195 if (unlikely(signal_pending_state(prev->state, prev))) {
3196 prev->state = TASK_RUNNING;
3198 deactivate_task(rq, prev, DEQUEUE_SLEEP);
3202 * If a worker went to sleep, notify and ask workqueue
3203 * whether it wants to wake up a task to maintain
3206 if (prev->flags & PF_WQ_WORKER) {
3207 struct task_struct *to_wakeup;
3209 to_wakeup = wq_worker_sleeping(prev, cpu);
3211 try_to_wake_up_local(to_wakeup);
3214 switch_count = &prev->nvcsw;
3217 pre_schedule(rq, prev);
3219 if (unlikely(!rq->nr_running))
3220 idle_balance(cpu, rq);
3222 put_prev_task(rq, prev);
3223 next = pick_next_task(rq);
3224 clear_tsk_need_resched(prev);
3225 rq->skip_clock_update = 0;
3227 if (likely(prev != next)) {
3232 context_switch(rq, prev, next); /* unlocks the rq */
3234 * The context switch have flipped the stack from under us
3235 * and restored the local variables which were saved when
3236 * this task called schedule() in the past. prev == current
3237 * is still correct, but it can be moved to another cpu/rq.
3239 cpu = smp_processor_id();
3242 raw_spin_unlock_irq(&rq->lock);
3246 sched_preempt_enable_no_resched();
3251 static inline void sched_submit_work(struct task_struct *tsk)
3253 if (!tsk->state || tsk_is_pi_blocked(tsk))
3256 * If we are going to sleep and we have plugged IO queued,
3257 * make sure to submit it to avoid deadlocks.
3259 if (blk_needs_flush_plug(tsk))
3260 blk_schedule_flush_plug(tsk);
3263 asmlinkage void __sched schedule(void)
3265 struct task_struct *tsk = current;
3267 sched_submit_work(tsk);
3270 EXPORT_SYMBOL(schedule);
3273 * schedule_preempt_disabled - called with preemption disabled
3275 * Returns with preemption disabled. Note: preempt_count must be 1
3277 void __sched schedule_preempt_disabled(void)
3279 sched_preempt_enable_no_resched();
3284 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
3286 static inline bool owner_running(struct mutex *lock, struct task_struct *owner)
3288 if (lock->owner != owner)
3292 * Ensure we emit the owner->on_cpu, dereference _after_ checking
3293 * lock->owner still matches owner, if that fails, owner might
3294 * point to free()d memory, if it still matches, the rcu_read_lock()
3295 * ensures the memory stays valid.
3299 return owner->on_cpu;
3303 * Look out! "owner" is an entirely speculative pointer
3304 * access and not reliable.
3306 int mutex_spin_on_owner(struct mutex *lock, struct task_struct *owner)
3308 if (!sched_feat(OWNER_SPIN))
3312 while (owner_running(lock, owner)) {
3316 arch_mutex_cpu_relax();
3321 * We break out the loop above on need_resched() and when the
3322 * owner changed, which is a sign for heavy contention. Return
3323 * success only when lock->owner is NULL.
3325 return lock->owner == NULL;
3329 #ifdef CONFIG_PREEMPT
3331 * this is the entry point to schedule() from in-kernel preemption
3332 * off of preempt_enable. Kernel preemptions off return from interrupt
3333 * occur there and call schedule directly.
3335 asmlinkage void __sched notrace preempt_schedule(void)
3337 struct thread_info *ti = current_thread_info();
3340 * If there is a non-zero preempt_count or interrupts are disabled,
3341 * we do not want to preempt the current task. Just return..
3343 if (likely(ti->preempt_count || irqs_disabled()))
3347 add_preempt_count_notrace(PREEMPT_ACTIVE);
3349 sub_preempt_count_notrace(PREEMPT_ACTIVE);
3352 * Check again in case we missed a preemption opportunity
3353 * between schedule and now.
3356 } while (need_resched());
3358 EXPORT_SYMBOL(preempt_schedule);
3361 * this is the entry point to schedule() from kernel preemption
3362 * off of irq context.
3363 * Note, that this is called and return with irqs disabled. This will
3364 * protect us against recursive calling from irq.
3366 asmlinkage void __sched preempt_schedule_irq(void)
3368 struct thread_info *ti = current_thread_info();
3370 /* Catch callers which need to be fixed */
3371 BUG_ON(ti->preempt_count || !irqs_disabled());
3374 add_preempt_count(PREEMPT_ACTIVE);
3377 local_irq_disable();
3378 sub_preempt_count(PREEMPT_ACTIVE);
3381 * Check again in case we missed a preemption opportunity
3382 * between schedule and now.
3385 } while (need_resched());
3388 #endif /* CONFIG_PREEMPT */
3390 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3393 return try_to_wake_up(curr->private, mode, wake_flags);
3395 EXPORT_SYMBOL(default_wake_function);
3398 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
3399 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
3400 * number) then we wake all the non-exclusive tasks and one exclusive task.
3402 * There are circumstances in which we can try to wake a task which has already
3403 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
3404 * zero in this (rare) case, and we handle it by continuing to scan the queue.
3406 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
3407 int nr_exclusive, int wake_flags, void *key)
3409 wait_queue_t *curr, *next;
3411 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
3412 unsigned flags = curr->flags;
3414 if (curr->func(curr, mode, wake_flags, key) &&
3415 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
3421 * __wake_up - wake up threads blocked on a waitqueue.
3423 * @mode: which threads
3424 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3425 * @key: is directly passed to the wakeup function
3427 * It may be assumed that this function implies a write memory barrier before
3428 * changing the task state if and only if any tasks are woken up.
3430 void __wake_up(wait_queue_head_t *q, unsigned int mode,
3431 int nr_exclusive, void *key)
3433 unsigned long flags;
3435 spin_lock_irqsave(&q->lock, flags);
3436 __wake_up_common(q, mode, nr_exclusive, 0, key);
3437 spin_unlock_irqrestore(&q->lock, flags);
3439 EXPORT_SYMBOL(__wake_up);
3442 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
3444 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode, int nr)
3446 __wake_up_common(q, mode, nr, 0, NULL);
3448 EXPORT_SYMBOL_GPL(__wake_up_locked);
3450 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
3452 __wake_up_common(q, mode, 1, 0, key);
3454 EXPORT_SYMBOL_GPL(__wake_up_locked_key);
3457 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
3459 * @mode: which threads
3460 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3461 * @key: opaque value to be passed to wakeup targets
3463 * The sync wakeup differs that the waker knows that it will schedule
3464 * away soon, so while the target thread will be woken up, it will not
3465 * be migrated to another CPU - ie. the two threads are 'synchronized'
3466 * with each other. This can prevent needless bouncing between CPUs.
3468 * On UP it can prevent extra preemption.
3470 * It may be assumed that this function implies a write memory barrier before
3471 * changing the task state if and only if any tasks are woken up.
3473 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
3474 int nr_exclusive, void *key)
3476 unsigned long flags;
3477 int wake_flags = WF_SYNC;
3482 if (unlikely(!nr_exclusive))
3485 spin_lock_irqsave(&q->lock, flags);
3486 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
3487 spin_unlock_irqrestore(&q->lock, flags);
3489 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
3492 * __wake_up_sync - see __wake_up_sync_key()
3494 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
3496 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
3498 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
3501 * complete: - signals a single thread waiting on this completion
3502 * @x: holds the state of this particular completion
3504 * This will wake up a single thread waiting on this completion. Threads will be
3505 * awakened in the same order in which they were queued.
3507 * See also complete_all(), wait_for_completion() and related routines.
3509 * It may be assumed that this function implies a write memory barrier before
3510 * changing the task state if and only if any tasks are woken up.
3512 void complete(struct completion *x)
3514 unsigned long flags;
3516 spin_lock_irqsave(&x->wait.lock, flags);
3518 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
3519 spin_unlock_irqrestore(&x->wait.lock, flags);
3521 EXPORT_SYMBOL(complete);
3524 * complete_all: - signals all threads waiting on this completion
3525 * @x: holds the state of this particular completion
3527 * This will wake up all threads waiting on this particular completion event.
3529 * It may be assumed that this function implies a write memory barrier before
3530 * changing the task state if and only if any tasks are woken up.
3532 void complete_all(struct completion *x)
3534 unsigned long flags;
3536 spin_lock_irqsave(&x->wait.lock, flags);
3537 x->done += UINT_MAX/2;
3538 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
3539 spin_unlock_irqrestore(&x->wait.lock, flags);
3541 EXPORT_SYMBOL(complete_all);
3543 static inline long __sched
3544 do_wait_for_common(struct completion *x, long timeout, int state)
3547 DECLARE_WAITQUEUE(wait, current);
3549 __add_wait_queue_tail_exclusive(&x->wait, &wait);
3551 if (signal_pending_state(state, current)) {
3552 timeout = -ERESTARTSYS;
3555 __set_current_state(state);
3556 spin_unlock_irq(&x->wait.lock);
3557 timeout = schedule_timeout(timeout);
3558 spin_lock_irq(&x->wait.lock);
3559 } while (!x->done && timeout);
3560 __remove_wait_queue(&x->wait, &wait);
3565 return timeout ?: 1;
3569 wait_for_common(struct completion *x, long timeout, int state)
3573 spin_lock_irq(&x->wait.lock);
3574 timeout = do_wait_for_common(x, timeout, state);
3575 spin_unlock_irq(&x->wait.lock);
3580 * wait_for_completion: - waits for completion of a task
3581 * @x: holds the state of this particular completion
3583 * This waits to be signaled for completion of a specific task. It is NOT
3584 * interruptible and there is no timeout.
3586 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
3587 * and interrupt capability. Also see complete().
3589 void __sched wait_for_completion(struct completion *x)
3591 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
3593 EXPORT_SYMBOL(wait_for_completion);
3596 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
3597 * @x: holds the state of this particular completion
3598 * @timeout: timeout value in jiffies
3600 * This waits for either a completion of a specific task to be signaled or for a
3601 * specified timeout to expire. The timeout is in jiffies. It is not
3604 * The return value is 0 if timed out, and positive (at least 1, or number of
3605 * jiffies left till timeout) if completed.
3607 unsigned long __sched
3608 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
3610 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
3612 EXPORT_SYMBOL(wait_for_completion_timeout);
3615 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
3616 * @x: holds the state of this particular completion
3618 * This waits for completion of a specific task to be signaled. It is
3621 * The return value is -ERESTARTSYS if interrupted, 0 if completed.
3623 int __sched wait_for_completion_interruptible(struct completion *x)
3625 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
3626 if (t == -ERESTARTSYS)
3630 EXPORT_SYMBOL(wait_for_completion_interruptible);
3633 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
3634 * @x: holds the state of this particular completion
3635 * @timeout: timeout value in jiffies
3637 * This waits for either a completion of a specific task to be signaled or for a
3638 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
3640 * The return value is -ERESTARTSYS if interrupted, 0 if timed out,
3641 * positive (at least 1, or number of jiffies left till timeout) if completed.
3644 wait_for_completion_interruptible_timeout(struct completion *x,
3645 unsigned long timeout)
3647 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
3649 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
3652 * wait_for_completion_killable: - waits for completion of a task (killable)
3653 * @x: holds the state of this particular completion
3655 * This waits to be signaled for completion of a specific task. It can be
3656 * interrupted by a kill signal.
3658 * The return value is -ERESTARTSYS if interrupted, 0 if completed.
3660 int __sched wait_for_completion_killable(struct completion *x)
3662 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
3663 if (t == -ERESTARTSYS)
3667 EXPORT_SYMBOL(wait_for_completion_killable);
3670 * wait_for_completion_killable_timeout: - waits for completion of a task (w/(to,killable))
3671 * @x: holds the state of this particular completion
3672 * @timeout: timeout value in jiffies
3674 * This waits for either a completion of a specific task to be
3675 * signaled or for a specified timeout to expire. It can be
3676 * interrupted by a kill signal. The timeout is in jiffies.
3678 * The return value is -ERESTARTSYS if interrupted, 0 if timed out,
3679 * positive (at least 1, or number of jiffies left till timeout) if completed.
3682 wait_for_completion_killable_timeout(struct completion *x,
3683 unsigned long timeout)
3685 return wait_for_common(x, timeout, TASK_KILLABLE);
3687 EXPORT_SYMBOL(wait_for_completion_killable_timeout);
3690 * try_wait_for_completion - try to decrement a completion without blocking
3691 * @x: completion structure
3693 * Returns: 0 if a decrement cannot be done without blocking
3694 * 1 if a decrement succeeded.
3696 * If a completion is being used as a counting completion,
3697 * attempt to decrement the counter without blocking. This
3698 * enables us to avoid waiting if the resource the completion
3699 * is protecting is not available.
3701 bool try_wait_for_completion(struct completion *x)
3703 unsigned long flags;
3706 spin_lock_irqsave(&x->wait.lock, flags);
3711 spin_unlock_irqrestore(&x->wait.lock, flags);
3714 EXPORT_SYMBOL(try_wait_for_completion);
3717 * completion_done - Test to see if a completion has any waiters
3718 * @x: completion structure
3720 * Returns: 0 if there are waiters (wait_for_completion() in progress)
3721 * 1 if there are no waiters.
3724 bool completion_done(struct completion *x)
3726 unsigned long flags;
3729 spin_lock_irqsave(&x->wait.lock, flags);
3732 spin_unlock_irqrestore(&x->wait.lock, flags);
3735 EXPORT_SYMBOL(completion_done);
3738 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
3740 unsigned long flags;
3743 init_waitqueue_entry(&wait, current);
3745 __set_current_state(state);
3747 spin_lock_irqsave(&q->lock, flags);
3748 __add_wait_queue(q, &wait);
3749 spin_unlock(&q->lock);
3750 timeout = schedule_timeout(timeout);
3751 spin_lock_irq(&q->lock);
3752 __remove_wait_queue(q, &wait);
3753 spin_unlock_irqrestore(&q->lock, flags);
3758 void __sched interruptible_sleep_on(wait_queue_head_t *q)
3760 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
3762 EXPORT_SYMBOL(interruptible_sleep_on);
3765 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
3767 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
3769 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
3771 void __sched sleep_on(wait_queue_head_t *q)
3773 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
3775 EXPORT_SYMBOL(sleep_on);
3777 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
3779 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
3781 EXPORT_SYMBOL(sleep_on_timeout);
3783 #ifdef CONFIG_RT_MUTEXES
3786 * rt_mutex_setprio - set the current priority of a task
3788 * @prio: prio value (kernel-internal form)
3790 * This function changes the 'effective' priority of a task. It does
3791 * not touch ->normal_prio like __setscheduler().
3793 * Used by the rt_mutex code to implement priority inheritance logic.
3795 void rt_mutex_setprio(struct task_struct *p, int prio)
3797 int oldprio, on_rq, running;
3799 const struct sched_class *prev_class;
3801 BUG_ON(prio < 0 || prio > MAX_PRIO);
3803 rq = __task_rq_lock(p);
3806 * Idle task boosting is a nono in general. There is one
3807 * exception, when PREEMPT_RT and NOHZ is active:
3809 * The idle task calls get_next_timer_interrupt() and holds
3810 * the timer wheel base->lock on the CPU and another CPU wants
3811 * to access the timer (probably to cancel it). We can safely
3812 * ignore the boosting request, as the idle CPU runs this code
3813 * with interrupts disabled and will complete the lock
3814 * protected section without being interrupted. So there is no
3815 * real need to boost.
3817 if (unlikely(p == rq->idle)) {
3818 WARN_ON(p != rq->curr);
3819 WARN_ON(p->pi_blocked_on);
3823 trace_sched_pi_setprio(p, prio);
3825 prev_class = p->sched_class;
3827 running = task_current(rq, p);
3829 dequeue_task(rq, p, 0);
3831 p->sched_class->put_prev_task(rq, p);
3834 p->sched_class = &rt_sched_class;
3836 p->sched_class = &fair_sched_class;
3841 p->sched_class->set_curr_task(rq);
3843 enqueue_task(rq, p, oldprio < prio ? ENQUEUE_HEAD : 0);
3845 check_class_changed(rq, p, prev_class, oldprio);
3847 __task_rq_unlock(rq);
3850 void set_user_nice(struct task_struct *p, long nice)
3852 int old_prio, delta, on_rq;
3853 unsigned long flags;
3856 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
3859 * We have to be careful, if called from sys_setpriority(),
3860 * the task might be in the middle of scheduling on another CPU.
3862 rq = task_rq_lock(p, &flags);
3864 * The RT priorities are set via sched_setscheduler(), but we still
3865 * allow the 'normal' nice value to be set - but as expected
3866 * it wont have any effect on scheduling until the task is
3867 * SCHED_FIFO/SCHED_RR:
3869 if (task_has_rt_policy(p)) {
3870 p->static_prio = NICE_TO_PRIO(nice);
3875 dequeue_task(rq, p, 0);
3877 p->static_prio = NICE_TO_PRIO(nice);
3880 p->prio = effective_prio(p);
3881 delta = p->prio - old_prio;
3884 enqueue_task(rq, p, 0);
3886 * If the task increased its priority or is running and
3887 * lowered its priority, then reschedule its CPU:
3889 if (delta < 0 || (delta > 0 && task_running(rq, p)))
3890 resched_task(rq->curr);
3893 task_rq_unlock(rq, p, &flags);
3895 EXPORT_SYMBOL(set_user_nice);
3898 * can_nice - check if a task can reduce its nice value
3902 int can_nice(const struct task_struct *p, const int nice)
3904 /* convert nice value [19,-20] to rlimit style value [1,40] */
3905 int nice_rlim = 20 - nice;
3907 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
3908 capable(CAP_SYS_NICE));
3911 #ifdef __ARCH_WANT_SYS_NICE
3914 * sys_nice - change the priority of the current process.
3915 * @increment: priority increment
3917 * sys_setpriority is a more generic, but much slower function that
3918 * does similar things.
3920 SYSCALL_DEFINE1(nice, int, increment)
3925 * Setpriority might change our priority at the same moment.
3926 * We don't have to worry. Conceptually one call occurs first
3927 * and we have a single winner.
3929 if (increment < -40)
3934 nice = TASK_NICE(current) + increment;
3940 if (increment < 0 && !can_nice(current, nice))
3943 retval = security_task_setnice(current, nice);
3947 set_user_nice(current, nice);
3954 * task_prio - return the priority value of a given task.
3955 * @p: the task in question.
3957 * This is the priority value as seen by users in /proc.
3958 * RT tasks are offset by -200. Normal tasks are centered
3959 * around 0, value goes from -16 to +15.
3961 int task_prio(const struct task_struct *p)
3963 return p->prio - MAX_RT_PRIO;
3967 * task_nice - return the nice value of a given task.
3968 * @p: the task in question.
3970 int task_nice(const struct task_struct *p)
3972 return TASK_NICE(p);
3974 EXPORT_SYMBOL(task_nice);
3977 * idle_cpu - is a given cpu idle currently?
3978 * @cpu: the processor in question.
3980 int idle_cpu(int cpu)
3982 struct rq *rq = cpu_rq(cpu);
3984 if (rq->curr != rq->idle)
3991 if (!llist_empty(&rq->wake_list))
3999 * idle_task - return the idle task for a given cpu.
4000 * @cpu: the processor in question.
4002 struct task_struct *idle_task(int cpu)
4004 return cpu_rq(cpu)->idle;
4008 * find_process_by_pid - find a process with a matching PID value.
4009 * @pid: the pid in question.
4011 static struct task_struct *find_process_by_pid(pid_t pid)
4013 return pid ? find_task_by_vpid(pid) : current;
4016 /* Actually do priority change: must hold rq lock. */
4018 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
4021 p->rt_priority = prio;
4022 p->normal_prio = normal_prio(p);
4023 /* we are holding p->pi_lock already */
4024 p->prio = rt_mutex_getprio(p);
4025 if (rt_prio(p->prio))
4026 p->sched_class = &rt_sched_class;
4028 p->sched_class = &fair_sched_class;
4033 * check the target process has a UID that matches the current process's
4035 static bool check_same_owner(struct task_struct *p)
4037 const struct cred *cred = current_cred(), *pcred;
4041 pcred = __task_cred(p);
4042 if (cred->user->user_ns == pcred->user->user_ns)
4043 match = (cred->euid == pcred->euid ||
4044 cred->euid == pcred->uid);
4051 static int __sched_setscheduler(struct task_struct *p, int policy,
4052 const struct sched_param *param, bool user)
4054 int retval, oldprio, oldpolicy = -1, on_rq, running;
4055 unsigned long flags;
4056 const struct sched_class *prev_class;
4060 /* may grab non-irq protected spin_locks */
4061 BUG_ON(in_interrupt());
4063 /* double check policy once rq lock held */
4065 reset_on_fork = p->sched_reset_on_fork;
4066 policy = oldpolicy = p->policy;
4068 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
4069 policy &= ~SCHED_RESET_ON_FORK;
4071 if (policy != SCHED_FIFO && policy != SCHED_RR &&
4072 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
4073 policy != SCHED_IDLE)
4078 * Valid priorities for SCHED_FIFO and SCHED_RR are
4079 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4080 * SCHED_BATCH and SCHED_IDLE is 0.
4082 if (param->sched_priority < 0 ||
4083 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
4084 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
4086 if (rt_policy(policy) != (param->sched_priority != 0))
4090 * Allow unprivileged RT tasks to decrease priority:
4092 if (user && !capable(CAP_SYS_NICE)) {
4093 if (rt_policy(policy)) {
4094 unsigned long rlim_rtprio =
4095 task_rlimit(p, RLIMIT_RTPRIO);
4097 /* can't set/change the rt policy */
4098 if (policy != p->policy && !rlim_rtprio)
4101 /* can't increase priority */
4102 if (param->sched_priority > p->rt_priority &&
4103 param->sched_priority > rlim_rtprio)
4108 * Treat SCHED_IDLE as nice 20. Only allow a switch to
4109 * SCHED_NORMAL if the RLIMIT_NICE would normally permit it.
4111 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) {
4112 if (!can_nice(p, TASK_NICE(p)))
4116 /* can't change other user's priorities */
4117 if (!check_same_owner(p))
4120 /* Normal users shall not reset the sched_reset_on_fork flag */
4121 if (p->sched_reset_on_fork && !reset_on_fork)
4126 retval = security_task_setscheduler(p);
4132 * make sure no PI-waiters arrive (or leave) while we are
4133 * changing the priority of the task:
4135 * To be able to change p->policy safely, the appropriate
4136 * runqueue lock must be held.
4138 rq = task_rq_lock(p, &flags);
4141 * Changing the policy of the stop threads its a very bad idea
4143 if (p == rq->stop) {
4144 task_rq_unlock(rq, p, &flags);
4149 * If not changing anything there's no need to proceed further:
4151 if (unlikely(policy == p->policy && (!rt_policy(policy) ||
4152 param->sched_priority == p->rt_priority))) {
4154 __task_rq_unlock(rq);
4155 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4159 #ifdef CONFIG_RT_GROUP_SCHED
4162 * Do not allow realtime tasks into groups that have no runtime
4165 if (rt_bandwidth_enabled() && rt_policy(policy) &&
4166 task_group(p)->rt_bandwidth.rt_runtime == 0 &&
4167 !task_group_is_autogroup(task_group(p))) {
4168 task_rq_unlock(rq, p, &flags);
4174 /* recheck policy now with rq lock held */
4175 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
4176 policy = oldpolicy = -1;
4177 task_rq_unlock(rq, p, &flags);
4181 running = task_current(rq, p);
4183 dequeue_task(rq, p, 0);
4185 p->sched_class->put_prev_task(rq, p);
4187 p->sched_reset_on_fork = reset_on_fork;
4190 prev_class = p->sched_class;
4191 __setscheduler(rq, p, policy, param->sched_priority);
4194 p->sched_class->set_curr_task(rq);
4196 enqueue_task(rq, p, 0);
4198 check_class_changed(rq, p, prev_class, oldprio);
4199 task_rq_unlock(rq, p, &flags);
4201 rt_mutex_adjust_pi(p);
4207 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4208 * @p: the task in question.
4209 * @policy: new policy.
4210 * @param: structure containing the new RT priority.
4212 * NOTE that the task may be already dead.
4214 int sched_setscheduler(struct task_struct *p, int policy,
4215 const struct sched_param *param)
4217 return __sched_setscheduler(p, policy, param, true);
4219 EXPORT_SYMBOL_GPL(sched_setscheduler);
4222 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
4223 * @p: the task in question.
4224 * @policy: new policy.
4225 * @param: structure containing the new RT priority.
4227 * Just like sched_setscheduler, only don't bother checking if the
4228 * current context has permission. For example, this is needed in
4229 * stop_machine(): we create temporary high priority worker threads,
4230 * but our caller might not have that capability.
4232 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
4233 const struct sched_param *param)
4235 return __sched_setscheduler(p, policy, param, false);
4239 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
4241 struct sched_param lparam;
4242 struct task_struct *p;
4245 if (!param || pid < 0)
4247 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
4252 p = find_process_by_pid(pid);
4254 retval = sched_setscheduler(p, policy, &lparam);
4261 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4262 * @pid: the pid in question.
4263 * @policy: new policy.
4264 * @param: structure containing the new RT priority.
4266 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
4267 struct sched_param __user *, param)
4269 /* negative values for policy are not valid */
4273 return do_sched_setscheduler(pid, policy, param);
4277 * sys_sched_setparam - set/change the RT priority of a thread
4278 * @pid: the pid in question.
4279 * @param: structure containing the new RT priority.
4281 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
4283 return do_sched_setscheduler(pid, -1, param);
4287 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4288 * @pid: the pid in question.
4290 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
4292 struct task_struct *p;
4300 p = find_process_by_pid(pid);
4302 retval = security_task_getscheduler(p);
4305 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
4312 * sys_sched_getparam - get the RT priority of a thread
4313 * @pid: the pid in question.
4314 * @param: structure containing the RT priority.
4316 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
4318 struct sched_param lp;
4319 struct task_struct *p;
4322 if (!param || pid < 0)
4326 p = find_process_by_pid(pid);
4331 retval = security_task_getscheduler(p);
4335 lp.sched_priority = p->rt_priority;
4339 * This one might sleep, we cannot do it with a spinlock held ...
4341 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
4350 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4352 cpumask_var_t cpus_allowed, new_mask;
4353 struct task_struct *p;
4359 p = find_process_by_pid(pid);
4366 /* Prevent p going away */
4370 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4374 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4376 goto out_free_cpus_allowed;
4379 if (!check_same_owner(p) && !ns_capable(task_user_ns(p), CAP_SYS_NICE))
4382 retval = security_task_setscheduler(p);
4386 cpuset_cpus_allowed(p, cpus_allowed);
4387 cpumask_and(new_mask, in_mask, cpus_allowed);
4389 retval = set_cpus_allowed_ptr(p, new_mask);
4392 cpuset_cpus_allowed(p, cpus_allowed);
4393 if (!cpumask_subset(new_mask, cpus_allowed)) {
4395 * We must have raced with a concurrent cpuset
4396 * update. Just reset the cpus_allowed to the
4397 * cpuset's cpus_allowed
4399 cpumask_copy(new_mask, cpus_allowed);
4404 free_cpumask_var(new_mask);
4405 out_free_cpus_allowed:
4406 free_cpumask_var(cpus_allowed);
4413 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4414 struct cpumask *new_mask)
4416 if (len < cpumask_size())
4417 cpumask_clear(new_mask);
4418 else if (len > cpumask_size())
4419 len = cpumask_size();
4421 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4425 * sys_sched_setaffinity - set the cpu affinity of a process
4426 * @pid: pid of the process
4427 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4428 * @user_mask_ptr: user-space pointer to the new cpu mask
4430 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4431 unsigned long __user *, user_mask_ptr)
4433 cpumask_var_t new_mask;
4436 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4439 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4441 retval = sched_setaffinity(pid, new_mask);
4442 free_cpumask_var(new_mask);
4446 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4448 struct task_struct *p;
4449 unsigned long flags;
4456 p = find_process_by_pid(pid);
4460 retval = security_task_getscheduler(p);
4464 raw_spin_lock_irqsave(&p->pi_lock, flags);
4465 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
4466 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4476 * sys_sched_getaffinity - get the cpu affinity of a process
4477 * @pid: pid of the process
4478 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4479 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4481 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4482 unsigned long __user *, user_mask_ptr)
4487 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
4489 if (len & (sizeof(unsigned long)-1))
4492 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4495 ret = sched_getaffinity(pid, mask);
4497 size_t retlen = min_t(size_t, len, cpumask_size());
4499 if (copy_to_user(user_mask_ptr, mask, retlen))
4504 free_cpumask_var(mask);
4510 * sys_sched_yield - yield the current processor to other threads.
4512 * This function yields the current CPU to other tasks. If there are no
4513 * other threads running on this CPU then this function will return.
4515 SYSCALL_DEFINE0(sched_yield)
4517 struct rq *rq = this_rq_lock();
4519 schedstat_inc(rq, yld_count);
4520 current->sched_class->yield_task(rq);
4523 * Since we are going to call schedule() anyway, there's
4524 * no need to preempt or enable interrupts:
4526 __release(rq->lock);
4527 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4528 do_raw_spin_unlock(&rq->lock);
4529 sched_preempt_enable_no_resched();
4536 static inline int should_resched(void)
4538 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
4541 static void __cond_resched(void)
4543 add_preempt_count(PREEMPT_ACTIVE);
4545 sub_preempt_count(PREEMPT_ACTIVE);
4548 int __sched _cond_resched(void)
4550 if (should_resched()) {
4556 EXPORT_SYMBOL(_cond_resched);
4559 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4560 * call schedule, and on return reacquire the lock.
4562 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4563 * operations here to prevent schedule() from being called twice (once via
4564 * spin_unlock(), once by hand).
4566 int __cond_resched_lock(spinlock_t *lock)
4568 int resched = should_resched();
4571 lockdep_assert_held(lock);
4573 if (spin_needbreak(lock) || resched) {
4584 EXPORT_SYMBOL(__cond_resched_lock);
4586 int __sched __cond_resched_softirq(void)
4588 BUG_ON(!in_softirq());
4590 if (should_resched()) {
4598 EXPORT_SYMBOL(__cond_resched_softirq);
4601 * yield - yield the current processor to other threads.
4603 * Do not ever use this function, there's a 99% chance you're doing it wrong.
4605 * The scheduler is at all times free to pick the calling task as the most
4606 * eligible task to run, if removing the yield() call from your code breaks
4607 * it, its already broken.
4609 * Typical broken usage is:
4614 * where one assumes that yield() will let 'the other' process run that will
4615 * make event true. If the current task is a SCHED_FIFO task that will never
4616 * happen. Never use yield() as a progress guarantee!!
4618 * If you want to use yield() to wait for something, use wait_event().
4619 * If you want to use yield() to be 'nice' for others, use cond_resched().
4620 * If you still want to use yield(), do not!
4622 void __sched yield(void)
4624 set_current_state(TASK_RUNNING);
4627 EXPORT_SYMBOL(yield);
4630 * yield_to - yield the current processor to another thread in
4631 * your thread group, or accelerate that thread toward the
4632 * processor it's on.
4634 * @preempt: whether task preemption is allowed or not
4636 * It's the caller's job to ensure that the target task struct
4637 * can't go away on us before we can do any checks.
4639 * Returns true if we indeed boosted the target task.
4641 bool __sched yield_to(struct task_struct *p, bool preempt)
4643 struct task_struct *curr = current;
4644 struct rq *rq, *p_rq;
4645 unsigned long flags;
4648 local_irq_save(flags);
4653 double_rq_lock(rq, p_rq);
4654 while (task_rq(p) != p_rq) {
4655 double_rq_unlock(rq, p_rq);
4659 if (!curr->sched_class->yield_to_task)
4662 if (curr->sched_class != p->sched_class)
4665 if (task_running(p_rq, p) || p->state)
4668 yielded = curr->sched_class->yield_to_task(rq, p, preempt);
4670 schedstat_inc(rq, yld_count);
4672 * Make p's CPU reschedule; pick_next_entity takes care of
4675 if (preempt && rq != p_rq)
4676 resched_task(p_rq->curr);
4679 * We might have set it in task_yield_fair(), but are
4680 * not going to schedule(), so don't want to skip
4683 rq->skip_clock_update = 0;
4687 double_rq_unlock(rq, p_rq);
4688 local_irq_restore(flags);
4695 EXPORT_SYMBOL_GPL(yield_to);
4698 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
4699 * that process accounting knows that this is a task in IO wait state.
4701 void __sched io_schedule(void)
4703 struct rq *rq = raw_rq();
4705 delayacct_blkio_start();
4706 atomic_inc(&rq->nr_iowait);
4707 blk_flush_plug(current);
4708 current->in_iowait = 1;
4710 current->in_iowait = 0;
4711 atomic_dec(&rq->nr_iowait);
4712 delayacct_blkio_end();
4714 EXPORT_SYMBOL(io_schedule);
4716 long __sched io_schedule_timeout(long timeout)
4718 struct rq *rq = raw_rq();
4721 delayacct_blkio_start();
4722 atomic_inc(&rq->nr_iowait);
4723 blk_flush_plug(current);
4724 current->in_iowait = 1;
4725 ret = schedule_timeout(timeout);
4726 current->in_iowait = 0;
4727 atomic_dec(&rq->nr_iowait);
4728 delayacct_blkio_end();
4733 * sys_sched_get_priority_max - return maximum RT priority.
4734 * @policy: scheduling class.
4736 * this syscall returns the maximum rt_priority that can be used
4737 * by a given scheduling class.
4739 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
4746 ret = MAX_USER_RT_PRIO-1;
4758 * sys_sched_get_priority_min - return minimum RT priority.
4759 * @policy: scheduling class.
4761 * this syscall returns the minimum rt_priority that can be used
4762 * by a given scheduling class.
4764 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
4782 * sys_sched_rr_get_interval - return the default timeslice of a process.
4783 * @pid: pid of the process.
4784 * @interval: userspace pointer to the timeslice value.
4786 * this syscall writes the default timeslice value of a given process
4787 * into the user-space timespec buffer. A value of '0' means infinity.
4789 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
4790 struct timespec __user *, interval)
4792 struct task_struct *p;
4793 unsigned int time_slice;
4794 unsigned long flags;
4804 p = find_process_by_pid(pid);
4808 retval = security_task_getscheduler(p);
4812 rq = task_rq_lock(p, &flags);
4813 time_slice = p->sched_class->get_rr_interval(rq, p);
4814 task_rq_unlock(rq, p, &flags);
4817 jiffies_to_timespec(time_slice, &t);
4818 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
4826 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
4828 void sched_show_task(struct task_struct *p)
4830 unsigned long free = 0;
4833 state = p->state ? __ffs(p->state) + 1 : 0;
4834 printk(KERN_INFO "%-15.15s %c", p->comm,
4835 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
4836 #if BITS_PER_LONG == 32
4837 if (state == TASK_RUNNING)
4838 printk(KERN_CONT " running ");
4840 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
4842 if (state == TASK_RUNNING)
4843 printk(KERN_CONT " running task ");
4845 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
4847 #ifdef CONFIG_DEBUG_STACK_USAGE
4848 free = stack_not_used(p);
4850 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
4851 task_pid_nr(p), task_pid_nr(rcu_dereference(p->real_parent)),
4852 (unsigned long)task_thread_info(p)->flags);
4854 show_stack(p, NULL);
4857 void show_state_filter(unsigned long state_filter)
4859 struct task_struct *g, *p;
4861 #if BITS_PER_LONG == 32
4863 " task PC stack pid father\n");
4866 " task PC stack pid father\n");
4869 do_each_thread(g, p) {
4871 * reset the NMI-timeout, listing all files on a slow
4872 * console might take a lot of time:
4874 touch_nmi_watchdog();
4875 if (!state_filter || (p->state & state_filter))
4877 } while_each_thread(g, p);
4879 touch_all_softlockup_watchdogs();
4881 #ifdef CONFIG_SCHED_DEBUG
4882 sysrq_sched_debug_show();
4886 * Only show locks if all tasks are dumped:
4889 debug_show_all_locks();
4892 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
4894 idle->sched_class = &idle_sched_class;
4898 * init_idle - set up an idle thread for a given CPU
4899 * @idle: task in question
4900 * @cpu: cpu the idle task belongs to
4902 * NOTE: this function does not set the idle thread's NEED_RESCHED
4903 * flag, to make booting more robust.
4905 void __cpuinit init_idle(struct task_struct *idle, int cpu)
4907 struct rq *rq = cpu_rq(cpu);
4908 unsigned long flags;
4910 raw_spin_lock_irqsave(&rq->lock, flags);
4913 idle->state = TASK_RUNNING;
4914 idle->se.exec_start = sched_clock();
4916 do_set_cpus_allowed(idle, cpumask_of(cpu));
4918 * We're having a chicken and egg problem, even though we are
4919 * holding rq->lock, the cpu isn't yet set to this cpu so the
4920 * lockdep check in task_group() will fail.
4922 * Similar case to sched_fork(). / Alternatively we could
4923 * use task_rq_lock() here and obtain the other rq->lock.
4928 __set_task_cpu(idle, cpu);
4931 rq->curr = rq->idle = idle;
4932 #if defined(CONFIG_SMP)
4935 raw_spin_unlock_irqrestore(&rq->lock, flags);
4937 /* Set the preempt count _outside_ the spinlocks! */
4938 task_thread_info(idle)->preempt_count = 0;
4941 * The idle tasks have their own, simple scheduling class:
4943 idle->sched_class = &idle_sched_class;
4944 ftrace_graph_init_idle_task(idle, cpu);
4945 #if defined(CONFIG_SMP)
4946 sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu);
4951 void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask)
4953 if (p->sched_class && p->sched_class->set_cpus_allowed)
4954 p->sched_class->set_cpus_allowed(p, new_mask);
4956 cpumask_copy(&p->cpus_allowed, new_mask);
4957 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
4961 * This is how migration works:
4963 * 1) we invoke migration_cpu_stop() on the target CPU using
4965 * 2) stopper starts to run (implicitly forcing the migrated thread
4967 * 3) it checks whether the migrated task is still in the wrong runqueue.
4968 * 4) if it's in the wrong runqueue then the migration thread removes
4969 * it and puts it into the right queue.
4970 * 5) stopper completes and stop_one_cpu() returns and the migration
4975 * Change a given task's CPU affinity. Migrate the thread to a
4976 * proper CPU and schedule it away if the CPU it's executing on
4977 * is removed from the allowed bitmask.
4979 * NOTE: the caller must have a valid reference to the task, the
4980 * task must not exit() & deallocate itself prematurely. The
4981 * call is not atomic; no spinlocks may be held.
4983 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
4985 unsigned long flags;
4987 unsigned int dest_cpu;
4990 rq = task_rq_lock(p, &flags);
4992 if (cpumask_equal(&p->cpus_allowed, new_mask))
4995 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
5000 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current)) {
5005 do_set_cpus_allowed(p, new_mask);
5007 /* Can the task run on the task's current CPU? If so, we're done */
5008 if (cpumask_test_cpu(task_cpu(p), new_mask))
5011 dest_cpu = cpumask_any_and(cpu_active_mask, new_mask);
5013 struct migration_arg arg = { p, dest_cpu };
5014 /* Need help from migration thread: drop lock and wait. */
5015 task_rq_unlock(rq, p, &flags);
5016 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
5017 tlb_migrate_finish(p->mm);
5021 task_rq_unlock(rq, p, &flags);
5025 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
5028 * Move (not current) task off this cpu, onto dest cpu. We're doing
5029 * this because either it can't run here any more (set_cpus_allowed()
5030 * away from this CPU, or CPU going down), or because we're
5031 * attempting to rebalance this task on exec (sched_exec).
5033 * So we race with normal scheduler movements, but that's OK, as long
5034 * as the task is no longer on this CPU.
5036 * Returns non-zero if task was successfully migrated.
5038 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
5040 struct rq *rq_dest, *rq_src;
5043 if (unlikely(!cpu_active(dest_cpu)))
5046 rq_src = cpu_rq(src_cpu);
5047 rq_dest = cpu_rq(dest_cpu);
5049 raw_spin_lock(&p->pi_lock);
5050 double_rq_lock(rq_src, rq_dest);
5051 /* Already moved. */
5052 if (task_cpu(p) != src_cpu)
5054 /* Affinity changed (again). */
5055 if (!cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
5059 * If we're not on a rq, the next wake-up will ensure we're
5063 dequeue_task(rq_src, p, 0);
5064 set_task_cpu(p, dest_cpu);
5065 enqueue_task(rq_dest, p, 0);
5066 check_preempt_curr(rq_dest, p, 0);
5071 double_rq_unlock(rq_src, rq_dest);
5072 raw_spin_unlock(&p->pi_lock);
5077 * migration_cpu_stop - this will be executed by a highprio stopper thread
5078 * and performs thread migration by bumping thread off CPU then
5079 * 'pushing' onto another runqueue.
5081 static int migration_cpu_stop(void *data)
5083 struct migration_arg *arg = data;
5086 * The original target cpu might have gone down and we might
5087 * be on another cpu but it doesn't matter.
5089 local_irq_disable();
5090 __migrate_task(arg->task, raw_smp_processor_id(), arg->dest_cpu);
5095 #ifdef CONFIG_HOTPLUG_CPU
5098 * Ensures that the idle task is using init_mm right before its cpu goes
5101 void idle_task_exit(void)
5103 struct mm_struct *mm = current->active_mm;
5105 BUG_ON(cpu_online(smp_processor_id()));
5108 switch_mm(mm, &init_mm, current);
5113 * While a dead CPU has no uninterruptible tasks queued at this point,
5114 * it might still have a nonzero ->nr_uninterruptible counter, because
5115 * for performance reasons the counter is not stricly tracking tasks to
5116 * their home CPUs. So we just add the counter to another CPU's counter,
5117 * to keep the global sum constant after CPU-down:
5119 static void migrate_nr_uninterruptible(struct rq *rq_src)
5121 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
5123 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
5124 rq_src->nr_uninterruptible = 0;
5128 * remove the tasks which were accounted by rq from calc_load_tasks.
5130 static void calc_global_load_remove(struct rq *rq)
5132 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
5133 rq->calc_load_active = 0;
5137 * Migrate all tasks from the rq, sleeping tasks will be migrated by
5138 * try_to_wake_up()->select_task_rq().
5140 * Called with rq->lock held even though we'er in stop_machine() and
5141 * there's no concurrency possible, we hold the required locks anyway
5142 * because of lock validation efforts.
5144 static void migrate_tasks(unsigned int dead_cpu)
5146 struct rq *rq = cpu_rq(dead_cpu);
5147 struct task_struct *next, *stop = rq->stop;
5151 * Fudge the rq selection such that the below task selection loop
5152 * doesn't get stuck on the currently eligible stop task.
5154 * We're currently inside stop_machine() and the rq is either stuck
5155 * in the stop_machine_cpu_stop() loop, or we're executing this code,
5156 * either way we should never end up calling schedule() until we're
5161 /* Ensure any throttled groups are reachable by pick_next_task */
5162 unthrottle_offline_cfs_rqs(rq);
5166 * There's this thread running, bail when that's the only
5169 if (rq->nr_running == 1)
5172 next = pick_next_task(rq);
5174 next->sched_class->put_prev_task(rq, next);
5176 /* Find suitable destination for @next, with force if needed. */
5177 dest_cpu = select_fallback_rq(dead_cpu, next);
5178 raw_spin_unlock(&rq->lock);
5180 __migrate_task(next, dead_cpu, dest_cpu);
5182 raw_spin_lock(&rq->lock);
5188 #endif /* CONFIG_HOTPLUG_CPU */
5190 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
5192 static struct ctl_table sd_ctl_dir[] = {
5194 .procname = "sched_domain",
5200 static struct ctl_table sd_ctl_root[] = {
5202 .procname = "kernel",
5204 .child = sd_ctl_dir,
5209 static struct ctl_table *sd_alloc_ctl_entry(int n)
5211 struct ctl_table *entry =
5212 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
5217 static void sd_free_ctl_entry(struct ctl_table **tablep)
5219 struct ctl_table *entry;
5222 * In the intermediate directories, both the child directory and
5223 * procname are dynamically allocated and could fail but the mode
5224 * will always be set. In the lowest directory the names are
5225 * static strings and all have proc handlers.
5227 for (entry = *tablep; entry->mode; entry++) {
5229 sd_free_ctl_entry(&entry->child);
5230 if (entry->proc_handler == NULL)
5231 kfree(entry->procname);
5239 set_table_entry(struct ctl_table *entry,
5240 const char *procname, void *data, int maxlen,
5241 umode_t mode, proc_handler *proc_handler)
5243 entry->procname = procname;
5245 entry->maxlen = maxlen;
5247 entry->proc_handler = proc_handler;
5250 static struct ctl_table *
5251 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5253 struct ctl_table *table = sd_alloc_ctl_entry(13);
5258 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5259 sizeof(long), 0644, proc_doulongvec_minmax);
5260 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5261 sizeof(long), 0644, proc_doulongvec_minmax);
5262 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5263 sizeof(int), 0644, proc_dointvec_minmax);
5264 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5265 sizeof(int), 0644, proc_dointvec_minmax);
5266 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5267 sizeof(int), 0644, proc_dointvec_minmax);
5268 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5269 sizeof(int), 0644, proc_dointvec_minmax);
5270 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5271 sizeof(int), 0644, proc_dointvec_minmax);
5272 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5273 sizeof(int), 0644, proc_dointvec_minmax);
5274 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5275 sizeof(int), 0644, proc_dointvec_minmax);
5276 set_table_entry(&table[9], "cache_nice_tries",
5277 &sd->cache_nice_tries,
5278 sizeof(int), 0644, proc_dointvec_minmax);
5279 set_table_entry(&table[10], "flags", &sd->flags,
5280 sizeof(int), 0644, proc_dointvec_minmax);
5281 set_table_entry(&table[11], "name", sd->name,
5282 CORENAME_MAX_SIZE, 0444, proc_dostring);
5283 /* &table[12] is terminator */
5288 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5290 struct ctl_table *entry, *table;
5291 struct sched_domain *sd;
5292 int domain_num = 0, i;
5295 for_each_domain(cpu, sd)
5297 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5302 for_each_domain(cpu, sd) {
5303 snprintf(buf, 32, "domain%d", i);
5304 entry->procname = kstrdup(buf, GFP_KERNEL);
5306 entry->child = sd_alloc_ctl_domain_table(sd);
5313 static struct ctl_table_header *sd_sysctl_header;
5314 static void register_sched_domain_sysctl(void)
5316 int i, cpu_num = num_possible_cpus();
5317 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5320 WARN_ON(sd_ctl_dir[0].child);
5321 sd_ctl_dir[0].child = entry;
5326 for_each_possible_cpu(i) {
5327 snprintf(buf, 32, "cpu%d", i);
5328 entry->procname = kstrdup(buf, GFP_KERNEL);
5330 entry->child = sd_alloc_ctl_cpu_table(i);
5334 WARN_ON(sd_sysctl_header);
5335 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5338 /* may be called multiple times per register */
5339 static void unregister_sched_domain_sysctl(void)
5341 if (sd_sysctl_header)
5342 unregister_sysctl_table(sd_sysctl_header);
5343 sd_sysctl_header = NULL;
5344 if (sd_ctl_dir[0].child)
5345 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5348 static void register_sched_domain_sysctl(void)
5351 static void unregister_sched_domain_sysctl(void)
5356 static void set_rq_online(struct rq *rq)
5359 const struct sched_class *class;
5361 cpumask_set_cpu(rq->cpu, rq->rd->online);
5364 for_each_class(class) {
5365 if (class->rq_online)
5366 class->rq_online(rq);
5371 static void set_rq_offline(struct rq *rq)
5374 const struct sched_class *class;
5376 for_each_class(class) {
5377 if (class->rq_offline)
5378 class->rq_offline(rq);
5381 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5387 * migration_call - callback that gets triggered when a CPU is added.
5388 * Here we can start up the necessary migration thread for the new CPU.
5390 static int __cpuinit
5391 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5393 int cpu = (long)hcpu;
5394 unsigned long flags;
5395 struct rq *rq = cpu_rq(cpu);
5397 switch (action & ~CPU_TASKS_FROZEN) {
5399 case CPU_UP_PREPARE:
5400 rq->calc_load_update = calc_load_update;
5404 /* Update our root-domain */
5405 raw_spin_lock_irqsave(&rq->lock, flags);
5407 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5411 raw_spin_unlock_irqrestore(&rq->lock, flags);
5414 #ifdef CONFIG_HOTPLUG_CPU
5416 sched_ttwu_pending();
5417 /* Update our root-domain */
5418 raw_spin_lock_irqsave(&rq->lock, flags);
5420 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5424 BUG_ON(rq->nr_running != 1); /* the migration thread */
5425 raw_spin_unlock_irqrestore(&rq->lock, flags);
5427 migrate_nr_uninterruptible(rq);
5428 calc_global_load_remove(rq);
5433 update_max_interval();
5439 * Register at high priority so that task migration (migrate_all_tasks)
5440 * happens before everything else. This has to be lower priority than
5441 * the notifier in the perf_event subsystem, though.
5443 static struct notifier_block __cpuinitdata migration_notifier = {
5444 .notifier_call = migration_call,
5445 .priority = CPU_PRI_MIGRATION,
5448 static int __cpuinit sched_cpu_active(struct notifier_block *nfb,
5449 unsigned long action, void *hcpu)
5451 switch (action & ~CPU_TASKS_FROZEN) {
5453 case CPU_DOWN_FAILED:
5454 set_cpu_active((long)hcpu, true);
5461 static int __cpuinit sched_cpu_inactive(struct notifier_block *nfb,
5462 unsigned long action, void *hcpu)
5464 switch (action & ~CPU_TASKS_FROZEN) {
5465 case CPU_DOWN_PREPARE:
5466 set_cpu_active((long)hcpu, false);
5473 static int __init migration_init(void)
5475 void *cpu = (void *)(long)smp_processor_id();
5478 /* Initialize migration for the boot CPU */
5479 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
5480 BUG_ON(err == NOTIFY_BAD);
5481 migration_call(&migration_notifier, CPU_ONLINE, cpu);
5482 register_cpu_notifier(&migration_notifier);
5484 /* Register cpu active notifiers */
5485 cpu_notifier(sched_cpu_active, CPU_PRI_SCHED_ACTIVE);
5486 cpu_notifier(sched_cpu_inactive, CPU_PRI_SCHED_INACTIVE);
5490 early_initcall(migration_init);
5495 static cpumask_var_t sched_domains_tmpmask; /* sched_domains_mutex */
5497 #ifdef CONFIG_SCHED_DEBUG
5499 static __read_mostly int sched_domain_debug_enabled;
5501 static int __init sched_domain_debug_setup(char *str)
5503 sched_domain_debug_enabled = 1;
5507 early_param("sched_debug", sched_domain_debug_setup);
5509 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5510 struct cpumask *groupmask)
5512 struct sched_group *group = sd->groups;
5515 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
5516 cpumask_clear(groupmask);
5518 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5520 if (!(sd->flags & SD_LOAD_BALANCE)) {
5521 printk("does not load-balance\n");
5523 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5528 printk(KERN_CONT "span %s level %s\n", str, sd->name);
5530 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5531 printk(KERN_ERR "ERROR: domain->span does not contain "
5534 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5535 printk(KERN_ERR "ERROR: domain->groups does not contain"
5539 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5543 printk(KERN_ERR "ERROR: group is NULL\n");
5547 if (!group->sgp->power) {
5548 printk(KERN_CONT "\n");
5549 printk(KERN_ERR "ERROR: domain->cpu_power not "
5554 if (!cpumask_weight(sched_group_cpus(group))) {
5555 printk(KERN_CONT "\n");
5556 printk(KERN_ERR "ERROR: empty group\n");
5560 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
5561 printk(KERN_CONT "\n");
5562 printk(KERN_ERR "ERROR: repeated CPUs\n");
5566 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
5568 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
5570 printk(KERN_CONT " %s", str);
5571 if (group->sgp->power != SCHED_POWER_SCALE) {
5572 printk(KERN_CONT " (cpu_power = %d)",
5576 group = group->next;
5577 } while (group != sd->groups);
5578 printk(KERN_CONT "\n");
5580 if (!cpumask_equal(sched_domain_span(sd), groupmask))
5581 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
5584 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
5585 printk(KERN_ERR "ERROR: parent span is not a superset "
5586 "of domain->span\n");
5590 static void sched_domain_debug(struct sched_domain *sd, int cpu)
5594 if (!sched_domain_debug_enabled)
5598 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
5602 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
5605 if (sched_domain_debug_one(sd, cpu, level, sched_domains_tmpmask))
5613 #else /* !CONFIG_SCHED_DEBUG */
5614 # define sched_domain_debug(sd, cpu) do { } while (0)
5615 #endif /* CONFIG_SCHED_DEBUG */
5617 static int sd_degenerate(struct sched_domain *sd)
5619 if (cpumask_weight(sched_domain_span(sd)) == 1)
5622 /* Following flags need at least 2 groups */
5623 if (sd->flags & (SD_LOAD_BALANCE |
5624 SD_BALANCE_NEWIDLE |
5628 SD_SHARE_PKG_RESOURCES)) {
5629 if (sd->groups != sd->groups->next)
5633 /* Following flags don't use groups */
5634 if (sd->flags & (SD_WAKE_AFFINE))
5641 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
5643 unsigned long cflags = sd->flags, pflags = parent->flags;
5645 if (sd_degenerate(parent))
5648 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
5651 /* Flags needing groups don't count if only 1 group in parent */
5652 if (parent->groups == parent->groups->next) {
5653 pflags &= ~(SD_LOAD_BALANCE |
5654 SD_BALANCE_NEWIDLE |
5658 SD_SHARE_PKG_RESOURCES);
5659 if (nr_node_ids == 1)
5660 pflags &= ~SD_SERIALIZE;
5662 if (~cflags & pflags)
5668 static void free_rootdomain(struct rcu_head *rcu)
5670 struct root_domain *rd = container_of(rcu, struct root_domain, rcu);
5672 cpupri_cleanup(&rd->cpupri);
5673 free_cpumask_var(rd->rto_mask);
5674 free_cpumask_var(rd->online);
5675 free_cpumask_var(rd->span);
5679 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
5681 struct root_domain *old_rd = NULL;
5682 unsigned long flags;
5684 raw_spin_lock_irqsave(&rq->lock, flags);
5689 if (cpumask_test_cpu(rq->cpu, old_rd->online))
5692 cpumask_clear_cpu(rq->cpu, old_rd->span);
5695 * If we dont want to free the old_rt yet then
5696 * set old_rd to NULL to skip the freeing later
5699 if (!atomic_dec_and_test(&old_rd->refcount))
5703 atomic_inc(&rd->refcount);
5706 cpumask_set_cpu(rq->cpu, rd->span);
5707 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
5710 raw_spin_unlock_irqrestore(&rq->lock, flags);
5713 call_rcu_sched(&old_rd->rcu, free_rootdomain);
5716 static int init_rootdomain(struct root_domain *rd)
5718 memset(rd, 0, sizeof(*rd));
5720 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
5722 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
5724 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
5727 if (cpupri_init(&rd->cpupri) != 0)
5732 free_cpumask_var(rd->rto_mask);
5734 free_cpumask_var(rd->online);
5736 free_cpumask_var(rd->span);
5742 * By default the system creates a single root-domain with all cpus as
5743 * members (mimicking the global state we have today).
5745 struct root_domain def_root_domain;
5747 static void init_defrootdomain(void)
5749 init_rootdomain(&def_root_domain);
5751 atomic_set(&def_root_domain.refcount, 1);
5754 static struct root_domain *alloc_rootdomain(void)
5756 struct root_domain *rd;
5758 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
5762 if (init_rootdomain(rd) != 0) {
5770 static void free_sched_groups(struct sched_group *sg, int free_sgp)
5772 struct sched_group *tmp, *first;
5781 if (free_sgp && atomic_dec_and_test(&sg->sgp->ref))
5786 } while (sg != first);
5789 static void free_sched_domain(struct rcu_head *rcu)
5791 struct sched_domain *sd = container_of(rcu, struct sched_domain, rcu);
5794 * If its an overlapping domain it has private groups, iterate and
5797 if (sd->flags & SD_OVERLAP) {
5798 free_sched_groups(sd->groups, 1);
5799 } else if (atomic_dec_and_test(&sd->groups->ref)) {
5800 kfree(sd->groups->sgp);
5806 static void destroy_sched_domain(struct sched_domain *sd, int cpu)
5808 call_rcu(&sd->rcu, free_sched_domain);
5811 static void destroy_sched_domains(struct sched_domain *sd, int cpu)
5813 for (; sd; sd = sd->parent)
5814 destroy_sched_domain(sd, cpu);
5818 * Keep a special pointer to the highest sched_domain that has
5819 * SD_SHARE_PKG_RESOURCE set (Last Level Cache Domain) for this
5820 * allows us to avoid some pointer chasing select_idle_sibling().
5822 * Also keep a unique ID per domain (we use the first cpu number in
5823 * the cpumask of the domain), this allows us to quickly tell if
5824 * two cpus are in the same cache domain, see cpus_share_cache().
5826 DEFINE_PER_CPU(struct sched_domain *, sd_llc);
5827 DEFINE_PER_CPU(int, sd_llc_id);
5829 static void update_top_cache_domain(int cpu)
5831 struct sched_domain *sd;
5834 sd = highest_flag_domain(cpu, SD_SHARE_PKG_RESOURCES);
5836 id = cpumask_first(sched_domain_span(sd));
5838 rcu_assign_pointer(per_cpu(sd_llc, cpu), sd);
5839 per_cpu(sd_llc_id, cpu) = id;
5843 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
5844 * hold the hotplug lock.
5847 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
5849 struct rq *rq = cpu_rq(cpu);
5850 struct sched_domain *tmp;
5852 /* Remove the sched domains which do not contribute to scheduling. */
5853 for (tmp = sd; tmp; ) {
5854 struct sched_domain *parent = tmp->parent;
5858 if (sd_parent_degenerate(tmp, parent)) {
5859 tmp->parent = parent->parent;
5861 parent->parent->child = tmp;
5862 destroy_sched_domain(parent, cpu);
5867 if (sd && sd_degenerate(sd)) {
5870 destroy_sched_domain(tmp, cpu);
5875 sched_domain_debug(sd, cpu);
5877 rq_attach_root(rq, rd);
5879 rcu_assign_pointer(rq->sd, sd);
5880 destroy_sched_domains(tmp, cpu);
5882 update_top_cache_domain(cpu);
5885 /* cpus with isolated domains */
5886 static cpumask_var_t cpu_isolated_map;
5888 /* Setup the mask of cpus configured for isolated domains */
5889 static int __init isolated_cpu_setup(char *str)
5891 alloc_bootmem_cpumask_var(&cpu_isolated_map);
5892 cpulist_parse(str, cpu_isolated_map);
5896 __setup("isolcpus=", isolated_cpu_setup);
5901 * find_next_best_node - find the next node to include in a sched_domain
5902 * @node: node whose sched_domain we're building
5903 * @used_nodes: nodes already in the sched_domain
5905 * Find the next node to include in a given scheduling domain. Simply
5906 * finds the closest node not already in the @used_nodes map.
5908 * Should use nodemask_t.
5910 static int find_next_best_node(int node, nodemask_t *used_nodes)
5912 int i, n, val, min_val, best_node = -1;
5916 for (i = 0; i < nr_node_ids; i++) {
5917 /* Start at @node */
5918 n = (node + i) % nr_node_ids;
5920 if (!nr_cpus_node(n))
5923 /* Skip already used nodes */
5924 if (node_isset(n, *used_nodes))
5927 /* Simple min distance search */
5928 val = node_distance(node, n);
5930 if (val < min_val) {
5936 if (best_node != -1)
5937 node_set(best_node, *used_nodes);
5942 * sched_domain_node_span - get a cpumask for a node's sched_domain
5943 * @node: node whose cpumask we're constructing
5944 * @span: resulting cpumask
5946 * Given a node, construct a good cpumask for its sched_domain to span. It
5947 * should be one that prevents unnecessary balancing, but also spreads tasks
5950 static void sched_domain_node_span(int node, struct cpumask *span)
5952 nodemask_t used_nodes;
5955 cpumask_clear(span);
5956 nodes_clear(used_nodes);
5958 cpumask_or(span, span, cpumask_of_node(node));
5959 node_set(node, used_nodes);
5961 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
5962 int next_node = find_next_best_node(node, &used_nodes);
5965 cpumask_or(span, span, cpumask_of_node(next_node));
5969 static const struct cpumask *cpu_node_mask(int cpu)
5971 lockdep_assert_held(&sched_domains_mutex);
5973 sched_domain_node_span(cpu_to_node(cpu), sched_domains_tmpmask);
5975 return sched_domains_tmpmask;
5978 static const struct cpumask *cpu_allnodes_mask(int cpu)
5980 return cpu_possible_mask;
5982 #endif /* CONFIG_NUMA */
5984 static const struct cpumask *cpu_cpu_mask(int cpu)
5986 return cpumask_of_node(cpu_to_node(cpu));
5989 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
5992 struct sched_domain **__percpu sd;
5993 struct sched_group **__percpu sg;
5994 struct sched_group_power **__percpu sgp;
5998 struct sched_domain ** __percpu sd;
5999 struct root_domain *rd;
6009 struct sched_domain_topology_level;
6011 typedef struct sched_domain *(*sched_domain_init_f)(struct sched_domain_topology_level *tl, int cpu);
6012 typedef const struct cpumask *(*sched_domain_mask_f)(int cpu);
6014 #define SDTL_OVERLAP 0x01
6016 struct sched_domain_topology_level {
6017 sched_domain_init_f init;
6018 sched_domain_mask_f mask;
6020 struct sd_data data;
6024 build_overlap_sched_groups(struct sched_domain *sd, int cpu)
6026 struct sched_group *first = NULL, *last = NULL, *groups = NULL, *sg;
6027 const struct cpumask *span = sched_domain_span(sd);
6028 struct cpumask *covered = sched_domains_tmpmask;
6029 struct sd_data *sdd = sd->private;
6030 struct sched_domain *child;
6033 cpumask_clear(covered);
6035 for_each_cpu(i, span) {
6036 struct cpumask *sg_span;
6038 if (cpumask_test_cpu(i, covered))
6041 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6042 GFP_KERNEL, cpu_to_node(cpu));
6047 sg_span = sched_group_cpus(sg);
6049 child = *per_cpu_ptr(sdd->sd, i);
6051 child = child->child;
6052 cpumask_copy(sg_span, sched_domain_span(child));
6054 cpumask_set_cpu(i, sg_span);
6056 cpumask_or(covered, covered, sg_span);
6058 sg->sgp = *per_cpu_ptr(sdd->sgp, cpumask_first(sg_span));
6059 atomic_inc(&sg->sgp->ref);
6061 if (cpumask_test_cpu(cpu, sg_span))
6071 sd->groups = groups;
6076 free_sched_groups(first, 0);
6081 static int get_group(int cpu, struct sd_data *sdd, struct sched_group **sg)
6083 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, cpu);
6084 struct sched_domain *child = sd->child;
6087 cpu = cpumask_first(sched_domain_span(child));
6090 *sg = *per_cpu_ptr(sdd->sg, cpu);
6091 (*sg)->sgp = *per_cpu_ptr(sdd->sgp, cpu);
6092 atomic_set(&(*sg)->sgp->ref, 1); /* for claim_allocations */
6099 * build_sched_groups will build a circular linked list of the groups
6100 * covered by the given span, and will set each group's ->cpumask correctly,
6101 * and ->cpu_power to 0.
6103 * Assumes the sched_domain tree is fully constructed
6106 build_sched_groups(struct sched_domain *sd, int cpu)
6108 struct sched_group *first = NULL, *last = NULL;
6109 struct sd_data *sdd = sd->private;
6110 const struct cpumask *span = sched_domain_span(sd);
6111 struct cpumask *covered;
6114 get_group(cpu, sdd, &sd->groups);
6115 atomic_inc(&sd->groups->ref);
6117 if (cpu != cpumask_first(sched_domain_span(sd)))
6120 lockdep_assert_held(&sched_domains_mutex);
6121 covered = sched_domains_tmpmask;
6123 cpumask_clear(covered);
6125 for_each_cpu(i, span) {
6126 struct sched_group *sg;
6127 int group = get_group(i, sdd, &sg);
6130 if (cpumask_test_cpu(i, covered))
6133 cpumask_clear(sched_group_cpus(sg));
6136 for_each_cpu(j, span) {
6137 if (get_group(j, sdd, NULL) != group)
6140 cpumask_set_cpu(j, covered);
6141 cpumask_set_cpu(j, sched_group_cpus(sg));
6156 * Initialize sched groups cpu_power.
6158 * cpu_power indicates the capacity of sched group, which is used while
6159 * distributing the load between different sched groups in a sched domain.
6160 * Typically cpu_power for all the groups in a sched domain will be same unless
6161 * there are asymmetries in the topology. If there are asymmetries, group
6162 * having more cpu_power will pickup more load compared to the group having
6165 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
6167 struct sched_group *sg = sd->groups;
6169 WARN_ON(!sd || !sg);
6172 sg->group_weight = cpumask_weight(sched_group_cpus(sg));
6174 } while (sg != sd->groups);
6176 if (cpu != group_first_cpu(sg))
6179 update_group_power(sd, cpu);
6180 atomic_set(&sg->sgp->nr_busy_cpus, sg->group_weight);
6183 int __weak arch_sd_sibling_asym_packing(void)
6185 return 0*SD_ASYM_PACKING;
6189 * Initializers for schedule domains
6190 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6193 #ifdef CONFIG_SCHED_DEBUG
6194 # define SD_INIT_NAME(sd, type) sd->name = #type
6196 # define SD_INIT_NAME(sd, type) do { } while (0)
6199 #define SD_INIT_FUNC(type) \
6200 static noinline struct sched_domain * \
6201 sd_init_##type(struct sched_domain_topology_level *tl, int cpu) \
6203 struct sched_domain *sd = *per_cpu_ptr(tl->data.sd, cpu); \
6204 *sd = SD_##type##_INIT; \
6205 SD_INIT_NAME(sd, type); \
6206 sd->private = &tl->data; \
6212 SD_INIT_FUNC(ALLNODES)
6215 #ifdef CONFIG_SCHED_SMT
6216 SD_INIT_FUNC(SIBLING)
6218 #ifdef CONFIG_SCHED_MC
6221 #ifdef CONFIG_SCHED_BOOK
6225 static int default_relax_domain_level = -1;
6226 int sched_domain_level_max;
6228 static int __init setup_relax_domain_level(char *str)
6232 val = simple_strtoul(str, NULL, 0);
6233 if (val < sched_domain_level_max)
6234 default_relax_domain_level = val;
6238 __setup("relax_domain_level=", setup_relax_domain_level);
6240 static void set_domain_attribute(struct sched_domain *sd,
6241 struct sched_domain_attr *attr)
6245 if (!attr || attr->relax_domain_level < 0) {
6246 if (default_relax_domain_level < 0)
6249 request = default_relax_domain_level;
6251 request = attr->relax_domain_level;
6252 if (request < sd->level) {
6253 /* turn off idle balance on this domain */
6254 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6256 /* turn on idle balance on this domain */
6257 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6261 static void __sdt_free(const struct cpumask *cpu_map);
6262 static int __sdt_alloc(const struct cpumask *cpu_map);
6264 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6265 const struct cpumask *cpu_map)
6269 if (!atomic_read(&d->rd->refcount))
6270 free_rootdomain(&d->rd->rcu); /* fall through */
6272 free_percpu(d->sd); /* fall through */
6274 __sdt_free(cpu_map); /* fall through */
6280 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6281 const struct cpumask *cpu_map)
6283 memset(d, 0, sizeof(*d));
6285 if (__sdt_alloc(cpu_map))
6286 return sa_sd_storage;
6287 d->sd = alloc_percpu(struct sched_domain *);
6289 return sa_sd_storage;
6290 d->rd = alloc_rootdomain();
6293 return sa_rootdomain;
6297 * NULL the sd_data elements we've used to build the sched_domain and
6298 * sched_group structure so that the subsequent __free_domain_allocs()
6299 * will not free the data we're using.
6301 static void claim_allocations(int cpu, struct sched_domain *sd)
6303 struct sd_data *sdd = sd->private;
6305 WARN_ON_ONCE(*per_cpu_ptr(sdd->sd, cpu) != sd);
6306 *per_cpu_ptr(sdd->sd, cpu) = NULL;
6308 if (atomic_read(&(*per_cpu_ptr(sdd->sg, cpu))->ref))
6309 *per_cpu_ptr(sdd->sg, cpu) = NULL;
6311 if (atomic_read(&(*per_cpu_ptr(sdd->sgp, cpu))->ref))
6312 *per_cpu_ptr(sdd->sgp, cpu) = NULL;
6315 #ifdef CONFIG_SCHED_SMT
6316 static const struct cpumask *cpu_smt_mask(int cpu)
6318 return topology_thread_cpumask(cpu);
6323 * Topology list, bottom-up.
6325 static struct sched_domain_topology_level default_topology[] = {
6326 #ifdef CONFIG_SCHED_SMT
6327 { sd_init_SIBLING, cpu_smt_mask, },
6329 #ifdef CONFIG_SCHED_MC
6330 { sd_init_MC, cpu_coregroup_mask, },
6332 #ifdef CONFIG_SCHED_BOOK
6333 { sd_init_BOOK, cpu_book_mask, },
6335 { sd_init_CPU, cpu_cpu_mask, },
6337 { sd_init_NODE, cpu_node_mask, SDTL_OVERLAP, },
6338 { sd_init_ALLNODES, cpu_allnodes_mask, },
6343 static struct sched_domain_topology_level *sched_domain_topology = default_topology;
6345 static int __sdt_alloc(const struct cpumask *cpu_map)
6347 struct sched_domain_topology_level *tl;
6350 for (tl = sched_domain_topology; tl->init; tl++) {
6351 struct sd_data *sdd = &tl->data;
6353 sdd->sd = alloc_percpu(struct sched_domain *);
6357 sdd->sg = alloc_percpu(struct sched_group *);
6361 sdd->sgp = alloc_percpu(struct sched_group_power *);
6365 for_each_cpu(j, cpu_map) {
6366 struct sched_domain *sd;
6367 struct sched_group *sg;
6368 struct sched_group_power *sgp;
6370 sd = kzalloc_node(sizeof(struct sched_domain) + cpumask_size(),
6371 GFP_KERNEL, cpu_to_node(j));
6375 *per_cpu_ptr(sdd->sd, j) = sd;
6377 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6378 GFP_KERNEL, cpu_to_node(j));
6382 *per_cpu_ptr(sdd->sg, j) = sg;
6384 sgp = kzalloc_node(sizeof(struct sched_group_power),
6385 GFP_KERNEL, cpu_to_node(j));
6389 *per_cpu_ptr(sdd->sgp, j) = sgp;
6396 static void __sdt_free(const struct cpumask *cpu_map)
6398 struct sched_domain_topology_level *tl;
6401 for (tl = sched_domain_topology; tl->init; tl++) {
6402 struct sd_data *sdd = &tl->data;
6404 for_each_cpu(j, cpu_map) {
6405 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, j);
6406 if (sd && (sd->flags & SD_OVERLAP))
6407 free_sched_groups(sd->groups, 0);
6408 kfree(*per_cpu_ptr(sdd->sd, j));
6409 kfree(*per_cpu_ptr(sdd->sg, j));
6410 kfree(*per_cpu_ptr(sdd->sgp, j));
6412 free_percpu(sdd->sd);
6413 free_percpu(sdd->sg);
6414 free_percpu(sdd->sgp);
6418 struct sched_domain *build_sched_domain(struct sched_domain_topology_level *tl,
6419 struct s_data *d, const struct cpumask *cpu_map,
6420 struct sched_domain_attr *attr, struct sched_domain *child,
6423 struct sched_domain *sd = tl->init(tl, cpu);
6427 set_domain_attribute(sd, attr);
6428 cpumask_and(sched_domain_span(sd), cpu_map, tl->mask(cpu));
6430 sd->level = child->level + 1;
6431 sched_domain_level_max = max(sched_domain_level_max, sd->level);
6440 * Build sched domains for a given set of cpus and attach the sched domains
6441 * to the individual cpus
6443 static int build_sched_domains(const struct cpumask *cpu_map,
6444 struct sched_domain_attr *attr)
6446 enum s_alloc alloc_state = sa_none;
6447 struct sched_domain *sd;
6449 int i, ret = -ENOMEM;
6451 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
6452 if (alloc_state != sa_rootdomain)
6455 /* Set up domains for cpus specified by the cpu_map. */
6456 for_each_cpu(i, cpu_map) {
6457 struct sched_domain_topology_level *tl;
6460 for (tl = sched_domain_topology; tl->init; tl++) {
6461 sd = build_sched_domain(tl, &d, cpu_map, attr, sd, i);
6462 if (tl->flags & SDTL_OVERLAP || sched_feat(FORCE_SD_OVERLAP))
6463 sd->flags |= SD_OVERLAP;
6464 if (cpumask_equal(cpu_map, sched_domain_span(sd)))
6471 *per_cpu_ptr(d.sd, i) = sd;
6474 /* Build the groups for the domains */
6475 for_each_cpu(i, cpu_map) {
6476 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6477 sd->span_weight = cpumask_weight(sched_domain_span(sd));
6478 if (sd->flags & SD_OVERLAP) {
6479 if (build_overlap_sched_groups(sd, i))
6482 if (build_sched_groups(sd, i))
6488 /* Calculate CPU power for physical packages and nodes */
6489 for (i = nr_cpumask_bits-1; i >= 0; i--) {
6490 if (!cpumask_test_cpu(i, cpu_map))
6493 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6494 claim_allocations(i, sd);
6495 init_sched_groups_power(i, sd);
6499 /* Attach the domains */
6501 for_each_cpu(i, cpu_map) {
6502 sd = *per_cpu_ptr(d.sd, i);
6503 cpu_attach_domain(sd, d.rd, i);
6509 __free_domain_allocs(&d, alloc_state, cpu_map);
6513 static cpumask_var_t *doms_cur; /* current sched domains */
6514 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
6515 static struct sched_domain_attr *dattr_cur;
6516 /* attribues of custom domains in 'doms_cur' */
6519 * Special case: If a kmalloc of a doms_cur partition (array of
6520 * cpumask) fails, then fallback to a single sched domain,
6521 * as determined by the single cpumask fallback_doms.
6523 static cpumask_var_t fallback_doms;
6526 * arch_update_cpu_topology lets virtualized architectures update the
6527 * cpu core maps. It is supposed to return 1 if the topology changed
6528 * or 0 if it stayed the same.
6530 int __attribute__((weak)) arch_update_cpu_topology(void)
6535 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
6538 cpumask_var_t *doms;
6540 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
6543 for (i = 0; i < ndoms; i++) {
6544 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
6545 free_sched_domains(doms, i);
6552 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
6555 for (i = 0; i < ndoms; i++)
6556 free_cpumask_var(doms[i]);
6561 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
6562 * For now this just excludes isolated cpus, but could be used to
6563 * exclude other special cases in the future.
6565 static int init_sched_domains(const struct cpumask *cpu_map)
6569 arch_update_cpu_topology();
6571 doms_cur = alloc_sched_domains(ndoms_cur);
6573 doms_cur = &fallback_doms;
6574 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
6576 err = build_sched_domains(doms_cur[0], NULL);
6577 register_sched_domain_sysctl();
6583 * Detach sched domains from a group of cpus specified in cpu_map
6584 * These cpus will now be attached to the NULL domain
6586 static void detach_destroy_domains(const struct cpumask *cpu_map)
6591 for_each_cpu(i, cpu_map)
6592 cpu_attach_domain(NULL, &def_root_domain, i);
6596 /* handle null as "default" */
6597 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
6598 struct sched_domain_attr *new, int idx_new)
6600 struct sched_domain_attr tmp;
6607 return !memcmp(cur ? (cur + idx_cur) : &tmp,
6608 new ? (new + idx_new) : &tmp,
6609 sizeof(struct sched_domain_attr));
6613 * Partition sched domains as specified by the 'ndoms_new'
6614 * cpumasks in the array doms_new[] of cpumasks. This compares
6615 * doms_new[] to the current sched domain partitioning, doms_cur[].
6616 * It destroys each deleted domain and builds each new domain.
6618 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
6619 * The masks don't intersect (don't overlap.) We should setup one
6620 * sched domain for each mask. CPUs not in any of the cpumasks will
6621 * not be load balanced. If the same cpumask appears both in the
6622 * current 'doms_cur' domains and in the new 'doms_new', we can leave
6625 * The passed in 'doms_new' should be allocated using
6626 * alloc_sched_domains. This routine takes ownership of it and will
6627 * free_sched_domains it when done with it. If the caller failed the
6628 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
6629 * and partition_sched_domains() will fallback to the single partition
6630 * 'fallback_doms', it also forces the domains to be rebuilt.
6632 * If doms_new == NULL it will be replaced with cpu_online_mask.
6633 * ndoms_new == 0 is a special case for destroying existing domains,
6634 * and it will not create the default domain.
6636 * Call with hotplug lock held
6638 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
6639 struct sched_domain_attr *dattr_new)
6644 mutex_lock(&sched_domains_mutex);
6646 /* always unregister in case we don't destroy any domains */
6647 unregister_sched_domain_sysctl();
6649 /* Let architecture update cpu core mappings. */
6650 new_topology = arch_update_cpu_topology();
6652 n = doms_new ? ndoms_new : 0;
6654 /* Destroy deleted domains */
6655 for (i = 0; i < ndoms_cur; i++) {
6656 for (j = 0; j < n && !new_topology; j++) {
6657 if (cpumask_equal(doms_cur[i], doms_new[j])
6658 && dattrs_equal(dattr_cur, i, dattr_new, j))
6661 /* no match - a current sched domain not in new doms_new[] */
6662 detach_destroy_domains(doms_cur[i]);
6667 if (doms_new == NULL) {
6669 doms_new = &fallback_doms;
6670 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
6671 WARN_ON_ONCE(dattr_new);
6674 /* Build new domains */
6675 for (i = 0; i < ndoms_new; i++) {
6676 for (j = 0; j < ndoms_cur && !new_topology; j++) {
6677 if (cpumask_equal(doms_new[i], doms_cur[j])
6678 && dattrs_equal(dattr_new, i, dattr_cur, j))
6681 /* no match - add a new doms_new */
6682 build_sched_domains(doms_new[i], dattr_new ? dattr_new + i : NULL);
6687 /* Remember the new sched domains */
6688 if (doms_cur != &fallback_doms)
6689 free_sched_domains(doms_cur, ndoms_cur);
6690 kfree(dattr_cur); /* kfree(NULL) is safe */
6691 doms_cur = doms_new;
6692 dattr_cur = dattr_new;
6693 ndoms_cur = ndoms_new;
6695 register_sched_domain_sysctl();
6697 mutex_unlock(&sched_domains_mutex);
6700 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
6701 static void reinit_sched_domains(void)
6705 /* Destroy domains first to force the rebuild */
6706 partition_sched_domains(0, NULL, NULL);
6708 rebuild_sched_domains();
6712 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
6714 unsigned int level = 0;
6716 if (sscanf(buf, "%u", &level) != 1)
6720 * level is always be positive so don't check for
6721 * level < POWERSAVINGS_BALANCE_NONE which is 0
6722 * What happens on 0 or 1 byte write,
6723 * need to check for count as well?
6726 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
6730 sched_smt_power_savings = level;
6732 sched_mc_power_savings = level;
6734 reinit_sched_domains();
6739 #ifdef CONFIG_SCHED_MC
6740 static ssize_t sched_mc_power_savings_show(struct device *dev,
6741 struct device_attribute *attr,
6744 return sprintf(buf, "%u\n", sched_mc_power_savings);
6746 static ssize_t sched_mc_power_savings_store(struct device *dev,
6747 struct device_attribute *attr,
6748 const char *buf, size_t count)
6750 return sched_power_savings_store(buf, count, 0);
6752 static DEVICE_ATTR(sched_mc_power_savings, 0644,
6753 sched_mc_power_savings_show,
6754 sched_mc_power_savings_store);
6757 #ifdef CONFIG_SCHED_SMT
6758 static ssize_t sched_smt_power_savings_show(struct device *dev,
6759 struct device_attribute *attr,
6762 return sprintf(buf, "%u\n", sched_smt_power_savings);
6764 static ssize_t sched_smt_power_savings_store(struct device *dev,
6765 struct device_attribute *attr,
6766 const char *buf, size_t count)
6768 return sched_power_savings_store(buf, count, 1);
6770 static DEVICE_ATTR(sched_smt_power_savings, 0644,
6771 sched_smt_power_savings_show,
6772 sched_smt_power_savings_store);
6775 int __init sched_create_sysfs_power_savings_entries(struct device *dev)
6779 #ifdef CONFIG_SCHED_SMT
6781 err = device_create_file(dev, &dev_attr_sched_smt_power_savings);
6783 #ifdef CONFIG_SCHED_MC
6784 if (!err && mc_capable())
6785 err = device_create_file(dev, &dev_attr_sched_mc_power_savings);
6789 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
6792 * Update cpusets according to cpu_active mask. If cpusets are
6793 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
6794 * around partition_sched_domains().
6796 static int cpuset_cpu_active(struct notifier_block *nfb, unsigned long action,
6799 switch (action & ~CPU_TASKS_FROZEN) {
6801 case CPU_DOWN_FAILED:
6802 cpuset_update_active_cpus();
6809 static int cpuset_cpu_inactive(struct notifier_block *nfb, unsigned long action,
6812 switch (action & ~CPU_TASKS_FROZEN) {
6813 case CPU_DOWN_PREPARE:
6814 cpuset_update_active_cpus();
6821 void __init sched_init_smp(void)
6823 cpumask_var_t non_isolated_cpus;
6825 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
6826 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
6829 mutex_lock(&sched_domains_mutex);
6830 init_sched_domains(cpu_active_mask);
6831 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
6832 if (cpumask_empty(non_isolated_cpus))
6833 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
6834 mutex_unlock(&sched_domains_mutex);
6837 hotcpu_notifier(cpuset_cpu_active, CPU_PRI_CPUSET_ACTIVE);
6838 hotcpu_notifier(cpuset_cpu_inactive, CPU_PRI_CPUSET_INACTIVE);
6840 /* RT runtime code needs to handle some hotplug events */
6841 hotcpu_notifier(update_runtime, 0);
6845 /* Move init over to a non-isolated CPU */
6846 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
6848 sched_init_granularity();
6849 free_cpumask_var(non_isolated_cpus);
6851 init_sched_rt_class();
6854 void __init sched_init_smp(void)
6856 sched_init_granularity();
6858 #endif /* CONFIG_SMP */
6860 const_debug unsigned int sysctl_timer_migration = 1;
6862 int in_sched_functions(unsigned long addr)
6864 return in_lock_functions(addr) ||
6865 (addr >= (unsigned long)__sched_text_start
6866 && addr < (unsigned long)__sched_text_end);
6869 #ifdef CONFIG_CGROUP_SCHED
6870 struct task_group root_task_group;
6873 DECLARE_PER_CPU(cpumask_var_t, load_balance_tmpmask);
6875 void __init sched_init(void)
6878 unsigned long alloc_size = 0, ptr;
6880 #ifdef CONFIG_FAIR_GROUP_SCHED
6881 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6883 #ifdef CONFIG_RT_GROUP_SCHED
6884 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6886 #ifdef CONFIG_CPUMASK_OFFSTACK
6887 alloc_size += num_possible_cpus() * cpumask_size();
6890 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
6892 #ifdef CONFIG_FAIR_GROUP_SCHED
6893 root_task_group.se = (struct sched_entity **)ptr;
6894 ptr += nr_cpu_ids * sizeof(void **);
6896 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
6897 ptr += nr_cpu_ids * sizeof(void **);
6899 #endif /* CONFIG_FAIR_GROUP_SCHED */
6900 #ifdef CONFIG_RT_GROUP_SCHED
6901 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
6902 ptr += nr_cpu_ids * sizeof(void **);
6904 root_task_group.rt_rq = (struct rt_rq **)ptr;
6905 ptr += nr_cpu_ids * sizeof(void **);
6907 #endif /* CONFIG_RT_GROUP_SCHED */
6908 #ifdef CONFIG_CPUMASK_OFFSTACK
6909 for_each_possible_cpu(i) {
6910 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
6911 ptr += cpumask_size();
6913 #endif /* CONFIG_CPUMASK_OFFSTACK */
6917 init_defrootdomain();
6920 init_rt_bandwidth(&def_rt_bandwidth,
6921 global_rt_period(), global_rt_runtime());
6923 #ifdef CONFIG_RT_GROUP_SCHED
6924 init_rt_bandwidth(&root_task_group.rt_bandwidth,
6925 global_rt_period(), global_rt_runtime());
6926 #endif /* CONFIG_RT_GROUP_SCHED */
6928 #ifdef CONFIG_CGROUP_SCHED
6929 list_add(&root_task_group.list, &task_groups);
6930 INIT_LIST_HEAD(&root_task_group.children);
6931 INIT_LIST_HEAD(&root_task_group.siblings);
6932 autogroup_init(&init_task);
6934 #endif /* CONFIG_CGROUP_SCHED */
6936 #ifdef CONFIG_CGROUP_CPUACCT
6937 root_cpuacct.cpustat = &kernel_cpustat;
6938 root_cpuacct.cpuusage = alloc_percpu(u64);
6939 /* Too early, not expected to fail */
6940 BUG_ON(!root_cpuacct.cpuusage);
6942 for_each_possible_cpu(i) {
6946 raw_spin_lock_init(&rq->lock);
6948 rq->calc_load_active = 0;
6949 rq->calc_load_update = jiffies + LOAD_FREQ;
6950 init_cfs_rq(&rq->cfs);
6951 init_rt_rq(&rq->rt, rq);
6952 #ifdef CONFIG_FAIR_GROUP_SCHED
6953 root_task_group.shares = ROOT_TASK_GROUP_LOAD;
6954 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
6956 * How much cpu bandwidth does root_task_group get?
6958 * In case of task-groups formed thr' the cgroup filesystem, it
6959 * gets 100% of the cpu resources in the system. This overall
6960 * system cpu resource is divided among the tasks of
6961 * root_task_group and its child task-groups in a fair manner,
6962 * based on each entity's (task or task-group's) weight
6963 * (se->load.weight).
6965 * In other words, if root_task_group has 10 tasks of weight
6966 * 1024) and two child groups A0 and A1 (of weight 1024 each),
6967 * then A0's share of the cpu resource is:
6969 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
6971 * We achieve this by letting root_task_group's tasks sit
6972 * directly in rq->cfs (i.e root_task_group->se[] = NULL).
6974 init_cfs_bandwidth(&root_task_group.cfs_bandwidth);
6975 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL);
6976 #endif /* CONFIG_FAIR_GROUP_SCHED */
6978 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
6979 #ifdef CONFIG_RT_GROUP_SCHED
6980 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
6981 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL);
6984 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
6985 rq->cpu_load[j] = 0;
6987 rq->last_load_update_tick = jiffies;
6992 rq->cpu_power = SCHED_POWER_SCALE;
6993 rq->post_schedule = 0;
6994 rq->active_balance = 0;
6995 rq->next_balance = jiffies;
7000 rq->avg_idle = 2*sysctl_sched_migration_cost;
7002 INIT_LIST_HEAD(&rq->cfs_tasks);
7004 rq_attach_root(rq, &def_root_domain);
7010 atomic_set(&rq->nr_iowait, 0);
7013 set_load_weight(&init_task);
7015 #ifdef CONFIG_PREEMPT_NOTIFIERS
7016 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
7019 #ifdef CONFIG_RT_MUTEXES
7020 plist_head_init(&init_task.pi_waiters);
7024 * The boot idle thread does lazy MMU switching as well:
7026 atomic_inc(&init_mm.mm_count);
7027 enter_lazy_tlb(&init_mm, current);
7030 * Make us the idle thread. Technically, schedule() should not be
7031 * called from this thread, however somewhere below it might be,
7032 * but because we are the idle thread, we just pick up running again
7033 * when this runqueue becomes "idle".
7035 init_idle(current, smp_processor_id());
7037 calc_load_update = jiffies + LOAD_FREQ;
7040 * During early bootup we pretend to be a normal task:
7042 current->sched_class = &fair_sched_class;
7045 zalloc_cpumask_var(&sched_domains_tmpmask, GFP_NOWAIT);
7046 /* May be allocated at isolcpus cmdline parse time */
7047 if (cpu_isolated_map == NULL)
7048 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7050 init_sched_fair_class();
7052 scheduler_running = 1;
7055 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
7056 static inline int preempt_count_equals(int preempt_offset)
7058 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
7060 return (nested == preempt_offset);
7063 void __might_sleep(const char *file, int line, int preempt_offset)
7065 static unsigned long prev_jiffy; /* ratelimiting */
7067 rcu_sleep_check(); /* WARN_ON_ONCE() by default, no rate limit reqd. */
7068 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
7069 system_state != SYSTEM_RUNNING || oops_in_progress)
7071 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7073 prev_jiffy = jiffies;
7076 "BUG: sleeping function called from invalid context at %s:%d\n",
7079 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7080 in_atomic(), irqs_disabled(),
7081 current->pid, current->comm);
7083 debug_show_held_locks(current);
7084 if (irqs_disabled())
7085 print_irqtrace_events(current);
7088 EXPORT_SYMBOL(__might_sleep);
7091 #ifdef CONFIG_MAGIC_SYSRQ
7092 static void normalize_task(struct rq *rq, struct task_struct *p)
7094 const struct sched_class *prev_class = p->sched_class;
7095 int old_prio = p->prio;
7100 dequeue_task(rq, p, 0);
7101 __setscheduler(rq, p, SCHED_NORMAL, 0);
7103 enqueue_task(rq, p, 0);
7104 resched_task(rq->curr);
7107 check_class_changed(rq, p, prev_class, old_prio);
7110 void normalize_rt_tasks(void)
7112 struct task_struct *g, *p;
7113 unsigned long flags;
7116 read_lock_irqsave(&tasklist_lock, flags);
7117 do_each_thread(g, p) {
7119 * Only normalize user tasks:
7124 p->se.exec_start = 0;
7125 #ifdef CONFIG_SCHEDSTATS
7126 p->se.statistics.wait_start = 0;
7127 p->se.statistics.sleep_start = 0;
7128 p->se.statistics.block_start = 0;
7133 * Renice negative nice level userspace
7136 if (TASK_NICE(p) < 0 && p->mm)
7137 set_user_nice(p, 0);
7141 raw_spin_lock(&p->pi_lock);
7142 rq = __task_rq_lock(p);
7144 normalize_task(rq, p);
7146 __task_rq_unlock(rq);
7147 raw_spin_unlock(&p->pi_lock);
7148 } while_each_thread(g, p);
7150 read_unlock_irqrestore(&tasklist_lock, flags);
7153 #endif /* CONFIG_MAGIC_SYSRQ */
7155 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
7157 * These functions are only useful for the IA64 MCA handling, or kdb.
7159 * They can only be called when the whole system has been
7160 * stopped - every CPU needs to be quiescent, and no scheduling
7161 * activity can take place. Using them for anything else would
7162 * be a serious bug, and as a result, they aren't even visible
7163 * under any other configuration.
7167 * curr_task - return the current task for a given cpu.
7168 * @cpu: the processor in question.
7170 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7172 struct task_struct *curr_task(int cpu)
7174 return cpu_curr(cpu);
7177 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
7181 * set_curr_task - set the current task for a given cpu.
7182 * @cpu: the processor in question.
7183 * @p: the task pointer to set.
7185 * Description: This function must only be used when non-maskable interrupts
7186 * are serviced on a separate stack. It allows the architecture to switch the
7187 * notion of the current task on a cpu in a non-blocking manner. This function
7188 * must be called with all CPU's synchronized, and interrupts disabled, the
7189 * and caller must save the original value of the current task (see
7190 * curr_task() above) and restore that value before reenabling interrupts and
7191 * re-starting the system.
7193 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7195 void set_curr_task(int cpu, struct task_struct *p)
7202 #ifdef CONFIG_CGROUP_SCHED
7203 /* task_group_lock serializes the addition/removal of task groups */
7204 static DEFINE_SPINLOCK(task_group_lock);
7206 static void free_sched_group(struct task_group *tg)
7208 free_fair_sched_group(tg);
7209 free_rt_sched_group(tg);
7214 /* allocate runqueue etc for a new task group */
7215 struct task_group *sched_create_group(struct task_group *parent)
7217 struct task_group *tg;
7218 unsigned long flags;
7220 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
7222 return ERR_PTR(-ENOMEM);
7224 if (!alloc_fair_sched_group(tg, parent))
7227 if (!alloc_rt_sched_group(tg, parent))
7230 spin_lock_irqsave(&task_group_lock, flags);
7231 list_add_rcu(&tg->list, &task_groups);
7233 WARN_ON(!parent); /* root should already exist */
7235 tg->parent = parent;
7236 INIT_LIST_HEAD(&tg->children);
7237 list_add_rcu(&tg->siblings, &parent->children);
7238 spin_unlock_irqrestore(&task_group_lock, flags);
7243 free_sched_group(tg);
7244 return ERR_PTR(-ENOMEM);
7247 /* rcu callback to free various structures associated with a task group */
7248 static void free_sched_group_rcu(struct rcu_head *rhp)
7250 /* now it should be safe to free those cfs_rqs */
7251 free_sched_group(container_of(rhp, struct task_group, rcu));
7254 /* Destroy runqueue etc associated with a task group */
7255 void sched_destroy_group(struct task_group *tg)
7257 unsigned long flags;
7260 /* end participation in shares distribution */
7261 for_each_possible_cpu(i)
7262 unregister_fair_sched_group(tg, i);
7264 spin_lock_irqsave(&task_group_lock, flags);
7265 list_del_rcu(&tg->list);
7266 list_del_rcu(&tg->siblings);
7267 spin_unlock_irqrestore(&task_group_lock, flags);
7269 /* wait for possible concurrent references to cfs_rqs complete */
7270 call_rcu(&tg->rcu, free_sched_group_rcu);
7273 /* change task's runqueue when it moves between groups.
7274 * The caller of this function should have put the task in its new group
7275 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
7276 * reflect its new group.
7278 void sched_move_task(struct task_struct *tsk)
7281 unsigned long flags;
7284 rq = task_rq_lock(tsk, &flags);
7286 running = task_current(rq, tsk);
7290 dequeue_task(rq, tsk, 0);
7291 if (unlikely(running))
7292 tsk->sched_class->put_prev_task(rq, tsk);
7294 #ifdef CONFIG_FAIR_GROUP_SCHED
7295 if (tsk->sched_class->task_move_group)
7296 tsk->sched_class->task_move_group(tsk, on_rq);
7299 set_task_rq(tsk, task_cpu(tsk));
7301 if (unlikely(running))
7302 tsk->sched_class->set_curr_task(rq);
7304 enqueue_task(rq, tsk, 0);
7306 task_rq_unlock(rq, tsk, &flags);
7308 #endif /* CONFIG_CGROUP_SCHED */
7310 #if defined(CONFIG_RT_GROUP_SCHED) || defined(CONFIG_CFS_BANDWIDTH)
7311 static unsigned long to_ratio(u64 period, u64 runtime)
7313 if (runtime == RUNTIME_INF)
7316 return div64_u64(runtime << 20, period);
7320 #ifdef CONFIG_RT_GROUP_SCHED
7322 * Ensure that the real time constraints are schedulable.
7324 static DEFINE_MUTEX(rt_constraints_mutex);
7326 /* Must be called with tasklist_lock held */
7327 static inline int tg_has_rt_tasks(struct task_group *tg)
7329 struct task_struct *g, *p;
7331 do_each_thread(g, p) {
7332 if (rt_task(p) && task_rq(p)->rt.tg == tg)
7334 } while_each_thread(g, p);
7339 struct rt_schedulable_data {
7340 struct task_group *tg;
7345 static int tg_rt_schedulable(struct task_group *tg, void *data)
7347 struct rt_schedulable_data *d = data;
7348 struct task_group *child;
7349 unsigned long total, sum = 0;
7350 u64 period, runtime;
7352 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7353 runtime = tg->rt_bandwidth.rt_runtime;
7356 period = d->rt_period;
7357 runtime = d->rt_runtime;
7361 * Cannot have more runtime than the period.
7363 if (runtime > period && runtime != RUNTIME_INF)
7367 * Ensure we don't starve existing RT tasks.
7369 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
7372 total = to_ratio(period, runtime);
7375 * Nobody can have more than the global setting allows.
7377 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
7381 * The sum of our children's runtime should not exceed our own.
7383 list_for_each_entry_rcu(child, &tg->children, siblings) {
7384 period = ktime_to_ns(child->rt_bandwidth.rt_period);
7385 runtime = child->rt_bandwidth.rt_runtime;
7387 if (child == d->tg) {
7388 period = d->rt_period;
7389 runtime = d->rt_runtime;
7392 sum += to_ratio(period, runtime);
7401 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
7405 struct rt_schedulable_data data = {
7407 .rt_period = period,
7408 .rt_runtime = runtime,
7412 ret = walk_tg_tree(tg_rt_schedulable, tg_nop, &data);
7418 static int tg_set_rt_bandwidth(struct task_group *tg,
7419 u64 rt_period, u64 rt_runtime)
7423 mutex_lock(&rt_constraints_mutex);
7424 read_lock(&tasklist_lock);
7425 err = __rt_schedulable(tg, rt_period, rt_runtime);
7429 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7430 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
7431 tg->rt_bandwidth.rt_runtime = rt_runtime;
7433 for_each_possible_cpu(i) {
7434 struct rt_rq *rt_rq = tg->rt_rq[i];
7436 raw_spin_lock(&rt_rq->rt_runtime_lock);
7437 rt_rq->rt_runtime = rt_runtime;
7438 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7440 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7442 read_unlock(&tasklist_lock);
7443 mutex_unlock(&rt_constraints_mutex);
7448 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
7450 u64 rt_runtime, rt_period;
7452 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7453 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
7454 if (rt_runtime_us < 0)
7455 rt_runtime = RUNTIME_INF;
7457 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7460 long sched_group_rt_runtime(struct task_group *tg)
7464 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
7467 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
7468 do_div(rt_runtime_us, NSEC_PER_USEC);
7469 return rt_runtime_us;
7472 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
7474 u64 rt_runtime, rt_period;
7476 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
7477 rt_runtime = tg->rt_bandwidth.rt_runtime;
7482 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7485 long sched_group_rt_period(struct task_group *tg)
7489 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
7490 do_div(rt_period_us, NSEC_PER_USEC);
7491 return rt_period_us;
7494 static int sched_rt_global_constraints(void)
7496 u64 runtime, period;
7499 if (sysctl_sched_rt_period <= 0)
7502 runtime = global_rt_runtime();
7503 period = global_rt_period();
7506 * Sanity check on the sysctl variables.
7508 if (runtime > period && runtime != RUNTIME_INF)
7511 mutex_lock(&rt_constraints_mutex);
7512 read_lock(&tasklist_lock);
7513 ret = __rt_schedulable(NULL, 0, 0);
7514 read_unlock(&tasklist_lock);
7515 mutex_unlock(&rt_constraints_mutex);
7520 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
7522 /* Don't accept realtime tasks when there is no way for them to run */
7523 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
7529 #else /* !CONFIG_RT_GROUP_SCHED */
7530 static int sched_rt_global_constraints(void)
7532 unsigned long flags;
7535 if (sysctl_sched_rt_period <= 0)
7539 * There's always some RT tasks in the root group
7540 * -- migration, kstopmachine etc..
7542 if (sysctl_sched_rt_runtime == 0)
7545 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
7546 for_each_possible_cpu(i) {
7547 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
7549 raw_spin_lock(&rt_rq->rt_runtime_lock);
7550 rt_rq->rt_runtime = global_rt_runtime();
7551 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7553 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
7557 #endif /* CONFIG_RT_GROUP_SCHED */
7559 int sched_rt_handler(struct ctl_table *table, int write,
7560 void __user *buffer, size_t *lenp,
7564 int old_period, old_runtime;
7565 static DEFINE_MUTEX(mutex);
7568 old_period = sysctl_sched_rt_period;
7569 old_runtime = sysctl_sched_rt_runtime;
7571 ret = proc_dointvec(table, write, buffer, lenp, ppos);
7573 if (!ret && write) {
7574 ret = sched_rt_global_constraints();
7576 sysctl_sched_rt_period = old_period;
7577 sysctl_sched_rt_runtime = old_runtime;
7579 def_rt_bandwidth.rt_runtime = global_rt_runtime();
7580 def_rt_bandwidth.rt_period =
7581 ns_to_ktime(global_rt_period());
7584 mutex_unlock(&mutex);
7589 #ifdef CONFIG_CGROUP_SCHED
7591 /* return corresponding task_group object of a cgroup */
7592 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
7594 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
7595 struct task_group, css);
7598 static struct cgroup_subsys_state *
7599 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
7601 struct task_group *tg, *parent;
7603 if (!cgrp->parent) {
7604 /* This is early initialization for the top cgroup */
7605 return &root_task_group.css;
7608 parent = cgroup_tg(cgrp->parent);
7609 tg = sched_create_group(parent);
7611 return ERR_PTR(-ENOMEM);
7617 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
7619 struct task_group *tg = cgroup_tg(cgrp);
7621 sched_destroy_group(tg);
7624 static int cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
7625 struct cgroup_taskset *tset)
7627 struct task_struct *task;
7629 cgroup_taskset_for_each(task, cgrp, tset) {
7630 #ifdef CONFIG_RT_GROUP_SCHED
7631 if (!sched_rt_can_attach(cgroup_tg(cgrp), task))
7634 /* We don't support RT-tasks being in separate groups */
7635 if (task->sched_class != &fair_sched_class)
7642 static void cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
7643 struct cgroup_taskset *tset)
7645 struct task_struct *task;
7647 cgroup_taskset_for_each(task, cgrp, tset)
7648 sched_move_task(task);
7652 cpu_cgroup_exit(struct cgroup_subsys *ss, struct cgroup *cgrp,
7653 struct cgroup *old_cgrp, struct task_struct *task)
7656 * cgroup_exit() is called in the copy_process() failure path.
7657 * Ignore this case since the task hasn't ran yet, this avoids
7658 * trying to poke a half freed task state from generic code.
7660 if (!(task->flags & PF_EXITING))
7663 sched_move_task(task);
7666 #ifdef CONFIG_FAIR_GROUP_SCHED
7667 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
7670 return sched_group_set_shares(cgroup_tg(cgrp), scale_load(shareval));
7673 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
7675 struct task_group *tg = cgroup_tg(cgrp);
7677 return (u64) scale_load_down(tg->shares);
7680 #ifdef CONFIG_CFS_BANDWIDTH
7681 static DEFINE_MUTEX(cfs_constraints_mutex);
7683 const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */
7684 const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */
7686 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime);
7688 static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota)
7690 int i, ret = 0, runtime_enabled, runtime_was_enabled;
7691 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7693 if (tg == &root_task_group)
7697 * Ensure we have at some amount of bandwidth every period. This is
7698 * to prevent reaching a state of large arrears when throttled via
7699 * entity_tick() resulting in prolonged exit starvation.
7701 if (quota < min_cfs_quota_period || period < min_cfs_quota_period)
7705 * Likewise, bound things on the otherside by preventing insane quota
7706 * periods. This also allows us to normalize in computing quota
7709 if (period > max_cfs_quota_period)
7712 mutex_lock(&cfs_constraints_mutex);
7713 ret = __cfs_schedulable(tg, period, quota);
7717 runtime_enabled = quota != RUNTIME_INF;
7718 runtime_was_enabled = cfs_b->quota != RUNTIME_INF;
7719 account_cfs_bandwidth_used(runtime_enabled, runtime_was_enabled);
7720 raw_spin_lock_irq(&cfs_b->lock);
7721 cfs_b->period = ns_to_ktime(period);
7722 cfs_b->quota = quota;
7724 __refill_cfs_bandwidth_runtime(cfs_b);
7725 /* restart the period timer (if active) to handle new period expiry */
7726 if (runtime_enabled && cfs_b->timer_active) {
7727 /* force a reprogram */
7728 cfs_b->timer_active = 0;
7729 __start_cfs_bandwidth(cfs_b);
7731 raw_spin_unlock_irq(&cfs_b->lock);
7733 for_each_possible_cpu(i) {
7734 struct cfs_rq *cfs_rq = tg->cfs_rq[i];
7735 struct rq *rq = cfs_rq->rq;
7737 raw_spin_lock_irq(&rq->lock);
7738 cfs_rq->runtime_enabled = runtime_enabled;
7739 cfs_rq->runtime_remaining = 0;
7741 if (cfs_rq->throttled)
7742 unthrottle_cfs_rq(cfs_rq);
7743 raw_spin_unlock_irq(&rq->lock);
7746 mutex_unlock(&cfs_constraints_mutex);
7751 int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us)
7755 period = ktime_to_ns(tg->cfs_bandwidth.period);
7756 if (cfs_quota_us < 0)
7757 quota = RUNTIME_INF;
7759 quota = (u64)cfs_quota_us * NSEC_PER_USEC;
7761 return tg_set_cfs_bandwidth(tg, period, quota);
7764 long tg_get_cfs_quota(struct task_group *tg)
7768 if (tg->cfs_bandwidth.quota == RUNTIME_INF)
7771 quota_us = tg->cfs_bandwidth.quota;
7772 do_div(quota_us, NSEC_PER_USEC);
7777 int tg_set_cfs_period(struct task_group *tg, long cfs_period_us)
7781 period = (u64)cfs_period_us * NSEC_PER_USEC;
7782 quota = tg->cfs_bandwidth.quota;
7784 return tg_set_cfs_bandwidth(tg, period, quota);
7787 long tg_get_cfs_period(struct task_group *tg)
7791 cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period);
7792 do_div(cfs_period_us, NSEC_PER_USEC);
7794 return cfs_period_us;
7797 static s64 cpu_cfs_quota_read_s64(struct cgroup *cgrp, struct cftype *cft)
7799 return tg_get_cfs_quota(cgroup_tg(cgrp));
7802 static int cpu_cfs_quota_write_s64(struct cgroup *cgrp, struct cftype *cftype,
7805 return tg_set_cfs_quota(cgroup_tg(cgrp), cfs_quota_us);
7808 static u64 cpu_cfs_period_read_u64(struct cgroup *cgrp, struct cftype *cft)
7810 return tg_get_cfs_period(cgroup_tg(cgrp));
7813 static int cpu_cfs_period_write_u64(struct cgroup *cgrp, struct cftype *cftype,
7816 return tg_set_cfs_period(cgroup_tg(cgrp), cfs_period_us);
7819 struct cfs_schedulable_data {
7820 struct task_group *tg;
7825 * normalize group quota/period to be quota/max_period
7826 * note: units are usecs
7828 static u64 normalize_cfs_quota(struct task_group *tg,
7829 struct cfs_schedulable_data *d)
7837 period = tg_get_cfs_period(tg);
7838 quota = tg_get_cfs_quota(tg);
7841 /* note: these should typically be equivalent */
7842 if (quota == RUNTIME_INF || quota == -1)
7845 return to_ratio(period, quota);
7848 static int tg_cfs_schedulable_down(struct task_group *tg, void *data)
7850 struct cfs_schedulable_data *d = data;
7851 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7852 s64 quota = 0, parent_quota = -1;
7855 quota = RUNTIME_INF;
7857 struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth;
7859 quota = normalize_cfs_quota(tg, d);
7860 parent_quota = parent_b->hierarchal_quota;
7863 * ensure max(child_quota) <= parent_quota, inherit when no
7866 if (quota == RUNTIME_INF)
7867 quota = parent_quota;
7868 else if (parent_quota != RUNTIME_INF && quota > parent_quota)
7871 cfs_b->hierarchal_quota = quota;
7876 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota)
7879 struct cfs_schedulable_data data = {
7885 if (quota != RUNTIME_INF) {
7886 do_div(data.period, NSEC_PER_USEC);
7887 do_div(data.quota, NSEC_PER_USEC);
7891 ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data);
7897 static int cpu_stats_show(struct cgroup *cgrp, struct cftype *cft,
7898 struct cgroup_map_cb *cb)
7900 struct task_group *tg = cgroup_tg(cgrp);
7901 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7903 cb->fill(cb, "nr_periods", cfs_b->nr_periods);
7904 cb->fill(cb, "nr_throttled", cfs_b->nr_throttled);
7905 cb->fill(cb, "throttled_time", cfs_b->throttled_time);
7909 #endif /* CONFIG_CFS_BANDWIDTH */
7910 #endif /* CONFIG_FAIR_GROUP_SCHED */
7912 #ifdef CONFIG_RT_GROUP_SCHED
7913 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
7916 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
7919 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
7921 return sched_group_rt_runtime(cgroup_tg(cgrp));
7924 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
7927 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
7930 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
7932 return sched_group_rt_period(cgroup_tg(cgrp));
7934 #endif /* CONFIG_RT_GROUP_SCHED */
7936 static struct cftype cpu_files[] = {
7937 #ifdef CONFIG_FAIR_GROUP_SCHED
7940 .read_u64 = cpu_shares_read_u64,
7941 .write_u64 = cpu_shares_write_u64,
7944 #ifdef CONFIG_CFS_BANDWIDTH
7946 .name = "cfs_quota_us",
7947 .read_s64 = cpu_cfs_quota_read_s64,
7948 .write_s64 = cpu_cfs_quota_write_s64,
7951 .name = "cfs_period_us",
7952 .read_u64 = cpu_cfs_period_read_u64,
7953 .write_u64 = cpu_cfs_period_write_u64,
7957 .read_map = cpu_stats_show,
7960 #ifdef CONFIG_RT_GROUP_SCHED
7962 .name = "rt_runtime_us",
7963 .read_s64 = cpu_rt_runtime_read,
7964 .write_s64 = cpu_rt_runtime_write,
7967 .name = "rt_period_us",
7968 .read_u64 = cpu_rt_period_read_uint,
7969 .write_u64 = cpu_rt_period_write_uint,
7974 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
7976 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
7979 struct cgroup_subsys cpu_cgroup_subsys = {
7981 .create = cpu_cgroup_create,
7982 .destroy = cpu_cgroup_destroy,
7983 .can_attach = cpu_cgroup_can_attach,
7984 .attach = cpu_cgroup_attach,
7985 .exit = cpu_cgroup_exit,
7986 .populate = cpu_cgroup_populate,
7987 .subsys_id = cpu_cgroup_subsys_id,
7991 #endif /* CONFIG_CGROUP_SCHED */
7993 #ifdef CONFIG_CGROUP_CPUACCT
7996 * CPU accounting code for task groups.
7998 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
7999 * (balbir@in.ibm.com).
8002 /* create a new cpu accounting group */
8003 static struct cgroup_subsys_state *cpuacct_create(
8004 struct cgroup_subsys *ss, struct cgroup *cgrp)
8009 return &root_cpuacct.css;
8011 ca = kzalloc(sizeof(*ca), GFP_KERNEL);
8015 ca->cpuusage = alloc_percpu(u64);
8019 ca->cpustat = alloc_percpu(struct kernel_cpustat);
8021 goto out_free_cpuusage;
8026 free_percpu(ca->cpuusage);
8030 return ERR_PTR(-ENOMEM);
8033 /* destroy an existing cpu accounting group */
8035 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
8037 struct cpuacct *ca = cgroup_ca(cgrp);
8039 free_percpu(ca->cpustat);
8040 free_percpu(ca->cpuusage);
8044 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
8046 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8049 #ifndef CONFIG_64BIT
8051 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
8053 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8055 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8063 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
8065 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8067 #ifndef CONFIG_64BIT
8069 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
8071 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8073 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8079 /* return total cpu usage (in nanoseconds) of a group */
8080 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
8082 struct cpuacct *ca = cgroup_ca(cgrp);
8083 u64 totalcpuusage = 0;
8086 for_each_present_cpu(i)
8087 totalcpuusage += cpuacct_cpuusage_read(ca, i);
8089 return totalcpuusage;
8092 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
8095 struct cpuacct *ca = cgroup_ca(cgrp);
8104 for_each_present_cpu(i)
8105 cpuacct_cpuusage_write(ca, i, 0);
8111 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
8114 struct cpuacct *ca = cgroup_ca(cgroup);
8118 for_each_present_cpu(i) {
8119 percpu = cpuacct_cpuusage_read(ca, i);
8120 seq_printf(m, "%llu ", (unsigned long long) percpu);
8122 seq_printf(m, "\n");
8126 static const char *cpuacct_stat_desc[] = {
8127 [CPUACCT_STAT_USER] = "user",
8128 [CPUACCT_STAT_SYSTEM] = "system",
8131 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
8132 struct cgroup_map_cb *cb)
8134 struct cpuacct *ca = cgroup_ca(cgrp);
8138 for_each_online_cpu(cpu) {
8139 struct kernel_cpustat *kcpustat = per_cpu_ptr(ca->cpustat, cpu);
8140 val += kcpustat->cpustat[CPUTIME_USER];
8141 val += kcpustat->cpustat[CPUTIME_NICE];
8143 val = cputime64_to_clock_t(val);
8144 cb->fill(cb, cpuacct_stat_desc[CPUACCT_STAT_USER], val);
8147 for_each_online_cpu(cpu) {
8148 struct kernel_cpustat *kcpustat = per_cpu_ptr(ca->cpustat, cpu);
8149 val += kcpustat->cpustat[CPUTIME_SYSTEM];
8150 val += kcpustat->cpustat[CPUTIME_IRQ];
8151 val += kcpustat->cpustat[CPUTIME_SOFTIRQ];
8154 val = cputime64_to_clock_t(val);
8155 cb->fill(cb, cpuacct_stat_desc[CPUACCT_STAT_SYSTEM], val);
8160 static struct cftype files[] = {
8163 .read_u64 = cpuusage_read,
8164 .write_u64 = cpuusage_write,
8167 .name = "usage_percpu",
8168 .read_seq_string = cpuacct_percpu_seq_read,
8172 .read_map = cpuacct_stats_show,
8176 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
8178 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
8182 * charge this task's execution time to its accounting group.
8184 * called with rq->lock held.
8186 void cpuacct_charge(struct task_struct *tsk, u64 cputime)
8191 if (unlikely(!cpuacct_subsys.active))
8194 cpu = task_cpu(tsk);
8200 for (; ca; ca = parent_ca(ca)) {
8201 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8202 *cpuusage += cputime;
8208 struct cgroup_subsys cpuacct_subsys = {
8210 .create = cpuacct_create,
8211 .destroy = cpuacct_destroy,
8212 .populate = cpuacct_populate,
8213 .subsys_id = cpuacct_subsys_id,
8215 #endif /* CONFIG_CGROUP_CPUACCT */