4 * Kernel scheduler and related syscalls
6 * Copyright (C) 1991-2002 Linus Torvalds
8 * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and
9 * make semaphores SMP safe
10 * 1998-11-19 Implemented schedule_timeout() and related stuff
12 * 2002-01-04 New ultra-scalable O(1) scheduler by Ingo Molnar:
13 * hybrid priority-list and round-robin design with
14 * an array-switch method of distributing timeslices
15 * and per-CPU runqueues. Cleanups and useful suggestions
16 * by Davide Libenzi, preemptible kernel bits by Robert Love.
17 * 2003-09-03 Interactivity tuning by Con Kolivas.
18 * 2004-04-02 Scheduler domains code by Nick Piggin
19 * 2007-04-15 Work begun on replacing all interactivity tuning with a
20 * fair scheduling design by Con Kolivas.
21 * 2007-05-05 Load balancing (smp-nice) and other improvements
23 * 2007-05-06 Interactivity improvements to CFS by Mike Galbraith
24 * 2007-07-01 Group scheduling enhancements by Srivatsa Vaddagiri
25 * 2007-11-29 RT balancing improvements by Steven Rostedt, Gregory Haskins,
26 * Thomas Gleixner, Mike Kravetz
30 #include <linux/module.h>
31 #include <linux/nmi.h>
32 #include <linux/init.h>
33 #include <linux/uaccess.h>
34 #include <linux/highmem.h>
35 #include <asm/mmu_context.h>
36 #include <linux/interrupt.h>
37 #include <linux/capability.h>
38 #include <linux/completion.h>
39 #include <linux/kernel_stat.h>
40 #include <linux/debug_locks.h>
41 #include <linux/perf_event.h>
42 #include <linux/security.h>
43 #include <linux/notifier.h>
44 #include <linux/profile.h>
45 #include <linux/freezer.h>
46 #include <linux/vmalloc.h>
47 #include <linux/blkdev.h>
48 #include <linux/delay.h>
49 #include <linux/pid_namespace.h>
50 #include <linux/smp.h>
51 #include <linux/threads.h>
52 #include <linux/timer.h>
53 #include <linux/rcupdate.h>
54 #include <linux/cpu.h>
55 #include <linux/cpuset.h>
56 #include <linux/percpu.h>
57 #include <linux/proc_fs.h>
58 #include <linux/seq_file.h>
59 #include <linux/sysctl.h>
60 #include <linux/syscalls.h>
61 #include <linux/times.h>
62 #include <linux/tsacct_kern.h>
63 #include <linux/kprobes.h>
64 #include <linux/delayacct.h>
65 #include <linux/unistd.h>
66 #include <linux/pagemap.h>
67 #include <linux/hrtimer.h>
68 #include <linux/tick.h>
69 #include <linux/debugfs.h>
70 #include <linux/ctype.h>
71 #include <linux/ftrace.h>
72 #include <linux/slab.h>
73 #include <linux/init_task.h>
74 #include <linux/binfmts.h>
76 #include <asm/switch_to.h>
78 #include <asm/irq_regs.h>
79 #include <asm/mutex.h>
80 #ifdef CONFIG_PARAVIRT
81 #include <asm/paravirt.h>
85 #include "../workqueue_sched.h"
87 #define CREATE_TRACE_POINTS
88 #include <trace/events/sched.h>
90 void start_bandwidth_timer(struct hrtimer *period_timer, ktime_t period)
93 ktime_t soft, hard, now;
96 if (hrtimer_active(period_timer))
99 now = hrtimer_cb_get_time(period_timer);
100 hrtimer_forward(period_timer, now, period);
102 soft = hrtimer_get_softexpires(period_timer);
103 hard = hrtimer_get_expires(period_timer);
104 delta = ktime_to_ns(ktime_sub(hard, soft));
105 __hrtimer_start_range_ns(period_timer, soft, delta,
106 HRTIMER_MODE_ABS_PINNED, 0);
110 DEFINE_MUTEX(sched_domains_mutex);
111 DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
113 static void update_rq_clock_task(struct rq *rq, s64 delta);
115 void update_rq_clock(struct rq *rq)
119 if (rq->skip_clock_update > 0)
122 delta = sched_clock_cpu(cpu_of(rq)) - rq->clock;
124 update_rq_clock_task(rq, delta);
128 * Debugging: various feature bits
131 #define SCHED_FEAT(name, enabled) \
132 (1UL << __SCHED_FEAT_##name) * enabled |
134 const_debug unsigned int sysctl_sched_features =
135 #include "features.h"
140 #ifdef CONFIG_SCHED_DEBUG
141 #define SCHED_FEAT(name, enabled) \
144 static __read_mostly char *sched_feat_names[] = {
145 #include "features.h"
151 static int sched_feat_show(struct seq_file *m, void *v)
155 for (i = 0; i < __SCHED_FEAT_NR; i++) {
156 if (!(sysctl_sched_features & (1UL << i)))
158 seq_printf(m, "%s ", sched_feat_names[i]);
165 #ifdef HAVE_JUMP_LABEL
167 #define jump_label_key__true STATIC_KEY_INIT_TRUE
168 #define jump_label_key__false STATIC_KEY_INIT_FALSE
170 #define SCHED_FEAT(name, enabled) \
171 jump_label_key__##enabled ,
173 struct static_key sched_feat_keys[__SCHED_FEAT_NR] = {
174 #include "features.h"
179 static void sched_feat_disable(int i)
181 if (static_key_enabled(&sched_feat_keys[i]))
182 static_key_slow_dec(&sched_feat_keys[i]);
185 static void sched_feat_enable(int i)
187 if (!static_key_enabled(&sched_feat_keys[i]))
188 static_key_slow_inc(&sched_feat_keys[i]);
191 static void sched_feat_disable(int i) { };
192 static void sched_feat_enable(int i) { };
193 #endif /* HAVE_JUMP_LABEL */
196 sched_feat_write(struct file *filp, const char __user *ubuf,
197 size_t cnt, loff_t *ppos)
207 if (copy_from_user(&buf, ubuf, cnt))
213 if (strncmp(cmp, "NO_", 3) == 0) {
218 for (i = 0; i < __SCHED_FEAT_NR; i++) {
219 if (strcmp(cmp, sched_feat_names[i]) == 0) {
221 sysctl_sched_features &= ~(1UL << i);
222 sched_feat_disable(i);
224 sysctl_sched_features |= (1UL << i);
225 sched_feat_enable(i);
231 if (i == __SCHED_FEAT_NR)
239 static int sched_feat_open(struct inode *inode, struct file *filp)
241 return single_open(filp, sched_feat_show, NULL);
244 static const struct file_operations sched_feat_fops = {
245 .open = sched_feat_open,
246 .write = sched_feat_write,
249 .release = single_release,
252 static __init int sched_init_debug(void)
254 debugfs_create_file("sched_features", 0644, NULL, NULL,
259 late_initcall(sched_init_debug);
260 #endif /* CONFIG_SCHED_DEBUG */
263 * Number of tasks to iterate in a single balance run.
264 * Limited because this is done with IRQs disabled.
266 const_debug unsigned int sysctl_sched_nr_migrate = 32;
269 * period over which we average the RT time consumption, measured
274 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
277 * period over which we measure -rt task cpu usage in us.
280 unsigned int sysctl_sched_rt_period = 1000000;
282 __read_mostly int scheduler_running;
285 * part of the period that we allow rt tasks to run in us.
288 int sysctl_sched_rt_runtime = 950000;
293 * __task_rq_lock - lock the rq @p resides on.
295 static inline struct rq *__task_rq_lock(struct task_struct *p)
300 lockdep_assert_held(&p->pi_lock);
304 raw_spin_lock(&rq->lock);
305 if (likely(rq == task_rq(p)))
307 raw_spin_unlock(&rq->lock);
312 * task_rq_lock - lock p->pi_lock and lock the rq @p resides on.
314 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
315 __acquires(p->pi_lock)
321 raw_spin_lock_irqsave(&p->pi_lock, *flags);
323 raw_spin_lock(&rq->lock);
324 if (likely(rq == task_rq(p)))
326 raw_spin_unlock(&rq->lock);
327 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
331 static void __task_rq_unlock(struct rq *rq)
334 raw_spin_unlock(&rq->lock);
338 task_rq_unlock(struct rq *rq, struct task_struct *p, unsigned long *flags)
340 __releases(p->pi_lock)
342 raw_spin_unlock(&rq->lock);
343 raw_spin_unlock_irqrestore(&p->pi_lock, *flags);
347 * this_rq_lock - lock this runqueue and disable interrupts.
349 static struct rq *this_rq_lock(void)
356 raw_spin_lock(&rq->lock);
361 #ifdef CONFIG_SCHED_HRTICK
363 * Use HR-timers to deliver accurate preemption points.
365 * Its all a bit involved since we cannot program an hrt while holding the
366 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
369 * When we get rescheduled we reprogram the hrtick_timer outside of the
373 static void hrtick_clear(struct rq *rq)
375 if (hrtimer_active(&rq->hrtick_timer))
376 hrtimer_cancel(&rq->hrtick_timer);
380 * High-resolution timer tick.
381 * Runs from hardirq context with interrupts disabled.
383 static enum hrtimer_restart hrtick(struct hrtimer *timer)
385 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
387 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
389 raw_spin_lock(&rq->lock);
391 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
392 raw_spin_unlock(&rq->lock);
394 return HRTIMER_NORESTART;
399 * called from hardirq (IPI) context
401 static void __hrtick_start(void *arg)
405 raw_spin_lock(&rq->lock);
406 hrtimer_restart(&rq->hrtick_timer);
407 rq->hrtick_csd_pending = 0;
408 raw_spin_unlock(&rq->lock);
412 * Called to set the hrtick timer state.
414 * called with rq->lock held and irqs disabled
416 void hrtick_start(struct rq *rq, u64 delay)
418 struct hrtimer *timer = &rq->hrtick_timer;
419 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
421 hrtimer_set_expires(timer, time);
423 if (rq == this_rq()) {
424 hrtimer_restart(timer);
425 } else if (!rq->hrtick_csd_pending) {
426 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0);
427 rq->hrtick_csd_pending = 1;
432 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
434 int cpu = (int)(long)hcpu;
437 case CPU_UP_CANCELED:
438 case CPU_UP_CANCELED_FROZEN:
439 case CPU_DOWN_PREPARE:
440 case CPU_DOWN_PREPARE_FROZEN:
442 case CPU_DEAD_FROZEN:
443 hrtick_clear(cpu_rq(cpu));
450 static __init void init_hrtick(void)
452 hotcpu_notifier(hotplug_hrtick, 0);
456 * Called to set the hrtick timer state.
458 * called with rq->lock held and irqs disabled
460 void hrtick_start(struct rq *rq, u64 delay)
462 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
463 HRTIMER_MODE_REL_PINNED, 0);
466 static inline void init_hrtick(void)
469 #endif /* CONFIG_SMP */
471 static void init_rq_hrtick(struct rq *rq)
474 rq->hrtick_csd_pending = 0;
476 rq->hrtick_csd.flags = 0;
477 rq->hrtick_csd.func = __hrtick_start;
478 rq->hrtick_csd.info = rq;
481 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
482 rq->hrtick_timer.function = hrtick;
484 #else /* CONFIG_SCHED_HRTICK */
485 static inline void hrtick_clear(struct rq *rq)
489 static inline void init_rq_hrtick(struct rq *rq)
493 static inline void init_hrtick(void)
496 #endif /* CONFIG_SCHED_HRTICK */
499 * resched_task - mark a task 'to be rescheduled now'.
501 * On UP this means the setting of the need_resched flag, on SMP it
502 * might also involve a cross-CPU call to trigger the scheduler on
507 #ifndef tsk_is_polling
508 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
511 void resched_task(struct task_struct *p)
515 assert_raw_spin_locked(&task_rq(p)->lock);
517 if (test_tsk_need_resched(p))
520 set_tsk_need_resched(p);
523 if (cpu == smp_processor_id())
526 /* NEED_RESCHED must be visible before we test polling */
528 if (!tsk_is_polling(p))
529 smp_send_reschedule(cpu);
532 void resched_cpu(int cpu)
534 struct rq *rq = cpu_rq(cpu);
537 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
539 resched_task(cpu_curr(cpu));
540 raw_spin_unlock_irqrestore(&rq->lock, flags);
545 * In the semi idle case, use the nearest busy cpu for migrating timers
546 * from an idle cpu. This is good for power-savings.
548 * We don't do similar optimization for completely idle system, as
549 * selecting an idle cpu will add more delays to the timers than intended
550 * (as that cpu's timer base may not be uptodate wrt jiffies etc).
552 int get_nohz_timer_target(void)
554 int cpu = smp_processor_id();
556 struct sched_domain *sd;
559 for_each_domain(cpu, sd) {
560 for_each_cpu(i, sched_domain_span(sd)) {
572 * When add_timer_on() enqueues a timer into the timer wheel of an
573 * idle CPU then this timer might expire before the next timer event
574 * which is scheduled to wake up that CPU. In case of a completely
575 * idle system the next event might even be infinite time into the
576 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
577 * leaves the inner idle loop so the newly added timer is taken into
578 * account when the CPU goes back to idle and evaluates the timer
579 * wheel for the next timer event.
581 void wake_up_idle_cpu(int cpu)
583 struct rq *rq = cpu_rq(cpu);
585 if (cpu == smp_processor_id())
589 * This is safe, as this function is called with the timer
590 * wheel base lock of (cpu) held. When the CPU is on the way
591 * to idle and has not yet set rq->curr to idle then it will
592 * be serialized on the timer wheel base lock and take the new
593 * timer into account automatically.
595 if (rq->curr != rq->idle)
599 * We can set TIF_RESCHED on the idle task of the other CPU
600 * lockless. The worst case is that the other CPU runs the
601 * idle task through an additional NOOP schedule()
603 set_tsk_need_resched(rq->idle);
605 /* NEED_RESCHED must be visible before we test polling */
607 if (!tsk_is_polling(rq->idle))
608 smp_send_reschedule(cpu);
611 static inline bool got_nohz_idle_kick(void)
613 int cpu = smp_processor_id();
614 return idle_cpu(cpu) && test_bit(NOHZ_BALANCE_KICK, nohz_flags(cpu));
617 #else /* CONFIG_NO_HZ */
619 static inline bool got_nohz_idle_kick(void)
624 #endif /* CONFIG_NO_HZ */
626 void sched_avg_update(struct rq *rq)
628 s64 period = sched_avg_period();
630 while ((s64)(rq->clock - rq->age_stamp) > period) {
632 * Inline assembly required to prevent the compiler
633 * optimising this loop into a divmod call.
634 * See __iter_div_u64_rem() for another example of this.
636 asm("" : "+rm" (rq->age_stamp));
637 rq->age_stamp += period;
642 #else /* !CONFIG_SMP */
643 void resched_task(struct task_struct *p)
645 assert_raw_spin_locked(&task_rq(p)->lock);
646 set_tsk_need_resched(p);
648 #endif /* CONFIG_SMP */
650 #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \
651 (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH)))
653 * Iterate task_group tree rooted at *from, calling @down when first entering a
654 * node and @up when leaving it for the final time.
656 * Caller must hold rcu_lock or sufficient equivalent.
658 int walk_tg_tree_from(struct task_group *from,
659 tg_visitor down, tg_visitor up, void *data)
661 struct task_group *parent, *child;
667 ret = (*down)(parent, data);
670 list_for_each_entry_rcu(child, &parent->children, siblings) {
677 ret = (*up)(parent, data);
678 if (ret || parent == from)
682 parent = parent->parent;
689 int tg_nop(struct task_group *tg, void *data)
695 void update_cpu_load(struct rq *this_rq);
697 static void set_load_weight(struct task_struct *p)
699 int prio = p->static_prio - MAX_RT_PRIO;
700 struct load_weight *load = &p->se.load;
703 * SCHED_IDLE tasks get minimal weight:
705 if (p->policy == SCHED_IDLE) {
706 load->weight = scale_load(WEIGHT_IDLEPRIO);
707 load->inv_weight = WMULT_IDLEPRIO;
711 load->weight = scale_load(prio_to_weight[prio]);
712 load->inv_weight = prio_to_wmult[prio];
715 static void enqueue_task(struct rq *rq, struct task_struct *p, int flags)
718 sched_info_queued(p);
719 p->sched_class->enqueue_task(rq, p, flags);
722 static void dequeue_task(struct rq *rq, struct task_struct *p, int flags)
725 sched_info_dequeued(p);
726 p->sched_class->dequeue_task(rq, p, flags);
729 void activate_task(struct rq *rq, struct task_struct *p, int flags)
731 if (task_contributes_to_load(p))
732 rq->nr_uninterruptible--;
734 enqueue_task(rq, p, flags);
737 void deactivate_task(struct rq *rq, struct task_struct *p, int flags)
739 if (task_contributes_to_load(p))
740 rq->nr_uninterruptible++;
742 dequeue_task(rq, p, flags);
745 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
748 * There are no locks covering percpu hardirq/softirq time.
749 * They are only modified in account_system_vtime, on corresponding CPU
750 * with interrupts disabled. So, writes are safe.
751 * They are read and saved off onto struct rq in update_rq_clock().
752 * This may result in other CPU reading this CPU's irq time and can
753 * race with irq/account_system_vtime on this CPU. We would either get old
754 * or new value with a side effect of accounting a slice of irq time to wrong
755 * task when irq is in progress while we read rq->clock. That is a worthy
756 * compromise in place of having locks on each irq in account_system_time.
758 static DEFINE_PER_CPU(u64, cpu_hardirq_time);
759 static DEFINE_PER_CPU(u64, cpu_softirq_time);
761 static DEFINE_PER_CPU(u64, irq_start_time);
762 static int sched_clock_irqtime;
764 void enable_sched_clock_irqtime(void)
766 sched_clock_irqtime = 1;
769 void disable_sched_clock_irqtime(void)
771 sched_clock_irqtime = 0;
775 static DEFINE_PER_CPU(seqcount_t, irq_time_seq);
777 static inline void irq_time_write_begin(void)
779 __this_cpu_inc(irq_time_seq.sequence);
783 static inline void irq_time_write_end(void)
786 __this_cpu_inc(irq_time_seq.sequence);
789 static inline u64 irq_time_read(int cpu)
795 seq = read_seqcount_begin(&per_cpu(irq_time_seq, cpu));
796 irq_time = per_cpu(cpu_softirq_time, cpu) +
797 per_cpu(cpu_hardirq_time, cpu);
798 } while (read_seqcount_retry(&per_cpu(irq_time_seq, cpu), seq));
802 #else /* CONFIG_64BIT */
803 static inline void irq_time_write_begin(void)
807 static inline void irq_time_write_end(void)
811 static inline u64 irq_time_read(int cpu)
813 return per_cpu(cpu_softirq_time, cpu) + per_cpu(cpu_hardirq_time, cpu);
815 #endif /* CONFIG_64BIT */
818 * Called before incrementing preempt_count on {soft,}irq_enter
819 * and before decrementing preempt_count on {soft,}irq_exit.
821 void account_system_vtime(struct task_struct *curr)
827 if (!sched_clock_irqtime)
830 local_irq_save(flags);
832 cpu = smp_processor_id();
833 delta = sched_clock_cpu(cpu) - __this_cpu_read(irq_start_time);
834 __this_cpu_add(irq_start_time, delta);
836 irq_time_write_begin();
838 * We do not account for softirq time from ksoftirqd here.
839 * We want to continue accounting softirq time to ksoftirqd thread
840 * in that case, so as not to confuse scheduler with a special task
841 * that do not consume any time, but still wants to run.
844 __this_cpu_add(cpu_hardirq_time, delta);
845 else if (in_serving_softirq() && curr != this_cpu_ksoftirqd())
846 __this_cpu_add(cpu_softirq_time, delta);
848 irq_time_write_end();
849 local_irq_restore(flags);
851 EXPORT_SYMBOL_GPL(account_system_vtime);
853 #endif /* CONFIG_IRQ_TIME_ACCOUNTING */
855 #ifdef CONFIG_PARAVIRT
856 static inline u64 steal_ticks(u64 steal)
858 if (unlikely(steal > NSEC_PER_SEC))
859 return div_u64(steal, TICK_NSEC);
861 return __iter_div_u64_rem(steal, TICK_NSEC, &steal);
865 static void update_rq_clock_task(struct rq *rq, s64 delta)
868 * In theory, the compile should just see 0 here, and optimize out the call
869 * to sched_rt_avg_update. But I don't trust it...
871 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
872 s64 steal = 0, irq_delta = 0;
874 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
875 irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time;
878 * Since irq_time is only updated on {soft,}irq_exit, we might run into
879 * this case when a previous update_rq_clock() happened inside a
882 * When this happens, we stop ->clock_task and only update the
883 * prev_irq_time stamp to account for the part that fit, so that a next
884 * update will consume the rest. This ensures ->clock_task is
887 * It does however cause some slight miss-attribution of {soft,}irq
888 * time, a more accurate solution would be to update the irq_time using
889 * the current rq->clock timestamp, except that would require using
892 if (irq_delta > delta)
895 rq->prev_irq_time += irq_delta;
898 #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING
899 if (static_key_false((¶virt_steal_rq_enabled))) {
902 steal = paravirt_steal_clock(cpu_of(rq));
903 steal -= rq->prev_steal_time_rq;
905 if (unlikely(steal > delta))
908 st = steal_ticks(steal);
909 steal = st * TICK_NSEC;
911 rq->prev_steal_time_rq += steal;
917 rq->clock_task += delta;
919 #if defined(CONFIG_IRQ_TIME_ACCOUNTING) || defined(CONFIG_PARAVIRT_TIME_ACCOUNTING)
920 if ((irq_delta + steal) && sched_feat(NONTASK_POWER))
921 sched_rt_avg_update(rq, irq_delta + steal);
925 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
926 static int irqtime_account_hi_update(void)
928 u64 *cpustat = kcpustat_this_cpu->cpustat;
933 local_irq_save(flags);
934 latest_ns = this_cpu_read(cpu_hardirq_time);
935 if (nsecs_to_cputime64(latest_ns) > cpustat[CPUTIME_IRQ])
937 local_irq_restore(flags);
941 static int irqtime_account_si_update(void)
943 u64 *cpustat = kcpustat_this_cpu->cpustat;
948 local_irq_save(flags);
949 latest_ns = this_cpu_read(cpu_softirq_time);
950 if (nsecs_to_cputime64(latest_ns) > cpustat[CPUTIME_SOFTIRQ])
952 local_irq_restore(flags);
956 #else /* CONFIG_IRQ_TIME_ACCOUNTING */
958 #define sched_clock_irqtime (0)
962 void sched_set_stop_task(int cpu, struct task_struct *stop)
964 struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 };
965 struct task_struct *old_stop = cpu_rq(cpu)->stop;
969 * Make it appear like a SCHED_FIFO task, its something
970 * userspace knows about and won't get confused about.
972 * Also, it will make PI more or less work without too
973 * much confusion -- but then, stop work should not
974 * rely on PI working anyway.
976 sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m);
978 stop->sched_class = &stop_sched_class;
981 cpu_rq(cpu)->stop = stop;
985 * Reset it back to a normal scheduling class so that
986 * it can die in pieces.
988 old_stop->sched_class = &rt_sched_class;
993 * __normal_prio - return the priority that is based on the static prio
995 static inline int __normal_prio(struct task_struct *p)
997 return p->static_prio;
1001 * Calculate the expected normal priority: i.e. priority
1002 * without taking RT-inheritance into account. Might be
1003 * boosted by interactivity modifiers. Changes upon fork,
1004 * setprio syscalls, and whenever the interactivity
1005 * estimator recalculates.
1007 static inline int normal_prio(struct task_struct *p)
1011 if (task_has_rt_policy(p))
1012 prio = MAX_RT_PRIO-1 - p->rt_priority;
1014 prio = __normal_prio(p);
1019 * Calculate the current priority, i.e. the priority
1020 * taken into account by the scheduler. This value might
1021 * be boosted by RT tasks, or might be boosted by
1022 * interactivity modifiers. Will be RT if the task got
1023 * RT-boosted. If not then it returns p->normal_prio.
1025 static int effective_prio(struct task_struct *p)
1027 p->normal_prio = normal_prio(p);
1029 * If we are RT tasks or we were boosted to RT priority,
1030 * keep the priority unchanged. Otherwise, update priority
1031 * to the normal priority:
1033 if (!rt_prio(p->prio))
1034 return p->normal_prio;
1039 * task_curr - is this task currently executing on a CPU?
1040 * @p: the task in question.
1042 inline int task_curr(const struct task_struct *p)
1044 return cpu_curr(task_cpu(p)) == p;
1047 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1048 const struct sched_class *prev_class,
1051 if (prev_class != p->sched_class) {
1052 if (prev_class->switched_from)
1053 prev_class->switched_from(rq, p);
1054 p->sched_class->switched_to(rq, p);
1055 } else if (oldprio != p->prio)
1056 p->sched_class->prio_changed(rq, p, oldprio);
1059 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
1061 const struct sched_class *class;
1063 if (p->sched_class == rq->curr->sched_class) {
1064 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
1066 for_each_class(class) {
1067 if (class == rq->curr->sched_class)
1069 if (class == p->sched_class) {
1070 resched_task(rq->curr);
1077 * A queue event has occurred, and we're going to schedule. In
1078 * this case, we can save a useless back to back clock update.
1080 if (rq->curr->on_rq && test_tsk_need_resched(rq->curr))
1081 rq->skip_clock_update = 1;
1085 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1087 #ifdef CONFIG_SCHED_DEBUG
1089 * We should never call set_task_cpu() on a blocked task,
1090 * ttwu() will sort out the placement.
1092 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
1093 !(task_thread_info(p)->preempt_count & PREEMPT_ACTIVE));
1095 #ifdef CONFIG_LOCKDEP
1097 * The caller should hold either p->pi_lock or rq->lock, when changing
1098 * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks.
1100 * sched_move_task() holds both and thus holding either pins the cgroup,
1101 * see set_task_rq().
1103 * Furthermore, all task_rq users should acquire both locks, see
1106 WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) ||
1107 lockdep_is_held(&task_rq(p)->lock)));
1111 trace_sched_migrate_task(p, new_cpu);
1113 if (task_cpu(p) != new_cpu) {
1114 p->se.nr_migrations++;
1115 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, NULL, 0);
1118 __set_task_cpu(p, new_cpu);
1121 struct migration_arg {
1122 struct task_struct *task;
1126 static int migration_cpu_stop(void *data);
1129 * wait_task_inactive - wait for a thread to unschedule.
1131 * If @match_state is nonzero, it's the @p->state value just checked and
1132 * not expected to change. If it changes, i.e. @p might have woken up,
1133 * then return zero. When we succeed in waiting for @p to be off its CPU,
1134 * we return a positive number (its total switch count). If a second call
1135 * a short while later returns the same number, the caller can be sure that
1136 * @p has remained unscheduled the whole time.
1138 * The caller must ensure that the task *will* unschedule sometime soon,
1139 * else this function might spin for a *long* time. This function can't
1140 * be called with interrupts off, or it may introduce deadlock with
1141 * smp_call_function() if an IPI is sent by the same process we are
1142 * waiting to become inactive.
1144 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
1146 unsigned long flags;
1153 * We do the initial early heuristics without holding
1154 * any task-queue locks at all. We'll only try to get
1155 * the runqueue lock when things look like they will
1161 * If the task is actively running on another CPU
1162 * still, just relax and busy-wait without holding
1165 * NOTE! Since we don't hold any locks, it's not
1166 * even sure that "rq" stays as the right runqueue!
1167 * But we don't care, since "task_running()" will
1168 * return false if the runqueue has changed and p
1169 * is actually now running somewhere else!
1171 while (task_running(rq, p)) {
1172 if (match_state && unlikely(p->state != match_state))
1178 * Ok, time to look more closely! We need the rq
1179 * lock now, to be *sure*. If we're wrong, we'll
1180 * just go back and repeat.
1182 rq = task_rq_lock(p, &flags);
1183 trace_sched_wait_task(p);
1184 running = task_running(rq, p);
1187 if (!match_state || p->state == match_state)
1188 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
1189 task_rq_unlock(rq, p, &flags);
1192 * If it changed from the expected state, bail out now.
1194 if (unlikely(!ncsw))
1198 * Was it really running after all now that we
1199 * checked with the proper locks actually held?
1201 * Oops. Go back and try again..
1203 if (unlikely(running)) {
1209 * It's not enough that it's not actively running,
1210 * it must be off the runqueue _entirely_, and not
1213 * So if it was still runnable (but just not actively
1214 * running right now), it's preempted, and we should
1215 * yield - it could be a while.
1217 if (unlikely(on_rq)) {
1218 ktime_t to = ktime_set(0, NSEC_PER_SEC/HZ);
1220 set_current_state(TASK_UNINTERRUPTIBLE);
1221 schedule_hrtimeout(&to, HRTIMER_MODE_REL);
1226 * Ahh, all good. It wasn't running, and it wasn't
1227 * runnable, which means that it will never become
1228 * running in the future either. We're all done!
1237 * kick_process - kick a running thread to enter/exit the kernel
1238 * @p: the to-be-kicked thread
1240 * Cause a process which is running on another CPU to enter
1241 * kernel-mode, without any delay. (to get signals handled.)
1243 * NOTE: this function doesn't have to take the runqueue lock,
1244 * because all it wants to ensure is that the remote task enters
1245 * the kernel. If the IPI races and the task has been migrated
1246 * to another CPU then no harm is done and the purpose has been
1249 void kick_process(struct task_struct *p)
1255 if ((cpu != smp_processor_id()) && task_curr(p))
1256 smp_send_reschedule(cpu);
1259 EXPORT_SYMBOL_GPL(kick_process);
1260 #endif /* CONFIG_SMP */
1264 * ->cpus_allowed is protected by both rq->lock and p->pi_lock
1266 static int select_fallback_rq(int cpu, struct task_struct *p)
1268 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(cpu));
1269 enum { cpuset, possible, fail } state = cpuset;
1272 /* Look for allowed, online CPU in same node. */
1273 for_each_cpu(dest_cpu, nodemask) {
1274 if (!cpu_online(dest_cpu))
1276 if (!cpu_active(dest_cpu))
1278 if (cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
1283 /* Any allowed, online CPU? */
1284 for_each_cpu(dest_cpu, tsk_cpus_allowed(p)) {
1285 if (!cpu_online(dest_cpu))
1287 if (!cpu_active(dest_cpu))
1294 /* No more Mr. Nice Guy. */
1295 cpuset_cpus_allowed_fallback(p);
1300 do_set_cpus_allowed(p, cpu_possible_mask);
1311 if (state != cpuset) {
1313 * Don't tell them about moving exiting tasks or
1314 * kernel threads (both mm NULL), since they never
1317 if (p->mm && printk_ratelimit()) {
1318 printk_sched("process %d (%s) no longer affine to cpu%d\n",
1319 task_pid_nr(p), p->comm, cpu);
1327 * The caller (fork, wakeup) owns p->pi_lock, ->cpus_allowed is stable.
1330 int select_task_rq(struct task_struct *p, int sd_flags, int wake_flags)
1332 int cpu = p->sched_class->select_task_rq(p, sd_flags, wake_flags);
1335 * In order not to call set_task_cpu() on a blocking task we need
1336 * to rely on ttwu() to place the task on a valid ->cpus_allowed
1339 * Since this is common to all placement strategies, this lives here.
1341 * [ this allows ->select_task() to simply return task_cpu(p) and
1342 * not worry about this generic constraint ]
1344 if (unlikely(!cpumask_test_cpu(cpu, tsk_cpus_allowed(p)) ||
1346 cpu = select_fallback_rq(task_cpu(p), p);
1351 static void update_avg(u64 *avg, u64 sample)
1353 s64 diff = sample - *avg;
1359 ttwu_stat(struct task_struct *p, int cpu, int wake_flags)
1361 #ifdef CONFIG_SCHEDSTATS
1362 struct rq *rq = this_rq();
1365 int this_cpu = smp_processor_id();
1367 if (cpu == this_cpu) {
1368 schedstat_inc(rq, ttwu_local);
1369 schedstat_inc(p, se.statistics.nr_wakeups_local);
1371 struct sched_domain *sd;
1373 schedstat_inc(p, se.statistics.nr_wakeups_remote);
1375 for_each_domain(this_cpu, sd) {
1376 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
1377 schedstat_inc(sd, ttwu_wake_remote);
1384 if (wake_flags & WF_MIGRATED)
1385 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
1387 #endif /* CONFIG_SMP */
1389 schedstat_inc(rq, ttwu_count);
1390 schedstat_inc(p, se.statistics.nr_wakeups);
1392 if (wake_flags & WF_SYNC)
1393 schedstat_inc(p, se.statistics.nr_wakeups_sync);
1395 #endif /* CONFIG_SCHEDSTATS */
1398 static void ttwu_activate(struct rq *rq, struct task_struct *p, int en_flags)
1400 activate_task(rq, p, en_flags);
1403 /* if a worker is waking up, notify workqueue */
1404 if (p->flags & PF_WQ_WORKER)
1405 wq_worker_waking_up(p, cpu_of(rq));
1409 * Mark the task runnable and perform wakeup-preemption.
1412 ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags)
1414 trace_sched_wakeup(p, true);
1415 check_preempt_curr(rq, p, wake_flags);
1417 p->state = TASK_RUNNING;
1419 if (p->sched_class->task_woken)
1420 p->sched_class->task_woken(rq, p);
1422 if (rq->idle_stamp) {
1423 u64 delta = rq->clock - rq->idle_stamp;
1424 u64 max = 2*sysctl_sched_migration_cost;
1429 update_avg(&rq->avg_idle, delta);
1436 ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags)
1439 if (p->sched_contributes_to_load)
1440 rq->nr_uninterruptible--;
1443 ttwu_activate(rq, p, ENQUEUE_WAKEUP | ENQUEUE_WAKING);
1444 ttwu_do_wakeup(rq, p, wake_flags);
1448 * Called in case the task @p isn't fully descheduled from its runqueue,
1449 * in this case we must do a remote wakeup. Its a 'light' wakeup though,
1450 * since all we need to do is flip p->state to TASK_RUNNING, since
1451 * the task is still ->on_rq.
1453 static int ttwu_remote(struct task_struct *p, int wake_flags)
1458 rq = __task_rq_lock(p);
1460 ttwu_do_wakeup(rq, p, wake_flags);
1463 __task_rq_unlock(rq);
1469 static void sched_ttwu_pending(void)
1471 struct rq *rq = this_rq();
1472 struct llist_node *llist = llist_del_all(&rq->wake_list);
1473 struct task_struct *p;
1475 raw_spin_lock(&rq->lock);
1478 p = llist_entry(llist, struct task_struct, wake_entry);
1479 llist = llist_next(llist);
1480 ttwu_do_activate(rq, p, 0);
1483 raw_spin_unlock(&rq->lock);
1486 void scheduler_ipi(void)
1488 if (llist_empty(&this_rq()->wake_list) && !got_nohz_idle_kick())
1492 * Not all reschedule IPI handlers call irq_enter/irq_exit, since
1493 * traditionally all their work was done from the interrupt return
1494 * path. Now that we actually do some work, we need to make sure
1497 * Some archs already do call them, luckily irq_enter/exit nest
1500 * Arguably we should visit all archs and update all handlers,
1501 * however a fair share of IPIs are still resched only so this would
1502 * somewhat pessimize the simple resched case.
1505 sched_ttwu_pending();
1508 * Check if someone kicked us for doing the nohz idle load balance.
1510 if (unlikely(got_nohz_idle_kick() && !need_resched())) {
1511 this_rq()->idle_balance = 1;
1512 raise_softirq_irqoff(SCHED_SOFTIRQ);
1517 static void ttwu_queue_remote(struct task_struct *p, int cpu)
1519 if (llist_add(&p->wake_entry, &cpu_rq(cpu)->wake_list))
1520 smp_send_reschedule(cpu);
1523 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1524 static int ttwu_activate_remote(struct task_struct *p, int wake_flags)
1529 rq = __task_rq_lock(p);
1531 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1532 ttwu_do_wakeup(rq, p, wake_flags);
1535 __task_rq_unlock(rq);
1540 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1542 bool cpus_share_cache(int this_cpu, int that_cpu)
1544 return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu);
1546 #endif /* CONFIG_SMP */
1548 static void ttwu_queue(struct task_struct *p, int cpu)
1550 struct rq *rq = cpu_rq(cpu);
1552 #if defined(CONFIG_SMP)
1553 if (sched_feat(TTWU_QUEUE) && !cpus_share_cache(smp_processor_id(), cpu)) {
1554 sched_clock_cpu(cpu); /* sync clocks x-cpu */
1555 ttwu_queue_remote(p, cpu);
1560 raw_spin_lock(&rq->lock);
1561 ttwu_do_activate(rq, p, 0);
1562 raw_spin_unlock(&rq->lock);
1566 * try_to_wake_up - wake up a thread
1567 * @p: the thread to be awakened
1568 * @state: the mask of task states that can be woken
1569 * @wake_flags: wake modifier flags (WF_*)
1571 * Put it on the run-queue if it's not already there. The "current"
1572 * thread is always on the run-queue (except when the actual
1573 * re-schedule is in progress), and as such you're allowed to do
1574 * the simpler "current->state = TASK_RUNNING" to mark yourself
1575 * runnable without the overhead of this.
1577 * Returns %true if @p was woken up, %false if it was already running
1578 * or @state didn't match @p's state.
1581 try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags)
1583 unsigned long flags;
1584 int cpu, success = 0;
1587 raw_spin_lock_irqsave(&p->pi_lock, flags);
1588 if (!(p->state & state))
1591 success = 1; /* we're going to change ->state */
1594 if (p->on_rq && ttwu_remote(p, wake_flags))
1599 * If the owning (remote) cpu is still in the middle of schedule() with
1600 * this task as prev, wait until its done referencing the task.
1603 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1605 * In case the architecture enables interrupts in
1606 * context_switch(), we cannot busy wait, since that
1607 * would lead to deadlocks when an interrupt hits and
1608 * tries to wake up @prev. So bail and do a complete
1611 if (ttwu_activate_remote(p, wake_flags))
1618 * Pairs with the smp_wmb() in finish_lock_switch().
1622 p->sched_contributes_to_load = !!task_contributes_to_load(p);
1623 p->state = TASK_WAKING;
1625 if (p->sched_class->task_waking)
1626 p->sched_class->task_waking(p);
1628 cpu = select_task_rq(p, SD_BALANCE_WAKE, wake_flags);
1629 if (task_cpu(p) != cpu) {
1630 wake_flags |= WF_MIGRATED;
1631 set_task_cpu(p, cpu);
1633 #endif /* CONFIG_SMP */
1637 ttwu_stat(p, cpu, wake_flags);
1639 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1645 * try_to_wake_up_local - try to wake up a local task with rq lock held
1646 * @p: the thread to be awakened
1648 * Put @p on the run-queue if it's not already there. The caller must
1649 * ensure that this_rq() is locked, @p is bound to this_rq() and not
1652 static void try_to_wake_up_local(struct task_struct *p)
1654 struct rq *rq = task_rq(p);
1656 BUG_ON(rq != this_rq());
1657 BUG_ON(p == current);
1658 lockdep_assert_held(&rq->lock);
1660 if (!raw_spin_trylock(&p->pi_lock)) {
1661 raw_spin_unlock(&rq->lock);
1662 raw_spin_lock(&p->pi_lock);
1663 raw_spin_lock(&rq->lock);
1666 if (!(p->state & TASK_NORMAL))
1670 ttwu_activate(rq, p, ENQUEUE_WAKEUP);
1672 ttwu_do_wakeup(rq, p, 0);
1673 ttwu_stat(p, smp_processor_id(), 0);
1675 raw_spin_unlock(&p->pi_lock);
1679 * wake_up_process - Wake up a specific process
1680 * @p: The process to be woken up.
1682 * Attempt to wake up the nominated process and move it to the set of runnable
1683 * processes. Returns 1 if the process was woken up, 0 if it was already
1686 * It may be assumed that this function implies a write memory barrier before
1687 * changing the task state if and only if any tasks are woken up.
1689 int wake_up_process(struct task_struct *p)
1691 return try_to_wake_up(p, TASK_ALL, 0);
1693 EXPORT_SYMBOL(wake_up_process);
1695 int wake_up_state(struct task_struct *p, unsigned int state)
1697 return try_to_wake_up(p, state, 0);
1701 * Perform scheduler related setup for a newly forked process p.
1702 * p is forked by current.
1704 * __sched_fork() is basic setup used by init_idle() too:
1706 static void __sched_fork(struct task_struct *p)
1711 p->se.exec_start = 0;
1712 p->se.sum_exec_runtime = 0;
1713 p->se.prev_sum_exec_runtime = 0;
1714 p->se.nr_migrations = 0;
1716 INIT_LIST_HEAD(&p->se.group_node);
1718 #ifdef CONFIG_SCHEDSTATS
1719 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
1722 INIT_LIST_HEAD(&p->rt.run_list);
1724 #ifdef CONFIG_PREEMPT_NOTIFIERS
1725 INIT_HLIST_HEAD(&p->preempt_notifiers);
1730 * fork()/clone()-time setup:
1732 void sched_fork(struct task_struct *p)
1734 unsigned long flags;
1735 int cpu = get_cpu();
1739 * We mark the process as running here. This guarantees that
1740 * nobody will actually run it, and a signal or other external
1741 * event cannot wake it up and insert it on the runqueue either.
1743 p->state = TASK_RUNNING;
1746 * Make sure we do not leak PI boosting priority to the child.
1748 p->prio = current->normal_prio;
1751 * Revert to default priority/policy on fork if requested.
1753 if (unlikely(p->sched_reset_on_fork)) {
1754 if (task_has_rt_policy(p)) {
1755 p->policy = SCHED_NORMAL;
1756 p->static_prio = NICE_TO_PRIO(0);
1758 } else if (PRIO_TO_NICE(p->static_prio) < 0)
1759 p->static_prio = NICE_TO_PRIO(0);
1761 p->prio = p->normal_prio = __normal_prio(p);
1765 * We don't need the reset flag anymore after the fork. It has
1766 * fulfilled its duty:
1768 p->sched_reset_on_fork = 0;
1771 if (!rt_prio(p->prio))
1772 p->sched_class = &fair_sched_class;
1774 if (p->sched_class->task_fork)
1775 p->sched_class->task_fork(p);
1778 * The child is not yet in the pid-hash so no cgroup attach races,
1779 * and the cgroup is pinned to this child due to cgroup_fork()
1780 * is ran before sched_fork().
1782 * Silence PROVE_RCU.
1784 raw_spin_lock_irqsave(&p->pi_lock, flags);
1785 set_task_cpu(p, cpu);
1786 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
1788 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
1789 if (likely(sched_info_on()))
1790 memset(&p->sched_info, 0, sizeof(p->sched_info));
1792 #if defined(CONFIG_SMP)
1795 #ifdef CONFIG_PREEMPT_COUNT
1796 /* Want to start with kernel preemption disabled. */
1797 task_thread_info(p)->preempt_count = 1;
1800 plist_node_init(&p->pushable_tasks, MAX_PRIO);
1807 * wake_up_new_task - wake up a newly created task for the first time.
1809 * This function will do some initial scheduler statistics housekeeping
1810 * that must be done for every newly created context, then puts the task
1811 * on the runqueue and wakes it.
1813 void wake_up_new_task(struct task_struct *p)
1815 unsigned long flags;
1818 raw_spin_lock_irqsave(&p->pi_lock, flags);
1821 * Fork balancing, do it here and not earlier because:
1822 * - cpus_allowed can change in the fork path
1823 * - any previously selected cpu might disappear through hotplug
1825 set_task_cpu(p, select_task_rq(p, SD_BALANCE_FORK, 0));
1828 rq = __task_rq_lock(p);
1829 activate_task(rq, p, 0);
1831 trace_sched_wakeup_new(p, true);
1832 check_preempt_curr(rq, p, WF_FORK);
1834 if (p->sched_class->task_woken)
1835 p->sched_class->task_woken(rq, p);
1837 task_rq_unlock(rq, p, &flags);
1840 #ifdef CONFIG_PREEMPT_NOTIFIERS
1843 * preempt_notifier_register - tell me when current is being preempted & rescheduled
1844 * @notifier: notifier struct to register
1846 void preempt_notifier_register(struct preempt_notifier *notifier)
1848 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
1850 EXPORT_SYMBOL_GPL(preempt_notifier_register);
1853 * preempt_notifier_unregister - no longer interested in preemption notifications
1854 * @notifier: notifier struct to unregister
1856 * This is safe to call from within a preemption notifier.
1858 void preempt_notifier_unregister(struct preempt_notifier *notifier)
1860 hlist_del(¬ifier->link);
1862 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
1864 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
1866 struct preempt_notifier *notifier;
1867 struct hlist_node *node;
1869 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
1870 notifier->ops->sched_in(notifier, raw_smp_processor_id());
1874 fire_sched_out_preempt_notifiers(struct task_struct *curr,
1875 struct task_struct *next)
1877 struct preempt_notifier *notifier;
1878 struct hlist_node *node;
1880 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
1881 notifier->ops->sched_out(notifier, next);
1884 #else /* !CONFIG_PREEMPT_NOTIFIERS */
1886 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
1891 fire_sched_out_preempt_notifiers(struct task_struct *curr,
1892 struct task_struct *next)
1896 #endif /* CONFIG_PREEMPT_NOTIFIERS */
1899 * prepare_task_switch - prepare to switch tasks
1900 * @rq: the runqueue preparing to switch
1901 * @prev: the current task that is being switched out
1902 * @next: the task we are going to switch to.
1904 * This is called with the rq lock held and interrupts off. It must
1905 * be paired with a subsequent finish_task_switch after the context
1908 * prepare_task_switch sets up locking and calls architecture specific
1912 prepare_task_switch(struct rq *rq, struct task_struct *prev,
1913 struct task_struct *next)
1915 sched_info_switch(prev, next);
1916 perf_event_task_sched_out(prev, next);
1917 fire_sched_out_preempt_notifiers(prev, next);
1918 prepare_lock_switch(rq, next);
1919 prepare_arch_switch(next);
1920 trace_sched_switch(prev, next);
1924 * finish_task_switch - clean up after a task-switch
1925 * @rq: runqueue associated with task-switch
1926 * @prev: the thread we just switched away from.
1928 * finish_task_switch must be called after the context switch, paired
1929 * with a prepare_task_switch call before the context switch.
1930 * finish_task_switch will reconcile locking set up by prepare_task_switch,
1931 * and do any other architecture-specific cleanup actions.
1933 * Note that we may have delayed dropping an mm in context_switch(). If
1934 * so, we finish that here outside of the runqueue lock. (Doing it
1935 * with the lock held can cause deadlocks; see schedule() for
1938 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
1939 __releases(rq->lock)
1941 struct mm_struct *mm = rq->prev_mm;
1947 * A task struct has one reference for the use as "current".
1948 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
1949 * schedule one last time. The schedule call will never return, and
1950 * the scheduled task must drop that reference.
1951 * The test for TASK_DEAD must occur while the runqueue locks are
1952 * still held, otherwise prev could be scheduled on another cpu, die
1953 * there before we look at prev->state, and then the reference would
1955 * Manfred Spraul <manfred@colorfullife.com>
1957 prev_state = prev->state;
1958 finish_arch_switch(prev);
1959 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1960 local_irq_disable();
1961 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1962 perf_event_task_sched_in(prev, current);
1963 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
1965 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
1966 finish_lock_switch(rq, prev);
1967 finish_arch_post_lock_switch();
1969 fire_sched_in_preempt_notifiers(current);
1972 if (unlikely(prev_state == TASK_DEAD)) {
1974 * Remove function-return probe instances associated with this
1975 * task and put them back on the free list.
1977 kprobe_flush_task(prev);
1978 put_task_struct(prev);
1984 /* assumes rq->lock is held */
1985 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
1987 if (prev->sched_class->pre_schedule)
1988 prev->sched_class->pre_schedule(rq, prev);
1991 /* rq->lock is NOT held, but preemption is disabled */
1992 static inline void post_schedule(struct rq *rq)
1994 if (rq->post_schedule) {
1995 unsigned long flags;
1997 raw_spin_lock_irqsave(&rq->lock, flags);
1998 if (rq->curr->sched_class->post_schedule)
1999 rq->curr->sched_class->post_schedule(rq);
2000 raw_spin_unlock_irqrestore(&rq->lock, flags);
2002 rq->post_schedule = 0;
2008 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
2012 static inline void post_schedule(struct rq *rq)
2019 * schedule_tail - first thing a freshly forked thread must call.
2020 * @prev: the thread we just switched away from.
2022 asmlinkage void schedule_tail(struct task_struct *prev)
2023 __releases(rq->lock)
2025 struct rq *rq = this_rq();
2027 finish_task_switch(rq, prev);
2030 * FIXME: do we need to worry about rq being invalidated by the
2035 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2036 /* In this case, finish_task_switch does not reenable preemption */
2039 if (current->set_child_tid)
2040 put_user(task_pid_vnr(current), current->set_child_tid);
2044 * context_switch - switch to the new MM and the new
2045 * thread's register state.
2048 context_switch(struct rq *rq, struct task_struct *prev,
2049 struct task_struct *next)
2051 struct mm_struct *mm, *oldmm;
2053 prepare_task_switch(rq, prev, next);
2056 oldmm = prev->active_mm;
2058 * For paravirt, this is coupled with an exit in switch_to to
2059 * combine the page table reload and the switch backend into
2062 arch_start_context_switch(prev);
2065 next->active_mm = oldmm;
2066 atomic_inc(&oldmm->mm_count);
2067 enter_lazy_tlb(oldmm, next);
2069 switch_mm(oldmm, mm, next);
2072 prev->active_mm = NULL;
2073 rq->prev_mm = oldmm;
2076 * Since the runqueue lock will be released by the next
2077 * task (which is an invalid locking op but in the case
2078 * of the scheduler it's an obvious special-case), so we
2079 * do an early lockdep release here:
2081 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2082 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2085 /* Here we just switch the register state and the stack. */
2086 rcu_switch_from(prev);
2087 switch_to(prev, next, prev);
2091 * this_rq must be evaluated again because prev may have moved
2092 * CPUs since it called schedule(), thus the 'rq' on its stack
2093 * frame will be invalid.
2095 finish_task_switch(this_rq(), prev);
2099 * nr_running, nr_uninterruptible and nr_context_switches:
2101 * externally visible scheduler statistics: current number of runnable
2102 * threads, current number of uninterruptible-sleeping threads, total
2103 * number of context switches performed since bootup.
2105 unsigned long nr_running(void)
2107 unsigned long i, sum = 0;
2109 for_each_online_cpu(i)
2110 sum += cpu_rq(i)->nr_running;
2115 unsigned long nr_uninterruptible(void)
2117 unsigned long i, sum = 0;
2119 for_each_possible_cpu(i)
2120 sum += cpu_rq(i)->nr_uninterruptible;
2123 * Since we read the counters lockless, it might be slightly
2124 * inaccurate. Do not allow it to go below zero though:
2126 if (unlikely((long)sum < 0))
2132 unsigned long long nr_context_switches(void)
2135 unsigned long long sum = 0;
2137 for_each_possible_cpu(i)
2138 sum += cpu_rq(i)->nr_switches;
2143 unsigned long nr_iowait(void)
2145 unsigned long i, sum = 0;
2147 for_each_possible_cpu(i)
2148 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2153 unsigned long nr_iowait_cpu(int cpu)
2155 struct rq *this = cpu_rq(cpu);
2156 return atomic_read(&this->nr_iowait);
2159 unsigned long this_cpu_load(void)
2161 struct rq *this = this_rq();
2162 return this->cpu_load[0];
2166 /* Variables and functions for calc_load */
2167 static atomic_long_t calc_load_tasks;
2168 static unsigned long calc_load_update;
2169 unsigned long avenrun[3];
2170 EXPORT_SYMBOL(avenrun);
2172 static long calc_load_fold_active(struct rq *this_rq)
2174 long nr_active, delta = 0;
2176 nr_active = this_rq->nr_running;
2177 nr_active += (long) this_rq->nr_uninterruptible;
2179 if (nr_active != this_rq->calc_load_active) {
2180 delta = nr_active - this_rq->calc_load_active;
2181 this_rq->calc_load_active = nr_active;
2187 static unsigned long
2188 calc_load(unsigned long load, unsigned long exp, unsigned long active)
2191 load += active * (FIXED_1 - exp);
2192 load += 1UL << (FSHIFT - 1);
2193 return load >> FSHIFT;
2198 * For NO_HZ we delay the active fold to the next LOAD_FREQ update.
2200 * When making the ILB scale, we should try to pull this in as well.
2202 static atomic_long_t calc_load_tasks_idle;
2204 void calc_load_account_idle(struct rq *this_rq)
2208 delta = calc_load_fold_active(this_rq);
2210 atomic_long_add(delta, &calc_load_tasks_idle);
2213 static long calc_load_fold_idle(void)
2218 * Its got a race, we don't care...
2220 if (atomic_long_read(&calc_load_tasks_idle))
2221 delta = atomic_long_xchg(&calc_load_tasks_idle, 0);
2227 * fixed_power_int - compute: x^n, in O(log n) time
2229 * @x: base of the power
2230 * @frac_bits: fractional bits of @x
2231 * @n: power to raise @x to.
2233 * By exploiting the relation between the definition of the natural power
2234 * function: x^n := x*x*...*x (x multiplied by itself for n times), and
2235 * the binary encoding of numbers used by computers: n := \Sum n_i * 2^i,
2236 * (where: n_i \elem {0, 1}, the binary vector representing n),
2237 * we find: x^n := x^(\Sum n_i * 2^i) := \Prod x^(n_i * 2^i), which is
2238 * of course trivially computable in O(log_2 n), the length of our binary
2241 static unsigned long
2242 fixed_power_int(unsigned long x, unsigned int frac_bits, unsigned int n)
2244 unsigned long result = 1UL << frac_bits;
2249 result += 1UL << (frac_bits - 1);
2250 result >>= frac_bits;
2256 x += 1UL << (frac_bits - 1);
2264 * a1 = a0 * e + a * (1 - e)
2266 * a2 = a1 * e + a * (1 - e)
2267 * = (a0 * e + a * (1 - e)) * e + a * (1 - e)
2268 * = a0 * e^2 + a * (1 - e) * (1 + e)
2270 * a3 = a2 * e + a * (1 - e)
2271 * = (a0 * e^2 + a * (1 - e) * (1 + e)) * e + a * (1 - e)
2272 * = a0 * e^3 + a * (1 - e) * (1 + e + e^2)
2276 * an = a0 * e^n + a * (1 - e) * (1 + e + ... + e^n-1) [1]
2277 * = a0 * e^n + a * (1 - e) * (1 - e^n)/(1 - e)
2278 * = a0 * e^n + a * (1 - e^n)
2280 * [1] application of the geometric series:
2283 * S_n := \Sum x^i = -------------
2286 static unsigned long
2287 calc_load_n(unsigned long load, unsigned long exp,
2288 unsigned long active, unsigned int n)
2291 return calc_load(load, fixed_power_int(exp, FSHIFT, n), active);
2295 * NO_HZ can leave us missing all per-cpu ticks calling
2296 * calc_load_account_active(), but since an idle CPU folds its delta into
2297 * calc_load_tasks_idle per calc_load_account_idle(), all we need to do is fold
2298 * in the pending idle delta if our idle period crossed a load cycle boundary.
2300 * Once we've updated the global active value, we need to apply the exponential
2301 * weights adjusted to the number of cycles missed.
2303 static void calc_global_nohz(void)
2305 long delta, active, n;
2308 * If we crossed a calc_load_update boundary, make sure to fold
2309 * any pending idle changes, the respective CPUs might have
2310 * missed the tick driven calc_load_account_active() update
2313 delta = calc_load_fold_idle();
2315 atomic_long_add(delta, &calc_load_tasks);
2318 * It could be the one fold was all it took, we done!
2320 if (time_before(jiffies, calc_load_update + 10))
2324 * Catch-up, fold however many we are behind still
2326 delta = jiffies - calc_load_update - 10;
2327 n = 1 + (delta / LOAD_FREQ);
2329 active = atomic_long_read(&calc_load_tasks);
2330 active = active > 0 ? active * FIXED_1 : 0;
2332 avenrun[0] = calc_load_n(avenrun[0], EXP_1, active, n);
2333 avenrun[1] = calc_load_n(avenrun[1], EXP_5, active, n);
2334 avenrun[2] = calc_load_n(avenrun[2], EXP_15, active, n);
2336 calc_load_update += n * LOAD_FREQ;
2339 void calc_load_account_idle(struct rq *this_rq)
2343 static inline long calc_load_fold_idle(void)
2348 static void calc_global_nohz(void)
2354 * get_avenrun - get the load average array
2355 * @loads: pointer to dest load array
2356 * @offset: offset to add
2357 * @shift: shift count to shift the result left
2359 * These values are estimates at best, so no need for locking.
2361 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
2363 loads[0] = (avenrun[0] + offset) << shift;
2364 loads[1] = (avenrun[1] + offset) << shift;
2365 loads[2] = (avenrun[2] + offset) << shift;
2369 * calc_load - update the avenrun load estimates 10 ticks after the
2370 * CPUs have updated calc_load_tasks.
2372 void calc_global_load(unsigned long ticks)
2376 if (time_before(jiffies, calc_load_update + 10))
2379 active = atomic_long_read(&calc_load_tasks);
2380 active = active > 0 ? active * FIXED_1 : 0;
2382 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
2383 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
2384 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
2386 calc_load_update += LOAD_FREQ;
2389 * Account one period with whatever state we found before
2390 * folding in the nohz state and ageing the entire idle period.
2392 * This avoids loosing a sample when we go idle between
2393 * calc_load_account_active() (10 ticks ago) and now and thus
2400 * Called from update_cpu_load() to periodically update this CPU's
2403 static void calc_load_account_active(struct rq *this_rq)
2407 if (time_before(jiffies, this_rq->calc_load_update))
2410 delta = calc_load_fold_active(this_rq);
2411 delta += calc_load_fold_idle();
2413 atomic_long_add(delta, &calc_load_tasks);
2415 this_rq->calc_load_update += LOAD_FREQ;
2419 * The exact cpuload at various idx values, calculated at every tick would be
2420 * load = (2^idx - 1) / 2^idx * load + 1 / 2^idx * cur_load
2422 * If a cpu misses updates for n-1 ticks (as it was idle) and update gets called
2423 * on nth tick when cpu may be busy, then we have:
2424 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
2425 * load = (2^idx - 1) / 2^idx) * load + 1 / 2^idx * cur_load
2427 * decay_load_missed() below does efficient calculation of
2428 * load = ((2^idx - 1) / 2^idx)^(n-1) * load
2429 * avoiding 0..n-1 loop doing load = ((2^idx - 1) / 2^idx) * load
2431 * The calculation is approximated on a 128 point scale.
2432 * degrade_zero_ticks is the number of ticks after which load at any
2433 * particular idx is approximated to be zero.
2434 * degrade_factor is a precomputed table, a row for each load idx.
2435 * Each column corresponds to degradation factor for a power of two ticks,
2436 * based on 128 point scale.
2438 * row 2, col 3 (=12) says that the degradation at load idx 2 after
2439 * 8 ticks is 12/128 (which is an approximation of exact factor 3^8/4^8).
2441 * With this power of 2 load factors, we can degrade the load n times
2442 * by looking at 1 bits in n and doing as many mult/shift instead of
2443 * n mult/shifts needed by the exact degradation.
2445 #define DEGRADE_SHIFT 7
2446 static const unsigned char
2447 degrade_zero_ticks[CPU_LOAD_IDX_MAX] = {0, 8, 32, 64, 128};
2448 static const unsigned char
2449 degrade_factor[CPU_LOAD_IDX_MAX][DEGRADE_SHIFT + 1] = {
2450 {0, 0, 0, 0, 0, 0, 0, 0},
2451 {64, 32, 8, 0, 0, 0, 0, 0},
2452 {96, 72, 40, 12, 1, 0, 0},
2453 {112, 98, 75, 43, 15, 1, 0},
2454 {120, 112, 98, 76, 45, 16, 2} };
2457 * Update cpu_load for any missed ticks, due to tickless idle. The backlog
2458 * would be when CPU is idle and so we just decay the old load without
2459 * adding any new load.
2461 static unsigned long
2462 decay_load_missed(unsigned long load, unsigned long missed_updates, int idx)
2466 if (!missed_updates)
2469 if (missed_updates >= degrade_zero_ticks[idx])
2473 return load >> missed_updates;
2475 while (missed_updates) {
2476 if (missed_updates % 2)
2477 load = (load * degrade_factor[idx][j]) >> DEGRADE_SHIFT;
2479 missed_updates >>= 1;
2486 * Update rq->cpu_load[] statistics. This function is usually called every
2487 * scheduler tick (TICK_NSEC). With tickless idle this will not be called
2488 * every tick. We fix it up based on jiffies.
2490 void update_cpu_load(struct rq *this_rq)
2492 unsigned long this_load = this_rq->load.weight;
2493 unsigned long curr_jiffies = jiffies;
2494 unsigned long pending_updates;
2497 this_rq->nr_load_updates++;
2499 /* Avoid repeated calls on same jiffy, when moving in and out of idle */
2500 if (curr_jiffies == this_rq->last_load_update_tick)
2503 pending_updates = curr_jiffies - this_rq->last_load_update_tick;
2504 this_rq->last_load_update_tick = curr_jiffies;
2506 /* Update our load: */
2507 this_rq->cpu_load[0] = this_load; /* Fasttrack for idx 0 */
2508 for (i = 1, scale = 2; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
2509 unsigned long old_load, new_load;
2511 /* scale is effectively 1 << i now, and >> i divides by scale */
2513 old_load = this_rq->cpu_load[i];
2514 old_load = decay_load_missed(old_load, pending_updates - 1, i);
2515 new_load = this_load;
2517 * Round up the averaging division if load is increasing. This
2518 * prevents us from getting stuck on 9 if the load is 10, for
2521 if (new_load > old_load)
2522 new_load += scale - 1;
2524 this_rq->cpu_load[i] = (old_load * (scale - 1) + new_load) >> i;
2527 sched_avg_update(this_rq);
2530 static void update_cpu_load_active(struct rq *this_rq)
2532 update_cpu_load(this_rq);
2534 calc_load_account_active(this_rq);
2540 * sched_exec - execve() is a valuable balancing opportunity, because at
2541 * this point the task has the smallest effective memory and cache footprint.
2543 void sched_exec(void)
2545 struct task_struct *p = current;
2546 unsigned long flags;
2549 raw_spin_lock_irqsave(&p->pi_lock, flags);
2550 dest_cpu = p->sched_class->select_task_rq(p, SD_BALANCE_EXEC, 0);
2551 if (dest_cpu == smp_processor_id())
2554 if (likely(cpu_active(dest_cpu))) {
2555 struct migration_arg arg = { p, dest_cpu };
2557 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2558 stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg);
2562 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
2567 DEFINE_PER_CPU(struct kernel_stat, kstat);
2568 DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat);
2570 EXPORT_PER_CPU_SYMBOL(kstat);
2571 EXPORT_PER_CPU_SYMBOL(kernel_cpustat);
2574 * Return any ns on the sched_clock that have not yet been accounted in
2575 * @p in case that task is currently running.
2577 * Called with task_rq_lock() held on @rq.
2579 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
2583 if (task_current(rq, p)) {
2584 update_rq_clock(rq);
2585 ns = rq->clock_task - p->se.exec_start;
2593 unsigned long long task_delta_exec(struct task_struct *p)
2595 unsigned long flags;
2599 rq = task_rq_lock(p, &flags);
2600 ns = do_task_delta_exec(p, rq);
2601 task_rq_unlock(rq, p, &flags);
2607 * Return accounted runtime for the task.
2608 * In case the task is currently running, return the runtime plus current's
2609 * pending runtime that have not been accounted yet.
2611 unsigned long long task_sched_runtime(struct task_struct *p)
2613 unsigned long flags;
2617 rq = task_rq_lock(p, &flags);
2618 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
2619 task_rq_unlock(rq, p, &flags);
2624 #ifdef CONFIG_CGROUP_CPUACCT
2625 struct cgroup_subsys cpuacct_subsys;
2626 struct cpuacct root_cpuacct;
2629 static inline void task_group_account_field(struct task_struct *p, int index,
2632 #ifdef CONFIG_CGROUP_CPUACCT
2633 struct kernel_cpustat *kcpustat;
2637 * Since all updates are sure to touch the root cgroup, we
2638 * get ourselves ahead and touch it first. If the root cgroup
2639 * is the only cgroup, then nothing else should be necessary.
2642 __get_cpu_var(kernel_cpustat).cpustat[index] += tmp;
2644 #ifdef CONFIG_CGROUP_CPUACCT
2645 if (unlikely(!cpuacct_subsys.active))
2650 while (ca && (ca != &root_cpuacct)) {
2651 kcpustat = this_cpu_ptr(ca->cpustat);
2652 kcpustat->cpustat[index] += tmp;
2661 * Account user cpu time to a process.
2662 * @p: the process that the cpu time gets accounted to
2663 * @cputime: the cpu time spent in user space since the last update
2664 * @cputime_scaled: cputime scaled by cpu frequency
2666 void account_user_time(struct task_struct *p, cputime_t cputime,
2667 cputime_t cputime_scaled)
2671 /* Add user time to process. */
2672 p->utime += cputime;
2673 p->utimescaled += cputime_scaled;
2674 account_group_user_time(p, cputime);
2676 index = (TASK_NICE(p) > 0) ? CPUTIME_NICE : CPUTIME_USER;
2678 /* Add user time to cpustat. */
2679 task_group_account_field(p, index, (__force u64) cputime);
2681 /* Account for user time used */
2682 acct_update_integrals(p);
2686 * Account guest cpu time to a process.
2687 * @p: the process that the cpu time gets accounted to
2688 * @cputime: the cpu time spent in virtual machine since the last update
2689 * @cputime_scaled: cputime scaled by cpu frequency
2691 static void account_guest_time(struct task_struct *p, cputime_t cputime,
2692 cputime_t cputime_scaled)
2694 u64 *cpustat = kcpustat_this_cpu->cpustat;
2696 /* Add guest time to process. */
2697 p->utime += cputime;
2698 p->utimescaled += cputime_scaled;
2699 account_group_user_time(p, cputime);
2700 p->gtime += cputime;
2702 /* Add guest time to cpustat. */
2703 if (TASK_NICE(p) > 0) {
2704 cpustat[CPUTIME_NICE] += (__force u64) cputime;
2705 cpustat[CPUTIME_GUEST_NICE] += (__force u64) cputime;
2707 cpustat[CPUTIME_USER] += (__force u64) cputime;
2708 cpustat[CPUTIME_GUEST] += (__force u64) cputime;
2713 * Account system cpu time to a process and desired cpustat field
2714 * @p: the process that the cpu time gets accounted to
2715 * @cputime: the cpu time spent in kernel space since the last update
2716 * @cputime_scaled: cputime scaled by cpu frequency
2717 * @target_cputime64: pointer to cpustat field that has to be updated
2720 void __account_system_time(struct task_struct *p, cputime_t cputime,
2721 cputime_t cputime_scaled, int index)
2723 /* Add system time to process. */
2724 p->stime += cputime;
2725 p->stimescaled += cputime_scaled;
2726 account_group_system_time(p, cputime);
2728 /* Add system time to cpustat. */
2729 task_group_account_field(p, index, (__force u64) cputime);
2731 /* Account for system time used */
2732 acct_update_integrals(p);
2736 * Account system cpu time to a process.
2737 * @p: the process that the cpu time gets accounted to
2738 * @hardirq_offset: the offset to subtract from hardirq_count()
2739 * @cputime: the cpu time spent in kernel space since the last update
2740 * @cputime_scaled: cputime scaled by cpu frequency
2742 void account_system_time(struct task_struct *p, int hardirq_offset,
2743 cputime_t cputime, cputime_t cputime_scaled)
2747 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
2748 account_guest_time(p, cputime, cputime_scaled);
2752 if (hardirq_count() - hardirq_offset)
2753 index = CPUTIME_IRQ;
2754 else if (in_serving_softirq())
2755 index = CPUTIME_SOFTIRQ;
2757 index = CPUTIME_SYSTEM;
2759 __account_system_time(p, cputime, cputime_scaled, index);
2763 * Account for involuntary wait time.
2764 * @cputime: the cpu time spent in involuntary wait
2766 void account_steal_time(cputime_t cputime)
2768 u64 *cpustat = kcpustat_this_cpu->cpustat;
2770 cpustat[CPUTIME_STEAL] += (__force u64) cputime;
2774 * Account for idle time.
2775 * @cputime: the cpu time spent in idle wait
2777 void account_idle_time(cputime_t cputime)
2779 u64 *cpustat = kcpustat_this_cpu->cpustat;
2780 struct rq *rq = this_rq();
2782 if (atomic_read(&rq->nr_iowait) > 0)
2783 cpustat[CPUTIME_IOWAIT] += (__force u64) cputime;
2785 cpustat[CPUTIME_IDLE] += (__force u64) cputime;
2788 static __always_inline bool steal_account_process_tick(void)
2790 #ifdef CONFIG_PARAVIRT
2791 if (static_key_false(¶virt_steal_enabled)) {
2794 steal = paravirt_steal_clock(smp_processor_id());
2795 steal -= this_rq()->prev_steal_time;
2797 st = steal_ticks(steal);
2798 this_rq()->prev_steal_time += st * TICK_NSEC;
2800 account_steal_time(st);
2807 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
2809 #ifdef CONFIG_IRQ_TIME_ACCOUNTING
2811 * Account a tick to a process and cpustat
2812 * @p: the process that the cpu time gets accounted to
2813 * @user_tick: is the tick from userspace
2814 * @rq: the pointer to rq
2816 * Tick demultiplexing follows the order
2817 * - pending hardirq update
2818 * - pending softirq update
2822 * - check for guest_time
2823 * - else account as system_time
2825 * Check for hardirq is done both for system and user time as there is
2826 * no timer going off while we are on hardirq and hence we may never get an
2827 * opportunity to update it solely in system time.
2828 * p->stime and friends are only updated on system time and not on irq
2829 * softirq as those do not count in task exec_runtime any more.
2831 static void irqtime_account_process_tick(struct task_struct *p, int user_tick,
2834 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
2835 u64 *cpustat = kcpustat_this_cpu->cpustat;
2837 if (steal_account_process_tick())
2840 if (irqtime_account_hi_update()) {
2841 cpustat[CPUTIME_IRQ] += (__force u64) cputime_one_jiffy;
2842 } else if (irqtime_account_si_update()) {
2843 cpustat[CPUTIME_SOFTIRQ] += (__force u64) cputime_one_jiffy;
2844 } else if (this_cpu_ksoftirqd() == p) {
2846 * ksoftirqd time do not get accounted in cpu_softirq_time.
2847 * So, we have to handle it separately here.
2848 * Also, p->stime needs to be updated for ksoftirqd.
2850 __account_system_time(p, cputime_one_jiffy, one_jiffy_scaled,
2852 } else if (user_tick) {
2853 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
2854 } else if (p == rq->idle) {
2855 account_idle_time(cputime_one_jiffy);
2856 } else if (p->flags & PF_VCPU) { /* System time or guest time */
2857 account_guest_time(p, cputime_one_jiffy, one_jiffy_scaled);
2859 __account_system_time(p, cputime_one_jiffy, one_jiffy_scaled,
2864 static void irqtime_account_idle_ticks(int ticks)
2867 struct rq *rq = this_rq();
2869 for (i = 0; i < ticks; i++)
2870 irqtime_account_process_tick(current, 0, rq);
2872 #else /* CONFIG_IRQ_TIME_ACCOUNTING */
2873 static void irqtime_account_idle_ticks(int ticks) {}
2874 static void irqtime_account_process_tick(struct task_struct *p, int user_tick,
2876 #endif /* CONFIG_IRQ_TIME_ACCOUNTING */
2879 * Account a single tick of cpu time.
2880 * @p: the process that the cpu time gets accounted to
2881 * @user_tick: indicates if the tick is a user or a system tick
2883 void account_process_tick(struct task_struct *p, int user_tick)
2885 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
2886 struct rq *rq = this_rq();
2888 if (sched_clock_irqtime) {
2889 irqtime_account_process_tick(p, user_tick, rq);
2893 if (steal_account_process_tick())
2897 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
2898 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
2899 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
2902 account_idle_time(cputime_one_jiffy);
2906 * Account multiple ticks of steal time.
2907 * @p: the process from which the cpu time has been stolen
2908 * @ticks: number of stolen ticks
2910 void account_steal_ticks(unsigned long ticks)
2912 account_steal_time(jiffies_to_cputime(ticks));
2916 * Account multiple ticks of idle time.
2917 * @ticks: number of stolen ticks
2919 void account_idle_ticks(unsigned long ticks)
2922 if (sched_clock_irqtime) {
2923 irqtime_account_idle_ticks(ticks);
2927 account_idle_time(jiffies_to_cputime(ticks));
2933 * Use precise platform statistics if available:
2935 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
2936 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2942 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2944 struct task_cputime cputime;
2946 thread_group_cputime(p, &cputime);
2948 *ut = cputime.utime;
2949 *st = cputime.stime;
2953 #ifndef nsecs_to_cputime
2954 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
2957 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2959 cputime_t rtime, utime = p->utime, total = utime + p->stime;
2962 * Use CFS's precise accounting:
2964 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
2967 u64 temp = (__force u64) rtime;
2969 temp *= (__force u64) utime;
2970 do_div(temp, (__force u32) total);
2971 utime = (__force cputime_t) temp;
2976 * Compare with previous values, to keep monotonicity:
2978 p->prev_utime = max(p->prev_utime, utime);
2979 p->prev_stime = max(p->prev_stime, rtime - p->prev_utime);
2981 *ut = p->prev_utime;
2982 *st = p->prev_stime;
2986 * Must be called with siglock held.
2988 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
2990 struct signal_struct *sig = p->signal;
2991 struct task_cputime cputime;
2992 cputime_t rtime, utime, total;
2994 thread_group_cputime(p, &cputime);
2996 total = cputime.utime + cputime.stime;
2997 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
3000 u64 temp = (__force u64) rtime;
3002 temp *= (__force u64) cputime.utime;
3003 do_div(temp, (__force u32) total);
3004 utime = (__force cputime_t) temp;
3008 sig->prev_utime = max(sig->prev_utime, utime);
3009 sig->prev_stime = max(sig->prev_stime, rtime - sig->prev_utime);
3011 *ut = sig->prev_utime;
3012 *st = sig->prev_stime;
3017 * This function gets called by the timer code, with HZ frequency.
3018 * We call it with interrupts disabled.
3020 void scheduler_tick(void)
3022 int cpu = smp_processor_id();
3023 struct rq *rq = cpu_rq(cpu);
3024 struct task_struct *curr = rq->curr;
3028 raw_spin_lock(&rq->lock);
3029 update_rq_clock(rq);
3030 update_cpu_load_active(rq);
3031 curr->sched_class->task_tick(rq, curr, 0);
3032 raw_spin_unlock(&rq->lock);
3034 perf_event_task_tick();
3037 rq->idle_balance = idle_cpu(cpu);
3038 trigger_load_balance(rq, cpu);
3042 notrace unsigned long get_parent_ip(unsigned long addr)
3044 if (in_lock_functions(addr)) {
3045 addr = CALLER_ADDR2;
3046 if (in_lock_functions(addr))
3047 addr = CALLER_ADDR3;
3052 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
3053 defined(CONFIG_PREEMPT_TRACER))
3055 void __kprobes add_preempt_count(int val)
3057 #ifdef CONFIG_DEBUG_PREEMPT
3061 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3064 preempt_count() += val;
3065 #ifdef CONFIG_DEBUG_PREEMPT
3067 * Spinlock count overflowing soon?
3069 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
3072 if (preempt_count() == val)
3073 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3075 EXPORT_SYMBOL(add_preempt_count);
3077 void __kprobes sub_preempt_count(int val)
3079 #ifdef CONFIG_DEBUG_PREEMPT
3083 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
3086 * Is the spinlock portion underflowing?
3088 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
3089 !(preempt_count() & PREEMPT_MASK)))
3093 if (preempt_count() == val)
3094 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3095 preempt_count() -= val;
3097 EXPORT_SYMBOL(sub_preempt_count);
3102 * Print scheduling while atomic bug:
3104 static noinline void __schedule_bug(struct task_struct *prev)
3106 if (oops_in_progress)
3109 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
3110 prev->comm, prev->pid, preempt_count());
3112 debug_show_held_locks(prev);
3114 if (irqs_disabled())
3115 print_irqtrace_events(prev);
3120 * Various schedule()-time debugging checks and statistics:
3122 static inline void schedule_debug(struct task_struct *prev)
3125 * Test if we are atomic. Since do_exit() needs to call into
3126 * schedule() atomically, we ignore that path for now.
3127 * Otherwise, whine if we are scheduling when we should not be.
3129 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
3130 __schedule_bug(prev);
3133 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
3135 schedstat_inc(this_rq(), sched_count);
3138 static void put_prev_task(struct rq *rq, struct task_struct *prev)
3140 if (prev->on_rq || rq->skip_clock_update < 0)
3141 update_rq_clock(rq);
3142 prev->sched_class->put_prev_task(rq, prev);
3146 * Pick up the highest-prio task:
3148 static inline struct task_struct *
3149 pick_next_task(struct rq *rq)
3151 const struct sched_class *class;
3152 struct task_struct *p;
3155 * Optimization: we know that if all tasks are in
3156 * the fair class we can call that function directly:
3158 if (likely(rq->nr_running == rq->cfs.h_nr_running)) {
3159 p = fair_sched_class.pick_next_task(rq);
3164 for_each_class(class) {
3165 p = class->pick_next_task(rq);
3170 BUG(); /* the idle class will always have a runnable task */
3174 * __schedule() is the main scheduler function.
3176 static void __sched __schedule(void)
3178 struct task_struct *prev, *next;
3179 unsigned long *switch_count;
3185 cpu = smp_processor_id();
3187 rcu_note_context_switch(cpu);
3190 schedule_debug(prev);
3192 if (sched_feat(HRTICK))
3195 raw_spin_lock_irq(&rq->lock);
3197 switch_count = &prev->nivcsw;
3198 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
3199 if (unlikely(signal_pending_state(prev->state, prev))) {
3200 prev->state = TASK_RUNNING;
3202 deactivate_task(rq, prev, DEQUEUE_SLEEP);
3206 * If a worker went to sleep, notify and ask workqueue
3207 * whether it wants to wake up a task to maintain
3210 if (prev->flags & PF_WQ_WORKER) {
3211 struct task_struct *to_wakeup;
3213 to_wakeup = wq_worker_sleeping(prev, cpu);
3215 try_to_wake_up_local(to_wakeup);
3218 switch_count = &prev->nvcsw;
3221 pre_schedule(rq, prev);
3223 if (unlikely(!rq->nr_running))
3224 idle_balance(cpu, rq);
3226 put_prev_task(rq, prev);
3227 next = pick_next_task(rq);
3228 clear_tsk_need_resched(prev);
3229 rq->skip_clock_update = 0;
3231 if (likely(prev != next)) {
3236 context_switch(rq, prev, next); /* unlocks the rq */
3238 * The context switch have flipped the stack from under us
3239 * and restored the local variables which were saved when
3240 * this task called schedule() in the past. prev == current
3241 * is still correct, but it can be moved to another cpu/rq.
3243 cpu = smp_processor_id();
3246 raw_spin_unlock_irq(&rq->lock);
3250 sched_preempt_enable_no_resched();
3255 static inline void sched_submit_work(struct task_struct *tsk)
3257 if (!tsk->state || tsk_is_pi_blocked(tsk))
3260 * If we are going to sleep and we have plugged IO queued,
3261 * make sure to submit it to avoid deadlocks.
3263 if (blk_needs_flush_plug(tsk))
3264 blk_schedule_flush_plug(tsk);
3267 asmlinkage void __sched schedule(void)
3269 struct task_struct *tsk = current;
3271 sched_submit_work(tsk);
3274 EXPORT_SYMBOL(schedule);
3277 * schedule_preempt_disabled - called with preemption disabled
3279 * Returns with preemption disabled. Note: preempt_count must be 1
3281 void __sched schedule_preempt_disabled(void)
3283 sched_preempt_enable_no_resched();
3288 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
3290 static inline bool owner_running(struct mutex *lock, struct task_struct *owner)
3292 if (lock->owner != owner)
3296 * Ensure we emit the owner->on_cpu, dereference _after_ checking
3297 * lock->owner still matches owner, if that fails, owner might
3298 * point to free()d memory, if it still matches, the rcu_read_lock()
3299 * ensures the memory stays valid.
3303 return owner->on_cpu;
3307 * Look out! "owner" is an entirely speculative pointer
3308 * access and not reliable.
3310 int mutex_spin_on_owner(struct mutex *lock, struct task_struct *owner)
3312 if (!sched_feat(OWNER_SPIN))
3316 while (owner_running(lock, owner)) {
3320 arch_mutex_cpu_relax();
3325 * We break out the loop above on need_resched() and when the
3326 * owner changed, which is a sign for heavy contention. Return
3327 * success only when lock->owner is NULL.
3329 return lock->owner == NULL;
3333 #ifdef CONFIG_PREEMPT
3335 * this is the entry point to schedule() from in-kernel preemption
3336 * off of preempt_enable. Kernel preemptions off return from interrupt
3337 * occur there and call schedule directly.
3339 asmlinkage void __sched notrace preempt_schedule(void)
3341 struct thread_info *ti = current_thread_info();
3344 * If there is a non-zero preempt_count or interrupts are disabled,
3345 * we do not want to preempt the current task. Just return..
3347 if (likely(ti->preempt_count || irqs_disabled()))
3351 add_preempt_count_notrace(PREEMPT_ACTIVE);
3353 sub_preempt_count_notrace(PREEMPT_ACTIVE);
3356 * Check again in case we missed a preemption opportunity
3357 * between schedule and now.
3360 } while (need_resched());
3362 EXPORT_SYMBOL(preempt_schedule);
3365 * this is the entry point to schedule() from kernel preemption
3366 * off of irq context.
3367 * Note, that this is called and return with irqs disabled. This will
3368 * protect us against recursive calling from irq.
3370 asmlinkage void __sched preempt_schedule_irq(void)
3372 struct thread_info *ti = current_thread_info();
3374 /* Catch callers which need to be fixed */
3375 BUG_ON(ti->preempt_count || !irqs_disabled());
3378 add_preempt_count(PREEMPT_ACTIVE);
3381 local_irq_disable();
3382 sub_preempt_count(PREEMPT_ACTIVE);
3385 * Check again in case we missed a preemption opportunity
3386 * between schedule and now.
3389 } while (need_resched());
3392 #endif /* CONFIG_PREEMPT */
3394 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3397 return try_to_wake_up(curr->private, mode, wake_flags);
3399 EXPORT_SYMBOL(default_wake_function);
3402 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
3403 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
3404 * number) then we wake all the non-exclusive tasks and one exclusive task.
3406 * There are circumstances in which we can try to wake a task which has already
3407 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
3408 * zero in this (rare) case, and we handle it by continuing to scan the queue.
3410 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
3411 int nr_exclusive, int wake_flags, void *key)
3413 wait_queue_t *curr, *next;
3415 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
3416 unsigned flags = curr->flags;
3418 if (curr->func(curr, mode, wake_flags, key) &&
3419 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
3425 * __wake_up - wake up threads blocked on a waitqueue.
3427 * @mode: which threads
3428 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3429 * @key: is directly passed to the wakeup function
3431 * It may be assumed that this function implies a write memory barrier before
3432 * changing the task state if and only if any tasks are woken up.
3434 void __wake_up(wait_queue_head_t *q, unsigned int mode,
3435 int nr_exclusive, void *key)
3437 unsigned long flags;
3439 spin_lock_irqsave(&q->lock, flags);
3440 __wake_up_common(q, mode, nr_exclusive, 0, key);
3441 spin_unlock_irqrestore(&q->lock, flags);
3443 EXPORT_SYMBOL(__wake_up);
3446 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
3448 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode, int nr)
3450 __wake_up_common(q, mode, nr, 0, NULL);
3452 EXPORT_SYMBOL_GPL(__wake_up_locked);
3454 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
3456 __wake_up_common(q, mode, 1, 0, key);
3458 EXPORT_SYMBOL_GPL(__wake_up_locked_key);
3461 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
3463 * @mode: which threads
3464 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3465 * @key: opaque value to be passed to wakeup targets
3467 * The sync wakeup differs that the waker knows that it will schedule
3468 * away soon, so while the target thread will be woken up, it will not
3469 * be migrated to another CPU - ie. the two threads are 'synchronized'
3470 * with each other. This can prevent needless bouncing between CPUs.
3472 * On UP it can prevent extra preemption.
3474 * It may be assumed that this function implies a write memory barrier before
3475 * changing the task state if and only if any tasks are woken up.
3477 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
3478 int nr_exclusive, void *key)
3480 unsigned long flags;
3481 int wake_flags = WF_SYNC;
3486 if (unlikely(!nr_exclusive))
3489 spin_lock_irqsave(&q->lock, flags);
3490 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
3491 spin_unlock_irqrestore(&q->lock, flags);
3493 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
3496 * __wake_up_sync - see __wake_up_sync_key()
3498 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
3500 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
3502 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
3505 * complete: - signals a single thread waiting on this completion
3506 * @x: holds the state of this particular completion
3508 * This will wake up a single thread waiting on this completion. Threads will be
3509 * awakened in the same order in which they were queued.
3511 * See also complete_all(), wait_for_completion() and related routines.
3513 * It may be assumed that this function implies a write memory barrier before
3514 * changing the task state if and only if any tasks are woken up.
3516 void complete(struct completion *x)
3518 unsigned long flags;
3520 spin_lock_irqsave(&x->wait.lock, flags);
3522 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
3523 spin_unlock_irqrestore(&x->wait.lock, flags);
3525 EXPORT_SYMBOL(complete);
3528 * complete_all: - signals all threads waiting on this completion
3529 * @x: holds the state of this particular completion
3531 * This will wake up all threads waiting on this particular completion event.
3533 * It may be assumed that this function implies a write memory barrier before
3534 * changing the task state if and only if any tasks are woken up.
3536 void complete_all(struct completion *x)
3538 unsigned long flags;
3540 spin_lock_irqsave(&x->wait.lock, flags);
3541 x->done += UINT_MAX/2;
3542 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
3543 spin_unlock_irqrestore(&x->wait.lock, flags);
3545 EXPORT_SYMBOL(complete_all);
3547 static inline long __sched
3548 do_wait_for_common(struct completion *x, long timeout, int state)
3551 DECLARE_WAITQUEUE(wait, current);
3553 __add_wait_queue_tail_exclusive(&x->wait, &wait);
3555 if (signal_pending_state(state, current)) {
3556 timeout = -ERESTARTSYS;
3559 __set_current_state(state);
3560 spin_unlock_irq(&x->wait.lock);
3561 timeout = schedule_timeout(timeout);
3562 spin_lock_irq(&x->wait.lock);
3563 } while (!x->done && timeout);
3564 __remove_wait_queue(&x->wait, &wait);
3569 return timeout ?: 1;
3573 wait_for_common(struct completion *x, long timeout, int state)
3577 spin_lock_irq(&x->wait.lock);
3578 timeout = do_wait_for_common(x, timeout, state);
3579 spin_unlock_irq(&x->wait.lock);
3584 * wait_for_completion: - waits for completion of a task
3585 * @x: holds the state of this particular completion
3587 * This waits to be signaled for completion of a specific task. It is NOT
3588 * interruptible and there is no timeout.
3590 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
3591 * and interrupt capability. Also see complete().
3593 void __sched wait_for_completion(struct completion *x)
3595 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
3597 EXPORT_SYMBOL(wait_for_completion);
3600 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
3601 * @x: holds the state of this particular completion
3602 * @timeout: timeout value in jiffies
3604 * This waits for either a completion of a specific task to be signaled or for a
3605 * specified timeout to expire. The timeout is in jiffies. It is not
3608 * The return value is 0 if timed out, and positive (at least 1, or number of
3609 * jiffies left till timeout) if completed.
3611 unsigned long __sched
3612 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
3614 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
3616 EXPORT_SYMBOL(wait_for_completion_timeout);
3619 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
3620 * @x: holds the state of this particular completion
3622 * This waits for completion of a specific task to be signaled. It is
3625 * The return value is -ERESTARTSYS if interrupted, 0 if completed.
3627 int __sched wait_for_completion_interruptible(struct completion *x)
3629 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
3630 if (t == -ERESTARTSYS)
3634 EXPORT_SYMBOL(wait_for_completion_interruptible);
3637 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
3638 * @x: holds the state of this particular completion
3639 * @timeout: timeout value in jiffies
3641 * This waits for either a completion of a specific task to be signaled or for a
3642 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
3644 * The return value is -ERESTARTSYS if interrupted, 0 if timed out,
3645 * positive (at least 1, or number of jiffies left till timeout) if completed.
3648 wait_for_completion_interruptible_timeout(struct completion *x,
3649 unsigned long timeout)
3651 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
3653 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
3656 * wait_for_completion_killable: - waits for completion of a task (killable)
3657 * @x: holds the state of this particular completion
3659 * This waits to be signaled for completion of a specific task. It can be
3660 * interrupted by a kill signal.
3662 * The return value is -ERESTARTSYS if interrupted, 0 if completed.
3664 int __sched wait_for_completion_killable(struct completion *x)
3666 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
3667 if (t == -ERESTARTSYS)
3671 EXPORT_SYMBOL(wait_for_completion_killable);
3674 * wait_for_completion_killable_timeout: - waits for completion of a task (w/(to,killable))
3675 * @x: holds the state of this particular completion
3676 * @timeout: timeout value in jiffies
3678 * This waits for either a completion of a specific task to be
3679 * signaled or for a specified timeout to expire. It can be
3680 * interrupted by a kill signal. The timeout is in jiffies.
3682 * The return value is -ERESTARTSYS if interrupted, 0 if timed out,
3683 * positive (at least 1, or number of jiffies left till timeout) if completed.
3686 wait_for_completion_killable_timeout(struct completion *x,
3687 unsigned long timeout)
3689 return wait_for_common(x, timeout, TASK_KILLABLE);
3691 EXPORT_SYMBOL(wait_for_completion_killable_timeout);
3694 * try_wait_for_completion - try to decrement a completion without blocking
3695 * @x: completion structure
3697 * Returns: 0 if a decrement cannot be done without blocking
3698 * 1 if a decrement succeeded.
3700 * If a completion is being used as a counting completion,
3701 * attempt to decrement the counter without blocking. This
3702 * enables us to avoid waiting if the resource the completion
3703 * is protecting is not available.
3705 bool try_wait_for_completion(struct completion *x)
3707 unsigned long flags;
3710 spin_lock_irqsave(&x->wait.lock, flags);
3715 spin_unlock_irqrestore(&x->wait.lock, flags);
3718 EXPORT_SYMBOL(try_wait_for_completion);
3721 * completion_done - Test to see if a completion has any waiters
3722 * @x: completion structure
3724 * Returns: 0 if there are waiters (wait_for_completion() in progress)
3725 * 1 if there are no waiters.
3728 bool completion_done(struct completion *x)
3730 unsigned long flags;
3733 spin_lock_irqsave(&x->wait.lock, flags);
3736 spin_unlock_irqrestore(&x->wait.lock, flags);
3739 EXPORT_SYMBOL(completion_done);
3742 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
3744 unsigned long flags;
3747 init_waitqueue_entry(&wait, current);
3749 __set_current_state(state);
3751 spin_lock_irqsave(&q->lock, flags);
3752 __add_wait_queue(q, &wait);
3753 spin_unlock(&q->lock);
3754 timeout = schedule_timeout(timeout);
3755 spin_lock_irq(&q->lock);
3756 __remove_wait_queue(q, &wait);
3757 spin_unlock_irqrestore(&q->lock, flags);
3762 void __sched interruptible_sleep_on(wait_queue_head_t *q)
3764 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
3766 EXPORT_SYMBOL(interruptible_sleep_on);
3769 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
3771 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
3773 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
3775 void __sched sleep_on(wait_queue_head_t *q)
3777 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
3779 EXPORT_SYMBOL(sleep_on);
3781 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
3783 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
3785 EXPORT_SYMBOL(sleep_on_timeout);
3787 #ifdef CONFIG_RT_MUTEXES
3790 * rt_mutex_setprio - set the current priority of a task
3792 * @prio: prio value (kernel-internal form)
3794 * This function changes the 'effective' priority of a task. It does
3795 * not touch ->normal_prio like __setscheduler().
3797 * Used by the rt_mutex code to implement priority inheritance logic.
3799 void rt_mutex_setprio(struct task_struct *p, int prio)
3801 int oldprio, on_rq, running;
3803 const struct sched_class *prev_class;
3805 BUG_ON(prio < 0 || prio > MAX_PRIO);
3807 rq = __task_rq_lock(p);
3810 * Idle task boosting is a nono in general. There is one
3811 * exception, when PREEMPT_RT and NOHZ is active:
3813 * The idle task calls get_next_timer_interrupt() and holds
3814 * the timer wheel base->lock on the CPU and another CPU wants
3815 * to access the timer (probably to cancel it). We can safely
3816 * ignore the boosting request, as the idle CPU runs this code
3817 * with interrupts disabled and will complete the lock
3818 * protected section without being interrupted. So there is no
3819 * real need to boost.
3821 if (unlikely(p == rq->idle)) {
3822 WARN_ON(p != rq->curr);
3823 WARN_ON(p->pi_blocked_on);
3827 trace_sched_pi_setprio(p, prio);
3829 prev_class = p->sched_class;
3831 running = task_current(rq, p);
3833 dequeue_task(rq, p, 0);
3835 p->sched_class->put_prev_task(rq, p);
3838 p->sched_class = &rt_sched_class;
3840 p->sched_class = &fair_sched_class;
3845 p->sched_class->set_curr_task(rq);
3847 enqueue_task(rq, p, oldprio < prio ? ENQUEUE_HEAD : 0);
3849 check_class_changed(rq, p, prev_class, oldprio);
3851 __task_rq_unlock(rq);
3854 void set_user_nice(struct task_struct *p, long nice)
3856 int old_prio, delta, on_rq;
3857 unsigned long flags;
3860 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
3863 * We have to be careful, if called from sys_setpriority(),
3864 * the task might be in the middle of scheduling on another CPU.
3866 rq = task_rq_lock(p, &flags);
3868 * The RT priorities are set via sched_setscheduler(), but we still
3869 * allow the 'normal' nice value to be set - but as expected
3870 * it wont have any effect on scheduling until the task is
3871 * SCHED_FIFO/SCHED_RR:
3873 if (task_has_rt_policy(p)) {
3874 p->static_prio = NICE_TO_PRIO(nice);
3879 dequeue_task(rq, p, 0);
3881 p->static_prio = NICE_TO_PRIO(nice);
3884 p->prio = effective_prio(p);
3885 delta = p->prio - old_prio;
3888 enqueue_task(rq, p, 0);
3890 * If the task increased its priority or is running and
3891 * lowered its priority, then reschedule its CPU:
3893 if (delta < 0 || (delta > 0 && task_running(rq, p)))
3894 resched_task(rq->curr);
3897 task_rq_unlock(rq, p, &flags);
3899 EXPORT_SYMBOL(set_user_nice);
3902 * can_nice - check if a task can reduce its nice value
3906 int can_nice(const struct task_struct *p, const int nice)
3908 /* convert nice value [19,-20] to rlimit style value [1,40] */
3909 int nice_rlim = 20 - nice;
3911 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
3912 capable(CAP_SYS_NICE));
3915 #ifdef __ARCH_WANT_SYS_NICE
3918 * sys_nice - change the priority of the current process.
3919 * @increment: priority increment
3921 * sys_setpriority is a more generic, but much slower function that
3922 * does similar things.
3924 SYSCALL_DEFINE1(nice, int, increment)
3929 * Setpriority might change our priority at the same moment.
3930 * We don't have to worry. Conceptually one call occurs first
3931 * and we have a single winner.
3933 if (increment < -40)
3938 nice = TASK_NICE(current) + increment;
3944 if (increment < 0 && !can_nice(current, nice))
3947 retval = security_task_setnice(current, nice);
3951 set_user_nice(current, nice);
3958 * task_prio - return the priority value of a given task.
3959 * @p: the task in question.
3961 * This is the priority value as seen by users in /proc.
3962 * RT tasks are offset by -200. Normal tasks are centered
3963 * around 0, value goes from -16 to +15.
3965 int task_prio(const struct task_struct *p)
3967 return p->prio - MAX_RT_PRIO;
3971 * task_nice - return the nice value of a given task.
3972 * @p: the task in question.
3974 int task_nice(const struct task_struct *p)
3976 return TASK_NICE(p);
3978 EXPORT_SYMBOL(task_nice);
3981 * idle_cpu - is a given cpu idle currently?
3982 * @cpu: the processor in question.
3984 int idle_cpu(int cpu)
3986 struct rq *rq = cpu_rq(cpu);
3988 if (rq->curr != rq->idle)
3995 if (!llist_empty(&rq->wake_list))
4003 * idle_task - return the idle task for a given cpu.
4004 * @cpu: the processor in question.
4006 struct task_struct *idle_task(int cpu)
4008 return cpu_rq(cpu)->idle;
4012 * find_process_by_pid - find a process with a matching PID value.
4013 * @pid: the pid in question.
4015 static struct task_struct *find_process_by_pid(pid_t pid)
4017 return pid ? find_task_by_vpid(pid) : current;
4020 /* Actually do priority change: must hold rq lock. */
4022 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
4025 p->rt_priority = prio;
4026 p->normal_prio = normal_prio(p);
4027 /* we are holding p->pi_lock already */
4028 p->prio = rt_mutex_getprio(p);
4029 if (rt_prio(p->prio))
4030 p->sched_class = &rt_sched_class;
4032 p->sched_class = &fair_sched_class;
4037 * check the target process has a UID that matches the current process's
4039 static bool check_same_owner(struct task_struct *p)
4041 const struct cred *cred = current_cred(), *pcred;
4045 pcred = __task_cred(p);
4046 if (cred->user->user_ns == pcred->user->user_ns)
4047 match = (cred->euid == pcred->euid ||
4048 cred->euid == pcred->uid);
4055 static int __sched_setscheduler(struct task_struct *p, int policy,
4056 const struct sched_param *param, bool user)
4058 int retval, oldprio, oldpolicy = -1, on_rq, running;
4059 unsigned long flags;
4060 const struct sched_class *prev_class;
4064 /* may grab non-irq protected spin_locks */
4065 BUG_ON(in_interrupt());
4067 /* double check policy once rq lock held */
4069 reset_on_fork = p->sched_reset_on_fork;
4070 policy = oldpolicy = p->policy;
4072 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
4073 policy &= ~SCHED_RESET_ON_FORK;
4075 if (policy != SCHED_FIFO && policy != SCHED_RR &&
4076 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
4077 policy != SCHED_IDLE)
4082 * Valid priorities for SCHED_FIFO and SCHED_RR are
4083 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4084 * SCHED_BATCH and SCHED_IDLE is 0.
4086 if (param->sched_priority < 0 ||
4087 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
4088 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
4090 if (rt_policy(policy) != (param->sched_priority != 0))
4094 * Allow unprivileged RT tasks to decrease priority:
4096 if (user && !capable(CAP_SYS_NICE)) {
4097 if (rt_policy(policy)) {
4098 unsigned long rlim_rtprio =
4099 task_rlimit(p, RLIMIT_RTPRIO);
4101 /* can't set/change the rt policy */
4102 if (policy != p->policy && !rlim_rtprio)
4105 /* can't increase priority */
4106 if (param->sched_priority > p->rt_priority &&
4107 param->sched_priority > rlim_rtprio)
4112 * Treat SCHED_IDLE as nice 20. Only allow a switch to
4113 * SCHED_NORMAL if the RLIMIT_NICE would normally permit it.
4115 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE) {
4116 if (!can_nice(p, TASK_NICE(p)))
4120 /* can't change other user's priorities */
4121 if (!check_same_owner(p))
4124 /* Normal users shall not reset the sched_reset_on_fork flag */
4125 if (p->sched_reset_on_fork && !reset_on_fork)
4130 retval = security_task_setscheduler(p);
4136 * make sure no PI-waiters arrive (or leave) while we are
4137 * changing the priority of the task:
4139 * To be able to change p->policy safely, the appropriate
4140 * runqueue lock must be held.
4142 rq = task_rq_lock(p, &flags);
4145 * Changing the policy of the stop threads its a very bad idea
4147 if (p == rq->stop) {
4148 task_rq_unlock(rq, p, &flags);
4153 * If not changing anything there's no need to proceed further:
4155 if (unlikely(policy == p->policy && (!rt_policy(policy) ||
4156 param->sched_priority == p->rt_priority))) {
4158 __task_rq_unlock(rq);
4159 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4163 #ifdef CONFIG_RT_GROUP_SCHED
4166 * Do not allow realtime tasks into groups that have no runtime
4169 if (rt_bandwidth_enabled() && rt_policy(policy) &&
4170 task_group(p)->rt_bandwidth.rt_runtime == 0 &&
4171 !task_group_is_autogroup(task_group(p))) {
4172 task_rq_unlock(rq, p, &flags);
4178 /* recheck policy now with rq lock held */
4179 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
4180 policy = oldpolicy = -1;
4181 task_rq_unlock(rq, p, &flags);
4185 running = task_current(rq, p);
4187 dequeue_task(rq, p, 0);
4189 p->sched_class->put_prev_task(rq, p);
4191 p->sched_reset_on_fork = reset_on_fork;
4194 prev_class = p->sched_class;
4195 __setscheduler(rq, p, policy, param->sched_priority);
4198 p->sched_class->set_curr_task(rq);
4200 enqueue_task(rq, p, 0);
4202 check_class_changed(rq, p, prev_class, oldprio);
4203 task_rq_unlock(rq, p, &flags);
4205 rt_mutex_adjust_pi(p);
4211 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4212 * @p: the task in question.
4213 * @policy: new policy.
4214 * @param: structure containing the new RT priority.
4216 * NOTE that the task may be already dead.
4218 int sched_setscheduler(struct task_struct *p, int policy,
4219 const struct sched_param *param)
4221 return __sched_setscheduler(p, policy, param, true);
4223 EXPORT_SYMBOL_GPL(sched_setscheduler);
4226 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
4227 * @p: the task in question.
4228 * @policy: new policy.
4229 * @param: structure containing the new RT priority.
4231 * Just like sched_setscheduler, only don't bother checking if the
4232 * current context has permission. For example, this is needed in
4233 * stop_machine(): we create temporary high priority worker threads,
4234 * but our caller might not have that capability.
4236 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
4237 const struct sched_param *param)
4239 return __sched_setscheduler(p, policy, param, false);
4243 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
4245 struct sched_param lparam;
4246 struct task_struct *p;
4249 if (!param || pid < 0)
4251 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
4256 p = find_process_by_pid(pid);
4258 retval = sched_setscheduler(p, policy, &lparam);
4265 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4266 * @pid: the pid in question.
4267 * @policy: new policy.
4268 * @param: structure containing the new RT priority.
4270 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
4271 struct sched_param __user *, param)
4273 /* negative values for policy are not valid */
4277 return do_sched_setscheduler(pid, policy, param);
4281 * sys_sched_setparam - set/change the RT priority of a thread
4282 * @pid: the pid in question.
4283 * @param: structure containing the new RT priority.
4285 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
4287 return do_sched_setscheduler(pid, -1, param);
4291 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4292 * @pid: the pid in question.
4294 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
4296 struct task_struct *p;
4304 p = find_process_by_pid(pid);
4306 retval = security_task_getscheduler(p);
4309 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
4316 * sys_sched_getparam - get the RT priority of a thread
4317 * @pid: the pid in question.
4318 * @param: structure containing the RT priority.
4320 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
4322 struct sched_param lp;
4323 struct task_struct *p;
4326 if (!param || pid < 0)
4330 p = find_process_by_pid(pid);
4335 retval = security_task_getscheduler(p);
4339 lp.sched_priority = p->rt_priority;
4343 * This one might sleep, we cannot do it with a spinlock held ...
4345 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
4354 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4356 cpumask_var_t cpus_allowed, new_mask;
4357 struct task_struct *p;
4363 p = find_process_by_pid(pid);
4370 /* Prevent p going away */
4374 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4378 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4380 goto out_free_cpus_allowed;
4383 if (!check_same_owner(p) && !ns_capable(task_user_ns(p), CAP_SYS_NICE))
4386 retval = security_task_setscheduler(p);
4390 cpuset_cpus_allowed(p, cpus_allowed);
4391 cpumask_and(new_mask, in_mask, cpus_allowed);
4393 retval = set_cpus_allowed_ptr(p, new_mask);
4396 cpuset_cpus_allowed(p, cpus_allowed);
4397 if (!cpumask_subset(new_mask, cpus_allowed)) {
4399 * We must have raced with a concurrent cpuset
4400 * update. Just reset the cpus_allowed to the
4401 * cpuset's cpus_allowed
4403 cpumask_copy(new_mask, cpus_allowed);
4408 free_cpumask_var(new_mask);
4409 out_free_cpus_allowed:
4410 free_cpumask_var(cpus_allowed);
4417 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4418 struct cpumask *new_mask)
4420 if (len < cpumask_size())
4421 cpumask_clear(new_mask);
4422 else if (len > cpumask_size())
4423 len = cpumask_size();
4425 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4429 * sys_sched_setaffinity - set the cpu affinity of a process
4430 * @pid: pid of the process
4431 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4432 * @user_mask_ptr: user-space pointer to the new cpu mask
4434 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4435 unsigned long __user *, user_mask_ptr)
4437 cpumask_var_t new_mask;
4440 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4443 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4445 retval = sched_setaffinity(pid, new_mask);
4446 free_cpumask_var(new_mask);
4450 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4452 struct task_struct *p;
4453 unsigned long flags;
4460 p = find_process_by_pid(pid);
4464 retval = security_task_getscheduler(p);
4468 raw_spin_lock_irqsave(&p->pi_lock, flags);
4469 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
4470 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4480 * sys_sched_getaffinity - get the cpu affinity of a process
4481 * @pid: pid of the process
4482 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4483 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4485 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4486 unsigned long __user *, user_mask_ptr)
4491 if ((len * BITS_PER_BYTE) < nr_cpu_ids)
4493 if (len & (sizeof(unsigned long)-1))
4496 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4499 ret = sched_getaffinity(pid, mask);
4501 size_t retlen = min_t(size_t, len, cpumask_size());
4503 if (copy_to_user(user_mask_ptr, mask, retlen))
4508 free_cpumask_var(mask);
4514 * sys_sched_yield - yield the current processor to other threads.
4516 * This function yields the current CPU to other tasks. If there are no
4517 * other threads running on this CPU then this function will return.
4519 SYSCALL_DEFINE0(sched_yield)
4521 struct rq *rq = this_rq_lock();
4523 schedstat_inc(rq, yld_count);
4524 current->sched_class->yield_task(rq);
4527 * Since we are going to call schedule() anyway, there's
4528 * no need to preempt or enable interrupts:
4530 __release(rq->lock);
4531 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4532 do_raw_spin_unlock(&rq->lock);
4533 sched_preempt_enable_no_resched();
4540 static inline int should_resched(void)
4542 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
4545 static void __cond_resched(void)
4547 add_preempt_count(PREEMPT_ACTIVE);
4549 sub_preempt_count(PREEMPT_ACTIVE);
4552 int __sched _cond_resched(void)
4554 if (should_resched()) {
4560 EXPORT_SYMBOL(_cond_resched);
4563 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4564 * call schedule, and on return reacquire the lock.
4566 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4567 * operations here to prevent schedule() from being called twice (once via
4568 * spin_unlock(), once by hand).
4570 int __cond_resched_lock(spinlock_t *lock)
4572 int resched = should_resched();
4575 lockdep_assert_held(lock);
4577 if (spin_needbreak(lock) || resched) {
4588 EXPORT_SYMBOL(__cond_resched_lock);
4590 int __sched __cond_resched_softirq(void)
4592 BUG_ON(!in_softirq());
4594 if (should_resched()) {
4602 EXPORT_SYMBOL(__cond_resched_softirq);
4605 * yield - yield the current processor to other threads.
4607 * Do not ever use this function, there's a 99% chance you're doing it wrong.
4609 * The scheduler is at all times free to pick the calling task as the most
4610 * eligible task to run, if removing the yield() call from your code breaks
4611 * it, its already broken.
4613 * Typical broken usage is:
4618 * where one assumes that yield() will let 'the other' process run that will
4619 * make event true. If the current task is a SCHED_FIFO task that will never
4620 * happen. Never use yield() as a progress guarantee!!
4622 * If you want to use yield() to wait for something, use wait_event().
4623 * If you want to use yield() to be 'nice' for others, use cond_resched().
4624 * If you still want to use yield(), do not!
4626 void __sched yield(void)
4628 set_current_state(TASK_RUNNING);
4631 EXPORT_SYMBOL(yield);
4634 * yield_to - yield the current processor to another thread in
4635 * your thread group, or accelerate that thread toward the
4636 * processor it's on.
4638 * @preempt: whether task preemption is allowed or not
4640 * It's the caller's job to ensure that the target task struct
4641 * can't go away on us before we can do any checks.
4643 * Returns true if we indeed boosted the target task.
4645 bool __sched yield_to(struct task_struct *p, bool preempt)
4647 struct task_struct *curr = current;
4648 struct rq *rq, *p_rq;
4649 unsigned long flags;
4652 local_irq_save(flags);
4657 double_rq_lock(rq, p_rq);
4658 while (task_rq(p) != p_rq) {
4659 double_rq_unlock(rq, p_rq);
4663 if (!curr->sched_class->yield_to_task)
4666 if (curr->sched_class != p->sched_class)
4669 if (task_running(p_rq, p) || p->state)
4672 yielded = curr->sched_class->yield_to_task(rq, p, preempt);
4674 schedstat_inc(rq, yld_count);
4676 * Make p's CPU reschedule; pick_next_entity takes care of
4679 if (preempt && rq != p_rq)
4680 resched_task(p_rq->curr);
4683 * We might have set it in task_yield_fair(), but are
4684 * not going to schedule(), so don't want to skip
4687 rq->skip_clock_update = 0;
4691 double_rq_unlock(rq, p_rq);
4692 local_irq_restore(flags);
4699 EXPORT_SYMBOL_GPL(yield_to);
4702 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
4703 * that process accounting knows that this is a task in IO wait state.
4705 void __sched io_schedule(void)
4707 struct rq *rq = raw_rq();
4709 delayacct_blkio_start();
4710 atomic_inc(&rq->nr_iowait);
4711 blk_flush_plug(current);
4712 current->in_iowait = 1;
4714 current->in_iowait = 0;
4715 atomic_dec(&rq->nr_iowait);
4716 delayacct_blkio_end();
4718 EXPORT_SYMBOL(io_schedule);
4720 long __sched io_schedule_timeout(long timeout)
4722 struct rq *rq = raw_rq();
4725 delayacct_blkio_start();
4726 atomic_inc(&rq->nr_iowait);
4727 blk_flush_plug(current);
4728 current->in_iowait = 1;
4729 ret = schedule_timeout(timeout);
4730 current->in_iowait = 0;
4731 atomic_dec(&rq->nr_iowait);
4732 delayacct_blkio_end();
4737 * sys_sched_get_priority_max - return maximum RT priority.
4738 * @policy: scheduling class.
4740 * this syscall returns the maximum rt_priority that can be used
4741 * by a given scheduling class.
4743 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
4750 ret = MAX_USER_RT_PRIO-1;
4762 * sys_sched_get_priority_min - return minimum RT priority.
4763 * @policy: scheduling class.
4765 * this syscall returns the minimum rt_priority that can be used
4766 * by a given scheduling class.
4768 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
4786 * sys_sched_rr_get_interval - return the default timeslice of a process.
4787 * @pid: pid of the process.
4788 * @interval: userspace pointer to the timeslice value.
4790 * this syscall writes the default timeslice value of a given process
4791 * into the user-space timespec buffer. A value of '0' means infinity.
4793 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
4794 struct timespec __user *, interval)
4796 struct task_struct *p;
4797 unsigned int time_slice;
4798 unsigned long flags;
4808 p = find_process_by_pid(pid);
4812 retval = security_task_getscheduler(p);
4816 rq = task_rq_lock(p, &flags);
4817 time_slice = p->sched_class->get_rr_interval(rq, p);
4818 task_rq_unlock(rq, p, &flags);
4821 jiffies_to_timespec(time_slice, &t);
4822 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
4830 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
4832 void sched_show_task(struct task_struct *p)
4834 unsigned long free = 0;
4837 state = p->state ? __ffs(p->state) + 1 : 0;
4838 printk(KERN_INFO "%-15.15s %c", p->comm,
4839 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
4840 #if BITS_PER_LONG == 32
4841 if (state == TASK_RUNNING)
4842 printk(KERN_CONT " running ");
4844 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
4846 if (state == TASK_RUNNING)
4847 printk(KERN_CONT " running task ");
4849 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
4851 #ifdef CONFIG_DEBUG_STACK_USAGE
4852 free = stack_not_used(p);
4854 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
4855 task_pid_nr(p), task_pid_nr(rcu_dereference(p->real_parent)),
4856 (unsigned long)task_thread_info(p)->flags);
4858 show_stack(p, NULL);
4861 void show_state_filter(unsigned long state_filter)
4863 struct task_struct *g, *p;
4865 #if BITS_PER_LONG == 32
4867 " task PC stack pid father\n");
4870 " task PC stack pid father\n");
4873 do_each_thread(g, p) {
4875 * reset the NMI-timeout, listing all files on a slow
4876 * console might take a lot of time:
4878 touch_nmi_watchdog();
4879 if (!state_filter || (p->state & state_filter))
4881 } while_each_thread(g, p);
4883 touch_all_softlockup_watchdogs();
4885 #ifdef CONFIG_SCHED_DEBUG
4886 sysrq_sched_debug_show();
4890 * Only show locks if all tasks are dumped:
4893 debug_show_all_locks();
4896 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
4898 idle->sched_class = &idle_sched_class;
4902 * init_idle - set up an idle thread for a given CPU
4903 * @idle: task in question
4904 * @cpu: cpu the idle task belongs to
4906 * NOTE: this function does not set the idle thread's NEED_RESCHED
4907 * flag, to make booting more robust.
4909 void __cpuinit init_idle(struct task_struct *idle, int cpu)
4911 struct rq *rq = cpu_rq(cpu);
4912 unsigned long flags;
4914 raw_spin_lock_irqsave(&rq->lock, flags);
4917 idle->state = TASK_RUNNING;
4918 idle->se.exec_start = sched_clock();
4920 do_set_cpus_allowed(idle, cpumask_of(cpu));
4922 * We're having a chicken and egg problem, even though we are
4923 * holding rq->lock, the cpu isn't yet set to this cpu so the
4924 * lockdep check in task_group() will fail.
4926 * Similar case to sched_fork(). / Alternatively we could
4927 * use task_rq_lock() here and obtain the other rq->lock.
4932 __set_task_cpu(idle, cpu);
4935 rq->curr = rq->idle = idle;
4936 #if defined(CONFIG_SMP)
4939 raw_spin_unlock_irqrestore(&rq->lock, flags);
4941 /* Set the preempt count _outside_ the spinlocks! */
4942 task_thread_info(idle)->preempt_count = 0;
4945 * The idle tasks have their own, simple scheduling class:
4947 idle->sched_class = &idle_sched_class;
4948 ftrace_graph_init_idle_task(idle, cpu);
4949 #if defined(CONFIG_SMP)
4950 sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu);
4955 void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask)
4957 if (p->sched_class && p->sched_class->set_cpus_allowed)
4958 p->sched_class->set_cpus_allowed(p, new_mask);
4960 cpumask_copy(&p->cpus_allowed, new_mask);
4961 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
4965 * This is how migration works:
4967 * 1) we invoke migration_cpu_stop() on the target CPU using
4969 * 2) stopper starts to run (implicitly forcing the migrated thread
4971 * 3) it checks whether the migrated task is still in the wrong runqueue.
4972 * 4) if it's in the wrong runqueue then the migration thread removes
4973 * it and puts it into the right queue.
4974 * 5) stopper completes and stop_one_cpu() returns and the migration
4979 * Change a given task's CPU affinity. Migrate the thread to a
4980 * proper CPU and schedule it away if the CPU it's executing on
4981 * is removed from the allowed bitmask.
4983 * NOTE: the caller must have a valid reference to the task, the
4984 * task must not exit() & deallocate itself prematurely. The
4985 * call is not atomic; no spinlocks may be held.
4987 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
4989 unsigned long flags;
4991 unsigned int dest_cpu;
4994 rq = task_rq_lock(p, &flags);
4996 if (cpumask_equal(&p->cpus_allowed, new_mask))
4999 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
5004 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current)) {
5009 do_set_cpus_allowed(p, new_mask);
5011 /* Can the task run on the task's current CPU? If so, we're done */
5012 if (cpumask_test_cpu(task_cpu(p), new_mask))
5015 dest_cpu = cpumask_any_and(cpu_active_mask, new_mask);
5017 struct migration_arg arg = { p, dest_cpu };
5018 /* Need help from migration thread: drop lock and wait. */
5019 task_rq_unlock(rq, p, &flags);
5020 stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg);
5021 tlb_migrate_finish(p->mm);
5025 task_rq_unlock(rq, p, &flags);
5029 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
5032 * Move (not current) task off this cpu, onto dest cpu. We're doing
5033 * this because either it can't run here any more (set_cpus_allowed()
5034 * away from this CPU, or CPU going down), or because we're
5035 * attempting to rebalance this task on exec (sched_exec).
5037 * So we race with normal scheduler movements, but that's OK, as long
5038 * as the task is no longer on this CPU.
5040 * Returns non-zero if task was successfully migrated.
5042 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
5044 struct rq *rq_dest, *rq_src;
5047 if (unlikely(!cpu_active(dest_cpu)))
5050 rq_src = cpu_rq(src_cpu);
5051 rq_dest = cpu_rq(dest_cpu);
5053 raw_spin_lock(&p->pi_lock);
5054 double_rq_lock(rq_src, rq_dest);
5055 /* Already moved. */
5056 if (task_cpu(p) != src_cpu)
5058 /* Affinity changed (again). */
5059 if (!cpumask_test_cpu(dest_cpu, tsk_cpus_allowed(p)))
5063 * If we're not on a rq, the next wake-up will ensure we're
5067 dequeue_task(rq_src, p, 0);
5068 set_task_cpu(p, dest_cpu);
5069 enqueue_task(rq_dest, p, 0);
5070 check_preempt_curr(rq_dest, p, 0);
5075 double_rq_unlock(rq_src, rq_dest);
5076 raw_spin_unlock(&p->pi_lock);
5081 * migration_cpu_stop - this will be executed by a highprio stopper thread
5082 * and performs thread migration by bumping thread off CPU then
5083 * 'pushing' onto another runqueue.
5085 static int migration_cpu_stop(void *data)
5087 struct migration_arg *arg = data;
5090 * The original target cpu might have gone down and we might
5091 * be on another cpu but it doesn't matter.
5093 local_irq_disable();
5094 __migrate_task(arg->task, raw_smp_processor_id(), arg->dest_cpu);
5099 #ifdef CONFIG_HOTPLUG_CPU
5102 * Ensures that the idle task is using init_mm right before its cpu goes
5105 void idle_task_exit(void)
5107 struct mm_struct *mm = current->active_mm;
5109 BUG_ON(cpu_online(smp_processor_id()));
5112 switch_mm(mm, &init_mm, current);
5117 * While a dead CPU has no uninterruptible tasks queued at this point,
5118 * it might still have a nonzero ->nr_uninterruptible counter, because
5119 * for performance reasons the counter is not stricly tracking tasks to
5120 * their home CPUs. So we just add the counter to another CPU's counter,
5121 * to keep the global sum constant after CPU-down:
5123 static void migrate_nr_uninterruptible(struct rq *rq_src)
5125 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
5127 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
5128 rq_src->nr_uninterruptible = 0;
5132 * remove the tasks which were accounted by rq from calc_load_tasks.
5134 static void calc_global_load_remove(struct rq *rq)
5136 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
5137 rq->calc_load_active = 0;
5141 * Migrate all tasks from the rq, sleeping tasks will be migrated by
5142 * try_to_wake_up()->select_task_rq().
5144 * Called with rq->lock held even though we'er in stop_machine() and
5145 * there's no concurrency possible, we hold the required locks anyway
5146 * because of lock validation efforts.
5148 static void migrate_tasks(unsigned int dead_cpu)
5150 struct rq *rq = cpu_rq(dead_cpu);
5151 struct task_struct *next, *stop = rq->stop;
5155 * Fudge the rq selection such that the below task selection loop
5156 * doesn't get stuck on the currently eligible stop task.
5158 * We're currently inside stop_machine() and the rq is either stuck
5159 * in the stop_machine_cpu_stop() loop, or we're executing this code,
5160 * either way we should never end up calling schedule() until we're
5165 /* Ensure any throttled groups are reachable by pick_next_task */
5166 unthrottle_offline_cfs_rqs(rq);
5170 * There's this thread running, bail when that's the only
5173 if (rq->nr_running == 1)
5176 next = pick_next_task(rq);
5178 next->sched_class->put_prev_task(rq, next);
5180 /* Find suitable destination for @next, with force if needed. */
5181 dest_cpu = select_fallback_rq(dead_cpu, next);
5182 raw_spin_unlock(&rq->lock);
5184 __migrate_task(next, dead_cpu, dest_cpu);
5186 raw_spin_lock(&rq->lock);
5192 #endif /* CONFIG_HOTPLUG_CPU */
5194 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
5196 static struct ctl_table sd_ctl_dir[] = {
5198 .procname = "sched_domain",
5204 static struct ctl_table sd_ctl_root[] = {
5206 .procname = "kernel",
5208 .child = sd_ctl_dir,
5213 static struct ctl_table *sd_alloc_ctl_entry(int n)
5215 struct ctl_table *entry =
5216 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
5221 static void sd_free_ctl_entry(struct ctl_table **tablep)
5223 struct ctl_table *entry;
5226 * In the intermediate directories, both the child directory and
5227 * procname are dynamically allocated and could fail but the mode
5228 * will always be set. In the lowest directory the names are
5229 * static strings and all have proc handlers.
5231 for (entry = *tablep; entry->mode; entry++) {
5233 sd_free_ctl_entry(&entry->child);
5234 if (entry->proc_handler == NULL)
5235 kfree(entry->procname);
5243 set_table_entry(struct ctl_table *entry,
5244 const char *procname, void *data, int maxlen,
5245 umode_t mode, proc_handler *proc_handler)
5247 entry->procname = procname;
5249 entry->maxlen = maxlen;
5251 entry->proc_handler = proc_handler;
5254 static struct ctl_table *
5255 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5257 struct ctl_table *table = sd_alloc_ctl_entry(13);
5262 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5263 sizeof(long), 0644, proc_doulongvec_minmax);
5264 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5265 sizeof(long), 0644, proc_doulongvec_minmax);
5266 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5267 sizeof(int), 0644, proc_dointvec_minmax);
5268 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5269 sizeof(int), 0644, proc_dointvec_minmax);
5270 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5271 sizeof(int), 0644, proc_dointvec_minmax);
5272 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5273 sizeof(int), 0644, proc_dointvec_minmax);
5274 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5275 sizeof(int), 0644, proc_dointvec_minmax);
5276 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5277 sizeof(int), 0644, proc_dointvec_minmax);
5278 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5279 sizeof(int), 0644, proc_dointvec_minmax);
5280 set_table_entry(&table[9], "cache_nice_tries",
5281 &sd->cache_nice_tries,
5282 sizeof(int), 0644, proc_dointvec_minmax);
5283 set_table_entry(&table[10], "flags", &sd->flags,
5284 sizeof(int), 0644, proc_dointvec_minmax);
5285 set_table_entry(&table[11], "name", sd->name,
5286 CORENAME_MAX_SIZE, 0444, proc_dostring);
5287 /* &table[12] is terminator */
5292 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5294 struct ctl_table *entry, *table;
5295 struct sched_domain *sd;
5296 int domain_num = 0, i;
5299 for_each_domain(cpu, sd)
5301 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5306 for_each_domain(cpu, sd) {
5307 snprintf(buf, 32, "domain%d", i);
5308 entry->procname = kstrdup(buf, GFP_KERNEL);
5310 entry->child = sd_alloc_ctl_domain_table(sd);
5317 static struct ctl_table_header *sd_sysctl_header;
5318 static void register_sched_domain_sysctl(void)
5320 int i, cpu_num = num_possible_cpus();
5321 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5324 WARN_ON(sd_ctl_dir[0].child);
5325 sd_ctl_dir[0].child = entry;
5330 for_each_possible_cpu(i) {
5331 snprintf(buf, 32, "cpu%d", i);
5332 entry->procname = kstrdup(buf, GFP_KERNEL);
5334 entry->child = sd_alloc_ctl_cpu_table(i);
5338 WARN_ON(sd_sysctl_header);
5339 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5342 /* may be called multiple times per register */
5343 static void unregister_sched_domain_sysctl(void)
5345 if (sd_sysctl_header)
5346 unregister_sysctl_table(sd_sysctl_header);
5347 sd_sysctl_header = NULL;
5348 if (sd_ctl_dir[0].child)
5349 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5352 static void register_sched_domain_sysctl(void)
5355 static void unregister_sched_domain_sysctl(void)
5360 static void set_rq_online(struct rq *rq)
5363 const struct sched_class *class;
5365 cpumask_set_cpu(rq->cpu, rq->rd->online);
5368 for_each_class(class) {
5369 if (class->rq_online)
5370 class->rq_online(rq);
5375 static void set_rq_offline(struct rq *rq)
5378 const struct sched_class *class;
5380 for_each_class(class) {
5381 if (class->rq_offline)
5382 class->rq_offline(rq);
5385 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5391 * migration_call - callback that gets triggered when a CPU is added.
5392 * Here we can start up the necessary migration thread for the new CPU.
5394 static int __cpuinit
5395 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5397 int cpu = (long)hcpu;
5398 unsigned long flags;
5399 struct rq *rq = cpu_rq(cpu);
5401 switch (action & ~CPU_TASKS_FROZEN) {
5403 case CPU_UP_PREPARE:
5404 rq->calc_load_update = calc_load_update;
5408 /* Update our root-domain */
5409 raw_spin_lock_irqsave(&rq->lock, flags);
5411 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5415 raw_spin_unlock_irqrestore(&rq->lock, flags);
5418 #ifdef CONFIG_HOTPLUG_CPU
5420 sched_ttwu_pending();
5421 /* Update our root-domain */
5422 raw_spin_lock_irqsave(&rq->lock, flags);
5424 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5428 BUG_ON(rq->nr_running != 1); /* the migration thread */
5429 raw_spin_unlock_irqrestore(&rq->lock, flags);
5431 migrate_nr_uninterruptible(rq);
5432 calc_global_load_remove(rq);
5437 update_max_interval();
5443 * Register at high priority so that task migration (migrate_all_tasks)
5444 * happens before everything else. This has to be lower priority than
5445 * the notifier in the perf_event subsystem, though.
5447 static struct notifier_block __cpuinitdata migration_notifier = {
5448 .notifier_call = migration_call,
5449 .priority = CPU_PRI_MIGRATION,
5452 static int __cpuinit sched_cpu_active(struct notifier_block *nfb,
5453 unsigned long action, void *hcpu)
5455 switch (action & ~CPU_TASKS_FROZEN) {
5457 case CPU_DOWN_FAILED:
5458 set_cpu_active((long)hcpu, true);
5465 static int __cpuinit sched_cpu_inactive(struct notifier_block *nfb,
5466 unsigned long action, void *hcpu)
5468 switch (action & ~CPU_TASKS_FROZEN) {
5469 case CPU_DOWN_PREPARE:
5470 set_cpu_active((long)hcpu, false);
5477 static int __init migration_init(void)
5479 void *cpu = (void *)(long)smp_processor_id();
5482 /* Initialize migration for the boot CPU */
5483 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
5484 BUG_ON(err == NOTIFY_BAD);
5485 migration_call(&migration_notifier, CPU_ONLINE, cpu);
5486 register_cpu_notifier(&migration_notifier);
5488 /* Register cpu active notifiers */
5489 cpu_notifier(sched_cpu_active, CPU_PRI_SCHED_ACTIVE);
5490 cpu_notifier(sched_cpu_inactive, CPU_PRI_SCHED_INACTIVE);
5494 early_initcall(migration_init);
5499 static cpumask_var_t sched_domains_tmpmask; /* sched_domains_mutex */
5501 #ifdef CONFIG_SCHED_DEBUG
5503 static __read_mostly int sched_domain_debug_enabled;
5505 static int __init sched_domain_debug_setup(char *str)
5507 sched_domain_debug_enabled = 1;
5511 early_param("sched_debug", sched_domain_debug_setup);
5513 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5514 struct cpumask *groupmask)
5516 struct sched_group *group = sd->groups;
5519 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
5520 cpumask_clear(groupmask);
5522 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5524 if (!(sd->flags & SD_LOAD_BALANCE)) {
5525 printk("does not load-balance\n");
5527 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5532 printk(KERN_CONT "span %s level %s\n", str, sd->name);
5534 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5535 printk(KERN_ERR "ERROR: domain->span does not contain "
5538 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5539 printk(KERN_ERR "ERROR: domain->groups does not contain"
5543 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5547 printk(KERN_ERR "ERROR: group is NULL\n");
5551 if (!group->sgp->power) {
5552 printk(KERN_CONT "\n");
5553 printk(KERN_ERR "ERROR: domain->cpu_power not "
5558 if (!cpumask_weight(sched_group_cpus(group))) {
5559 printk(KERN_CONT "\n");
5560 printk(KERN_ERR "ERROR: empty group\n");
5564 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
5565 printk(KERN_CONT "\n");
5566 printk(KERN_ERR "ERROR: repeated CPUs\n");
5570 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
5572 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
5574 printk(KERN_CONT " %s", str);
5575 if (group->sgp->power != SCHED_POWER_SCALE) {
5576 printk(KERN_CONT " (cpu_power = %d)",
5580 group = group->next;
5581 } while (group != sd->groups);
5582 printk(KERN_CONT "\n");
5584 if (!cpumask_equal(sched_domain_span(sd), groupmask))
5585 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
5588 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
5589 printk(KERN_ERR "ERROR: parent span is not a superset "
5590 "of domain->span\n");
5594 static void sched_domain_debug(struct sched_domain *sd, int cpu)
5598 if (!sched_domain_debug_enabled)
5602 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
5606 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
5609 if (sched_domain_debug_one(sd, cpu, level, sched_domains_tmpmask))
5617 #else /* !CONFIG_SCHED_DEBUG */
5618 # define sched_domain_debug(sd, cpu) do { } while (0)
5619 #endif /* CONFIG_SCHED_DEBUG */
5621 static int sd_degenerate(struct sched_domain *sd)
5623 if (cpumask_weight(sched_domain_span(sd)) == 1)
5626 /* Following flags need at least 2 groups */
5627 if (sd->flags & (SD_LOAD_BALANCE |
5628 SD_BALANCE_NEWIDLE |
5632 SD_SHARE_PKG_RESOURCES)) {
5633 if (sd->groups != sd->groups->next)
5637 /* Following flags don't use groups */
5638 if (sd->flags & (SD_WAKE_AFFINE))
5645 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
5647 unsigned long cflags = sd->flags, pflags = parent->flags;
5649 if (sd_degenerate(parent))
5652 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
5655 /* Flags needing groups don't count if only 1 group in parent */
5656 if (parent->groups == parent->groups->next) {
5657 pflags &= ~(SD_LOAD_BALANCE |
5658 SD_BALANCE_NEWIDLE |
5662 SD_SHARE_PKG_RESOURCES);
5663 if (nr_node_ids == 1)
5664 pflags &= ~SD_SERIALIZE;
5666 if (~cflags & pflags)
5672 static void free_rootdomain(struct rcu_head *rcu)
5674 struct root_domain *rd = container_of(rcu, struct root_domain, rcu);
5676 cpupri_cleanup(&rd->cpupri);
5677 free_cpumask_var(rd->rto_mask);
5678 free_cpumask_var(rd->online);
5679 free_cpumask_var(rd->span);
5683 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
5685 struct root_domain *old_rd = NULL;
5686 unsigned long flags;
5688 raw_spin_lock_irqsave(&rq->lock, flags);
5693 if (cpumask_test_cpu(rq->cpu, old_rd->online))
5696 cpumask_clear_cpu(rq->cpu, old_rd->span);
5699 * If we dont want to free the old_rt yet then
5700 * set old_rd to NULL to skip the freeing later
5703 if (!atomic_dec_and_test(&old_rd->refcount))
5707 atomic_inc(&rd->refcount);
5710 cpumask_set_cpu(rq->cpu, rd->span);
5711 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
5714 raw_spin_unlock_irqrestore(&rq->lock, flags);
5717 call_rcu_sched(&old_rd->rcu, free_rootdomain);
5720 static int init_rootdomain(struct root_domain *rd)
5722 memset(rd, 0, sizeof(*rd));
5724 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
5726 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
5728 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
5731 if (cpupri_init(&rd->cpupri) != 0)
5736 free_cpumask_var(rd->rto_mask);
5738 free_cpumask_var(rd->online);
5740 free_cpumask_var(rd->span);
5746 * By default the system creates a single root-domain with all cpus as
5747 * members (mimicking the global state we have today).
5749 struct root_domain def_root_domain;
5751 static void init_defrootdomain(void)
5753 init_rootdomain(&def_root_domain);
5755 atomic_set(&def_root_domain.refcount, 1);
5758 static struct root_domain *alloc_rootdomain(void)
5760 struct root_domain *rd;
5762 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
5766 if (init_rootdomain(rd) != 0) {
5774 static void free_sched_groups(struct sched_group *sg, int free_sgp)
5776 struct sched_group *tmp, *first;
5785 if (free_sgp && atomic_dec_and_test(&sg->sgp->ref))
5790 } while (sg != first);
5793 static void free_sched_domain(struct rcu_head *rcu)
5795 struct sched_domain *sd = container_of(rcu, struct sched_domain, rcu);
5798 * If its an overlapping domain it has private groups, iterate and
5801 if (sd->flags & SD_OVERLAP) {
5802 free_sched_groups(sd->groups, 1);
5803 } else if (atomic_dec_and_test(&sd->groups->ref)) {
5804 kfree(sd->groups->sgp);
5810 static void destroy_sched_domain(struct sched_domain *sd, int cpu)
5812 call_rcu(&sd->rcu, free_sched_domain);
5815 static void destroy_sched_domains(struct sched_domain *sd, int cpu)
5817 for (; sd; sd = sd->parent)
5818 destroy_sched_domain(sd, cpu);
5822 * Keep a special pointer to the highest sched_domain that has
5823 * SD_SHARE_PKG_RESOURCE set (Last Level Cache Domain) for this
5824 * allows us to avoid some pointer chasing select_idle_sibling().
5826 * Also keep a unique ID per domain (we use the first cpu number in
5827 * the cpumask of the domain), this allows us to quickly tell if
5828 * two cpus are in the same cache domain, see cpus_share_cache().
5830 DEFINE_PER_CPU(struct sched_domain *, sd_llc);
5831 DEFINE_PER_CPU(int, sd_llc_id);
5833 static void update_top_cache_domain(int cpu)
5835 struct sched_domain *sd;
5838 sd = highest_flag_domain(cpu, SD_SHARE_PKG_RESOURCES);
5840 id = cpumask_first(sched_domain_span(sd));
5842 rcu_assign_pointer(per_cpu(sd_llc, cpu), sd);
5843 per_cpu(sd_llc_id, cpu) = id;
5847 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
5848 * hold the hotplug lock.
5851 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
5853 struct rq *rq = cpu_rq(cpu);
5854 struct sched_domain *tmp;
5856 /* Remove the sched domains which do not contribute to scheduling. */
5857 for (tmp = sd; tmp; ) {
5858 struct sched_domain *parent = tmp->parent;
5862 if (sd_parent_degenerate(tmp, parent)) {
5863 tmp->parent = parent->parent;
5865 parent->parent->child = tmp;
5866 destroy_sched_domain(parent, cpu);
5871 if (sd && sd_degenerate(sd)) {
5874 destroy_sched_domain(tmp, cpu);
5879 sched_domain_debug(sd, cpu);
5881 rq_attach_root(rq, rd);
5883 rcu_assign_pointer(rq->sd, sd);
5884 destroy_sched_domains(tmp, cpu);
5886 update_top_cache_domain(cpu);
5889 /* cpus with isolated domains */
5890 static cpumask_var_t cpu_isolated_map;
5892 /* Setup the mask of cpus configured for isolated domains */
5893 static int __init isolated_cpu_setup(char *str)
5895 alloc_bootmem_cpumask_var(&cpu_isolated_map);
5896 cpulist_parse(str, cpu_isolated_map);
5900 __setup("isolcpus=", isolated_cpu_setup);
5905 * find_next_best_node - find the next node to include in a sched_domain
5906 * @node: node whose sched_domain we're building
5907 * @used_nodes: nodes already in the sched_domain
5909 * Find the next node to include in a given scheduling domain. Simply
5910 * finds the closest node not already in the @used_nodes map.
5912 * Should use nodemask_t.
5914 static int find_next_best_node(int node, nodemask_t *used_nodes)
5916 int i, n, val, min_val, best_node = -1;
5920 for (i = 0; i < nr_node_ids; i++) {
5921 /* Start at @node */
5922 n = (node + i) % nr_node_ids;
5924 if (!nr_cpus_node(n))
5927 /* Skip already used nodes */
5928 if (node_isset(n, *used_nodes))
5931 /* Simple min distance search */
5932 val = node_distance(node, n);
5934 if (val < min_val) {
5940 if (best_node != -1)
5941 node_set(best_node, *used_nodes);
5946 * sched_domain_node_span - get a cpumask for a node's sched_domain
5947 * @node: node whose cpumask we're constructing
5948 * @span: resulting cpumask
5950 * Given a node, construct a good cpumask for its sched_domain to span. It
5951 * should be one that prevents unnecessary balancing, but also spreads tasks
5954 static void sched_domain_node_span(int node, struct cpumask *span)
5956 nodemask_t used_nodes;
5959 cpumask_clear(span);
5960 nodes_clear(used_nodes);
5962 cpumask_or(span, span, cpumask_of_node(node));
5963 node_set(node, used_nodes);
5965 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
5966 int next_node = find_next_best_node(node, &used_nodes);
5969 cpumask_or(span, span, cpumask_of_node(next_node));
5973 static const struct cpumask *cpu_node_mask(int cpu)
5975 lockdep_assert_held(&sched_domains_mutex);
5977 sched_domain_node_span(cpu_to_node(cpu), sched_domains_tmpmask);
5979 return sched_domains_tmpmask;
5982 static const struct cpumask *cpu_allnodes_mask(int cpu)
5984 return cpu_possible_mask;
5986 #endif /* CONFIG_NUMA */
5988 static const struct cpumask *cpu_cpu_mask(int cpu)
5990 return cpumask_of_node(cpu_to_node(cpu));
5993 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
5996 struct sched_domain **__percpu sd;
5997 struct sched_group **__percpu sg;
5998 struct sched_group_power **__percpu sgp;
6002 struct sched_domain ** __percpu sd;
6003 struct root_domain *rd;
6013 struct sched_domain_topology_level;
6015 typedef struct sched_domain *(*sched_domain_init_f)(struct sched_domain_topology_level *tl, int cpu);
6016 typedef const struct cpumask *(*sched_domain_mask_f)(int cpu);
6018 #define SDTL_OVERLAP 0x01
6020 struct sched_domain_topology_level {
6021 sched_domain_init_f init;
6022 sched_domain_mask_f mask;
6024 struct sd_data data;
6028 build_overlap_sched_groups(struct sched_domain *sd, int cpu)
6030 struct sched_group *first = NULL, *last = NULL, *groups = NULL, *sg;
6031 const struct cpumask *span = sched_domain_span(sd);
6032 struct cpumask *covered = sched_domains_tmpmask;
6033 struct sd_data *sdd = sd->private;
6034 struct sched_domain *child;
6037 cpumask_clear(covered);
6039 for_each_cpu(i, span) {
6040 struct cpumask *sg_span;
6042 if (cpumask_test_cpu(i, covered))
6045 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6046 GFP_KERNEL, cpu_to_node(cpu));
6051 sg_span = sched_group_cpus(sg);
6053 child = *per_cpu_ptr(sdd->sd, i);
6055 child = child->child;
6056 cpumask_copy(sg_span, sched_domain_span(child));
6058 cpumask_set_cpu(i, sg_span);
6060 cpumask_or(covered, covered, sg_span);
6062 sg->sgp = *per_cpu_ptr(sdd->sgp, cpumask_first(sg_span));
6063 atomic_inc(&sg->sgp->ref);
6065 if (cpumask_test_cpu(cpu, sg_span))
6075 sd->groups = groups;
6080 free_sched_groups(first, 0);
6085 static int get_group(int cpu, struct sd_data *sdd, struct sched_group **sg)
6087 struct sched_domain *sd = *per_cpu_ptr(sdd->sd, cpu);
6088 struct sched_domain *child = sd->child;
6091 cpu = cpumask_first(sched_domain_span(child));
6094 *sg = *per_cpu_ptr(sdd->sg, cpu);
6095 (*sg)->sgp = *per_cpu_ptr(sdd->sgp, cpu);
6096 atomic_set(&(*sg)->sgp->ref, 1); /* for claim_allocations */
6103 * build_sched_groups will build a circular linked list of the groups
6104 * covered by the given span, and will set each group's ->cpumask correctly,
6105 * and ->cpu_power to 0.
6107 * Assumes the sched_domain tree is fully constructed
6110 build_sched_groups(struct sched_domain *sd, int cpu)
6112 struct sched_group *first = NULL, *last = NULL;
6113 struct sd_data *sdd = sd->private;
6114 const struct cpumask *span = sched_domain_span(sd);
6115 struct cpumask *covered;
6118 get_group(cpu, sdd, &sd->groups);
6119 atomic_inc(&sd->groups->ref);
6121 if (cpu != cpumask_first(sched_domain_span(sd)))
6124 lockdep_assert_held(&sched_domains_mutex);
6125 covered = sched_domains_tmpmask;
6127 cpumask_clear(covered);
6129 for_each_cpu(i, span) {
6130 struct sched_group *sg;
6131 int group = get_group(i, sdd, &sg);
6134 if (cpumask_test_cpu(i, covered))
6137 cpumask_clear(sched_group_cpus(sg));
6140 for_each_cpu(j, span) {
6141 if (get_group(j, sdd, NULL) != group)
6144 cpumask_set_cpu(j, covered);
6145 cpumask_set_cpu(j, sched_group_cpus(sg));
6160 * Initialize sched groups cpu_power.
6162 * cpu_power indicates the capacity of sched group, which is used while
6163 * distributing the load between different sched groups in a sched domain.
6164 * Typically cpu_power for all the groups in a sched domain will be same unless
6165 * there are asymmetries in the topology. If there are asymmetries, group
6166 * having more cpu_power will pickup more load compared to the group having
6169 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
6171 struct sched_group *sg = sd->groups;
6173 WARN_ON(!sd || !sg);
6176 sg->group_weight = cpumask_weight(sched_group_cpus(sg));
6178 } while (sg != sd->groups);
6180 if (cpu != group_first_cpu(sg))
6183 update_group_power(sd, cpu);
6184 atomic_set(&sg->sgp->nr_busy_cpus, sg->group_weight);
6187 int __weak arch_sd_sibling_asym_packing(void)
6189 return 0*SD_ASYM_PACKING;
6193 * Initializers for schedule domains
6194 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6197 #ifdef CONFIG_SCHED_DEBUG
6198 # define SD_INIT_NAME(sd, type) sd->name = #type
6200 # define SD_INIT_NAME(sd, type) do { } while (0)
6203 #define SD_INIT_FUNC(type) \
6204 static noinline struct sched_domain * \
6205 sd_init_##type(struct sched_domain_topology_level *tl, int cpu) \
6207 struct sched_domain *sd = *per_cpu_ptr(tl->data.sd, cpu); \
6208 *sd = SD_##type##_INIT; \
6209 SD_INIT_NAME(sd, type); \
6210 sd->private = &tl->data; \
6216 SD_INIT_FUNC(ALLNODES)
6219 #ifdef CONFIG_SCHED_SMT
6220 SD_INIT_FUNC(SIBLING)
6222 #ifdef CONFIG_SCHED_MC
6225 #ifdef CONFIG_SCHED_BOOK
6229 static int default_relax_domain_level = -1;
6230 int sched_domain_level_max;
6232 static int __init setup_relax_domain_level(char *str)
6236 val = simple_strtoul(str, NULL, 0);
6237 if (val < sched_domain_level_max)
6238 default_relax_domain_level = val;
6242 __setup("relax_domain_level=", setup_relax_domain_level);
6244 static void set_domain_attribute(struct sched_domain *sd,
6245 struct sched_domain_attr *attr)
6249 if (!attr || attr->relax_domain_level < 0) {
6250 if (default_relax_domain_level < 0)
6253 request = default_relax_domain_level;
6255 request = attr->relax_domain_level;
6256 if (request < sd->level) {
6257 /* turn off idle balance on this domain */
6258 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6260 /* turn on idle balance on this domain */
6261 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6265 static void __sdt_free(const struct cpumask *cpu_map);
6266 static int __sdt_alloc(const struct cpumask *cpu_map);
6268 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6269 const struct cpumask *cpu_map)
6273 if (!atomic_read(&d->rd->refcount))
6274 free_rootdomain(&d->rd->rcu); /* fall through */
6276 free_percpu(d->sd); /* fall through */
6278 __sdt_free(cpu_map); /* fall through */
6284 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6285 const struct cpumask *cpu_map)
6287 memset(d, 0, sizeof(*d));
6289 if (__sdt_alloc(cpu_map))
6290 return sa_sd_storage;
6291 d->sd = alloc_percpu(struct sched_domain *);
6293 return sa_sd_storage;
6294 d->rd = alloc_rootdomain();
6297 return sa_rootdomain;
6301 * NULL the sd_data elements we've used to build the sched_domain and
6302 * sched_group structure so that the subsequent __free_domain_allocs()
6303 * will not free the data we're using.
6305 static void claim_allocations(int cpu, struct sched_domain *sd)
6307 struct sd_data *sdd = sd->private;
6309 WARN_ON_ONCE(*per_cpu_ptr(sdd->sd, cpu) != sd);
6310 *per_cpu_ptr(sdd->sd, cpu) = NULL;
6312 if (atomic_read(&(*per_cpu_ptr(sdd->sg, cpu))->ref))
6313 *per_cpu_ptr(sdd->sg, cpu) = NULL;
6315 if (atomic_read(&(*per_cpu_ptr(sdd->sgp, cpu))->ref))
6316 *per_cpu_ptr(sdd->sgp, cpu) = NULL;
6319 #ifdef CONFIG_SCHED_SMT
6320 static const struct cpumask *cpu_smt_mask(int cpu)
6322 return topology_thread_cpumask(cpu);
6327 * Topology list, bottom-up.
6329 static struct sched_domain_topology_level default_topology[] = {
6330 #ifdef CONFIG_SCHED_SMT
6331 { sd_init_SIBLING, cpu_smt_mask, },
6333 #ifdef CONFIG_SCHED_MC
6334 { sd_init_MC, cpu_coregroup_mask, },
6336 #ifdef CONFIG_SCHED_BOOK
6337 { sd_init_BOOK, cpu_book_mask, },
6339 { sd_init_CPU, cpu_cpu_mask, },
6341 { sd_init_NODE, cpu_node_mask, SDTL_OVERLAP, },
6342 { sd_init_ALLNODES, cpu_allnodes_mask, },
6347 static struct sched_domain_topology_level *sched_domain_topology = default_topology;
6349 static int __sdt_alloc(const struct cpumask *cpu_map)
6351 struct sched_domain_topology_level *tl;
6354 for (tl = sched_domain_topology; tl->init; tl++) {
6355 struct sd_data *sdd = &tl->data;
6357 sdd->sd = alloc_percpu(struct sched_domain *);
6361 sdd->sg = alloc_percpu(struct sched_group *);
6365 sdd->sgp = alloc_percpu(struct sched_group_power *);
6369 for_each_cpu(j, cpu_map) {
6370 struct sched_domain *sd;
6371 struct sched_group *sg;
6372 struct sched_group_power *sgp;
6374 sd = kzalloc_node(sizeof(struct sched_domain) + cpumask_size(),
6375 GFP_KERNEL, cpu_to_node(j));
6379 *per_cpu_ptr(sdd->sd, j) = sd;
6381 sg = kzalloc_node(sizeof(struct sched_group) + cpumask_size(),
6382 GFP_KERNEL, cpu_to_node(j));
6388 *per_cpu_ptr(sdd->sg, j) = sg;
6390 sgp = kzalloc_node(sizeof(struct sched_group_power),
6391 GFP_KERNEL, cpu_to_node(j));
6395 *per_cpu_ptr(sdd->sgp, j) = sgp;
6402 static void __sdt_free(const struct cpumask *cpu_map)
6404 struct sched_domain_topology_level *tl;
6407 for (tl = sched_domain_topology; tl->init; tl++) {
6408 struct sd_data *sdd = &tl->data;
6410 for_each_cpu(j, cpu_map) {
6411 struct sched_domain *sd;
6414 sd = *per_cpu_ptr(sdd->sd, j);
6415 if (sd && (sd->flags & SD_OVERLAP))
6416 free_sched_groups(sd->groups, 0);
6417 kfree(*per_cpu_ptr(sdd->sd, j));
6421 kfree(*per_cpu_ptr(sdd->sg, j));
6423 kfree(*per_cpu_ptr(sdd->sgp, j));
6425 free_percpu(sdd->sd);
6427 free_percpu(sdd->sg);
6429 free_percpu(sdd->sgp);
6434 struct sched_domain *build_sched_domain(struct sched_domain_topology_level *tl,
6435 struct s_data *d, const struct cpumask *cpu_map,
6436 struct sched_domain_attr *attr, struct sched_domain *child,
6439 struct sched_domain *sd = tl->init(tl, cpu);
6443 set_domain_attribute(sd, attr);
6444 cpumask_and(sched_domain_span(sd), cpu_map, tl->mask(cpu));
6446 sd->level = child->level + 1;
6447 sched_domain_level_max = max(sched_domain_level_max, sd->level);
6456 * Build sched domains for a given set of cpus and attach the sched domains
6457 * to the individual cpus
6459 static int build_sched_domains(const struct cpumask *cpu_map,
6460 struct sched_domain_attr *attr)
6462 enum s_alloc alloc_state = sa_none;
6463 struct sched_domain *sd;
6465 int i, ret = -ENOMEM;
6467 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
6468 if (alloc_state != sa_rootdomain)
6471 /* Set up domains for cpus specified by the cpu_map. */
6472 for_each_cpu(i, cpu_map) {
6473 struct sched_domain_topology_level *tl;
6476 for (tl = sched_domain_topology; tl->init; tl++) {
6477 sd = build_sched_domain(tl, &d, cpu_map, attr, sd, i);
6478 if (tl->flags & SDTL_OVERLAP || sched_feat(FORCE_SD_OVERLAP))
6479 sd->flags |= SD_OVERLAP;
6480 if (cpumask_equal(cpu_map, sched_domain_span(sd)))
6487 *per_cpu_ptr(d.sd, i) = sd;
6490 /* Build the groups for the domains */
6491 for_each_cpu(i, cpu_map) {
6492 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6493 sd->span_weight = cpumask_weight(sched_domain_span(sd));
6494 if (sd->flags & SD_OVERLAP) {
6495 if (build_overlap_sched_groups(sd, i))
6498 if (build_sched_groups(sd, i))
6504 /* Calculate CPU power for physical packages and nodes */
6505 for (i = nr_cpumask_bits-1; i >= 0; i--) {
6506 if (!cpumask_test_cpu(i, cpu_map))
6509 for (sd = *per_cpu_ptr(d.sd, i); sd; sd = sd->parent) {
6510 claim_allocations(i, sd);
6511 init_sched_groups_power(i, sd);
6515 /* Attach the domains */
6517 for_each_cpu(i, cpu_map) {
6518 sd = *per_cpu_ptr(d.sd, i);
6519 cpu_attach_domain(sd, d.rd, i);
6525 __free_domain_allocs(&d, alloc_state, cpu_map);
6529 static cpumask_var_t *doms_cur; /* current sched domains */
6530 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
6531 static struct sched_domain_attr *dattr_cur;
6532 /* attribues of custom domains in 'doms_cur' */
6535 * Special case: If a kmalloc of a doms_cur partition (array of
6536 * cpumask) fails, then fallback to a single sched domain,
6537 * as determined by the single cpumask fallback_doms.
6539 static cpumask_var_t fallback_doms;
6542 * arch_update_cpu_topology lets virtualized architectures update the
6543 * cpu core maps. It is supposed to return 1 if the topology changed
6544 * or 0 if it stayed the same.
6546 int __attribute__((weak)) arch_update_cpu_topology(void)
6551 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
6554 cpumask_var_t *doms;
6556 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
6559 for (i = 0; i < ndoms; i++) {
6560 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
6561 free_sched_domains(doms, i);
6568 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
6571 for (i = 0; i < ndoms; i++)
6572 free_cpumask_var(doms[i]);
6577 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
6578 * For now this just excludes isolated cpus, but could be used to
6579 * exclude other special cases in the future.
6581 static int init_sched_domains(const struct cpumask *cpu_map)
6585 arch_update_cpu_topology();
6587 doms_cur = alloc_sched_domains(ndoms_cur);
6589 doms_cur = &fallback_doms;
6590 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
6592 err = build_sched_domains(doms_cur[0], NULL);
6593 register_sched_domain_sysctl();
6599 * Detach sched domains from a group of cpus specified in cpu_map
6600 * These cpus will now be attached to the NULL domain
6602 static void detach_destroy_domains(const struct cpumask *cpu_map)
6607 for_each_cpu(i, cpu_map)
6608 cpu_attach_domain(NULL, &def_root_domain, i);
6612 /* handle null as "default" */
6613 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
6614 struct sched_domain_attr *new, int idx_new)
6616 struct sched_domain_attr tmp;
6623 return !memcmp(cur ? (cur + idx_cur) : &tmp,
6624 new ? (new + idx_new) : &tmp,
6625 sizeof(struct sched_domain_attr));
6629 * Partition sched domains as specified by the 'ndoms_new'
6630 * cpumasks in the array doms_new[] of cpumasks. This compares
6631 * doms_new[] to the current sched domain partitioning, doms_cur[].
6632 * It destroys each deleted domain and builds each new domain.
6634 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
6635 * The masks don't intersect (don't overlap.) We should setup one
6636 * sched domain for each mask. CPUs not in any of the cpumasks will
6637 * not be load balanced. If the same cpumask appears both in the
6638 * current 'doms_cur' domains and in the new 'doms_new', we can leave
6641 * The passed in 'doms_new' should be allocated using
6642 * alloc_sched_domains. This routine takes ownership of it and will
6643 * free_sched_domains it when done with it. If the caller failed the
6644 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
6645 * and partition_sched_domains() will fallback to the single partition
6646 * 'fallback_doms', it also forces the domains to be rebuilt.
6648 * If doms_new == NULL it will be replaced with cpu_online_mask.
6649 * ndoms_new == 0 is a special case for destroying existing domains,
6650 * and it will not create the default domain.
6652 * Call with hotplug lock held
6654 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
6655 struct sched_domain_attr *dattr_new)
6660 mutex_lock(&sched_domains_mutex);
6662 /* always unregister in case we don't destroy any domains */
6663 unregister_sched_domain_sysctl();
6665 /* Let architecture update cpu core mappings. */
6666 new_topology = arch_update_cpu_topology();
6668 n = doms_new ? ndoms_new : 0;
6670 /* Destroy deleted domains */
6671 for (i = 0; i < ndoms_cur; i++) {
6672 for (j = 0; j < n && !new_topology; j++) {
6673 if (cpumask_equal(doms_cur[i], doms_new[j])
6674 && dattrs_equal(dattr_cur, i, dattr_new, j))
6677 /* no match - a current sched domain not in new doms_new[] */
6678 detach_destroy_domains(doms_cur[i]);
6683 if (doms_new == NULL) {
6685 doms_new = &fallback_doms;
6686 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
6687 WARN_ON_ONCE(dattr_new);
6690 /* Build new domains */
6691 for (i = 0; i < ndoms_new; i++) {
6692 for (j = 0; j < ndoms_cur && !new_topology; j++) {
6693 if (cpumask_equal(doms_new[i], doms_cur[j])
6694 && dattrs_equal(dattr_new, i, dattr_cur, j))
6697 /* no match - add a new doms_new */
6698 build_sched_domains(doms_new[i], dattr_new ? dattr_new + i : NULL);
6703 /* Remember the new sched domains */
6704 if (doms_cur != &fallback_doms)
6705 free_sched_domains(doms_cur, ndoms_cur);
6706 kfree(dattr_cur); /* kfree(NULL) is safe */
6707 doms_cur = doms_new;
6708 dattr_cur = dattr_new;
6709 ndoms_cur = ndoms_new;
6711 register_sched_domain_sysctl();
6713 mutex_unlock(&sched_domains_mutex);
6716 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
6717 static void reinit_sched_domains(void)
6721 /* Destroy domains first to force the rebuild */
6722 partition_sched_domains(0, NULL, NULL);
6724 rebuild_sched_domains();
6728 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
6730 unsigned int level = 0;
6732 if (sscanf(buf, "%u", &level) != 1)
6736 * level is always be positive so don't check for
6737 * level < POWERSAVINGS_BALANCE_NONE which is 0
6738 * What happens on 0 or 1 byte write,
6739 * need to check for count as well?
6742 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
6746 sched_smt_power_savings = level;
6748 sched_mc_power_savings = level;
6750 reinit_sched_domains();
6755 #ifdef CONFIG_SCHED_MC
6756 static ssize_t sched_mc_power_savings_show(struct device *dev,
6757 struct device_attribute *attr,
6760 return sprintf(buf, "%u\n", sched_mc_power_savings);
6762 static ssize_t sched_mc_power_savings_store(struct device *dev,
6763 struct device_attribute *attr,
6764 const char *buf, size_t count)
6766 return sched_power_savings_store(buf, count, 0);
6768 static DEVICE_ATTR(sched_mc_power_savings, 0644,
6769 sched_mc_power_savings_show,
6770 sched_mc_power_savings_store);
6773 #ifdef CONFIG_SCHED_SMT
6774 static ssize_t sched_smt_power_savings_show(struct device *dev,
6775 struct device_attribute *attr,
6778 return sprintf(buf, "%u\n", sched_smt_power_savings);
6780 static ssize_t sched_smt_power_savings_store(struct device *dev,
6781 struct device_attribute *attr,
6782 const char *buf, size_t count)
6784 return sched_power_savings_store(buf, count, 1);
6786 static DEVICE_ATTR(sched_smt_power_savings, 0644,
6787 sched_smt_power_savings_show,
6788 sched_smt_power_savings_store);
6791 int __init sched_create_sysfs_power_savings_entries(struct device *dev)
6795 #ifdef CONFIG_SCHED_SMT
6797 err = device_create_file(dev, &dev_attr_sched_smt_power_savings);
6799 #ifdef CONFIG_SCHED_MC
6800 if (!err && mc_capable())
6801 err = device_create_file(dev, &dev_attr_sched_mc_power_savings);
6805 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
6808 * Update cpusets according to cpu_active mask. If cpusets are
6809 * disabled, cpuset_update_active_cpus() becomes a simple wrapper
6810 * around partition_sched_domains().
6812 static int cpuset_cpu_active(struct notifier_block *nfb, unsigned long action,
6815 switch (action & ~CPU_TASKS_FROZEN) {
6817 case CPU_DOWN_FAILED:
6818 cpuset_update_active_cpus();
6825 static int cpuset_cpu_inactive(struct notifier_block *nfb, unsigned long action,
6828 switch (action & ~CPU_TASKS_FROZEN) {
6829 case CPU_DOWN_PREPARE:
6830 cpuset_update_active_cpus();
6837 void __init sched_init_smp(void)
6839 cpumask_var_t non_isolated_cpus;
6841 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
6842 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
6845 mutex_lock(&sched_domains_mutex);
6846 init_sched_domains(cpu_active_mask);
6847 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
6848 if (cpumask_empty(non_isolated_cpus))
6849 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
6850 mutex_unlock(&sched_domains_mutex);
6853 hotcpu_notifier(cpuset_cpu_active, CPU_PRI_CPUSET_ACTIVE);
6854 hotcpu_notifier(cpuset_cpu_inactive, CPU_PRI_CPUSET_INACTIVE);
6856 /* RT runtime code needs to handle some hotplug events */
6857 hotcpu_notifier(update_runtime, 0);
6861 /* Move init over to a non-isolated CPU */
6862 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
6864 sched_init_granularity();
6865 free_cpumask_var(non_isolated_cpus);
6867 init_sched_rt_class();
6870 void __init sched_init_smp(void)
6872 sched_init_granularity();
6874 #endif /* CONFIG_SMP */
6876 const_debug unsigned int sysctl_timer_migration = 1;
6878 int in_sched_functions(unsigned long addr)
6880 return in_lock_functions(addr) ||
6881 (addr >= (unsigned long)__sched_text_start
6882 && addr < (unsigned long)__sched_text_end);
6885 #ifdef CONFIG_CGROUP_SCHED
6886 struct task_group root_task_group;
6889 DECLARE_PER_CPU(cpumask_var_t, load_balance_tmpmask);
6891 void __init sched_init(void)
6894 unsigned long alloc_size = 0, ptr;
6896 #ifdef CONFIG_FAIR_GROUP_SCHED
6897 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6899 #ifdef CONFIG_RT_GROUP_SCHED
6900 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
6902 #ifdef CONFIG_CPUMASK_OFFSTACK
6903 alloc_size += num_possible_cpus() * cpumask_size();
6906 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
6908 #ifdef CONFIG_FAIR_GROUP_SCHED
6909 root_task_group.se = (struct sched_entity **)ptr;
6910 ptr += nr_cpu_ids * sizeof(void **);
6912 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
6913 ptr += nr_cpu_ids * sizeof(void **);
6915 #endif /* CONFIG_FAIR_GROUP_SCHED */
6916 #ifdef CONFIG_RT_GROUP_SCHED
6917 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
6918 ptr += nr_cpu_ids * sizeof(void **);
6920 root_task_group.rt_rq = (struct rt_rq **)ptr;
6921 ptr += nr_cpu_ids * sizeof(void **);
6923 #endif /* CONFIG_RT_GROUP_SCHED */
6924 #ifdef CONFIG_CPUMASK_OFFSTACK
6925 for_each_possible_cpu(i) {
6926 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
6927 ptr += cpumask_size();
6929 #endif /* CONFIG_CPUMASK_OFFSTACK */
6933 init_defrootdomain();
6936 init_rt_bandwidth(&def_rt_bandwidth,
6937 global_rt_period(), global_rt_runtime());
6939 #ifdef CONFIG_RT_GROUP_SCHED
6940 init_rt_bandwidth(&root_task_group.rt_bandwidth,
6941 global_rt_period(), global_rt_runtime());
6942 #endif /* CONFIG_RT_GROUP_SCHED */
6944 #ifdef CONFIG_CGROUP_SCHED
6945 list_add(&root_task_group.list, &task_groups);
6946 INIT_LIST_HEAD(&root_task_group.children);
6947 INIT_LIST_HEAD(&root_task_group.siblings);
6948 autogroup_init(&init_task);
6950 #endif /* CONFIG_CGROUP_SCHED */
6952 #ifdef CONFIG_CGROUP_CPUACCT
6953 root_cpuacct.cpustat = &kernel_cpustat;
6954 root_cpuacct.cpuusage = alloc_percpu(u64);
6955 /* Too early, not expected to fail */
6956 BUG_ON(!root_cpuacct.cpuusage);
6958 for_each_possible_cpu(i) {
6962 raw_spin_lock_init(&rq->lock);
6964 rq->calc_load_active = 0;
6965 rq->calc_load_update = jiffies + LOAD_FREQ;
6966 init_cfs_rq(&rq->cfs);
6967 init_rt_rq(&rq->rt, rq);
6968 #ifdef CONFIG_FAIR_GROUP_SCHED
6969 root_task_group.shares = ROOT_TASK_GROUP_LOAD;
6970 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
6972 * How much cpu bandwidth does root_task_group get?
6974 * In case of task-groups formed thr' the cgroup filesystem, it
6975 * gets 100% of the cpu resources in the system. This overall
6976 * system cpu resource is divided among the tasks of
6977 * root_task_group and its child task-groups in a fair manner,
6978 * based on each entity's (task or task-group's) weight
6979 * (se->load.weight).
6981 * In other words, if root_task_group has 10 tasks of weight
6982 * 1024) and two child groups A0 and A1 (of weight 1024 each),
6983 * then A0's share of the cpu resource is:
6985 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
6987 * We achieve this by letting root_task_group's tasks sit
6988 * directly in rq->cfs (i.e root_task_group->se[] = NULL).
6990 init_cfs_bandwidth(&root_task_group.cfs_bandwidth);
6991 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL);
6992 #endif /* CONFIG_FAIR_GROUP_SCHED */
6994 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
6995 #ifdef CONFIG_RT_GROUP_SCHED
6996 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
6997 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL);
7000 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
7001 rq->cpu_load[j] = 0;
7003 rq->last_load_update_tick = jiffies;
7008 rq->cpu_power = SCHED_POWER_SCALE;
7009 rq->post_schedule = 0;
7010 rq->active_balance = 0;
7011 rq->next_balance = jiffies;
7016 rq->avg_idle = 2*sysctl_sched_migration_cost;
7018 INIT_LIST_HEAD(&rq->cfs_tasks);
7020 rq_attach_root(rq, &def_root_domain);
7026 atomic_set(&rq->nr_iowait, 0);
7029 set_load_weight(&init_task);
7031 #ifdef CONFIG_PREEMPT_NOTIFIERS
7032 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
7035 #ifdef CONFIG_RT_MUTEXES
7036 plist_head_init(&init_task.pi_waiters);
7040 * The boot idle thread does lazy MMU switching as well:
7042 atomic_inc(&init_mm.mm_count);
7043 enter_lazy_tlb(&init_mm, current);
7046 * Make us the idle thread. Technically, schedule() should not be
7047 * called from this thread, however somewhere below it might be,
7048 * but because we are the idle thread, we just pick up running again
7049 * when this runqueue becomes "idle".
7051 init_idle(current, smp_processor_id());
7053 calc_load_update = jiffies + LOAD_FREQ;
7056 * During early bootup we pretend to be a normal task:
7058 current->sched_class = &fair_sched_class;
7061 zalloc_cpumask_var(&sched_domains_tmpmask, GFP_NOWAIT);
7062 /* May be allocated at isolcpus cmdline parse time */
7063 if (cpu_isolated_map == NULL)
7064 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7066 init_sched_fair_class();
7068 scheduler_running = 1;
7071 #ifdef CONFIG_DEBUG_ATOMIC_SLEEP
7072 static inline int preempt_count_equals(int preempt_offset)
7074 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
7076 return (nested == preempt_offset);
7079 void __might_sleep(const char *file, int line, int preempt_offset)
7081 static unsigned long prev_jiffy; /* ratelimiting */
7083 rcu_sleep_check(); /* WARN_ON_ONCE() by default, no rate limit reqd. */
7084 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
7085 system_state != SYSTEM_RUNNING || oops_in_progress)
7087 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7089 prev_jiffy = jiffies;
7092 "BUG: sleeping function called from invalid context at %s:%d\n",
7095 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7096 in_atomic(), irqs_disabled(),
7097 current->pid, current->comm);
7099 debug_show_held_locks(current);
7100 if (irqs_disabled())
7101 print_irqtrace_events(current);
7104 EXPORT_SYMBOL(__might_sleep);
7107 #ifdef CONFIG_MAGIC_SYSRQ
7108 static void normalize_task(struct rq *rq, struct task_struct *p)
7110 const struct sched_class *prev_class = p->sched_class;
7111 int old_prio = p->prio;
7116 dequeue_task(rq, p, 0);
7117 __setscheduler(rq, p, SCHED_NORMAL, 0);
7119 enqueue_task(rq, p, 0);
7120 resched_task(rq->curr);
7123 check_class_changed(rq, p, prev_class, old_prio);
7126 void normalize_rt_tasks(void)
7128 struct task_struct *g, *p;
7129 unsigned long flags;
7132 read_lock_irqsave(&tasklist_lock, flags);
7133 do_each_thread(g, p) {
7135 * Only normalize user tasks:
7140 p->se.exec_start = 0;
7141 #ifdef CONFIG_SCHEDSTATS
7142 p->se.statistics.wait_start = 0;
7143 p->se.statistics.sleep_start = 0;
7144 p->se.statistics.block_start = 0;
7149 * Renice negative nice level userspace
7152 if (TASK_NICE(p) < 0 && p->mm)
7153 set_user_nice(p, 0);
7157 raw_spin_lock(&p->pi_lock);
7158 rq = __task_rq_lock(p);
7160 normalize_task(rq, p);
7162 __task_rq_unlock(rq);
7163 raw_spin_unlock(&p->pi_lock);
7164 } while_each_thread(g, p);
7166 read_unlock_irqrestore(&tasklist_lock, flags);
7169 #endif /* CONFIG_MAGIC_SYSRQ */
7171 #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB)
7173 * These functions are only useful for the IA64 MCA handling, or kdb.
7175 * They can only be called when the whole system has been
7176 * stopped - every CPU needs to be quiescent, and no scheduling
7177 * activity can take place. Using them for anything else would
7178 * be a serious bug, and as a result, they aren't even visible
7179 * under any other configuration.
7183 * curr_task - return the current task for a given cpu.
7184 * @cpu: the processor in question.
7186 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7188 struct task_struct *curr_task(int cpu)
7190 return cpu_curr(cpu);
7193 #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */
7197 * set_curr_task - set the current task for a given cpu.
7198 * @cpu: the processor in question.
7199 * @p: the task pointer to set.
7201 * Description: This function must only be used when non-maskable interrupts
7202 * are serviced on a separate stack. It allows the architecture to switch the
7203 * notion of the current task on a cpu in a non-blocking manner. This function
7204 * must be called with all CPU's synchronized, and interrupts disabled, the
7205 * and caller must save the original value of the current task (see
7206 * curr_task() above) and restore that value before reenabling interrupts and
7207 * re-starting the system.
7209 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7211 void set_curr_task(int cpu, struct task_struct *p)
7218 #ifdef CONFIG_CGROUP_SCHED
7219 /* task_group_lock serializes the addition/removal of task groups */
7220 static DEFINE_SPINLOCK(task_group_lock);
7222 static void free_sched_group(struct task_group *tg)
7224 free_fair_sched_group(tg);
7225 free_rt_sched_group(tg);
7230 /* allocate runqueue etc for a new task group */
7231 struct task_group *sched_create_group(struct task_group *parent)
7233 struct task_group *tg;
7234 unsigned long flags;
7236 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
7238 return ERR_PTR(-ENOMEM);
7240 if (!alloc_fair_sched_group(tg, parent))
7243 if (!alloc_rt_sched_group(tg, parent))
7246 spin_lock_irqsave(&task_group_lock, flags);
7247 list_add_rcu(&tg->list, &task_groups);
7249 WARN_ON(!parent); /* root should already exist */
7251 tg->parent = parent;
7252 INIT_LIST_HEAD(&tg->children);
7253 list_add_rcu(&tg->siblings, &parent->children);
7254 spin_unlock_irqrestore(&task_group_lock, flags);
7259 free_sched_group(tg);
7260 return ERR_PTR(-ENOMEM);
7263 /* rcu callback to free various structures associated with a task group */
7264 static void free_sched_group_rcu(struct rcu_head *rhp)
7266 /* now it should be safe to free those cfs_rqs */
7267 free_sched_group(container_of(rhp, struct task_group, rcu));
7270 /* Destroy runqueue etc associated with a task group */
7271 void sched_destroy_group(struct task_group *tg)
7273 unsigned long flags;
7276 /* end participation in shares distribution */
7277 for_each_possible_cpu(i)
7278 unregister_fair_sched_group(tg, i);
7280 spin_lock_irqsave(&task_group_lock, flags);
7281 list_del_rcu(&tg->list);
7282 list_del_rcu(&tg->siblings);
7283 spin_unlock_irqrestore(&task_group_lock, flags);
7285 /* wait for possible concurrent references to cfs_rqs complete */
7286 call_rcu(&tg->rcu, free_sched_group_rcu);
7289 /* change task's runqueue when it moves between groups.
7290 * The caller of this function should have put the task in its new group
7291 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
7292 * reflect its new group.
7294 void sched_move_task(struct task_struct *tsk)
7297 unsigned long flags;
7300 rq = task_rq_lock(tsk, &flags);
7302 running = task_current(rq, tsk);
7306 dequeue_task(rq, tsk, 0);
7307 if (unlikely(running))
7308 tsk->sched_class->put_prev_task(rq, tsk);
7310 #ifdef CONFIG_FAIR_GROUP_SCHED
7311 if (tsk->sched_class->task_move_group)
7312 tsk->sched_class->task_move_group(tsk, on_rq);
7315 set_task_rq(tsk, task_cpu(tsk));
7317 if (unlikely(running))
7318 tsk->sched_class->set_curr_task(rq);
7320 enqueue_task(rq, tsk, 0);
7322 task_rq_unlock(rq, tsk, &flags);
7324 #endif /* CONFIG_CGROUP_SCHED */
7326 #if defined(CONFIG_RT_GROUP_SCHED) || defined(CONFIG_CFS_BANDWIDTH)
7327 static unsigned long to_ratio(u64 period, u64 runtime)
7329 if (runtime == RUNTIME_INF)
7332 return div64_u64(runtime << 20, period);
7336 #ifdef CONFIG_RT_GROUP_SCHED
7338 * Ensure that the real time constraints are schedulable.
7340 static DEFINE_MUTEX(rt_constraints_mutex);
7342 /* Must be called with tasklist_lock held */
7343 static inline int tg_has_rt_tasks(struct task_group *tg)
7345 struct task_struct *g, *p;
7347 do_each_thread(g, p) {
7348 if (rt_task(p) && task_rq(p)->rt.tg == tg)
7350 } while_each_thread(g, p);
7355 struct rt_schedulable_data {
7356 struct task_group *tg;
7361 static int tg_rt_schedulable(struct task_group *tg, void *data)
7363 struct rt_schedulable_data *d = data;
7364 struct task_group *child;
7365 unsigned long total, sum = 0;
7366 u64 period, runtime;
7368 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7369 runtime = tg->rt_bandwidth.rt_runtime;
7372 period = d->rt_period;
7373 runtime = d->rt_runtime;
7377 * Cannot have more runtime than the period.
7379 if (runtime > period && runtime != RUNTIME_INF)
7383 * Ensure we don't starve existing RT tasks.
7385 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
7388 total = to_ratio(period, runtime);
7391 * Nobody can have more than the global setting allows.
7393 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
7397 * The sum of our children's runtime should not exceed our own.
7399 list_for_each_entry_rcu(child, &tg->children, siblings) {
7400 period = ktime_to_ns(child->rt_bandwidth.rt_period);
7401 runtime = child->rt_bandwidth.rt_runtime;
7403 if (child == d->tg) {
7404 period = d->rt_period;
7405 runtime = d->rt_runtime;
7408 sum += to_ratio(period, runtime);
7417 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
7421 struct rt_schedulable_data data = {
7423 .rt_period = period,
7424 .rt_runtime = runtime,
7428 ret = walk_tg_tree(tg_rt_schedulable, tg_nop, &data);
7434 static int tg_set_rt_bandwidth(struct task_group *tg,
7435 u64 rt_period, u64 rt_runtime)
7439 mutex_lock(&rt_constraints_mutex);
7440 read_lock(&tasklist_lock);
7441 err = __rt_schedulable(tg, rt_period, rt_runtime);
7445 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7446 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
7447 tg->rt_bandwidth.rt_runtime = rt_runtime;
7449 for_each_possible_cpu(i) {
7450 struct rt_rq *rt_rq = tg->rt_rq[i];
7452 raw_spin_lock(&rt_rq->rt_runtime_lock);
7453 rt_rq->rt_runtime = rt_runtime;
7454 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7456 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
7458 read_unlock(&tasklist_lock);
7459 mutex_unlock(&rt_constraints_mutex);
7464 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
7466 u64 rt_runtime, rt_period;
7468 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
7469 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
7470 if (rt_runtime_us < 0)
7471 rt_runtime = RUNTIME_INF;
7473 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7476 long sched_group_rt_runtime(struct task_group *tg)
7480 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
7483 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
7484 do_div(rt_runtime_us, NSEC_PER_USEC);
7485 return rt_runtime_us;
7488 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
7490 u64 rt_runtime, rt_period;
7492 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
7493 rt_runtime = tg->rt_bandwidth.rt_runtime;
7498 return tg_set_rt_bandwidth(tg, rt_period, rt_runtime);
7501 long sched_group_rt_period(struct task_group *tg)
7505 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
7506 do_div(rt_period_us, NSEC_PER_USEC);
7507 return rt_period_us;
7510 static int sched_rt_global_constraints(void)
7512 u64 runtime, period;
7515 if (sysctl_sched_rt_period <= 0)
7518 runtime = global_rt_runtime();
7519 period = global_rt_period();
7522 * Sanity check on the sysctl variables.
7524 if (runtime > period && runtime != RUNTIME_INF)
7527 mutex_lock(&rt_constraints_mutex);
7528 read_lock(&tasklist_lock);
7529 ret = __rt_schedulable(NULL, 0, 0);
7530 read_unlock(&tasklist_lock);
7531 mutex_unlock(&rt_constraints_mutex);
7536 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
7538 /* Don't accept realtime tasks when there is no way for them to run */
7539 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
7545 #else /* !CONFIG_RT_GROUP_SCHED */
7546 static int sched_rt_global_constraints(void)
7548 unsigned long flags;
7551 if (sysctl_sched_rt_period <= 0)
7555 * There's always some RT tasks in the root group
7556 * -- migration, kstopmachine etc..
7558 if (sysctl_sched_rt_runtime == 0)
7561 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
7562 for_each_possible_cpu(i) {
7563 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
7565 raw_spin_lock(&rt_rq->rt_runtime_lock);
7566 rt_rq->rt_runtime = global_rt_runtime();
7567 raw_spin_unlock(&rt_rq->rt_runtime_lock);
7569 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
7573 #endif /* CONFIG_RT_GROUP_SCHED */
7575 int sched_rt_handler(struct ctl_table *table, int write,
7576 void __user *buffer, size_t *lenp,
7580 int old_period, old_runtime;
7581 static DEFINE_MUTEX(mutex);
7584 old_period = sysctl_sched_rt_period;
7585 old_runtime = sysctl_sched_rt_runtime;
7587 ret = proc_dointvec(table, write, buffer, lenp, ppos);
7589 if (!ret && write) {
7590 ret = sched_rt_global_constraints();
7592 sysctl_sched_rt_period = old_period;
7593 sysctl_sched_rt_runtime = old_runtime;
7595 def_rt_bandwidth.rt_runtime = global_rt_runtime();
7596 def_rt_bandwidth.rt_period =
7597 ns_to_ktime(global_rt_period());
7600 mutex_unlock(&mutex);
7605 #ifdef CONFIG_CGROUP_SCHED
7607 /* return corresponding task_group object of a cgroup */
7608 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
7610 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
7611 struct task_group, css);
7614 static struct cgroup_subsys_state *cpu_cgroup_create(struct cgroup *cgrp)
7616 struct task_group *tg, *parent;
7618 if (!cgrp->parent) {
7619 /* This is early initialization for the top cgroup */
7620 return &root_task_group.css;
7623 parent = cgroup_tg(cgrp->parent);
7624 tg = sched_create_group(parent);
7626 return ERR_PTR(-ENOMEM);
7631 static void cpu_cgroup_destroy(struct cgroup *cgrp)
7633 struct task_group *tg = cgroup_tg(cgrp);
7635 sched_destroy_group(tg);
7638 static int cpu_cgroup_can_attach(struct cgroup *cgrp,
7639 struct cgroup_taskset *tset)
7641 struct task_struct *task;
7643 cgroup_taskset_for_each(task, cgrp, tset) {
7644 #ifdef CONFIG_RT_GROUP_SCHED
7645 if (!sched_rt_can_attach(cgroup_tg(cgrp), task))
7648 /* We don't support RT-tasks being in separate groups */
7649 if (task->sched_class != &fair_sched_class)
7656 static void cpu_cgroup_attach(struct cgroup *cgrp,
7657 struct cgroup_taskset *tset)
7659 struct task_struct *task;
7661 cgroup_taskset_for_each(task, cgrp, tset)
7662 sched_move_task(task);
7666 cpu_cgroup_exit(struct cgroup *cgrp, struct cgroup *old_cgrp,
7667 struct task_struct *task)
7670 * cgroup_exit() is called in the copy_process() failure path.
7671 * Ignore this case since the task hasn't ran yet, this avoids
7672 * trying to poke a half freed task state from generic code.
7674 if (!(task->flags & PF_EXITING))
7677 sched_move_task(task);
7680 #ifdef CONFIG_FAIR_GROUP_SCHED
7681 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
7684 return sched_group_set_shares(cgroup_tg(cgrp), scale_load(shareval));
7687 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
7689 struct task_group *tg = cgroup_tg(cgrp);
7691 return (u64) scale_load_down(tg->shares);
7694 #ifdef CONFIG_CFS_BANDWIDTH
7695 static DEFINE_MUTEX(cfs_constraints_mutex);
7697 const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */
7698 const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */
7700 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime);
7702 static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota)
7704 int i, ret = 0, runtime_enabled, runtime_was_enabled;
7705 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7707 if (tg == &root_task_group)
7711 * Ensure we have at some amount of bandwidth every period. This is
7712 * to prevent reaching a state of large arrears when throttled via
7713 * entity_tick() resulting in prolonged exit starvation.
7715 if (quota < min_cfs_quota_period || period < min_cfs_quota_period)
7719 * Likewise, bound things on the otherside by preventing insane quota
7720 * periods. This also allows us to normalize in computing quota
7723 if (period > max_cfs_quota_period)
7726 mutex_lock(&cfs_constraints_mutex);
7727 ret = __cfs_schedulable(tg, period, quota);
7731 runtime_enabled = quota != RUNTIME_INF;
7732 runtime_was_enabled = cfs_b->quota != RUNTIME_INF;
7733 account_cfs_bandwidth_used(runtime_enabled, runtime_was_enabled);
7734 raw_spin_lock_irq(&cfs_b->lock);
7735 cfs_b->period = ns_to_ktime(period);
7736 cfs_b->quota = quota;
7738 __refill_cfs_bandwidth_runtime(cfs_b);
7739 /* restart the period timer (if active) to handle new period expiry */
7740 if (runtime_enabled && cfs_b->timer_active) {
7741 /* force a reprogram */
7742 cfs_b->timer_active = 0;
7743 __start_cfs_bandwidth(cfs_b);
7745 raw_spin_unlock_irq(&cfs_b->lock);
7747 for_each_possible_cpu(i) {
7748 struct cfs_rq *cfs_rq = tg->cfs_rq[i];
7749 struct rq *rq = cfs_rq->rq;
7751 raw_spin_lock_irq(&rq->lock);
7752 cfs_rq->runtime_enabled = runtime_enabled;
7753 cfs_rq->runtime_remaining = 0;
7755 if (cfs_rq->throttled)
7756 unthrottle_cfs_rq(cfs_rq);
7757 raw_spin_unlock_irq(&rq->lock);
7760 mutex_unlock(&cfs_constraints_mutex);
7765 int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us)
7769 period = ktime_to_ns(tg->cfs_bandwidth.period);
7770 if (cfs_quota_us < 0)
7771 quota = RUNTIME_INF;
7773 quota = (u64)cfs_quota_us * NSEC_PER_USEC;
7775 return tg_set_cfs_bandwidth(tg, period, quota);
7778 long tg_get_cfs_quota(struct task_group *tg)
7782 if (tg->cfs_bandwidth.quota == RUNTIME_INF)
7785 quota_us = tg->cfs_bandwidth.quota;
7786 do_div(quota_us, NSEC_PER_USEC);
7791 int tg_set_cfs_period(struct task_group *tg, long cfs_period_us)
7795 period = (u64)cfs_period_us * NSEC_PER_USEC;
7796 quota = tg->cfs_bandwidth.quota;
7798 return tg_set_cfs_bandwidth(tg, period, quota);
7801 long tg_get_cfs_period(struct task_group *tg)
7805 cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period);
7806 do_div(cfs_period_us, NSEC_PER_USEC);
7808 return cfs_period_us;
7811 static s64 cpu_cfs_quota_read_s64(struct cgroup *cgrp, struct cftype *cft)
7813 return tg_get_cfs_quota(cgroup_tg(cgrp));
7816 static int cpu_cfs_quota_write_s64(struct cgroup *cgrp, struct cftype *cftype,
7819 return tg_set_cfs_quota(cgroup_tg(cgrp), cfs_quota_us);
7822 static u64 cpu_cfs_period_read_u64(struct cgroup *cgrp, struct cftype *cft)
7824 return tg_get_cfs_period(cgroup_tg(cgrp));
7827 static int cpu_cfs_period_write_u64(struct cgroup *cgrp, struct cftype *cftype,
7830 return tg_set_cfs_period(cgroup_tg(cgrp), cfs_period_us);
7833 struct cfs_schedulable_data {
7834 struct task_group *tg;
7839 * normalize group quota/period to be quota/max_period
7840 * note: units are usecs
7842 static u64 normalize_cfs_quota(struct task_group *tg,
7843 struct cfs_schedulable_data *d)
7851 period = tg_get_cfs_period(tg);
7852 quota = tg_get_cfs_quota(tg);
7855 /* note: these should typically be equivalent */
7856 if (quota == RUNTIME_INF || quota == -1)
7859 return to_ratio(period, quota);
7862 static int tg_cfs_schedulable_down(struct task_group *tg, void *data)
7864 struct cfs_schedulable_data *d = data;
7865 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7866 s64 quota = 0, parent_quota = -1;
7869 quota = RUNTIME_INF;
7871 struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth;
7873 quota = normalize_cfs_quota(tg, d);
7874 parent_quota = parent_b->hierarchal_quota;
7877 * ensure max(child_quota) <= parent_quota, inherit when no
7880 if (quota == RUNTIME_INF)
7881 quota = parent_quota;
7882 else if (parent_quota != RUNTIME_INF && quota > parent_quota)
7885 cfs_b->hierarchal_quota = quota;
7890 static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota)
7893 struct cfs_schedulable_data data = {
7899 if (quota != RUNTIME_INF) {
7900 do_div(data.period, NSEC_PER_USEC);
7901 do_div(data.quota, NSEC_PER_USEC);
7905 ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data);
7911 static int cpu_stats_show(struct cgroup *cgrp, struct cftype *cft,
7912 struct cgroup_map_cb *cb)
7914 struct task_group *tg = cgroup_tg(cgrp);
7915 struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth;
7917 cb->fill(cb, "nr_periods", cfs_b->nr_periods);
7918 cb->fill(cb, "nr_throttled", cfs_b->nr_throttled);
7919 cb->fill(cb, "throttled_time", cfs_b->throttled_time);
7923 #endif /* CONFIG_CFS_BANDWIDTH */
7924 #endif /* CONFIG_FAIR_GROUP_SCHED */
7926 #ifdef CONFIG_RT_GROUP_SCHED
7927 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
7930 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
7933 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
7935 return sched_group_rt_runtime(cgroup_tg(cgrp));
7938 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
7941 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
7944 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
7946 return sched_group_rt_period(cgroup_tg(cgrp));
7948 #endif /* CONFIG_RT_GROUP_SCHED */
7950 static struct cftype cpu_files[] = {
7951 #ifdef CONFIG_FAIR_GROUP_SCHED
7954 .read_u64 = cpu_shares_read_u64,
7955 .write_u64 = cpu_shares_write_u64,
7958 #ifdef CONFIG_CFS_BANDWIDTH
7960 .name = "cfs_quota_us",
7961 .read_s64 = cpu_cfs_quota_read_s64,
7962 .write_s64 = cpu_cfs_quota_write_s64,
7965 .name = "cfs_period_us",
7966 .read_u64 = cpu_cfs_period_read_u64,
7967 .write_u64 = cpu_cfs_period_write_u64,
7971 .read_map = cpu_stats_show,
7974 #ifdef CONFIG_RT_GROUP_SCHED
7976 .name = "rt_runtime_us",
7977 .read_s64 = cpu_rt_runtime_read,
7978 .write_s64 = cpu_rt_runtime_write,
7981 .name = "rt_period_us",
7982 .read_u64 = cpu_rt_period_read_uint,
7983 .write_u64 = cpu_rt_period_write_uint,
7988 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
7990 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
7993 struct cgroup_subsys cpu_cgroup_subsys = {
7995 .create = cpu_cgroup_create,
7996 .destroy = cpu_cgroup_destroy,
7997 .can_attach = cpu_cgroup_can_attach,
7998 .attach = cpu_cgroup_attach,
7999 .exit = cpu_cgroup_exit,
8000 .populate = cpu_cgroup_populate,
8001 .subsys_id = cpu_cgroup_subsys_id,
8005 #endif /* CONFIG_CGROUP_SCHED */
8007 #ifdef CONFIG_CGROUP_CPUACCT
8010 * CPU accounting code for task groups.
8012 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
8013 * (balbir@in.ibm.com).
8016 /* create a new cpu accounting group */
8017 static struct cgroup_subsys_state *cpuacct_create(struct cgroup *cgrp)
8022 return &root_cpuacct.css;
8024 ca = kzalloc(sizeof(*ca), GFP_KERNEL);
8028 ca->cpuusage = alloc_percpu(u64);
8032 ca->cpustat = alloc_percpu(struct kernel_cpustat);
8034 goto out_free_cpuusage;
8039 free_percpu(ca->cpuusage);
8043 return ERR_PTR(-ENOMEM);
8046 /* destroy an existing cpu accounting group */
8047 static void cpuacct_destroy(struct cgroup *cgrp)
8049 struct cpuacct *ca = cgroup_ca(cgrp);
8051 free_percpu(ca->cpustat);
8052 free_percpu(ca->cpuusage);
8056 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
8058 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8061 #ifndef CONFIG_64BIT
8063 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
8065 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8067 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8075 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
8077 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8079 #ifndef CONFIG_64BIT
8081 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
8083 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8085 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8091 /* return total cpu usage (in nanoseconds) of a group */
8092 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
8094 struct cpuacct *ca = cgroup_ca(cgrp);
8095 u64 totalcpuusage = 0;
8098 for_each_present_cpu(i)
8099 totalcpuusage += cpuacct_cpuusage_read(ca, i);
8101 return totalcpuusage;
8104 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
8107 struct cpuacct *ca = cgroup_ca(cgrp);
8116 for_each_present_cpu(i)
8117 cpuacct_cpuusage_write(ca, i, 0);
8123 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
8126 struct cpuacct *ca = cgroup_ca(cgroup);
8130 for_each_present_cpu(i) {
8131 percpu = cpuacct_cpuusage_read(ca, i);
8132 seq_printf(m, "%llu ", (unsigned long long) percpu);
8134 seq_printf(m, "\n");
8138 static const char *cpuacct_stat_desc[] = {
8139 [CPUACCT_STAT_USER] = "user",
8140 [CPUACCT_STAT_SYSTEM] = "system",
8143 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
8144 struct cgroup_map_cb *cb)
8146 struct cpuacct *ca = cgroup_ca(cgrp);
8150 for_each_online_cpu(cpu) {
8151 struct kernel_cpustat *kcpustat = per_cpu_ptr(ca->cpustat, cpu);
8152 val += kcpustat->cpustat[CPUTIME_USER];
8153 val += kcpustat->cpustat[CPUTIME_NICE];
8155 val = cputime64_to_clock_t(val);
8156 cb->fill(cb, cpuacct_stat_desc[CPUACCT_STAT_USER], val);
8159 for_each_online_cpu(cpu) {
8160 struct kernel_cpustat *kcpustat = per_cpu_ptr(ca->cpustat, cpu);
8161 val += kcpustat->cpustat[CPUTIME_SYSTEM];
8162 val += kcpustat->cpustat[CPUTIME_IRQ];
8163 val += kcpustat->cpustat[CPUTIME_SOFTIRQ];
8166 val = cputime64_to_clock_t(val);
8167 cb->fill(cb, cpuacct_stat_desc[CPUACCT_STAT_SYSTEM], val);
8172 static struct cftype files[] = {
8175 .read_u64 = cpuusage_read,
8176 .write_u64 = cpuusage_write,
8179 .name = "usage_percpu",
8180 .read_seq_string = cpuacct_percpu_seq_read,
8184 .read_map = cpuacct_stats_show,
8188 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
8190 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
8194 * charge this task's execution time to its accounting group.
8196 * called with rq->lock held.
8198 void cpuacct_charge(struct task_struct *tsk, u64 cputime)
8203 if (unlikely(!cpuacct_subsys.active))
8206 cpu = task_cpu(tsk);
8212 for (; ca; ca = parent_ca(ca)) {
8213 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8214 *cpuusage += cputime;
8220 struct cgroup_subsys cpuacct_subsys = {
8222 .create = cpuacct_create,
8223 .destroy = cpuacct_destroy,
8224 .populate = cpuacct_populate,
8225 .subsys_id = cpuacct_subsys_id,
8227 #endif /* CONFIG_CGROUP_CPUACCT */