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 <linux/smp_lock.h>
36 #include <asm/mmu_context.h>
37 #include <linux/interrupt.h>
38 #include <linux/capability.h>
39 #include <linux/completion.h>
40 #include <linux/kernel_stat.h>
41 #include <linux/debug_locks.h>
42 #include <linux/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/kthread.h>
58 #include <linux/proc_fs.h>
59 #include <linux/seq_file.h>
60 #include <linux/sysctl.h>
61 #include <linux/syscalls.h>
62 #include <linux/times.h>
63 #include <linux/tsacct_kern.h>
64 #include <linux/kprobes.h>
65 #include <linux/delayacct.h>
66 #include <linux/reciprocal_div.h>
67 #include <linux/unistd.h>
68 #include <linux/pagemap.h>
69 #include <linux/hrtimer.h>
70 #include <linux/tick.h>
71 #include <linux/bootmem.h>
72 #include <linux/debugfs.h>
73 #include <linux/ctype.h>
74 #include <linux/ftrace.h>
75 #include <trace/sched.h>
78 #include <asm/irq_regs.h>
80 #include "sched_cpupri.h"
83 * Convert user-nice values [ -20 ... 0 ... 19 ]
84 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
87 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
88 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
89 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
92 * 'User priority' is the nice value converted to something we
93 * can work with better when scaling various scheduler parameters,
94 * it's a [ 0 ... 39 ] range.
96 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
97 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
98 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
101 * Helpers for converting nanosecond timing to jiffy resolution
103 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
105 #define NICE_0_LOAD SCHED_LOAD_SCALE
106 #define NICE_0_SHIFT SCHED_LOAD_SHIFT
109 * These are the 'tuning knobs' of the scheduler:
111 * default timeslice is 100 msecs (used only for SCHED_RR tasks).
112 * Timeslices get refilled after they expire.
114 #define DEF_TIMESLICE (100 * HZ / 1000)
117 * single value that denotes runtime == period, ie unlimited time.
119 #define RUNTIME_INF ((u64)~0ULL)
121 DEFINE_TRACE(sched_wait_task);
122 DEFINE_TRACE(sched_wakeup);
123 DEFINE_TRACE(sched_wakeup_new);
124 DEFINE_TRACE(sched_switch);
125 DEFINE_TRACE(sched_migrate_task);
129 * Divide a load by a sched group cpu_power : (load / sg->__cpu_power)
130 * Since cpu_power is a 'constant', we can use a reciprocal divide.
132 static inline u32 sg_div_cpu_power(const struct sched_group *sg, u32 load)
134 return reciprocal_divide(load, sg->reciprocal_cpu_power);
138 * Each time a sched group cpu_power is changed,
139 * we must compute its reciprocal value
141 static inline void sg_inc_cpu_power(struct sched_group *sg, u32 val)
143 sg->__cpu_power += val;
144 sg->reciprocal_cpu_power = reciprocal_value(sg->__cpu_power);
148 static inline int rt_policy(int policy)
150 if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR))
155 static inline int task_has_rt_policy(struct task_struct *p)
157 return rt_policy(p->policy);
161 * This is the priority-queue data structure of the RT scheduling class:
163 struct rt_prio_array {
164 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
165 struct list_head queue[MAX_RT_PRIO];
168 struct rt_bandwidth {
169 /* nests inside the rq lock: */
170 spinlock_t rt_runtime_lock;
173 struct hrtimer rt_period_timer;
176 static struct rt_bandwidth def_rt_bandwidth;
178 static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun);
180 static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer)
182 struct rt_bandwidth *rt_b =
183 container_of(timer, struct rt_bandwidth, rt_period_timer);
189 now = hrtimer_cb_get_time(timer);
190 overrun = hrtimer_forward(timer, now, rt_b->rt_period);
195 idle = do_sched_rt_period_timer(rt_b, overrun);
198 return idle ? HRTIMER_NORESTART : HRTIMER_RESTART;
202 void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime)
204 rt_b->rt_period = ns_to_ktime(period);
205 rt_b->rt_runtime = runtime;
207 spin_lock_init(&rt_b->rt_runtime_lock);
209 hrtimer_init(&rt_b->rt_period_timer,
210 CLOCK_MONOTONIC, HRTIMER_MODE_REL);
211 rt_b->rt_period_timer.function = sched_rt_period_timer;
212 rt_b->rt_period_timer.cb_mode = HRTIMER_CB_IRQSAFE_UNLOCKED;
215 static inline int rt_bandwidth_enabled(void)
217 return sysctl_sched_rt_runtime >= 0;
220 static void start_rt_bandwidth(struct rt_bandwidth *rt_b)
224 if (rt_bandwidth_enabled() && rt_b->rt_runtime == RUNTIME_INF)
227 if (hrtimer_active(&rt_b->rt_period_timer))
230 spin_lock(&rt_b->rt_runtime_lock);
232 if (hrtimer_active(&rt_b->rt_period_timer))
235 now = hrtimer_cb_get_time(&rt_b->rt_period_timer);
236 hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period);
237 hrtimer_start_expires(&rt_b->rt_period_timer,
240 spin_unlock(&rt_b->rt_runtime_lock);
243 #ifdef CONFIG_RT_GROUP_SCHED
244 static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b)
246 hrtimer_cancel(&rt_b->rt_period_timer);
251 * sched_domains_mutex serializes calls to arch_init_sched_domains,
252 * detach_destroy_domains and partition_sched_domains.
254 static DEFINE_MUTEX(sched_domains_mutex);
256 #ifdef CONFIG_GROUP_SCHED
258 #include <linux/cgroup.h>
262 static LIST_HEAD(task_groups);
264 /* task group related information */
266 #ifdef CONFIG_CGROUP_SCHED
267 struct cgroup_subsys_state css;
270 #ifdef CONFIG_FAIR_GROUP_SCHED
271 /* schedulable entities of this group on each cpu */
272 struct sched_entity **se;
273 /* runqueue "owned" by this group on each cpu */
274 struct cfs_rq **cfs_rq;
275 unsigned long shares;
278 #ifdef CONFIG_RT_GROUP_SCHED
279 struct sched_rt_entity **rt_se;
280 struct rt_rq **rt_rq;
282 struct rt_bandwidth rt_bandwidth;
286 struct list_head list;
288 struct task_group *parent;
289 struct list_head siblings;
290 struct list_head children;
293 #ifdef CONFIG_USER_SCHED
297 * Every UID task group (including init_task_group aka UID-0) will
298 * be a child to this group.
300 struct task_group root_task_group;
302 #ifdef CONFIG_FAIR_GROUP_SCHED
303 /* Default task group's sched entity on each cpu */
304 static DEFINE_PER_CPU(struct sched_entity, init_sched_entity);
305 /* Default task group's cfs_rq on each cpu */
306 static DEFINE_PER_CPU(struct cfs_rq, init_cfs_rq) ____cacheline_aligned_in_smp;
307 #endif /* CONFIG_FAIR_GROUP_SCHED */
309 #ifdef CONFIG_RT_GROUP_SCHED
310 static DEFINE_PER_CPU(struct sched_rt_entity, init_sched_rt_entity);
311 static DEFINE_PER_CPU(struct rt_rq, init_rt_rq) ____cacheline_aligned_in_smp;
312 #endif /* CONFIG_RT_GROUP_SCHED */
313 #else /* !CONFIG_USER_SCHED */
314 #define root_task_group init_task_group
315 #endif /* CONFIG_USER_SCHED */
317 /* task_group_lock serializes add/remove of task groups and also changes to
318 * a task group's cpu shares.
320 static DEFINE_SPINLOCK(task_group_lock);
322 #ifdef CONFIG_FAIR_GROUP_SCHED
323 #ifdef CONFIG_USER_SCHED
324 # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD)
325 #else /* !CONFIG_USER_SCHED */
326 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
327 #endif /* CONFIG_USER_SCHED */
330 * A weight of 0 or 1 can cause arithmetics problems.
331 * A weight of a cfs_rq is the sum of weights of which entities
332 * are queued on this cfs_rq, so a weight of a entity should not be
333 * too large, so as the shares value of a task group.
334 * (The default weight is 1024 - so there's no practical
335 * limitation from this.)
338 #define MAX_SHARES (1UL << 18)
340 static int init_task_group_load = INIT_TASK_GROUP_LOAD;
343 /* Default task group.
344 * Every task in system belong to this group at bootup.
346 struct task_group init_task_group;
348 /* return group to which a task belongs */
349 static inline struct task_group *task_group(struct task_struct *p)
351 struct task_group *tg;
353 #ifdef CONFIG_USER_SCHED
355 #elif defined(CONFIG_CGROUP_SCHED)
356 tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id),
357 struct task_group, css);
359 tg = &init_task_group;
364 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
365 static inline void set_task_rq(struct task_struct *p, unsigned int cpu)
367 #ifdef CONFIG_FAIR_GROUP_SCHED
368 p->se.cfs_rq = task_group(p)->cfs_rq[cpu];
369 p->se.parent = task_group(p)->se[cpu];
372 #ifdef CONFIG_RT_GROUP_SCHED
373 p->rt.rt_rq = task_group(p)->rt_rq[cpu];
374 p->rt.parent = task_group(p)->rt_se[cpu];
380 static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { }
381 static inline struct task_group *task_group(struct task_struct *p)
386 #endif /* CONFIG_GROUP_SCHED */
388 /* CFS-related fields in a runqueue */
390 struct load_weight load;
391 unsigned long nr_running;
396 struct rb_root tasks_timeline;
397 struct rb_node *rb_leftmost;
399 struct list_head tasks;
400 struct list_head *balance_iterator;
403 * 'curr' points to currently running entity on this cfs_rq.
404 * It is set to NULL otherwise (i.e when none are currently running).
406 struct sched_entity *curr, *next, *last;
408 unsigned int nr_spread_over;
410 #ifdef CONFIG_FAIR_GROUP_SCHED
411 struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */
414 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
415 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
416 * (like users, containers etc.)
418 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
419 * list is used during load balance.
421 struct list_head leaf_cfs_rq_list;
422 struct task_group *tg; /* group that "owns" this runqueue */
426 * the part of load.weight contributed by tasks
428 unsigned long task_weight;
431 * h_load = weight * f(tg)
433 * Where f(tg) is the recursive weight fraction assigned to
436 unsigned long h_load;
439 * this cpu's part of tg->shares
441 unsigned long shares;
444 * load.weight at the time we set shares
446 unsigned long rq_weight;
451 /* Real-Time classes' related field in a runqueue: */
453 struct rt_prio_array active;
454 unsigned long rt_nr_running;
455 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
456 int highest_prio; /* highest queued rt task prio */
459 unsigned long rt_nr_migratory;
465 /* Nests inside the rq lock: */
466 spinlock_t rt_runtime_lock;
468 #ifdef CONFIG_RT_GROUP_SCHED
469 unsigned long rt_nr_boosted;
472 struct list_head leaf_rt_rq_list;
473 struct task_group *tg;
474 struct sched_rt_entity *rt_se;
481 * We add the notion of a root-domain which will be used to define per-domain
482 * variables. Each exclusive cpuset essentially defines an island domain by
483 * fully partitioning the member cpus from any other cpuset. Whenever a new
484 * exclusive cpuset is created, we also create and attach a new root-domain
491 cpumask_var_t online;
494 * The "RT overload" flag: it gets set if a CPU has more than
495 * one runnable RT task.
497 cpumask_var_t rto_mask;
500 struct cpupri cpupri;
505 * By default the system creates a single root-domain with all cpus as
506 * members (mimicking the global state we have today).
508 static struct root_domain def_root_domain;
513 * This is the main, per-CPU runqueue data structure.
515 * Locking rule: those places that want to lock multiple runqueues
516 * (such as the load balancing or the thread migration code), lock
517 * acquire operations must be ordered by ascending &runqueue.
524 * nr_running and cpu_load should be in the same cacheline because
525 * remote CPUs use both these fields when doing load calculation.
527 unsigned long nr_running;
528 #define CPU_LOAD_IDX_MAX 5
529 unsigned long cpu_load[CPU_LOAD_IDX_MAX];
530 unsigned char idle_at_tick;
532 unsigned long last_tick_seen;
533 unsigned char in_nohz_recently;
535 /* capture load from *all* tasks on this cpu: */
536 struct load_weight load;
537 unsigned long nr_load_updates;
543 #ifdef CONFIG_FAIR_GROUP_SCHED
544 /* list of leaf cfs_rq on this cpu: */
545 struct list_head leaf_cfs_rq_list;
547 #ifdef CONFIG_RT_GROUP_SCHED
548 struct list_head leaf_rt_rq_list;
552 * This is part of a global counter where only the total sum
553 * over all CPUs matters. A task can increase this counter on
554 * one CPU and if it got migrated afterwards it may decrease
555 * it on another CPU. Always updated under the runqueue lock:
557 unsigned long nr_uninterruptible;
559 struct task_struct *curr, *idle;
560 unsigned long next_balance;
561 struct mm_struct *prev_mm;
568 struct root_domain *rd;
569 struct sched_domain *sd;
571 /* For active balancing */
574 /* cpu of this runqueue: */
578 unsigned long avg_load_per_task;
580 struct task_struct *migration_thread;
581 struct list_head migration_queue;
584 #ifdef CONFIG_SCHED_HRTICK
586 int hrtick_csd_pending;
587 struct call_single_data hrtick_csd;
589 struct hrtimer hrtick_timer;
592 #ifdef CONFIG_SCHEDSTATS
594 struct sched_info rq_sched_info;
596 /* sys_sched_yield() stats */
597 unsigned int yld_exp_empty;
598 unsigned int yld_act_empty;
599 unsigned int yld_both_empty;
600 unsigned int yld_count;
602 /* schedule() stats */
603 unsigned int sched_switch;
604 unsigned int sched_count;
605 unsigned int sched_goidle;
607 /* try_to_wake_up() stats */
608 unsigned int ttwu_count;
609 unsigned int ttwu_local;
612 unsigned int bkl_count;
616 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
618 static inline void check_preempt_curr(struct rq *rq, struct task_struct *p, int sync)
620 rq->curr->sched_class->check_preempt_curr(rq, p, sync);
623 static inline int cpu_of(struct rq *rq)
633 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
634 * See detach_destroy_domains: synchronize_sched for details.
636 * The domain tree of any CPU may only be accessed from within
637 * preempt-disabled sections.
639 #define for_each_domain(cpu, __sd) \
640 for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
642 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
643 #define this_rq() (&__get_cpu_var(runqueues))
644 #define task_rq(p) cpu_rq(task_cpu(p))
645 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
647 static inline void update_rq_clock(struct rq *rq)
649 rq->clock = sched_clock_cpu(cpu_of(rq));
653 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
655 #ifdef CONFIG_SCHED_DEBUG
656 # define const_debug __read_mostly
658 # define const_debug static const
664 * Returns true if the current cpu runqueue is locked.
665 * This interface allows printk to be called with the runqueue lock
666 * held and know whether or not it is OK to wake up the klogd.
668 int runqueue_is_locked(void)
671 struct rq *rq = cpu_rq(cpu);
674 ret = spin_is_locked(&rq->lock);
680 * Debugging: various feature bits
683 #define SCHED_FEAT(name, enabled) \
684 __SCHED_FEAT_##name ,
687 #include "sched_features.h"
692 #define SCHED_FEAT(name, enabled) \
693 (1UL << __SCHED_FEAT_##name) * enabled |
695 const_debug unsigned int sysctl_sched_features =
696 #include "sched_features.h"
701 #ifdef CONFIG_SCHED_DEBUG
702 #define SCHED_FEAT(name, enabled) \
705 static __read_mostly char *sched_feat_names[] = {
706 #include "sched_features.h"
712 static int sched_feat_show(struct seq_file *m, void *v)
716 for (i = 0; sched_feat_names[i]; i++) {
717 if (!(sysctl_sched_features & (1UL << i)))
719 seq_printf(m, "%s ", sched_feat_names[i]);
727 sched_feat_write(struct file *filp, const char __user *ubuf,
728 size_t cnt, loff_t *ppos)
738 if (copy_from_user(&buf, ubuf, cnt))
743 if (strncmp(buf, "NO_", 3) == 0) {
748 for (i = 0; sched_feat_names[i]; i++) {
749 int len = strlen(sched_feat_names[i]);
751 if (strncmp(cmp, sched_feat_names[i], len) == 0) {
753 sysctl_sched_features &= ~(1UL << i);
755 sysctl_sched_features |= (1UL << i);
760 if (!sched_feat_names[i])
768 static int sched_feat_open(struct inode *inode, struct file *filp)
770 return single_open(filp, sched_feat_show, NULL);
773 static struct file_operations sched_feat_fops = {
774 .open = sched_feat_open,
775 .write = sched_feat_write,
778 .release = single_release,
781 static __init int sched_init_debug(void)
783 debugfs_create_file("sched_features", 0644, NULL, NULL,
788 late_initcall(sched_init_debug);
792 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
795 * Number of tasks to iterate in a single balance run.
796 * Limited because this is done with IRQs disabled.
798 const_debug unsigned int sysctl_sched_nr_migrate = 32;
801 * ratelimit for updating the group shares.
804 unsigned int sysctl_sched_shares_ratelimit = 250000;
807 * Inject some fuzzyness into changing the per-cpu group shares
808 * this avoids remote rq-locks at the expense of fairness.
811 unsigned int sysctl_sched_shares_thresh = 4;
814 * period over which we measure -rt task cpu usage in us.
817 unsigned int sysctl_sched_rt_period = 1000000;
819 static __read_mostly int scheduler_running;
822 * part of the period that we allow rt tasks to run in us.
825 int sysctl_sched_rt_runtime = 950000;
827 static inline u64 global_rt_period(void)
829 return (u64)sysctl_sched_rt_period * NSEC_PER_USEC;
832 static inline u64 global_rt_runtime(void)
834 if (sysctl_sched_rt_runtime < 0)
837 return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC;
840 #ifndef prepare_arch_switch
841 # define prepare_arch_switch(next) do { } while (0)
843 #ifndef finish_arch_switch
844 # define finish_arch_switch(prev) do { } while (0)
847 static inline int task_current(struct rq *rq, struct task_struct *p)
849 return rq->curr == p;
852 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
853 static inline int task_running(struct rq *rq, struct task_struct *p)
855 return task_current(rq, p);
858 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
862 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
864 #ifdef CONFIG_DEBUG_SPINLOCK
865 /* this is a valid case when another task releases the spinlock */
866 rq->lock.owner = current;
869 * If we are tracking spinlock dependencies then we have to
870 * fix up the runqueue lock - which gets 'carried over' from
873 spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_);
875 spin_unlock_irq(&rq->lock);
878 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
879 static inline int task_running(struct rq *rq, struct task_struct *p)
884 return task_current(rq, p);
888 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
892 * We can optimise this out completely for !SMP, because the
893 * SMP rebalancing from interrupt is the only thing that cares
898 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
899 spin_unlock_irq(&rq->lock);
901 spin_unlock(&rq->lock);
905 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
909 * After ->oncpu is cleared, the task can be moved to a different CPU.
910 * We must ensure this doesn't happen until the switch is completely
916 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
920 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
923 * __task_rq_lock - lock the runqueue a given task resides on.
924 * Must be called interrupts disabled.
926 static inline struct rq *__task_rq_lock(struct task_struct *p)
930 struct rq *rq = task_rq(p);
931 spin_lock(&rq->lock);
932 if (likely(rq == task_rq(p)))
934 spin_unlock(&rq->lock);
939 * task_rq_lock - lock the runqueue a given task resides on and disable
940 * interrupts. Note the ordering: we can safely lookup the task_rq without
941 * explicitly disabling preemption.
943 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
949 local_irq_save(*flags);
951 spin_lock(&rq->lock);
952 if (likely(rq == task_rq(p)))
954 spin_unlock_irqrestore(&rq->lock, *flags);
958 void task_rq_unlock_wait(struct task_struct *p)
960 struct rq *rq = task_rq(p);
962 smp_mb(); /* spin-unlock-wait is not a full memory barrier */
963 spin_unlock_wait(&rq->lock);
966 static void __task_rq_unlock(struct rq *rq)
969 spin_unlock(&rq->lock);
972 static inline void task_rq_unlock(struct rq *rq, unsigned long *flags)
975 spin_unlock_irqrestore(&rq->lock, *flags);
979 * this_rq_lock - lock this runqueue and disable interrupts.
981 static struct rq *this_rq_lock(void)
988 spin_lock(&rq->lock);
993 #ifdef CONFIG_SCHED_HRTICK
995 * Use HR-timers to deliver accurate preemption points.
997 * Its all a bit involved since we cannot program an hrt while holding the
998 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1001 * When we get rescheduled we reprogram the hrtick_timer outside of the
1007 * - enabled by features
1008 * - hrtimer is actually high res
1010 static inline int hrtick_enabled(struct rq *rq)
1012 if (!sched_feat(HRTICK))
1014 if (!cpu_active(cpu_of(rq)))
1016 return hrtimer_is_hres_active(&rq->hrtick_timer);
1019 static void hrtick_clear(struct rq *rq)
1021 if (hrtimer_active(&rq->hrtick_timer))
1022 hrtimer_cancel(&rq->hrtick_timer);
1026 * High-resolution timer tick.
1027 * Runs from hardirq context with interrupts disabled.
1029 static enum hrtimer_restart hrtick(struct hrtimer *timer)
1031 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
1033 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
1035 spin_lock(&rq->lock);
1036 update_rq_clock(rq);
1037 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
1038 spin_unlock(&rq->lock);
1040 return HRTIMER_NORESTART;
1045 * called from hardirq (IPI) context
1047 static void __hrtick_start(void *arg)
1049 struct rq *rq = arg;
1051 spin_lock(&rq->lock);
1052 hrtimer_restart(&rq->hrtick_timer);
1053 rq->hrtick_csd_pending = 0;
1054 spin_unlock(&rq->lock);
1058 * Called to set the hrtick timer state.
1060 * called with rq->lock held and irqs disabled
1062 static void hrtick_start(struct rq *rq, u64 delay)
1064 struct hrtimer *timer = &rq->hrtick_timer;
1065 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
1067 hrtimer_set_expires(timer, time);
1069 if (rq == this_rq()) {
1070 hrtimer_restart(timer);
1071 } else if (!rq->hrtick_csd_pending) {
1072 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd);
1073 rq->hrtick_csd_pending = 1;
1078 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
1080 int cpu = (int)(long)hcpu;
1083 case CPU_UP_CANCELED:
1084 case CPU_UP_CANCELED_FROZEN:
1085 case CPU_DOWN_PREPARE:
1086 case CPU_DOWN_PREPARE_FROZEN:
1088 case CPU_DEAD_FROZEN:
1089 hrtick_clear(cpu_rq(cpu));
1096 static __init void init_hrtick(void)
1098 hotcpu_notifier(hotplug_hrtick, 0);
1102 * Called to set the hrtick timer state.
1104 * called with rq->lock held and irqs disabled
1106 static void hrtick_start(struct rq *rq, u64 delay)
1108 hrtimer_start(&rq->hrtick_timer, ns_to_ktime(delay), HRTIMER_MODE_REL);
1111 static inline void init_hrtick(void)
1114 #endif /* CONFIG_SMP */
1116 static void init_rq_hrtick(struct rq *rq)
1119 rq->hrtick_csd_pending = 0;
1121 rq->hrtick_csd.flags = 0;
1122 rq->hrtick_csd.func = __hrtick_start;
1123 rq->hrtick_csd.info = rq;
1126 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1127 rq->hrtick_timer.function = hrtick;
1128 rq->hrtick_timer.cb_mode = HRTIMER_CB_IRQSAFE_PERCPU;
1130 #else /* CONFIG_SCHED_HRTICK */
1131 static inline void hrtick_clear(struct rq *rq)
1135 static inline void init_rq_hrtick(struct rq *rq)
1139 static inline void init_hrtick(void)
1142 #endif /* CONFIG_SCHED_HRTICK */
1145 * resched_task - mark a task 'to be rescheduled now'.
1147 * On UP this means the setting of the need_resched flag, on SMP it
1148 * might also involve a cross-CPU call to trigger the scheduler on
1153 #ifndef tsk_is_polling
1154 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1157 static void resched_task(struct task_struct *p)
1161 assert_spin_locked(&task_rq(p)->lock);
1163 if (unlikely(test_tsk_thread_flag(p, TIF_NEED_RESCHED)))
1166 set_tsk_thread_flag(p, TIF_NEED_RESCHED);
1169 if (cpu == smp_processor_id())
1172 /* NEED_RESCHED must be visible before we test polling */
1174 if (!tsk_is_polling(p))
1175 smp_send_reschedule(cpu);
1178 static void resched_cpu(int cpu)
1180 struct rq *rq = cpu_rq(cpu);
1181 unsigned long flags;
1183 if (!spin_trylock_irqsave(&rq->lock, flags))
1185 resched_task(cpu_curr(cpu));
1186 spin_unlock_irqrestore(&rq->lock, flags);
1191 * When add_timer_on() enqueues a timer into the timer wheel of an
1192 * idle CPU then this timer might expire before the next timer event
1193 * which is scheduled to wake up that CPU. In case of a completely
1194 * idle system the next event might even be infinite time into the
1195 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1196 * leaves the inner idle loop so the newly added timer is taken into
1197 * account when the CPU goes back to idle and evaluates the timer
1198 * wheel for the next timer event.
1200 void wake_up_idle_cpu(int cpu)
1202 struct rq *rq = cpu_rq(cpu);
1204 if (cpu == smp_processor_id())
1208 * This is safe, as this function is called with the timer
1209 * wheel base lock of (cpu) held. When the CPU is on the way
1210 * to idle and has not yet set rq->curr to idle then it will
1211 * be serialized on the timer wheel base lock and take the new
1212 * timer into account automatically.
1214 if (rq->curr != rq->idle)
1218 * We can set TIF_RESCHED on the idle task of the other CPU
1219 * lockless. The worst case is that the other CPU runs the
1220 * idle task through an additional NOOP schedule()
1222 set_tsk_thread_flag(rq->idle, TIF_NEED_RESCHED);
1224 /* NEED_RESCHED must be visible before we test polling */
1226 if (!tsk_is_polling(rq->idle))
1227 smp_send_reschedule(cpu);
1229 #endif /* CONFIG_NO_HZ */
1231 #else /* !CONFIG_SMP */
1232 static void resched_task(struct task_struct *p)
1234 assert_spin_locked(&task_rq(p)->lock);
1235 set_tsk_need_resched(p);
1237 #endif /* CONFIG_SMP */
1239 #if BITS_PER_LONG == 32
1240 # define WMULT_CONST (~0UL)
1242 # define WMULT_CONST (1UL << 32)
1245 #define WMULT_SHIFT 32
1248 * Shift right and round:
1250 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1253 * delta *= weight / lw
1255 static unsigned long
1256 calc_delta_mine(unsigned long delta_exec, unsigned long weight,
1257 struct load_weight *lw)
1261 if (!lw->inv_weight) {
1262 if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST))
1265 lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2)
1269 tmp = (u64)delta_exec * weight;
1271 * Check whether we'd overflow the 64-bit multiplication:
1273 if (unlikely(tmp > WMULT_CONST))
1274 tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight,
1277 tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT);
1279 return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX);
1282 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
1288 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
1295 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1296 * of tasks with abnormal "nice" values across CPUs the contribution that
1297 * each task makes to its run queue's load is weighted according to its
1298 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1299 * scaled version of the new time slice allocation that they receive on time
1303 #define WEIGHT_IDLEPRIO 2
1304 #define WMULT_IDLEPRIO (1 << 31)
1307 * Nice levels are multiplicative, with a gentle 10% change for every
1308 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1309 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1310 * that remained on nice 0.
1312 * The "10% effect" is relative and cumulative: from _any_ nice level,
1313 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1314 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1315 * If a task goes up by ~10% and another task goes down by ~10% then
1316 * the relative distance between them is ~25%.)
1318 static const int prio_to_weight[40] = {
1319 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1320 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1321 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1322 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1323 /* 0 */ 1024, 820, 655, 526, 423,
1324 /* 5 */ 335, 272, 215, 172, 137,
1325 /* 10 */ 110, 87, 70, 56, 45,
1326 /* 15 */ 36, 29, 23, 18, 15,
1330 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1332 * In cases where the weight does not change often, we can use the
1333 * precalculated inverse to speed up arithmetics by turning divisions
1334 * into multiplications:
1336 static const u32 prio_to_wmult[40] = {
1337 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1338 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1339 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1340 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1341 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1342 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1343 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1344 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1347 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup);
1350 * runqueue iterator, to support SMP load-balancing between different
1351 * scheduling classes, without having to expose their internal data
1352 * structures to the load-balancing proper:
1354 struct rq_iterator {
1356 struct task_struct *(*start)(void *);
1357 struct task_struct *(*next)(void *);
1361 static unsigned long
1362 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
1363 unsigned long max_load_move, struct sched_domain *sd,
1364 enum cpu_idle_type idle, int *all_pinned,
1365 int *this_best_prio, struct rq_iterator *iterator);
1368 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
1369 struct sched_domain *sd, enum cpu_idle_type idle,
1370 struct rq_iterator *iterator);
1373 #ifdef CONFIG_CGROUP_CPUACCT
1374 static void cpuacct_charge(struct task_struct *tsk, u64 cputime);
1376 static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {}
1379 static inline void inc_cpu_load(struct rq *rq, unsigned long load)
1381 update_load_add(&rq->load, load);
1384 static inline void dec_cpu_load(struct rq *rq, unsigned long load)
1386 update_load_sub(&rq->load, load);
1389 #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED)
1390 typedef int (*tg_visitor)(struct task_group *, void *);
1393 * Iterate the full tree, calling @down when first entering a node and @up when
1394 * leaving it for the final time.
1396 static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
1398 struct task_group *parent, *child;
1402 parent = &root_task_group;
1404 ret = (*down)(parent, data);
1407 list_for_each_entry_rcu(child, &parent->children, siblings) {
1414 ret = (*up)(parent, data);
1419 parent = parent->parent;
1428 static int tg_nop(struct task_group *tg, void *data)
1435 static unsigned long source_load(int cpu, int type);
1436 static unsigned long target_load(int cpu, int type);
1437 static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd);
1439 static unsigned long cpu_avg_load_per_task(int cpu)
1441 struct rq *rq = cpu_rq(cpu);
1444 rq->avg_load_per_task = rq->load.weight / rq->nr_running;
1446 rq->avg_load_per_task = 0;
1448 return rq->avg_load_per_task;
1451 #ifdef CONFIG_FAIR_GROUP_SCHED
1453 static void __set_se_shares(struct sched_entity *se, unsigned long shares);
1456 * Calculate and set the cpu's group shares.
1459 update_group_shares_cpu(struct task_group *tg, int cpu,
1460 unsigned long sd_shares, unsigned long sd_rq_weight)
1462 unsigned long shares;
1463 unsigned long rq_weight;
1468 rq_weight = tg->cfs_rq[cpu]->rq_weight;
1471 * \Sum shares * rq_weight
1472 * shares = -----------------------
1476 shares = (sd_shares * rq_weight) / sd_rq_weight;
1477 shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES);
1479 if (abs(shares - tg->se[cpu]->load.weight) >
1480 sysctl_sched_shares_thresh) {
1481 struct rq *rq = cpu_rq(cpu);
1482 unsigned long flags;
1484 spin_lock_irqsave(&rq->lock, flags);
1485 tg->cfs_rq[cpu]->shares = shares;
1487 __set_se_shares(tg->se[cpu], shares);
1488 spin_unlock_irqrestore(&rq->lock, flags);
1493 * Re-compute the task group their per cpu shares over the given domain.
1494 * This needs to be done in a bottom-up fashion because the rq weight of a
1495 * parent group depends on the shares of its child groups.
1497 static int tg_shares_up(struct task_group *tg, void *data)
1499 unsigned long weight, rq_weight = 0;
1500 unsigned long shares = 0;
1501 struct sched_domain *sd = data;
1504 for_each_cpu(i, sched_domain_span(sd)) {
1506 * If there are currently no tasks on the cpu pretend there
1507 * is one of average load so that when a new task gets to
1508 * run here it will not get delayed by group starvation.
1510 weight = tg->cfs_rq[i]->load.weight;
1512 weight = NICE_0_LOAD;
1514 tg->cfs_rq[i]->rq_weight = weight;
1515 rq_weight += weight;
1516 shares += tg->cfs_rq[i]->shares;
1519 if ((!shares && rq_weight) || shares > tg->shares)
1520 shares = tg->shares;
1522 if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE))
1523 shares = tg->shares;
1525 for_each_cpu(i, sched_domain_span(sd))
1526 update_group_shares_cpu(tg, i, shares, rq_weight);
1532 * Compute the cpu's hierarchical load factor for each task group.
1533 * This needs to be done in a top-down fashion because the load of a child
1534 * group is a fraction of its parents load.
1536 static int tg_load_down(struct task_group *tg, void *data)
1539 long cpu = (long)data;
1542 load = cpu_rq(cpu)->load.weight;
1544 load = tg->parent->cfs_rq[cpu]->h_load;
1545 load *= tg->cfs_rq[cpu]->shares;
1546 load /= tg->parent->cfs_rq[cpu]->load.weight + 1;
1549 tg->cfs_rq[cpu]->h_load = load;
1554 static void update_shares(struct sched_domain *sd)
1556 u64 now = cpu_clock(raw_smp_processor_id());
1557 s64 elapsed = now - sd->last_update;
1559 if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) {
1560 sd->last_update = now;
1561 walk_tg_tree(tg_nop, tg_shares_up, sd);
1565 static void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1567 spin_unlock(&rq->lock);
1569 spin_lock(&rq->lock);
1572 static void update_h_load(long cpu)
1574 walk_tg_tree(tg_load_down, tg_nop, (void *)cpu);
1579 static inline void update_shares(struct sched_domain *sd)
1583 static inline void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1591 #ifdef CONFIG_FAIR_GROUP_SCHED
1592 static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares)
1595 cfs_rq->shares = shares;
1600 #include "sched_stats.h"
1601 #include "sched_idletask.c"
1602 #include "sched_fair.c"
1603 #include "sched_rt.c"
1604 #ifdef CONFIG_SCHED_DEBUG
1605 # include "sched_debug.c"
1608 #define sched_class_highest (&rt_sched_class)
1609 #define for_each_class(class) \
1610 for (class = sched_class_highest; class; class = class->next)
1612 static void inc_nr_running(struct rq *rq)
1617 static void dec_nr_running(struct rq *rq)
1622 static void set_load_weight(struct task_struct *p)
1624 if (task_has_rt_policy(p)) {
1625 p->se.load.weight = prio_to_weight[0] * 2;
1626 p->se.load.inv_weight = prio_to_wmult[0] >> 1;
1631 * SCHED_IDLE tasks get minimal weight:
1633 if (p->policy == SCHED_IDLE) {
1634 p->se.load.weight = WEIGHT_IDLEPRIO;
1635 p->se.load.inv_weight = WMULT_IDLEPRIO;
1639 p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO];
1640 p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO];
1643 static void update_avg(u64 *avg, u64 sample)
1645 s64 diff = sample - *avg;
1649 static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup)
1651 sched_info_queued(p);
1652 p->sched_class->enqueue_task(rq, p, wakeup);
1656 static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep)
1658 if (sleep && p->se.last_wakeup) {
1659 update_avg(&p->se.avg_overlap,
1660 p->se.sum_exec_runtime - p->se.last_wakeup);
1661 p->se.last_wakeup = 0;
1664 sched_info_dequeued(p);
1665 p->sched_class->dequeue_task(rq, p, sleep);
1670 * __normal_prio - return the priority that is based on the static prio
1672 static inline int __normal_prio(struct task_struct *p)
1674 return p->static_prio;
1678 * Calculate the expected normal priority: i.e. priority
1679 * without taking RT-inheritance into account. Might be
1680 * boosted by interactivity modifiers. Changes upon fork,
1681 * setprio syscalls, and whenever the interactivity
1682 * estimator recalculates.
1684 static inline int normal_prio(struct task_struct *p)
1688 if (task_has_rt_policy(p))
1689 prio = MAX_RT_PRIO-1 - p->rt_priority;
1691 prio = __normal_prio(p);
1696 * Calculate the current priority, i.e. the priority
1697 * taken into account by the scheduler. This value might
1698 * be boosted by RT tasks, or might be boosted by
1699 * interactivity modifiers. Will be RT if the task got
1700 * RT-boosted. If not then it returns p->normal_prio.
1702 static int effective_prio(struct task_struct *p)
1704 p->normal_prio = normal_prio(p);
1706 * If we are RT tasks or we were boosted to RT priority,
1707 * keep the priority unchanged. Otherwise, update priority
1708 * to the normal priority:
1710 if (!rt_prio(p->prio))
1711 return p->normal_prio;
1716 * activate_task - move a task to the runqueue.
1718 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup)
1720 if (task_contributes_to_load(p))
1721 rq->nr_uninterruptible--;
1723 enqueue_task(rq, p, wakeup);
1728 * deactivate_task - remove a task from the runqueue.
1730 static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep)
1732 if (task_contributes_to_load(p))
1733 rq->nr_uninterruptible++;
1735 dequeue_task(rq, p, sleep);
1740 * task_curr - is this task currently executing on a CPU?
1741 * @p: the task in question.
1743 inline int task_curr(const struct task_struct *p)
1745 return cpu_curr(task_cpu(p)) == p;
1748 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1750 set_task_rq(p, cpu);
1753 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1754 * successfuly executed on another CPU. We must ensure that updates of
1755 * per-task data have been completed by this moment.
1758 task_thread_info(p)->cpu = cpu;
1762 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1763 const struct sched_class *prev_class,
1764 int oldprio, int running)
1766 if (prev_class != p->sched_class) {
1767 if (prev_class->switched_from)
1768 prev_class->switched_from(rq, p, running);
1769 p->sched_class->switched_to(rq, p, running);
1771 p->sched_class->prio_changed(rq, p, oldprio, running);
1776 /* Used instead of source_load when we know the type == 0 */
1777 static unsigned long weighted_cpuload(const int cpu)
1779 return cpu_rq(cpu)->load.weight;
1783 * Is this task likely cache-hot:
1786 task_hot(struct task_struct *p, u64 now, struct sched_domain *sd)
1791 * Buddy candidates are cache hot:
1793 if (sched_feat(CACHE_HOT_BUDDY) &&
1794 (&p->se == cfs_rq_of(&p->se)->next ||
1795 &p->se == cfs_rq_of(&p->se)->last))
1798 if (p->sched_class != &fair_sched_class)
1801 if (sysctl_sched_migration_cost == -1)
1803 if (sysctl_sched_migration_cost == 0)
1806 delta = now - p->se.exec_start;
1808 return delta < (s64)sysctl_sched_migration_cost;
1812 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1814 int old_cpu = task_cpu(p);
1815 struct rq *old_rq = cpu_rq(old_cpu), *new_rq = cpu_rq(new_cpu);
1816 struct cfs_rq *old_cfsrq = task_cfs_rq(p),
1817 *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu);
1820 clock_offset = old_rq->clock - new_rq->clock;
1822 #ifdef CONFIG_SCHEDSTATS
1823 if (p->se.wait_start)
1824 p->se.wait_start -= clock_offset;
1825 if (p->se.sleep_start)
1826 p->se.sleep_start -= clock_offset;
1827 if (p->se.block_start)
1828 p->se.block_start -= clock_offset;
1829 if (old_cpu != new_cpu) {
1830 schedstat_inc(p, se.nr_migrations);
1831 if (task_hot(p, old_rq->clock, NULL))
1832 schedstat_inc(p, se.nr_forced2_migrations);
1835 p->se.vruntime -= old_cfsrq->min_vruntime -
1836 new_cfsrq->min_vruntime;
1838 __set_task_cpu(p, new_cpu);
1841 struct migration_req {
1842 struct list_head list;
1844 struct task_struct *task;
1847 struct completion done;
1851 * The task's runqueue lock must be held.
1852 * Returns true if you have to wait for migration thread.
1855 migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req)
1857 struct rq *rq = task_rq(p);
1860 * If the task is not on a runqueue (and not running), then
1861 * it is sufficient to simply update the task's cpu field.
1863 if (!p->se.on_rq && !task_running(rq, p)) {
1864 set_task_cpu(p, dest_cpu);
1868 init_completion(&req->done);
1870 req->dest_cpu = dest_cpu;
1871 list_add(&req->list, &rq->migration_queue);
1877 * wait_task_inactive - wait for a thread to unschedule.
1879 * If @match_state is nonzero, it's the @p->state value just checked and
1880 * not expected to change. If it changes, i.e. @p might have woken up,
1881 * then return zero. When we succeed in waiting for @p to be off its CPU,
1882 * we return a positive number (its total switch count). If a second call
1883 * a short while later returns the same number, the caller can be sure that
1884 * @p has remained unscheduled the whole time.
1886 * The caller must ensure that the task *will* unschedule sometime soon,
1887 * else this function might spin for a *long* time. This function can't
1888 * be called with interrupts off, or it may introduce deadlock with
1889 * smp_call_function() if an IPI is sent by the same process we are
1890 * waiting to become inactive.
1892 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
1894 unsigned long flags;
1901 * We do the initial early heuristics without holding
1902 * any task-queue locks at all. We'll only try to get
1903 * the runqueue lock when things look like they will
1909 * If the task is actively running on another CPU
1910 * still, just relax and busy-wait without holding
1913 * NOTE! Since we don't hold any locks, it's not
1914 * even sure that "rq" stays as the right runqueue!
1915 * But we don't care, since "task_running()" will
1916 * return false if the runqueue has changed and p
1917 * is actually now running somewhere else!
1919 while (task_running(rq, p)) {
1920 if (match_state && unlikely(p->state != match_state))
1926 * Ok, time to look more closely! We need the rq
1927 * lock now, to be *sure*. If we're wrong, we'll
1928 * just go back and repeat.
1930 rq = task_rq_lock(p, &flags);
1931 trace_sched_wait_task(rq, p);
1932 running = task_running(rq, p);
1933 on_rq = p->se.on_rq;
1935 if (!match_state || p->state == match_state)
1936 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
1937 task_rq_unlock(rq, &flags);
1940 * If it changed from the expected state, bail out now.
1942 if (unlikely(!ncsw))
1946 * Was it really running after all now that we
1947 * checked with the proper locks actually held?
1949 * Oops. Go back and try again..
1951 if (unlikely(running)) {
1957 * It's not enough that it's not actively running,
1958 * it must be off the runqueue _entirely_, and not
1961 * So if it wa still runnable (but just not actively
1962 * running right now), it's preempted, and we should
1963 * yield - it could be a while.
1965 if (unlikely(on_rq)) {
1966 schedule_timeout_uninterruptible(1);
1971 * Ahh, all good. It wasn't running, and it wasn't
1972 * runnable, which means that it will never become
1973 * running in the future either. We're all done!
1982 * kick_process - kick a running thread to enter/exit the kernel
1983 * @p: the to-be-kicked thread
1985 * Cause a process which is running on another CPU to enter
1986 * kernel-mode, without any delay. (to get signals handled.)
1988 * NOTE: this function doesnt have to take the runqueue lock,
1989 * because all it wants to ensure is that the remote task enters
1990 * the kernel. If the IPI races and the task has been migrated
1991 * to another CPU then no harm is done and the purpose has been
1994 void kick_process(struct task_struct *p)
2000 if ((cpu != smp_processor_id()) && task_curr(p))
2001 smp_send_reschedule(cpu);
2006 * Return a low guess at the load of a migration-source cpu weighted
2007 * according to the scheduling class and "nice" value.
2009 * We want to under-estimate the load of migration sources, to
2010 * balance conservatively.
2012 static unsigned long source_load(int cpu, int type)
2014 struct rq *rq = cpu_rq(cpu);
2015 unsigned long total = weighted_cpuload(cpu);
2017 if (type == 0 || !sched_feat(LB_BIAS))
2020 return min(rq->cpu_load[type-1], total);
2024 * Return a high guess at the load of a migration-target cpu weighted
2025 * according to the scheduling class and "nice" value.
2027 static unsigned long target_load(int cpu, int type)
2029 struct rq *rq = cpu_rq(cpu);
2030 unsigned long total = weighted_cpuload(cpu);
2032 if (type == 0 || !sched_feat(LB_BIAS))
2035 return max(rq->cpu_load[type-1], total);
2039 * find_idlest_group finds and returns the least busy CPU group within the
2042 static struct sched_group *
2043 find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu)
2045 struct sched_group *idlest = NULL, *this = NULL, *group = sd->groups;
2046 unsigned long min_load = ULONG_MAX, this_load = 0;
2047 int load_idx = sd->forkexec_idx;
2048 int imbalance = 100 + (sd->imbalance_pct-100)/2;
2051 unsigned long load, avg_load;
2055 /* Skip over this group if it has no CPUs allowed */
2056 if (!cpumask_intersects(sched_group_cpus(group),
2060 local_group = cpumask_test_cpu(this_cpu,
2061 sched_group_cpus(group));
2063 /* Tally up the load of all CPUs in the group */
2066 for_each_cpu(i, sched_group_cpus(group)) {
2067 /* Bias balancing toward cpus of our domain */
2069 load = source_load(i, load_idx);
2071 load = target_load(i, load_idx);
2076 /* Adjust by relative CPU power of the group */
2077 avg_load = sg_div_cpu_power(group,
2078 avg_load * SCHED_LOAD_SCALE);
2081 this_load = avg_load;
2083 } else if (avg_load < min_load) {
2084 min_load = avg_load;
2087 } while (group = group->next, group != sd->groups);
2089 if (!idlest || 100*this_load < imbalance*min_load)
2095 * find_idlest_cpu - find the idlest cpu among the cpus in group.
2098 find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu)
2100 unsigned long load, min_load = ULONG_MAX;
2104 /* Traverse only the allowed CPUs */
2105 for_each_cpu_and(i, sched_group_cpus(group), &p->cpus_allowed) {
2106 load = weighted_cpuload(i);
2108 if (load < min_load || (load == min_load && i == this_cpu)) {
2118 * sched_balance_self: balance the current task (running on cpu) in domains
2119 * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and
2122 * Balance, ie. select the least loaded group.
2124 * Returns the target CPU number, or the same CPU if no balancing is needed.
2126 * preempt must be disabled.
2128 static int sched_balance_self(int cpu, int flag)
2130 struct task_struct *t = current;
2131 struct sched_domain *tmp, *sd = NULL;
2133 for_each_domain(cpu, tmp) {
2135 * If power savings logic is enabled for a domain, stop there.
2137 if (tmp->flags & SD_POWERSAVINGS_BALANCE)
2139 if (tmp->flags & flag)
2147 struct sched_group *group;
2148 int new_cpu, weight;
2150 if (!(sd->flags & flag)) {
2155 group = find_idlest_group(sd, t, cpu);
2161 new_cpu = find_idlest_cpu(group, t, cpu);
2162 if (new_cpu == -1 || new_cpu == cpu) {
2163 /* Now try balancing at a lower domain level of cpu */
2168 /* Now try balancing at a lower domain level of new_cpu */
2170 weight = cpumask_weight(sched_domain_span(sd));
2172 for_each_domain(cpu, tmp) {
2173 if (weight <= cpumask_weight(sched_domain_span(tmp)))
2175 if (tmp->flags & flag)
2178 /* while loop will break here if sd == NULL */
2184 #endif /* CONFIG_SMP */
2187 * try_to_wake_up - wake up a thread
2188 * @p: the to-be-woken-up thread
2189 * @state: the mask of task states that can be woken
2190 * @sync: do a synchronous wakeup?
2192 * Put it on the run-queue if it's not already there. The "current"
2193 * thread is always on the run-queue (except when the actual
2194 * re-schedule is in progress), and as such you're allowed to do
2195 * the simpler "current->state = TASK_RUNNING" to mark yourself
2196 * runnable without the overhead of this.
2198 * returns failure only if the task is already active.
2200 static int try_to_wake_up(struct task_struct *p, unsigned int state, int sync)
2202 int cpu, orig_cpu, this_cpu, success = 0;
2203 unsigned long flags;
2207 if (!sched_feat(SYNC_WAKEUPS))
2211 if (sched_feat(LB_WAKEUP_UPDATE)) {
2212 struct sched_domain *sd;
2214 this_cpu = raw_smp_processor_id();
2217 for_each_domain(this_cpu, sd) {
2218 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2227 rq = task_rq_lock(p, &flags);
2228 old_state = p->state;
2229 if (!(old_state & state))
2237 this_cpu = smp_processor_id();
2240 if (unlikely(task_running(rq, p)))
2243 cpu = p->sched_class->select_task_rq(p, sync);
2244 if (cpu != orig_cpu) {
2245 set_task_cpu(p, cpu);
2246 task_rq_unlock(rq, &flags);
2247 /* might preempt at this point */
2248 rq = task_rq_lock(p, &flags);
2249 old_state = p->state;
2250 if (!(old_state & state))
2255 this_cpu = smp_processor_id();
2259 #ifdef CONFIG_SCHEDSTATS
2260 schedstat_inc(rq, ttwu_count);
2261 if (cpu == this_cpu)
2262 schedstat_inc(rq, ttwu_local);
2264 struct sched_domain *sd;
2265 for_each_domain(this_cpu, sd) {
2266 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2267 schedstat_inc(sd, ttwu_wake_remote);
2272 #endif /* CONFIG_SCHEDSTATS */
2275 #endif /* CONFIG_SMP */
2276 schedstat_inc(p, se.nr_wakeups);
2278 schedstat_inc(p, se.nr_wakeups_sync);
2279 if (orig_cpu != cpu)
2280 schedstat_inc(p, se.nr_wakeups_migrate);
2281 if (cpu == this_cpu)
2282 schedstat_inc(p, se.nr_wakeups_local);
2284 schedstat_inc(p, se.nr_wakeups_remote);
2285 update_rq_clock(rq);
2286 activate_task(rq, p, 1);
2290 trace_sched_wakeup(rq, p);
2291 check_preempt_curr(rq, p, sync);
2293 p->state = TASK_RUNNING;
2295 if (p->sched_class->task_wake_up)
2296 p->sched_class->task_wake_up(rq, p);
2299 current->se.last_wakeup = current->se.sum_exec_runtime;
2301 task_rq_unlock(rq, &flags);
2306 int wake_up_process(struct task_struct *p)
2308 return try_to_wake_up(p, TASK_ALL, 0);
2310 EXPORT_SYMBOL(wake_up_process);
2312 int wake_up_state(struct task_struct *p, unsigned int state)
2314 return try_to_wake_up(p, state, 0);
2318 * Perform scheduler related setup for a newly forked process p.
2319 * p is forked by current.
2321 * __sched_fork() is basic setup used by init_idle() too:
2323 static void __sched_fork(struct task_struct *p)
2325 p->se.exec_start = 0;
2326 p->se.sum_exec_runtime = 0;
2327 p->se.prev_sum_exec_runtime = 0;
2328 p->se.last_wakeup = 0;
2329 p->se.avg_overlap = 0;
2331 #ifdef CONFIG_SCHEDSTATS
2332 p->se.wait_start = 0;
2333 p->se.sum_sleep_runtime = 0;
2334 p->se.sleep_start = 0;
2335 p->se.block_start = 0;
2336 p->se.sleep_max = 0;
2337 p->se.block_max = 0;
2339 p->se.slice_max = 0;
2343 INIT_LIST_HEAD(&p->rt.run_list);
2345 INIT_LIST_HEAD(&p->se.group_node);
2347 #ifdef CONFIG_PREEMPT_NOTIFIERS
2348 INIT_HLIST_HEAD(&p->preempt_notifiers);
2352 * We mark the process as running here, but have not actually
2353 * inserted it onto the runqueue yet. This guarantees that
2354 * nobody will actually run it, and a signal or other external
2355 * event cannot wake it up and insert it on the runqueue either.
2357 p->state = TASK_RUNNING;
2361 * fork()/clone()-time setup:
2363 void sched_fork(struct task_struct *p, int clone_flags)
2365 int cpu = get_cpu();
2370 cpu = sched_balance_self(cpu, SD_BALANCE_FORK);
2372 set_task_cpu(p, cpu);
2375 * Make sure we do not leak PI boosting priority to the child:
2377 p->prio = current->normal_prio;
2378 if (!rt_prio(p->prio))
2379 p->sched_class = &fair_sched_class;
2381 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2382 if (likely(sched_info_on()))
2383 memset(&p->sched_info, 0, sizeof(p->sched_info));
2385 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2388 #ifdef CONFIG_PREEMPT
2389 /* Want to start with kernel preemption disabled. */
2390 task_thread_info(p)->preempt_count = 1;
2396 * wake_up_new_task - wake up a newly created task for the first time.
2398 * This function will do some initial scheduler statistics housekeeping
2399 * that must be done for every newly created context, then puts the task
2400 * on the runqueue and wakes it.
2402 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2404 unsigned long flags;
2407 rq = task_rq_lock(p, &flags);
2408 BUG_ON(p->state != TASK_RUNNING);
2409 update_rq_clock(rq);
2411 p->prio = effective_prio(p);
2413 if (!p->sched_class->task_new || !current->se.on_rq) {
2414 activate_task(rq, p, 0);
2417 * Let the scheduling class do new task startup
2418 * management (if any):
2420 p->sched_class->task_new(rq, p);
2423 trace_sched_wakeup_new(rq, p);
2424 check_preempt_curr(rq, p, 0);
2426 if (p->sched_class->task_wake_up)
2427 p->sched_class->task_wake_up(rq, p);
2429 task_rq_unlock(rq, &flags);
2432 #ifdef CONFIG_PREEMPT_NOTIFIERS
2435 * preempt_notifier_register - tell me when current is being being preempted & rescheduled
2436 * @notifier: notifier struct to register
2438 void preempt_notifier_register(struct preempt_notifier *notifier)
2440 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2442 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2445 * preempt_notifier_unregister - no longer interested in preemption notifications
2446 * @notifier: notifier struct to unregister
2448 * This is safe to call from within a preemption notifier.
2450 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2452 hlist_del(¬ifier->link);
2454 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2456 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2458 struct preempt_notifier *notifier;
2459 struct hlist_node *node;
2461 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2462 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2466 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2467 struct task_struct *next)
2469 struct preempt_notifier *notifier;
2470 struct hlist_node *node;
2472 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2473 notifier->ops->sched_out(notifier, next);
2476 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2478 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2483 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2484 struct task_struct *next)
2488 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2491 * prepare_task_switch - prepare to switch tasks
2492 * @rq: the runqueue preparing to switch
2493 * @prev: the current task that is being switched out
2494 * @next: the task we are going to switch to.
2496 * This is called with the rq lock held and interrupts off. It must
2497 * be paired with a subsequent finish_task_switch after the context
2500 * prepare_task_switch sets up locking and calls architecture specific
2504 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2505 struct task_struct *next)
2507 fire_sched_out_preempt_notifiers(prev, next);
2508 prepare_lock_switch(rq, next);
2509 prepare_arch_switch(next);
2513 * finish_task_switch - clean up after a task-switch
2514 * @rq: runqueue associated with task-switch
2515 * @prev: the thread we just switched away from.
2517 * finish_task_switch must be called after the context switch, paired
2518 * with a prepare_task_switch call before the context switch.
2519 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2520 * and do any other architecture-specific cleanup actions.
2522 * Note that we may have delayed dropping an mm in context_switch(). If
2523 * so, we finish that here outside of the runqueue lock. (Doing it
2524 * with the lock held can cause deadlocks; see schedule() for
2527 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2528 __releases(rq->lock)
2530 struct mm_struct *mm = rq->prev_mm;
2536 * A task struct has one reference for the use as "current".
2537 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2538 * schedule one last time. The schedule call will never return, and
2539 * the scheduled task must drop that reference.
2540 * The test for TASK_DEAD must occur while the runqueue locks are
2541 * still held, otherwise prev could be scheduled on another cpu, die
2542 * there before we look at prev->state, and then the reference would
2544 * Manfred Spraul <manfred@colorfullife.com>
2546 prev_state = prev->state;
2547 finish_arch_switch(prev);
2548 finish_lock_switch(rq, prev);
2550 if (current->sched_class->post_schedule)
2551 current->sched_class->post_schedule(rq);
2554 fire_sched_in_preempt_notifiers(current);
2557 if (unlikely(prev_state == TASK_DEAD)) {
2559 * Remove function-return probe instances associated with this
2560 * task and put them back on the free list.
2562 kprobe_flush_task(prev);
2563 put_task_struct(prev);
2568 * schedule_tail - first thing a freshly forked thread must call.
2569 * @prev: the thread we just switched away from.
2571 asmlinkage void schedule_tail(struct task_struct *prev)
2572 __releases(rq->lock)
2574 struct rq *rq = this_rq();
2576 finish_task_switch(rq, prev);
2577 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2578 /* In this case, finish_task_switch does not reenable preemption */
2581 if (current->set_child_tid)
2582 put_user(task_pid_vnr(current), current->set_child_tid);
2586 * context_switch - switch to the new MM and the new
2587 * thread's register state.
2590 context_switch(struct rq *rq, struct task_struct *prev,
2591 struct task_struct *next)
2593 struct mm_struct *mm, *oldmm;
2595 prepare_task_switch(rq, prev, next);
2596 trace_sched_switch(rq, prev, next);
2598 oldmm = prev->active_mm;
2600 * For paravirt, this is coupled with an exit in switch_to to
2601 * combine the page table reload and the switch backend into
2604 arch_enter_lazy_cpu_mode();
2606 if (unlikely(!mm)) {
2607 next->active_mm = oldmm;
2608 atomic_inc(&oldmm->mm_count);
2609 enter_lazy_tlb(oldmm, next);
2611 switch_mm(oldmm, mm, next);
2613 if (unlikely(!prev->mm)) {
2614 prev->active_mm = NULL;
2615 rq->prev_mm = oldmm;
2618 * Since the runqueue lock will be released by the next
2619 * task (which is an invalid locking op but in the case
2620 * of the scheduler it's an obvious special-case), so we
2621 * do an early lockdep release here:
2623 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2624 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2627 /* Here we just switch the register state and the stack. */
2628 switch_to(prev, next, prev);
2632 * this_rq must be evaluated again because prev may have moved
2633 * CPUs since it called schedule(), thus the 'rq' on its stack
2634 * frame will be invalid.
2636 finish_task_switch(this_rq(), prev);
2640 * nr_running, nr_uninterruptible and nr_context_switches:
2642 * externally visible scheduler statistics: current number of runnable
2643 * threads, current number of uninterruptible-sleeping threads, total
2644 * number of context switches performed since bootup.
2646 unsigned long nr_running(void)
2648 unsigned long i, sum = 0;
2650 for_each_online_cpu(i)
2651 sum += cpu_rq(i)->nr_running;
2656 unsigned long nr_uninterruptible(void)
2658 unsigned long i, sum = 0;
2660 for_each_possible_cpu(i)
2661 sum += cpu_rq(i)->nr_uninterruptible;
2664 * Since we read the counters lockless, it might be slightly
2665 * inaccurate. Do not allow it to go below zero though:
2667 if (unlikely((long)sum < 0))
2673 unsigned long long nr_context_switches(void)
2676 unsigned long long sum = 0;
2678 for_each_possible_cpu(i)
2679 sum += cpu_rq(i)->nr_switches;
2684 unsigned long nr_iowait(void)
2686 unsigned long i, sum = 0;
2688 for_each_possible_cpu(i)
2689 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2694 unsigned long nr_active(void)
2696 unsigned long i, running = 0, uninterruptible = 0;
2698 for_each_online_cpu(i) {
2699 running += cpu_rq(i)->nr_running;
2700 uninterruptible += cpu_rq(i)->nr_uninterruptible;
2703 if (unlikely((long)uninterruptible < 0))
2704 uninterruptible = 0;
2706 return running + uninterruptible;
2710 * Update rq->cpu_load[] statistics. This function is usually called every
2711 * scheduler tick (TICK_NSEC).
2713 static void update_cpu_load(struct rq *this_rq)
2715 unsigned long this_load = this_rq->load.weight;
2718 this_rq->nr_load_updates++;
2720 /* Update our load: */
2721 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
2722 unsigned long old_load, new_load;
2724 /* scale is effectively 1 << i now, and >> i divides by scale */
2726 old_load = this_rq->cpu_load[i];
2727 new_load = this_load;
2729 * Round up the averaging division if load is increasing. This
2730 * prevents us from getting stuck on 9 if the load is 10, for
2733 if (new_load > old_load)
2734 new_load += scale-1;
2735 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
2742 * double_rq_lock - safely lock two runqueues
2744 * Note this does not disable interrupts like task_rq_lock,
2745 * you need to do so manually before calling.
2747 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
2748 __acquires(rq1->lock)
2749 __acquires(rq2->lock)
2751 BUG_ON(!irqs_disabled());
2753 spin_lock(&rq1->lock);
2754 __acquire(rq2->lock); /* Fake it out ;) */
2757 spin_lock(&rq1->lock);
2758 spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
2760 spin_lock(&rq2->lock);
2761 spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
2764 update_rq_clock(rq1);
2765 update_rq_clock(rq2);
2769 * double_rq_unlock - safely unlock two runqueues
2771 * Note this does not restore interrupts like task_rq_unlock,
2772 * you need to do so manually after calling.
2774 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
2775 __releases(rq1->lock)
2776 __releases(rq2->lock)
2778 spin_unlock(&rq1->lock);
2780 spin_unlock(&rq2->lock);
2782 __release(rq2->lock);
2786 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
2788 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
2789 __releases(this_rq->lock)
2790 __acquires(busiest->lock)
2791 __acquires(this_rq->lock)
2795 if (unlikely(!irqs_disabled())) {
2796 /* printk() doesn't work good under rq->lock */
2797 spin_unlock(&this_rq->lock);
2800 if (unlikely(!spin_trylock(&busiest->lock))) {
2801 if (busiest < this_rq) {
2802 spin_unlock(&this_rq->lock);
2803 spin_lock(&busiest->lock);
2804 spin_lock_nested(&this_rq->lock, SINGLE_DEPTH_NESTING);
2807 spin_lock_nested(&busiest->lock, SINGLE_DEPTH_NESTING);
2812 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
2813 __releases(busiest->lock)
2815 spin_unlock(&busiest->lock);
2816 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
2820 * If dest_cpu is allowed for this process, migrate the task to it.
2821 * This is accomplished by forcing the cpu_allowed mask to only
2822 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
2823 * the cpu_allowed mask is restored.
2825 static void sched_migrate_task(struct task_struct *p, int dest_cpu)
2827 struct migration_req req;
2828 unsigned long flags;
2831 rq = task_rq_lock(p, &flags);
2832 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed)
2833 || unlikely(!cpu_active(dest_cpu)))
2836 trace_sched_migrate_task(rq, p, dest_cpu);
2837 /* force the process onto the specified CPU */
2838 if (migrate_task(p, dest_cpu, &req)) {
2839 /* Need to wait for migration thread (might exit: take ref). */
2840 struct task_struct *mt = rq->migration_thread;
2842 get_task_struct(mt);
2843 task_rq_unlock(rq, &flags);
2844 wake_up_process(mt);
2845 put_task_struct(mt);
2846 wait_for_completion(&req.done);
2851 task_rq_unlock(rq, &flags);
2855 * sched_exec - execve() is a valuable balancing opportunity, because at
2856 * this point the task has the smallest effective memory and cache footprint.
2858 void sched_exec(void)
2860 int new_cpu, this_cpu = get_cpu();
2861 new_cpu = sched_balance_self(this_cpu, SD_BALANCE_EXEC);
2863 if (new_cpu != this_cpu)
2864 sched_migrate_task(current, new_cpu);
2868 * pull_task - move a task from a remote runqueue to the local runqueue.
2869 * Both runqueues must be locked.
2871 static void pull_task(struct rq *src_rq, struct task_struct *p,
2872 struct rq *this_rq, int this_cpu)
2874 deactivate_task(src_rq, p, 0);
2875 set_task_cpu(p, this_cpu);
2876 activate_task(this_rq, p, 0);
2878 * Note that idle threads have a prio of MAX_PRIO, for this test
2879 * to be always true for them.
2881 check_preempt_curr(this_rq, p, 0);
2885 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
2888 int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu,
2889 struct sched_domain *sd, enum cpu_idle_type idle,
2893 * We do not migrate tasks that are:
2894 * 1) running (obviously), or
2895 * 2) cannot be migrated to this CPU due to cpus_allowed, or
2896 * 3) are cache-hot on their current CPU.
2898 if (!cpumask_test_cpu(this_cpu, &p->cpus_allowed)) {
2899 schedstat_inc(p, se.nr_failed_migrations_affine);
2904 if (task_running(rq, p)) {
2905 schedstat_inc(p, se.nr_failed_migrations_running);
2910 * Aggressive migration if:
2911 * 1) task is cache cold, or
2912 * 2) too many balance attempts have failed.
2915 if (!task_hot(p, rq->clock, sd) ||
2916 sd->nr_balance_failed > sd->cache_nice_tries) {
2917 #ifdef CONFIG_SCHEDSTATS
2918 if (task_hot(p, rq->clock, sd)) {
2919 schedstat_inc(sd, lb_hot_gained[idle]);
2920 schedstat_inc(p, se.nr_forced_migrations);
2926 if (task_hot(p, rq->clock, sd)) {
2927 schedstat_inc(p, se.nr_failed_migrations_hot);
2933 static unsigned long
2934 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
2935 unsigned long max_load_move, struct sched_domain *sd,
2936 enum cpu_idle_type idle, int *all_pinned,
2937 int *this_best_prio, struct rq_iterator *iterator)
2939 int loops = 0, pulled = 0, pinned = 0;
2940 struct task_struct *p;
2941 long rem_load_move = max_load_move;
2943 if (max_load_move == 0)
2949 * Start the load-balancing iterator:
2951 p = iterator->start(iterator->arg);
2953 if (!p || loops++ > sysctl_sched_nr_migrate)
2956 if ((p->se.load.weight >> 1) > rem_load_move ||
2957 !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
2958 p = iterator->next(iterator->arg);
2962 pull_task(busiest, p, this_rq, this_cpu);
2964 rem_load_move -= p->se.load.weight;
2967 * We only want to steal up to the prescribed amount of weighted load.
2969 if (rem_load_move > 0) {
2970 if (p->prio < *this_best_prio)
2971 *this_best_prio = p->prio;
2972 p = iterator->next(iterator->arg);
2977 * Right now, this is one of only two places pull_task() is called,
2978 * so we can safely collect pull_task() stats here rather than
2979 * inside pull_task().
2981 schedstat_add(sd, lb_gained[idle], pulled);
2984 *all_pinned = pinned;
2986 return max_load_move - rem_load_move;
2990 * move_tasks tries to move up to max_load_move weighted load from busiest to
2991 * this_rq, as part of a balancing operation within domain "sd".
2992 * Returns 1 if successful and 0 otherwise.
2994 * Called with both runqueues locked.
2996 static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
2997 unsigned long max_load_move,
2998 struct sched_domain *sd, enum cpu_idle_type idle,
3001 const struct sched_class *class = sched_class_highest;
3002 unsigned long total_load_moved = 0;
3003 int this_best_prio = this_rq->curr->prio;
3007 class->load_balance(this_rq, this_cpu, busiest,
3008 max_load_move - total_load_moved,
3009 sd, idle, all_pinned, &this_best_prio);
3010 class = class->next;
3012 if (idle == CPU_NEWLY_IDLE && this_rq->nr_running)
3015 } while (class && max_load_move > total_load_moved);
3017 return total_load_moved > 0;
3021 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3022 struct sched_domain *sd, enum cpu_idle_type idle,
3023 struct rq_iterator *iterator)
3025 struct task_struct *p = iterator->start(iterator->arg);
3029 if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3030 pull_task(busiest, p, this_rq, this_cpu);
3032 * Right now, this is only the second place pull_task()
3033 * is called, so we can safely collect pull_task()
3034 * stats here rather than inside pull_task().
3036 schedstat_inc(sd, lb_gained[idle]);
3040 p = iterator->next(iterator->arg);
3047 * move_one_task tries to move exactly one task from busiest to this_rq, as
3048 * part of active balancing operations within "domain".
3049 * Returns 1 if successful and 0 otherwise.
3051 * Called with both runqueues locked.
3053 static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3054 struct sched_domain *sd, enum cpu_idle_type idle)
3056 const struct sched_class *class;
3058 for (class = sched_class_highest; class; class = class->next)
3059 if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle))
3066 * find_busiest_group finds and returns the busiest CPU group within the
3067 * domain. It calculates and returns the amount of weighted load which
3068 * should be moved to restore balance via the imbalance parameter.
3070 static struct sched_group *
3071 find_busiest_group(struct sched_domain *sd, int this_cpu,
3072 unsigned long *imbalance, enum cpu_idle_type idle,
3073 int *sd_idle, const struct cpumask *cpus, int *balance)
3075 struct sched_group *busiest = NULL, *this = NULL, *group = sd->groups;
3076 unsigned long max_load, avg_load, total_load, this_load, total_pwr;
3077 unsigned long max_pull;
3078 unsigned long busiest_load_per_task, busiest_nr_running;
3079 unsigned long this_load_per_task, this_nr_running;
3080 int load_idx, group_imb = 0;
3081 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3082 int power_savings_balance = 1;
3083 unsigned long leader_nr_running = 0, min_load_per_task = 0;
3084 unsigned long min_nr_running = ULONG_MAX;
3085 struct sched_group *group_min = NULL, *group_leader = NULL;
3088 max_load = this_load = total_load = total_pwr = 0;
3089 busiest_load_per_task = busiest_nr_running = 0;
3090 this_load_per_task = this_nr_running = 0;
3092 if (idle == CPU_NOT_IDLE)
3093 load_idx = sd->busy_idx;
3094 else if (idle == CPU_NEWLY_IDLE)
3095 load_idx = sd->newidle_idx;
3097 load_idx = sd->idle_idx;
3100 unsigned long load, group_capacity, max_cpu_load, min_cpu_load;
3103 int __group_imb = 0;
3104 unsigned int balance_cpu = -1, first_idle_cpu = 0;
3105 unsigned long sum_nr_running, sum_weighted_load;
3106 unsigned long sum_avg_load_per_task;
3107 unsigned long avg_load_per_task;
3109 local_group = cpumask_test_cpu(this_cpu,
3110 sched_group_cpus(group));
3113 balance_cpu = cpumask_first(sched_group_cpus(group));
3115 /* Tally up the load of all CPUs in the group */
3116 sum_weighted_load = sum_nr_running = avg_load = 0;
3117 sum_avg_load_per_task = avg_load_per_task = 0;
3120 min_cpu_load = ~0UL;
3122 for_each_cpu_and(i, sched_group_cpus(group), cpus) {
3123 struct rq *rq = cpu_rq(i);
3125 if (*sd_idle && rq->nr_running)
3128 /* Bias balancing toward cpus of our domain */
3130 if (idle_cpu(i) && !first_idle_cpu) {
3135 load = target_load(i, load_idx);
3137 load = source_load(i, load_idx);
3138 if (load > max_cpu_load)
3139 max_cpu_load = load;
3140 if (min_cpu_load > load)
3141 min_cpu_load = load;
3145 sum_nr_running += rq->nr_running;
3146 sum_weighted_load += weighted_cpuload(i);
3148 sum_avg_load_per_task += cpu_avg_load_per_task(i);
3152 * First idle cpu or the first cpu(busiest) in this sched group
3153 * is eligible for doing load balancing at this and above
3154 * domains. In the newly idle case, we will allow all the cpu's
3155 * to do the newly idle load balance.
3157 if (idle != CPU_NEWLY_IDLE && local_group &&
3158 balance_cpu != this_cpu && balance) {
3163 total_load += avg_load;
3164 total_pwr += group->__cpu_power;
3166 /* Adjust by relative CPU power of the group */
3167 avg_load = sg_div_cpu_power(group,
3168 avg_load * SCHED_LOAD_SCALE);
3172 * Consider the group unbalanced when the imbalance is larger
3173 * than the average weight of two tasks.
3175 * APZ: with cgroup the avg task weight can vary wildly and
3176 * might not be a suitable number - should we keep a
3177 * normalized nr_running number somewhere that negates
3180 avg_load_per_task = sg_div_cpu_power(group,
3181 sum_avg_load_per_task * SCHED_LOAD_SCALE);
3183 if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task)
3186 group_capacity = group->__cpu_power / SCHED_LOAD_SCALE;
3189 this_load = avg_load;
3191 this_nr_running = sum_nr_running;
3192 this_load_per_task = sum_weighted_load;
3193 } else if (avg_load > max_load &&
3194 (sum_nr_running > group_capacity || __group_imb)) {
3195 max_load = avg_load;
3197 busiest_nr_running = sum_nr_running;
3198 busiest_load_per_task = sum_weighted_load;
3199 group_imb = __group_imb;
3202 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3204 * Busy processors will not participate in power savings
3207 if (idle == CPU_NOT_IDLE ||
3208 !(sd->flags & SD_POWERSAVINGS_BALANCE))
3212 * If the local group is idle or completely loaded
3213 * no need to do power savings balance at this domain
3215 if (local_group && (this_nr_running >= group_capacity ||
3217 power_savings_balance = 0;
3220 * If a group is already running at full capacity or idle,
3221 * don't include that group in power savings calculations
3223 if (!power_savings_balance || sum_nr_running >= group_capacity
3228 * Calculate the group which has the least non-idle load.
3229 * This is the group from where we need to pick up the load
3232 if ((sum_nr_running < min_nr_running) ||
3233 (sum_nr_running == min_nr_running &&
3234 cpumask_first(sched_group_cpus(group)) <
3235 cpumask_first(sched_group_cpus(group_min)))) {
3237 min_nr_running = sum_nr_running;
3238 min_load_per_task = sum_weighted_load /
3243 * Calculate the group which is almost near its
3244 * capacity but still has some space to pick up some load
3245 * from other group and save more power
3247 if (sum_nr_running <= group_capacity - 1) {
3248 if (sum_nr_running > leader_nr_running ||
3249 (sum_nr_running == leader_nr_running &&
3250 cpumask_first(sched_group_cpus(group)) >
3251 cpumask_first(sched_group_cpus(group_leader)))) {
3252 group_leader = group;
3253 leader_nr_running = sum_nr_running;
3258 group = group->next;
3259 } while (group != sd->groups);
3261 if (!busiest || this_load >= max_load || busiest_nr_running == 0)
3264 avg_load = (SCHED_LOAD_SCALE * total_load) / total_pwr;
3266 if (this_load >= avg_load ||
3267 100*max_load <= sd->imbalance_pct*this_load)
3270 busiest_load_per_task /= busiest_nr_running;
3272 busiest_load_per_task = min(busiest_load_per_task, avg_load);
3275 * We're trying to get all the cpus to the average_load, so we don't
3276 * want to push ourselves above the average load, nor do we wish to
3277 * reduce the max loaded cpu below the average load, as either of these
3278 * actions would just result in more rebalancing later, and ping-pong
3279 * tasks around. Thus we look for the minimum possible imbalance.
3280 * Negative imbalances (*we* are more loaded than anyone else) will
3281 * be counted as no imbalance for these purposes -- we can't fix that
3282 * by pulling tasks to us. Be careful of negative numbers as they'll
3283 * appear as very large values with unsigned longs.
3285 if (max_load <= busiest_load_per_task)
3289 * In the presence of smp nice balancing, certain scenarios can have
3290 * max load less than avg load(as we skip the groups at or below
3291 * its cpu_power, while calculating max_load..)
3293 if (max_load < avg_load) {
3295 goto small_imbalance;
3298 /* Don't want to pull so many tasks that a group would go idle */
3299 max_pull = min(max_load - avg_load, max_load - busiest_load_per_task);
3301 /* How much load to actually move to equalise the imbalance */
3302 *imbalance = min(max_pull * busiest->__cpu_power,
3303 (avg_load - this_load) * this->__cpu_power)
3307 * if *imbalance is less than the average load per runnable task
3308 * there is no gaurantee that any tasks will be moved so we'll have
3309 * a think about bumping its value to force at least one task to be
3312 if (*imbalance < busiest_load_per_task) {
3313 unsigned long tmp, pwr_now, pwr_move;
3317 pwr_move = pwr_now = 0;
3319 if (this_nr_running) {
3320 this_load_per_task /= this_nr_running;
3321 if (busiest_load_per_task > this_load_per_task)
3324 this_load_per_task = cpu_avg_load_per_task(this_cpu);
3326 if (max_load - this_load + busiest_load_per_task >=
3327 busiest_load_per_task * imbn) {
3328 *imbalance = busiest_load_per_task;
3333 * OK, we don't have enough imbalance to justify moving tasks,
3334 * however we may be able to increase total CPU power used by
3338 pwr_now += busiest->__cpu_power *
3339 min(busiest_load_per_task, max_load);
3340 pwr_now += this->__cpu_power *
3341 min(this_load_per_task, this_load);
3342 pwr_now /= SCHED_LOAD_SCALE;
3344 /* Amount of load we'd subtract */
3345 tmp = sg_div_cpu_power(busiest,
3346 busiest_load_per_task * SCHED_LOAD_SCALE);
3348 pwr_move += busiest->__cpu_power *
3349 min(busiest_load_per_task, max_load - tmp);
3351 /* Amount of load we'd add */
3352 if (max_load * busiest->__cpu_power <
3353 busiest_load_per_task * SCHED_LOAD_SCALE)
3354 tmp = sg_div_cpu_power(this,
3355 max_load * busiest->__cpu_power);
3357 tmp = sg_div_cpu_power(this,
3358 busiest_load_per_task * SCHED_LOAD_SCALE);
3359 pwr_move += this->__cpu_power *
3360 min(this_load_per_task, this_load + tmp);
3361 pwr_move /= SCHED_LOAD_SCALE;
3363 /* Move if we gain throughput */
3364 if (pwr_move > pwr_now)
3365 *imbalance = busiest_load_per_task;
3371 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3372 if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE))
3375 if (this == group_leader && group_leader != group_min) {
3376 *imbalance = min_load_per_task;
3386 * find_busiest_queue - find the busiest runqueue among the cpus in group.
3389 find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle,
3390 unsigned long imbalance, const struct cpumask *cpus)
3392 struct rq *busiest = NULL, *rq;
3393 unsigned long max_load = 0;
3396 for_each_cpu(i, sched_group_cpus(group)) {
3399 if (!cpumask_test_cpu(i, cpus))
3403 wl = weighted_cpuload(i);
3405 if (rq->nr_running == 1 && wl > imbalance)
3408 if (wl > max_load) {
3418 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
3419 * so long as it is large enough.
3421 #define MAX_PINNED_INTERVAL 512
3424 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3425 * tasks if there is an imbalance.
3427 static int load_balance(int this_cpu, struct rq *this_rq,
3428 struct sched_domain *sd, enum cpu_idle_type idle,
3429 int *balance, struct cpumask *cpus)
3431 int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0;
3432 struct sched_group *group;
3433 unsigned long imbalance;
3435 unsigned long flags;
3437 cpumask_setall(cpus);
3440 * When power savings policy is enabled for the parent domain, idle
3441 * sibling can pick up load irrespective of busy siblings. In this case,
3442 * let the state of idle sibling percolate up as CPU_IDLE, instead of
3443 * portraying it as CPU_NOT_IDLE.
3445 if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER &&
3446 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3449 schedstat_inc(sd, lb_count[idle]);
3453 group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle,
3460 schedstat_inc(sd, lb_nobusyg[idle]);
3464 busiest = find_busiest_queue(group, idle, imbalance, cpus);
3466 schedstat_inc(sd, lb_nobusyq[idle]);
3470 BUG_ON(busiest == this_rq);
3472 schedstat_add(sd, lb_imbalance[idle], imbalance);
3475 if (busiest->nr_running > 1) {
3477 * Attempt to move tasks. If find_busiest_group has found
3478 * an imbalance but busiest->nr_running <= 1, the group is
3479 * still unbalanced. ld_moved simply stays zero, so it is
3480 * correctly treated as an imbalance.
3482 local_irq_save(flags);
3483 double_rq_lock(this_rq, busiest);
3484 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3485 imbalance, sd, idle, &all_pinned);
3486 double_rq_unlock(this_rq, busiest);
3487 local_irq_restore(flags);
3490 * some other cpu did the load balance for us.
3492 if (ld_moved && this_cpu != smp_processor_id())
3493 resched_cpu(this_cpu);
3495 /* All tasks on this runqueue were pinned by CPU affinity */
3496 if (unlikely(all_pinned)) {
3497 cpumask_clear_cpu(cpu_of(busiest), cpus);
3498 if (!cpumask_empty(cpus))
3505 schedstat_inc(sd, lb_failed[idle]);
3506 sd->nr_balance_failed++;
3508 if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) {
3510 spin_lock_irqsave(&busiest->lock, flags);
3512 /* don't kick the migration_thread, if the curr
3513 * task on busiest cpu can't be moved to this_cpu
3515 if (!cpumask_test_cpu(this_cpu,
3516 &busiest->curr->cpus_allowed)) {
3517 spin_unlock_irqrestore(&busiest->lock, flags);
3519 goto out_one_pinned;
3522 if (!busiest->active_balance) {
3523 busiest->active_balance = 1;
3524 busiest->push_cpu = this_cpu;
3527 spin_unlock_irqrestore(&busiest->lock, flags);
3529 wake_up_process(busiest->migration_thread);
3532 * We've kicked active balancing, reset the failure
3535 sd->nr_balance_failed = sd->cache_nice_tries+1;
3538 sd->nr_balance_failed = 0;
3540 if (likely(!active_balance)) {
3541 /* We were unbalanced, so reset the balancing interval */
3542 sd->balance_interval = sd->min_interval;
3545 * If we've begun active balancing, start to back off. This
3546 * case may not be covered by the all_pinned logic if there
3547 * is only 1 task on the busy runqueue (because we don't call
3550 if (sd->balance_interval < sd->max_interval)
3551 sd->balance_interval *= 2;
3554 if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3555 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3561 schedstat_inc(sd, lb_balanced[idle]);
3563 sd->nr_balance_failed = 0;
3566 /* tune up the balancing interval */
3567 if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) ||
3568 (sd->balance_interval < sd->max_interval))
3569 sd->balance_interval *= 2;
3571 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3572 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3583 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3584 * tasks if there is an imbalance.
3586 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
3587 * this_rq is locked.
3590 load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd,
3591 struct cpumask *cpus)
3593 struct sched_group *group;
3594 struct rq *busiest = NULL;
3595 unsigned long imbalance;
3600 cpumask_setall(cpus);
3603 * When power savings policy is enabled for the parent domain, idle
3604 * sibling can pick up load irrespective of busy siblings. In this case,
3605 * let the state of idle sibling percolate up as IDLE, instead of
3606 * portraying it as CPU_NOT_IDLE.
3608 if (sd->flags & SD_SHARE_CPUPOWER &&
3609 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3612 schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]);
3614 update_shares_locked(this_rq, sd);
3615 group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE,
3616 &sd_idle, cpus, NULL);
3618 schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]);
3622 busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus);
3624 schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]);
3628 BUG_ON(busiest == this_rq);
3630 schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance);
3633 if (busiest->nr_running > 1) {
3634 /* Attempt to move tasks */
3635 double_lock_balance(this_rq, busiest);
3636 /* this_rq->clock is already updated */
3637 update_rq_clock(busiest);
3638 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3639 imbalance, sd, CPU_NEWLY_IDLE,
3641 double_unlock_balance(this_rq, busiest);
3643 if (unlikely(all_pinned)) {
3644 cpumask_clear_cpu(cpu_of(busiest), cpus);
3645 if (!cpumask_empty(cpus))
3651 schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]);
3652 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3653 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3656 sd->nr_balance_failed = 0;
3658 update_shares_locked(this_rq, sd);
3662 schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]);
3663 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3664 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3666 sd->nr_balance_failed = 0;
3672 * idle_balance is called by schedule() if this_cpu is about to become
3673 * idle. Attempts to pull tasks from other CPUs.
3675 static void idle_balance(int this_cpu, struct rq *this_rq)
3677 struct sched_domain *sd;
3678 int pulled_task = -1;
3679 unsigned long next_balance = jiffies + HZ;
3680 cpumask_var_t tmpmask;
3682 if (!alloc_cpumask_var(&tmpmask, GFP_ATOMIC))
3685 for_each_domain(this_cpu, sd) {
3686 unsigned long interval;
3688 if (!(sd->flags & SD_LOAD_BALANCE))
3691 if (sd->flags & SD_BALANCE_NEWIDLE)
3692 /* If we've pulled tasks over stop searching: */
3693 pulled_task = load_balance_newidle(this_cpu, this_rq,
3696 interval = msecs_to_jiffies(sd->balance_interval);
3697 if (time_after(next_balance, sd->last_balance + interval))
3698 next_balance = sd->last_balance + interval;
3702 if (pulled_task || time_after(jiffies, this_rq->next_balance)) {
3704 * We are going idle. next_balance may be set based on
3705 * a busy processor. So reset next_balance.
3707 this_rq->next_balance = next_balance;
3709 free_cpumask_var(tmpmask);
3713 * active_load_balance is run by migration threads. It pushes running tasks
3714 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
3715 * running on each physical CPU where possible, and avoids physical /
3716 * logical imbalances.
3718 * Called with busiest_rq locked.
3720 static void active_load_balance(struct rq *busiest_rq, int busiest_cpu)
3722 int target_cpu = busiest_rq->push_cpu;
3723 struct sched_domain *sd;
3724 struct rq *target_rq;
3726 /* Is there any task to move? */
3727 if (busiest_rq->nr_running <= 1)
3730 target_rq = cpu_rq(target_cpu);
3733 * This condition is "impossible", if it occurs
3734 * we need to fix it. Originally reported by
3735 * Bjorn Helgaas on a 128-cpu setup.
3737 BUG_ON(busiest_rq == target_rq);
3739 /* move a task from busiest_rq to target_rq */
3740 double_lock_balance(busiest_rq, target_rq);
3741 update_rq_clock(busiest_rq);
3742 update_rq_clock(target_rq);
3744 /* Search for an sd spanning us and the target CPU. */
3745 for_each_domain(target_cpu, sd) {
3746 if ((sd->flags & SD_LOAD_BALANCE) &&
3747 cpumask_test_cpu(busiest_cpu, sched_domain_span(sd)))
3752 schedstat_inc(sd, alb_count);
3754 if (move_one_task(target_rq, target_cpu, busiest_rq,
3756 schedstat_inc(sd, alb_pushed);
3758 schedstat_inc(sd, alb_failed);
3760 double_unlock_balance(busiest_rq, target_rq);
3765 atomic_t load_balancer;
3766 cpumask_var_t cpu_mask;
3767 } nohz ____cacheline_aligned = {
3768 .load_balancer = ATOMIC_INIT(-1),
3772 * This routine will try to nominate the ilb (idle load balancing)
3773 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
3774 * load balancing on behalf of all those cpus. If all the cpus in the system
3775 * go into this tickless mode, then there will be no ilb owner (as there is
3776 * no need for one) and all the cpus will sleep till the next wakeup event
3779 * For the ilb owner, tick is not stopped. And this tick will be used
3780 * for idle load balancing. ilb owner will still be part of
3783 * While stopping the tick, this cpu will become the ilb owner if there
3784 * is no other owner. And will be the owner till that cpu becomes busy
3785 * or if all cpus in the system stop their ticks at which point
3786 * there is no need for ilb owner.
3788 * When the ilb owner becomes busy, it nominates another owner, during the
3789 * next busy scheduler_tick()
3791 int select_nohz_load_balancer(int stop_tick)
3793 int cpu = smp_processor_id();
3796 cpumask_set_cpu(cpu, nohz.cpu_mask);
3797 cpu_rq(cpu)->in_nohz_recently = 1;
3800 * If we are going offline and still the leader, give up!
3802 if (!cpu_active(cpu) &&
3803 atomic_read(&nohz.load_balancer) == cpu) {
3804 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
3809 /* time for ilb owner also to sleep */
3810 if (cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
3811 if (atomic_read(&nohz.load_balancer) == cpu)
3812 atomic_set(&nohz.load_balancer, -1);
3816 if (atomic_read(&nohz.load_balancer) == -1) {
3817 /* make me the ilb owner */
3818 if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1)
3820 } else if (atomic_read(&nohz.load_balancer) == cpu)
3823 if (!cpumask_test_cpu(cpu, nohz.cpu_mask))
3826 cpumask_clear_cpu(cpu, nohz.cpu_mask);
3828 if (atomic_read(&nohz.load_balancer) == cpu)
3829 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
3836 static DEFINE_SPINLOCK(balancing);
3839 * It checks each scheduling domain to see if it is due to be balanced,
3840 * and initiates a balancing operation if so.
3842 * Balancing parameters are set up in arch_init_sched_domains.
3844 static void rebalance_domains(int cpu, enum cpu_idle_type idle)
3847 struct rq *rq = cpu_rq(cpu);
3848 unsigned long interval;
3849 struct sched_domain *sd;
3850 /* Earliest time when we have to do rebalance again */
3851 unsigned long next_balance = jiffies + 60*HZ;
3852 int update_next_balance = 0;
3856 /* Fails alloc? Rebalancing probably not a priority right now. */
3857 if (!alloc_cpumask_var(&tmp, GFP_ATOMIC))
3860 for_each_domain(cpu, sd) {
3861 if (!(sd->flags & SD_LOAD_BALANCE))
3864 interval = sd->balance_interval;
3865 if (idle != CPU_IDLE)
3866 interval *= sd->busy_factor;
3868 /* scale ms to jiffies */
3869 interval = msecs_to_jiffies(interval);
3870 if (unlikely(!interval))
3872 if (interval > HZ*NR_CPUS/10)
3873 interval = HZ*NR_CPUS/10;
3875 need_serialize = sd->flags & SD_SERIALIZE;
3877 if (need_serialize) {
3878 if (!spin_trylock(&balancing))
3882 if (time_after_eq(jiffies, sd->last_balance + interval)) {
3883 if (load_balance(cpu, rq, sd, idle, &balance, tmp)) {
3885 * We've pulled tasks over so either we're no
3886 * longer idle, or one of our SMT siblings is
3889 idle = CPU_NOT_IDLE;
3891 sd->last_balance = jiffies;
3894 spin_unlock(&balancing);
3896 if (time_after(next_balance, sd->last_balance + interval)) {
3897 next_balance = sd->last_balance + interval;
3898 update_next_balance = 1;
3902 * Stop the load balance at this level. There is another
3903 * CPU in our sched group which is doing load balancing more
3911 * next_balance will be updated only when there is a need.
3912 * When the cpu is attached to null domain for ex, it will not be
3915 if (likely(update_next_balance))
3916 rq->next_balance = next_balance;
3918 free_cpumask_var(tmp);
3922 * run_rebalance_domains is triggered when needed from the scheduler tick.
3923 * In CONFIG_NO_HZ case, the idle load balance owner will do the
3924 * rebalancing for all the cpus for whom scheduler ticks are stopped.
3926 static void run_rebalance_domains(struct softirq_action *h)
3928 int this_cpu = smp_processor_id();
3929 struct rq *this_rq = cpu_rq(this_cpu);
3930 enum cpu_idle_type idle = this_rq->idle_at_tick ?
3931 CPU_IDLE : CPU_NOT_IDLE;
3933 rebalance_domains(this_cpu, idle);
3937 * If this cpu is the owner for idle load balancing, then do the
3938 * balancing on behalf of the other idle cpus whose ticks are
3941 if (this_rq->idle_at_tick &&
3942 atomic_read(&nohz.load_balancer) == this_cpu) {
3946 for_each_cpu(balance_cpu, nohz.cpu_mask) {
3947 if (balance_cpu == this_cpu)
3951 * If this cpu gets work to do, stop the load balancing
3952 * work being done for other cpus. Next load
3953 * balancing owner will pick it up.
3958 rebalance_domains(balance_cpu, CPU_IDLE);
3960 rq = cpu_rq(balance_cpu);
3961 if (time_after(this_rq->next_balance, rq->next_balance))
3962 this_rq->next_balance = rq->next_balance;
3969 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
3971 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
3972 * idle load balancing owner or decide to stop the periodic load balancing,
3973 * if the whole system is idle.
3975 static inline void trigger_load_balance(struct rq *rq, int cpu)
3979 * If we were in the nohz mode recently and busy at the current
3980 * scheduler tick, then check if we need to nominate new idle
3983 if (rq->in_nohz_recently && !rq->idle_at_tick) {
3984 rq->in_nohz_recently = 0;
3986 if (atomic_read(&nohz.load_balancer) == cpu) {
3987 cpumask_clear_cpu(cpu, nohz.cpu_mask);
3988 atomic_set(&nohz.load_balancer, -1);
3991 if (atomic_read(&nohz.load_balancer) == -1) {
3993 * simple selection for now: Nominate the
3994 * first cpu in the nohz list to be the next
3997 * TBD: Traverse the sched domains and nominate
3998 * the nearest cpu in the nohz.cpu_mask.
4000 int ilb = cpumask_first(nohz.cpu_mask);
4002 if (ilb < nr_cpu_ids)
4008 * If this cpu is idle and doing idle load balancing for all the
4009 * cpus with ticks stopped, is it time for that to stop?
4011 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu &&
4012 cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
4018 * If this cpu is idle and the idle load balancing is done by
4019 * someone else, then no need raise the SCHED_SOFTIRQ
4021 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu &&
4022 cpumask_test_cpu(cpu, nohz.cpu_mask))
4025 if (time_after_eq(jiffies, rq->next_balance))
4026 raise_softirq(SCHED_SOFTIRQ);
4029 #else /* CONFIG_SMP */
4032 * on UP we do not need to balance between CPUs:
4034 static inline void idle_balance(int cpu, struct rq *rq)
4040 DEFINE_PER_CPU(struct kernel_stat, kstat);
4042 EXPORT_PER_CPU_SYMBOL(kstat);
4045 * Return any ns on the sched_clock that have not yet been banked in
4046 * @p in case that task is currently running.
4048 unsigned long long task_delta_exec(struct task_struct *p)
4050 unsigned long flags;
4054 rq = task_rq_lock(p, &flags);
4056 if (task_current(rq, p)) {
4059 update_rq_clock(rq);
4060 delta_exec = rq->clock - p->se.exec_start;
4061 if ((s64)delta_exec > 0)
4065 task_rq_unlock(rq, &flags);
4071 * Account user cpu time to a process.
4072 * @p: the process that the cpu time gets accounted to
4073 * @cputime: the cpu time spent in user space since the last update
4075 void account_user_time(struct task_struct *p, cputime_t cputime)
4077 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4080 p->utime = cputime_add(p->utime, cputime);
4081 account_group_user_time(p, cputime);
4083 /* Add user time to cpustat. */
4084 tmp = cputime_to_cputime64(cputime);
4085 if (TASK_NICE(p) > 0)
4086 cpustat->nice = cputime64_add(cpustat->nice, tmp);
4088 cpustat->user = cputime64_add(cpustat->user, tmp);
4089 /* Account for user time used */
4090 acct_update_integrals(p);
4094 * Account guest cpu time to a process.
4095 * @p: the process that the cpu time gets accounted to
4096 * @cputime: the cpu time spent in virtual machine since the last update
4098 static void account_guest_time(struct task_struct *p, cputime_t cputime)
4101 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4103 tmp = cputime_to_cputime64(cputime);
4105 p->utime = cputime_add(p->utime, cputime);
4106 account_group_user_time(p, cputime);
4107 p->gtime = cputime_add(p->gtime, cputime);
4109 cpustat->user = cputime64_add(cpustat->user, tmp);
4110 cpustat->guest = cputime64_add(cpustat->guest, tmp);
4114 * Account scaled user cpu time to a process.
4115 * @p: the process that the cpu time gets accounted to
4116 * @cputime: the cpu time spent in user space since the last update
4118 void account_user_time_scaled(struct task_struct *p, cputime_t cputime)
4120 p->utimescaled = cputime_add(p->utimescaled, cputime);
4124 * Account system cpu time to a process.
4125 * @p: the process that the cpu time gets accounted to
4126 * @hardirq_offset: the offset to subtract from hardirq_count()
4127 * @cputime: the cpu time spent in kernel space since the last update
4129 void account_system_time(struct task_struct *p, int hardirq_offset,
4132 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4133 struct rq *rq = this_rq();
4136 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
4137 account_guest_time(p, cputime);
4141 p->stime = cputime_add(p->stime, cputime);
4142 account_group_system_time(p, cputime);
4144 /* Add system time to cpustat. */
4145 tmp = cputime_to_cputime64(cputime);
4146 if (hardirq_count() - hardirq_offset)
4147 cpustat->irq = cputime64_add(cpustat->irq, tmp);
4148 else if (softirq_count())
4149 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
4150 else if (p != rq->idle)
4151 cpustat->system = cputime64_add(cpustat->system, tmp);
4152 else if (atomic_read(&rq->nr_iowait) > 0)
4153 cpustat->iowait = cputime64_add(cpustat->iowait, tmp);
4155 cpustat->idle = cputime64_add(cpustat->idle, tmp);
4156 /* Account for system time used */
4157 acct_update_integrals(p);
4161 * Account scaled system cpu time to a process.
4162 * @p: the process that the cpu time gets accounted to
4163 * @hardirq_offset: the offset to subtract from hardirq_count()
4164 * @cputime: the cpu time spent in kernel space since the last update
4166 void account_system_time_scaled(struct task_struct *p, cputime_t cputime)
4168 p->stimescaled = cputime_add(p->stimescaled, cputime);
4172 * Account for involuntary wait time.
4173 * @p: the process from which the cpu time has been stolen
4174 * @steal: the cpu time spent in involuntary wait
4176 void account_steal_time(struct task_struct *p, cputime_t steal)
4178 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4179 cputime64_t tmp = cputime_to_cputime64(steal);
4180 struct rq *rq = this_rq();
4182 if (p == rq->idle) {
4183 p->stime = cputime_add(p->stime, steal);
4184 if (atomic_read(&rq->nr_iowait) > 0)
4185 cpustat->iowait = cputime64_add(cpustat->iowait, tmp);
4187 cpustat->idle = cputime64_add(cpustat->idle, tmp);
4189 cpustat->steal = cputime64_add(cpustat->steal, tmp);
4193 * Use precise platform statistics if available:
4195 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
4196 cputime_t task_utime(struct task_struct *p)
4201 cputime_t task_stime(struct task_struct *p)
4206 cputime_t task_utime(struct task_struct *p)
4208 clock_t utime = cputime_to_clock_t(p->utime),
4209 total = utime + cputime_to_clock_t(p->stime);
4213 * Use CFS's precise accounting:
4215 temp = (u64)nsec_to_clock_t(p->se.sum_exec_runtime);
4219 do_div(temp, total);
4221 utime = (clock_t)temp;
4223 p->prev_utime = max(p->prev_utime, clock_t_to_cputime(utime));
4224 return p->prev_utime;
4227 cputime_t task_stime(struct task_struct *p)
4232 * Use CFS's precise accounting. (we subtract utime from
4233 * the total, to make sure the total observed by userspace
4234 * grows monotonically - apps rely on that):
4236 stime = nsec_to_clock_t(p->se.sum_exec_runtime) -
4237 cputime_to_clock_t(task_utime(p));
4240 p->prev_stime = max(p->prev_stime, clock_t_to_cputime(stime));
4242 return p->prev_stime;
4246 inline cputime_t task_gtime(struct task_struct *p)
4252 * This function gets called by the timer code, with HZ frequency.
4253 * We call it with interrupts disabled.
4255 * It also gets called by the fork code, when changing the parent's
4258 void scheduler_tick(void)
4260 int cpu = smp_processor_id();
4261 struct rq *rq = cpu_rq(cpu);
4262 struct task_struct *curr = rq->curr;
4266 spin_lock(&rq->lock);
4267 update_rq_clock(rq);
4268 update_cpu_load(rq);
4269 curr->sched_class->task_tick(rq, curr, 0);
4270 spin_unlock(&rq->lock);
4273 rq->idle_at_tick = idle_cpu(cpu);
4274 trigger_load_balance(rq, cpu);
4278 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
4279 defined(CONFIG_PREEMPT_TRACER))
4281 static inline unsigned long get_parent_ip(unsigned long addr)
4283 if (in_lock_functions(addr)) {
4284 addr = CALLER_ADDR2;
4285 if (in_lock_functions(addr))
4286 addr = CALLER_ADDR3;
4291 void __kprobes add_preempt_count(int val)
4293 #ifdef CONFIG_DEBUG_PREEMPT
4297 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
4300 preempt_count() += val;
4301 #ifdef CONFIG_DEBUG_PREEMPT
4303 * Spinlock count overflowing soon?
4305 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
4308 if (preempt_count() == val)
4309 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4311 EXPORT_SYMBOL(add_preempt_count);
4313 void __kprobes sub_preempt_count(int val)
4315 #ifdef CONFIG_DEBUG_PREEMPT
4319 if (DEBUG_LOCKS_WARN_ON(val > preempt_count() - (!!kernel_locked())))
4322 * Is the spinlock portion underflowing?
4324 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
4325 !(preempt_count() & PREEMPT_MASK)))
4329 if (preempt_count() == val)
4330 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4331 preempt_count() -= val;
4333 EXPORT_SYMBOL(sub_preempt_count);
4338 * Print scheduling while atomic bug:
4340 static noinline void __schedule_bug(struct task_struct *prev)
4342 struct pt_regs *regs = get_irq_regs();
4344 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
4345 prev->comm, prev->pid, preempt_count());
4347 debug_show_held_locks(prev);
4349 if (irqs_disabled())
4350 print_irqtrace_events(prev);
4359 * Various schedule()-time debugging checks and statistics:
4361 static inline void schedule_debug(struct task_struct *prev)
4364 * Test if we are atomic. Since do_exit() needs to call into
4365 * schedule() atomically, we ignore that path for now.
4366 * Otherwise, whine if we are scheduling when we should not be.
4368 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
4369 __schedule_bug(prev);
4371 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
4373 schedstat_inc(this_rq(), sched_count);
4374 #ifdef CONFIG_SCHEDSTATS
4375 if (unlikely(prev->lock_depth >= 0)) {
4376 schedstat_inc(this_rq(), bkl_count);
4377 schedstat_inc(prev, sched_info.bkl_count);
4383 * Pick up the highest-prio task:
4385 static inline struct task_struct *
4386 pick_next_task(struct rq *rq, struct task_struct *prev)
4388 const struct sched_class *class;
4389 struct task_struct *p;
4392 * Optimization: we know that if all tasks are in
4393 * the fair class we can call that function directly:
4395 if (likely(rq->nr_running == rq->cfs.nr_running)) {
4396 p = fair_sched_class.pick_next_task(rq);
4401 class = sched_class_highest;
4403 p = class->pick_next_task(rq);
4407 * Will never be NULL as the idle class always
4408 * returns a non-NULL p:
4410 class = class->next;
4415 * schedule() is the main scheduler function.
4417 asmlinkage void __sched schedule(void)
4419 struct task_struct *prev, *next;
4420 unsigned long *switch_count;
4426 cpu = smp_processor_id();
4430 switch_count = &prev->nivcsw;
4432 release_kernel_lock(prev);
4433 need_resched_nonpreemptible:
4435 schedule_debug(prev);
4437 if (sched_feat(HRTICK))
4440 spin_lock_irq(&rq->lock);
4441 update_rq_clock(rq);
4442 clear_tsk_need_resched(prev);
4444 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
4445 if (unlikely(signal_pending_state(prev->state, prev)))
4446 prev->state = TASK_RUNNING;
4448 deactivate_task(rq, prev, 1);
4449 switch_count = &prev->nvcsw;
4453 if (prev->sched_class->pre_schedule)
4454 prev->sched_class->pre_schedule(rq, prev);
4457 if (unlikely(!rq->nr_running))
4458 idle_balance(cpu, rq);
4460 prev->sched_class->put_prev_task(rq, prev);
4461 next = pick_next_task(rq, prev);
4463 if (likely(prev != next)) {
4464 sched_info_switch(prev, next);
4470 context_switch(rq, prev, next); /* unlocks the rq */
4472 * the context switch might have flipped the stack from under
4473 * us, hence refresh the local variables.
4475 cpu = smp_processor_id();
4478 spin_unlock_irq(&rq->lock);
4480 if (unlikely(reacquire_kernel_lock(current) < 0))
4481 goto need_resched_nonpreemptible;
4483 preempt_enable_no_resched();
4484 if (unlikely(test_thread_flag(TIF_NEED_RESCHED)))
4487 EXPORT_SYMBOL(schedule);
4489 #ifdef CONFIG_PREEMPT
4491 * this is the entry point to schedule() from in-kernel preemption
4492 * off of preempt_enable. Kernel preemptions off return from interrupt
4493 * occur there and call schedule directly.
4495 asmlinkage void __sched preempt_schedule(void)
4497 struct thread_info *ti = current_thread_info();
4500 * If there is a non-zero preempt_count or interrupts are disabled,
4501 * we do not want to preempt the current task. Just return..
4503 if (likely(ti->preempt_count || irqs_disabled()))
4507 add_preempt_count(PREEMPT_ACTIVE);
4509 sub_preempt_count(PREEMPT_ACTIVE);
4512 * Check again in case we missed a preemption opportunity
4513 * between schedule and now.
4516 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED)));
4518 EXPORT_SYMBOL(preempt_schedule);
4521 * this is the entry point to schedule() from kernel preemption
4522 * off of irq context.
4523 * Note, that this is called and return with irqs disabled. This will
4524 * protect us against recursive calling from irq.
4526 asmlinkage void __sched preempt_schedule_irq(void)
4528 struct thread_info *ti = current_thread_info();
4530 /* Catch callers which need to be fixed */
4531 BUG_ON(ti->preempt_count || !irqs_disabled());
4534 add_preempt_count(PREEMPT_ACTIVE);
4537 local_irq_disable();
4538 sub_preempt_count(PREEMPT_ACTIVE);
4541 * Check again in case we missed a preemption opportunity
4542 * between schedule and now.
4545 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED)));
4548 #endif /* CONFIG_PREEMPT */
4550 int default_wake_function(wait_queue_t *curr, unsigned mode, int sync,
4553 return try_to_wake_up(curr->private, mode, sync);
4555 EXPORT_SYMBOL(default_wake_function);
4558 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
4559 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
4560 * number) then we wake all the non-exclusive tasks and one exclusive task.
4562 * There are circumstances in which we can try to wake a task which has already
4563 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
4564 * zero in this (rare) case, and we handle it by continuing to scan the queue.
4566 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
4567 int nr_exclusive, int sync, void *key)
4569 wait_queue_t *curr, *next;
4571 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
4572 unsigned flags = curr->flags;
4574 if (curr->func(curr, mode, sync, key) &&
4575 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
4581 * __wake_up - wake up threads blocked on a waitqueue.
4583 * @mode: which threads
4584 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4585 * @key: is directly passed to the wakeup function
4587 void __wake_up(wait_queue_head_t *q, unsigned int mode,
4588 int nr_exclusive, void *key)
4590 unsigned long flags;
4592 spin_lock_irqsave(&q->lock, flags);
4593 __wake_up_common(q, mode, nr_exclusive, 0, key);
4594 spin_unlock_irqrestore(&q->lock, flags);
4596 EXPORT_SYMBOL(__wake_up);
4599 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
4601 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
4603 __wake_up_common(q, mode, 1, 0, NULL);
4607 * __wake_up_sync - wake up threads blocked on a waitqueue.
4609 * @mode: which threads
4610 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4612 * The sync wakeup differs that the waker knows that it will schedule
4613 * away soon, so while the target thread will be woken up, it will not
4614 * be migrated to another CPU - ie. the two threads are 'synchronized'
4615 * with each other. This can prevent needless bouncing between CPUs.
4617 * On UP it can prevent extra preemption.
4620 __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
4622 unsigned long flags;
4628 if (unlikely(!nr_exclusive))
4631 spin_lock_irqsave(&q->lock, flags);
4632 __wake_up_common(q, mode, nr_exclusive, sync, NULL);
4633 spin_unlock_irqrestore(&q->lock, flags);
4635 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
4638 * complete: - signals a single thread waiting on this completion
4639 * @x: holds the state of this particular completion
4641 * This will wake up a single thread waiting on this completion. Threads will be
4642 * awakened in the same order in which they were queued.
4644 * See also complete_all(), wait_for_completion() and related routines.
4646 void complete(struct completion *x)
4648 unsigned long flags;
4650 spin_lock_irqsave(&x->wait.lock, flags);
4652 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
4653 spin_unlock_irqrestore(&x->wait.lock, flags);
4655 EXPORT_SYMBOL(complete);
4658 * complete_all: - signals all threads waiting on this completion
4659 * @x: holds the state of this particular completion
4661 * This will wake up all threads waiting on this particular completion event.
4663 void complete_all(struct completion *x)
4665 unsigned long flags;
4667 spin_lock_irqsave(&x->wait.lock, flags);
4668 x->done += UINT_MAX/2;
4669 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
4670 spin_unlock_irqrestore(&x->wait.lock, flags);
4672 EXPORT_SYMBOL(complete_all);
4674 static inline long __sched
4675 do_wait_for_common(struct completion *x, long timeout, int state)
4678 DECLARE_WAITQUEUE(wait, current);
4680 wait.flags |= WQ_FLAG_EXCLUSIVE;
4681 __add_wait_queue_tail(&x->wait, &wait);
4683 if (signal_pending_state(state, current)) {
4684 timeout = -ERESTARTSYS;
4687 __set_current_state(state);
4688 spin_unlock_irq(&x->wait.lock);
4689 timeout = schedule_timeout(timeout);
4690 spin_lock_irq(&x->wait.lock);
4691 } while (!x->done && timeout);
4692 __remove_wait_queue(&x->wait, &wait);
4697 return timeout ?: 1;
4701 wait_for_common(struct completion *x, long timeout, int state)
4705 spin_lock_irq(&x->wait.lock);
4706 timeout = do_wait_for_common(x, timeout, state);
4707 spin_unlock_irq(&x->wait.lock);
4712 * wait_for_completion: - waits for completion of a task
4713 * @x: holds the state of this particular completion
4715 * This waits to be signaled for completion of a specific task. It is NOT
4716 * interruptible and there is no timeout.
4718 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
4719 * and interrupt capability. Also see complete().
4721 void __sched wait_for_completion(struct completion *x)
4723 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
4725 EXPORT_SYMBOL(wait_for_completion);
4728 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
4729 * @x: holds the state of this particular completion
4730 * @timeout: timeout value in jiffies
4732 * This waits for either a completion of a specific task to be signaled or for a
4733 * specified timeout to expire. The timeout is in jiffies. It is not
4736 unsigned long __sched
4737 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
4739 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
4741 EXPORT_SYMBOL(wait_for_completion_timeout);
4744 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
4745 * @x: holds the state of this particular completion
4747 * This waits for completion of a specific task to be signaled. It is
4750 int __sched wait_for_completion_interruptible(struct completion *x)
4752 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
4753 if (t == -ERESTARTSYS)
4757 EXPORT_SYMBOL(wait_for_completion_interruptible);
4760 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
4761 * @x: holds the state of this particular completion
4762 * @timeout: timeout value in jiffies
4764 * This waits for either a completion of a specific task to be signaled or for a
4765 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
4767 unsigned long __sched
4768 wait_for_completion_interruptible_timeout(struct completion *x,
4769 unsigned long timeout)
4771 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
4773 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
4776 * wait_for_completion_killable: - waits for completion of a task (killable)
4777 * @x: holds the state of this particular completion
4779 * This waits to be signaled for completion of a specific task. It can be
4780 * interrupted by a kill signal.
4782 int __sched wait_for_completion_killable(struct completion *x)
4784 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
4785 if (t == -ERESTARTSYS)
4789 EXPORT_SYMBOL(wait_for_completion_killable);
4792 * try_wait_for_completion - try to decrement a completion without blocking
4793 * @x: completion structure
4795 * Returns: 0 if a decrement cannot be done without blocking
4796 * 1 if a decrement succeeded.
4798 * If a completion is being used as a counting completion,
4799 * attempt to decrement the counter without blocking. This
4800 * enables us to avoid waiting if the resource the completion
4801 * is protecting is not available.
4803 bool try_wait_for_completion(struct completion *x)
4807 spin_lock_irq(&x->wait.lock);
4812 spin_unlock_irq(&x->wait.lock);
4815 EXPORT_SYMBOL(try_wait_for_completion);
4818 * completion_done - Test to see if a completion has any waiters
4819 * @x: completion structure
4821 * Returns: 0 if there are waiters (wait_for_completion() in progress)
4822 * 1 if there are no waiters.
4825 bool completion_done(struct completion *x)
4829 spin_lock_irq(&x->wait.lock);
4832 spin_unlock_irq(&x->wait.lock);
4835 EXPORT_SYMBOL(completion_done);
4838 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
4840 unsigned long flags;
4843 init_waitqueue_entry(&wait, current);
4845 __set_current_state(state);
4847 spin_lock_irqsave(&q->lock, flags);
4848 __add_wait_queue(q, &wait);
4849 spin_unlock(&q->lock);
4850 timeout = schedule_timeout(timeout);
4851 spin_lock_irq(&q->lock);
4852 __remove_wait_queue(q, &wait);
4853 spin_unlock_irqrestore(&q->lock, flags);
4858 void __sched interruptible_sleep_on(wait_queue_head_t *q)
4860 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4862 EXPORT_SYMBOL(interruptible_sleep_on);
4865 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
4867 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
4869 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
4871 void __sched sleep_on(wait_queue_head_t *q)
4873 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4875 EXPORT_SYMBOL(sleep_on);
4877 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
4879 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
4881 EXPORT_SYMBOL(sleep_on_timeout);
4883 #ifdef CONFIG_RT_MUTEXES
4886 * rt_mutex_setprio - set the current priority of a task
4888 * @prio: prio value (kernel-internal form)
4890 * This function changes the 'effective' priority of a task. It does
4891 * not touch ->normal_prio like __setscheduler().
4893 * Used by the rt_mutex code to implement priority inheritance logic.
4895 void rt_mutex_setprio(struct task_struct *p, int prio)
4897 unsigned long flags;
4898 int oldprio, on_rq, running;
4900 const struct sched_class *prev_class = p->sched_class;
4902 BUG_ON(prio < 0 || prio > MAX_PRIO);
4904 rq = task_rq_lock(p, &flags);
4905 update_rq_clock(rq);
4908 on_rq = p->se.on_rq;
4909 running = task_current(rq, p);
4911 dequeue_task(rq, p, 0);
4913 p->sched_class->put_prev_task(rq, p);
4916 p->sched_class = &rt_sched_class;
4918 p->sched_class = &fair_sched_class;
4923 p->sched_class->set_curr_task(rq);
4925 enqueue_task(rq, p, 0);
4927 check_class_changed(rq, p, prev_class, oldprio, running);
4929 task_rq_unlock(rq, &flags);
4934 void set_user_nice(struct task_struct *p, long nice)
4936 int old_prio, delta, on_rq;
4937 unsigned long flags;
4940 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
4943 * We have to be careful, if called from sys_setpriority(),
4944 * the task might be in the middle of scheduling on another CPU.
4946 rq = task_rq_lock(p, &flags);
4947 update_rq_clock(rq);
4949 * The RT priorities are set via sched_setscheduler(), but we still
4950 * allow the 'normal' nice value to be set - but as expected
4951 * it wont have any effect on scheduling until the task is
4952 * SCHED_FIFO/SCHED_RR:
4954 if (task_has_rt_policy(p)) {
4955 p->static_prio = NICE_TO_PRIO(nice);
4958 on_rq = p->se.on_rq;
4960 dequeue_task(rq, p, 0);
4962 p->static_prio = NICE_TO_PRIO(nice);
4965 p->prio = effective_prio(p);
4966 delta = p->prio - old_prio;
4969 enqueue_task(rq, p, 0);
4971 * If the task increased its priority or is running and
4972 * lowered its priority, then reschedule its CPU:
4974 if (delta < 0 || (delta > 0 && task_running(rq, p)))
4975 resched_task(rq->curr);
4978 task_rq_unlock(rq, &flags);
4980 EXPORT_SYMBOL(set_user_nice);
4983 * can_nice - check if a task can reduce its nice value
4987 int can_nice(const struct task_struct *p, const int nice)
4989 /* convert nice value [19,-20] to rlimit style value [1,40] */
4990 int nice_rlim = 20 - nice;
4992 return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur ||
4993 capable(CAP_SYS_NICE));
4996 #ifdef __ARCH_WANT_SYS_NICE
4999 * sys_nice - change the priority of the current process.
5000 * @increment: priority increment
5002 * sys_setpriority is a more generic, but much slower function that
5003 * does similar things.
5005 asmlinkage long sys_nice(int increment)
5010 * Setpriority might change our priority at the same moment.
5011 * We don't have to worry. Conceptually one call occurs first
5012 * and we have a single winner.
5014 if (increment < -40)
5019 nice = PRIO_TO_NICE(current->static_prio) + increment;
5025 if (increment < 0 && !can_nice(current, nice))
5028 retval = security_task_setnice(current, nice);
5032 set_user_nice(current, nice);
5039 * task_prio - return the priority value of a given task.
5040 * @p: the task in question.
5042 * This is the priority value as seen by users in /proc.
5043 * RT tasks are offset by -200. Normal tasks are centered
5044 * around 0, value goes from -16 to +15.
5046 int task_prio(const struct task_struct *p)
5048 return p->prio - MAX_RT_PRIO;
5052 * task_nice - return the nice value of a given task.
5053 * @p: the task in question.
5055 int task_nice(const struct task_struct *p)
5057 return TASK_NICE(p);
5059 EXPORT_SYMBOL(task_nice);
5062 * idle_cpu - is a given cpu idle currently?
5063 * @cpu: the processor in question.
5065 int idle_cpu(int cpu)
5067 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
5071 * idle_task - return the idle task for a given cpu.
5072 * @cpu: the processor in question.
5074 struct task_struct *idle_task(int cpu)
5076 return cpu_rq(cpu)->idle;
5080 * find_process_by_pid - find a process with a matching PID value.
5081 * @pid: the pid in question.
5083 static struct task_struct *find_process_by_pid(pid_t pid)
5085 return pid ? find_task_by_vpid(pid) : current;
5088 /* Actually do priority change: must hold rq lock. */
5090 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
5092 BUG_ON(p->se.on_rq);
5095 switch (p->policy) {
5099 p->sched_class = &fair_sched_class;
5103 p->sched_class = &rt_sched_class;
5107 p->rt_priority = prio;
5108 p->normal_prio = normal_prio(p);
5109 /* we are holding p->pi_lock already */
5110 p->prio = rt_mutex_getprio(p);
5114 static int __sched_setscheduler(struct task_struct *p, int policy,
5115 struct sched_param *param, bool user)
5117 int retval, oldprio, oldpolicy = -1, on_rq, running;
5118 unsigned long flags;
5119 const struct sched_class *prev_class = p->sched_class;
5122 /* may grab non-irq protected spin_locks */
5123 BUG_ON(in_interrupt());
5125 /* double check policy once rq lock held */
5127 policy = oldpolicy = p->policy;
5128 else if (policy != SCHED_FIFO && policy != SCHED_RR &&
5129 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
5130 policy != SCHED_IDLE)
5133 * Valid priorities for SCHED_FIFO and SCHED_RR are
5134 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
5135 * SCHED_BATCH and SCHED_IDLE is 0.
5137 if (param->sched_priority < 0 ||
5138 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
5139 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
5141 if (rt_policy(policy) != (param->sched_priority != 0))
5145 * Allow unprivileged RT tasks to decrease priority:
5147 if (user && !capable(CAP_SYS_NICE)) {
5148 if (rt_policy(policy)) {
5149 unsigned long rlim_rtprio;
5151 if (!lock_task_sighand(p, &flags))
5153 rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur;
5154 unlock_task_sighand(p, &flags);
5156 /* can't set/change the rt policy */
5157 if (policy != p->policy && !rlim_rtprio)
5160 /* can't increase priority */
5161 if (param->sched_priority > p->rt_priority &&
5162 param->sched_priority > rlim_rtprio)
5166 * Like positive nice levels, dont allow tasks to
5167 * move out of SCHED_IDLE either:
5169 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
5172 /* can't change other user's priorities */
5173 if ((current->euid != p->euid) &&
5174 (current->euid != p->uid))
5179 #ifdef CONFIG_RT_GROUP_SCHED
5181 * Do not allow realtime tasks into groups that have no runtime
5184 if (rt_bandwidth_enabled() && rt_policy(policy) &&
5185 task_group(p)->rt_bandwidth.rt_runtime == 0)
5189 retval = security_task_setscheduler(p, policy, param);
5195 * make sure no PI-waiters arrive (or leave) while we are
5196 * changing the priority of the task:
5198 spin_lock_irqsave(&p->pi_lock, flags);
5200 * To be able to change p->policy safely, the apropriate
5201 * runqueue lock must be held.
5203 rq = __task_rq_lock(p);
5204 /* recheck policy now with rq lock held */
5205 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
5206 policy = oldpolicy = -1;
5207 __task_rq_unlock(rq);
5208 spin_unlock_irqrestore(&p->pi_lock, flags);
5211 update_rq_clock(rq);
5212 on_rq = p->se.on_rq;
5213 running = task_current(rq, p);
5215 deactivate_task(rq, p, 0);
5217 p->sched_class->put_prev_task(rq, p);
5220 __setscheduler(rq, p, policy, param->sched_priority);
5223 p->sched_class->set_curr_task(rq);
5225 activate_task(rq, p, 0);
5227 check_class_changed(rq, p, prev_class, oldprio, running);
5229 __task_rq_unlock(rq);
5230 spin_unlock_irqrestore(&p->pi_lock, flags);
5232 rt_mutex_adjust_pi(p);
5238 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
5239 * @p: the task in question.
5240 * @policy: new policy.
5241 * @param: structure containing the new RT priority.
5243 * NOTE that the task may be already dead.
5245 int sched_setscheduler(struct task_struct *p, int policy,
5246 struct sched_param *param)
5248 return __sched_setscheduler(p, policy, param, true);
5250 EXPORT_SYMBOL_GPL(sched_setscheduler);
5253 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
5254 * @p: the task in question.
5255 * @policy: new policy.
5256 * @param: structure containing the new RT priority.
5258 * Just like sched_setscheduler, only don't bother checking if the
5259 * current context has permission. For example, this is needed in
5260 * stop_machine(): we create temporary high priority worker threads,
5261 * but our caller might not have that capability.
5263 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
5264 struct sched_param *param)
5266 return __sched_setscheduler(p, policy, param, false);
5270 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
5272 struct sched_param lparam;
5273 struct task_struct *p;
5276 if (!param || pid < 0)
5278 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
5283 p = find_process_by_pid(pid);
5285 retval = sched_setscheduler(p, policy, &lparam);
5292 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
5293 * @pid: the pid in question.
5294 * @policy: new policy.
5295 * @param: structure containing the new RT priority.
5298 sys_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
5300 /* negative values for policy are not valid */
5304 return do_sched_setscheduler(pid, policy, param);
5308 * sys_sched_setparam - set/change the RT priority of a thread
5309 * @pid: the pid in question.
5310 * @param: structure containing the new RT priority.
5312 asmlinkage long sys_sched_setparam(pid_t pid, struct sched_param __user *param)
5314 return do_sched_setscheduler(pid, -1, param);
5318 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
5319 * @pid: the pid in question.
5321 asmlinkage long sys_sched_getscheduler(pid_t pid)
5323 struct task_struct *p;
5330 read_lock(&tasklist_lock);
5331 p = find_process_by_pid(pid);
5333 retval = security_task_getscheduler(p);
5337 read_unlock(&tasklist_lock);
5342 * sys_sched_getscheduler - get the RT priority of a thread
5343 * @pid: the pid in question.
5344 * @param: structure containing the RT priority.
5346 asmlinkage long sys_sched_getparam(pid_t pid, struct sched_param __user *param)
5348 struct sched_param lp;
5349 struct task_struct *p;
5352 if (!param || pid < 0)
5355 read_lock(&tasklist_lock);
5356 p = find_process_by_pid(pid);
5361 retval = security_task_getscheduler(p);
5365 lp.sched_priority = p->rt_priority;
5366 read_unlock(&tasklist_lock);
5369 * This one might sleep, we cannot do it with a spinlock held ...
5371 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
5376 read_unlock(&tasklist_lock);
5380 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
5382 cpumask_var_t cpus_allowed, new_mask;
5383 struct task_struct *p;
5387 read_lock(&tasklist_lock);
5389 p = find_process_by_pid(pid);
5391 read_unlock(&tasklist_lock);
5397 * It is not safe to call set_cpus_allowed with the
5398 * tasklist_lock held. We will bump the task_struct's
5399 * usage count and then drop tasklist_lock.
5402 read_unlock(&tasklist_lock);
5404 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
5408 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
5410 goto out_free_cpus_allowed;
5413 if ((current->euid != p->euid) && (current->euid != p->uid) &&
5414 !capable(CAP_SYS_NICE))
5417 retval = security_task_setscheduler(p, 0, NULL);
5421 cpuset_cpus_allowed(p, cpus_allowed);
5422 cpumask_and(new_mask, in_mask, cpus_allowed);
5424 retval = set_cpus_allowed_ptr(p, new_mask);
5427 cpuset_cpus_allowed(p, cpus_allowed);
5428 if (!cpumask_subset(new_mask, cpus_allowed)) {
5430 * We must have raced with a concurrent cpuset
5431 * update. Just reset the cpus_allowed to the
5432 * cpuset's cpus_allowed
5434 cpumask_copy(new_mask, cpus_allowed);
5439 free_cpumask_var(new_mask);
5440 out_free_cpus_allowed:
5441 free_cpumask_var(cpus_allowed);
5448 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
5449 struct cpumask *new_mask)
5451 if (len < cpumask_size())
5452 cpumask_clear(new_mask);
5453 else if (len > cpumask_size())
5454 len = cpumask_size();
5456 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
5460 * sys_sched_setaffinity - set the cpu affinity of a process
5461 * @pid: pid of the process
5462 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5463 * @user_mask_ptr: user-space pointer to the new cpu mask
5465 asmlinkage long sys_sched_setaffinity(pid_t pid, unsigned int len,
5466 unsigned long __user *user_mask_ptr)
5468 cpumask_var_t new_mask;
5471 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
5474 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
5476 retval = sched_setaffinity(pid, new_mask);
5477 free_cpumask_var(new_mask);
5481 long sched_getaffinity(pid_t pid, struct cpumask *mask)
5483 struct task_struct *p;
5487 read_lock(&tasklist_lock);
5490 p = find_process_by_pid(pid);
5494 retval = security_task_getscheduler(p);
5498 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
5501 read_unlock(&tasklist_lock);
5508 * sys_sched_getaffinity - get the cpu affinity of a process
5509 * @pid: pid of the process
5510 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5511 * @user_mask_ptr: user-space pointer to hold the current cpu mask
5513 asmlinkage long sys_sched_getaffinity(pid_t pid, unsigned int len,
5514 unsigned long __user *user_mask_ptr)
5519 if (len < cpumask_size())
5522 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
5525 ret = sched_getaffinity(pid, mask);
5527 if (copy_to_user(user_mask_ptr, mask, cpumask_size()))
5530 ret = cpumask_size();
5532 free_cpumask_var(mask);
5538 * sys_sched_yield - yield the current processor to other threads.
5540 * This function yields the current CPU to other tasks. If there are no
5541 * other threads running on this CPU then this function will return.
5543 asmlinkage long sys_sched_yield(void)
5545 struct rq *rq = this_rq_lock();
5547 schedstat_inc(rq, yld_count);
5548 current->sched_class->yield_task(rq);
5551 * Since we are going to call schedule() anyway, there's
5552 * no need to preempt or enable interrupts:
5554 __release(rq->lock);
5555 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
5556 _raw_spin_unlock(&rq->lock);
5557 preempt_enable_no_resched();
5564 static void __cond_resched(void)
5566 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
5567 __might_sleep(__FILE__, __LINE__);
5570 * The BKS might be reacquired before we have dropped
5571 * PREEMPT_ACTIVE, which could trigger a second
5572 * cond_resched() call.
5575 add_preempt_count(PREEMPT_ACTIVE);
5577 sub_preempt_count(PREEMPT_ACTIVE);
5578 } while (need_resched());
5581 int __sched _cond_resched(void)
5583 if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE) &&
5584 system_state == SYSTEM_RUNNING) {
5590 EXPORT_SYMBOL(_cond_resched);
5593 * cond_resched_lock() - if a reschedule is pending, drop the given lock,
5594 * call schedule, and on return reacquire the lock.
5596 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
5597 * operations here to prevent schedule() from being called twice (once via
5598 * spin_unlock(), once by hand).
5600 int cond_resched_lock(spinlock_t *lock)
5602 int resched = need_resched() && system_state == SYSTEM_RUNNING;
5605 if (spin_needbreak(lock) || resched) {
5607 if (resched && need_resched())
5616 EXPORT_SYMBOL(cond_resched_lock);
5618 int __sched cond_resched_softirq(void)
5620 BUG_ON(!in_softirq());
5622 if (need_resched() && system_state == SYSTEM_RUNNING) {
5630 EXPORT_SYMBOL(cond_resched_softirq);
5633 * yield - yield the current processor to other threads.
5635 * This is a shortcut for kernel-space yielding - it marks the
5636 * thread runnable and calls sys_sched_yield().
5638 void __sched yield(void)
5640 set_current_state(TASK_RUNNING);
5643 EXPORT_SYMBOL(yield);
5646 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
5647 * that process accounting knows that this is a task in IO wait state.
5649 * But don't do that if it is a deliberate, throttling IO wait (this task
5650 * has set its backing_dev_info: the queue against which it should throttle)
5652 void __sched io_schedule(void)
5654 struct rq *rq = &__raw_get_cpu_var(runqueues);
5656 delayacct_blkio_start();
5657 atomic_inc(&rq->nr_iowait);
5659 atomic_dec(&rq->nr_iowait);
5660 delayacct_blkio_end();
5662 EXPORT_SYMBOL(io_schedule);
5664 long __sched io_schedule_timeout(long timeout)
5666 struct rq *rq = &__raw_get_cpu_var(runqueues);
5669 delayacct_blkio_start();
5670 atomic_inc(&rq->nr_iowait);
5671 ret = schedule_timeout(timeout);
5672 atomic_dec(&rq->nr_iowait);
5673 delayacct_blkio_end();
5678 * sys_sched_get_priority_max - return maximum RT priority.
5679 * @policy: scheduling class.
5681 * this syscall returns the maximum rt_priority that can be used
5682 * by a given scheduling class.
5684 asmlinkage long sys_sched_get_priority_max(int policy)
5691 ret = MAX_USER_RT_PRIO-1;
5703 * sys_sched_get_priority_min - return minimum RT priority.
5704 * @policy: scheduling class.
5706 * this syscall returns the minimum rt_priority that can be used
5707 * by a given scheduling class.
5709 asmlinkage long sys_sched_get_priority_min(int policy)
5727 * sys_sched_rr_get_interval - return the default timeslice of a process.
5728 * @pid: pid of the process.
5729 * @interval: userspace pointer to the timeslice value.
5731 * this syscall writes the default timeslice value of a given process
5732 * into the user-space timespec buffer. A value of '0' means infinity.
5735 long sys_sched_rr_get_interval(pid_t pid, struct timespec __user *interval)
5737 struct task_struct *p;
5738 unsigned int time_slice;
5746 read_lock(&tasklist_lock);
5747 p = find_process_by_pid(pid);
5751 retval = security_task_getscheduler(p);
5756 * Time slice is 0 for SCHED_FIFO tasks and for SCHED_OTHER
5757 * tasks that are on an otherwise idle runqueue:
5760 if (p->policy == SCHED_RR) {
5761 time_slice = DEF_TIMESLICE;
5762 } else if (p->policy != SCHED_FIFO) {
5763 struct sched_entity *se = &p->se;
5764 unsigned long flags;
5767 rq = task_rq_lock(p, &flags);
5768 if (rq->cfs.load.weight)
5769 time_slice = NS_TO_JIFFIES(sched_slice(&rq->cfs, se));
5770 task_rq_unlock(rq, &flags);
5772 read_unlock(&tasklist_lock);
5773 jiffies_to_timespec(time_slice, &t);
5774 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
5778 read_unlock(&tasklist_lock);
5782 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
5784 void sched_show_task(struct task_struct *p)
5786 unsigned long free = 0;
5789 state = p->state ? __ffs(p->state) + 1 : 0;
5790 printk(KERN_INFO "%-13.13s %c", p->comm,
5791 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
5792 #if BITS_PER_LONG == 32
5793 if (state == TASK_RUNNING)
5794 printk(KERN_CONT " running ");
5796 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
5798 if (state == TASK_RUNNING)
5799 printk(KERN_CONT " running task ");
5801 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
5803 #ifdef CONFIG_DEBUG_STACK_USAGE
5805 unsigned long *n = end_of_stack(p);
5808 free = (unsigned long)n - (unsigned long)end_of_stack(p);
5811 printk(KERN_CONT "%5lu %5d %6d\n", free,
5812 task_pid_nr(p), task_pid_nr(p->real_parent));
5814 show_stack(p, NULL);
5817 void show_state_filter(unsigned long state_filter)
5819 struct task_struct *g, *p;
5821 #if BITS_PER_LONG == 32
5823 " task PC stack pid father\n");
5826 " task PC stack pid father\n");
5828 read_lock(&tasklist_lock);
5829 do_each_thread(g, p) {
5831 * reset the NMI-timeout, listing all files on a slow
5832 * console might take alot of time:
5834 touch_nmi_watchdog();
5835 if (!state_filter || (p->state & state_filter))
5837 } while_each_thread(g, p);
5839 touch_all_softlockup_watchdogs();
5841 #ifdef CONFIG_SCHED_DEBUG
5842 sysrq_sched_debug_show();
5844 read_unlock(&tasklist_lock);
5846 * Only show locks if all tasks are dumped:
5848 if (state_filter == -1)
5849 debug_show_all_locks();
5852 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
5854 idle->sched_class = &idle_sched_class;
5858 * init_idle - set up an idle thread for a given CPU
5859 * @idle: task in question
5860 * @cpu: cpu the idle task belongs to
5862 * NOTE: this function does not set the idle thread's NEED_RESCHED
5863 * flag, to make booting more robust.
5865 void __cpuinit init_idle(struct task_struct *idle, int cpu)
5867 struct rq *rq = cpu_rq(cpu);
5868 unsigned long flags;
5870 spin_lock_irqsave(&rq->lock, flags);
5873 idle->se.exec_start = sched_clock();
5875 idle->prio = idle->normal_prio = MAX_PRIO;
5876 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
5877 __set_task_cpu(idle, cpu);
5879 rq->curr = rq->idle = idle;
5880 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
5883 spin_unlock_irqrestore(&rq->lock, flags);
5885 /* Set the preempt count _outside_ the spinlocks! */
5886 #if defined(CONFIG_PREEMPT)
5887 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
5889 task_thread_info(idle)->preempt_count = 0;
5892 * The idle tasks have their own, simple scheduling class:
5894 idle->sched_class = &idle_sched_class;
5895 ftrace_retfunc_init_task(idle);
5899 * In a system that switches off the HZ timer nohz_cpu_mask
5900 * indicates which cpus entered this state. This is used
5901 * in the rcu update to wait only for active cpus. For system
5902 * which do not switch off the HZ timer nohz_cpu_mask should
5903 * always be CPU_BITS_NONE.
5905 cpumask_var_t nohz_cpu_mask;
5908 * Increase the granularity value when there are more CPUs,
5909 * because with more CPUs the 'effective latency' as visible
5910 * to users decreases. But the relationship is not linear,
5911 * so pick a second-best guess by going with the log2 of the
5914 * This idea comes from the SD scheduler of Con Kolivas:
5916 static inline void sched_init_granularity(void)
5918 unsigned int factor = 1 + ilog2(num_online_cpus());
5919 const unsigned long limit = 200000000;
5921 sysctl_sched_min_granularity *= factor;
5922 if (sysctl_sched_min_granularity > limit)
5923 sysctl_sched_min_granularity = limit;
5925 sysctl_sched_latency *= factor;
5926 if (sysctl_sched_latency > limit)
5927 sysctl_sched_latency = limit;
5929 sysctl_sched_wakeup_granularity *= factor;
5931 sysctl_sched_shares_ratelimit *= factor;
5936 * This is how migration works:
5938 * 1) we queue a struct migration_req structure in the source CPU's
5939 * runqueue and wake up that CPU's migration thread.
5940 * 2) we down() the locked semaphore => thread blocks.
5941 * 3) migration thread wakes up (implicitly it forces the migrated
5942 * thread off the CPU)
5943 * 4) it gets the migration request and checks whether the migrated
5944 * task is still in the wrong runqueue.
5945 * 5) if it's in the wrong runqueue then the migration thread removes
5946 * it and puts it into the right queue.
5947 * 6) migration thread up()s the semaphore.
5948 * 7) we wake up and the migration is done.
5952 * Change a given task's CPU affinity. Migrate the thread to a
5953 * proper CPU and schedule it away if the CPU it's executing on
5954 * is removed from the allowed bitmask.
5956 * NOTE: the caller must have a valid reference to the task, the
5957 * task must not exit() & deallocate itself prematurely. The
5958 * call is not atomic; no spinlocks may be held.
5960 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
5962 struct migration_req req;
5963 unsigned long flags;
5967 rq = task_rq_lock(p, &flags);
5968 if (!cpumask_intersects(new_mask, cpu_online_mask)) {
5973 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
5974 !cpumask_equal(&p->cpus_allowed, new_mask))) {
5979 if (p->sched_class->set_cpus_allowed)
5980 p->sched_class->set_cpus_allowed(p, new_mask);
5982 cpumask_copy(&p->cpus_allowed, new_mask);
5983 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
5986 /* Can the task run on the task's current CPU? If so, we're done */
5987 if (cpumask_test_cpu(task_cpu(p), new_mask))
5990 if (migrate_task(p, cpumask_any_and(cpu_online_mask, new_mask), &req)) {
5991 /* Need help from migration thread: drop lock and wait. */
5992 task_rq_unlock(rq, &flags);
5993 wake_up_process(rq->migration_thread);
5994 wait_for_completion(&req.done);
5995 tlb_migrate_finish(p->mm);
5999 task_rq_unlock(rq, &flags);
6003 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
6006 * Move (not current) task off this cpu, onto dest cpu. We're doing
6007 * this because either it can't run here any more (set_cpus_allowed()
6008 * away from this CPU, or CPU going down), or because we're
6009 * attempting to rebalance this task on exec (sched_exec).
6011 * So we race with normal scheduler movements, but that's OK, as long
6012 * as the task is no longer on this CPU.
6014 * Returns non-zero if task was successfully migrated.
6016 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
6018 struct rq *rq_dest, *rq_src;
6021 if (unlikely(!cpu_active(dest_cpu)))
6024 rq_src = cpu_rq(src_cpu);
6025 rq_dest = cpu_rq(dest_cpu);
6027 double_rq_lock(rq_src, rq_dest);
6028 /* Already moved. */
6029 if (task_cpu(p) != src_cpu)
6031 /* Affinity changed (again). */
6032 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
6035 on_rq = p->se.on_rq;
6037 deactivate_task(rq_src, p, 0);
6039 set_task_cpu(p, dest_cpu);
6041 activate_task(rq_dest, p, 0);
6042 check_preempt_curr(rq_dest, p, 0);
6047 double_rq_unlock(rq_src, rq_dest);
6052 * migration_thread - this is a highprio system thread that performs
6053 * thread migration by bumping thread off CPU then 'pushing' onto
6056 static int migration_thread(void *data)
6058 int cpu = (long)data;
6062 BUG_ON(rq->migration_thread != current);
6064 set_current_state(TASK_INTERRUPTIBLE);
6065 while (!kthread_should_stop()) {
6066 struct migration_req *req;
6067 struct list_head *head;
6069 spin_lock_irq(&rq->lock);
6071 if (cpu_is_offline(cpu)) {
6072 spin_unlock_irq(&rq->lock);
6076 if (rq->active_balance) {
6077 active_load_balance(rq, cpu);
6078 rq->active_balance = 0;
6081 head = &rq->migration_queue;
6083 if (list_empty(head)) {
6084 spin_unlock_irq(&rq->lock);
6086 set_current_state(TASK_INTERRUPTIBLE);
6089 req = list_entry(head->next, struct migration_req, list);
6090 list_del_init(head->next);
6092 spin_unlock(&rq->lock);
6093 __migrate_task(req->task, cpu, req->dest_cpu);
6096 complete(&req->done);
6098 __set_current_state(TASK_RUNNING);
6102 /* Wait for kthread_stop */
6103 set_current_state(TASK_INTERRUPTIBLE);
6104 while (!kthread_should_stop()) {
6106 set_current_state(TASK_INTERRUPTIBLE);
6108 __set_current_state(TASK_RUNNING);
6112 #ifdef CONFIG_HOTPLUG_CPU
6114 static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu)
6118 local_irq_disable();
6119 ret = __migrate_task(p, src_cpu, dest_cpu);
6125 * Figure out where task on dead CPU should go, use force if necessary.
6127 static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
6130 /* FIXME: Use cpumask_of_node here. */
6131 cpumask_t _nodemask = node_to_cpumask(cpu_to_node(dead_cpu));
6132 const struct cpumask *nodemask = &_nodemask;
6135 /* Look for allowed, online CPU in same node. */
6136 for_each_cpu_and(dest_cpu, nodemask, cpu_online_mask)
6137 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
6140 /* Any allowed, online CPU? */
6141 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_online_mask);
6142 if (dest_cpu < nr_cpu_ids)
6145 /* No more Mr. Nice Guy. */
6146 if (dest_cpu >= nr_cpu_ids) {
6147 cpuset_cpus_allowed_locked(p, &p->cpus_allowed);
6148 dest_cpu = cpumask_any_and(cpu_online_mask, &p->cpus_allowed);
6151 * Don't tell them about moving exiting tasks or
6152 * kernel threads (both mm NULL), since they never
6155 if (p->mm && printk_ratelimit()) {
6156 printk(KERN_INFO "process %d (%s) no "
6157 "longer affine to cpu%d\n",
6158 task_pid_nr(p), p->comm, dead_cpu);
6163 /* It can have affinity changed while we were choosing. */
6164 if (unlikely(!__migrate_task_irq(p, dead_cpu, dest_cpu)))
6169 * While a dead CPU has no uninterruptible tasks queued at this point,
6170 * it might still have a nonzero ->nr_uninterruptible counter, because
6171 * for performance reasons the counter is not stricly tracking tasks to
6172 * their home CPUs. So we just add the counter to another CPU's counter,
6173 * to keep the global sum constant after CPU-down:
6175 static void migrate_nr_uninterruptible(struct rq *rq_src)
6177 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_online_mask));
6178 unsigned long flags;
6180 local_irq_save(flags);
6181 double_rq_lock(rq_src, rq_dest);
6182 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
6183 rq_src->nr_uninterruptible = 0;
6184 double_rq_unlock(rq_src, rq_dest);
6185 local_irq_restore(flags);
6188 /* Run through task list and migrate tasks from the dead cpu. */
6189 static void migrate_live_tasks(int src_cpu)
6191 struct task_struct *p, *t;
6193 read_lock(&tasklist_lock);
6195 do_each_thread(t, p) {
6199 if (task_cpu(p) == src_cpu)
6200 move_task_off_dead_cpu(src_cpu, p);
6201 } while_each_thread(t, p);
6203 read_unlock(&tasklist_lock);
6207 * Schedules idle task to be the next runnable task on current CPU.
6208 * It does so by boosting its priority to highest possible.
6209 * Used by CPU offline code.
6211 void sched_idle_next(void)
6213 int this_cpu = smp_processor_id();
6214 struct rq *rq = cpu_rq(this_cpu);
6215 struct task_struct *p = rq->idle;
6216 unsigned long flags;
6218 /* cpu has to be offline */
6219 BUG_ON(cpu_online(this_cpu));
6222 * Strictly not necessary since rest of the CPUs are stopped by now
6223 * and interrupts disabled on the current cpu.
6225 spin_lock_irqsave(&rq->lock, flags);
6227 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6229 update_rq_clock(rq);
6230 activate_task(rq, p, 0);
6232 spin_unlock_irqrestore(&rq->lock, flags);
6236 * Ensures that the idle task is using init_mm right before its cpu goes
6239 void idle_task_exit(void)
6241 struct mm_struct *mm = current->active_mm;
6243 BUG_ON(cpu_online(smp_processor_id()));
6246 switch_mm(mm, &init_mm, current);
6250 /* called under rq->lock with disabled interrupts */
6251 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
6253 struct rq *rq = cpu_rq(dead_cpu);
6255 /* Must be exiting, otherwise would be on tasklist. */
6256 BUG_ON(!p->exit_state);
6258 /* Cannot have done final schedule yet: would have vanished. */
6259 BUG_ON(p->state == TASK_DEAD);
6264 * Drop lock around migration; if someone else moves it,
6265 * that's OK. No task can be added to this CPU, so iteration is
6268 spin_unlock_irq(&rq->lock);
6269 move_task_off_dead_cpu(dead_cpu, p);
6270 spin_lock_irq(&rq->lock);
6275 /* release_task() removes task from tasklist, so we won't find dead tasks. */
6276 static void migrate_dead_tasks(unsigned int dead_cpu)
6278 struct rq *rq = cpu_rq(dead_cpu);
6279 struct task_struct *next;
6282 if (!rq->nr_running)
6284 update_rq_clock(rq);
6285 next = pick_next_task(rq, rq->curr);
6288 next->sched_class->put_prev_task(rq, next);
6289 migrate_dead(dead_cpu, next);
6293 #endif /* CONFIG_HOTPLUG_CPU */
6295 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
6297 static struct ctl_table sd_ctl_dir[] = {
6299 .procname = "sched_domain",
6305 static struct ctl_table sd_ctl_root[] = {
6307 .ctl_name = CTL_KERN,
6308 .procname = "kernel",
6310 .child = sd_ctl_dir,
6315 static struct ctl_table *sd_alloc_ctl_entry(int n)
6317 struct ctl_table *entry =
6318 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
6323 static void sd_free_ctl_entry(struct ctl_table **tablep)
6325 struct ctl_table *entry;
6328 * In the intermediate directories, both the child directory and
6329 * procname are dynamically allocated and could fail but the mode
6330 * will always be set. In the lowest directory the names are
6331 * static strings and all have proc handlers.
6333 for (entry = *tablep; entry->mode; entry++) {
6335 sd_free_ctl_entry(&entry->child);
6336 if (entry->proc_handler == NULL)
6337 kfree(entry->procname);
6345 set_table_entry(struct ctl_table *entry,
6346 const char *procname, void *data, int maxlen,
6347 mode_t mode, proc_handler *proc_handler)
6349 entry->procname = procname;
6351 entry->maxlen = maxlen;
6353 entry->proc_handler = proc_handler;
6356 static struct ctl_table *
6357 sd_alloc_ctl_domain_table(struct sched_domain *sd)
6359 struct ctl_table *table = sd_alloc_ctl_entry(13);
6364 set_table_entry(&table[0], "min_interval", &sd->min_interval,
6365 sizeof(long), 0644, proc_doulongvec_minmax);
6366 set_table_entry(&table[1], "max_interval", &sd->max_interval,
6367 sizeof(long), 0644, proc_doulongvec_minmax);
6368 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
6369 sizeof(int), 0644, proc_dointvec_minmax);
6370 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
6371 sizeof(int), 0644, proc_dointvec_minmax);
6372 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
6373 sizeof(int), 0644, proc_dointvec_minmax);
6374 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
6375 sizeof(int), 0644, proc_dointvec_minmax);
6376 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
6377 sizeof(int), 0644, proc_dointvec_minmax);
6378 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
6379 sizeof(int), 0644, proc_dointvec_minmax);
6380 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
6381 sizeof(int), 0644, proc_dointvec_minmax);
6382 set_table_entry(&table[9], "cache_nice_tries",
6383 &sd->cache_nice_tries,
6384 sizeof(int), 0644, proc_dointvec_minmax);
6385 set_table_entry(&table[10], "flags", &sd->flags,
6386 sizeof(int), 0644, proc_dointvec_minmax);
6387 set_table_entry(&table[11], "name", sd->name,
6388 CORENAME_MAX_SIZE, 0444, proc_dostring);
6389 /* &table[12] is terminator */
6394 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
6396 struct ctl_table *entry, *table;
6397 struct sched_domain *sd;
6398 int domain_num = 0, i;
6401 for_each_domain(cpu, sd)
6403 entry = table = sd_alloc_ctl_entry(domain_num + 1);
6408 for_each_domain(cpu, sd) {
6409 snprintf(buf, 32, "domain%d", i);
6410 entry->procname = kstrdup(buf, GFP_KERNEL);
6412 entry->child = sd_alloc_ctl_domain_table(sd);
6419 static struct ctl_table_header *sd_sysctl_header;
6420 static void register_sched_domain_sysctl(void)
6422 int i, cpu_num = num_online_cpus();
6423 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
6426 WARN_ON(sd_ctl_dir[0].child);
6427 sd_ctl_dir[0].child = entry;
6432 for_each_online_cpu(i) {
6433 snprintf(buf, 32, "cpu%d", i);
6434 entry->procname = kstrdup(buf, GFP_KERNEL);
6436 entry->child = sd_alloc_ctl_cpu_table(i);
6440 WARN_ON(sd_sysctl_header);
6441 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
6444 /* may be called multiple times per register */
6445 static void unregister_sched_domain_sysctl(void)
6447 if (sd_sysctl_header)
6448 unregister_sysctl_table(sd_sysctl_header);
6449 sd_sysctl_header = NULL;
6450 if (sd_ctl_dir[0].child)
6451 sd_free_ctl_entry(&sd_ctl_dir[0].child);
6454 static void register_sched_domain_sysctl(void)
6457 static void unregister_sched_domain_sysctl(void)
6462 static void set_rq_online(struct rq *rq)
6465 const struct sched_class *class;
6467 cpumask_set_cpu(rq->cpu, rq->rd->online);
6470 for_each_class(class) {
6471 if (class->rq_online)
6472 class->rq_online(rq);
6477 static void set_rq_offline(struct rq *rq)
6480 const struct sched_class *class;
6482 for_each_class(class) {
6483 if (class->rq_offline)
6484 class->rq_offline(rq);
6487 cpumask_clear_cpu(rq->cpu, rq->rd->online);
6493 * migration_call - callback that gets triggered when a CPU is added.
6494 * Here we can start up the necessary migration thread for the new CPU.
6496 static int __cpuinit
6497 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
6499 struct task_struct *p;
6500 int cpu = (long)hcpu;
6501 unsigned long flags;
6506 case CPU_UP_PREPARE:
6507 case CPU_UP_PREPARE_FROZEN:
6508 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
6511 kthread_bind(p, cpu);
6512 /* Must be high prio: stop_machine expects to yield to it. */
6513 rq = task_rq_lock(p, &flags);
6514 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6515 task_rq_unlock(rq, &flags);
6516 cpu_rq(cpu)->migration_thread = p;
6520 case CPU_ONLINE_FROZEN:
6521 /* Strictly unnecessary, as first user will wake it. */
6522 wake_up_process(cpu_rq(cpu)->migration_thread);
6524 /* Update our root-domain */
6526 spin_lock_irqsave(&rq->lock, flags);
6528 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
6532 spin_unlock_irqrestore(&rq->lock, flags);
6535 #ifdef CONFIG_HOTPLUG_CPU
6536 case CPU_UP_CANCELED:
6537 case CPU_UP_CANCELED_FROZEN:
6538 if (!cpu_rq(cpu)->migration_thread)
6540 /* Unbind it from offline cpu so it can run. Fall thru. */
6541 kthread_bind(cpu_rq(cpu)->migration_thread,
6542 cpumask_any(cpu_online_mask));
6543 kthread_stop(cpu_rq(cpu)->migration_thread);
6544 cpu_rq(cpu)->migration_thread = NULL;
6548 case CPU_DEAD_FROZEN:
6549 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
6550 migrate_live_tasks(cpu);
6552 kthread_stop(rq->migration_thread);
6553 rq->migration_thread = NULL;
6554 /* Idle task back to normal (off runqueue, low prio) */
6555 spin_lock_irq(&rq->lock);
6556 update_rq_clock(rq);
6557 deactivate_task(rq, rq->idle, 0);
6558 rq->idle->static_prio = MAX_PRIO;
6559 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
6560 rq->idle->sched_class = &idle_sched_class;
6561 migrate_dead_tasks(cpu);
6562 spin_unlock_irq(&rq->lock);
6564 migrate_nr_uninterruptible(rq);
6565 BUG_ON(rq->nr_running != 0);
6568 * No need to migrate the tasks: it was best-effort if
6569 * they didn't take sched_hotcpu_mutex. Just wake up
6572 spin_lock_irq(&rq->lock);
6573 while (!list_empty(&rq->migration_queue)) {
6574 struct migration_req *req;
6576 req = list_entry(rq->migration_queue.next,
6577 struct migration_req, list);
6578 list_del_init(&req->list);
6579 complete(&req->done);
6581 spin_unlock_irq(&rq->lock);
6585 case CPU_DYING_FROZEN:
6586 /* Update our root-domain */
6588 spin_lock_irqsave(&rq->lock, flags);
6590 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
6593 spin_unlock_irqrestore(&rq->lock, flags);
6600 /* Register at highest priority so that task migration (migrate_all_tasks)
6601 * happens before everything else.
6603 static struct notifier_block __cpuinitdata migration_notifier = {
6604 .notifier_call = migration_call,
6608 static int __init migration_init(void)
6610 void *cpu = (void *)(long)smp_processor_id();
6613 /* Start one for the boot CPU: */
6614 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
6615 BUG_ON(err == NOTIFY_BAD);
6616 migration_call(&migration_notifier, CPU_ONLINE, cpu);
6617 register_cpu_notifier(&migration_notifier);
6621 early_initcall(migration_init);
6626 #ifdef CONFIG_SCHED_DEBUG
6628 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
6629 struct cpumask *groupmask)
6631 struct sched_group *group = sd->groups;
6634 cpulist_scnprintf(str, sizeof(str), *sched_domain_span(sd));
6635 cpumask_clear(groupmask);
6637 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
6639 if (!(sd->flags & SD_LOAD_BALANCE)) {
6640 printk("does not load-balance\n");
6642 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
6647 printk(KERN_CONT "span %s level %s\n", str, sd->name);
6649 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
6650 printk(KERN_ERR "ERROR: domain->span does not contain "
6653 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
6654 printk(KERN_ERR "ERROR: domain->groups does not contain"
6658 printk(KERN_DEBUG "%*s groups:", level + 1, "");
6662 printk(KERN_ERR "ERROR: group is NULL\n");
6666 if (!group->__cpu_power) {
6667 printk(KERN_CONT "\n");
6668 printk(KERN_ERR "ERROR: domain->cpu_power not "
6673 if (!cpumask_weight(sched_group_cpus(group))) {
6674 printk(KERN_CONT "\n");
6675 printk(KERN_ERR "ERROR: empty group\n");
6679 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
6680 printk(KERN_CONT "\n");
6681 printk(KERN_ERR "ERROR: repeated CPUs\n");
6685 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
6687 cpulist_scnprintf(str, sizeof(str), *sched_group_cpus(group));
6688 printk(KERN_CONT " %s", str);
6690 group = group->next;
6691 } while (group != sd->groups);
6692 printk(KERN_CONT "\n");
6694 if (!cpumask_equal(sched_domain_span(sd), groupmask))
6695 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
6698 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
6699 printk(KERN_ERR "ERROR: parent span is not a superset "
6700 "of domain->span\n");
6704 static void sched_domain_debug(struct sched_domain *sd, int cpu)
6706 cpumask_var_t groupmask;
6710 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
6714 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
6716 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
6717 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
6722 if (sched_domain_debug_one(sd, cpu, level, groupmask))
6729 free_cpumask_var(groupmask);
6731 #else /* !CONFIG_SCHED_DEBUG */
6732 # define sched_domain_debug(sd, cpu) do { } while (0)
6733 #endif /* CONFIG_SCHED_DEBUG */
6735 static int sd_degenerate(struct sched_domain *sd)
6737 if (cpumask_weight(sched_domain_span(sd)) == 1)
6740 /* Following flags need at least 2 groups */
6741 if (sd->flags & (SD_LOAD_BALANCE |
6742 SD_BALANCE_NEWIDLE |
6746 SD_SHARE_PKG_RESOURCES)) {
6747 if (sd->groups != sd->groups->next)
6751 /* Following flags don't use groups */
6752 if (sd->flags & (SD_WAKE_IDLE |
6761 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
6763 unsigned long cflags = sd->flags, pflags = parent->flags;
6765 if (sd_degenerate(parent))
6768 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
6771 /* Does parent contain flags not in child? */
6772 /* WAKE_BALANCE is a subset of WAKE_AFFINE */
6773 if (cflags & SD_WAKE_AFFINE)
6774 pflags &= ~SD_WAKE_BALANCE;
6775 /* Flags needing groups don't count if only 1 group in parent */
6776 if (parent->groups == parent->groups->next) {
6777 pflags &= ~(SD_LOAD_BALANCE |
6778 SD_BALANCE_NEWIDLE |
6782 SD_SHARE_PKG_RESOURCES);
6784 if (~cflags & pflags)
6790 static void free_rootdomain(struct root_domain *rd)
6792 cpupri_cleanup(&rd->cpupri);
6794 free_cpumask_var(rd->rto_mask);
6795 free_cpumask_var(rd->online);
6796 free_cpumask_var(rd->span);
6800 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
6802 unsigned long flags;
6804 spin_lock_irqsave(&rq->lock, flags);
6807 struct root_domain *old_rd = rq->rd;
6809 if (cpumask_test_cpu(rq->cpu, old_rd->online))
6812 cpumask_clear_cpu(rq->cpu, old_rd->span);
6814 if (atomic_dec_and_test(&old_rd->refcount))
6815 free_rootdomain(old_rd);
6818 atomic_inc(&rd->refcount);
6821 cpumask_set_cpu(rq->cpu, rd->span);
6822 if (cpumask_test_cpu(rq->cpu, cpu_online_mask))
6825 spin_unlock_irqrestore(&rq->lock, flags);
6828 static int init_rootdomain(struct root_domain *rd, bool bootmem)
6830 memset(rd, 0, sizeof(*rd));
6833 alloc_bootmem_cpumask_var(&def_root_domain.span);
6834 alloc_bootmem_cpumask_var(&def_root_domain.online);
6835 alloc_bootmem_cpumask_var(&def_root_domain.rto_mask);
6836 cpupri_init(&rd->cpupri, true);
6840 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
6842 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
6844 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
6847 if (cpupri_init(&rd->cpupri, false) != 0)
6852 free_cpumask_var(rd->rto_mask);
6854 free_cpumask_var(rd->online);
6856 free_cpumask_var(rd->span);
6862 static void init_defrootdomain(void)
6864 init_rootdomain(&def_root_domain, true);
6866 atomic_set(&def_root_domain.refcount, 1);
6869 static struct root_domain *alloc_rootdomain(void)
6871 struct root_domain *rd;
6873 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
6877 if (init_rootdomain(rd, false) != 0) {
6886 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6887 * hold the hotplug lock.
6890 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
6892 struct rq *rq = cpu_rq(cpu);
6893 struct sched_domain *tmp;
6895 /* Remove the sched domains which do not contribute to scheduling. */
6896 for (tmp = sd; tmp; ) {
6897 struct sched_domain *parent = tmp->parent;
6901 if (sd_parent_degenerate(tmp, parent)) {
6902 tmp->parent = parent->parent;
6904 parent->parent->child = tmp;
6909 if (sd && sd_degenerate(sd)) {
6915 sched_domain_debug(sd, cpu);
6917 rq_attach_root(rq, rd);
6918 rcu_assign_pointer(rq->sd, sd);
6921 /* cpus with isolated domains */
6922 static cpumask_var_t cpu_isolated_map;
6924 /* Setup the mask of cpus configured for isolated domains */
6925 static int __init isolated_cpu_setup(char *str)
6927 cpulist_parse(str, *cpu_isolated_map);
6931 __setup("isolcpus=", isolated_cpu_setup);
6934 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
6935 * to a function which identifies what group(along with sched group) a CPU
6936 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
6937 * (due to the fact that we keep track of groups covered with a struct cpumask).
6939 * init_sched_build_groups will build a circular linked list of the groups
6940 * covered by the given span, and will set each group's ->cpumask correctly,
6941 * and ->cpu_power to 0.
6944 init_sched_build_groups(const struct cpumask *span,
6945 const struct cpumask *cpu_map,
6946 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
6947 struct sched_group **sg,
6948 struct cpumask *tmpmask),
6949 struct cpumask *covered, struct cpumask *tmpmask)
6951 struct sched_group *first = NULL, *last = NULL;
6954 cpumask_clear(covered);
6956 for_each_cpu(i, span) {
6957 struct sched_group *sg;
6958 int group = group_fn(i, cpu_map, &sg, tmpmask);
6961 if (cpumask_test_cpu(i, covered))
6964 cpumask_clear(sched_group_cpus(sg));
6965 sg->__cpu_power = 0;
6967 for_each_cpu(j, span) {
6968 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
6971 cpumask_set_cpu(j, covered);
6972 cpumask_set_cpu(j, sched_group_cpus(sg));
6983 #define SD_NODES_PER_DOMAIN 16
6988 * find_next_best_node - find the next node to include in a sched_domain
6989 * @node: node whose sched_domain we're building
6990 * @used_nodes: nodes already in the sched_domain
6992 * Find the next node to include in a given scheduling domain. Simply
6993 * finds the closest node not already in the @used_nodes map.
6995 * Should use nodemask_t.
6997 static int find_next_best_node(int node, nodemask_t *used_nodes)
6999 int i, n, val, min_val, best_node = 0;
7003 for (i = 0; i < nr_node_ids; i++) {
7004 /* Start at @node */
7005 n = (node + i) % nr_node_ids;
7007 if (!nr_cpus_node(n))
7010 /* Skip already used nodes */
7011 if (node_isset(n, *used_nodes))
7014 /* Simple min distance search */
7015 val = node_distance(node, n);
7017 if (val < min_val) {
7023 node_set(best_node, *used_nodes);
7028 * sched_domain_node_span - get a cpumask for a node's sched_domain
7029 * @node: node whose cpumask we're constructing
7030 * @span: resulting cpumask
7032 * Given a node, construct a good cpumask for its sched_domain to span. It
7033 * should be one that prevents unnecessary balancing, but also spreads tasks
7036 static void sched_domain_node_span(int node, struct cpumask *span)
7038 nodemask_t used_nodes;
7039 /* FIXME: use cpumask_of_node() */
7040 node_to_cpumask_ptr(nodemask, node);
7044 nodes_clear(used_nodes);
7046 cpus_or(*span, *span, *nodemask);
7047 node_set(node, used_nodes);
7049 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
7050 int next_node = find_next_best_node(node, &used_nodes);
7052 node_to_cpumask_ptr_next(nodemask, next_node);
7053 cpus_or(*span, *span, *nodemask);
7056 #endif /* CONFIG_NUMA */
7058 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
7061 * The cpus mask in sched_group and sched_domain hangs off the end.
7062 * FIXME: use cpumask_var_t or dynamic percpu alloc to avoid wasting space
7063 * for nr_cpu_ids < CONFIG_NR_CPUS.
7065 struct static_sched_group {
7066 struct sched_group sg;
7067 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
7070 struct static_sched_domain {
7071 struct sched_domain sd;
7072 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
7076 * SMT sched-domains:
7078 #ifdef CONFIG_SCHED_SMT
7079 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
7080 static DEFINE_PER_CPU(struct static_sched_group, sched_group_cpus);
7083 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
7084 struct sched_group **sg, struct cpumask *unused)
7087 *sg = &per_cpu(sched_group_cpus, cpu).sg;
7090 #endif /* CONFIG_SCHED_SMT */
7093 * multi-core sched-domains:
7095 #ifdef CONFIG_SCHED_MC
7096 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
7097 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
7098 #endif /* CONFIG_SCHED_MC */
7100 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
7102 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
7103 struct sched_group **sg, struct cpumask *mask)
7107 cpumask_and(mask, &per_cpu(cpu_sibling_map, cpu), cpu_map);
7108 group = cpumask_first(mask);
7110 *sg = &per_cpu(sched_group_core, group).sg;
7113 #elif defined(CONFIG_SCHED_MC)
7115 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
7116 struct sched_group **sg, struct cpumask *unused)
7119 *sg = &per_cpu(sched_group_core, cpu).sg;
7124 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
7125 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
7128 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
7129 struct sched_group **sg, struct cpumask *mask)
7132 #ifdef CONFIG_SCHED_MC
7133 /* FIXME: Use cpu_coregroup_mask. */
7134 *mask = cpu_coregroup_map(cpu);
7135 cpus_and(*mask, *mask, *cpu_map);
7136 group = cpumask_first(mask);
7137 #elif defined(CONFIG_SCHED_SMT)
7138 cpumask_and(mask, &per_cpu(cpu_sibling_map, cpu), cpu_map);
7139 group = cpumask_first(mask);
7144 *sg = &per_cpu(sched_group_phys, group).sg;
7150 * The init_sched_build_groups can't handle what we want to do with node
7151 * groups, so roll our own. Now each node has its own list of groups which
7152 * gets dynamically allocated.
7154 static DEFINE_PER_CPU(struct sched_domain, node_domains);
7155 static struct sched_group ***sched_group_nodes_bycpu;
7157 static DEFINE_PER_CPU(struct sched_domain, allnodes_domains);
7158 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
7160 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
7161 struct sched_group **sg,
7162 struct cpumask *nodemask)
7165 /* FIXME: use cpumask_of_node */
7166 node_to_cpumask_ptr(pnodemask, cpu_to_node(cpu));
7168 cpumask_and(nodemask, pnodemask, cpu_map);
7169 group = cpumask_first(nodemask);
7172 *sg = &per_cpu(sched_group_allnodes, group).sg;
7176 static void init_numa_sched_groups_power(struct sched_group *group_head)
7178 struct sched_group *sg = group_head;
7184 for_each_cpu(j, sched_group_cpus(sg)) {
7185 struct sched_domain *sd;
7187 sd = &per_cpu(phys_domains, j).sd;
7188 if (j != cpumask_first(sched_group_cpus(sd->groups))) {
7190 * Only add "power" once for each
7196 sg_inc_cpu_power(sg, sd->groups->__cpu_power);
7199 } while (sg != group_head);
7201 #endif /* CONFIG_NUMA */
7204 /* Free memory allocated for various sched_group structures */
7205 static void free_sched_groups(const struct cpumask *cpu_map,
7206 struct cpumask *nodemask)
7210 for_each_cpu(cpu, cpu_map) {
7211 struct sched_group **sched_group_nodes
7212 = sched_group_nodes_bycpu[cpu];
7214 if (!sched_group_nodes)
7217 for (i = 0; i < nr_node_ids; i++) {
7218 struct sched_group *oldsg, *sg = sched_group_nodes[i];
7219 /* FIXME: Use cpumask_of_node */
7220 node_to_cpumask_ptr(pnodemask, i);
7222 cpus_and(*nodemask, *pnodemask, *cpu_map);
7223 if (cpumask_empty(nodemask))
7233 if (oldsg != sched_group_nodes[i])
7236 kfree(sched_group_nodes);
7237 sched_group_nodes_bycpu[cpu] = NULL;
7240 #else /* !CONFIG_NUMA */
7241 static void free_sched_groups(const struct cpumask *cpu_map,
7242 struct cpumask *nodemask)
7245 #endif /* CONFIG_NUMA */
7248 * Initialize sched groups cpu_power.
7250 * cpu_power indicates the capacity of sched group, which is used while
7251 * distributing the load between different sched groups in a sched domain.
7252 * Typically cpu_power for all the groups in a sched domain will be same unless
7253 * there are asymmetries in the topology. If there are asymmetries, group
7254 * having more cpu_power will pickup more load compared to the group having
7257 * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents
7258 * the maximum number of tasks a group can handle in the presence of other idle
7259 * or lightly loaded groups in the same sched domain.
7261 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
7263 struct sched_domain *child;
7264 struct sched_group *group;
7266 WARN_ON(!sd || !sd->groups);
7268 if (cpu != cpumask_first(sched_group_cpus(sd->groups)))
7273 sd->groups->__cpu_power = 0;
7276 * For perf policy, if the groups in child domain share resources
7277 * (for example cores sharing some portions of the cache hierarchy
7278 * or SMT), then set this domain groups cpu_power such that each group
7279 * can handle only one task, when there are other idle groups in the
7280 * same sched domain.
7282 if (!child || (!(sd->flags & SD_POWERSAVINGS_BALANCE) &&
7284 (SD_SHARE_CPUPOWER | SD_SHARE_PKG_RESOURCES)))) {
7285 sg_inc_cpu_power(sd->groups, SCHED_LOAD_SCALE);
7290 * add cpu_power of each child group to this groups cpu_power
7292 group = child->groups;
7294 sg_inc_cpu_power(sd->groups, group->__cpu_power);
7295 group = group->next;
7296 } while (group != child->groups);
7300 * Initializers for schedule domains
7301 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
7304 #ifdef CONFIG_SCHED_DEBUG
7305 # define SD_INIT_NAME(sd, type) sd->name = #type
7307 # define SD_INIT_NAME(sd, type) do { } while (0)
7310 #define SD_INIT(sd, type) sd_init_##type(sd)
7312 #define SD_INIT_FUNC(type) \
7313 static noinline void sd_init_##type(struct sched_domain *sd) \
7315 memset(sd, 0, sizeof(*sd)); \
7316 *sd = SD_##type##_INIT; \
7317 sd->level = SD_LV_##type; \
7318 SD_INIT_NAME(sd, type); \
7323 SD_INIT_FUNC(ALLNODES)
7326 #ifdef CONFIG_SCHED_SMT
7327 SD_INIT_FUNC(SIBLING)
7329 #ifdef CONFIG_SCHED_MC
7333 static int default_relax_domain_level = -1;
7335 static int __init setup_relax_domain_level(char *str)
7339 val = simple_strtoul(str, NULL, 0);
7340 if (val < SD_LV_MAX)
7341 default_relax_domain_level = val;
7345 __setup("relax_domain_level=", setup_relax_domain_level);
7347 static void set_domain_attribute(struct sched_domain *sd,
7348 struct sched_domain_attr *attr)
7352 if (!attr || attr->relax_domain_level < 0) {
7353 if (default_relax_domain_level < 0)
7356 request = default_relax_domain_level;
7358 request = attr->relax_domain_level;
7359 if (request < sd->level) {
7360 /* turn off idle balance on this domain */
7361 sd->flags &= ~(SD_WAKE_IDLE|SD_BALANCE_NEWIDLE);
7363 /* turn on idle balance on this domain */
7364 sd->flags |= (SD_WAKE_IDLE_FAR|SD_BALANCE_NEWIDLE);
7369 * Build sched domains for a given set of cpus and attach the sched domains
7370 * to the individual cpus
7372 static int __build_sched_domains(const struct cpumask *cpu_map,
7373 struct sched_domain_attr *attr)
7375 int i, err = -ENOMEM;
7376 struct root_domain *rd;
7377 cpumask_var_t nodemask, this_sibling_map, this_core_map, send_covered,
7380 cpumask_var_t domainspan, covered, notcovered;
7381 struct sched_group **sched_group_nodes = NULL;
7382 int sd_allnodes = 0;
7384 if (!alloc_cpumask_var(&domainspan, GFP_KERNEL))
7386 if (!alloc_cpumask_var(&covered, GFP_KERNEL))
7387 goto free_domainspan;
7388 if (!alloc_cpumask_var(¬covered, GFP_KERNEL))
7392 if (!alloc_cpumask_var(&nodemask, GFP_KERNEL))
7393 goto free_notcovered;
7394 if (!alloc_cpumask_var(&this_sibling_map, GFP_KERNEL))
7396 if (!alloc_cpumask_var(&this_core_map, GFP_KERNEL))
7397 goto free_this_sibling_map;
7398 if (!alloc_cpumask_var(&send_covered, GFP_KERNEL))
7399 goto free_this_core_map;
7400 if (!alloc_cpumask_var(&tmpmask, GFP_KERNEL))
7401 goto free_send_covered;
7405 * Allocate the per-node list of sched groups
7407 sched_group_nodes = kcalloc(nr_node_ids, sizeof(struct sched_group *),
7409 if (!sched_group_nodes) {
7410 printk(KERN_WARNING "Can not alloc sched group node list\n");
7415 rd = alloc_rootdomain();
7417 printk(KERN_WARNING "Cannot alloc root domain\n");
7418 goto free_sched_groups;
7422 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = sched_group_nodes;
7426 * Set up domains for cpus specified by the cpu_map.
7428 for_each_cpu(i, cpu_map) {
7429 struct sched_domain *sd = NULL, *p;
7431 /* FIXME: use cpumask_of_node */
7432 *nodemask = node_to_cpumask(cpu_to_node(i));
7433 cpus_and(*nodemask, *nodemask, *cpu_map);
7436 if (cpumask_weight(cpu_map) >
7437 SD_NODES_PER_DOMAIN*cpumask_weight(nodemask)) {
7438 sd = &per_cpu(allnodes_domains, i);
7439 SD_INIT(sd, ALLNODES);
7440 set_domain_attribute(sd, attr);
7441 cpumask_copy(sched_domain_span(sd), cpu_map);
7442 cpu_to_allnodes_group(i, cpu_map, &sd->groups, tmpmask);
7448 sd = &per_cpu(node_domains, i);
7450 set_domain_attribute(sd, attr);
7451 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
7455 cpumask_and(sched_domain_span(sd),
7456 sched_domain_span(sd), cpu_map);
7460 sd = &per_cpu(phys_domains, i).sd;
7462 set_domain_attribute(sd, attr);
7463 cpumask_copy(sched_domain_span(sd), nodemask);
7467 cpu_to_phys_group(i, cpu_map, &sd->groups, tmpmask);
7469 #ifdef CONFIG_SCHED_MC
7471 sd = &per_cpu(core_domains, i).sd;
7473 set_domain_attribute(sd, attr);
7474 *sched_domain_span(sd) = cpu_coregroup_map(i);
7475 cpumask_and(sched_domain_span(sd),
7476 sched_domain_span(sd), cpu_map);
7479 cpu_to_core_group(i, cpu_map, &sd->groups, tmpmask);
7482 #ifdef CONFIG_SCHED_SMT
7484 sd = &per_cpu(cpu_domains, i).sd;
7485 SD_INIT(sd, SIBLING);
7486 set_domain_attribute(sd, attr);
7487 cpumask_and(sched_domain_span(sd),
7488 &per_cpu(cpu_sibling_map, i), cpu_map);
7491 cpu_to_cpu_group(i, cpu_map, &sd->groups, tmpmask);
7495 #ifdef CONFIG_SCHED_SMT
7496 /* Set up CPU (sibling) groups */
7497 for_each_cpu(i, cpu_map) {
7498 cpumask_and(this_sibling_map,
7499 &per_cpu(cpu_sibling_map, i), cpu_map);
7500 if (i != cpumask_first(this_sibling_map))
7503 init_sched_build_groups(this_sibling_map, cpu_map,
7505 send_covered, tmpmask);
7509 #ifdef CONFIG_SCHED_MC
7510 /* Set up multi-core groups */
7511 for_each_cpu(i, cpu_map) {
7512 /* FIXME: Use cpu_coregroup_mask */
7513 *this_core_map = cpu_coregroup_map(i);
7514 cpus_and(*this_core_map, *this_core_map, *cpu_map);
7515 if (i != cpumask_first(this_core_map))
7518 init_sched_build_groups(this_core_map, cpu_map,
7520 send_covered, tmpmask);
7524 /* Set up physical groups */
7525 for (i = 0; i < nr_node_ids; i++) {
7526 /* FIXME: Use cpumask_of_node */
7527 *nodemask = node_to_cpumask(i);
7528 cpus_and(*nodemask, *nodemask, *cpu_map);
7529 if (cpumask_empty(nodemask))
7532 init_sched_build_groups(nodemask, cpu_map,
7534 send_covered, tmpmask);
7538 /* Set up node groups */
7540 init_sched_build_groups(cpu_map, cpu_map,
7541 &cpu_to_allnodes_group,
7542 send_covered, tmpmask);
7545 for (i = 0; i < nr_node_ids; i++) {
7546 /* Set up node groups */
7547 struct sched_group *sg, *prev;
7550 /* FIXME: Use cpumask_of_node */
7551 *nodemask = node_to_cpumask(i);
7552 cpumask_clear(covered);
7554 cpus_and(*nodemask, *nodemask, *cpu_map);
7555 if (cpumask_empty(nodemask)) {
7556 sched_group_nodes[i] = NULL;
7560 sched_domain_node_span(i, domainspan);
7561 cpumask_and(domainspan, domainspan, cpu_map);
7563 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
7566 printk(KERN_WARNING "Can not alloc domain group for "
7570 sched_group_nodes[i] = sg;
7571 for_each_cpu(j, nodemask) {
7572 struct sched_domain *sd;
7574 sd = &per_cpu(node_domains, j);
7577 sg->__cpu_power = 0;
7578 cpumask_copy(sched_group_cpus(sg), nodemask);
7580 cpumask_or(covered, covered, nodemask);
7583 for (j = 0; j < nr_node_ids; j++) {
7584 int n = (i + j) % nr_node_ids;
7585 /* FIXME: Use cpumask_of_node */
7586 node_to_cpumask_ptr(pnodemask, n);
7588 cpumask_complement(notcovered, covered);
7589 cpumask_and(tmpmask, notcovered, cpu_map);
7590 cpumask_and(tmpmask, tmpmask, domainspan);
7591 if (cpumask_empty(tmpmask))
7594 cpumask_and(tmpmask, tmpmask, pnodemask);
7595 if (cpumask_empty(tmpmask))
7598 sg = kmalloc_node(sizeof(struct sched_group) +
7603 "Can not alloc domain group for node %d\n", j);
7606 sg->__cpu_power = 0;
7607 cpumask_copy(sched_group_cpus(sg), tmpmask);
7608 sg->next = prev->next;
7609 cpumask_or(covered, covered, tmpmask);
7616 /* Calculate CPU power for physical packages and nodes */
7617 #ifdef CONFIG_SCHED_SMT
7618 for_each_cpu(i, cpu_map) {
7619 struct sched_domain *sd = &per_cpu(cpu_domains, i).sd;
7621 init_sched_groups_power(i, sd);
7624 #ifdef CONFIG_SCHED_MC
7625 for_each_cpu(i, cpu_map) {
7626 struct sched_domain *sd = &per_cpu(core_domains, i).sd;
7628 init_sched_groups_power(i, sd);
7632 for_each_cpu(i, cpu_map) {
7633 struct sched_domain *sd = &per_cpu(phys_domains, i).sd;
7635 init_sched_groups_power(i, sd);
7639 for (i = 0; i < nr_node_ids; i++)
7640 init_numa_sched_groups_power(sched_group_nodes[i]);
7643 struct sched_group *sg;
7645 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
7647 init_numa_sched_groups_power(sg);
7651 /* Attach the domains */
7652 for_each_cpu(i, cpu_map) {
7653 struct sched_domain *sd;
7654 #ifdef CONFIG_SCHED_SMT
7655 sd = &per_cpu(cpu_domains, i).sd;
7656 #elif defined(CONFIG_SCHED_MC)
7657 sd = &per_cpu(core_domains, i).sd;
7659 sd = &per_cpu(phys_domains, i).sd;
7661 cpu_attach_domain(sd, rd, i);
7667 free_cpumask_var(tmpmask);
7669 free_cpumask_var(send_covered);
7671 free_cpumask_var(this_core_map);
7672 free_this_sibling_map:
7673 free_cpumask_var(this_sibling_map);
7675 free_cpumask_var(nodemask);
7678 free_cpumask_var(notcovered);
7680 free_cpumask_var(covered);
7682 free_cpumask_var(domainspan);
7689 kfree(sched_group_nodes);
7695 free_sched_groups(cpu_map, tmpmask);
7696 free_rootdomain(rd);
7701 static int build_sched_domains(const struct cpumask *cpu_map)
7703 return __build_sched_domains(cpu_map, NULL);
7706 static struct cpumask *doms_cur; /* current sched domains */
7707 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
7708 static struct sched_domain_attr *dattr_cur;
7709 /* attribues of custom domains in 'doms_cur' */
7712 * Special case: If a kmalloc of a doms_cur partition (array of
7713 * cpumask) fails, then fallback to a single sched domain,
7714 * as determined by the single cpumask fallback_doms.
7716 static cpumask_var_t fallback_doms;
7718 void __attribute__((weak)) arch_update_cpu_topology(void)
7723 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7724 * For now this just excludes isolated cpus, but could be used to
7725 * exclude other special cases in the future.
7727 static int arch_init_sched_domains(const struct cpumask *cpu_map)
7731 arch_update_cpu_topology();
7733 doms_cur = kmalloc(cpumask_size(), GFP_KERNEL);
7735 doms_cur = fallback_doms;
7736 cpumask_andnot(doms_cur, cpu_map, cpu_isolated_map);
7738 err = build_sched_domains(doms_cur);
7739 register_sched_domain_sysctl();
7744 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
7745 struct cpumask *tmpmask)
7747 free_sched_groups(cpu_map, tmpmask);
7751 * Detach sched domains from a group of cpus specified in cpu_map
7752 * These cpus will now be attached to the NULL domain
7754 static void detach_destroy_domains(const struct cpumask *cpu_map)
7756 /* Save because hotplug lock held. */
7757 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
7760 for_each_cpu(i, cpu_map)
7761 cpu_attach_domain(NULL, &def_root_domain, i);
7762 synchronize_sched();
7763 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
7766 /* handle null as "default" */
7767 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
7768 struct sched_domain_attr *new, int idx_new)
7770 struct sched_domain_attr tmp;
7777 return !memcmp(cur ? (cur + idx_cur) : &tmp,
7778 new ? (new + idx_new) : &tmp,
7779 sizeof(struct sched_domain_attr));
7783 * Partition sched domains as specified by the 'ndoms_new'
7784 * cpumasks in the array doms_new[] of cpumasks. This compares
7785 * doms_new[] to the current sched domain partitioning, doms_cur[].
7786 * It destroys each deleted domain and builds each new domain.
7788 * 'doms_new' is an array of cpumask's of length 'ndoms_new'.
7789 * The masks don't intersect (don't overlap.) We should setup one
7790 * sched domain for each mask. CPUs not in any of the cpumasks will
7791 * not be load balanced. If the same cpumask appears both in the
7792 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7795 * The passed in 'doms_new' should be kmalloc'd. This routine takes
7796 * ownership of it and will kfree it when done with it. If the caller
7797 * failed the kmalloc call, then it can pass in doms_new == NULL &&
7798 * ndoms_new == 1, and partition_sched_domains() will fallback to
7799 * the single partition 'fallback_doms', it also forces the domains
7802 * If doms_new == NULL it will be replaced with cpu_online_mask.
7803 * ndoms_new == 0 is a special case for destroying existing domains,
7804 * and it will not create the default domain.
7806 * Call with hotplug lock held
7808 /* FIXME: Change to struct cpumask *doms_new[] */
7809 void partition_sched_domains(int ndoms_new, struct cpumask *doms_new,
7810 struct sched_domain_attr *dattr_new)
7814 mutex_lock(&sched_domains_mutex);
7816 /* always unregister in case we don't destroy any domains */
7817 unregister_sched_domain_sysctl();
7819 n = doms_new ? ndoms_new : 0;
7821 /* Destroy deleted domains */
7822 for (i = 0; i < ndoms_cur; i++) {
7823 for (j = 0; j < n; j++) {
7824 if (cpumask_equal(&doms_cur[i], &doms_new[j])
7825 && dattrs_equal(dattr_cur, i, dattr_new, j))
7828 /* no match - a current sched domain not in new doms_new[] */
7829 detach_destroy_domains(doms_cur + i);
7834 if (doms_new == NULL) {
7836 doms_new = fallback_doms;
7837 cpumask_andnot(&doms_new[0], cpu_online_mask, cpu_isolated_map);
7838 WARN_ON_ONCE(dattr_new);
7841 /* Build new domains */
7842 for (i = 0; i < ndoms_new; i++) {
7843 for (j = 0; j < ndoms_cur; j++) {
7844 if (cpumask_equal(&doms_new[i], &doms_cur[j])
7845 && dattrs_equal(dattr_new, i, dattr_cur, j))
7848 /* no match - add a new doms_new */
7849 __build_sched_domains(doms_new + i,
7850 dattr_new ? dattr_new + i : NULL);
7855 /* Remember the new sched domains */
7856 if (doms_cur != fallback_doms)
7858 kfree(dattr_cur); /* kfree(NULL) is safe */
7859 doms_cur = doms_new;
7860 dattr_cur = dattr_new;
7861 ndoms_cur = ndoms_new;
7863 register_sched_domain_sysctl();
7865 mutex_unlock(&sched_domains_mutex);
7868 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
7869 int arch_reinit_sched_domains(void)
7873 /* Destroy domains first to force the rebuild */
7874 partition_sched_domains(0, NULL, NULL);
7876 rebuild_sched_domains();
7882 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
7886 if (buf[0] != '0' && buf[0] != '1')
7890 sched_smt_power_savings = (buf[0] == '1');
7892 sched_mc_power_savings = (buf[0] == '1');
7894 ret = arch_reinit_sched_domains();
7896 return ret ? ret : count;
7899 #ifdef CONFIG_SCHED_MC
7900 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
7903 return sprintf(page, "%u\n", sched_mc_power_savings);
7905 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
7906 const char *buf, size_t count)
7908 return sched_power_savings_store(buf, count, 0);
7910 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
7911 sched_mc_power_savings_show,
7912 sched_mc_power_savings_store);
7915 #ifdef CONFIG_SCHED_SMT
7916 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
7919 return sprintf(page, "%u\n", sched_smt_power_savings);
7921 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
7922 const char *buf, size_t count)
7924 return sched_power_savings_store(buf, count, 1);
7926 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
7927 sched_smt_power_savings_show,
7928 sched_smt_power_savings_store);
7931 int sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
7935 #ifdef CONFIG_SCHED_SMT
7937 err = sysfs_create_file(&cls->kset.kobj,
7938 &attr_sched_smt_power_savings.attr);
7940 #ifdef CONFIG_SCHED_MC
7941 if (!err && mc_capable())
7942 err = sysfs_create_file(&cls->kset.kobj,
7943 &attr_sched_mc_power_savings.attr);
7947 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
7949 #ifndef CONFIG_CPUSETS
7951 * Add online and remove offline CPUs from the scheduler domains.
7952 * When cpusets are enabled they take over this function.
7954 static int update_sched_domains(struct notifier_block *nfb,
7955 unsigned long action, void *hcpu)
7959 case CPU_ONLINE_FROZEN:
7961 case CPU_DEAD_FROZEN:
7962 partition_sched_domains(1, NULL, NULL);
7971 static int update_runtime(struct notifier_block *nfb,
7972 unsigned long action, void *hcpu)
7974 int cpu = (int)(long)hcpu;
7977 case CPU_DOWN_PREPARE:
7978 case CPU_DOWN_PREPARE_FROZEN:
7979 disable_runtime(cpu_rq(cpu));
7982 case CPU_DOWN_FAILED:
7983 case CPU_DOWN_FAILED_FROZEN:
7985 case CPU_ONLINE_FROZEN:
7986 enable_runtime(cpu_rq(cpu));
7994 void __init sched_init_smp(void)
7996 cpumask_var_t non_isolated_cpus;
7998 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
8000 #if defined(CONFIG_NUMA)
8001 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
8003 BUG_ON(sched_group_nodes_bycpu == NULL);
8006 mutex_lock(&sched_domains_mutex);
8007 arch_init_sched_domains(cpu_online_mask);
8008 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
8009 if (cpumask_empty(non_isolated_cpus))
8010 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
8011 mutex_unlock(&sched_domains_mutex);
8014 #ifndef CONFIG_CPUSETS
8015 /* XXX: Theoretical race here - CPU may be hotplugged now */
8016 hotcpu_notifier(update_sched_domains, 0);
8019 /* RT runtime code needs to handle some hotplug events */
8020 hotcpu_notifier(update_runtime, 0);
8024 /* Move init over to a non-isolated CPU */
8025 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
8027 sched_init_granularity();
8028 free_cpumask_var(non_isolated_cpus);
8030 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
8031 init_sched_rt_class();
8034 void __init sched_init_smp(void)
8036 sched_init_granularity();
8038 #endif /* CONFIG_SMP */
8040 int in_sched_functions(unsigned long addr)
8042 return in_lock_functions(addr) ||
8043 (addr >= (unsigned long)__sched_text_start
8044 && addr < (unsigned long)__sched_text_end);
8047 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
8049 cfs_rq->tasks_timeline = RB_ROOT;
8050 INIT_LIST_HEAD(&cfs_rq->tasks);
8051 #ifdef CONFIG_FAIR_GROUP_SCHED
8054 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
8057 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
8059 struct rt_prio_array *array;
8062 array = &rt_rq->active;
8063 for (i = 0; i < MAX_RT_PRIO; i++) {
8064 INIT_LIST_HEAD(array->queue + i);
8065 __clear_bit(i, array->bitmap);
8067 /* delimiter for bitsearch: */
8068 __set_bit(MAX_RT_PRIO, array->bitmap);
8070 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
8071 rt_rq->highest_prio = MAX_RT_PRIO;
8074 rt_rq->rt_nr_migratory = 0;
8075 rt_rq->overloaded = 0;
8079 rt_rq->rt_throttled = 0;
8080 rt_rq->rt_runtime = 0;
8081 spin_lock_init(&rt_rq->rt_runtime_lock);
8083 #ifdef CONFIG_RT_GROUP_SCHED
8084 rt_rq->rt_nr_boosted = 0;
8089 #ifdef CONFIG_FAIR_GROUP_SCHED
8090 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
8091 struct sched_entity *se, int cpu, int add,
8092 struct sched_entity *parent)
8094 struct rq *rq = cpu_rq(cpu);
8095 tg->cfs_rq[cpu] = cfs_rq;
8096 init_cfs_rq(cfs_rq, rq);
8099 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
8102 /* se could be NULL for init_task_group */
8107 se->cfs_rq = &rq->cfs;
8109 se->cfs_rq = parent->my_q;
8112 se->load.weight = tg->shares;
8113 se->load.inv_weight = 0;
8114 se->parent = parent;
8118 #ifdef CONFIG_RT_GROUP_SCHED
8119 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
8120 struct sched_rt_entity *rt_se, int cpu, int add,
8121 struct sched_rt_entity *parent)
8123 struct rq *rq = cpu_rq(cpu);
8125 tg->rt_rq[cpu] = rt_rq;
8126 init_rt_rq(rt_rq, rq);
8128 rt_rq->rt_se = rt_se;
8129 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
8131 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
8133 tg->rt_se[cpu] = rt_se;
8138 rt_se->rt_rq = &rq->rt;
8140 rt_se->rt_rq = parent->my_q;
8142 rt_se->my_q = rt_rq;
8143 rt_se->parent = parent;
8144 INIT_LIST_HEAD(&rt_se->run_list);
8148 void __init sched_init(void)
8151 unsigned long alloc_size = 0, ptr;
8153 #ifdef CONFIG_FAIR_GROUP_SCHED
8154 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8156 #ifdef CONFIG_RT_GROUP_SCHED
8157 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8159 #ifdef CONFIG_USER_SCHED
8163 * As sched_init() is called before page_alloc is setup,
8164 * we use alloc_bootmem().
8167 ptr = (unsigned long)alloc_bootmem(alloc_size);
8169 #ifdef CONFIG_FAIR_GROUP_SCHED
8170 init_task_group.se = (struct sched_entity **)ptr;
8171 ptr += nr_cpu_ids * sizeof(void **);
8173 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
8174 ptr += nr_cpu_ids * sizeof(void **);
8176 #ifdef CONFIG_USER_SCHED
8177 root_task_group.se = (struct sched_entity **)ptr;
8178 ptr += nr_cpu_ids * sizeof(void **);
8180 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
8181 ptr += nr_cpu_ids * sizeof(void **);
8182 #endif /* CONFIG_USER_SCHED */
8183 #endif /* CONFIG_FAIR_GROUP_SCHED */
8184 #ifdef CONFIG_RT_GROUP_SCHED
8185 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
8186 ptr += nr_cpu_ids * sizeof(void **);
8188 init_task_group.rt_rq = (struct rt_rq **)ptr;
8189 ptr += nr_cpu_ids * sizeof(void **);
8191 #ifdef CONFIG_USER_SCHED
8192 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
8193 ptr += nr_cpu_ids * sizeof(void **);
8195 root_task_group.rt_rq = (struct rt_rq **)ptr;
8196 ptr += nr_cpu_ids * sizeof(void **);
8197 #endif /* CONFIG_USER_SCHED */
8198 #endif /* CONFIG_RT_GROUP_SCHED */
8202 init_defrootdomain();
8205 init_rt_bandwidth(&def_rt_bandwidth,
8206 global_rt_period(), global_rt_runtime());
8208 #ifdef CONFIG_RT_GROUP_SCHED
8209 init_rt_bandwidth(&init_task_group.rt_bandwidth,
8210 global_rt_period(), global_rt_runtime());
8211 #ifdef CONFIG_USER_SCHED
8212 init_rt_bandwidth(&root_task_group.rt_bandwidth,
8213 global_rt_period(), RUNTIME_INF);
8214 #endif /* CONFIG_USER_SCHED */
8215 #endif /* CONFIG_RT_GROUP_SCHED */
8217 #ifdef CONFIG_GROUP_SCHED
8218 list_add(&init_task_group.list, &task_groups);
8219 INIT_LIST_HEAD(&init_task_group.children);
8221 #ifdef CONFIG_USER_SCHED
8222 INIT_LIST_HEAD(&root_task_group.children);
8223 init_task_group.parent = &root_task_group;
8224 list_add(&init_task_group.siblings, &root_task_group.children);
8225 #endif /* CONFIG_USER_SCHED */
8226 #endif /* CONFIG_GROUP_SCHED */
8228 for_each_possible_cpu(i) {
8232 spin_lock_init(&rq->lock);
8234 init_cfs_rq(&rq->cfs, rq);
8235 init_rt_rq(&rq->rt, rq);
8236 #ifdef CONFIG_FAIR_GROUP_SCHED
8237 init_task_group.shares = init_task_group_load;
8238 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
8239 #ifdef CONFIG_CGROUP_SCHED
8241 * How much cpu bandwidth does init_task_group get?
8243 * In case of task-groups formed thr' the cgroup filesystem, it
8244 * gets 100% of the cpu resources in the system. This overall
8245 * system cpu resource is divided among the tasks of
8246 * init_task_group and its child task-groups in a fair manner,
8247 * based on each entity's (task or task-group's) weight
8248 * (se->load.weight).
8250 * In other words, if init_task_group has 10 tasks of weight
8251 * 1024) and two child groups A0 and A1 (of weight 1024 each),
8252 * then A0's share of the cpu resource is:
8254 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
8256 * We achieve this by letting init_task_group's tasks sit
8257 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
8259 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
8260 #elif defined CONFIG_USER_SCHED
8261 root_task_group.shares = NICE_0_LOAD;
8262 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL);
8264 * In case of task-groups formed thr' the user id of tasks,
8265 * init_task_group represents tasks belonging to root user.
8266 * Hence it forms a sibling of all subsequent groups formed.
8267 * In this case, init_task_group gets only a fraction of overall
8268 * system cpu resource, based on the weight assigned to root
8269 * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished
8270 * by letting tasks of init_task_group sit in a separate cfs_rq
8271 * (init_cfs_rq) and having one entity represent this group of
8272 * tasks in rq->cfs (i.e init_task_group->se[] != NULL).
8274 init_tg_cfs_entry(&init_task_group,
8275 &per_cpu(init_cfs_rq, i),
8276 &per_cpu(init_sched_entity, i), i, 1,
8277 root_task_group.se[i]);
8280 #endif /* CONFIG_FAIR_GROUP_SCHED */
8282 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
8283 #ifdef CONFIG_RT_GROUP_SCHED
8284 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
8285 #ifdef CONFIG_CGROUP_SCHED
8286 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
8287 #elif defined CONFIG_USER_SCHED
8288 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL);
8289 init_tg_rt_entry(&init_task_group,
8290 &per_cpu(init_rt_rq, i),
8291 &per_cpu(init_sched_rt_entity, i), i, 1,
8292 root_task_group.rt_se[i]);
8296 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
8297 rq->cpu_load[j] = 0;
8301 rq->active_balance = 0;
8302 rq->next_balance = jiffies;
8306 rq->migration_thread = NULL;
8307 INIT_LIST_HEAD(&rq->migration_queue);
8308 rq_attach_root(rq, &def_root_domain);
8311 atomic_set(&rq->nr_iowait, 0);
8314 set_load_weight(&init_task);
8316 #ifdef CONFIG_PREEMPT_NOTIFIERS
8317 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
8321 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
8324 #ifdef CONFIG_RT_MUTEXES
8325 plist_head_init(&init_task.pi_waiters, &init_task.pi_lock);
8329 * The boot idle thread does lazy MMU switching as well:
8331 atomic_inc(&init_mm.mm_count);
8332 enter_lazy_tlb(&init_mm, current);
8335 * Make us the idle thread. Technically, schedule() should not be
8336 * called from this thread, however somewhere below it might be,
8337 * but because we are the idle thread, we just pick up running again
8338 * when this runqueue becomes "idle".
8340 init_idle(current, smp_processor_id());
8342 * During early bootup we pretend to be a normal task:
8344 current->sched_class = &fair_sched_class;
8346 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
8347 alloc_bootmem_cpumask_var(&nohz_cpu_mask);
8350 alloc_bootmem_cpumask_var(&nohz.cpu_mask);
8352 alloc_bootmem_cpumask_var(&cpu_isolated_map);
8355 scheduler_running = 1;
8358 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
8359 void __might_sleep(char *file, int line)
8362 static unsigned long prev_jiffy; /* ratelimiting */
8364 if ((!in_atomic() && !irqs_disabled()) ||
8365 system_state != SYSTEM_RUNNING || oops_in_progress)
8367 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
8369 prev_jiffy = jiffies;
8372 "BUG: sleeping function called from invalid context at %s:%d\n",
8375 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
8376 in_atomic(), irqs_disabled(),
8377 current->pid, current->comm);
8379 debug_show_held_locks(current);
8380 if (irqs_disabled())
8381 print_irqtrace_events(current);
8385 EXPORT_SYMBOL(__might_sleep);
8388 #ifdef CONFIG_MAGIC_SYSRQ
8389 static void normalize_task(struct rq *rq, struct task_struct *p)
8393 update_rq_clock(rq);
8394 on_rq = p->se.on_rq;
8396 deactivate_task(rq, p, 0);
8397 __setscheduler(rq, p, SCHED_NORMAL, 0);
8399 activate_task(rq, p, 0);
8400 resched_task(rq->curr);
8404 void normalize_rt_tasks(void)
8406 struct task_struct *g, *p;
8407 unsigned long flags;
8410 read_lock_irqsave(&tasklist_lock, flags);
8411 do_each_thread(g, p) {
8413 * Only normalize user tasks:
8418 p->se.exec_start = 0;
8419 #ifdef CONFIG_SCHEDSTATS
8420 p->se.wait_start = 0;
8421 p->se.sleep_start = 0;
8422 p->se.block_start = 0;
8427 * Renice negative nice level userspace
8430 if (TASK_NICE(p) < 0 && p->mm)
8431 set_user_nice(p, 0);
8435 spin_lock(&p->pi_lock);
8436 rq = __task_rq_lock(p);
8438 normalize_task(rq, p);
8440 __task_rq_unlock(rq);
8441 spin_unlock(&p->pi_lock);
8442 } while_each_thread(g, p);
8444 read_unlock_irqrestore(&tasklist_lock, flags);
8447 #endif /* CONFIG_MAGIC_SYSRQ */
8451 * These functions are only useful for the IA64 MCA handling.
8453 * They can only be called when the whole system has been
8454 * stopped - every CPU needs to be quiescent, and no scheduling
8455 * activity can take place. Using them for anything else would
8456 * be a serious bug, and as a result, they aren't even visible
8457 * under any other configuration.
8461 * curr_task - return the current task for a given cpu.
8462 * @cpu: the processor in question.
8464 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8466 struct task_struct *curr_task(int cpu)
8468 return cpu_curr(cpu);
8472 * set_curr_task - set the current task for a given cpu.
8473 * @cpu: the processor in question.
8474 * @p: the task pointer to set.
8476 * Description: This function must only be used when non-maskable interrupts
8477 * are serviced on a separate stack. It allows the architecture to switch the
8478 * notion of the current task on a cpu in a non-blocking manner. This function
8479 * must be called with all CPU's synchronized, and interrupts disabled, the
8480 * and caller must save the original value of the current task (see
8481 * curr_task() above) and restore that value before reenabling interrupts and
8482 * re-starting the system.
8484 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8486 void set_curr_task(int cpu, struct task_struct *p)
8493 #ifdef CONFIG_FAIR_GROUP_SCHED
8494 static void free_fair_sched_group(struct task_group *tg)
8498 for_each_possible_cpu(i) {
8500 kfree(tg->cfs_rq[i]);
8510 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8512 struct cfs_rq *cfs_rq;
8513 struct sched_entity *se;
8517 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
8520 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
8524 tg->shares = NICE_0_LOAD;
8526 for_each_possible_cpu(i) {
8529 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
8530 GFP_KERNEL, cpu_to_node(i));
8534 se = kzalloc_node(sizeof(struct sched_entity),
8535 GFP_KERNEL, cpu_to_node(i));
8539 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
8548 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8550 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
8551 &cpu_rq(cpu)->leaf_cfs_rq_list);
8554 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8556 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
8558 #else /* !CONFG_FAIR_GROUP_SCHED */
8559 static inline void free_fair_sched_group(struct task_group *tg)
8564 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8569 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8573 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8576 #endif /* CONFIG_FAIR_GROUP_SCHED */
8578 #ifdef CONFIG_RT_GROUP_SCHED
8579 static void free_rt_sched_group(struct task_group *tg)
8583 destroy_rt_bandwidth(&tg->rt_bandwidth);
8585 for_each_possible_cpu(i) {
8587 kfree(tg->rt_rq[i]);
8589 kfree(tg->rt_se[i]);
8597 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8599 struct rt_rq *rt_rq;
8600 struct sched_rt_entity *rt_se;
8604 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
8607 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
8611 init_rt_bandwidth(&tg->rt_bandwidth,
8612 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
8614 for_each_possible_cpu(i) {
8617 rt_rq = kzalloc_node(sizeof(struct rt_rq),
8618 GFP_KERNEL, cpu_to_node(i));
8622 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
8623 GFP_KERNEL, cpu_to_node(i));
8627 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
8636 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8638 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
8639 &cpu_rq(cpu)->leaf_rt_rq_list);
8642 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8644 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
8646 #else /* !CONFIG_RT_GROUP_SCHED */
8647 static inline void free_rt_sched_group(struct task_group *tg)
8652 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8657 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8661 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8664 #endif /* CONFIG_RT_GROUP_SCHED */
8666 #ifdef CONFIG_GROUP_SCHED
8667 static void free_sched_group(struct task_group *tg)
8669 free_fair_sched_group(tg);
8670 free_rt_sched_group(tg);
8674 /* allocate runqueue etc for a new task group */
8675 struct task_group *sched_create_group(struct task_group *parent)
8677 struct task_group *tg;
8678 unsigned long flags;
8681 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
8683 return ERR_PTR(-ENOMEM);
8685 if (!alloc_fair_sched_group(tg, parent))
8688 if (!alloc_rt_sched_group(tg, parent))
8691 spin_lock_irqsave(&task_group_lock, flags);
8692 for_each_possible_cpu(i) {
8693 register_fair_sched_group(tg, i);
8694 register_rt_sched_group(tg, i);
8696 list_add_rcu(&tg->list, &task_groups);
8698 WARN_ON(!parent); /* root should already exist */
8700 tg->parent = parent;
8701 INIT_LIST_HEAD(&tg->children);
8702 list_add_rcu(&tg->siblings, &parent->children);
8703 spin_unlock_irqrestore(&task_group_lock, flags);
8708 free_sched_group(tg);
8709 return ERR_PTR(-ENOMEM);
8712 /* rcu callback to free various structures associated with a task group */
8713 static void free_sched_group_rcu(struct rcu_head *rhp)
8715 /* now it should be safe to free those cfs_rqs */
8716 free_sched_group(container_of(rhp, struct task_group, rcu));
8719 /* Destroy runqueue etc associated with a task group */
8720 void sched_destroy_group(struct task_group *tg)
8722 unsigned long flags;
8725 spin_lock_irqsave(&task_group_lock, flags);
8726 for_each_possible_cpu(i) {
8727 unregister_fair_sched_group(tg, i);
8728 unregister_rt_sched_group(tg, i);
8730 list_del_rcu(&tg->list);
8731 list_del_rcu(&tg->siblings);
8732 spin_unlock_irqrestore(&task_group_lock, flags);
8734 /* wait for possible concurrent references to cfs_rqs complete */
8735 call_rcu(&tg->rcu, free_sched_group_rcu);
8738 /* change task's runqueue when it moves between groups.
8739 * The caller of this function should have put the task in its new group
8740 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
8741 * reflect its new group.
8743 void sched_move_task(struct task_struct *tsk)
8746 unsigned long flags;
8749 rq = task_rq_lock(tsk, &flags);
8751 update_rq_clock(rq);
8753 running = task_current(rq, tsk);
8754 on_rq = tsk->se.on_rq;
8757 dequeue_task(rq, tsk, 0);
8758 if (unlikely(running))
8759 tsk->sched_class->put_prev_task(rq, tsk);
8761 set_task_rq(tsk, task_cpu(tsk));
8763 #ifdef CONFIG_FAIR_GROUP_SCHED
8764 if (tsk->sched_class->moved_group)
8765 tsk->sched_class->moved_group(tsk);
8768 if (unlikely(running))
8769 tsk->sched_class->set_curr_task(rq);
8771 enqueue_task(rq, tsk, 0);
8773 task_rq_unlock(rq, &flags);
8775 #endif /* CONFIG_GROUP_SCHED */
8777 #ifdef CONFIG_FAIR_GROUP_SCHED
8778 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
8780 struct cfs_rq *cfs_rq = se->cfs_rq;
8785 dequeue_entity(cfs_rq, se, 0);
8787 se->load.weight = shares;
8788 se->load.inv_weight = 0;
8791 enqueue_entity(cfs_rq, se, 0);
8794 static void set_se_shares(struct sched_entity *se, unsigned long shares)
8796 struct cfs_rq *cfs_rq = se->cfs_rq;
8797 struct rq *rq = cfs_rq->rq;
8798 unsigned long flags;
8800 spin_lock_irqsave(&rq->lock, flags);
8801 __set_se_shares(se, shares);
8802 spin_unlock_irqrestore(&rq->lock, flags);
8805 static DEFINE_MUTEX(shares_mutex);
8807 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
8810 unsigned long flags;
8813 * We can't change the weight of the root cgroup.
8818 if (shares < MIN_SHARES)
8819 shares = MIN_SHARES;
8820 else if (shares > MAX_SHARES)
8821 shares = MAX_SHARES;
8823 mutex_lock(&shares_mutex);
8824 if (tg->shares == shares)
8827 spin_lock_irqsave(&task_group_lock, flags);
8828 for_each_possible_cpu(i)
8829 unregister_fair_sched_group(tg, i);
8830 list_del_rcu(&tg->siblings);
8831 spin_unlock_irqrestore(&task_group_lock, flags);
8833 /* wait for any ongoing reference to this group to finish */
8834 synchronize_sched();
8837 * Now we are free to modify the group's share on each cpu
8838 * w/o tripping rebalance_share or load_balance_fair.
8840 tg->shares = shares;
8841 for_each_possible_cpu(i) {
8845 cfs_rq_set_shares(tg->cfs_rq[i], 0);
8846 set_se_shares(tg->se[i], shares);
8850 * Enable load balance activity on this group, by inserting it back on
8851 * each cpu's rq->leaf_cfs_rq_list.
8853 spin_lock_irqsave(&task_group_lock, flags);
8854 for_each_possible_cpu(i)
8855 register_fair_sched_group(tg, i);
8856 list_add_rcu(&tg->siblings, &tg->parent->children);
8857 spin_unlock_irqrestore(&task_group_lock, flags);
8859 mutex_unlock(&shares_mutex);
8863 unsigned long sched_group_shares(struct task_group *tg)
8869 #ifdef CONFIG_RT_GROUP_SCHED
8871 * Ensure that the real time constraints are schedulable.
8873 static DEFINE_MUTEX(rt_constraints_mutex);
8875 static unsigned long to_ratio(u64 period, u64 runtime)
8877 if (runtime == RUNTIME_INF)
8880 return div64_u64(runtime << 20, period);
8883 /* Must be called with tasklist_lock held */
8884 static inline int tg_has_rt_tasks(struct task_group *tg)
8886 struct task_struct *g, *p;
8888 do_each_thread(g, p) {
8889 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
8891 } while_each_thread(g, p);
8896 struct rt_schedulable_data {
8897 struct task_group *tg;
8902 static int tg_schedulable(struct task_group *tg, void *data)
8904 struct rt_schedulable_data *d = data;
8905 struct task_group *child;
8906 unsigned long total, sum = 0;
8907 u64 period, runtime;
8909 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8910 runtime = tg->rt_bandwidth.rt_runtime;
8913 period = d->rt_period;
8914 runtime = d->rt_runtime;
8918 * Cannot have more runtime than the period.
8920 if (runtime > period && runtime != RUNTIME_INF)
8924 * Ensure we don't starve existing RT tasks.
8926 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
8929 total = to_ratio(period, runtime);
8932 * Nobody can have more than the global setting allows.
8934 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
8938 * The sum of our children's runtime should not exceed our own.
8940 list_for_each_entry_rcu(child, &tg->children, siblings) {
8941 period = ktime_to_ns(child->rt_bandwidth.rt_period);
8942 runtime = child->rt_bandwidth.rt_runtime;
8944 if (child == d->tg) {
8945 period = d->rt_period;
8946 runtime = d->rt_runtime;
8949 sum += to_ratio(period, runtime);
8958 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
8960 struct rt_schedulable_data data = {
8962 .rt_period = period,
8963 .rt_runtime = runtime,
8966 return walk_tg_tree(tg_schedulable, tg_nop, &data);
8969 static int tg_set_bandwidth(struct task_group *tg,
8970 u64 rt_period, u64 rt_runtime)
8974 mutex_lock(&rt_constraints_mutex);
8975 read_lock(&tasklist_lock);
8976 err = __rt_schedulable(tg, rt_period, rt_runtime);
8980 spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8981 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
8982 tg->rt_bandwidth.rt_runtime = rt_runtime;
8984 for_each_possible_cpu(i) {
8985 struct rt_rq *rt_rq = tg->rt_rq[i];
8987 spin_lock(&rt_rq->rt_runtime_lock);
8988 rt_rq->rt_runtime = rt_runtime;
8989 spin_unlock(&rt_rq->rt_runtime_lock);
8991 spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8993 read_unlock(&tasklist_lock);
8994 mutex_unlock(&rt_constraints_mutex);
8999 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
9001 u64 rt_runtime, rt_period;
9003 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
9004 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
9005 if (rt_runtime_us < 0)
9006 rt_runtime = RUNTIME_INF;
9008 return tg_set_bandwidth(tg, rt_period, rt_runtime);
9011 long sched_group_rt_runtime(struct task_group *tg)
9015 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
9018 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
9019 do_div(rt_runtime_us, NSEC_PER_USEC);
9020 return rt_runtime_us;
9023 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
9025 u64 rt_runtime, rt_period;
9027 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
9028 rt_runtime = tg->rt_bandwidth.rt_runtime;
9033 return tg_set_bandwidth(tg, rt_period, rt_runtime);
9036 long sched_group_rt_period(struct task_group *tg)
9040 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
9041 do_div(rt_period_us, NSEC_PER_USEC);
9042 return rt_period_us;
9045 static int sched_rt_global_constraints(void)
9047 u64 runtime, period;
9050 if (sysctl_sched_rt_period <= 0)
9053 runtime = global_rt_runtime();
9054 period = global_rt_period();
9057 * Sanity check on the sysctl variables.
9059 if (runtime > period && runtime != RUNTIME_INF)
9062 mutex_lock(&rt_constraints_mutex);
9063 read_lock(&tasklist_lock);
9064 ret = __rt_schedulable(NULL, 0, 0);
9065 read_unlock(&tasklist_lock);
9066 mutex_unlock(&rt_constraints_mutex);
9070 #else /* !CONFIG_RT_GROUP_SCHED */
9071 static int sched_rt_global_constraints(void)
9073 unsigned long flags;
9076 if (sysctl_sched_rt_period <= 0)
9079 spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
9080 for_each_possible_cpu(i) {
9081 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
9083 spin_lock(&rt_rq->rt_runtime_lock);
9084 rt_rq->rt_runtime = global_rt_runtime();
9085 spin_unlock(&rt_rq->rt_runtime_lock);
9087 spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
9091 #endif /* CONFIG_RT_GROUP_SCHED */
9093 int sched_rt_handler(struct ctl_table *table, int write,
9094 struct file *filp, void __user *buffer, size_t *lenp,
9098 int old_period, old_runtime;
9099 static DEFINE_MUTEX(mutex);
9102 old_period = sysctl_sched_rt_period;
9103 old_runtime = sysctl_sched_rt_runtime;
9105 ret = proc_dointvec(table, write, filp, buffer, lenp, ppos);
9107 if (!ret && write) {
9108 ret = sched_rt_global_constraints();
9110 sysctl_sched_rt_period = old_period;
9111 sysctl_sched_rt_runtime = old_runtime;
9113 def_rt_bandwidth.rt_runtime = global_rt_runtime();
9114 def_rt_bandwidth.rt_period =
9115 ns_to_ktime(global_rt_period());
9118 mutex_unlock(&mutex);
9123 #ifdef CONFIG_CGROUP_SCHED
9125 /* return corresponding task_group object of a cgroup */
9126 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
9128 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
9129 struct task_group, css);
9132 static struct cgroup_subsys_state *
9133 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
9135 struct task_group *tg, *parent;
9137 if (!cgrp->parent) {
9138 /* This is early initialization for the top cgroup */
9139 return &init_task_group.css;
9142 parent = cgroup_tg(cgrp->parent);
9143 tg = sched_create_group(parent);
9145 return ERR_PTR(-ENOMEM);
9151 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9153 struct task_group *tg = cgroup_tg(cgrp);
9155 sched_destroy_group(tg);
9159 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9160 struct task_struct *tsk)
9162 #ifdef CONFIG_RT_GROUP_SCHED
9163 /* Don't accept realtime tasks when there is no way for them to run */
9164 if (rt_task(tsk) && cgroup_tg(cgrp)->rt_bandwidth.rt_runtime == 0)
9167 /* We don't support RT-tasks being in separate groups */
9168 if (tsk->sched_class != &fair_sched_class)
9176 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9177 struct cgroup *old_cont, struct task_struct *tsk)
9179 sched_move_task(tsk);
9182 #ifdef CONFIG_FAIR_GROUP_SCHED
9183 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
9186 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
9189 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
9191 struct task_group *tg = cgroup_tg(cgrp);
9193 return (u64) tg->shares;
9195 #endif /* CONFIG_FAIR_GROUP_SCHED */
9197 #ifdef CONFIG_RT_GROUP_SCHED
9198 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
9201 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
9204 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
9206 return sched_group_rt_runtime(cgroup_tg(cgrp));
9209 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
9212 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
9215 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
9217 return sched_group_rt_period(cgroup_tg(cgrp));
9219 #endif /* CONFIG_RT_GROUP_SCHED */
9221 static struct cftype cpu_files[] = {
9222 #ifdef CONFIG_FAIR_GROUP_SCHED
9225 .read_u64 = cpu_shares_read_u64,
9226 .write_u64 = cpu_shares_write_u64,
9229 #ifdef CONFIG_RT_GROUP_SCHED
9231 .name = "rt_runtime_us",
9232 .read_s64 = cpu_rt_runtime_read,
9233 .write_s64 = cpu_rt_runtime_write,
9236 .name = "rt_period_us",
9237 .read_u64 = cpu_rt_period_read_uint,
9238 .write_u64 = cpu_rt_period_write_uint,
9243 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
9245 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
9248 struct cgroup_subsys cpu_cgroup_subsys = {
9250 .create = cpu_cgroup_create,
9251 .destroy = cpu_cgroup_destroy,
9252 .can_attach = cpu_cgroup_can_attach,
9253 .attach = cpu_cgroup_attach,
9254 .populate = cpu_cgroup_populate,
9255 .subsys_id = cpu_cgroup_subsys_id,
9259 #endif /* CONFIG_CGROUP_SCHED */
9261 #ifdef CONFIG_CGROUP_CPUACCT
9264 * CPU accounting code for task groups.
9266 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
9267 * (balbir@in.ibm.com).
9270 /* track cpu usage of a group of tasks and its child groups */
9272 struct cgroup_subsys_state css;
9273 /* cpuusage holds pointer to a u64-type object on every cpu */
9275 struct cpuacct *parent;
9278 struct cgroup_subsys cpuacct_subsys;
9280 /* return cpu accounting group corresponding to this container */
9281 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
9283 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
9284 struct cpuacct, css);
9287 /* return cpu accounting group to which this task belongs */
9288 static inline struct cpuacct *task_ca(struct task_struct *tsk)
9290 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
9291 struct cpuacct, css);
9294 /* create a new cpu accounting group */
9295 static struct cgroup_subsys_state *cpuacct_create(
9296 struct cgroup_subsys *ss, struct cgroup *cgrp)
9298 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
9301 return ERR_PTR(-ENOMEM);
9303 ca->cpuusage = alloc_percpu(u64);
9304 if (!ca->cpuusage) {
9306 return ERR_PTR(-ENOMEM);
9310 ca->parent = cgroup_ca(cgrp->parent);
9315 /* destroy an existing cpu accounting group */
9317 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9319 struct cpuacct *ca = cgroup_ca(cgrp);
9321 free_percpu(ca->cpuusage);
9325 /* return total cpu usage (in nanoseconds) of a group */
9326 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
9328 struct cpuacct *ca = cgroup_ca(cgrp);
9329 u64 totalcpuusage = 0;
9332 for_each_possible_cpu(i) {
9333 u64 *cpuusage = percpu_ptr(ca->cpuusage, i);
9336 * Take rq->lock to make 64-bit addition safe on 32-bit
9339 spin_lock_irq(&cpu_rq(i)->lock);
9340 totalcpuusage += *cpuusage;
9341 spin_unlock_irq(&cpu_rq(i)->lock);
9344 return totalcpuusage;
9347 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
9350 struct cpuacct *ca = cgroup_ca(cgrp);
9359 for_each_possible_cpu(i) {
9360 u64 *cpuusage = percpu_ptr(ca->cpuusage, i);
9362 spin_lock_irq(&cpu_rq(i)->lock);
9364 spin_unlock_irq(&cpu_rq(i)->lock);
9370 static struct cftype files[] = {
9373 .read_u64 = cpuusage_read,
9374 .write_u64 = cpuusage_write,
9378 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
9380 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
9384 * charge this task's execution time to its accounting group.
9386 * called with rq->lock held.
9388 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
9393 if (!cpuacct_subsys.active)
9396 cpu = task_cpu(tsk);
9399 for (; ca; ca = ca->parent) {
9400 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9401 *cpuusage += cputime;
9405 struct cgroup_subsys cpuacct_subsys = {
9407 .create = cpuacct_create,
9408 .destroy = cpuacct_destroy,
9409 .populate = cpuacct_populate,
9410 .subsys_id = cpuacct_subsys_id,
9412 #endif /* CONFIG_CGROUP_CPUACCT */