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
494 * The "RT overload" flag: it gets set if a CPU has more than
495 * one runnable RT task.
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_mask(i, sd->span) {
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_mask(i, sd->span)
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 (!cpus_intersects(group->cpumask, p->cpus_allowed))
2059 local_group = cpu_isset(this_cpu, group->cpumask);
2061 /* Tally up the load of all CPUs in the group */
2064 for_each_cpu_mask_nr(i, group->cpumask) {
2065 /* Bias balancing toward cpus of our domain */
2067 load = source_load(i, load_idx);
2069 load = target_load(i, load_idx);
2074 /* Adjust by relative CPU power of the group */
2075 avg_load = sg_div_cpu_power(group,
2076 avg_load * SCHED_LOAD_SCALE);
2079 this_load = avg_load;
2081 } else if (avg_load < min_load) {
2082 min_load = avg_load;
2085 } while (group = group->next, group != sd->groups);
2087 if (!idlest || 100*this_load < imbalance*min_load)
2093 * find_idlest_cpu - find the idlest cpu among the cpus in group.
2096 find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu,
2099 unsigned long load, min_load = ULONG_MAX;
2103 /* Traverse only the allowed CPUs */
2104 cpus_and(*tmp, group->cpumask, p->cpus_allowed);
2106 for_each_cpu_mask_nr(i, *tmp) {
2107 load = weighted_cpuload(i);
2109 if (load < min_load || (load == min_load && i == this_cpu)) {
2119 * sched_balance_self: balance the current task (running on cpu) in domains
2120 * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and
2123 * Balance, ie. select the least loaded group.
2125 * Returns the target CPU number, or the same CPU if no balancing is needed.
2127 * preempt must be disabled.
2129 static int sched_balance_self(int cpu, int flag)
2131 struct task_struct *t = current;
2132 struct sched_domain *tmp, *sd = NULL;
2134 for_each_domain(cpu, tmp) {
2136 * If power savings logic is enabled for a domain, stop there.
2138 if (tmp->flags & SD_POWERSAVINGS_BALANCE)
2140 if (tmp->flags & flag)
2148 cpumask_t span, tmpmask;
2149 struct sched_group *group;
2150 int new_cpu, weight;
2152 if (!(sd->flags & flag)) {
2158 group = find_idlest_group(sd, t, cpu);
2164 new_cpu = find_idlest_cpu(group, t, cpu, &tmpmask);
2165 if (new_cpu == -1 || new_cpu == cpu) {
2166 /* Now try balancing at a lower domain level of cpu */
2171 /* Now try balancing at a lower domain level of new_cpu */
2174 weight = cpus_weight(span);
2175 for_each_domain(cpu, tmp) {
2176 if (weight <= cpus_weight(tmp->span))
2178 if (tmp->flags & flag)
2181 /* while loop will break here if sd == NULL */
2187 #endif /* CONFIG_SMP */
2190 * try_to_wake_up - wake up a thread
2191 * @p: the to-be-woken-up thread
2192 * @state: the mask of task states that can be woken
2193 * @sync: do a synchronous wakeup?
2195 * Put it on the run-queue if it's not already there. The "current"
2196 * thread is always on the run-queue (except when the actual
2197 * re-schedule is in progress), and as such you're allowed to do
2198 * the simpler "current->state = TASK_RUNNING" to mark yourself
2199 * runnable without the overhead of this.
2201 * returns failure only if the task is already active.
2203 static int try_to_wake_up(struct task_struct *p, unsigned int state, int sync)
2205 int cpu, orig_cpu, this_cpu, success = 0;
2206 unsigned long flags;
2210 if (!sched_feat(SYNC_WAKEUPS))
2214 if (sched_feat(LB_WAKEUP_UPDATE)) {
2215 struct sched_domain *sd;
2217 this_cpu = raw_smp_processor_id();
2220 for_each_domain(this_cpu, sd) {
2221 if (cpu_isset(cpu, sd->span)) {
2230 rq = task_rq_lock(p, &flags);
2231 old_state = p->state;
2232 if (!(old_state & state))
2240 this_cpu = smp_processor_id();
2243 if (unlikely(task_running(rq, p)))
2246 cpu = p->sched_class->select_task_rq(p, sync);
2247 if (cpu != orig_cpu) {
2248 set_task_cpu(p, cpu);
2249 task_rq_unlock(rq, &flags);
2250 /* might preempt at this point */
2251 rq = task_rq_lock(p, &flags);
2252 old_state = p->state;
2253 if (!(old_state & state))
2258 this_cpu = smp_processor_id();
2262 #ifdef CONFIG_SCHEDSTATS
2263 schedstat_inc(rq, ttwu_count);
2264 if (cpu == this_cpu)
2265 schedstat_inc(rq, ttwu_local);
2267 struct sched_domain *sd;
2268 for_each_domain(this_cpu, sd) {
2269 if (cpu_isset(cpu, sd->span)) {
2270 schedstat_inc(sd, ttwu_wake_remote);
2275 #endif /* CONFIG_SCHEDSTATS */
2278 #endif /* CONFIG_SMP */
2279 schedstat_inc(p, se.nr_wakeups);
2281 schedstat_inc(p, se.nr_wakeups_sync);
2282 if (orig_cpu != cpu)
2283 schedstat_inc(p, se.nr_wakeups_migrate);
2284 if (cpu == this_cpu)
2285 schedstat_inc(p, se.nr_wakeups_local);
2287 schedstat_inc(p, se.nr_wakeups_remote);
2288 update_rq_clock(rq);
2289 activate_task(rq, p, 1);
2293 trace_sched_wakeup(rq, p);
2294 check_preempt_curr(rq, p, sync);
2296 p->state = TASK_RUNNING;
2298 if (p->sched_class->task_wake_up)
2299 p->sched_class->task_wake_up(rq, p);
2302 current->se.last_wakeup = current->se.sum_exec_runtime;
2304 task_rq_unlock(rq, &flags);
2309 int wake_up_process(struct task_struct *p)
2311 return try_to_wake_up(p, TASK_ALL, 0);
2313 EXPORT_SYMBOL(wake_up_process);
2315 int wake_up_state(struct task_struct *p, unsigned int state)
2317 return try_to_wake_up(p, state, 0);
2321 * Perform scheduler related setup for a newly forked process p.
2322 * p is forked by current.
2324 * __sched_fork() is basic setup used by init_idle() too:
2326 static void __sched_fork(struct task_struct *p)
2328 p->se.exec_start = 0;
2329 p->se.sum_exec_runtime = 0;
2330 p->se.prev_sum_exec_runtime = 0;
2331 p->se.last_wakeup = 0;
2332 p->se.avg_overlap = 0;
2334 #ifdef CONFIG_SCHEDSTATS
2335 p->se.wait_start = 0;
2336 p->se.sum_sleep_runtime = 0;
2337 p->se.sleep_start = 0;
2338 p->se.block_start = 0;
2339 p->se.sleep_max = 0;
2340 p->se.block_max = 0;
2342 p->se.slice_max = 0;
2346 INIT_LIST_HEAD(&p->rt.run_list);
2348 INIT_LIST_HEAD(&p->se.group_node);
2350 #ifdef CONFIG_PREEMPT_NOTIFIERS
2351 INIT_HLIST_HEAD(&p->preempt_notifiers);
2355 * We mark the process as running here, but have not actually
2356 * inserted it onto the runqueue yet. This guarantees that
2357 * nobody will actually run it, and a signal or other external
2358 * event cannot wake it up and insert it on the runqueue either.
2360 p->state = TASK_RUNNING;
2364 * fork()/clone()-time setup:
2366 void sched_fork(struct task_struct *p, int clone_flags)
2368 int cpu = get_cpu();
2373 cpu = sched_balance_self(cpu, SD_BALANCE_FORK);
2375 set_task_cpu(p, cpu);
2378 * Make sure we do not leak PI boosting priority to the child:
2380 p->prio = current->normal_prio;
2381 if (!rt_prio(p->prio))
2382 p->sched_class = &fair_sched_class;
2384 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2385 if (likely(sched_info_on()))
2386 memset(&p->sched_info, 0, sizeof(p->sched_info));
2388 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2391 #ifdef CONFIG_PREEMPT
2392 /* Want to start with kernel preemption disabled. */
2393 task_thread_info(p)->preempt_count = 1;
2399 * wake_up_new_task - wake up a newly created task for the first time.
2401 * This function will do some initial scheduler statistics housekeeping
2402 * that must be done for every newly created context, then puts the task
2403 * on the runqueue and wakes it.
2405 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2407 unsigned long flags;
2410 rq = task_rq_lock(p, &flags);
2411 BUG_ON(p->state != TASK_RUNNING);
2412 update_rq_clock(rq);
2414 p->prio = effective_prio(p);
2416 if (!p->sched_class->task_new || !current->se.on_rq) {
2417 activate_task(rq, p, 0);
2420 * Let the scheduling class do new task startup
2421 * management (if any):
2423 p->sched_class->task_new(rq, p);
2426 trace_sched_wakeup_new(rq, p);
2427 check_preempt_curr(rq, p, 0);
2429 if (p->sched_class->task_wake_up)
2430 p->sched_class->task_wake_up(rq, p);
2432 task_rq_unlock(rq, &flags);
2435 #ifdef CONFIG_PREEMPT_NOTIFIERS
2438 * preempt_notifier_register - tell me when current is being being preempted & rescheduled
2439 * @notifier: notifier struct to register
2441 void preempt_notifier_register(struct preempt_notifier *notifier)
2443 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2445 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2448 * preempt_notifier_unregister - no longer interested in preemption notifications
2449 * @notifier: notifier struct to unregister
2451 * This is safe to call from within a preemption notifier.
2453 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2455 hlist_del(¬ifier->link);
2457 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2459 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2461 struct preempt_notifier *notifier;
2462 struct hlist_node *node;
2464 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2465 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2469 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2470 struct task_struct *next)
2472 struct preempt_notifier *notifier;
2473 struct hlist_node *node;
2475 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2476 notifier->ops->sched_out(notifier, next);
2479 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2481 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2486 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2487 struct task_struct *next)
2491 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2494 * prepare_task_switch - prepare to switch tasks
2495 * @rq: the runqueue preparing to switch
2496 * @prev: the current task that is being switched out
2497 * @next: the task we are going to switch to.
2499 * This is called with the rq lock held and interrupts off. It must
2500 * be paired with a subsequent finish_task_switch after the context
2503 * prepare_task_switch sets up locking and calls architecture specific
2507 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2508 struct task_struct *next)
2510 fire_sched_out_preempt_notifiers(prev, next);
2511 prepare_lock_switch(rq, next);
2512 prepare_arch_switch(next);
2516 * finish_task_switch - clean up after a task-switch
2517 * @rq: runqueue associated with task-switch
2518 * @prev: the thread we just switched away from.
2520 * finish_task_switch must be called after the context switch, paired
2521 * with a prepare_task_switch call before the context switch.
2522 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2523 * and do any other architecture-specific cleanup actions.
2525 * Note that we may have delayed dropping an mm in context_switch(). If
2526 * so, we finish that here outside of the runqueue lock. (Doing it
2527 * with the lock held can cause deadlocks; see schedule() for
2530 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2531 __releases(rq->lock)
2533 struct mm_struct *mm = rq->prev_mm;
2539 * A task struct has one reference for the use as "current".
2540 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2541 * schedule one last time. The schedule call will never return, and
2542 * the scheduled task must drop that reference.
2543 * The test for TASK_DEAD must occur while the runqueue locks are
2544 * still held, otherwise prev could be scheduled on another cpu, die
2545 * there before we look at prev->state, and then the reference would
2547 * Manfred Spraul <manfred@colorfullife.com>
2549 prev_state = prev->state;
2550 finish_arch_switch(prev);
2551 finish_lock_switch(rq, prev);
2553 if (current->sched_class->post_schedule)
2554 current->sched_class->post_schedule(rq);
2557 fire_sched_in_preempt_notifiers(current);
2560 if (unlikely(prev_state == TASK_DEAD)) {
2562 * Remove function-return probe instances associated with this
2563 * task and put them back on the free list.
2565 kprobe_flush_task(prev);
2566 put_task_struct(prev);
2571 * schedule_tail - first thing a freshly forked thread must call.
2572 * @prev: the thread we just switched away from.
2574 asmlinkage void schedule_tail(struct task_struct *prev)
2575 __releases(rq->lock)
2577 struct rq *rq = this_rq();
2579 finish_task_switch(rq, prev);
2580 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2581 /* In this case, finish_task_switch does not reenable preemption */
2584 if (current->set_child_tid)
2585 put_user(task_pid_vnr(current), current->set_child_tid);
2589 * context_switch - switch to the new MM and the new
2590 * thread's register state.
2593 context_switch(struct rq *rq, struct task_struct *prev,
2594 struct task_struct *next)
2596 struct mm_struct *mm, *oldmm;
2598 prepare_task_switch(rq, prev, next);
2599 trace_sched_switch(rq, prev, next);
2601 oldmm = prev->active_mm;
2603 * For paravirt, this is coupled with an exit in switch_to to
2604 * combine the page table reload and the switch backend into
2607 arch_enter_lazy_cpu_mode();
2609 if (unlikely(!mm)) {
2610 next->active_mm = oldmm;
2611 atomic_inc(&oldmm->mm_count);
2612 enter_lazy_tlb(oldmm, next);
2614 switch_mm(oldmm, mm, next);
2616 if (unlikely(!prev->mm)) {
2617 prev->active_mm = NULL;
2618 rq->prev_mm = oldmm;
2621 * Since the runqueue lock will be released by the next
2622 * task (which is an invalid locking op but in the case
2623 * of the scheduler it's an obvious special-case), so we
2624 * do an early lockdep release here:
2626 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2627 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2630 /* Here we just switch the register state and the stack. */
2631 switch_to(prev, next, prev);
2635 * this_rq must be evaluated again because prev may have moved
2636 * CPUs since it called schedule(), thus the 'rq' on its stack
2637 * frame will be invalid.
2639 finish_task_switch(this_rq(), prev);
2643 * nr_running, nr_uninterruptible and nr_context_switches:
2645 * externally visible scheduler statistics: current number of runnable
2646 * threads, current number of uninterruptible-sleeping threads, total
2647 * number of context switches performed since bootup.
2649 unsigned long nr_running(void)
2651 unsigned long i, sum = 0;
2653 for_each_online_cpu(i)
2654 sum += cpu_rq(i)->nr_running;
2659 unsigned long nr_uninterruptible(void)
2661 unsigned long i, sum = 0;
2663 for_each_possible_cpu(i)
2664 sum += cpu_rq(i)->nr_uninterruptible;
2667 * Since we read the counters lockless, it might be slightly
2668 * inaccurate. Do not allow it to go below zero though:
2670 if (unlikely((long)sum < 0))
2676 unsigned long long nr_context_switches(void)
2679 unsigned long long sum = 0;
2681 for_each_possible_cpu(i)
2682 sum += cpu_rq(i)->nr_switches;
2687 unsigned long nr_iowait(void)
2689 unsigned long i, sum = 0;
2691 for_each_possible_cpu(i)
2692 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2697 unsigned long nr_active(void)
2699 unsigned long i, running = 0, uninterruptible = 0;
2701 for_each_online_cpu(i) {
2702 running += cpu_rq(i)->nr_running;
2703 uninterruptible += cpu_rq(i)->nr_uninterruptible;
2706 if (unlikely((long)uninterruptible < 0))
2707 uninterruptible = 0;
2709 return running + uninterruptible;
2713 * Update rq->cpu_load[] statistics. This function is usually called every
2714 * scheduler tick (TICK_NSEC).
2716 static void update_cpu_load(struct rq *this_rq)
2718 unsigned long this_load = this_rq->load.weight;
2721 this_rq->nr_load_updates++;
2723 /* Update our load: */
2724 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
2725 unsigned long old_load, new_load;
2727 /* scale is effectively 1 << i now, and >> i divides by scale */
2729 old_load = this_rq->cpu_load[i];
2730 new_load = this_load;
2732 * Round up the averaging division if load is increasing. This
2733 * prevents us from getting stuck on 9 if the load is 10, for
2736 if (new_load > old_load)
2737 new_load += scale-1;
2738 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
2745 * double_rq_lock - safely lock two runqueues
2747 * Note this does not disable interrupts like task_rq_lock,
2748 * you need to do so manually before calling.
2750 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
2751 __acquires(rq1->lock)
2752 __acquires(rq2->lock)
2754 BUG_ON(!irqs_disabled());
2756 spin_lock(&rq1->lock);
2757 __acquire(rq2->lock); /* Fake it out ;) */
2760 spin_lock(&rq1->lock);
2761 spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
2763 spin_lock(&rq2->lock);
2764 spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
2767 update_rq_clock(rq1);
2768 update_rq_clock(rq2);
2772 * double_rq_unlock - safely unlock two runqueues
2774 * Note this does not restore interrupts like task_rq_unlock,
2775 * you need to do so manually after calling.
2777 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
2778 __releases(rq1->lock)
2779 __releases(rq2->lock)
2781 spin_unlock(&rq1->lock);
2783 spin_unlock(&rq2->lock);
2785 __release(rq2->lock);
2789 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
2791 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
2792 __releases(this_rq->lock)
2793 __acquires(busiest->lock)
2794 __acquires(this_rq->lock)
2798 if (unlikely(!irqs_disabled())) {
2799 /* printk() doesn't work good under rq->lock */
2800 spin_unlock(&this_rq->lock);
2803 if (unlikely(!spin_trylock(&busiest->lock))) {
2804 if (busiest < this_rq) {
2805 spin_unlock(&this_rq->lock);
2806 spin_lock(&busiest->lock);
2807 spin_lock_nested(&this_rq->lock, SINGLE_DEPTH_NESTING);
2810 spin_lock_nested(&busiest->lock, SINGLE_DEPTH_NESTING);
2815 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
2816 __releases(busiest->lock)
2818 spin_unlock(&busiest->lock);
2819 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
2823 * If dest_cpu is allowed for this process, migrate the task to it.
2824 * This is accomplished by forcing the cpu_allowed mask to only
2825 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
2826 * the cpu_allowed mask is restored.
2828 static void sched_migrate_task(struct task_struct *p, int dest_cpu)
2830 struct migration_req req;
2831 unsigned long flags;
2834 rq = task_rq_lock(p, &flags);
2835 if (!cpu_isset(dest_cpu, p->cpus_allowed)
2836 || unlikely(!cpu_active(dest_cpu)))
2839 trace_sched_migrate_task(rq, p, dest_cpu);
2840 /* force the process onto the specified CPU */
2841 if (migrate_task(p, dest_cpu, &req)) {
2842 /* Need to wait for migration thread (might exit: take ref). */
2843 struct task_struct *mt = rq->migration_thread;
2845 get_task_struct(mt);
2846 task_rq_unlock(rq, &flags);
2847 wake_up_process(mt);
2848 put_task_struct(mt);
2849 wait_for_completion(&req.done);
2854 task_rq_unlock(rq, &flags);
2858 * sched_exec - execve() is a valuable balancing opportunity, because at
2859 * this point the task has the smallest effective memory and cache footprint.
2861 void sched_exec(void)
2863 int new_cpu, this_cpu = get_cpu();
2864 new_cpu = sched_balance_self(this_cpu, SD_BALANCE_EXEC);
2866 if (new_cpu != this_cpu)
2867 sched_migrate_task(current, new_cpu);
2871 * pull_task - move a task from a remote runqueue to the local runqueue.
2872 * Both runqueues must be locked.
2874 static void pull_task(struct rq *src_rq, struct task_struct *p,
2875 struct rq *this_rq, int this_cpu)
2877 deactivate_task(src_rq, p, 0);
2878 set_task_cpu(p, this_cpu);
2879 activate_task(this_rq, p, 0);
2881 * Note that idle threads have a prio of MAX_PRIO, for this test
2882 * to be always true for them.
2884 check_preempt_curr(this_rq, p, 0);
2888 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
2891 int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu,
2892 struct sched_domain *sd, enum cpu_idle_type idle,
2896 * We do not migrate tasks that are:
2897 * 1) running (obviously), or
2898 * 2) cannot be migrated to this CPU due to cpus_allowed, or
2899 * 3) are cache-hot on their current CPU.
2901 if (!cpu_isset(this_cpu, p->cpus_allowed)) {
2902 schedstat_inc(p, se.nr_failed_migrations_affine);
2907 if (task_running(rq, p)) {
2908 schedstat_inc(p, se.nr_failed_migrations_running);
2913 * Aggressive migration if:
2914 * 1) task is cache cold, or
2915 * 2) too many balance attempts have failed.
2918 if (!task_hot(p, rq->clock, sd) ||
2919 sd->nr_balance_failed > sd->cache_nice_tries) {
2920 #ifdef CONFIG_SCHEDSTATS
2921 if (task_hot(p, rq->clock, sd)) {
2922 schedstat_inc(sd, lb_hot_gained[idle]);
2923 schedstat_inc(p, se.nr_forced_migrations);
2929 if (task_hot(p, rq->clock, sd)) {
2930 schedstat_inc(p, se.nr_failed_migrations_hot);
2936 static unsigned long
2937 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
2938 unsigned long max_load_move, struct sched_domain *sd,
2939 enum cpu_idle_type idle, int *all_pinned,
2940 int *this_best_prio, struct rq_iterator *iterator)
2942 int loops = 0, pulled = 0, pinned = 0;
2943 struct task_struct *p;
2944 long rem_load_move = max_load_move;
2946 if (max_load_move == 0)
2952 * Start the load-balancing iterator:
2954 p = iterator->start(iterator->arg);
2956 if (!p || loops++ > sysctl_sched_nr_migrate)
2959 if ((p->se.load.weight >> 1) > rem_load_move ||
2960 !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
2961 p = iterator->next(iterator->arg);
2965 pull_task(busiest, p, this_rq, this_cpu);
2967 rem_load_move -= p->se.load.weight;
2970 * We only want to steal up to the prescribed amount of weighted load.
2972 if (rem_load_move > 0) {
2973 if (p->prio < *this_best_prio)
2974 *this_best_prio = p->prio;
2975 p = iterator->next(iterator->arg);
2980 * Right now, this is one of only two places pull_task() is called,
2981 * so we can safely collect pull_task() stats here rather than
2982 * inside pull_task().
2984 schedstat_add(sd, lb_gained[idle], pulled);
2987 *all_pinned = pinned;
2989 return max_load_move - rem_load_move;
2993 * move_tasks tries to move up to max_load_move weighted load from busiest to
2994 * this_rq, as part of a balancing operation within domain "sd".
2995 * Returns 1 if successful and 0 otherwise.
2997 * Called with both runqueues locked.
2999 static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3000 unsigned long max_load_move,
3001 struct sched_domain *sd, enum cpu_idle_type idle,
3004 const struct sched_class *class = sched_class_highest;
3005 unsigned long total_load_moved = 0;
3006 int this_best_prio = this_rq->curr->prio;
3010 class->load_balance(this_rq, this_cpu, busiest,
3011 max_load_move - total_load_moved,
3012 sd, idle, all_pinned, &this_best_prio);
3013 class = class->next;
3015 if (idle == CPU_NEWLY_IDLE && this_rq->nr_running)
3018 } while (class && max_load_move > total_load_moved);
3020 return total_load_moved > 0;
3024 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3025 struct sched_domain *sd, enum cpu_idle_type idle,
3026 struct rq_iterator *iterator)
3028 struct task_struct *p = iterator->start(iterator->arg);
3032 if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3033 pull_task(busiest, p, this_rq, this_cpu);
3035 * Right now, this is only the second place pull_task()
3036 * is called, so we can safely collect pull_task()
3037 * stats here rather than inside pull_task().
3039 schedstat_inc(sd, lb_gained[idle]);
3043 p = iterator->next(iterator->arg);
3050 * move_one_task tries to move exactly one task from busiest to this_rq, as
3051 * part of active balancing operations within "domain".
3052 * Returns 1 if successful and 0 otherwise.
3054 * Called with both runqueues locked.
3056 static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3057 struct sched_domain *sd, enum cpu_idle_type idle)
3059 const struct sched_class *class;
3061 for (class = sched_class_highest; class; class = class->next)
3062 if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle))
3069 * find_busiest_group finds and returns the busiest CPU group within the
3070 * domain. It calculates and returns the amount of weighted load which
3071 * should be moved to restore balance via the imbalance parameter.
3073 static struct sched_group *
3074 find_busiest_group(struct sched_domain *sd, int this_cpu,
3075 unsigned long *imbalance, enum cpu_idle_type idle,
3076 int *sd_idle, const cpumask_t *cpus, int *balance)
3078 struct sched_group *busiest = NULL, *this = NULL, *group = sd->groups;
3079 unsigned long max_load, avg_load, total_load, this_load, total_pwr;
3080 unsigned long max_pull;
3081 unsigned long busiest_load_per_task, busiest_nr_running;
3082 unsigned long this_load_per_task, this_nr_running;
3083 int load_idx, group_imb = 0;
3084 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3085 int power_savings_balance = 1;
3086 unsigned long leader_nr_running = 0, min_load_per_task = 0;
3087 unsigned long min_nr_running = ULONG_MAX;
3088 struct sched_group *group_min = NULL, *group_leader = NULL;
3091 max_load = this_load = total_load = total_pwr = 0;
3092 busiest_load_per_task = busiest_nr_running = 0;
3093 this_load_per_task = this_nr_running = 0;
3095 if (idle == CPU_NOT_IDLE)
3096 load_idx = sd->busy_idx;
3097 else if (idle == CPU_NEWLY_IDLE)
3098 load_idx = sd->newidle_idx;
3100 load_idx = sd->idle_idx;
3103 unsigned long load, group_capacity, max_cpu_load, min_cpu_load;
3106 int __group_imb = 0;
3107 unsigned int balance_cpu = -1, first_idle_cpu = 0;
3108 unsigned long sum_nr_running, sum_weighted_load;
3109 unsigned long sum_avg_load_per_task;
3110 unsigned long avg_load_per_task;
3112 local_group = cpu_isset(this_cpu, group->cpumask);
3115 balance_cpu = first_cpu(group->cpumask);
3117 /* Tally up the load of all CPUs in the group */
3118 sum_weighted_load = sum_nr_running = avg_load = 0;
3119 sum_avg_load_per_task = avg_load_per_task = 0;
3122 min_cpu_load = ~0UL;
3124 for_each_cpu_mask_nr(i, group->cpumask) {
3127 if (!cpu_isset(i, *cpus))
3132 if (*sd_idle && rq->nr_running)
3135 /* Bias balancing toward cpus of our domain */
3137 if (idle_cpu(i) && !first_idle_cpu) {
3142 load = target_load(i, load_idx);
3144 load = source_load(i, load_idx);
3145 if (load > max_cpu_load)
3146 max_cpu_load = load;
3147 if (min_cpu_load > load)
3148 min_cpu_load = load;
3152 sum_nr_running += rq->nr_running;
3153 sum_weighted_load += weighted_cpuload(i);
3155 sum_avg_load_per_task += cpu_avg_load_per_task(i);
3159 * First idle cpu or the first cpu(busiest) in this sched group
3160 * is eligible for doing load balancing at this and above
3161 * domains. In the newly idle case, we will allow all the cpu's
3162 * to do the newly idle load balance.
3164 if (idle != CPU_NEWLY_IDLE && local_group &&
3165 balance_cpu != this_cpu && balance) {
3170 total_load += avg_load;
3171 total_pwr += group->__cpu_power;
3173 /* Adjust by relative CPU power of the group */
3174 avg_load = sg_div_cpu_power(group,
3175 avg_load * SCHED_LOAD_SCALE);
3179 * Consider the group unbalanced when the imbalance is larger
3180 * than the average weight of two tasks.
3182 * APZ: with cgroup the avg task weight can vary wildly and
3183 * might not be a suitable number - should we keep a
3184 * normalized nr_running number somewhere that negates
3187 avg_load_per_task = sg_div_cpu_power(group,
3188 sum_avg_load_per_task * SCHED_LOAD_SCALE);
3190 if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task)
3193 group_capacity = group->__cpu_power / SCHED_LOAD_SCALE;
3196 this_load = avg_load;
3198 this_nr_running = sum_nr_running;
3199 this_load_per_task = sum_weighted_load;
3200 } else if (avg_load > max_load &&
3201 (sum_nr_running > group_capacity || __group_imb)) {
3202 max_load = avg_load;
3204 busiest_nr_running = sum_nr_running;
3205 busiest_load_per_task = sum_weighted_load;
3206 group_imb = __group_imb;
3209 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3211 * Busy processors will not participate in power savings
3214 if (idle == CPU_NOT_IDLE ||
3215 !(sd->flags & SD_POWERSAVINGS_BALANCE))
3219 * If the local group is idle or completely loaded
3220 * no need to do power savings balance at this domain
3222 if (local_group && (this_nr_running >= group_capacity ||
3224 power_savings_balance = 0;
3227 * If a group is already running at full capacity or idle,
3228 * don't include that group in power savings calculations
3230 if (!power_savings_balance || sum_nr_running >= group_capacity
3235 * Calculate the group which has the least non-idle load.
3236 * This is the group from where we need to pick up the load
3239 if ((sum_nr_running < min_nr_running) ||
3240 (sum_nr_running == min_nr_running &&
3241 first_cpu(group->cpumask) <
3242 first_cpu(group_min->cpumask))) {
3244 min_nr_running = sum_nr_running;
3245 min_load_per_task = sum_weighted_load /
3250 * Calculate the group which is almost near its
3251 * capacity but still has some space to pick up some load
3252 * from other group and save more power
3254 if (sum_nr_running <= group_capacity - 1) {
3255 if (sum_nr_running > leader_nr_running ||
3256 (sum_nr_running == leader_nr_running &&
3257 first_cpu(group->cpumask) >
3258 first_cpu(group_leader->cpumask))) {
3259 group_leader = group;
3260 leader_nr_running = sum_nr_running;
3265 group = group->next;
3266 } while (group != sd->groups);
3268 if (!busiest || this_load >= max_load || busiest_nr_running == 0)
3271 avg_load = (SCHED_LOAD_SCALE * total_load) / total_pwr;
3273 if (this_load >= avg_load ||
3274 100*max_load <= sd->imbalance_pct*this_load)
3277 busiest_load_per_task /= busiest_nr_running;
3279 busiest_load_per_task = min(busiest_load_per_task, avg_load);
3282 * We're trying to get all the cpus to the average_load, so we don't
3283 * want to push ourselves above the average load, nor do we wish to
3284 * reduce the max loaded cpu below the average load, as either of these
3285 * actions would just result in more rebalancing later, and ping-pong
3286 * tasks around. Thus we look for the minimum possible imbalance.
3287 * Negative imbalances (*we* are more loaded than anyone else) will
3288 * be counted as no imbalance for these purposes -- we can't fix that
3289 * by pulling tasks to us. Be careful of negative numbers as they'll
3290 * appear as very large values with unsigned longs.
3292 if (max_load <= busiest_load_per_task)
3296 * In the presence of smp nice balancing, certain scenarios can have
3297 * max load less than avg load(as we skip the groups at or below
3298 * its cpu_power, while calculating max_load..)
3300 if (max_load < avg_load) {
3302 goto small_imbalance;
3305 /* Don't want to pull so many tasks that a group would go idle */
3306 max_pull = min(max_load - avg_load, max_load - busiest_load_per_task);
3308 /* How much load to actually move to equalise the imbalance */
3309 *imbalance = min(max_pull * busiest->__cpu_power,
3310 (avg_load - this_load) * this->__cpu_power)
3314 * if *imbalance is less than the average load per runnable task
3315 * there is no gaurantee that any tasks will be moved so we'll have
3316 * a think about bumping its value to force at least one task to be
3319 if (*imbalance < busiest_load_per_task) {
3320 unsigned long tmp, pwr_now, pwr_move;
3324 pwr_move = pwr_now = 0;
3326 if (this_nr_running) {
3327 this_load_per_task /= this_nr_running;
3328 if (busiest_load_per_task > this_load_per_task)
3331 this_load_per_task = cpu_avg_load_per_task(this_cpu);
3333 if (max_load - this_load + busiest_load_per_task >=
3334 busiest_load_per_task * imbn) {
3335 *imbalance = busiest_load_per_task;
3340 * OK, we don't have enough imbalance to justify moving tasks,
3341 * however we may be able to increase total CPU power used by
3345 pwr_now += busiest->__cpu_power *
3346 min(busiest_load_per_task, max_load);
3347 pwr_now += this->__cpu_power *
3348 min(this_load_per_task, this_load);
3349 pwr_now /= SCHED_LOAD_SCALE;
3351 /* Amount of load we'd subtract */
3352 tmp = sg_div_cpu_power(busiest,
3353 busiest_load_per_task * SCHED_LOAD_SCALE);
3355 pwr_move += busiest->__cpu_power *
3356 min(busiest_load_per_task, max_load - tmp);
3358 /* Amount of load we'd add */
3359 if (max_load * busiest->__cpu_power <
3360 busiest_load_per_task * SCHED_LOAD_SCALE)
3361 tmp = sg_div_cpu_power(this,
3362 max_load * busiest->__cpu_power);
3364 tmp = sg_div_cpu_power(this,
3365 busiest_load_per_task * SCHED_LOAD_SCALE);
3366 pwr_move += this->__cpu_power *
3367 min(this_load_per_task, this_load + tmp);
3368 pwr_move /= SCHED_LOAD_SCALE;
3370 /* Move if we gain throughput */
3371 if (pwr_move > pwr_now)
3372 *imbalance = busiest_load_per_task;
3378 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3379 if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE))
3382 if (this == group_leader && group_leader != group_min) {
3383 *imbalance = min_load_per_task;
3393 * find_busiest_queue - find the busiest runqueue among the cpus in group.
3396 find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle,
3397 unsigned long imbalance, const cpumask_t *cpus)
3399 struct rq *busiest = NULL, *rq;
3400 unsigned long max_load = 0;
3403 for_each_cpu_mask_nr(i, group->cpumask) {
3406 if (!cpu_isset(i, *cpus))
3410 wl = weighted_cpuload(i);
3412 if (rq->nr_running == 1 && wl > imbalance)
3415 if (wl > max_load) {
3425 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
3426 * so long as it is large enough.
3428 #define MAX_PINNED_INTERVAL 512
3431 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3432 * tasks if there is an imbalance.
3434 static int load_balance(int this_cpu, struct rq *this_rq,
3435 struct sched_domain *sd, enum cpu_idle_type idle,
3436 int *balance, cpumask_t *cpus)
3438 int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0;
3439 struct sched_group *group;
3440 unsigned long imbalance;
3442 unsigned long flags;
3447 * When power savings policy is enabled for the parent domain, idle
3448 * sibling can pick up load irrespective of busy siblings. In this case,
3449 * let the state of idle sibling percolate up as CPU_IDLE, instead of
3450 * portraying it as CPU_NOT_IDLE.
3452 if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER &&
3453 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3456 schedstat_inc(sd, lb_count[idle]);
3460 group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle,
3467 schedstat_inc(sd, lb_nobusyg[idle]);
3471 busiest = find_busiest_queue(group, idle, imbalance, cpus);
3473 schedstat_inc(sd, lb_nobusyq[idle]);
3477 BUG_ON(busiest == this_rq);
3479 schedstat_add(sd, lb_imbalance[idle], imbalance);
3482 if (busiest->nr_running > 1) {
3484 * Attempt to move tasks. If find_busiest_group has found
3485 * an imbalance but busiest->nr_running <= 1, the group is
3486 * still unbalanced. ld_moved simply stays zero, so it is
3487 * correctly treated as an imbalance.
3489 local_irq_save(flags);
3490 double_rq_lock(this_rq, busiest);
3491 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3492 imbalance, sd, idle, &all_pinned);
3493 double_rq_unlock(this_rq, busiest);
3494 local_irq_restore(flags);
3497 * some other cpu did the load balance for us.
3499 if (ld_moved && this_cpu != smp_processor_id())
3500 resched_cpu(this_cpu);
3502 /* All tasks on this runqueue were pinned by CPU affinity */
3503 if (unlikely(all_pinned)) {
3504 cpu_clear(cpu_of(busiest), *cpus);
3505 if (!cpus_empty(*cpus))
3512 schedstat_inc(sd, lb_failed[idle]);
3513 sd->nr_balance_failed++;
3515 if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) {
3517 spin_lock_irqsave(&busiest->lock, flags);
3519 /* don't kick the migration_thread, if the curr
3520 * task on busiest cpu can't be moved to this_cpu
3522 if (!cpu_isset(this_cpu, busiest->curr->cpus_allowed)) {
3523 spin_unlock_irqrestore(&busiest->lock, flags);
3525 goto out_one_pinned;
3528 if (!busiest->active_balance) {
3529 busiest->active_balance = 1;
3530 busiest->push_cpu = this_cpu;
3533 spin_unlock_irqrestore(&busiest->lock, flags);
3535 wake_up_process(busiest->migration_thread);
3538 * We've kicked active balancing, reset the failure
3541 sd->nr_balance_failed = sd->cache_nice_tries+1;
3544 sd->nr_balance_failed = 0;
3546 if (likely(!active_balance)) {
3547 /* We were unbalanced, so reset the balancing interval */
3548 sd->balance_interval = sd->min_interval;
3551 * If we've begun active balancing, start to back off. This
3552 * case may not be covered by the all_pinned logic if there
3553 * is only 1 task on the busy runqueue (because we don't call
3556 if (sd->balance_interval < sd->max_interval)
3557 sd->balance_interval *= 2;
3560 if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3561 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3567 schedstat_inc(sd, lb_balanced[idle]);
3569 sd->nr_balance_failed = 0;
3572 /* tune up the balancing interval */
3573 if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) ||
3574 (sd->balance_interval < sd->max_interval))
3575 sd->balance_interval *= 2;
3577 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3578 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3589 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3590 * tasks if there is an imbalance.
3592 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
3593 * this_rq is locked.
3596 load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd,
3599 struct sched_group *group;
3600 struct rq *busiest = NULL;
3601 unsigned long imbalance;
3609 * When power savings policy is enabled for the parent domain, idle
3610 * sibling can pick up load irrespective of busy siblings. In this case,
3611 * let the state of idle sibling percolate up as IDLE, instead of
3612 * portraying it as CPU_NOT_IDLE.
3614 if (sd->flags & SD_SHARE_CPUPOWER &&
3615 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3618 schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]);
3620 update_shares_locked(this_rq, sd);
3621 group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE,
3622 &sd_idle, cpus, NULL);
3624 schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]);
3628 busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus);
3630 schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]);
3634 BUG_ON(busiest == this_rq);
3636 schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance);
3639 if (busiest->nr_running > 1) {
3640 /* Attempt to move tasks */
3641 double_lock_balance(this_rq, busiest);
3642 /* this_rq->clock is already updated */
3643 update_rq_clock(busiest);
3644 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3645 imbalance, sd, CPU_NEWLY_IDLE,
3647 double_unlock_balance(this_rq, busiest);
3649 if (unlikely(all_pinned)) {
3650 cpu_clear(cpu_of(busiest), *cpus);
3651 if (!cpus_empty(*cpus))
3657 schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]);
3658 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3659 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3662 sd->nr_balance_failed = 0;
3664 update_shares_locked(this_rq, sd);
3668 schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]);
3669 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3670 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3672 sd->nr_balance_failed = 0;
3678 * idle_balance is called by schedule() if this_cpu is about to become
3679 * idle. Attempts to pull tasks from other CPUs.
3681 static void idle_balance(int this_cpu, struct rq *this_rq)
3683 struct sched_domain *sd;
3684 int pulled_task = -1;
3685 unsigned long next_balance = jiffies + HZ;
3688 for_each_domain(this_cpu, sd) {
3689 unsigned long interval;
3691 if (!(sd->flags & SD_LOAD_BALANCE))
3694 if (sd->flags & SD_BALANCE_NEWIDLE)
3695 /* If we've pulled tasks over stop searching: */
3696 pulled_task = load_balance_newidle(this_cpu, this_rq,
3699 interval = msecs_to_jiffies(sd->balance_interval);
3700 if (time_after(next_balance, sd->last_balance + interval))
3701 next_balance = sd->last_balance + interval;
3705 if (pulled_task || time_after(jiffies, this_rq->next_balance)) {
3707 * We are going idle. next_balance may be set based on
3708 * a busy processor. So reset next_balance.
3710 this_rq->next_balance = next_balance;
3715 * active_load_balance is run by migration threads. It pushes running tasks
3716 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
3717 * running on each physical CPU where possible, and avoids physical /
3718 * logical imbalances.
3720 * Called with busiest_rq locked.
3722 static void active_load_balance(struct rq *busiest_rq, int busiest_cpu)
3724 int target_cpu = busiest_rq->push_cpu;
3725 struct sched_domain *sd;
3726 struct rq *target_rq;
3728 /* Is there any task to move? */
3729 if (busiest_rq->nr_running <= 1)
3732 target_rq = cpu_rq(target_cpu);
3735 * This condition is "impossible", if it occurs
3736 * we need to fix it. Originally reported by
3737 * Bjorn Helgaas on a 128-cpu setup.
3739 BUG_ON(busiest_rq == target_rq);
3741 /* move a task from busiest_rq to target_rq */
3742 double_lock_balance(busiest_rq, target_rq);
3743 update_rq_clock(busiest_rq);
3744 update_rq_clock(target_rq);
3746 /* Search for an sd spanning us and the target CPU. */
3747 for_each_domain(target_cpu, sd) {
3748 if ((sd->flags & SD_LOAD_BALANCE) &&
3749 cpu_isset(busiest_cpu, sd->span))
3754 schedstat_inc(sd, alb_count);
3756 if (move_one_task(target_rq, target_cpu, busiest_rq,
3758 schedstat_inc(sd, alb_pushed);
3760 schedstat_inc(sd, alb_failed);
3762 double_unlock_balance(busiest_rq, target_rq);
3767 atomic_t load_balancer;
3769 } nohz ____cacheline_aligned = {
3770 .load_balancer = ATOMIC_INIT(-1),
3771 .cpu_mask = CPU_MASK_NONE,
3775 * This routine will try to nominate the ilb (idle load balancing)
3776 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
3777 * load balancing on behalf of all those cpus. If all the cpus in the system
3778 * go into this tickless mode, then there will be no ilb owner (as there is
3779 * no need for one) and all the cpus will sleep till the next wakeup event
3782 * For the ilb owner, tick is not stopped. And this tick will be used
3783 * for idle load balancing. ilb owner will still be part of
3786 * While stopping the tick, this cpu will become the ilb owner if there
3787 * is no other owner. And will be the owner till that cpu becomes busy
3788 * or if all cpus in the system stop their ticks at which point
3789 * there is no need for ilb owner.
3791 * When the ilb owner becomes busy, it nominates another owner, during the
3792 * next busy scheduler_tick()
3794 int select_nohz_load_balancer(int stop_tick)
3796 int cpu = smp_processor_id();
3799 cpu_set(cpu, nohz.cpu_mask);
3800 cpu_rq(cpu)->in_nohz_recently = 1;
3803 * If we are going offline and still the leader, give up!
3805 if (!cpu_active(cpu) &&
3806 atomic_read(&nohz.load_balancer) == cpu) {
3807 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
3812 /* time for ilb owner also to sleep */
3813 if (cpus_weight(nohz.cpu_mask) == num_online_cpus()) {
3814 if (atomic_read(&nohz.load_balancer) == cpu)
3815 atomic_set(&nohz.load_balancer, -1);
3819 if (atomic_read(&nohz.load_balancer) == -1) {
3820 /* make me the ilb owner */
3821 if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1)
3823 } else if (atomic_read(&nohz.load_balancer) == cpu)
3826 if (!cpu_isset(cpu, nohz.cpu_mask))
3829 cpu_clear(cpu, nohz.cpu_mask);
3831 if (atomic_read(&nohz.load_balancer) == cpu)
3832 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
3839 static DEFINE_SPINLOCK(balancing);
3842 * It checks each scheduling domain to see if it is due to be balanced,
3843 * and initiates a balancing operation if so.
3845 * Balancing parameters are set up in arch_init_sched_domains.
3847 static void rebalance_domains(int cpu, enum cpu_idle_type idle)
3850 struct rq *rq = cpu_rq(cpu);
3851 unsigned long interval;
3852 struct sched_domain *sd;
3853 /* Earliest time when we have to do rebalance again */
3854 unsigned long next_balance = jiffies + 60*HZ;
3855 int update_next_balance = 0;
3859 for_each_domain(cpu, sd) {
3860 if (!(sd->flags & SD_LOAD_BALANCE))
3863 interval = sd->balance_interval;
3864 if (idle != CPU_IDLE)
3865 interval *= sd->busy_factor;
3867 /* scale ms to jiffies */
3868 interval = msecs_to_jiffies(interval);
3869 if (unlikely(!interval))
3871 if (interval > HZ*NR_CPUS/10)
3872 interval = HZ*NR_CPUS/10;
3874 need_serialize = sd->flags & SD_SERIALIZE;
3876 if (need_serialize) {
3877 if (!spin_trylock(&balancing))
3881 if (time_after_eq(jiffies, sd->last_balance + interval)) {
3882 if (load_balance(cpu, rq, sd, idle, &balance, &tmp)) {
3884 * We've pulled tasks over so either we're no
3885 * longer idle, or one of our SMT siblings is
3888 idle = CPU_NOT_IDLE;
3890 sd->last_balance = jiffies;
3893 spin_unlock(&balancing);
3895 if (time_after(next_balance, sd->last_balance + interval)) {
3896 next_balance = sd->last_balance + interval;
3897 update_next_balance = 1;
3901 * Stop the load balance at this level. There is another
3902 * CPU in our sched group which is doing load balancing more
3910 * next_balance will be updated only when there is a need.
3911 * When the cpu is attached to null domain for ex, it will not be
3914 if (likely(update_next_balance))
3915 rq->next_balance = next_balance;
3919 * run_rebalance_domains is triggered when needed from the scheduler tick.
3920 * In CONFIG_NO_HZ case, the idle load balance owner will do the
3921 * rebalancing for all the cpus for whom scheduler ticks are stopped.
3923 static void run_rebalance_domains(struct softirq_action *h)
3925 int this_cpu = smp_processor_id();
3926 struct rq *this_rq = cpu_rq(this_cpu);
3927 enum cpu_idle_type idle = this_rq->idle_at_tick ?
3928 CPU_IDLE : CPU_NOT_IDLE;
3930 rebalance_domains(this_cpu, idle);
3934 * If this cpu is the owner for idle load balancing, then do the
3935 * balancing on behalf of the other idle cpus whose ticks are
3938 if (this_rq->idle_at_tick &&
3939 atomic_read(&nohz.load_balancer) == this_cpu) {
3940 cpumask_t cpus = nohz.cpu_mask;
3944 cpu_clear(this_cpu, cpus);
3945 for_each_cpu_mask_nr(balance_cpu, cpus) {
3947 * If this cpu gets work to do, stop the load balancing
3948 * work being done for other cpus. Next load
3949 * balancing owner will pick it up.
3954 rebalance_domains(balance_cpu, CPU_IDLE);
3956 rq = cpu_rq(balance_cpu);
3957 if (time_after(this_rq->next_balance, rq->next_balance))
3958 this_rq->next_balance = rq->next_balance;
3965 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
3967 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
3968 * idle load balancing owner or decide to stop the periodic load balancing,
3969 * if the whole system is idle.
3971 static inline void trigger_load_balance(struct rq *rq, int cpu)
3975 * If we were in the nohz mode recently and busy at the current
3976 * scheduler tick, then check if we need to nominate new idle
3979 if (rq->in_nohz_recently && !rq->idle_at_tick) {
3980 rq->in_nohz_recently = 0;
3982 if (atomic_read(&nohz.load_balancer) == cpu) {
3983 cpu_clear(cpu, nohz.cpu_mask);
3984 atomic_set(&nohz.load_balancer, -1);
3987 if (atomic_read(&nohz.load_balancer) == -1) {
3989 * simple selection for now: Nominate the
3990 * first cpu in the nohz list to be the next
3993 * TBD: Traverse the sched domains and nominate
3994 * the nearest cpu in the nohz.cpu_mask.
3996 int ilb = first_cpu(nohz.cpu_mask);
3998 if (ilb < nr_cpu_ids)
4004 * If this cpu is idle and doing idle load balancing for all the
4005 * cpus with ticks stopped, is it time for that to stop?
4007 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu &&
4008 cpus_weight(nohz.cpu_mask) == num_online_cpus()) {
4014 * If this cpu is idle and the idle load balancing is done by
4015 * someone else, then no need raise the SCHED_SOFTIRQ
4017 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu &&
4018 cpu_isset(cpu, nohz.cpu_mask))
4021 if (time_after_eq(jiffies, rq->next_balance))
4022 raise_softirq(SCHED_SOFTIRQ);
4025 #else /* CONFIG_SMP */
4028 * on UP we do not need to balance between CPUs:
4030 static inline void idle_balance(int cpu, struct rq *rq)
4036 DEFINE_PER_CPU(struct kernel_stat, kstat);
4038 EXPORT_PER_CPU_SYMBOL(kstat);
4041 * Return any ns on the sched_clock that have not yet been banked in
4042 * @p in case that task is currently running.
4044 unsigned long long task_delta_exec(struct task_struct *p)
4046 unsigned long flags;
4050 rq = task_rq_lock(p, &flags);
4052 if (task_current(rq, p)) {
4055 update_rq_clock(rq);
4056 delta_exec = rq->clock - p->se.exec_start;
4057 if ((s64)delta_exec > 0)
4061 task_rq_unlock(rq, &flags);
4067 * Account user cpu time to a process.
4068 * @p: the process that the cpu time gets accounted to
4069 * @cputime: the cpu time spent in user space since the last update
4071 void account_user_time(struct task_struct *p, cputime_t cputime)
4073 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4076 p->utime = cputime_add(p->utime, cputime);
4077 account_group_user_time(p, cputime);
4079 /* Add user time to cpustat. */
4080 tmp = cputime_to_cputime64(cputime);
4081 if (TASK_NICE(p) > 0)
4082 cpustat->nice = cputime64_add(cpustat->nice, tmp);
4084 cpustat->user = cputime64_add(cpustat->user, tmp);
4085 /* Account for user time used */
4086 acct_update_integrals(p);
4090 * Account guest cpu time to a process.
4091 * @p: the process that the cpu time gets accounted to
4092 * @cputime: the cpu time spent in virtual machine since the last update
4094 static void account_guest_time(struct task_struct *p, cputime_t cputime)
4097 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4099 tmp = cputime_to_cputime64(cputime);
4101 p->utime = cputime_add(p->utime, cputime);
4102 account_group_user_time(p, cputime);
4103 p->gtime = cputime_add(p->gtime, cputime);
4105 cpustat->user = cputime64_add(cpustat->user, tmp);
4106 cpustat->guest = cputime64_add(cpustat->guest, tmp);
4110 * Account scaled user cpu time to a process.
4111 * @p: the process that the cpu time gets accounted to
4112 * @cputime: the cpu time spent in user space since the last update
4114 void account_user_time_scaled(struct task_struct *p, cputime_t cputime)
4116 p->utimescaled = cputime_add(p->utimescaled, cputime);
4120 * Account system cpu time to a process.
4121 * @p: the process that the cpu time gets accounted to
4122 * @hardirq_offset: the offset to subtract from hardirq_count()
4123 * @cputime: the cpu time spent in kernel space since the last update
4125 void account_system_time(struct task_struct *p, int hardirq_offset,
4128 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4129 struct rq *rq = this_rq();
4132 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
4133 account_guest_time(p, cputime);
4137 p->stime = cputime_add(p->stime, cputime);
4138 account_group_system_time(p, cputime);
4140 /* Add system time to cpustat. */
4141 tmp = cputime_to_cputime64(cputime);
4142 if (hardirq_count() - hardirq_offset)
4143 cpustat->irq = cputime64_add(cpustat->irq, tmp);
4144 else if (softirq_count())
4145 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
4146 else if (p != rq->idle)
4147 cpustat->system = cputime64_add(cpustat->system, tmp);
4148 else if (atomic_read(&rq->nr_iowait) > 0)
4149 cpustat->iowait = cputime64_add(cpustat->iowait, tmp);
4151 cpustat->idle = cputime64_add(cpustat->idle, tmp);
4152 /* Account for system time used */
4153 acct_update_integrals(p);
4157 * Account scaled system cpu time to a process.
4158 * @p: the process that the cpu time gets accounted to
4159 * @hardirq_offset: the offset to subtract from hardirq_count()
4160 * @cputime: the cpu time spent in kernel space since the last update
4162 void account_system_time_scaled(struct task_struct *p, cputime_t cputime)
4164 p->stimescaled = cputime_add(p->stimescaled, cputime);
4168 * Account for involuntary wait time.
4169 * @p: the process from which the cpu time has been stolen
4170 * @steal: the cpu time spent in involuntary wait
4172 void account_steal_time(struct task_struct *p, cputime_t steal)
4174 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4175 cputime64_t tmp = cputime_to_cputime64(steal);
4176 struct rq *rq = this_rq();
4178 if (p == rq->idle) {
4179 p->stime = cputime_add(p->stime, steal);
4180 if (atomic_read(&rq->nr_iowait) > 0)
4181 cpustat->iowait = cputime64_add(cpustat->iowait, tmp);
4183 cpustat->idle = cputime64_add(cpustat->idle, tmp);
4185 cpustat->steal = cputime64_add(cpustat->steal, tmp);
4189 * Use precise platform statistics if available:
4191 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
4192 cputime_t task_utime(struct task_struct *p)
4197 cputime_t task_stime(struct task_struct *p)
4202 cputime_t task_utime(struct task_struct *p)
4204 clock_t utime = cputime_to_clock_t(p->utime),
4205 total = utime + cputime_to_clock_t(p->stime);
4209 * Use CFS's precise accounting:
4211 temp = (u64)nsec_to_clock_t(p->se.sum_exec_runtime);
4215 do_div(temp, total);
4217 utime = (clock_t)temp;
4219 p->prev_utime = max(p->prev_utime, clock_t_to_cputime(utime));
4220 return p->prev_utime;
4223 cputime_t task_stime(struct task_struct *p)
4228 * Use CFS's precise accounting. (we subtract utime from
4229 * the total, to make sure the total observed by userspace
4230 * grows monotonically - apps rely on that):
4232 stime = nsec_to_clock_t(p->se.sum_exec_runtime) -
4233 cputime_to_clock_t(task_utime(p));
4236 p->prev_stime = max(p->prev_stime, clock_t_to_cputime(stime));
4238 return p->prev_stime;
4242 inline cputime_t task_gtime(struct task_struct *p)
4248 * This function gets called by the timer code, with HZ frequency.
4249 * We call it with interrupts disabled.
4251 * It also gets called by the fork code, when changing the parent's
4254 void scheduler_tick(void)
4256 int cpu = smp_processor_id();
4257 struct rq *rq = cpu_rq(cpu);
4258 struct task_struct *curr = rq->curr;
4262 spin_lock(&rq->lock);
4263 update_rq_clock(rq);
4264 update_cpu_load(rq);
4265 curr->sched_class->task_tick(rq, curr, 0);
4266 spin_unlock(&rq->lock);
4269 rq->idle_at_tick = idle_cpu(cpu);
4270 trigger_load_balance(rq, cpu);
4274 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
4275 defined(CONFIG_PREEMPT_TRACER))
4277 static inline unsigned long get_parent_ip(unsigned long addr)
4279 if (in_lock_functions(addr)) {
4280 addr = CALLER_ADDR2;
4281 if (in_lock_functions(addr))
4282 addr = CALLER_ADDR3;
4287 void __kprobes add_preempt_count(int val)
4289 #ifdef CONFIG_DEBUG_PREEMPT
4293 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
4296 preempt_count() += val;
4297 #ifdef CONFIG_DEBUG_PREEMPT
4299 * Spinlock count overflowing soon?
4301 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
4304 if (preempt_count() == val)
4305 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4307 EXPORT_SYMBOL(add_preempt_count);
4309 void __kprobes sub_preempt_count(int val)
4311 #ifdef CONFIG_DEBUG_PREEMPT
4315 if (DEBUG_LOCKS_WARN_ON(val > preempt_count() - (!!kernel_locked())))
4318 * Is the spinlock portion underflowing?
4320 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
4321 !(preempt_count() & PREEMPT_MASK)))
4325 if (preempt_count() == val)
4326 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4327 preempt_count() -= val;
4329 EXPORT_SYMBOL(sub_preempt_count);
4334 * Print scheduling while atomic bug:
4336 static noinline void __schedule_bug(struct task_struct *prev)
4338 struct pt_regs *regs = get_irq_regs();
4340 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
4341 prev->comm, prev->pid, preempt_count());
4343 debug_show_held_locks(prev);
4345 if (irqs_disabled())
4346 print_irqtrace_events(prev);
4355 * Various schedule()-time debugging checks and statistics:
4357 static inline void schedule_debug(struct task_struct *prev)
4360 * Test if we are atomic. Since do_exit() needs to call into
4361 * schedule() atomically, we ignore that path for now.
4362 * Otherwise, whine if we are scheduling when we should not be.
4364 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
4365 __schedule_bug(prev);
4367 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
4369 schedstat_inc(this_rq(), sched_count);
4370 #ifdef CONFIG_SCHEDSTATS
4371 if (unlikely(prev->lock_depth >= 0)) {
4372 schedstat_inc(this_rq(), bkl_count);
4373 schedstat_inc(prev, sched_info.bkl_count);
4379 * Pick up the highest-prio task:
4381 static inline struct task_struct *
4382 pick_next_task(struct rq *rq, struct task_struct *prev)
4384 const struct sched_class *class;
4385 struct task_struct *p;
4388 * Optimization: we know that if all tasks are in
4389 * the fair class we can call that function directly:
4391 if (likely(rq->nr_running == rq->cfs.nr_running)) {
4392 p = fair_sched_class.pick_next_task(rq);
4397 class = sched_class_highest;
4399 p = class->pick_next_task(rq);
4403 * Will never be NULL as the idle class always
4404 * returns a non-NULL p:
4406 class = class->next;
4411 * schedule() is the main scheduler function.
4413 asmlinkage void __sched schedule(void)
4415 struct task_struct *prev, *next;
4416 unsigned long *switch_count;
4422 cpu = smp_processor_id();
4426 switch_count = &prev->nivcsw;
4428 release_kernel_lock(prev);
4429 need_resched_nonpreemptible:
4431 schedule_debug(prev);
4433 if (sched_feat(HRTICK))
4436 spin_lock_irq(&rq->lock);
4437 update_rq_clock(rq);
4438 clear_tsk_need_resched(prev);
4440 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
4441 if (unlikely(signal_pending_state(prev->state, prev)))
4442 prev->state = TASK_RUNNING;
4444 deactivate_task(rq, prev, 1);
4445 switch_count = &prev->nvcsw;
4449 if (prev->sched_class->pre_schedule)
4450 prev->sched_class->pre_schedule(rq, prev);
4453 if (unlikely(!rq->nr_running))
4454 idle_balance(cpu, rq);
4456 prev->sched_class->put_prev_task(rq, prev);
4457 next = pick_next_task(rq, prev);
4459 if (likely(prev != next)) {
4460 sched_info_switch(prev, next);
4466 context_switch(rq, prev, next); /* unlocks the rq */
4468 * the context switch might have flipped the stack from under
4469 * us, hence refresh the local variables.
4471 cpu = smp_processor_id();
4474 spin_unlock_irq(&rq->lock);
4476 if (unlikely(reacquire_kernel_lock(current) < 0))
4477 goto need_resched_nonpreemptible;
4479 preempt_enable_no_resched();
4480 if (unlikely(test_thread_flag(TIF_NEED_RESCHED)))
4483 EXPORT_SYMBOL(schedule);
4485 #ifdef CONFIG_PREEMPT
4487 * this is the entry point to schedule() from in-kernel preemption
4488 * off of preempt_enable. Kernel preemptions off return from interrupt
4489 * occur there and call schedule directly.
4491 asmlinkage void __sched preempt_schedule(void)
4493 struct thread_info *ti = current_thread_info();
4496 * If there is a non-zero preempt_count or interrupts are disabled,
4497 * we do not want to preempt the current task. Just return..
4499 if (likely(ti->preempt_count || irqs_disabled()))
4503 add_preempt_count(PREEMPT_ACTIVE);
4505 sub_preempt_count(PREEMPT_ACTIVE);
4508 * Check again in case we missed a preemption opportunity
4509 * between schedule and now.
4512 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED)));
4514 EXPORT_SYMBOL(preempt_schedule);
4517 * this is the entry point to schedule() from kernel preemption
4518 * off of irq context.
4519 * Note, that this is called and return with irqs disabled. This will
4520 * protect us against recursive calling from irq.
4522 asmlinkage void __sched preempt_schedule_irq(void)
4524 struct thread_info *ti = current_thread_info();
4526 /* Catch callers which need to be fixed */
4527 BUG_ON(ti->preempt_count || !irqs_disabled());
4530 add_preempt_count(PREEMPT_ACTIVE);
4533 local_irq_disable();
4534 sub_preempt_count(PREEMPT_ACTIVE);
4537 * Check again in case we missed a preemption opportunity
4538 * between schedule and now.
4541 } while (unlikely(test_thread_flag(TIF_NEED_RESCHED)));
4544 #endif /* CONFIG_PREEMPT */
4546 int default_wake_function(wait_queue_t *curr, unsigned mode, int sync,
4549 return try_to_wake_up(curr->private, mode, sync);
4551 EXPORT_SYMBOL(default_wake_function);
4554 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
4555 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
4556 * number) then we wake all the non-exclusive tasks and one exclusive task.
4558 * There are circumstances in which we can try to wake a task which has already
4559 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
4560 * zero in this (rare) case, and we handle it by continuing to scan the queue.
4562 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
4563 int nr_exclusive, int sync, void *key)
4565 wait_queue_t *curr, *next;
4567 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
4568 unsigned flags = curr->flags;
4570 if (curr->func(curr, mode, sync, key) &&
4571 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
4577 * __wake_up - wake up threads blocked on a waitqueue.
4579 * @mode: which threads
4580 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4581 * @key: is directly passed to the wakeup function
4583 void __wake_up(wait_queue_head_t *q, unsigned int mode,
4584 int nr_exclusive, void *key)
4586 unsigned long flags;
4588 spin_lock_irqsave(&q->lock, flags);
4589 __wake_up_common(q, mode, nr_exclusive, 0, key);
4590 spin_unlock_irqrestore(&q->lock, flags);
4592 EXPORT_SYMBOL(__wake_up);
4595 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
4597 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
4599 __wake_up_common(q, mode, 1, 0, NULL);
4603 * __wake_up_sync - wake up threads blocked on a waitqueue.
4605 * @mode: which threads
4606 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4608 * The sync wakeup differs that the waker knows that it will schedule
4609 * away soon, so while the target thread will be woken up, it will not
4610 * be migrated to another CPU - ie. the two threads are 'synchronized'
4611 * with each other. This can prevent needless bouncing between CPUs.
4613 * On UP it can prevent extra preemption.
4616 __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
4618 unsigned long flags;
4624 if (unlikely(!nr_exclusive))
4627 spin_lock_irqsave(&q->lock, flags);
4628 __wake_up_common(q, mode, nr_exclusive, sync, NULL);
4629 spin_unlock_irqrestore(&q->lock, flags);
4631 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
4634 * complete: - signals a single thread waiting on this completion
4635 * @x: holds the state of this particular completion
4637 * This will wake up a single thread waiting on this completion. Threads will be
4638 * awakened in the same order in which they were queued.
4640 * See also complete_all(), wait_for_completion() and related routines.
4642 void complete(struct completion *x)
4644 unsigned long flags;
4646 spin_lock_irqsave(&x->wait.lock, flags);
4648 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
4649 spin_unlock_irqrestore(&x->wait.lock, flags);
4651 EXPORT_SYMBOL(complete);
4654 * complete_all: - signals all threads waiting on this completion
4655 * @x: holds the state of this particular completion
4657 * This will wake up all threads waiting on this particular completion event.
4659 void complete_all(struct completion *x)
4661 unsigned long flags;
4663 spin_lock_irqsave(&x->wait.lock, flags);
4664 x->done += UINT_MAX/2;
4665 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
4666 spin_unlock_irqrestore(&x->wait.lock, flags);
4668 EXPORT_SYMBOL(complete_all);
4670 static inline long __sched
4671 do_wait_for_common(struct completion *x, long timeout, int state)
4674 DECLARE_WAITQUEUE(wait, current);
4676 wait.flags |= WQ_FLAG_EXCLUSIVE;
4677 __add_wait_queue_tail(&x->wait, &wait);
4679 if (signal_pending_state(state, current)) {
4680 timeout = -ERESTARTSYS;
4683 __set_current_state(state);
4684 spin_unlock_irq(&x->wait.lock);
4685 timeout = schedule_timeout(timeout);
4686 spin_lock_irq(&x->wait.lock);
4687 } while (!x->done && timeout);
4688 __remove_wait_queue(&x->wait, &wait);
4693 return timeout ?: 1;
4697 wait_for_common(struct completion *x, long timeout, int state)
4701 spin_lock_irq(&x->wait.lock);
4702 timeout = do_wait_for_common(x, timeout, state);
4703 spin_unlock_irq(&x->wait.lock);
4708 * wait_for_completion: - waits for completion of a task
4709 * @x: holds the state of this particular completion
4711 * This waits to be signaled for completion of a specific task. It is NOT
4712 * interruptible and there is no timeout.
4714 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
4715 * and interrupt capability. Also see complete().
4717 void __sched wait_for_completion(struct completion *x)
4719 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
4721 EXPORT_SYMBOL(wait_for_completion);
4724 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
4725 * @x: holds the state of this particular completion
4726 * @timeout: timeout value in jiffies
4728 * This waits for either a completion of a specific task to be signaled or for a
4729 * specified timeout to expire. The timeout is in jiffies. It is not
4732 unsigned long __sched
4733 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
4735 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
4737 EXPORT_SYMBOL(wait_for_completion_timeout);
4740 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
4741 * @x: holds the state of this particular completion
4743 * This waits for completion of a specific task to be signaled. It is
4746 int __sched wait_for_completion_interruptible(struct completion *x)
4748 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
4749 if (t == -ERESTARTSYS)
4753 EXPORT_SYMBOL(wait_for_completion_interruptible);
4756 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
4757 * @x: holds the state of this particular completion
4758 * @timeout: timeout value in jiffies
4760 * This waits for either a completion of a specific task to be signaled or for a
4761 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
4763 unsigned long __sched
4764 wait_for_completion_interruptible_timeout(struct completion *x,
4765 unsigned long timeout)
4767 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
4769 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
4772 * wait_for_completion_killable: - waits for completion of a task (killable)
4773 * @x: holds the state of this particular completion
4775 * This waits to be signaled for completion of a specific task. It can be
4776 * interrupted by a kill signal.
4778 int __sched wait_for_completion_killable(struct completion *x)
4780 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
4781 if (t == -ERESTARTSYS)
4785 EXPORT_SYMBOL(wait_for_completion_killable);
4788 * try_wait_for_completion - try to decrement a completion without blocking
4789 * @x: completion structure
4791 * Returns: 0 if a decrement cannot be done without blocking
4792 * 1 if a decrement succeeded.
4794 * If a completion is being used as a counting completion,
4795 * attempt to decrement the counter without blocking. This
4796 * enables us to avoid waiting if the resource the completion
4797 * is protecting is not available.
4799 bool try_wait_for_completion(struct completion *x)
4803 spin_lock_irq(&x->wait.lock);
4808 spin_unlock_irq(&x->wait.lock);
4811 EXPORT_SYMBOL(try_wait_for_completion);
4814 * completion_done - Test to see if a completion has any waiters
4815 * @x: completion structure
4817 * Returns: 0 if there are waiters (wait_for_completion() in progress)
4818 * 1 if there are no waiters.
4821 bool completion_done(struct completion *x)
4825 spin_lock_irq(&x->wait.lock);
4828 spin_unlock_irq(&x->wait.lock);
4831 EXPORT_SYMBOL(completion_done);
4834 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
4836 unsigned long flags;
4839 init_waitqueue_entry(&wait, current);
4841 __set_current_state(state);
4843 spin_lock_irqsave(&q->lock, flags);
4844 __add_wait_queue(q, &wait);
4845 spin_unlock(&q->lock);
4846 timeout = schedule_timeout(timeout);
4847 spin_lock_irq(&q->lock);
4848 __remove_wait_queue(q, &wait);
4849 spin_unlock_irqrestore(&q->lock, flags);
4854 void __sched interruptible_sleep_on(wait_queue_head_t *q)
4856 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4858 EXPORT_SYMBOL(interruptible_sleep_on);
4861 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
4863 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
4865 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
4867 void __sched sleep_on(wait_queue_head_t *q)
4869 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4871 EXPORT_SYMBOL(sleep_on);
4873 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
4875 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
4877 EXPORT_SYMBOL(sleep_on_timeout);
4879 #ifdef CONFIG_RT_MUTEXES
4882 * rt_mutex_setprio - set the current priority of a task
4884 * @prio: prio value (kernel-internal form)
4886 * This function changes the 'effective' priority of a task. It does
4887 * not touch ->normal_prio like __setscheduler().
4889 * Used by the rt_mutex code to implement priority inheritance logic.
4891 void rt_mutex_setprio(struct task_struct *p, int prio)
4893 unsigned long flags;
4894 int oldprio, on_rq, running;
4896 const struct sched_class *prev_class = p->sched_class;
4898 BUG_ON(prio < 0 || prio > MAX_PRIO);
4900 rq = task_rq_lock(p, &flags);
4901 update_rq_clock(rq);
4904 on_rq = p->se.on_rq;
4905 running = task_current(rq, p);
4907 dequeue_task(rq, p, 0);
4909 p->sched_class->put_prev_task(rq, p);
4912 p->sched_class = &rt_sched_class;
4914 p->sched_class = &fair_sched_class;
4919 p->sched_class->set_curr_task(rq);
4921 enqueue_task(rq, p, 0);
4923 check_class_changed(rq, p, prev_class, oldprio, running);
4925 task_rq_unlock(rq, &flags);
4930 void set_user_nice(struct task_struct *p, long nice)
4932 int old_prio, delta, on_rq;
4933 unsigned long flags;
4936 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
4939 * We have to be careful, if called from sys_setpriority(),
4940 * the task might be in the middle of scheduling on another CPU.
4942 rq = task_rq_lock(p, &flags);
4943 update_rq_clock(rq);
4945 * The RT priorities are set via sched_setscheduler(), but we still
4946 * allow the 'normal' nice value to be set - but as expected
4947 * it wont have any effect on scheduling until the task is
4948 * SCHED_FIFO/SCHED_RR:
4950 if (task_has_rt_policy(p)) {
4951 p->static_prio = NICE_TO_PRIO(nice);
4954 on_rq = p->se.on_rq;
4956 dequeue_task(rq, p, 0);
4958 p->static_prio = NICE_TO_PRIO(nice);
4961 p->prio = effective_prio(p);
4962 delta = p->prio - old_prio;
4965 enqueue_task(rq, p, 0);
4967 * If the task increased its priority or is running and
4968 * lowered its priority, then reschedule its CPU:
4970 if (delta < 0 || (delta > 0 && task_running(rq, p)))
4971 resched_task(rq->curr);
4974 task_rq_unlock(rq, &flags);
4976 EXPORT_SYMBOL(set_user_nice);
4979 * can_nice - check if a task can reduce its nice value
4983 int can_nice(const struct task_struct *p, const int nice)
4985 /* convert nice value [19,-20] to rlimit style value [1,40] */
4986 int nice_rlim = 20 - nice;
4988 return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur ||
4989 capable(CAP_SYS_NICE));
4992 #ifdef __ARCH_WANT_SYS_NICE
4995 * sys_nice - change the priority of the current process.
4996 * @increment: priority increment
4998 * sys_setpriority is a more generic, but much slower function that
4999 * does similar things.
5001 asmlinkage long sys_nice(int increment)
5006 * Setpriority might change our priority at the same moment.
5007 * We don't have to worry. Conceptually one call occurs first
5008 * and we have a single winner.
5010 if (increment < -40)
5015 nice = PRIO_TO_NICE(current->static_prio) + increment;
5021 if (increment < 0 && !can_nice(current, nice))
5024 retval = security_task_setnice(current, nice);
5028 set_user_nice(current, nice);
5035 * task_prio - return the priority value of a given task.
5036 * @p: the task in question.
5038 * This is the priority value as seen by users in /proc.
5039 * RT tasks are offset by -200. Normal tasks are centered
5040 * around 0, value goes from -16 to +15.
5042 int task_prio(const struct task_struct *p)
5044 return p->prio - MAX_RT_PRIO;
5048 * task_nice - return the nice value of a given task.
5049 * @p: the task in question.
5051 int task_nice(const struct task_struct *p)
5053 return TASK_NICE(p);
5055 EXPORT_SYMBOL(task_nice);
5058 * idle_cpu - is a given cpu idle currently?
5059 * @cpu: the processor in question.
5061 int idle_cpu(int cpu)
5063 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
5067 * idle_task - return the idle task for a given cpu.
5068 * @cpu: the processor in question.
5070 struct task_struct *idle_task(int cpu)
5072 return cpu_rq(cpu)->idle;
5076 * find_process_by_pid - find a process with a matching PID value.
5077 * @pid: the pid in question.
5079 static struct task_struct *find_process_by_pid(pid_t pid)
5081 return pid ? find_task_by_vpid(pid) : current;
5084 /* Actually do priority change: must hold rq lock. */
5086 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
5088 BUG_ON(p->se.on_rq);
5091 switch (p->policy) {
5095 p->sched_class = &fair_sched_class;
5099 p->sched_class = &rt_sched_class;
5103 p->rt_priority = prio;
5104 p->normal_prio = normal_prio(p);
5105 /* we are holding p->pi_lock already */
5106 p->prio = rt_mutex_getprio(p);
5110 static int __sched_setscheduler(struct task_struct *p, int policy,
5111 struct sched_param *param, bool user)
5113 int retval, oldprio, oldpolicy = -1, on_rq, running;
5114 unsigned long flags;
5115 const struct sched_class *prev_class = p->sched_class;
5118 /* may grab non-irq protected spin_locks */
5119 BUG_ON(in_interrupt());
5121 /* double check policy once rq lock held */
5123 policy = oldpolicy = p->policy;
5124 else if (policy != SCHED_FIFO && policy != SCHED_RR &&
5125 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
5126 policy != SCHED_IDLE)
5129 * Valid priorities for SCHED_FIFO and SCHED_RR are
5130 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
5131 * SCHED_BATCH and SCHED_IDLE is 0.
5133 if (param->sched_priority < 0 ||
5134 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
5135 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
5137 if (rt_policy(policy) != (param->sched_priority != 0))
5141 * Allow unprivileged RT tasks to decrease priority:
5143 if (user && !capable(CAP_SYS_NICE)) {
5144 if (rt_policy(policy)) {
5145 unsigned long rlim_rtprio;
5147 if (!lock_task_sighand(p, &flags))
5149 rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur;
5150 unlock_task_sighand(p, &flags);
5152 /* can't set/change the rt policy */
5153 if (policy != p->policy && !rlim_rtprio)
5156 /* can't increase priority */
5157 if (param->sched_priority > p->rt_priority &&
5158 param->sched_priority > rlim_rtprio)
5162 * Like positive nice levels, dont allow tasks to
5163 * move out of SCHED_IDLE either:
5165 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
5168 /* can't change other user's priorities */
5169 if ((current->euid != p->euid) &&
5170 (current->euid != p->uid))
5175 #ifdef CONFIG_RT_GROUP_SCHED
5177 * Do not allow realtime tasks into groups that have no runtime
5180 if (rt_bandwidth_enabled() && rt_policy(policy) &&
5181 task_group(p)->rt_bandwidth.rt_runtime == 0)
5185 retval = security_task_setscheduler(p, policy, param);
5191 * make sure no PI-waiters arrive (or leave) while we are
5192 * changing the priority of the task:
5194 spin_lock_irqsave(&p->pi_lock, flags);
5196 * To be able to change p->policy safely, the apropriate
5197 * runqueue lock must be held.
5199 rq = __task_rq_lock(p);
5200 /* recheck policy now with rq lock held */
5201 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
5202 policy = oldpolicy = -1;
5203 __task_rq_unlock(rq);
5204 spin_unlock_irqrestore(&p->pi_lock, flags);
5207 update_rq_clock(rq);
5208 on_rq = p->se.on_rq;
5209 running = task_current(rq, p);
5211 deactivate_task(rq, p, 0);
5213 p->sched_class->put_prev_task(rq, p);
5216 __setscheduler(rq, p, policy, param->sched_priority);
5219 p->sched_class->set_curr_task(rq);
5221 activate_task(rq, p, 0);
5223 check_class_changed(rq, p, prev_class, oldprio, running);
5225 __task_rq_unlock(rq);
5226 spin_unlock_irqrestore(&p->pi_lock, flags);
5228 rt_mutex_adjust_pi(p);
5234 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
5235 * @p: the task in question.
5236 * @policy: new policy.
5237 * @param: structure containing the new RT priority.
5239 * NOTE that the task may be already dead.
5241 int sched_setscheduler(struct task_struct *p, int policy,
5242 struct sched_param *param)
5244 return __sched_setscheduler(p, policy, param, true);
5246 EXPORT_SYMBOL_GPL(sched_setscheduler);
5249 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
5250 * @p: the task in question.
5251 * @policy: new policy.
5252 * @param: structure containing the new RT priority.
5254 * Just like sched_setscheduler, only don't bother checking if the
5255 * current context has permission. For example, this is needed in
5256 * stop_machine(): we create temporary high priority worker threads,
5257 * but our caller might not have that capability.
5259 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
5260 struct sched_param *param)
5262 return __sched_setscheduler(p, policy, param, false);
5266 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
5268 struct sched_param lparam;
5269 struct task_struct *p;
5272 if (!param || pid < 0)
5274 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
5279 p = find_process_by_pid(pid);
5281 retval = sched_setscheduler(p, policy, &lparam);
5288 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
5289 * @pid: the pid in question.
5290 * @policy: new policy.
5291 * @param: structure containing the new RT priority.
5294 sys_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
5296 /* negative values for policy are not valid */
5300 return do_sched_setscheduler(pid, policy, param);
5304 * sys_sched_setparam - set/change the RT priority of a thread
5305 * @pid: the pid in question.
5306 * @param: structure containing the new RT priority.
5308 asmlinkage long sys_sched_setparam(pid_t pid, struct sched_param __user *param)
5310 return do_sched_setscheduler(pid, -1, param);
5314 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
5315 * @pid: the pid in question.
5317 asmlinkage long sys_sched_getscheduler(pid_t pid)
5319 struct task_struct *p;
5326 read_lock(&tasklist_lock);
5327 p = find_process_by_pid(pid);
5329 retval = security_task_getscheduler(p);
5333 read_unlock(&tasklist_lock);
5338 * sys_sched_getscheduler - get the RT priority of a thread
5339 * @pid: the pid in question.
5340 * @param: structure containing the RT priority.
5342 asmlinkage long sys_sched_getparam(pid_t pid, struct sched_param __user *param)
5344 struct sched_param lp;
5345 struct task_struct *p;
5348 if (!param || pid < 0)
5351 read_lock(&tasklist_lock);
5352 p = find_process_by_pid(pid);
5357 retval = security_task_getscheduler(p);
5361 lp.sched_priority = p->rt_priority;
5362 read_unlock(&tasklist_lock);
5365 * This one might sleep, we cannot do it with a spinlock held ...
5367 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
5372 read_unlock(&tasklist_lock);
5376 long sched_setaffinity(pid_t pid, const cpumask_t *in_mask)
5378 cpumask_t cpus_allowed;
5379 cpumask_t new_mask = *in_mask;
5380 struct task_struct *p;
5384 read_lock(&tasklist_lock);
5386 p = find_process_by_pid(pid);
5388 read_unlock(&tasklist_lock);
5394 * It is not safe to call set_cpus_allowed with the
5395 * tasklist_lock held. We will bump the task_struct's
5396 * usage count and then drop tasklist_lock.
5399 read_unlock(&tasklist_lock);
5402 if ((current->euid != p->euid) && (current->euid != p->uid) &&
5403 !capable(CAP_SYS_NICE))
5406 retval = security_task_setscheduler(p, 0, NULL);
5410 cpuset_cpus_allowed(p, &cpus_allowed);
5411 cpus_and(new_mask, new_mask, cpus_allowed);
5413 retval = set_cpus_allowed_ptr(p, &new_mask);
5416 cpuset_cpus_allowed(p, &cpus_allowed);
5417 if (!cpus_subset(new_mask, cpus_allowed)) {
5419 * We must have raced with a concurrent cpuset
5420 * update. Just reset the cpus_allowed to the
5421 * cpuset's cpus_allowed
5423 new_mask = cpus_allowed;
5433 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
5434 cpumask_t *new_mask)
5436 if (len < sizeof(cpumask_t)) {
5437 memset(new_mask, 0, sizeof(cpumask_t));
5438 } else if (len > sizeof(cpumask_t)) {
5439 len = sizeof(cpumask_t);
5441 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
5445 * sys_sched_setaffinity - set the cpu affinity of a process
5446 * @pid: pid of the process
5447 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5448 * @user_mask_ptr: user-space pointer to the new cpu mask
5450 asmlinkage long sys_sched_setaffinity(pid_t pid, unsigned int len,
5451 unsigned long __user *user_mask_ptr)
5456 retval = get_user_cpu_mask(user_mask_ptr, len, &new_mask);
5460 return sched_setaffinity(pid, &new_mask);
5463 long sched_getaffinity(pid_t pid, cpumask_t *mask)
5465 struct task_struct *p;
5469 read_lock(&tasklist_lock);
5472 p = find_process_by_pid(pid);
5476 retval = security_task_getscheduler(p);
5480 cpus_and(*mask, p->cpus_allowed, cpu_online_map);
5483 read_unlock(&tasklist_lock);
5490 * sys_sched_getaffinity - get the cpu affinity of a process
5491 * @pid: pid of the process
5492 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5493 * @user_mask_ptr: user-space pointer to hold the current cpu mask
5495 asmlinkage long sys_sched_getaffinity(pid_t pid, unsigned int len,
5496 unsigned long __user *user_mask_ptr)
5501 if (len < sizeof(cpumask_t))
5504 ret = sched_getaffinity(pid, &mask);
5508 if (copy_to_user(user_mask_ptr, &mask, sizeof(cpumask_t)))
5511 return sizeof(cpumask_t);
5515 * sys_sched_yield - yield the current processor to other threads.
5517 * This function yields the current CPU to other tasks. If there are no
5518 * other threads running on this CPU then this function will return.
5520 asmlinkage long sys_sched_yield(void)
5522 struct rq *rq = this_rq_lock();
5524 schedstat_inc(rq, yld_count);
5525 current->sched_class->yield_task(rq);
5528 * Since we are going to call schedule() anyway, there's
5529 * no need to preempt or enable interrupts:
5531 __release(rq->lock);
5532 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
5533 _raw_spin_unlock(&rq->lock);
5534 preempt_enable_no_resched();
5541 static void __cond_resched(void)
5543 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
5544 __might_sleep(__FILE__, __LINE__);
5547 * The BKS might be reacquired before we have dropped
5548 * PREEMPT_ACTIVE, which could trigger a second
5549 * cond_resched() call.
5552 add_preempt_count(PREEMPT_ACTIVE);
5554 sub_preempt_count(PREEMPT_ACTIVE);
5555 } while (need_resched());
5558 int __sched _cond_resched(void)
5560 if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE) &&
5561 system_state == SYSTEM_RUNNING) {
5567 EXPORT_SYMBOL(_cond_resched);
5570 * cond_resched_lock() - if a reschedule is pending, drop the given lock,
5571 * call schedule, and on return reacquire the lock.
5573 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
5574 * operations here to prevent schedule() from being called twice (once via
5575 * spin_unlock(), once by hand).
5577 int cond_resched_lock(spinlock_t *lock)
5579 int resched = need_resched() && system_state == SYSTEM_RUNNING;
5582 if (spin_needbreak(lock) || resched) {
5584 if (resched && need_resched())
5593 EXPORT_SYMBOL(cond_resched_lock);
5595 int __sched cond_resched_softirq(void)
5597 BUG_ON(!in_softirq());
5599 if (need_resched() && system_state == SYSTEM_RUNNING) {
5607 EXPORT_SYMBOL(cond_resched_softirq);
5610 * yield - yield the current processor to other threads.
5612 * This is a shortcut for kernel-space yielding - it marks the
5613 * thread runnable and calls sys_sched_yield().
5615 void __sched yield(void)
5617 set_current_state(TASK_RUNNING);
5620 EXPORT_SYMBOL(yield);
5623 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
5624 * that process accounting knows that this is a task in IO wait state.
5626 * But don't do that if it is a deliberate, throttling IO wait (this task
5627 * has set its backing_dev_info: the queue against which it should throttle)
5629 void __sched io_schedule(void)
5631 struct rq *rq = &__raw_get_cpu_var(runqueues);
5633 delayacct_blkio_start();
5634 atomic_inc(&rq->nr_iowait);
5636 atomic_dec(&rq->nr_iowait);
5637 delayacct_blkio_end();
5639 EXPORT_SYMBOL(io_schedule);
5641 long __sched io_schedule_timeout(long timeout)
5643 struct rq *rq = &__raw_get_cpu_var(runqueues);
5646 delayacct_blkio_start();
5647 atomic_inc(&rq->nr_iowait);
5648 ret = schedule_timeout(timeout);
5649 atomic_dec(&rq->nr_iowait);
5650 delayacct_blkio_end();
5655 * sys_sched_get_priority_max - return maximum RT priority.
5656 * @policy: scheduling class.
5658 * this syscall returns the maximum rt_priority that can be used
5659 * by a given scheduling class.
5661 asmlinkage long sys_sched_get_priority_max(int policy)
5668 ret = MAX_USER_RT_PRIO-1;
5680 * sys_sched_get_priority_min - return minimum RT priority.
5681 * @policy: scheduling class.
5683 * this syscall returns the minimum rt_priority that can be used
5684 * by a given scheduling class.
5686 asmlinkage long sys_sched_get_priority_min(int policy)
5704 * sys_sched_rr_get_interval - return the default timeslice of a process.
5705 * @pid: pid of the process.
5706 * @interval: userspace pointer to the timeslice value.
5708 * this syscall writes the default timeslice value of a given process
5709 * into the user-space timespec buffer. A value of '0' means infinity.
5712 long sys_sched_rr_get_interval(pid_t pid, struct timespec __user *interval)
5714 struct task_struct *p;
5715 unsigned int time_slice;
5723 read_lock(&tasklist_lock);
5724 p = find_process_by_pid(pid);
5728 retval = security_task_getscheduler(p);
5733 * Time slice is 0 for SCHED_FIFO tasks and for SCHED_OTHER
5734 * tasks that are on an otherwise idle runqueue:
5737 if (p->policy == SCHED_RR) {
5738 time_slice = DEF_TIMESLICE;
5739 } else if (p->policy != SCHED_FIFO) {
5740 struct sched_entity *se = &p->se;
5741 unsigned long flags;
5744 rq = task_rq_lock(p, &flags);
5745 if (rq->cfs.load.weight)
5746 time_slice = NS_TO_JIFFIES(sched_slice(&rq->cfs, se));
5747 task_rq_unlock(rq, &flags);
5749 read_unlock(&tasklist_lock);
5750 jiffies_to_timespec(time_slice, &t);
5751 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
5755 read_unlock(&tasklist_lock);
5759 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
5761 void sched_show_task(struct task_struct *p)
5763 unsigned long free = 0;
5766 state = p->state ? __ffs(p->state) + 1 : 0;
5767 printk(KERN_INFO "%-13.13s %c", p->comm,
5768 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
5769 #if BITS_PER_LONG == 32
5770 if (state == TASK_RUNNING)
5771 printk(KERN_CONT " running ");
5773 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
5775 if (state == TASK_RUNNING)
5776 printk(KERN_CONT " running task ");
5778 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
5780 #ifdef CONFIG_DEBUG_STACK_USAGE
5782 unsigned long *n = end_of_stack(p);
5785 free = (unsigned long)n - (unsigned long)end_of_stack(p);
5788 printk(KERN_CONT "%5lu %5d %6d\n", free,
5789 task_pid_nr(p), task_pid_nr(p->real_parent));
5791 show_stack(p, NULL);
5794 void show_state_filter(unsigned long state_filter)
5796 struct task_struct *g, *p;
5798 #if BITS_PER_LONG == 32
5800 " task PC stack pid father\n");
5803 " task PC stack pid father\n");
5805 read_lock(&tasklist_lock);
5806 do_each_thread(g, p) {
5808 * reset the NMI-timeout, listing all files on a slow
5809 * console might take alot of time:
5811 touch_nmi_watchdog();
5812 if (!state_filter || (p->state & state_filter))
5814 } while_each_thread(g, p);
5816 touch_all_softlockup_watchdogs();
5818 #ifdef CONFIG_SCHED_DEBUG
5819 sysrq_sched_debug_show();
5821 read_unlock(&tasklist_lock);
5823 * Only show locks if all tasks are dumped:
5825 if (state_filter == -1)
5826 debug_show_all_locks();
5829 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
5831 idle->sched_class = &idle_sched_class;
5835 * init_idle - set up an idle thread for a given CPU
5836 * @idle: task in question
5837 * @cpu: cpu the idle task belongs to
5839 * NOTE: this function does not set the idle thread's NEED_RESCHED
5840 * flag, to make booting more robust.
5842 void __cpuinit init_idle(struct task_struct *idle, int cpu)
5844 struct rq *rq = cpu_rq(cpu);
5845 unsigned long flags;
5847 spin_lock_irqsave(&rq->lock, flags);
5850 idle->se.exec_start = sched_clock();
5852 idle->prio = idle->normal_prio = MAX_PRIO;
5853 idle->cpus_allowed = cpumask_of_cpu(cpu);
5854 __set_task_cpu(idle, cpu);
5856 rq->curr = rq->idle = idle;
5857 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
5860 spin_unlock_irqrestore(&rq->lock, flags);
5862 /* Set the preempt count _outside_ the spinlocks! */
5863 #if defined(CONFIG_PREEMPT)
5864 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
5866 task_thread_info(idle)->preempt_count = 0;
5869 * The idle tasks have their own, simple scheduling class:
5871 idle->sched_class = &idle_sched_class;
5872 ftrace_retfunc_init_task(idle);
5876 * In a system that switches off the HZ timer nohz_cpu_mask
5877 * indicates which cpus entered this state. This is used
5878 * in the rcu update to wait only for active cpus. For system
5879 * which do not switch off the HZ timer nohz_cpu_mask should
5880 * always be CPU_MASK_NONE.
5882 cpumask_t nohz_cpu_mask = CPU_MASK_NONE;
5885 * Increase the granularity value when there are more CPUs,
5886 * because with more CPUs the 'effective latency' as visible
5887 * to users decreases. But the relationship is not linear,
5888 * so pick a second-best guess by going with the log2 of the
5891 * This idea comes from the SD scheduler of Con Kolivas:
5893 static inline void sched_init_granularity(void)
5895 unsigned int factor = 1 + ilog2(num_online_cpus());
5896 const unsigned long limit = 200000000;
5898 sysctl_sched_min_granularity *= factor;
5899 if (sysctl_sched_min_granularity > limit)
5900 sysctl_sched_min_granularity = limit;
5902 sysctl_sched_latency *= factor;
5903 if (sysctl_sched_latency > limit)
5904 sysctl_sched_latency = limit;
5906 sysctl_sched_wakeup_granularity *= factor;
5908 sysctl_sched_shares_ratelimit *= factor;
5913 * This is how migration works:
5915 * 1) we queue a struct migration_req structure in the source CPU's
5916 * runqueue and wake up that CPU's migration thread.
5917 * 2) we down() the locked semaphore => thread blocks.
5918 * 3) migration thread wakes up (implicitly it forces the migrated
5919 * thread off the CPU)
5920 * 4) it gets the migration request and checks whether the migrated
5921 * task is still in the wrong runqueue.
5922 * 5) if it's in the wrong runqueue then the migration thread removes
5923 * it and puts it into the right queue.
5924 * 6) migration thread up()s the semaphore.
5925 * 7) we wake up and the migration is done.
5929 * Change a given task's CPU affinity. Migrate the thread to a
5930 * proper CPU and schedule it away if the CPU it's executing on
5931 * is removed from the allowed bitmask.
5933 * NOTE: the caller must have a valid reference to the task, the
5934 * task must not exit() & deallocate itself prematurely. The
5935 * call is not atomic; no spinlocks may be held.
5937 int set_cpus_allowed_ptr(struct task_struct *p, const cpumask_t *new_mask)
5939 struct migration_req req;
5940 unsigned long flags;
5944 rq = task_rq_lock(p, &flags);
5945 if (!cpus_intersects(*new_mask, cpu_online_map)) {
5950 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
5951 !cpus_equal(p->cpus_allowed, *new_mask))) {
5956 if (p->sched_class->set_cpus_allowed)
5957 p->sched_class->set_cpus_allowed(p, new_mask);
5959 p->cpus_allowed = *new_mask;
5960 p->rt.nr_cpus_allowed = cpus_weight(*new_mask);
5963 /* Can the task run on the task's current CPU? If so, we're done */
5964 if (cpu_isset(task_cpu(p), *new_mask))
5967 if (migrate_task(p, any_online_cpu(*new_mask), &req)) {
5968 /* Need help from migration thread: drop lock and wait. */
5969 task_rq_unlock(rq, &flags);
5970 wake_up_process(rq->migration_thread);
5971 wait_for_completion(&req.done);
5972 tlb_migrate_finish(p->mm);
5976 task_rq_unlock(rq, &flags);
5980 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
5983 * Move (not current) task off this cpu, onto dest cpu. We're doing
5984 * this because either it can't run here any more (set_cpus_allowed()
5985 * away from this CPU, or CPU going down), or because we're
5986 * attempting to rebalance this task on exec (sched_exec).
5988 * So we race with normal scheduler movements, but that's OK, as long
5989 * as the task is no longer on this CPU.
5991 * Returns non-zero if task was successfully migrated.
5993 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
5995 struct rq *rq_dest, *rq_src;
5998 if (unlikely(!cpu_active(dest_cpu)))
6001 rq_src = cpu_rq(src_cpu);
6002 rq_dest = cpu_rq(dest_cpu);
6004 double_rq_lock(rq_src, rq_dest);
6005 /* Already moved. */
6006 if (task_cpu(p) != src_cpu)
6008 /* Affinity changed (again). */
6009 if (!cpu_isset(dest_cpu, p->cpus_allowed))
6012 on_rq = p->se.on_rq;
6014 deactivate_task(rq_src, p, 0);
6016 set_task_cpu(p, dest_cpu);
6018 activate_task(rq_dest, p, 0);
6019 check_preempt_curr(rq_dest, p, 0);
6024 double_rq_unlock(rq_src, rq_dest);
6029 * migration_thread - this is a highprio system thread that performs
6030 * thread migration by bumping thread off CPU then 'pushing' onto
6033 static int migration_thread(void *data)
6035 int cpu = (long)data;
6039 BUG_ON(rq->migration_thread != current);
6041 set_current_state(TASK_INTERRUPTIBLE);
6042 while (!kthread_should_stop()) {
6043 struct migration_req *req;
6044 struct list_head *head;
6046 spin_lock_irq(&rq->lock);
6048 if (cpu_is_offline(cpu)) {
6049 spin_unlock_irq(&rq->lock);
6053 if (rq->active_balance) {
6054 active_load_balance(rq, cpu);
6055 rq->active_balance = 0;
6058 head = &rq->migration_queue;
6060 if (list_empty(head)) {
6061 spin_unlock_irq(&rq->lock);
6063 set_current_state(TASK_INTERRUPTIBLE);
6066 req = list_entry(head->next, struct migration_req, list);
6067 list_del_init(head->next);
6069 spin_unlock(&rq->lock);
6070 __migrate_task(req->task, cpu, req->dest_cpu);
6073 complete(&req->done);
6075 __set_current_state(TASK_RUNNING);
6079 /* Wait for kthread_stop */
6080 set_current_state(TASK_INTERRUPTIBLE);
6081 while (!kthread_should_stop()) {
6083 set_current_state(TASK_INTERRUPTIBLE);
6085 __set_current_state(TASK_RUNNING);
6089 #ifdef CONFIG_HOTPLUG_CPU
6091 static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu)
6095 local_irq_disable();
6096 ret = __migrate_task(p, src_cpu, dest_cpu);
6102 * Figure out where task on dead CPU should go, use force if necessary.
6104 static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
6106 unsigned long flags;
6113 node_to_cpumask_ptr(pnodemask, cpu_to_node(dead_cpu));
6115 cpus_and(mask, *pnodemask, p->cpus_allowed);
6116 dest_cpu = any_online_cpu(mask);
6118 /* On any allowed CPU? */
6119 if (dest_cpu >= nr_cpu_ids)
6120 dest_cpu = any_online_cpu(p->cpus_allowed);
6122 /* No more Mr. Nice Guy. */
6123 if (dest_cpu >= nr_cpu_ids) {
6124 cpumask_t cpus_allowed;
6126 cpuset_cpus_allowed_locked(p, &cpus_allowed);
6128 * Try to stay on the same cpuset, where the
6129 * current cpuset may be a subset of all cpus.
6130 * The cpuset_cpus_allowed_locked() variant of
6131 * cpuset_cpus_allowed() will not block. It must be
6132 * called within calls to cpuset_lock/cpuset_unlock.
6134 rq = task_rq_lock(p, &flags);
6135 p->cpus_allowed = cpus_allowed;
6136 dest_cpu = any_online_cpu(p->cpus_allowed);
6137 task_rq_unlock(rq, &flags);
6140 * Don't tell them about moving exiting tasks or
6141 * kernel threads (both mm NULL), since they never
6144 if (p->mm && printk_ratelimit()) {
6145 printk(KERN_INFO "process %d (%s) no "
6146 "longer affine to cpu%d\n",
6147 task_pid_nr(p), p->comm, dead_cpu);
6150 } while (!__migrate_task_irq(p, dead_cpu, dest_cpu));
6154 * While a dead CPU has no uninterruptible tasks queued at this point,
6155 * it might still have a nonzero ->nr_uninterruptible counter, because
6156 * for performance reasons the counter is not stricly tracking tasks to
6157 * their home CPUs. So we just add the counter to another CPU's counter,
6158 * to keep the global sum constant after CPU-down:
6160 static void migrate_nr_uninterruptible(struct rq *rq_src)
6162 struct rq *rq_dest = cpu_rq(any_online_cpu(*CPU_MASK_ALL_PTR));
6163 unsigned long flags;
6165 local_irq_save(flags);
6166 double_rq_lock(rq_src, rq_dest);
6167 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
6168 rq_src->nr_uninterruptible = 0;
6169 double_rq_unlock(rq_src, rq_dest);
6170 local_irq_restore(flags);
6173 /* Run through task list and migrate tasks from the dead cpu. */
6174 static void migrate_live_tasks(int src_cpu)
6176 struct task_struct *p, *t;
6178 read_lock(&tasklist_lock);
6180 do_each_thread(t, p) {
6184 if (task_cpu(p) == src_cpu)
6185 move_task_off_dead_cpu(src_cpu, p);
6186 } while_each_thread(t, p);
6188 read_unlock(&tasklist_lock);
6192 * Schedules idle task to be the next runnable task on current CPU.
6193 * It does so by boosting its priority to highest possible.
6194 * Used by CPU offline code.
6196 void sched_idle_next(void)
6198 int this_cpu = smp_processor_id();
6199 struct rq *rq = cpu_rq(this_cpu);
6200 struct task_struct *p = rq->idle;
6201 unsigned long flags;
6203 /* cpu has to be offline */
6204 BUG_ON(cpu_online(this_cpu));
6207 * Strictly not necessary since rest of the CPUs are stopped by now
6208 * and interrupts disabled on the current cpu.
6210 spin_lock_irqsave(&rq->lock, flags);
6212 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6214 update_rq_clock(rq);
6215 activate_task(rq, p, 0);
6217 spin_unlock_irqrestore(&rq->lock, flags);
6221 * Ensures that the idle task is using init_mm right before its cpu goes
6224 void idle_task_exit(void)
6226 struct mm_struct *mm = current->active_mm;
6228 BUG_ON(cpu_online(smp_processor_id()));
6231 switch_mm(mm, &init_mm, current);
6235 /* called under rq->lock with disabled interrupts */
6236 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
6238 struct rq *rq = cpu_rq(dead_cpu);
6240 /* Must be exiting, otherwise would be on tasklist. */
6241 BUG_ON(!p->exit_state);
6243 /* Cannot have done final schedule yet: would have vanished. */
6244 BUG_ON(p->state == TASK_DEAD);
6249 * Drop lock around migration; if someone else moves it,
6250 * that's OK. No task can be added to this CPU, so iteration is
6253 spin_unlock_irq(&rq->lock);
6254 move_task_off_dead_cpu(dead_cpu, p);
6255 spin_lock_irq(&rq->lock);
6260 /* release_task() removes task from tasklist, so we won't find dead tasks. */
6261 static void migrate_dead_tasks(unsigned int dead_cpu)
6263 struct rq *rq = cpu_rq(dead_cpu);
6264 struct task_struct *next;
6267 if (!rq->nr_running)
6269 update_rq_clock(rq);
6270 next = pick_next_task(rq, rq->curr);
6273 next->sched_class->put_prev_task(rq, next);
6274 migrate_dead(dead_cpu, next);
6278 #endif /* CONFIG_HOTPLUG_CPU */
6280 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
6282 static struct ctl_table sd_ctl_dir[] = {
6284 .procname = "sched_domain",
6290 static struct ctl_table sd_ctl_root[] = {
6292 .ctl_name = CTL_KERN,
6293 .procname = "kernel",
6295 .child = sd_ctl_dir,
6300 static struct ctl_table *sd_alloc_ctl_entry(int n)
6302 struct ctl_table *entry =
6303 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
6308 static void sd_free_ctl_entry(struct ctl_table **tablep)
6310 struct ctl_table *entry;
6313 * In the intermediate directories, both the child directory and
6314 * procname are dynamically allocated and could fail but the mode
6315 * will always be set. In the lowest directory the names are
6316 * static strings and all have proc handlers.
6318 for (entry = *tablep; entry->mode; entry++) {
6320 sd_free_ctl_entry(&entry->child);
6321 if (entry->proc_handler == NULL)
6322 kfree(entry->procname);
6330 set_table_entry(struct ctl_table *entry,
6331 const char *procname, void *data, int maxlen,
6332 mode_t mode, proc_handler *proc_handler)
6334 entry->procname = procname;
6336 entry->maxlen = maxlen;
6338 entry->proc_handler = proc_handler;
6341 static struct ctl_table *
6342 sd_alloc_ctl_domain_table(struct sched_domain *sd)
6344 struct ctl_table *table = sd_alloc_ctl_entry(13);
6349 set_table_entry(&table[0], "min_interval", &sd->min_interval,
6350 sizeof(long), 0644, proc_doulongvec_minmax);
6351 set_table_entry(&table[1], "max_interval", &sd->max_interval,
6352 sizeof(long), 0644, proc_doulongvec_minmax);
6353 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
6354 sizeof(int), 0644, proc_dointvec_minmax);
6355 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
6356 sizeof(int), 0644, proc_dointvec_minmax);
6357 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
6358 sizeof(int), 0644, proc_dointvec_minmax);
6359 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
6360 sizeof(int), 0644, proc_dointvec_minmax);
6361 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
6362 sizeof(int), 0644, proc_dointvec_minmax);
6363 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
6364 sizeof(int), 0644, proc_dointvec_minmax);
6365 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
6366 sizeof(int), 0644, proc_dointvec_minmax);
6367 set_table_entry(&table[9], "cache_nice_tries",
6368 &sd->cache_nice_tries,
6369 sizeof(int), 0644, proc_dointvec_minmax);
6370 set_table_entry(&table[10], "flags", &sd->flags,
6371 sizeof(int), 0644, proc_dointvec_minmax);
6372 set_table_entry(&table[11], "name", sd->name,
6373 CORENAME_MAX_SIZE, 0444, proc_dostring);
6374 /* &table[12] is terminator */
6379 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
6381 struct ctl_table *entry, *table;
6382 struct sched_domain *sd;
6383 int domain_num = 0, i;
6386 for_each_domain(cpu, sd)
6388 entry = table = sd_alloc_ctl_entry(domain_num + 1);
6393 for_each_domain(cpu, sd) {
6394 snprintf(buf, 32, "domain%d", i);
6395 entry->procname = kstrdup(buf, GFP_KERNEL);
6397 entry->child = sd_alloc_ctl_domain_table(sd);
6404 static struct ctl_table_header *sd_sysctl_header;
6405 static void register_sched_domain_sysctl(void)
6407 int i, cpu_num = num_online_cpus();
6408 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
6411 WARN_ON(sd_ctl_dir[0].child);
6412 sd_ctl_dir[0].child = entry;
6417 for_each_online_cpu(i) {
6418 snprintf(buf, 32, "cpu%d", i);
6419 entry->procname = kstrdup(buf, GFP_KERNEL);
6421 entry->child = sd_alloc_ctl_cpu_table(i);
6425 WARN_ON(sd_sysctl_header);
6426 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
6429 /* may be called multiple times per register */
6430 static void unregister_sched_domain_sysctl(void)
6432 if (sd_sysctl_header)
6433 unregister_sysctl_table(sd_sysctl_header);
6434 sd_sysctl_header = NULL;
6435 if (sd_ctl_dir[0].child)
6436 sd_free_ctl_entry(&sd_ctl_dir[0].child);
6439 static void register_sched_domain_sysctl(void)
6442 static void unregister_sched_domain_sysctl(void)
6447 static void set_rq_online(struct rq *rq)
6450 const struct sched_class *class;
6452 cpu_set(rq->cpu, rq->rd->online);
6455 for_each_class(class) {
6456 if (class->rq_online)
6457 class->rq_online(rq);
6462 static void set_rq_offline(struct rq *rq)
6465 const struct sched_class *class;
6467 for_each_class(class) {
6468 if (class->rq_offline)
6469 class->rq_offline(rq);
6472 cpu_clear(rq->cpu, rq->rd->online);
6478 * migration_call - callback that gets triggered when a CPU is added.
6479 * Here we can start up the necessary migration thread for the new CPU.
6481 static int __cpuinit
6482 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
6484 struct task_struct *p;
6485 int cpu = (long)hcpu;
6486 unsigned long flags;
6491 case CPU_UP_PREPARE:
6492 case CPU_UP_PREPARE_FROZEN:
6493 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
6496 kthread_bind(p, cpu);
6497 /* Must be high prio: stop_machine expects to yield to it. */
6498 rq = task_rq_lock(p, &flags);
6499 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6500 task_rq_unlock(rq, &flags);
6501 cpu_rq(cpu)->migration_thread = p;
6505 case CPU_ONLINE_FROZEN:
6506 /* Strictly unnecessary, as first user will wake it. */
6507 wake_up_process(cpu_rq(cpu)->migration_thread);
6509 /* Update our root-domain */
6511 spin_lock_irqsave(&rq->lock, flags);
6513 BUG_ON(!cpu_isset(cpu, rq->rd->span));
6517 spin_unlock_irqrestore(&rq->lock, flags);
6520 #ifdef CONFIG_HOTPLUG_CPU
6521 case CPU_UP_CANCELED:
6522 case CPU_UP_CANCELED_FROZEN:
6523 if (!cpu_rq(cpu)->migration_thread)
6525 /* Unbind it from offline cpu so it can run. Fall thru. */
6526 kthread_bind(cpu_rq(cpu)->migration_thread,
6527 any_online_cpu(cpu_online_map));
6528 kthread_stop(cpu_rq(cpu)->migration_thread);
6529 cpu_rq(cpu)->migration_thread = NULL;
6533 case CPU_DEAD_FROZEN:
6534 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
6535 migrate_live_tasks(cpu);
6537 kthread_stop(rq->migration_thread);
6538 rq->migration_thread = NULL;
6539 /* Idle task back to normal (off runqueue, low prio) */
6540 spin_lock_irq(&rq->lock);
6541 update_rq_clock(rq);
6542 deactivate_task(rq, rq->idle, 0);
6543 rq->idle->static_prio = MAX_PRIO;
6544 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
6545 rq->idle->sched_class = &idle_sched_class;
6546 migrate_dead_tasks(cpu);
6547 spin_unlock_irq(&rq->lock);
6549 migrate_nr_uninterruptible(rq);
6550 BUG_ON(rq->nr_running != 0);
6553 * No need to migrate the tasks: it was best-effort if
6554 * they didn't take sched_hotcpu_mutex. Just wake up
6557 spin_lock_irq(&rq->lock);
6558 while (!list_empty(&rq->migration_queue)) {
6559 struct migration_req *req;
6561 req = list_entry(rq->migration_queue.next,
6562 struct migration_req, list);
6563 list_del_init(&req->list);
6564 complete(&req->done);
6566 spin_unlock_irq(&rq->lock);
6570 case CPU_DYING_FROZEN:
6571 /* Update our root-domain */
6573 spin_lock_irqsave(&rq->lock, flags);
6575 BUG_ON(!cpu_isset(cpu, rq->rd->span));
6578 spin_unlock_irqrestore(&rq->lock, flags);
6585 /* Register at highest priority so that task migration (migrate_all_tasks)
6586 * happens before everything else.
6588 static struct notifier_block __cpuinitdata migration_notifier = {
6589 .notifier_call = migration_call,
6593 static int __init migration_init(void)
6595 void *cpu = (void *)(long)smp_processor_id();
6598 /* Start one for the boot CPU: */
6599 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
6600 BUG_ON(err == NOTIFY_BAD);
6601 migration_call(&migration_notifier, CPU_ONLINE, cpu);
6602 register_cpu_notifier(&migration_notifier);
6606 early_initcall(migration_init);
6611 #ifdef CONFIG_SCHED_DEBUG
6613 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
6614 cpumask_t *groupmask)
6616 struct sched_group *group = sd->groups;
6619 cpulist_scnprintf(str, sizeof(str), sd->span);
6620 cpus_clear(*groupmask);
6622 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
6624 if (!(sd->flags & SD_LOAD_BALANCE)) {
6625 printk("does not load-balance\n");
6627 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
6632 printk(KERN_CONT "span %s level %s\n", str, sd->name);
6634 if (!cpu_isset(cpu, sd->span)) {
6635 printk(KERN_ERR "ERROR: domain->span does not contain "
6638 if (!cpu_isset(cpu, group->cpumask)) {
6639 printk(KERN_ERR "ERROR: domain->groups does not contain"
6643 printk(KERN_DEBUG "%*s groups:", level + 1, "");
6647 printk(KERN_ERR "ERROR: group is NULL\n");
6651 if (!group->__cpu_power) {
6652 printk(KERN_CONT "\n");
6653 printk(KERN_ERR "ERROR: domain->cpu_power not "
6658 if (!cpus_weight(group->cpumask)) {
6659 printk(KERN_CONT "\n");
6660 printk(KERN_ERR "ERROR: empty group\n");
6664 if (cpus_intersects(*groupmask, group->cpumask)) {
6665 printk(KERN_CONT "\n");
6666 printk(KERN_ERR "ERROR: repeated CPUs\n");
6670 cpus_or(*groupmask, *groupmask, group->cpumask);
6672 cpulist_scnprintf(str, sizeof(str), group->cpumask);
6673 printk(KERN_CONT " %s", str);
6675 group = group->next;
6676 } while (group != sd->groups);
6677 printk(KERN_CONT "\n");
6679 if (!cpus_equal(sd->span, *groupmask))
6680 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
6682 if (sd->parent && !cpus_subset(*groupmask, sd->parent->span))
6683 printk(KERN_ERR "ERROR: parent span is not a superset "
6684 "of domain->span\n");
6688 static void sched_domain_debug(struct sched_domain *sd, int cpu)
6690 cpumask_t *groupmask;
6694 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
6698 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
6700 groupmask = kmalloc(sizeof(cpumask_t), GFP_KERNEL);
6702 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
6707 if (sched_domain_debug_one(sd, cpu, level, groupmask))
6716 #else /* !CONFIG_SCHED_DEBUG */
6717 # define sched_domain_debug(sd, cpu) do { } while (0)
6718 #endif /* CONFIG_SCHED_DEBUG */
6720 static int sd_degenerate(struct sched_domain *sd)
6722 if (cpus_weight(sd->span) == 1)
6725 /* Following flags need at least 2 groups */
6726 if (sd->flags & (SD_LOAD_BALANCE |
6727 SD_BALANCE_NEWIDLE |
6731 SD_SHARE_PKG_RESOURCES)) {
6732 if (sd->groups != sd->groups->next)
6736 /* Following flags don't use groups */
6737 if (sd->flags & (SD_WAKE_IDLE |
6746 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
6748 unsigned long cflags = sd->flags, pflags = parent->flags;
6750 if (sd_degenerate(parent))
6753 if (!cpus_equal(sd->span, parent->span))
6756 /* Does parent contain flags not in child? */
6757 /* WAKE_BALANCE is a subset of WAKE_AFFINE */
6758 if (cflags & SD_WAKE_AFFINE)
6759 pflags &= ~SD_WAKE_BALANCE;
6760 /* Flags needing groups don't count if only 1 group in parent */
6761 if (parent->groups == parent->groups->next) {
6762 pflags &= ~(SD_LOAD_BALANCE |
6763 SD_BALANCE_NEWIDLE |
6767 SD_SHARE_PKG_RESOURCES);
6769 if (~cflags & pflags)
6775 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
6777 unsigned long flags;
6779 spin_lock_irqsave(&rq->lock, flags);
6782 struct root_domain *old_rd = rq->rd;
6784 if (cpu_isset(rq->cpu, old_rd->online))
6787 cpu_clear(rq->cpu, old_rd->span);
6789 if (atomic_dec_and_test(&old_rd->refcount))
6793 atomic_inc(&rd->refcount);
6796 cpu_set(rq->cpu, rd->span);
6797 if (cpu_isset(rq->cpu, cpu_online_map))
6800 spin_unlock_irqrestore(&rq->lock, flags);
6803 static void init_rootdomain(struct root_domain *rd)
6805 memset(rd, 0, sizeof(*rd));
6807 cpus_clear(rd->span);
6808 cpus_clear(rd->online);
6810 cpupri_init(&rd->cpupri);
6813 static void init_defrootdomain(void)
6815 init_rootdomain(&def_root_domain);
6816 atomic_set(&def_root_domain.refcount, 1);
6819 static struct root_domain *alloc_rootdomain(void)
6821 struct root_domain *rd;
6823 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
6827 init_rootdomain(rd);
6833 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6834 * hold the hotplug lock.
6837 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
6839 struct rq *rq = cpu_rq(cpu);
6840 struct sched_domain *tmp;
6842 /* Remove the sched domains which do not contribute to scheduling. */
6843 for (tmp = sd; tmp; ) {
6844 struct sched_domain *parent = tmp->parent;
6848 if (sd_parent_degenerate(tmp, parent)) {
6849 tmp->parent = parent->parent;
6851 parent->parent->child = tmp;
6856 if (sd && sd_degenerate(sd)) {
6862 sched_domain_debug(sd, cpu);
6864 rq_attach_root(rq, rd);
6865 rcu_assign_pointer(rq->sd, sd);
6868 /* cpus with isolated domains */
6869 static cpumask_t cpu_isolated_map = CPU_MASK_NONE;
6871 /* Setup the mask of cpus configured for isolated domains */
6872 static int __init isolated_cpu_setup(char *str)
6874 static int __initdata ints[NR_CPUS];
6877 str = get_options(str, ARRAY_SIZE(ints), ints);
6878 cpus_clear(cpu_isolated_map);
6879 for (i = 1; i <= ints[0]; i++)
6880 if (ints[i] < NR_CPUS)
6881 cpu_set(ints[i], cpu_isolated_map);
6885 __setup("isolcpus=", isolated_cpu_setup);
6888 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
6889 * to a function which identifies what group(along with sched group) a CPU
6890 * belongs to. The return value of group_fn must be a >= 0 and < NR_CPUS
6891 * (due to the fact that we keep track of groups covered with a cpumask_t).
6893 * init_sched_build_groups will build a circular linked list of the groups
6894 * covered by the given span, and will set each group's ->cpumask correctly,
6895 * and ->cpu_power to 0.
6898 init_sched_build_groups(const cpumask_t *span, const cpumask_t *cpu_map,
6899 int (*group_fn)(int cpu, const cpumask_t *cpu_map,
6900 struct sched_group **sg,
6901 cpumask_t *tmpmask),
6902 cpumask_t *covered, cpumask_t *tmpmask)
6904 struct sched_group *first = NULL, *last = NULL;
6907 cpus_clear(*covered);
6909 for_each_cpu_mask_nr(i, *span) {
6910 struct sched_group *sg;
6911 int group = group_fn(i, cpu_map, &sg, tmpmask);
6914 if (cpu_isset(i, *covered))
6917 cpus_clear(sg->cpumask);
6918 sg->__cpu_power = 0;
6920 for_each_cpu_mask_nr(j, *span) {
6921 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
6924 cpu_set(j, *covered);
6925 cpu_set(j, sg->cpumask);
6936 #define SD_NODES_PER_DOMAIN 16
6941 * find_next_best_node - find the next node to include in a sched_domain
6942 * @node: node whose sched_domain we're building
6943 * @used_nodes: nodes already in the sched_domain
6945 * Find the next node to include in a given scheduling domain. Simply
6946 * finds the closest node not already in the @used_nodes map.
6948 * Should use nodemask_t.
6950 static int find_next_best_node(int node, nodemask_t *used_nodes)
6952 int i, n, val, min_val, best_node = 0;
6956 for (i = 0; i < nr_node_ids; i++) {
6957 /* Start at @node */
6958 n = (node + i) % nr_node_ids;
6960 if (!nr_cpus_node(n))
6963 /* Skip already used nodes */
6964 if (node_isset(n, *used_nodes))
6967 /* Simple min distance search */
6968 val = node_distance(node, n);
6970 if (val < min_val) {
6976 node_set(best_node, *used_nodes);
6981 * sched_domain_node_span - get a cpumask for a node's sched_domain
6982 * @node: node whose cpumask we're constructing
6983 * @span: resulting cpumask
6985 * Given a node, construct a good cpumask for its sched_domain to span. It
6986 * should be one that prevents unnecessary balancing, but also spreads tasks
6989 static void sched_domain_node_span(int node, cpumask_t *span)
6991 nodemask_t used_nodes;
6992 node_to_cpumask_ptr(nodemask, node);
6996 nodes_clear(used_nodes);
6998 cpus_or(*span, *span, *nodemask);
6999 node_set(node, used_nodes);
7001 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
7002 int next_node = find_next_best_node(node, &used_nodes);
7004 node_to_cpumask_ptr_next(nodemask, next_node);
7005 cpus_or(*span, *span, *nodemask);
7008 #endif /* CONFIG_NUMA */
7010 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
7013 * SMT sched-domains:
7015 #ifdef CONFIG_SCHED_SMT
7016 static DEFINE_PER_CPU(struct sched_domain, cpu_domains);
7017 static DEFINE_PER_CPU(struct sched_group, sched_group_cpus);
7020 cpu_to_cpu_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg,
7024 *sg = &per_cpu(sched_group_cpus, cpu);
7027 #endif /* CONFIG_SCHED_SMT */
7030 * multi-core sched-domains:
7032 #ifdef CONFIG_SCHED_MC
7033 static DEFINE_PER_CPU(struct sched_domain, core_domains);
7034 static DEFINE_PER_CPU(struct sched_group, sched_group_core);
7035 #endif /* CONFIG_SCHED_MC */
7037 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
7039 cpu_to_core_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg,
7044 *mask = per_cpu(cpu_sibling_map, cpu);
7045 cpus_and(*mask, *mask, *cpu_map);
7046 group = first_cpu(*mask);
7048 *sg = &per_cpu(sched_group_core, group);
7051 #elif defined(CONFIG_SCHED_MC)
7053 cpu_to_core_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg,
7057 *sg = &per_cpu(sched_group_core, cpu);
7062 static DEFINE_PER_CPU(struct sched_domain, phys_domains);
7063 static DEFINE_PER_CPU(struct sched_group, sched_group_phys);
7066 cpu_to_phys_group(int cpu, const cpumask_t *cpu_map, struct sched_group **sg,
7070 #ifdef CONFIG_SCHED_MC
7071 *mask = cpu_coregroup_map(cpu);
7072 cpus_and(*mask, *mask, *cpu_map);
7073 group = first_cpu(*mask);
7074 #elif defined(CONFIG_SCHED_SMT)
7075 *mask = per_cpu(cpu_sibling_map, cpu);
7076 cpus_and(*mask, *mask, *cpu_map);
7077 group = first_cpu(*mask);
7082 *sg = &per_cpu(sched_group_phys, group);
7088 * The init_sched_build_groups can't handle what we want to do with node
7089 * groups, so roll our own. Now each node has its own list of groups which
7090 * gets dynamically allocated.
7092 static DEFINE_PER_CPU(struct sched_domain, node_domains);
7093 static struct sched_group ***sched_group_nodes_bycpu;
7095 static DEFINE_PER_CPU(struct sched_domain, allnodes_domains);
7096 static DEFINE_PER_CPU(struct sched_group, sched_group_allnodes);
7098 static int cpu_to_allnodes_group(int cpu, const cpumask_t *cpu_map,
7099 struct sched_group **sg, cpumask_t *nodemask)
7102 node_to_cpumask_ptr(pnodemask, cpu_to_node(cpu));
7104 cpus_and(*nodemask, *pnodemask, *cpu_map);
7105 group = first_cpu(*nodemask);
7108 *sg = &per_cpu(sched_group_allnodes, group);
7112 static void init_numa_sched_groups_power(struct sched_group *group_head)
7114 struct sched_group *sg = group_head;
7120 for_each_cpu_mask_nr(j, sg->cpumask) {
7121 struct sched_domain *sd;
7123 sd = &per_cpu(phys_domains, j);
7124 if (j != first_cpu(sd->groups->cpumask)) {
7126 * Only add "power" once for each
7132 sg_inc_cpu_power(sg, sd->groups->__cpu_power);
7135 } while (sg != group_head);
7137 #endif /* CONFIG_NUMA */
7140 /* Free memory allocated for various sched_group structures */
7141 static void free_sched_groups(const cpumask_t *cpu_map, cpumask_t *nodemask)
7145 for_each_cpu_mask_nr(cpu, *cpu_map) {
7146 struct sched_group **sched_group_nodes
7147 = sched_group_nodes_bycpu[cpu];
7149 if (!sched_group_nodes)
7152 for (i = 0; i < nr_node_ids; i++) {
7153 struct sched_group *oldsg, *sg = sched_group_nodes[i];
7154 node_to_cpumask_ptr(pnodemask, i);
7156 cpus_and(*nodemask, *pnodemask, *cpu_map);
7157 if (cpus_empty(*nodemask))
7167 if (oldsg != sched_group_nodes[i])
7170 kfree(sched_group_nodes);
7171 sched_group_nodes_bycpu[cpu] = NULL;
7174 #else /* !CONFIG_NUMA */
7175 static void free_sched_groups(const cpumask_t *cpu_map, cpumask_t *nodemask)
7178 #endif /* CONFIG_NUMA */
7181 * Initialize sched groups cpu_power.
7183 * cpu_power indicates the capacity of sched group, which is used while
7184 * distributing the load between different sched groups in a sched domain.
7185 * Typically cpu_power for all the groups in a sched domain will be same unless
7186 * there are asymmetries in the topology. If there are asymmetries, group
7187 * having more cpu_power will pickup more load compared to the group having
7190 * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents
7191 * the maximum number of tasks a group can handle in the presence of other idle
7192 * or lightly loaded groups in the same sched domain.
7194 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
7196 struct sched_domain *child;
7197 struct sched_group *group;
7199 WARN_ON(!sd || !sd->groups);
7201 if (cpu != first_cpu(sd->groups->cpumask))
7206 sd->groups->__cpu_power = 0;
7209 * For perf policy, if the groups in child domain share resources
7210 * (for example cores sharing some portions of the cache hierarchy
7211 * or SMT), then set this domain groups cpu_power such that each group
7212 * can handle only one task, when there are other idle groups in the
7213 * same sched domain.
7215 if (!child || (!(sd->flags & SD_POWERSAVINGS_BALANCE) &&
7217 (SD_SHARE_CPUPOWER | SD_SHARE_PKG_RESOURCES)))) {
7218 sg_inc_cpu_power(sd->groups, SCHED_LOAD_SCALE);
7223 * add cpu_power of each child group to this groups cpu_power
7225 group = child->groups;
7227 sg_inc_cpu_power(sd->groups, group->__cpu_power);
7228 group = group->next;
7229 } while (group != child->groups);
7233 * Initializers for schedule domains
7234 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
7237 #ifdef CONFIG_SCHED_DEBUG
7238 # define SD_INIT_NAME(sd, type) sd->name = #type
7240 # define SD_INIT_NAME(sd, type) do { } while (0)
7243 #define SD_INIT(sd, type) sd_init_##type(sd)
7245 #define SD_INIT_FUNC(type) \
7246 static noinline void sd_init_##type(struct sched_domain *sd) \
7248 memset(sd, 0, sizeof(*sd)); \
7249 *sd = SD_##type##_INIT; \
7250 sd->level = SD_LV_##type; \
7251 SD_INIT_NAME(sd, type); \
7256 SD_INIT_FUNC(ALLNODES)
7259 #ifdef CONFIG_SCHED_SMT
7260 SD_INIT_FUNC(SIBLING)
7262 #ifdef CONFIG_SCHED_MC
7267 * To minimize stack usage kmalloc room for cpumasks and share the
7268 * space as the usage in build_sched_domains() dictates. Used only
7269 * if the amount of space is significant.
7272 cpumask_t tmpmask; /* make this one first */
7275 cpumask_t this_sibling_map;
7276 cpumask_t this_core_map;
7278 cpumask_t send_covered;
7281 cpumask_t domainspan;
7283 cpumask_t notcovered;
7288 #define SCHED_CPUMASK_DECLARE(v) struct allmasks *v
7289 static inline void sched_cpumask_alloc(struct allmasks **masks)
7291 *masks = kmalloc(sizeof(**masks), GFP_KERNEL);
7293 static inline void sched_cpumask_free(struct allmasks *masks)
7298 #define SCHED_CPUMASK_DECLARE(v) struct allmasks _v, *v = &_v
7299 static inline void sched_cpumask_alloc(struct allmasks **masks)
7301 static inline void sched_cpumask_free(struct allmasks *masks)
7305 #define SCHED_CPUMASK_VAR(v, a) cpumask_t *v = (cpumask_t *) \
7306 ((unsigned long)(a) + offsetof(struct allmasks, v))
7308 static int default_relax_domain_level = -1;
7310 static int __init setup_relax_domain_level(char *str)
7314 val = simple_strtoul(str, NULL, 0);
7315 if (val < SD_LV_MAX)
7316 default_relax_domain_level = val;
7320 __setup("relax_domain_level=", setup_relax_domain_level);
7322 static void set_domain_attribute(struct sched_domain *sd,
7323 struct sched_domain_attr *attr)
7327 if (!attr || attr->relax_domain_level < 0) {
7328 if (default_relax_domain_level < 0)
7331 request = default_relax_domain_level;
7333 request = attr->relax_domain_level;
7334 if (request < sd->level) {
7335 /* turn off idle balance on this domain */
7336 sd->flags &= ~(SD_WAKE_IDLE|SD_BALANCE_NEWIDLE);
7338 /* turn on idle balance on this domain */
7339 sd->flags |= (SD_WAKE_IDLE_FAR|SD_BALANCE_NEWIDLE);
7344 * Build sched domains for a given set of cpus and attach the sched domains
7345 * to the individual cpus
7347 static int __build_sched_domains(const cpumask_t *cpu_map,
7348 struct sched_domain_attr *attr)
7351 struct root_domain *rd;
7352 SCHED_CPUMASK_DECLARE(allmasks);
7355 struct sched_group **sched_group_nodes = NULL;
7356 int sd_allnodes = 0;
7359 * Allocate the per-node list of sched groups
7361 sched_group_nodes = kcalloc(nr_node_ids, sizeof(struct sched_group *),
7363 if (!sched_group_nodes) {
7364 printk(KERN_WARNING "Can not alloc sched group node list\n");
7369 rd = alloc_rootdomain();
7371 printk(KERN_WARNING "Cannot alloc root domain\n");
7373 kfree(sched_group_nodes);
7378 /* get space for all scratch cpumask variables */
7379 sched_cpumask_alloc(&allmasks);
7381 printk(KERN_WARNING "Cannot alloc cpumask array\n");
7384 kfree(sched_group_nodes);
7389 tmpmask = (cpumask_t *)allmasks;
7393 sched_group_nodes_bycpu[first_cpu(*cpu_map)] = sched_group_nodes;
7397 * Set up domains for cpus specified by the cpu_map.
7399 for_each_cpu_mask_nr(i, *cpu_map) {
7400 struct sched_domain *sd = NULL, *p;
7401 SCHED_CPUMASK_VAR(nodemask, allmasks);
7403 *nodemask = node_to_cpumask(cpu_to_node(i));
7404 cpus_and(*nodemask, *nodemask, *cpu_map);
7407 if (cpus_weight(*cpu_map) >
7408 SD_NODES_PER_DOMAIN*cpus_weight(*nodemask)) {
7409 sd = &per_cpu(allnodes_domains, i);
7410 SD_INIT(sd, ALLNODES);
7411 set_domain_attribute(sd, attr);
7412 sd->span = *cpu_map;
7413 cpu_to_allnodes_group(i, cpu_map, &sd->groups, tmpmask);
7419 sd = &per_cpu(node_domains, i);
7421 set_domain_attribute(sd, attr);
7422 sched_domain_node_span(cpu_to_node(i), &sd->span);
7426 cpus_and(sd->span, sd->span, *cpu_map);
7430 sd = &per_cpu(phys_domains, i);
7432 set_domain_attribute(sd, attr);
7433 sd->span = *nodemask;
7437 cpu_to_phys_group(i, cpu_map, &sd->groups, tmpmask);
7439 #ifdef CONFIG_SCHED_MC
7441 sd = &per_cpu(core_domains, i);
7443 set_domain_attribute(sd, attr);
7444 sd->span = cpu_coregroup_map(i);
7445 cpus_and(sd->span, sd->span, *cpu_map);
7448 cpu_to_core_group(i, cpu_map, &sd->groups, tmpmask);
7451 #ifdef CONFIG_SCHED_SMT
7453 sd = &per_cpu(cpu_domains, i);
7454 SD_INIT(sd, SIBLING);
7455 set_domain_attribute(sd, attr);
7456 sd->span = per_cpu(cpu_sibling_map, i);
7457 cpus_and(sd->span, sd->span, *cpu_map);
7460 cpu_to_cpu_group(i, cpu_map, &sd->groups, tmpmask);
7464 #ifdef CONFIG_SCHED_SMT
7465 /* Set up CPU (sibling) groups */
7466 for_each_cpu_mask_nr(i, *cpu_map) {
7467 SCHED_CPUMASK_VAR(this_sibling_map, allmasks);
7468 SCHED_CPUMASK_VAR(send_covered, allmasks);
7470 *this_sibling_map = per_cpu(cpu_sibling_map, i);
7471 cpus_and(*this_sibling_map, *this_sibling_map, *cpu_map);
7472 if (i != first_cpu(*this_sibling_map))
7475 init_sched_build_groups(this_sibling_map, cpu_map,
7477 send_covered, tmpmask);
7481 #ifdef CONFIG_SCHED_MC
7482 /* Set up multi-core groups */
7483 for_each_cpu_mask_nr(i, *cpu_map) {
7484 SCHED_CPUMASK_VAR(this_core_map, allmasks);
7485 SCHED_CPUMASK_VAR(send_covered, allmasks);
7487 *this_core_map = cpu_coregroup_map(i);
7488 cpus_and(*this_core_map, *this_core_map, *cpu_map);
7489 if (i != first_cpu(*this_core_map))
7492 init_sched_build_groups(this_core_map, cpu_map,
7494 send_covered, tmpmask);
7498 /* Set up physical groups */
7499 for (i = 0; i < nr_node_ids; i++) {
7500 SCHED_CPUMASK_VAR(nodemask, allmasks);
7501 SCHED_CPUMASK_VAR(send_covered, allmasks);
7503 *nodemask = node_to_cpumask(i);
7504 cpus_and(*nodemask, *nodemask, *cpu_map);
7505 if (cpus_empty(*nodemask))
7508 init_sched_build_groups(nodemask, cpu_map,
7510 send_covered, tmpmask);
7514 /* Set up node groups */
7516 SCHED_CPUMASK_VAR(send_covered, allmasks);
7518 init_sched_build_groups(cpu_map, cpu_map,
7519 &cpu_to_allnodes_group,
7520 send_covered, tmpmask);
7523 for (i = 0; i < nr_node_ids; i++) {
7524 /* Set up node groups */
7525 struct sched_group *sg, *prev;
7526 SCHED_CPUMASK_VAR(nodemask, allmasks);
7527 SCHED_CPUMASK_VAR(domainspan, allmasks);
7528 SCHED_CPUMASK_VAR(covered, allmasks);
7531 *nodemask = node_to_cpumask(i);
7532 cpus_clear(*covered);
7534 cpus_and(*nodemask, *nodemask, *cpu_map);
7535 if (cpus_empty(*nodemask)) {
7536 sched_group_nodes[i] = NULL;
7540 sched_domain_node_span(i, domainspan);
7541 cpus_and(*domainspan, *domainspan, *cpu_map);
7543 sg = kmalloc_node(sizeof(struct sched_group), GFP_KERNEL, i);
7545 printk(KERN_WARNING "Can not alloc domain group for "
7549 sched_group_nodes[i] = sg;
7550 for_each_cpu_mask_nr(j, *nodemask) {
7551 struct sched_domain *sd;
7553 sd = &per_cpu(node_domains, j);
7556 sg->__cpu_power = 0;
7557 sg->cpumask = *nodemask;
7559 cpus_or(*covered, *covered, *nodemask);
7562 for (j = 0; j < nr_node_ids; j++) {
7563 SCHED_CPUMASK_VAR(notcovered, allmasks);
7564 int n = (i + j) % nr_node_ids;
7565 node_to_cpumask_ptr(pnodemask, n);
7567 cpus_complement(*notcovered, *covered);
7568 cpus_and(*tmpmask, *notcovered, *cpu_map);
7569 cpus_and(*tmpmask, *tmpmask, *domainspan);
7570 if (cpus_empty(*tmpmask))
7573 cpus_and(*tmpmask, *tmpmask, *pnodemask);
7574 if (cpus_empty(*tmpmask))
7577 sg = kmalloc_node(sizeof(struct sched_group),
7581 "Can not alloc domain group for node %d\n", j);
7584 sg->__cpu_power = 0;
7585 sg->cpumask = *tmpmask;
7586 sg->next = prev->next;
7587 cpus_or(*covered, *covered, *tmpmask);
7594 /* Calculate CPU power for physical packages and nodes */
7595 #ifdef CONFIG_SCHED_SMT
7596 for_each_cpu_mask_nr(i, *cpu_map) {
7597 struct sched_domain *sd = &per_cpu(cpu_domains, i);
7599 init_sched_groups_power(i, sd);
7602 #ifdef CONFIG_SCHED_MC
7603 for_each_cpu_mask_nr(i, *cpu_map) {
7604 struct sched_domain *sd = &per_cpu(core_domains, i);
7606 init_sched_groups_power(i, sd);
7610 for_each_cpu_mask_nr(i, *cpu_map) {
7611 struct sched_domain *sd = &per_cpu(phys_domains, i);
7613 init_sched_groups_power(i, sd);
7617 for (i = 0; i < nr_node_ids; i++)
7618 init_numa_sched_groups_power(sched_group_nodes[i]);
7621 struct sched_group *sg;
7623 cpu_to_allnodes_group(first_cpu(*cpu_map), cpu_map, &sg,
7625 init_numa_sched_groups_power(sg);
7629 /* Attach the domains */
7630 for_each_cpu_mask_nr(i, *cpu_map) {
7631 struct sched_domain *sd;
7632 #ifdef CONFIG_SCHED_SMT
7633 sd = &per_cpu(cpu_domains, i);
7634 #elif defined(CONFIG_SCHED_MC)
7635 sd = &per_cpu(core_domains, i);
7637 sd = &per_cpu(phys_domains, i);
7639 cpu_attach_domain(sd, rd, i);
7642 sched_cpumask_free(allmasks);
7647 free_sched_groups(cpu_map, tmpmask);
7648 sched_cpumask_free(allmasks);
7654 static int build_sched_domains(const cpumask_t *cpu_map)
7656 return __build_sched_domains(cpu_map, NULL);
7659 static cpumask_t *doms_cur; /* current sched domains */
7660 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
7661 static struct sched_domain_attr *dattr_cur;
7662 /* attribues of custom domains in 'doms_cur' */
7665 * Special case: If a kmalloc of a doms_cur partition (array of
7666 * cpumask_t) fails, then fallback to a single sched domain,
7667 * as determined by the single cpumask_t fallback_doms.
7669 static cpumask_t fallback_doms;
7671 void __attribute__((weak)) arch_update_cpu_topology(void)
7676 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7677 * For now this just excludes isolated cpus, but could be used to
7678 * exclude other special cases in the future.
7680 static int arch_init_sched_domains(const cpumask_t *cpu_map)
7684 arch_update_cpu_topology();
7686 doms_cur = kmalloc(sizeof(cpumask_t), GFP_KERNEL);
7688 doms_cur = &fallback_doms;
7689 cpus_andnot(*doms_cur, *cpu_map, cpu_isolated_map);
7691 err = build_sched_domains(doms_cur);
7692 register_sched_domain_sysctl();
7697 static void arch_destroy_sched_domains(const cpumask_t *cpu_map,
7700 free_sched_groups(cpu_map, tmpmask);
7704 * Detach sched domains from a group of cpus specified in cpu_map
7705 * These cpus will now be attached to the NULL domain
7707 static void detach_destroy_domains(const cpumask_t *cpu_map)
7712 for_each_cpu_mask_nr(i, *cpu_map)
7713 cpu_attach_domain(NULL, &def_root_domain, i);
7714 synchronize_sched();
7715 arch_destroy_sched_domains(cpu_map, &tmpmask);
7718 /* handle null as "default" */
7719 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
7720 struct sched_domain_attr *new, int idx_new)
7722 struct sched_domain_attr tmp;
7729 return !memcmp(cur ? (cur + idx_cur) : &tmp,
7730 new ? (new + idx_new) : &tmp,
7731 sizeof(struct sched_domain_attr));
7735 * Partition sched domains as specified by the 'ndoms_new'
7736 * cpumasks in the array doms_new[] of cpumasks. This compares
7737 * doms_new[] to the current sched domain partitioning, doms_cur[].
7738 * It destroys each deleted domain and builds each new domain.
7740 * 'doms_new' is an array of cpumask_t's of length 'ndoms_new'.
7741 * The masks don't intersect (don't overlap.) We should setup one
7742 * sched domain for each mask. CPUs not in any of the cpumasks will
7743 * not be load balanced. If the same cpumask appears both in the
7744 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7747 * The passed in 'doms_new' should be kmalloc'd. This routine takes
7748 * ownership of it and will kfree it when done with it. If the caller
7749 * failed the kmalloc call, then it can pass in doms_new == NULL &&
7750 * ndoms_new == 1, and partition_sched_domains() will fallback to
7751 * the single partition 'fallback_doms', it also forces the domains
7754 * If doms_new == NULL it will be replaced with cpu_online_map.
7755 * ndoms_new == 0 is a special case for destroying existing domains,
7756 * and it will not create the default domain.
7758 * Call with hotplug lock held
7760 void partition_sched_domains(int ndoms_new, cpumask_t *doms_new,
7761 struct sched_domain_attr *dattr_new)
7765 mutex_lock(&sched_domains_mutex);
7767 /* always unregister in case we don't destroy any domains */
7768 unregister_sched_domain_sysctl();
7770 n = doms_new ? ndoms_new : 0;
7772 /* Destroy deleted domains */
7773 for (i = 0; i < ndoms_cur; i++) {
7774 for (j = 0; j < n; j++) {
7775 if (cpus_equal(doms_cur[i], doms_new[j])
7776 && dattrs_equal(dattr_cur, i, dattr_new, j))
7779 /* no match - a current sched domain not in new doms_new[] */
7780 detach_destroy_domains(doms_cur + i);
7785 if (doms_new == NULL) {
7787 doms_new = &fallback_doms;
7788 cpus_andnot(doms_new[0], cpu_online_map, cpu_isolated_map);
7789 WARN_ON_ONCE(dattr_new);
7792 /* Build new domains */
7793 for (i = 0; i < ndoms_new; i++) {
7794 for (j = 0; j < ndoms_cur; j++) {
7795 if (cpus_equal(doms_new[i], doms_cur[j])
7796 && dattrs_equal(dattr_new, i, dattr_cur, j))
7799 /* no match - add a new doms_new */
7800 __build_sched_domains(doms_new + i,
7801 dattr_new ? dattr_new + i : NULL);
7806 /* Remember the new sched domains */
7807 if (doms_cur != &fallback_doms)
7809 kfree(dattr_cur); /* kfree(NULL) is safe */
7810 doms_cur = doms_new;
7811 dattr_cur = dattr_new;
7812 ndoms_cur = ndoms_new;
7814 register_sched_domain_sysctl();
7816 mutex_unlock(&sched_domains_mutex);
7819 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
7820 int arch_reinit_sched_domains(void)
7824 /* Destroy domains first to force the rebuild */
7825 partition_sched_domains(0, NULL, NULL);
7827 rebuild_sched_domains();
7833 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
7837 if (buf[0] != '0' && buf[0] != '1')
7841 sched_smt_power_savings = (buf[0] == '1');
7843 sched_mc_power_savings = (buf[0] == '1');
7845 ret = arch_reinit_sched_domains();
7847 return ret ? ret : count;
7850 #ifdef CONFIG_SCHED_MC
7851 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
7854 return sprintf(page, "%u\n", sched_mc_power_savings);
7856 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
7857 const char *buf, size_t count)
7859 return sched_power_savings_store(buf, count, 0);
7861 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
7862 sched_mc_power_savings_show,
7863 sched_mc_power_savings_store);
7866 #ifdef CONFIG_SCHED_SMT
7867 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
7870 return sprintf(page, "%u\n", sched_smt_power_savings);
7872 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
7873 const char *buf, size_t count)
7875 return sched_power_savings_store(buf, count, 1);
7877 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
7878 sched_smt_power_savings_show,
7879 sched_smt_power_savings_store);
7882 int sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
7886 #ifdef CONFIG_SCHED_SMT
7888 err = sysfs_create_file(&cls->kset.kobj,
7889 &attr_sched_smt_power_savings.attr);
7891 #ifdef CONFIG_SCHED_MC
7892 if (!err && mc_capable())
7893 err = sysfs_create_file(&cls->kset.kobj,
7894 &attr_sched_mc_power_savings.attr);
7898 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
7900 #ifndef CONFIG_CPUSETS
7902 * Add online and remove offline CPUs from the scheduler domains.
7903 * When cpusets are enabled they take over this function.
7905 static int update_sched_domains(struct notifier_block *nfb,
7906 unsigned long action, void *hcpu)
7910 case CPU_ONLINE_FROZEN:
7912 case CPU_DEAD_FROZEN:
7913 partition_sched_domains(1, NULL, NULL);
7922 static int update_runtime(struct notifier_block *nfb,
7923 unsigned long action, void *hcpu)
7925 int cpu = (int)(long)hcpu;
7928 case CPU_DOWN_PREPARE:
7929 case CPU_DOWN_PREPARE_FROZEN:
7930 disable_runtime(cpu_rq(cpu));
7933 case CPU_DOWN_FAILED:
7934 case CPU_DOWN_FAILED_FROZEN:
7936 case CPU_ONLINE_FROZEN:
7937 enable_runtime(cpu_rq(cpu));
7945 void __init sched_init_smp(void)
7947 cpumask_t non_isolated_cpus;
7949 #if defined(CONFIG_NUMA)
7950 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
7952 BUG_ON(sched_group_nodes_bycpu == NULL);
7955 mutex_lock(&sched_domains_mutex);
7956 arch_init_sched_domains(&cpu_online_map);
7957 cpus_andnot(non_isolated_cpus, cpu_possible_map, cpu_isolated_map);
7958 if (cpus_empty(non_isolated_cpus))
7959 cpu_set(smp_processor_id(), non_isolated_cpus);
7960 mutex_unlock(&sched_domains_mutex);
7963 #ifndef CONFIG_CPUSETS
7964 /* XXX: Theoretical race here - CPU may be hotplugged now */
7965 hotcpu_notifier(update_sched_domains, 0);
7968 /* RT runtime code needs to handle some hotplug events */
7969 hotcpu_notifier(update_runtime, 0);
7973 /* Move init over to a non-isolated CPU */
7974 if (set_cpus_allowed_ptr(current, &non_isolated_cpus) < 0)
7976 sched_init_granularity();
7979 void __init sched_init_smp(void)
7981 sched_init_granularity();
7983 #endif /* CONFIG_SMP */
7985 int in_sched_functions(unsigned long addr)
7987 return in_lock_functions(addr) ||
7988 (addr >= (unsigned long)__sched_text_start
7989 && addr < (unsigned long)__sched_text_end);
7992 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
7994 cfs_rq->tasks_timeline = RB_ROOT;
7995 INIT_LIST_HEAD(&cfs_rq->tasks);
7996 #ifdef CONFIG_FAIR_GROUP_SCHED
7999 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
8002 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
8004 struct rt_prio_array *array;
8007 array = &rt_rq->active;
8008 for (i = 0; i < MAX_RT_PRIO; i++) {
8009 INIT_LIST_HEAD(array->queue + i);
8010 __clear_bit(i, array->bitmap);
8012 /* delimiter for bitsearch: */
8013 __set_bit(MAX_RT_PRIO, array->bitmap);
8015 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
8016 rt_rq->highest_prio = MAX_RT_PRIO;
8019 rt_rq->rt_nr_migratory = 0;
8020 rt_rq->overloaded = 0;
8024 rt_rq->rt_throttled = 0;
8025 rt_rq->rt_runtime = 0;
8026 spin_lock_init(&rt_rq->rt_runtime_lock);
8028 #ifdef CONFIG_RT_GROUP_SCHED
8029 rt_rq->rt_nr_boosted = 0;
8034 #ifdef CONFIG_FAIR_GROUP_SCHED
8035 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
8036 struct sched_entity *se, int cpu, int add,
8037 struct sched_entity *parent)
8039 struct rq *rq = cpu_rq(cpu);
8040 tg->cfs_rq[cpu] = cfs_rq;
8041 init_cfs_rq(cfs_rq, rq);
8044 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
8047 /* se could be NULL for init_task_group */
8052 se->cfs_rq = &rq->cfs;
8054 se->cfs_rq = parent->my_q;
8057 se->load.weight = tg->shares;
8058 se->load.inv_weight = 0;
8059 se->parent = parent;
8063 #ifdef CONFIG_RT_GROUP_SCHED
8064 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
8065 struct sched_rt_entity *rt_se, int cpu, int add,
8066 struct sched_rt_entity *parent)
8068 struct rq *rq = cpu_rq(cpu);
8070 tg->rt_rq[cpu] = rt_rq;
8071 init_rt_rq(rt_rq, rq);
8073 rt_rq->rt_se = rt_se;
8074 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
8076 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
8078 tg->rt_se[cpu] = rt_se;
8083 rt_se->rt_rq = &rq->rt;
8085 rt_se->rt_rq = parent->my_q;
8087 rt_se->my_q = rt_rq;
8088 rt_se->parent = parent;
8089 INIT_LIST_HEAD(&rt_se->run_list);
8093 void __init sched_init(void)
8096 unsigned long alloc_size = 0, ptr;
8098 #ifdef CONFIG_FAIR_GROUP_SCHED
8099 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8101 #ifdef CONFIG_RT_GROUP_SCHED
8102 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8104 #ifdef CONFIG_USER_SCHED
8108 * As sched_init() is called before page_alloc is setup,
8109 * we use alloc_bootmem().
8112 ptr = (unsigned long)alloc_bootmem(alloc_size);
8114 #ifdef CONFIG_FAIR_GROUP_SCHED
8115 init_task_group.se = (struct sched_entity **)ptr;
8116 ptr += nr_cpu_ids * sizeof(void **);
8118 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
8119 ptr += nr_cpu_ids * sizeof(void **);
8121 #ifdef CONFIG_USER_SCHED
8122 root_task_group.se = (struct sched_entity **)ptr;
8123 ptr += nr_cpu_ids * sizeof(void **);
8125 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
8126 ptr += nr_cpu_ids * sizeof(void **);
8127 #endif /* CONFIG_USER_SCHED */
8128 #endif /* CONFIG_FAIR_GROUP_SCHED */
8129 #ifdef CONFIG_RT_GROUP_SCHED
8130 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
8131 ptr += nr_cpu_ids * sizeof(void **);
8133 init_task_group.rt_rq = (struct rt_rq **)ptr;
8134 ptr += nr_cpu_ids * sizeof(void **);
8136 #ifdef CONFIG_USER_SCHED
8137 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
8138 ptr += nr_cpu_ids * sizeof(void **);
8140 root_task_group.rt_rq = (struct rt_rq **)ptr;
8141 ptr += nr_cpu_ids * sizeof(void **);
8142 #endif /* CONFIG_USER_SCHED */
8143 #endif /* CONFIG_RT_GROUP_SCHED */
8147 init_defrootdomain();
8150 init_rt_bandwidth(&def_rt_bandwidth,
8151 global_rt_period(), global_rt_runtime());
8153 #ifdef CONFIG_RT_GROUP_SCHED
8154 init_rt_bandwidth(&init_task_group.rt_bandwidth,
8155 global_rt_period(), global_rt_runtime());
8156 #ifdef CONFIG_USER_SCHED
8157 init_rt_bandwidth(&root_task_group.rt_bandwidth,
8158 global_rt_period(), RUNTIME_INF);
8159 #endif /* CONFIG_USER_SCHED */
8160 #endif /* CONFIG_RT_GROUP_SCHED */
8162 #ifdef CONFIG_GROUP_SCHED
8163 list_add(&init_task_group.list, &task_groups);
8164 INIT_LIST_HEAD(&init_task_group.children);
8166 #ifdef CONFIG_USER_SCHED
8167 INIT_LIST_HEAD(&root_task_group.children);
8168 init_task_group.parent = &root_task_group;
8169 list_add(&init_task_group.siblings, &root_task_group.children);
8170 #endif /* CONFIG_USER_SCHED */
8171 #endif /* CONFIG_GROUP_SCHED */
8173 for_each_possible_cpu(i) {
8177 spin_lock_init(&rq->lock);
8179 init_cfs_rq(&rq->cfs, rq);
8180 init_rt_rq(&rq->rt, rq);
8181 #ifdef CONFIG_FAIR_GROUP_SCHED
8182 init_task_group.shares = init_task_group_load;
8183 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
8184 #ifdef CONFIG_CGROUP_SCHED
8186 * How much cpu bandwidth does init_task_group get?
8188 * In case of task-groups formed thr' the cgroup filesystem, it
8189 * gets 100% of the cpu resources in the system. This overall
8190 * system cpu resource is divided among the tasks of
8191 * init_task_group and its child task-groups in a fair manner,
8192 * based on each entity's (task or task-group's) weight
8193 * (se->load.weight).
8195 * In other words, if init_task_group has 10 tasks of weight
8196 * 1024) and two child groups A0 and A1 (of weight 1024 each),
8197 * then A0's share of the cpu resource is:
8199 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
8201 * We achieve this by letting init_task_group's tasks sit
8202 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
8204 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
8205 #elif defined CONFIG_USER_SCHED
8206 root_task_group.shares = NICE_0_LOAD;
8207 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL);
8209 * In case of task-groups formed thr' the user id of tasks,
8210 * init_task_group represents tasks belonging to root user.
8211 * Hence it forms a sibling of all subsequent groups formed.
8212 * In this case, init_task_group gets only a fraction of overall
8213 * system cpu resource, based on the weight assigned to root
8214 * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished
8215 * by letting tasks of init_task_group sit in a separate cfs_rq
8216 * (init_cfs_rq) and having one entity represent this group of
8217 * tasks in rq->cfs (i.e init_task_group->se[] != NULL).
8219 init_tg_cfs_entry(&init_task_group,
8220 &per_cpu(init_cfs_rq, i),
8221 &per_cpu(init_sched_entity, i), i, 1,
8222 root_task_group.se[i]);
8225 #endif /* CONFIG_FAIR_GROUP_SCHED */
8227 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
8228 #ifdef CONFIG_RT_GROUP_SCHED
8229 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
8230 #ifdef CONFIG_CGROUP_SCHED
8231 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
8232 #elif defined CONFIG_USER_SCHED
8233 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL);
8234 init_tg_rt_entry(&init_task_group,
8235 &per_cpu(init_rt_rq, i),
8236 &per_cpu(init_sched_rt_entity, i), i, 1,
8237 root_task_group.rt_se[i]);
8241 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
8242 rq->cpu_load[j] = 0;
8246 rq->active_balance = 0;
8247 rq->next_balance = jiffies;
8251 rq->migration_thread = NULL;
8252 INIT_LIST_HEAD(&rq->migration_queue);
8253 rq_attach_root(rq, &def_root_domain);
8256 atomic_set(&rq->nr_iowait, 0);
8259 set_load_weight(&init_task);
8261 #ifdef CONFIG_PREEMPT_NOTIFIERS
8262 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
8266 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
8269 #ifdef CONFIG_RT_MUTEXES
8270 plist_head_init(&init_task.pi_waiters, &init_task.pi_lock);
8274 * The boot idle thread does lazy MMU switching as well:
8276 atomic_inc(&init_mm.mm_count);
8277 enter_lazy_tlb(&init_mm, current);
8280 * Make us the idle thread. Technically, schedule() should not be
8281 * called from this thread, however somewhere below it might be,
8282 * but because we are the idle thread, we just pick up running again
8283 * when this runqueue becomes "idle".
8285 init_idle(current, smp_processor_id());
8287 * During early bootup we pretend to be a normal task:
8289 current->sched_class = &fair_sched_class;
8291 scheduler_running = 1;
8294 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
8295 void __might_sleep(char *file, int line)
8298 static unsigned long prev_jiffy; /* ratelimiting */
8300 if ((!in_atomic() && !irqs_disabled()) ||
8301 system_state != SYSTEM_RUNNING || oops_in_progress)
8303 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
8305 prev_jiffy = jiffies;
8308 "BUG: sleeping function called from invalid context at %s:%d\n",
8311 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
8312 in_atomic(), irqs_disabled(),
8313 current->pid, current->comm);
8315 debug_show_held_locks(current);
8316 if (irqs_disabled())
8317 print_irqtrace_events(current);
8321 EXPORT_SYMBOL(__might_sleep);
8324 #ifdef CONFIG_MAGIC_SYSRQ
8325 static void normalize_task(struct rq *rq, struct task_struct *p)
8329 update_rq_clock(rq);
8330 on_rq = p->se.on_rq;
8332 deactivate_task(rq, p, 0);
8333 __setscheduler(rq, p, SCHED_NORMAL, 0);
8335 activate_task(rq, p, 0);
8336 resched_task(rq->curr);
8340 void normalize_rt_tasks(void)
8342 struct task_struct *g, *p;
8343 unsigned long flags;
8346 read_lock_irqsave(&tasklist_lock, flags);
8347 do_each_thread(g, p) {
8349 * Only normalize user tasks:
8354 p->se.exec_start = 0;
8355 #ifdef CONFIG_SCHEDSTATS
8356 p->se.wait_start = 0;
8357 p->se.sleep_start = 0;
8358 p->se.block_start = 0;
8363 * Renice negative nice level userspace
8366 if (TASK_NICE(p) < 0 && p->mm)
8367 set_user_nice(p, 0);
8371 spin_lock(&p->pi_lock);
8372 rq = __task_rq_lock(p);
8374 normalize_task(rq, p);
8376 __task_rq_unlock(rq);
8377 spin_unlock(&p->pi_lock);
8378 } while_each_thread(g, p);
8380 read_unlock_irqrestore(&tasklist_lock, flags);
8383 #endif /* CONFIG_MAGIC_SYSRQ */
8387 * These functions are only useful for the IA64 MCA handling.
8389 * They can only be called when the whole system has been
8390 * stopped - every CPU needs to be quiescent, and no scheduling
8391 * activity can take place. Using them for anything else would
8392 * be a serious bug, and as a result, they aren't even visible
8393 * under any other configuration.
8397 * curr_task - return the current task for a given cpu.
8398 * @cpu: the processor in question.
8400 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8402 struct task_struct *curr_task(int cpu)
8404 return cpu_curr(cpu);
8408 * set_curr_task - set the current task for a given cpu.
8409 * @cpu: the processor in question.
8410 * @p: the task pointer to set.
8412 * Description: This function must only be used when non-maskable interrupts
8413 * are serviced on a separate stack. It allows the architecture to switch the
8414 * notion of the current task on a cpu in a non-blocking manner. This function
8415 * must be called with all CPU's synchronized, and interrupts disabled, the
8416 * and caller must save the original value of the current task (see
8417 * curr_task() above) and restore that value before reenabling interrupts and
8418 * re-starting the system.
8420 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8422 void set_curr_task(int cpu, struct task_struct *p)
8429 #ifdef CONFIG_FAIR_GROUP_SCHED
8430 static void free_fair_sched_group(struct task_group *tg)
8434 for_each_possible_cpu(i) {
8436 kfree(tg->cfs_rq[i]);
8446 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8448 struct cfs_rq *cfs_rq;
8449 struct sched_entity *se;
8453 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
8456 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
8460 tg->shares = NICE_0_LOAD;
8462 for_each_possible_cpu(i) {
8465 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
8466 GFP_KERNEL, cpu_to_node(i));
8470 se = kzalloc_node(sizeof(struct sched_entity),
8471 GFP_KERNEL, cpu_to_node(i));
8475 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
8484 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8486 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
8487 &cpu_rq(cpu)->leaf_cfs_rq_list);
8490 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8492 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
8494 #else /* !CONFG_FAIR_GROUP_SCHED */
8495 static inline void free_fair_sched_group(struct task_group *tg)
8500 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8505 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8509 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8512 #endif /* CONFIG_FAIR_GROUP_SCHED */
8514 #ifdef CONFIG_RT_GROUP_SCHED
8515 static void free_rt_sched_group(struct task_group *tg)
8519 destroy_rt_bandwidth(&tg->rt_bandwidth);
8521 for_each_possible_cpu(i) {
8523 kfree(tg->rt_rq[i]);
8525 kfree(tg->rt_se[i]);
8533 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8535 struct rt_rq *rt_rq;
8536 struct sched_rt_entity *rt_se;
8540 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
8543 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
8547 init_rt_bandwidth(&tg->rt_bandwidth,
8548 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
8550 for_each_possible_cpu(i) {
8553 rt_rq = kzalloc_node(sizeof(struct rt_rq),
8554 GFP_KERNEL, cpu_to_node(i));
8558 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
8559 GFP_KERNEL, cpu_to_node(i));
8563 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
8572 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8574 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
8575 &cpu_rq(cpu)->leaf_rt_rq_list);
8578 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8580 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
8582 #else /* !CONFIG_RT_GROUP_SCHED */
8583 static inline void free_rt_sched_group(struct task_group *tg)
8588 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8593 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8597 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8600 #endif /* CONFIG_RT_GROUP_SCHED */
8602 #ifdef CONFIG_GROUP_SCHED
8603 static void free_sched_group(struct task_group *tg)
8605 free_fair_sched_group(tg);
8606 free_rt_sched_group(tg);
8610 /* allocate runqueue etc for a new task group */
8611 struct task_group *sched_create_group(struct task_group *parent)
8613 struct task_group *tg;
8614 unsigned long flags;
8617 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
8619 return ERR_PTR(-ENOMEM);
8621 if (!alloc_fair_sched_group(tg, parent))
8624 if (!alloc_rt_sched_group(tg, parent))
8627 spin_lock_irqsave(&task_group_lock, flags);
8628 for_each_possible_cpu(i) {
8629 register_fair_sched_group(tg, i);
8630 register_rt_sched_group(tg, i);
8632 list_add_rcu(&tg->list, &task_groups);
8634 WARN_ON(!parent); /* root should already exist */
8636 tg->parent = parent;
8637 INIT_LIST_HEAD(&tg->children);
8638 list_add_rcu(&tg->siblings, &parent->children);
8639 spin_unlock_irqrestore(&task_group_lock, flags);
8644 free_sched_group(tg);
8645 return ERR_PTR(-ENOMEM);
8648 /* rcu callback to free various structures associated with a task group */
8649 static void free_sched_group_rcu(struct rcu_head *rhp)
8651 /* now it should be safe to free those cfs_rqs */
8652 free_sched_group(container_of(rhp, struct task_group, rcu));
8655 /* Destroy runqueue etc associated with a task group */
8656 void sched_destroy_group(struct task_group *tg)
8658 unsigned long flags;
8661 spin_lock_irqsave(&task_group_lock, flags);
8662 for_each_possible_cpu(i) {
8663 unregister_fair_sched_group(tg, i);
8664 unregister_rt_sched_group(tg, i);
8666 list_del_rcu(&tg->list);
8667 list_del_rcu(&tg->siblings);
8668 spin_unlock_irqrestore(&task_group_lock, flags);
8670 /* wait for possible concurrent references to cfs_rqs complete */
8671 call_rcu(&tg->rcu, free_sched_group_rcu);
8674 /* change task's runqueue when it moves between groups.
8675 * The caller of this function should have put the task in its new group
8676 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
8677 * reflect its new group.
8679 void sched_move_task(struct task_struct *tsk)
8682 unsigned long flags;
8685 rq = task_rq_lock(tsk, &flags);
8687 update_rq_clock(rq);
8689 running = task_current(rq, tsk);
8690 on_rq = tsk->se.on_rq;
8693 dequeue_task(rq, tsk, 0);
8694 if (unlikely(running))
8695 tsk->sched_class->put_prev_task(rq, tsk);
8697 set_task_rq(tsk, task_cpu(tsk));
8699 #ifdef CONFIG_FAIR_GROUP_SCHED
8700 if (tsk->sched_class->moved_group)
8701 tsk->sched_class->moved_group(tsk);
8704 if (unlikely(running))
8705 tsk->sched_class->set_curr_task(rq);
8707 enqueue_task(rq, tsk, 0);
8709 task_rq_unlock(rq, &flags);
8711 #endif /* CONFIG_GROUP_SCHED */
8713 #ifdef CONFIG_FAIR_GROUP_SCHED
8714 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
8716 struct cfs_rq *cfs_rq = se->cfs_rq;
8721 dequeue_entity(cfs_rq, se, 0);
8723 se->load.weight = shares;
8724 se->load.inv_weight = 0;
8727 enqueue_entity(cfs_rq, se, 0);
8730 static void set_se_shares(struct sched_entity *se, unsigned long shares)
8732 struct cfs_rq *cfs_rq = se->cfs_rq;
8733 struct rq *rq = cfs_rq->rq;
8734 unsigned long flags;
8736 spin_lock_irqsave(&rq->lock, flags);
8737 __set_se_shares(se, shares);
8738 spin_unlock_irqrestore(&rq->lock, flags);
8741 static DEFINE_MUTEX(shares_mutex);
8743 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
8746 unsigned long flags;
8749 * We can't change the weight of the root cgroup.
8754 if (shares < MIN_SHARES)
8755 shares = MIN_SHARES;
8756 else if (shares > MAX_SHARES)
8757 shares = MAX_SHARES;
8759 mutex_lock(&shares_mutex);
8760 if (tg->shares == shares)
8763 spin_lock_irqsave(&task_group_lock, flags);
8764 for_each_possible_cpu(i)
8765 unregister_fair_sched_group(tg, i);
8766 list_del_rcu(&tg->siblings);
8767 spin_unlock_irqrestore(&task_group_lock, flags);
8769 /* wait for any ongoing reference to this group to finish */
8770 synchronize_sched();
8773 * Now we are free to modify the group's share on each cpu
8774 * w/o tripping rebalance_share or load_balance_fair.
8776 tg->shares = shares;
8777 for_each_possible_cpu(i) {
8781 cfs_rq_set_shares(tg->cfs_rq[i], 0);
8782 set_se_shares(tg->se[i], shares);
8786 * Enable load balance activity on this group, by inserting it back on
8787 * each cpu's rq->leaf_cfs_rq_list.
8789 spin_lock_irqsave(&task_group_lock, flags);
8790 for_each_possible_cpu(i)
8791 register_fair_sched_group(tg, i);
8792 list_add_rcu(&tg->siblings, &tg->parent->children);
8793 spin_unlock_irqrestore(&task_group_lock, flags);
8795 mutex_unlock(&shares_mutex);
8799 unsigned long sched_group_shares(struct task_group *tg)
8805 #ifdef CONFIG_RT_GROUP_SCHED
8807 * Ensure that the real time constraints are schedulable.
8809 static DEFINE_MUTEX(rt_constraints_mutex);
8811 static unsigned long to_ratio(u64 period, u64 runtime)
8813 if (runtime == RUNTIME_INF)
8816 return div64_u64(runtime << 20, period);
8819 /* Must be called with tasklist_lock held */
8820 static inline int tg_has_rt_tasks(struct task_group *tg)
8822 struct task_struct *g, *p;
8824 do_each_thread(g, p) {
8825 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
8827 } while_each_thread(g, p);
8832 struct rt_schedulable_data {
8833 struct task_group *tg;
8838 static int tg_schedulable(struct task_group *tg, void *data)
8840 struct rt_schedulable_data *d = data;
8841 struct task_group *child;
8842 unsigned long total, sum = 0;
8843 u64 period, runtime;
8845 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8846 runtime = tg->rt_bandwidth.rt_runtime;
8849 period = d->rt_period;
8850 runtime = d->rt_runtime;
8854 * Cannot have more runtime than the period.
8856 if (runtime > period && runtime != RUNTIME_INF)
8860 * Ensure we don't starve existing RT tasks.
8862 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
8865 total = to_ratio(period, runtime);
8868 * Nobody can have more than the global setting allows.
8870 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
8874 * The sum of our children's runtime should not exceed our own.
8876 list_for_each_entry_rcu(child, &tg->children, siblings) {
8877 period = ktime_to_ns(child->rt_bandwidth.rt_period);
8878 runtime = child->rt_bandwidth.rt_runtime;
8880 if (child == d->tg) {
8881 period = d->rt_period;
8882 runtime = d->rt_runtime;
8885 sum += to_ratio(period, runtime);
8894 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
8896 struct rt_schedulable_data data = {
8898 .rt_period = period,
8899 .rt_runtime = runtime,
8902 return walk_tg_tree(tg_schedulable, tg_nop, &data);
8905 static int tg_set_bandwidth(struct task_group *tg,
8906 u64 rt_period, u64 rt_runtime)
8910 mutex_lock(&rt_constraints_mutex);
8911 read_lock(&tasklist_lock);
8912 err = __rt_schedulable(tg, rt_period, rt_runtime);
8916 spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8917 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
8918 tg->rt_bandwidth.rt_runtime = rt_runtime;
8920 for_each_possible_cpu(i) {
8921 struct rt_rq *rt_rq = tg->rt_rq[i];
8923 spin_lock(&rt_rq->rt_runtime_lock);
8924 rt_rq->rt_runtime = rt_runtime;
8925 spin_unlock(&rt_rq->rt_runtime_lock);
8927 spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8929 read_unlock(&tasklist_lock);
8930 mutex_unlock(&rt_constraints_mutex);
8935 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
8937 u64 rt_runtime, rt_period;
8939 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8940 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
8941 if (rt_runtime_us < 0)
8942 rt_runtime = RUNTIME_INF;
8944 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8947 long sched_group_rt_runtime(struct task_group *tg)
8951 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
8954 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
8955 do_div(rt_runtime_us, NSEC_PER_USEC);
8956 return rt_runtime_us;
8959 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
8961 u64 rt_runtime, rt_period;
8963 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
8964 rt_runtime = tg->rt_bandwidth.rt_runtime;
8969 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8972 long sched_group_rt_period(struct task_group *tg)
8976 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
8977 do_div(rt_period_us, NSEC_PER_USEC);
8978 return rt_period_us;
8981 static int sched_rt_global_constraints(void)
8983 u64 runtime, period;
8986 if (sysctl_sched_rt_period <= 0)
8989 runtime = global_rt_runtime();
8990 period = global_rt_period();
8993 * Sanity check on the sysctl variables.
8995 if (runtime > period && runtime != RUNTIME_INF)
8998 mutex_lock(&rt_constraints_mutex);
8999 read_lock(&tasklist_lock);
9000 ret = __rt_schedulable(NULL, 0, 0);
9001 read_unlock(&tasklist_lock);
9002 mutex_unlock(&rt_constraints_mutex);
9006 #else /* !CONFIG_RT_GROUP_SCHED */
9007 static int sched_rt_global_constraints(void)
9009 unsigned long flags;
9012 if (sysctl_sched_rt_period <= 0)
9015 spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
9016 for_each_possible_cpu(i) {
9017 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
9019 spin_lock(&rt_rq->rt_runtime_lock);
9020 rt_rq->rt_runtime = global_rt_runtime();
9021 spin_unlock(&rt_rq->rt_runtime_lock);
9023 spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
9027 #endif /* CONFIG_RT_GROUP_SCHED */
9029 int sched_rt_handler(struct ctl_table *table, int write,
9030 struct file *filp, void __user *buffer, size_t *lenp,
9034 int old_period, old_runtime;
9035 static DEFINE_MUTEX(mutex);
9038 old_period = sysctl_sched_rt_period;
9039 old_runtime = sysctl_sched_rt_runtime;
9041 ret = proc_dointvec(table, write, filp, buffer, lenp, ppos);
9043 if (!ret && write) {
9044 ret = sched_rt_global_constraints();
9046 sysctl_sched_rt_period = old_period;
9047 sysctl_sched_rt_runtime = old_runtime;
9049 def_rt_bandwidth.rt_runtime = global_rt_runtime();
9050 def_rt_bandwidth.rt_period =
9051 ns_to_ktime(global_rt_period());
9054 mutex_unlock(&mutex);
9059 #ifdef CONFIG_CGROUP_SCHED
9061 /* return corresponding task_group object of a cgroup */
9062 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
9064 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
9065 struct task_group, css);
9068 static struct cgroup_subsys_state *
9069 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
9071 struct task_group *tg, *parent;
9073 if (!cgrp->parent) {
9074 /* This is early initialization for the top cgroup */
9075 return &init_task_group.css;
9078 parent = cgroup_tg(cgrp->parent);
9079 tg = sched_create_group(parent);
9081 return ERR_PTR(-ENOMEM);
9087 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9089 struct task_group *tg = cgroup_tg(cgrp);
9091 sched_destroy_group(tg);
9095 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9096 struct task_struct *tsk)
9098 #ifdef CONFIG_RT_GROUP_SCHED
9099 /* Don't accept realtime tasks when there is no way for them to run */
9100 if (rt_task(tsk) && cgroup_tg(cgrp)->rt_bandwidth.rt_runtime == 0)
9103 /* We don't support RT-tasks being in separate groups */
9104 if (tsk->sched_class != &fair_sched_class)
9112 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9113 struct cgroup *old_cont, struct task_struct *tsk)
9115 sched_move_task(tsk);
9118 #ifdef CONFIG_FAIR_GROUP_SCHED
9119 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
9122 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
9125 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
9127 struct task_group *tg = cgroup_tg(cgrp);
9129 return (u64) tg->shares;
9131 #endif /* CONFIG_FAIR_GROUP_SCHED */
9133 #ifdef CONFIG_RT_GROUP_SCHED
9134 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
9137 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
9140 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
9142 return sched_group_rt_runtime(cgroup_tg(cgrp));
9145 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
9148 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
9151 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
9153 return sched_group_rt_period(cgroup_tg(cgrp));
9155 #endif /* CONFIG_RT_GROUP_SCHED */
9157 static struct cftype cpu_files[] = {
9158 #ifdef CONFIG_FAIR_GROUP_SCHED
9161 .read_u64 = cpu_shares_read_u64,
9162 .write_u64 = cpu_shares_write_u64,
9165 #ifdef CONFIG_RT_GROUP_SCHED
9167 .name = "rt_runtime_us",
9168 .read_s64 = cpu_rt_runtime_read,
9169 .write_s64 = cpu_rt_runtime_write,
9172 .name = "rt_period_us",
9173 .read_u64 = cpu_rt_period_read_uint,
9174 .write_u64 = cpu_rt_period_write_uint,
9179 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
9181 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
9184 struct cgroup_subsys cpu_cgroup_subsys = {
9186 .create = cpu_cgroup_create,
9187 .destroy = cpu_cgroup_destroy,
9188 .can_attach = cpu_cgroup_can_attach,
9189 .attach = cpu_cgroup_attach,
9190 .populate = cpu_cgroup_populate,
9191 .subsys_id = cpu_cgroup_subsys_id,
9195 #endif /* CONFIG_CGROUP_SCHED */
9197 #ifdef CONFIG_CGROUP_CPUACCT
9200 * CPU accounting code for task groups.
9202 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
9203 * (balbir@in.ibm.com).
9206 /* track cpu usage of a group of tasks and its child groups */
9208 struct cgroup_subsys_state css;
9209 /* cpuusage holds pointer to a u64-type object on every cpu */
9211 struct cpuacct *parent;
9214 struct cgroup_subsys cpuacct_subsys;
9216 /* return cpu accounting group corresponding to this container */
9217 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
9219 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
9220 struct cpuacct, css);
9223 /* return cpu accounting group to which this task belongs */
9224 static inline struct cpuacct *task_ca(struct task_struct *tsk)
9226 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
9227 struct cpuacct, css);
9230 /* create a new cpu accounting group */
9231 static struct cgroup_subsys_state *cpuacct_create(
9232 struct cgroup_subsys *ss, struct cgroup *cgrp)
9234 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
9237 return ERR_PTR(-ENOMEM);
9239 ca->cpuusage = alloc_percpu(u64);
9240 if (!ca->cpuusage) {
9242 return ERR_PTR(-ENOMEM);
9246 ca->parent = cgroup_ca(cgrp->parent);
9251 /* destroy an existing cpu accounting group */
9253 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9255 struct cpuacct *ca = cgroup_ca(cgrp);
9257 free_percpu(ca->cpuusage);
9261 /* return total cpu usage (in nanoseconds) of a group */
9262 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
9264 struct cpuacct *ca = cgroup_ca(cgrp);
9265 u64 totalcpuusage = 0;
9268 for_each_possible_cpu(i) {
9269 u64 *cpuusage = percpu_ptr(ca->cpuusage, i);
9272 * Take rq->lock to make 64-bit addition safe on 32-bit
9275 spin_lock_irq(&cpu_rq(i)->lock);
9276 totalcpuusage += *cpuusage;
9277 spin_unlock_irq(&cpu_rq(i)->lock);
9280 return totalcpuusage;
9283 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
9286 struct cpuacct *ca = cgroup_ca(cgrp);
9295 for_each_possible_cpu(i) {
9296 u64 *cpuusage = percpu_ptr(ca->cpuusage, i);
9298 spin_lock_irq(&cpu_rq(i)->lock);
9300 spin_unlock_irq(&cpu_rq(i)->lock);
9306 static struct cftype files[] = {
9309 .read_u64 = cpuusage_read,
9310 .write_u64 = cpuusage_write,
9314 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
9316 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
9320 * charge this task's execution time to its accounting group.
9322 * called with rq->lock held.
9324 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
9329 if (!cpuacct_subsys.active)
9332 cpu = task_cpu(tsk);
9335 for (; ca; ca = ca->parent) {
9336 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9337 *cpuusage += cputime;
9341 struct cgroup_subsys cpuacct_subsys = {
9343 .create = cpuacct_create,
9344 .destroy = cpuacct_destroy,
9345 .populate = cpuacct_populate,
9346 .subsys_id = cpuacct_subsys_id,
9348 #endif /* CONFIG_CGROUP_CPUACCT */