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 static void double_rq_lock(struct rq *rq1, struct rq *rq2);
132 * Divide a load by a sched group cpu_power : (load / sg->__cpu_power)
133 * Since cpu_power is a 'constant', we can use a reciprocal divide.
135 static inline u32 sg_div_cpu_power(const struct sched_group *sg, u32 load)
137 return reciprocal_divide(load, sg->reciprocal_cpu_power);
141 * Each time a sched group cpu_power is changed,
142 * we must compute its reciprocal value
144 static inline void sg_inc_cpu_power(struct sched_group *sg, u32 val)
146 sg->__cpu_power += val;
147 sg->reciprocal_cpu_power = reciprocal_value(sg->__cpu_power);
151 static inline int rt_policy(int policy)
153 if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR))
158 static inline int task_has_rt_policy(struct task_struct *p)
160 return rt_policy(p->policy);
164 * This is the priority-queue data structure of the RT scheduling class:
166 struct rt_prio_array {
167 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
168 struct list_head queue[MAX_RT_PRIO];
171 struct rt_bandwidth {
172 /* nests inside the rq lock: */
173 spinlock_t rt_runtime_lock;
176 struct hrtimer rt_period_timer;
179 static struct rt_bandwidth def_rt_bandwidth;
181 static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun);
183 static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer)
185 struct rt_bandwidth *rt_b =
186 container_of(timer, struct rt_bandwidth, rt_period_timer);
192 now = hrtimer_cb_get_time(timer);
193 overrun = hrtimer_forward(timer, now, rt_b->rt_period);
198 idle = do_sched_rt_period_timer(rt_b, overrun);
201 return idle ? HRTIMER_NORESTART : HRTIMER_RESTART;
205 void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime)
207 rt_b->rt_period = ns_to_ktime(period);
208 rt_b->rt_runtime = runtime;
210 spin_lock_init(&rt_b->rt_runtime_lock);
212 hrtimer_init(&rt_b->rt_period_timer,
213 CLOCK_MONOTONIC, HRTIMER_MODE_REL);
214 rt_b->rt_period_timer.function = sched_rt_period_timer;
217 static inline int rt_bandwidth_enabled(void)
219 return sysctl_sched_rt_runtime >= 0;
222 static void start_rt_bandwidth(struct rt_bandwidth *rt_b)
226 if (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF)
229 if (hrtimer_active(&rt_b->rt_period_timer))
232 spin_lock(&rt_b->rt_runtime_lock);
234 if (hrtimer_active(&rt_b->rt_period_timer))
237 now = hrtimer_cb_get_time(&rt_b->rt_period_timer);
238 hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period);
239 hrtimer_start_expires(&rt_b->rt_period_timer,
242 spin_unlock(&rt_b->rt_runtime_lock);
245 #ifdef CONFIG_RT_GROUP_SCHED
246 static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b)
248 hrtimer_cancel(&rt_b->rt_period_timer);
253 * sched_domains_mutex serializes calls to arch_init_sched_domains,
254 * detach_destroy_domains and partition_sched_domains.
256 static DEFINE_MUTEX(sched_domains_mutex);
258 #ifdef CONFIG_GROUP_SCHED
260 #include <linux/cgroup.h>
264 static LIST_HEAD(task_groups);
266 /* task group related information */
268 #ifdef CONFIG_CGROUP_SCHED
269 struct cgroup_subsys_state css;
272 #ifdef CONFIG_USER_SCHED
276 #ifdef CONFIG_FAIR_GROUP_SCHED
277 /* schedulable entities of this group on each cpu */
278 struct sched_entity **se;
279 /* runqueue "owned" by this group on each cpu */
280 struct cfs_rq **cfs_rq;
281 unsigned long shares;
284 #ifdef CONFIG_RT_GROUP_SCHED
285 struct sched_rt_entity **rt_se;
286 struct rt_rq **rt_rq;
288 struct rt_bandwidth rt_bandwidth;
292 struct list_head list;
294 struct task_group *parent;
295 struct list_head siblings;
296 struct list_head children;
299 #ifdef CONFIG_USER_SCHED
301 /* Helper function to pass uid information to create_sched_user() */
302 void set_tg_uid(struct user_struct *user)
304 user->tg->uid = user->uid;
309 * Every UID task group (including init_task_group aka UID-0) will
310 * be a child to this group.
312 struct task_group root_task_group;
314 #ifdef CONFIG_FAIR_GROUP_SCHED
315 /* Default task group's sched entity on each cpu */
316 static DEFINE_PER_CPU(struct sched_entity, init_sched_entity);
317 /* Default task group's cfs_rq on each cpu */
318 static DEFINE_PER_CPU(struct cfs_rq, init_cfs_rq) ____cacheline_aligned_in_smp;
319 #endif /* CONFIG_FAIR_GROUP_SCHED */
321 #ifdef CONFIG_RT_GROUP_SCHED
322 static DEFINE_PER_CPU(struct sched_rt_entity, init_sched_rt_entity);
323 static DEFINE_PER_CPU(struct rt_rq, init_rt_rq) ____cacheline_aligned_in_smp;
324 #endif /* CONFIG_RT_GROUP_SCHED */
325 #else /* !CONFIG_USER_SCHED */
326 #define root_task_group init_task_group
327 #endif /* CONFIG_USER_SCHED */
329 /* task_group_lock serializes add/remove of task groups and also changes to
330 * a task group's cpu shares.
332 static DEFINE_SPINLOCK(task_group_lock);
335 static int root_task_group_empty(void)
337 return list_empty(&root_task_group.children);
341 #ifdef CONFIG_FAIR_GROUP_SCHED
342 #ifdef CONFIG_USER_SCHED
343 # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD)
344 #else /* !CONFIG_USER_SCHED */
345 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
346 #endif /* CONFIG_USER_SCHED */
349 * A weight of 0 or 1 can cause arithmetics problems.
350 * A weight of a cfs_rq is the sum of weights of which entities
351 * are queued on this cfs_rq, so a weight of a entity should not be
352 * too large, so as the shares value of a task group.
353 * (The default weight is 1024 - so there's no practical
354 * limitation from this.)
357 #define MAX_SHARES (1UL << 18)
359 static int init_task_group_load = INIT_TASK_GROUP_LOAD;
362 /* Default task group.
363 * Every task in system belong to this group at bootup.
365 struct task_group init_task_group;
367 /* return group to which a task belongs */
368 static inline struct task_group *task_group(struct task_struct *p)
370 struct task_group *tg;
372 #ifdef CONFIG_USER_SCHED
374 tg = __task_cred(p)->user->tg;
376 #elif defined(CONFIG_CGROUP_SCHED)
377 tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id),
378 struct task_group, css);
380 tg = &init_task_group;
385 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
386 static inline void set_task_rq(struct task_struct *p, unsigned int cpu)
388 #ifdef CONFIG_FAIR_GROUP_SCHED
389 p->se.cfs_rq = task_group(p)->cfs_rq[cpu];
390 p->se.parent = task_group(p)->se[cpu];
393 #ifdef CONFIG_RT_GROUP_SCHED
394 p->rt.rt_rq = task_group(p)->rt_rq[cpu];
395 p->rt.parent = task_group(p)->rt_se[cpu];
402 static int root_task_group_empty(void)
408 static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { }
409 static inline struct task_group *task_group(struct task_struct *p)
414 #endif /* CONFIG_GROUP_SCHED */
416 /* CFS-related fields in a runqueue */
418 struct load_weight load;
419 unsigned long nr_running;
424 struct rb_root tasks_timeline;
425 struct rb_node *rb_leftmost;
427 struct list_head tasks;
428 struct list_head *balance_iterator;
431 * 'curr' points to currently running entity on this cfs_rq.
432 * It is set to NULL otherwise (i.e when none are currently running).
434 struct sched_entity *curr, *next, *last;
436 unsigned int nr_spread_over;
438 #ifdef CONFIG_FAIR_GROUP_SCHED
439 struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */
442 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
443 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
444 * (like users, containers etc.)
446 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
447 * list is used during load balance.
449 struct list_head leaf_cfs_rq_list;
450 struct task_group *tg; /* group that "owns" this runqueue */
454 * the part of load.weight contributed by tasks
456 unsigned long task_weight;
459 * h_load = weight * f(tg)
461 * Where f(tg) is the recursive weight fraction assigned to
464 unsigned long h_load;
467 * this cpu's part of tg->shares
469 unsigned long shares;
472 * load.weight at the time we set shares
474 unsigned long rq_weight;
479 /* Real-Time classes' related field in a runqueue: */
481 struct rt_prio_array active;
482 unsigned long rt_nr_running;
483 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
485 int curr; /* highest queued rt task prio */
487 int next; /* next highest */
492 unsigned long rt_nr_migratory;
494 struct plist_head pushable_tasks;
499 /* Nests inside the rq lock: */
500 spinlock_t rt_runtime_lock;
502 #ifdef CONFIG_RT_GROUP_SCHED
503 unsigned long rt_nr_boosted;
506 struct list_head leaf_rt_rq_list;
507 struct task_group *tg;
508 struct sched_rt_entity *rt_se;
515 * We add the notion of a root-domain which will be used to define per-domain
516 * variables. Each exclusive cpuset essentially defines an island domain by
517 * fully partitioning the member cpus from any other cpuset. Whenever a new
518 * exclusive cpuset is created, we also create and attach a new root-domain
525 cpumask_var_t online;
528 * The "RT overload" flag: it gets set if a CPU has more than
529 * one runnable RT task.
531 cpumask_var_t rto_mask;
534 struct cpupri cpupri;
536 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
538 * Preferred wake up cpu nominated by sched_mc balance that will be
539 * used when most cpus are idle in the system indicating overall very
540 * low system utilisation. Triggered at POWERSAVINGS_BALANCE_WAKEUP(2)
542 unsigned int sched_mc_preferred_wakeup_cpu;
547 * By default the system creates a single root-domain with all cpus as
548 * members (mimicking the global state we have today).
550 static struct root_domain def_root_domain;
555 * This is the main, per-CPU runqueue data structure.
557 * Locking rule: those places that want to lock multiple runqueues
558 * (such as the load balancing or the thread migration code), lock
559 * acquire operations must be ordered by ascending &runqueue.
566 * nr_running and cpu_load should be in the same cacheline because
567 * remote CPUs use both these fields when doing load calculation.
569 unsigned long nr_running;
570 #define CPU_LOAD_IDX_MAX 5
571 unsigned long cpu_load[CPU_LOAD_IDX_MAX];
573 unsigned long last_tick_seen;
574 unsigned char in_nohz_recently;
576 /* capture load from *all* tasks on this cpu: */
577 struct load_weight load;
578 unsigned long nr_load_updates;
584 #ifdef CONFIG_FAIR_GROUP_SCHED
585 /* list of leaf cfs_rq on this cpu: */
586 struct list_head leaf_cfs_rq_list;
588 #ifdef CONFIG_RT_GROUP_SCHED
589 struct list_head leaf_rt_rq_list;
593 * This is part of a global counter where only the total sum
594 * over all CPUs matters. A task can increase this counter on
595 * one CPU and if it got migrated afterwards it may decrease
596 * it on another CPU. Always updated under the runqueue lock:
598 unsigned long nr_uninterruptible;
600 struct task_struct *curr, *idle;
601 unsigned long next_balance;
602 struct mm_struct *prev_mm;
609 struct root_domain *rd;
610 struct sched_domain *sd;
612 unsigned char idle_at_tick;
613 /* For active balancing */
616 /* cpu of this runqueue: */
620 unsigned long avg_load_per_task;
622 struct task_struct *migration_thread;
623 struct list_head migration_queue;
626 #ifdef CONFIG_SCHED_HRTICK
628 int hrtick_csd_pending;
629 struct call_single_data hrtick_csd;
631 struct hrtimer hrtick_timer;
634 #ifdef CONFIG_SCHEDSTATS
636 struct sched_info rq_sched_info;
637 unsigned long long rq_cpu_time;
638 /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */
640 /* sys_sched_yield() stats */
641 unsigned int yld_exp_empty;
642 unsigned int yld_act_empty;
643 unsigned int yld_both_empty;
644 unsigned int yld_count;
646 /* schedule() stats */
647 unsigned int sched_switch;
648 unsigned int sched_count;
649 unsigned int sched_goidle;
651 /* try_to_wake_up() stats */
652 unsigned int ttwu_count;
653 unsigned int ttwu_local;
656 unsigned int bkl_count;
660 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
662 static inline void check_preempt_curr(struct rq *rq, struct task_struct *p, int sync)
664 rq->curr->sched_class->check_preempt_curr(rq, p, sync);
667 static inline int cpu_of(struct rq *rq)
677 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
678 * See detach_destroy_domains: synchronize_sched for details.
680 * The domain tree of any CPU may only be accessed from within
681 * preempt-disabled sections.
683 #define for_each_domain(cpu, __sd) \
684 for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
686 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
687 #define this_rq() (&__get_cpu_var(runqueues))
688 #define task_rq(p) cpu_rq(task_cpu(p))
689 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
691 static inline void update_rq_clock(struct rq *rq)
693 rq->clock = sched_clock_cpu(cpu_of(rq));
697 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
699 #ifdef CONFIG_SCHED_DEBUG
700 # define const_debug __read_mostly
702 # define const_debug static const
708 * Returns true if the current cpu runqueue is locked.
709 * This interface allows printk to be called with the runqueue lock
710 * held and know whether or not it is OK to wake up the klogd.
712 int runqueue_is_locked(void)
715 struct rq *rq = cpu_rq(cpu);
718 ret = spin_is_locked(&rq->lock);
724 * Debugging: various feature bits
727 #define SCHED_FEAT(name, enabled) \
728 __SCHED_FEAT_##name ,
731 #include "sched_features.h"
736 #define SCHED_FEAT(name, enabled) \
737 (1UL << __SCHED_FEAT_##name) * enabled |
739 const_debug unsigned int sysctl_sched_features =
740 #include "sched_features.h"
745 #ifdef CONFIG_SCHED_DEBUG
746 #define SCHED_FEAT(name, enabled) \
749 static __read_mostly char *sched_feat_names[] = {
750 #include "sched_features.h"
756 static int sched_feat_show(struct seq_file *m, void *v)
760 for (i = 0; sched_feat_names[i]; i++) {
761 if (!(sysctl_sched_features & (1UL << i)))
763 seq_printf(m, "%s ", sched_feat_names[i]);
771 sched_feat_write(struct file *filp, const char __user *ubuf,
772 size_t cnt, loff_t *ppos)
782 if (copy_from_user(&buf, ubuf, cnt))
787 if (strncmp(buf, "NO_", 3) == 0) {
792 for (i = 0; sched_feat_names[i]; i++) {
793 int len = strlen(sched_feat_names[i]);
795 if (strncmp(cmp, sched_feat_names[i], len) == 0) {
797 sysctl_sched_features &= ~(1UL << i);
799 sysctl_sched_features |= (1UL << i);
804 if (!sched_feat_names[i])
812 static int sched_feat_open(struct inode *inode, struct file *filp)
814 return single_open(filp, sched_feat_show, NULL);
817 static struct file_operations sched_feat_fops = {
818 .open = sched_feat_open,
819 .write = sched_feat_write,
822 .release = single_release,
825 static __init int sched_init_debug(void)
827 debugfs_create_file("sched_features", 0644, NULL, NULL,
832 late_initcall(sched_init_debug);
836 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
839 * Number of tasks to iterate in a single balance run.
840 * Limited because this is done with IRQs disabled.
842 const_debug unsigned int sysctl_sched_nr_migrate = 32;
845 * ratelimit for updating the group shares.
848 unsigned int sysctl_sched_shares_ratelimit = 250000;
851 * Inject some fuzzyness into changing the per-cpu group shares
852 * this avoids remote rq-locks at the expense of fairness.
855 unsigned int sysctl_sched_shares_thresh = 4;
858 * period over which we measure -rt task cpu usage in us.
861 unsigned int sysctl_sched_rt_period = 1000000;
863 static __read_mostly int scheduler_running;
866 * part of the period that we allow rt tasks to run in us.
869 int sysctl_sched_rt_runtime = 950000;
871 static inline u64 global_rt_period(void)
873 return (u64)sysctl_sched_rt_period * NSEC_PER_USEC;
876 static inline u64 global_rt_runtime(void)
878 if (sysctl_sched_rt_runtime < 0)
881 return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC;
884 #ifndef prepare_arch_switch
885 # define prepare_arch_switch(next) do { } while (0)
887 #ifndef finish_arch_switch
888 # define finish_arch_switch(prev) do { } while (0)
891 static inline int task_current(struct rq *rq, struct task_struct *p)
893 return rq->curr == p;
896 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
897 static inline int task_running(struct rq *rq, struct task_struct *p)
899 return task_current(rq, p);
902 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
906 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
908 #ifdef CONFIG_DEBUG_SPINLOCK
909 /* this is a valid case when another task releases the spinlock */
910 rq->lock.owner = current;
913 * If we are tracking spinlock dependencies then we have to
914 * fix up the runqueue lock - which gets 'carried over' from
917 spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_);
919 spin_unlock_irq(&rq->lock);
922 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
923 static inline int task_running(struct rq *rq, struct task_struct *p)
928 return task_current(rq, p);
932 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
936 * We can optimise this out completely for !SMP, because the
937 * SMP rebalancing from interrupt is the only thing that cares
942 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
943 spin_unlock_irq(&rq->lock);
945 spin_unlock(&rq->lock);
949 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
953 * After ->oncpu is cleared, the task can be moved to a different CPU.
954 * We must ensure this doesn't happen until the switch is completely
960 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
964 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
967 * __task_rq_lock - lock the runqueue a given task resides on.
968 * Must be called interrupts disabled.
970 static inline struct rq *__task_rq_lock(struct task_struct *p)
974 struct rq *rq = task_rq(p);
975 spin_lock(&rq->lock);
976 if (likely(rq == task_rq(p)))
978 spin_unlock(&rq->lock);
983 * task_rq_lock - lock the runqueue a given task resides on and disable
984 * interrupts. Note the ordering: we can safely lookup the task_rq without
985 * explicitly disabling preemption.
987 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
993 local_irq_save(*flags);
995 spin_lock(&rq->lock);
996 if (likely(rq == task_rq(p)))
998 spin_unlock_irqrestore(&rq->lock, *flags);
1002 void task_rq_unlock_wait(struct task_struct *p)
1004 struct rq *rq = task_rq(p);
1006 smp_mb(); /* spin-unlock-wait is not a full memory barrier */
1007 spin_unlock_wait(&rq->lock);
1010 static void __task_rq_unlock(struct rq *rq)
1011 __releases(rq->lock)
1013 spin_unlock(&rq->lock);
1016 static inline void task_rq_unlock(struct rq *rq, unsigned long *flags)
1017 __releases(rq->lock)
1019 spin_unlock_irqrestore(&rq->lock, *flags);
1023 * this_rq_lock - lock this runqueue and disable interrupts.
1025 static struct rq *this_rq_lock(void)
1026 __acquires(rq->lock)
1030 local_irq_disable();
1032 spin_lock(&rq->lock);
1037 #ifdef CONFIG_SCHED_HRTICK
1039 * Use HR-timers to deliver accurate preemption points.
1041 * Its all a bit involved since we cannot program an hrt while holding the
1042 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1045 * When we get rescheduled we reprogram the hrtick_timer outside of the
1051 * - enabled by features
1052 * - hrtimer is actually high res
1054 static inline int hrtick_enabled(struct rq *rq)
1056 if (!sched_feat(HRTICK))
1058 if (!cpu_active(cpu_of(rq)))
1060 return hrtimer_is_hres_active(&rq->hrtick_timer);
1063 static void hrtick_clear(struct rq *rq)
1065 if (hrtimer_active(&rq->hrtick_timer))
1066 hrtimer_cancel(&rq->hrtick_timer);
1070 * High-resolution timer tick.
1071 * Runs from hardirq context with interrupts disabled.
1073 static enum hrtimer_restart hrtick(struct hrtimer *timer)
1075 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
1077 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
1079 spin_lock(&rq->lock);
1080 update_rq_clock(rq);
1081 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
1082 spin_unlock(&rq->lock);
1084 return HRTIMER_NORESTART;
1089 * called from hardirq (IPI) context
1091 static void __hrtick_start(void *arg)
1093 struct rq *rq = arg;
1095 spin_lock(&rq->lock);
1096 hrtimer_restart(&rq->hrtick_timer);
1097 rq->hrtick_csd_pending = 0;
1098 spin_unlock(&rq->lock);
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 struct hrtimer *timer = &rq->hrtick_timer;
1109 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
1111 hrtimer_set_expires(timer, time);
1113 if (rq == this_rq()) {
1114 hrtimer_restart(timer);
1115 } else if (!rq->hrtick_csd_pending) {
1116 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd);
1117 rq->hrtick_csd_pending = 1;
1122 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
1124 int cpu = (int)(long)hcpu;
1127 case CPU_UP_CANCELED:
1128 case CPU_UP_CANCELED_FROZEN:
1129 case CPU_DOWN_PREPARE:
1130 case CPU_DOWN_PREPARE_FROZEN:
1132 case CPU_DEAD_FROZEN:
1133 hrtick_clear(cpu_rq(cpu));
1140 static __init void init_hrtick(void)
1142 hotcpu_notifier(hotplug_hrtick, 0);
1146 * Called to set the hrtick timer state.
1148 * called with rq->lock held and irqs disabled
1150 static void hrtick_start(struct rq *rq, u64 delay)
1152 hrtimer_start(&rq->hrtick_timer, ns_to_ktime(delay), HRTIMER_MODE_REL);
1155 static inline void init_hrtick(void)
1158 #endif /* CONFIG_SMP */
1160 static void init_rq_hrtick(struct rq *rq)
1163 rq->hrtick_csd_pending = 0;
1165 rq->hrtick_csd.flags = 0;
1166 rq->hrtick_csd.func = __hrtick_start;
1167 rq->hrtick_csd.info = rq;
1170 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1171 rq->hrtick_timer.function = hrtick;
1173 #else /* CONFIG_SCHED_HRTICK */
1174 static inline void hrtick_clear(struct rq *rq)
1178 static inline void init_rq_hrtick(struct rq *rq)
1182 static inline void init_hrtick(void)
1185 #endif /* CONFIG_SCHED_HRTICK */
1188 * resched_task - mark a task 'to be rescheduled now'.
1190 * On UP this means the setting of the need_resched flag, on SMP it
1191 * might also involve a cross-CPU call to trigger the scheduler on
1196 #ifndef tsk_is_polling
1197 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1200 static void resched_task(struct task_struct *p)
1204 assert_spin_locked(&task_rq(p)->lock);
1206 if (test_tsk_need_resched(p))
1209 set_tsk_need_resched(p);
1212 if (cpu == smp_processor_id())
1215 /* NEED_RESCHED must be visible before we test polling */
1217 if (!tsk_is_polling(p))
1218 smp_send_reschedule(cpu);
1221 static void resched_cpu(int cpu)
1223 struct rq *rq = cpu_rq(cpu);
1224 unsigned long flags;
1226 if (!spin_trylock_irqsave(&rq->lock, flags))
1228 resched_task(cpu_curr(cpu));
1229 spin_unlock_irqrestore(&rq->lock, flags);
1234 * When add_timer_on() enqueues a timer into the timer wheel of an
1235 * idle CPU then this timer might expire before the next timer event
1236 * which is scheduled to wake up that CPU. In case of a completely
1237 * idle system the next event might even be infinite time into the
1238 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1239 * leaves the inner idle loop so the newly added timer is taken into
1240 * account when the CPU goes back to idle and evaluates the timer
1241 * wheel for the next timer event.
1243 void wake_up_idle_cpu(int cpu)
1245 struct rq *rq = cpu_rq(cpu);
1247 if (cpu == smp_processor_id())
1251 * This is safe, as this function is called with the timer
1252 * wheel base lock of (cpu) held. When the CPU is on the way
1253 * to idle and has not yet set rq->curr to idle then it will
1254 * be serialized on the timer wheel base lock and take the new
1255 * timer into account automatically.
1257 if (rq->curr != rq->idle)
1261 * We can set TIF_RESCHED on the idle task of the other CPU
1262 * lockless. The worst case is that the other CPU runs the
1263 * idle task through an additional NOOP schedule()
1265 set_tsk_need_resched(rq->idle);
1267 /* NEED_RESCHED must be visible before we test polling */
1269 if (!tsk_is_polling(rq->idle))
1270 smp_send_reschedule(cpu);
1272 #endif /* CONFIG_NO_HZ */
1274 #else /* !CONFIG_SMP */
1275 static void resched_task(struct task_struct *p)
1277 assert_spin_locked(&task_rq(p)->lock);
1278 set_tsk_need_resched(p);
1280 #endif /* CONFIG_SMP */
1282 #if BITS_PER_LONG == 32
1283 # define WMULT_CONST (~0UL)
1285 # define WMULT_CONST (1UL << 32)
1288 #define WMULT_SHIFT 32
1291 * Shift right and round:
1293 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1296 * delta *= weight / lw
1298 static unsigned long
1299 calc_delta_mine(unsigned long delta_exec, unsigned long weight,
1300 struct load_weight *lw)
1304 if (!lw->inv_weight) {
1305 if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST))
1308 lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2)
1312 tmp = (u64)delta_exec * weight;
1314 * Check whether we'd overflow the 64-bit multiplication:
1316 if (unlikely(tmp > WMULT_CONST))
1317 tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight,
1320 tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT);
1322 return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX);
1325 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
1331 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
1338 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1339 * of tasks with abnormal "nice" values across CPUs the contribution that
1340 * each task makes to its run queue's load is weighted according to its
1341 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1342 * scaled version of the new time slice allocation that they receive on time
1346 #define WEIGHT_IDLEPRIO 3
1347 #define WMULT_IDLEPRIO 1431655765
1350 * Nice levels are multiplicative, with a gentle 10% change for every
1351 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1352 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1353 * that remained on nice 0.
1355 * The "10% effect" is relative and cumulative: from _any_ nice level,
1356 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1357 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1358 * If a task goes up by ~10% and another task goes down by ~10% then
1359 * the relative distance between them is ~25%.)
1361 static const int prio_to_weight[40] = {
1362 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1363 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1364 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1365 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1366 /* 0 */ 1024, 820, 655, 526, 423,
1367 /* 5 */ 335, 272, 215, 172, 137,
1368 /* 10 */ 110, 87, 70, 56, 45,
1369 /* 15 */ 36, 29, 23, 18, 15,
1373 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1375 * In cases where the weight does not change often, we can use the
1376 * precalculated inverse to speed up arithmetics by turning divisions
1377 * into multiplications:
1379 static const u32 prio_to_wmult[40] = {
1380 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1381 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1382 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1383 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1384 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1385 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1386 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1387 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1390 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup);
1393 * runqueue iterator, to support SMP load-balancing between different
1394 * scheduling classes, without having to expose their internal data
1395 * structures to the load-balancing proper:
1397 struct rq_iterator {
1399 struct task_struct *(*start)(void *);
1400 struct task_struct *(*next)(void *);
1404 static unsigned long
1405 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
1406 unsigned long max_load_move, struct sched_domain *sd,
1407 enum cpu_idle_type idle, int *all_pinned,
1408 int *this_best_prio, struct rq_iterator *iterator);
1411 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
1412 struct sched_domain *sd, enum cpu_idle_type idle,
1413 struct rq_iterator *iterator);
1416 #ifdef CONFIG_CGROUP_CPUACCT
1417 static void cpuacct_charge(struct task_struct *tsk, u64 cputime);
1419 static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {}
1422 static inline void inc_cpu_load(struct rq *rq, unsigned long load)
1424 update_load_add(&rq->load, load);
1427 static inline void dec_cpu_load(struct rq *rq, unsigned long load)
1429 update_load_sub(&rq->load, load);
1432 #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED)
1433 typedef int (*tg_visitor)(struct task_group *, void *);
1436 * Iterate the full tree, calling @down when first entering a node and @up when
1437 * leaving it for the final time.
1439 static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
1441 struct task_group *parent, *child;
1445 parent = &root_task_group;
1447 ret = (*down)(parent, data);
1450 list_for_each_entry_rcu(child, &parent->children, siblings) {
1457 ret = (*up)(parent, data);
1462 parent = parent->parent;
1471 static int tg_nop(struct task_group *tg, void *data)
1478 static unsigned long source_load(int cpu, int type);
1479 static unsigned long target_load(int cpu, int type);
1480 static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd);
1482 static unsigned long cpu_avg_load_per_task(int cpu)
1484 struct rq *rq = cpu_rq(cpu);
1485 unsigned long nr_running = ACCESS_ONCE(rq->nr_running);
1488 rq->avg_load_per_task = rq->load.weight / nr_running;
1490 rq->avg_load_per_task = 0;
1492 return rq->avg_load_per_task;
1495 #ifdef CONFIG_FAIR_GROUP_SCHED
1497 static void __set_se_shares(struct sched_entity *se, unsigned long shares);
1500 * Calculate and set the cpu's group shares.
1503 update_group_shares_cpu(struct task_group *tg, int cpu,
1504 unsigned long sd_shares, unsigned long sd_rq_weight)
1506 unsigned long shares;
1507 unsigned long rq_weight;
1512 rq_weight = tg->cfs_rq[cpu]->rq_weight;
1515 * \Sum shares * rq_weight
1516 * shares = -----------------------
1520 shares = (sd_shares * rq_weight) / sd_rq_weight;
1521 shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES);
1523 if (abs(shares - tg->se[cpu]->load.weight) >
1524 sysctl_sched_shares_thresh) {
1525 struct rq *rq = cpu_rq(cpu);
1526 unsigned long flags;
1528 spin_lock_irqsave(&rq->lock, flags);
1529 tg->cfs_rq[cpu]->shares = shares;
1531 __set_se_shares(tg->se[cpu], shares);
1532 spin_unlock_irqrestore(&rq->lock, flags);
1537 * Re-compute the task group their per cpu shares over the given domain.
1538 * This needs to be done in a bottom-up fashion because the rq weight of a
1539 * parent group depends on the shares of its child groups.
1541 static int tg_shares_up(struct task_group *tg, void *data)
1543 unsigned long weight, rq_weight = 0;
1544 unsigned long shares = 0;
1545 struct sched_domain *sd = data;
1548 for_each_cpu(i, sched_domain_span(sd)) {
1550 * If there are currently no tasks on the cpu pretend there
1551 * is one of average load so that when a new task gets to
1552 * run here it will not get delayed by group starvation.
1554 weight = tg->cfs_rq[i]->load.weight;
1556 weight = NICE_0_LOAD;
1558 tg->cfs_rq[i]->rq_weight = weight;
1559 rq_weight += weight;
1560 shares += tg->cfs_rq[i]->shares;
1563 if ((!shares && rq_weight) || shares > tg->shares)
1564 shares = tg->shares;
1566 if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE))
1567 shares = tg->shares;
1569 for_each_cpu(i, sched_domain_span(sd))
1570 update_group_shares_cpu(tg, i, shares, rq_weight);
1576 * Compute the cpu's hierarchical load factor for each task group.
1577 * This needs to be done in a top-down fashion because the load of a child
1578 * group is a fraction of its parents load.
1580 static int tg_load_down(struct task_group *tg, void *data)
1583 long cpu = (long)data;
1586 load = cpu_rq(cpu)->load.weight;
1588 load = tg->parent->cfs_rq[cpu]->h_load;
1589 load *= tg->cfs_rq[cpu]->shares;
1590 load /= tg->parent->cfs_rq[cpu]->load.weight + 1;
1593 tg->cfs_rq[cpu]->h_load = load;
1598 static void update_shares(struct sched_domain *sd)
1600 u64 now = cpu_clock(raw_smp_processor_id());
1601 s64 elapsed = now - sd->last_update;
1603 if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) {
1604 sd->last_update = now;
1605 walk_tg_tree(tg_nop, tg_shares_up, sd);
1609 static void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1611 spin_unlock(&rq->lock);
1613 spin_lock(&rq->lock);
1616 static void update_h_load(long cpu)
1618 walk_tg_tree(tg_load_down, tg_nop, (void *)cpu);
1623 static inline void update_shares(struct sched_domain *sd)
1627 static inline void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1633 #ifdef CONFIG_PREEMPT
1636 * fair double_lock_balance: Safely acquires both rq->locks in a fair
1637 * way at the expense of forcing extra atomic operations in all
1638 * invocations. This assures that the double_lock is acquired using the
1639 * same underlying policy as the spinlock_t on this architecture, which
1640 * reduces latency compared to the unfair variant below. However, it
1641 * also adds more overhead and therefore may reduce throughput.
1643 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1644 __releases(this_rq->lock)
1645 __acquires(busiest->lock)
1646 __acquires(this_rq->lock)
1648 spin_unlock(&this_rq->lock);
1649 double_rq_lock(this_rq, busiest);
1656 * Unfair double_lock_balance: Optimizes throughput at the expense of
1657 * latency by eliminating extra atomic operations when the locks are
1658 * already in proper order on entry. This favors lower cpu-ids and will
1659 * grant the double lock to lower cpus over higher ids under contention,
1660 * regardless of entry order into the function.
1662 static int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1663 __releases(this_rq->lock)
1664 __acquires(busiest->lock)
1665 __acquires(this_rq->lock)
1669 if (unlikely(!spin_trylock(&busiest->lock))) {
1670 if (busiest < this_rq) {
1671 spin_unlock(&this_rq->lock);
1672 spin_lock(&busiest->lock);
1673 spin_lock_nested(&this_rq->lock, SINGLE_DEPTH_NESTING);
1676 spin_lock_nested(&busiest->lock, SINGLE_DEPTH_NESTING);
1681 #endif /* CONFIG_PREEMPT */
1684 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
1686 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
1688 if (unlikely(!irqs_disabled())) {
1689 /* printk() doesn't work good under rq->lock */
1690 spin_unlock(&this_rq->lock);
1694 return _double_lock_balance(this_rq, busiest);
1697 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
1698 __releases(busiest->lock)
1700 spin_unlock(&busiest->lock);
1701 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
1705 #ifdef CONFIG_FAIR_GROUP_SCHED
1706 static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares)
1709 cfs_rq->shares = shares;
1714 #include "sched_stats.h"
1715 #include "sched_idletask.c"
1716 #include "sched_fair.c"
1717 #include "sched_rt.c"
1718 #ifdef CONFIG_SCHED_DEBUG
1719 # include "sched_debug.c"
1722 #define sched_class_highest (&rt_sched_class)
1723 #define for_each_class(class) \
1724 for (class = sched_class_highest; class; class = class->next)
1726 static void inc_nr_running(struct rq *rq)
1731 static void dec_nr_running(struct rq *rq)
1736 static void set_load_weight(struct task_struct *p)
1738 if (task_has_rt_policy(p)) {
1739 p->se.load.weight = prio_to_weight[0] * 2;
1740 p->se.load.inv_weight = prio_to_wmult[0] >> 1;
1745 * SCHED_IDLE tasks get minimal weight:
1747 if (p->policy == SCHED_IDLE) {
1748 p->se.load.weight = WEIGHT_IDLEPRIO;
1749 p->se.load.inv_weight = WMULT_IDLEPRIO;
1753 p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO];
1754 p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO];
1757 static void update_avg(u64 *avg, u64 sample)
1759 s64 diff = sample - *avg;
1763 static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup)
1766 p->se.start_runtime = p->se.sum_exec_runtime;
1768 sched_info_queued(p);
1769 p->sched_class->enqueue_task(rq, p, wakeup);
1773 static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep)
1776 if (p->se.last_wakeup) {
1777 update_avg(&p->se.avg_overlap,
1778 p->se.sum_exec_runtime - p->se.last_wakeup);
1779 p->se.last_wakeup = 0;
1781 update_avg(&p->se.avg_wakeup,
1782 sysctl_sched_wakeup_granularity);
1786 sched_info_dequeued(p);
1787 p->sched_class->dequeue_task(rq, p, sleep);
1792 * __normal_prio - return the priority that is based on the static prio
1794 static inline int __normal_prio(struct task_struct *p)
1796 return p->static_prio;
1800 * Calculate the expected normal priority: i.e. priority
1801 * without taking RT-inheritance into account. Might be
1802 * boosted by interactivity modifiers. Changes upon fork,
1803 * setprio syscalls, and whenever the interactivity
1804 * estimator recalculates.
1806 static inline int normal_prio(struct task_struct *p)
1810 if (task_has_rt_policy(p))
1811 prio = MAX_RT_PRIO-1 - p->rt_priority;
1813 prio = __normal_prio(p);
1818 * Calculate the current priority, i.e. the priority
1819 * taken into account by the scheduler. This value might
1820 * be boosted by RT tasks, or might be boosted by
1821 * interactivity modifiers. Will be RT if the task got
1822 * RT-boosted. If not then it returns p->normal_prio.
1824 static int effective_prio(struct task_struct *p)
1826 p->normal_prio = normal_prio(p);
1828 * If we are RT tasks or we were boosted to RT priority,
1829 * keep the priority unchanged. Otherwise, update priority
1830 * to the normal priority:
1832 if (!rt_prio(p->prio))
1833 return p->normal_prio;
1838 * activate_task - move a task to the runqueue.
1840 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup)
1842 if (task_contributes_to_load(p))
1843 rq->nr_uninterruptible--;
1845 enqueue_task(rq, p, wakeup);
1850 * deactivate_task - remove a task from the runqueue.
1852 static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep)
1854 if (task_contributes_to_load(p))
1855 rq->nr_uninterruptible++;
1857 dequeue_task(rq, p, sleep);
1862 * task_curr - is this task currently executing on a CPU?
1863 * @p: the task in question.
1865 inline int task_curr(const struct task_struct *p)
1867 return cpu_curr(task_cpu(p)) == p;
1870 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1872 set_task_rq(p, cpu);
1875 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1876 * successfuly executed on another CPU. We must ensure that updates of
1877 * per-task data have been completed by this moment.
1880 task_thread_info(p)->cpu = cpu;
1884 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1885 const struct sched_class *prev_class,
1886 int oldprio, int running)
1888 if (prev_class != p->sched_class) {
1889 if (prev_class->switched_from)
1890 prev_class->switched_from(rq, p, running);
1891 p->sched_class->switched_to(rq, p, running);
1893 p->sched_class->prio_changed(rq, p, oldprio, running);
1898 /* Used instead of source_load when we know the type == 0 */
1899 static unsigned long weighted_cpuload(const int cpu)
1901 return cpu_rq(cpu)->load.weight;
1905 * Is this task likely cache-hot:
1908 task_hot(struct task_struct *p, u64 now, struct sched_domain *sd)
1913 * Buddy candidates are cache hot:
1915 if (sched_feat(CACHE_HOT_BUDDY) &&
1916 (&p->se == cfs_rq_of(&p->se)->next ||
1917 &p->se == cfs_rq_of(&p->se)->last))
1920 if (p->sched_class != &fair_sched_class)
1923 if (sysctl_sched_migration_cost == -1)
1925 if (sysctl_sched_migration_cost == 0)
1928 delta = now - p->se.exec_start;
1930 return delta < (s64)sysctl_sched_migration_cost;
1934 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1936 int old_cpu = task_cpu(p);
1937 struct rq *old_rq = cpu_rq(old_cpu), *new_rq = cpu_rq(new_cpu);
1938 struct cfs_rq *old_cfsrq = task_cfs_rq(p),
1939 *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu);
1942 clock_offset = old_rq->clock - new_rq->clock;
1944 trace_sched_migrate_task(p, task_cpu(p), new_cpu);
1946 #ifdef CONFIG_SCHEDSTATS
1947 if (p->se.wait_start)
1948 p->se.wait_start -= clock_offset;
1949 if (p->se.sleep_start)
1950 p->se.sleep_start -= clock_offset;
1951 if (p->se.block_start)
1952 p->se.block_start -= clock_offset;
1953 if (old_cpu != new_cpu) {
1954 schedstat_inc(p, se.nr_migrations);
1955 if (task_hot(p, old_rq->clock, NULL))
1956 schedstat_inc(p, se.nr_forced2_migrations);
1959 p->se.vruntime -= old_cfsrq->min_vruntime -
1960 new_cfsrq->min_vruntime;
1962 __set_task_cpu(p, new_cpu);
1965 struct migration_req {
1966 struct list_head list;
1968 struct task_struct *task;
1971 struct completion done;
1975 * The task's runqueue lock must be held.
1976 * Returns true if you have to wait for migration thread.
1979 migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req)
1981 struct rq *rq = task_rq(p);
1984 * If the task is not on a runqueue (and not running), then
1985 * it is sufficient to simply update the task's cpu field.
1987 if (!p->se.on_rq && !task_running(rq, p)) {
1988 set_task_cpu(p, dest_cpu);
1992 init_completion(&req->done);
1994 req->dest_cpu = dest_cpu;
1995 list_add(&req->list, &rq->migration_queue);
2001 * wait_task_inactive - wait for a thread to unschedule.
2003 * If @match_state is nonzero, it's the @p->state value just checked and
2004 * not expected to change. If it changes, i.e. @p might have woken up,
2005 * then return zero. When we succeed in waiting for @p to be off its CPU,
2006 * we return a positive number (its total switch count). If a second call
2007 * a short while later returns the same number, the caller can be sure that
2008 * @p has remained unscheduled the whole time.
2010 * The caller must ensure that the task *will* unschedule sometime soon,
2011 * else this function might spin for a *long* time. This function can't
2012 * be called with interrupts off, or it may introduce deadlock with
2013 * smp_call_function() if an IPI is sent by the same process we are
2014 * waiting to become inactive.
2016 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2018 unsigned long flags;
2025 * We do the initial early heuristics without holding
2026 * any task-queue locks at all. We'll only try to get
2027 * the runqueue lock when things look like they will
2033 * If the task is actively running on another CPU
2034 * still, just relax and busy-wait without holding
2037 * NOTE! Since we don't hold any locks, it's not
2038 * even sure that "rq" stays as the right runqueue!
2039 * But we don't care, since "task_running()" will
2040 * return false if the runqueue has changed and p
2041 * is actually now running somewhere else!
2043 while (task_running(rq, p)) {
2044 if (match_state && unlikely(p->state != match_state))
2050 * Ok, time to look more closely! We need the rq
2051 * lock now, to be *sure*. If we're wrong, we'll
2052 * just go back and repeat.
2054 rq = task_rq_lock(p, &flags);
2055 trace_sched_wait_task(rq, p);
2056 running = task_running(rq, p);
2057 on_rq = p->se.on_rq;
2059 if (!match_state || p->state == match_state)
2060 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
2061 task_rq_unlock(rq, &flags);
2064 * If it changed from the expected state, bail out now.
2066 if (unlikely(!ncsw))
2070 * Was it really running after all now that we
2071 * checked with the proper locks actually held?
2073 * Oops. Go back and try again..
2075 if (unlikely(running)) {
2081 * It's not enough that it's not actively running,
2082 * it must be off the runqueue _entirely_, and not
2085 * So if it wa still runnable (but just not actively
2086 * running right now), it's preempted, and we should
2087 * yield - it could be a while.
2089 if (unlikely(on_rq)) {
2090 schedule_timeout_uninterruptible(1);
2095 * Ahh, all good. It wasn't running, and it wasn't
2096 * runnable, which means that it will never become
2097 * running in the future either. We're all done!
2106 * kick_process - kick a running thread to enter/exit the kernel
2107 * @p: the to-be-kicked thread
2109 * Cause a process which is running on another CPU to enter
2110 * kernel-mode, without any delay. (to get signals handled.)
2112 * NOTE: this function doesnt have to take the runqueue lock,
2113 * because all it wants to ensure is that the remote task enters
2114 * the kernel. If the IPI races and the task has been migrated
2115 * to another CPU then no harm is done and the purpose has been
2118 void kick_process(struct task_struct *p)
2124 if ((cpu != smp_processor_id()) && task_curr(p))
2125 smp_send_reschedule(cpu);
2130 * Return a low guess at the load of a migration-source cpu weighted
2131 * according to the scheduling class and "nice" value.
2133 * We want to under-estimate the load of migration sources, to
2134 * balance conservatively.
2136 static unsigned long source_load(int cpu, int type)
2138 struct rq *rq = cpu_rq(cpu);
2139 unsigned long total = weighted_cpuload(cpu);
2141 if (type == 0 || !sched_feat(LB_BIAS))
2144 return min(rq->cpu_load[type-1], total);
2148 * Return a high guess at the load of a migration-target cpu weighted
2149 * according to the scheduling class and "nice" value.
2151 static unsigned long target_load(int cpu, int type)
2153 struct rq *rq = cpu_rq(cpu);
2154 unsigned long total = weighted_cpuload(cpu);
2156 if (type == 0 || !sched_feat(LB_BIAS))
2159 return max(rq->cpu_load[type-1], total);
2163 * find_idlest_group finds and returns the least busy CPU group within the
2166 static struct sched_group *
2167 find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu)
2169 struct sched_group *idlest = NULL, *this = NULL, *group = sd->groups;
2170 unsigned long min_load = ULONG_MAX, this_load = 0;
2171 int load_idx = sd->forkexec_idx;
2172 int imbalance = 100 + (sd->imbalance_pct-100)/2;
2175 unsigned long load, avg_load;
2179 /* Skip over this group if it has no CPUs allowed */
2180 if (!cpumask_intersects(sched_group_cpus(group),
2184 local_group = cpumask_test_cpu(this_cpu,
2185 sched_group_cpus(group));
2187 /* Tally up the load of all CPUs in the group */
2190 for_each_cpu(i, sched_group_cpus(group)) {
2191 /* Bias balancing toward cpus of our domain */
2193 load = source_load(i, load_idx);
2195 load = target_load(i, load_idx);
2200 /* Adjust by relative CPU power of the group */
2201 avg_load = sg_div_cpu_power(group,
2202 avg_load * SCHED_LOAD_SCALE);
2205 this_load = avg_load;
2207 } else if (avg_load < min_load) {
2208 min_load = avg_load;
2211 } while (group = group->next, group != sd->groups);
2213 if (!idlest || 100*this_load < imbalance*min_load)
2219 * find_idlest_cpu - find the idlest cpu among the cpus in group.
2222 find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu)
2224 unsigned long load, min_load = ULONG_MAX;
2228 /* Traverse only the allowed CPUs */
2229 for_each_cpu_and(i, sched_group_cpus(group), &p->cpus_allowed) {
2230 load = weighted_cpuload(i);
2232 if (load < min_load || (load == min_load && i == this_cpu)) {
2242 * sched_balance_self: balance the current task (running on cpu) in domains
2243 * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and
2246 * Balance, ie. select the least loaded group.
2248 * Returns the target CPU number, or the same CPU if no balancing is needed.
2250 * preempt must be disabled.
2252 static int sched_balance_self(int cpu, int flag)
2254 struct task_struct *t = current;
2255 struct sched_domain *tmp, *sd = NULL;
2257 for_each_domain(cpu, tmp) {
2259 * If power savings logic is enabled for a domain, stop there.
2261 if (tmp->flags & SD_POWERSAVINGS_BALANCE)
2263 if (tmp->flags & flag)
2271 struct sched_group *group;
2272 int new_cpu, weight;
2274 if (!(sd->flags & flag)) {
2279 group = find_idlest_group(sd, t, cpu);
2285 new_cpu = find_idlest_cpu(group, t, cpu);
2286 if (new_cpu == -1 || new_cpu == cpu) {
2287 /* Now try balancing at a lower domain level of cpu */
2292 /* Now try balancing at a lower domain level of new_cpu */
2294 weight = cpumask_weight(sched_domain_span(sd));
2296 for_each_domain(cpu, tmp) {
2297 if (weight <= cpumask_weight(sched_domain_span(tmp)))
2299 if (tmp->flags & flag)
2302 /* while loop will break here if sd == NULL */
2308 #endif /* CONFIG_SMP */
2311 * try_to_wake_up - wake up a thread
2312 * @p: the to-be-woken-up thread
2313 * @state: the mask of task states that can be woken
2314 * @sync: do a synchronous wakeup?
2316 * Put it on the run-queue if it's not already there. The "current"
2317 * thread is always on the run-queue (except when the actual
2318 * re-schedule is in progress), and as such you're allowed to do
2319 * the simpler "current->state = TASK_RUNNING" to mark yourself
2320 * runnable without the overhead of this.
2322 * returns failure only if the task is already active.
2324 static int try_to_wake_up(struct task_struct *p, unsigned int state, int sync)
2326 int cpu, orig_cpu, this_cpu, success = 0;
2327 unsigned long flags;
2331 if (!sched_feat(SYNC_WAKEUPS))
2335 if (sched_feat(LB_WAKEUP_UPDATE) && !root_task_group_empty()) {
2336 struct sched_domain *sd;
2338 this_cpu = raw_smp_processor_id();
2341 for_each_domain(this_cpu, sd) {
2342 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2351 rq = task_rq_lock(p, &flags);
2352 update_rq_clock(rq);
2353 old_state = p->state;
2354 if (!(old_state & state))
2362 this_cpu = smp_processor_id();
2365 if (unlikely(task_running(rq, p)))
2368 cpu = p->sched_class->select_task_rq(p, sync);
2369 if (cpu != orig_cpu) {
2370 set_task_cpu(p, cpu);
2371 task_rq_unlock(rq, &flags);
2372 /* might preempt at this point */
2373 rq = task_rq_lock(p, &flags);
2374 old_state = p->state;
2375 if (!(old_state & state))
2380 this_cpu = smp_processor_id();
2384 #ifdef CONFIG_SCHEDSTATS
2385 schedstat_inc(rq, ttwu_count);
2386 if (cpu == this_cpu)
2387 schedstat_inc(rq, ttwu_local);
2389 struct sched_domain *sd;
2390 for_each_domain(this_cpu, sd) {
2391 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2392 schedstat_inc(sd, ttwu_wake_remote);
2397 #endif /* CONFIG_SCHEDSTATS */
2400 #endif /* CONFIG_SMP */
2401 schedstat_inc(p, se.nr_wakeups);
2403 schedstat_inc(p, se.nr_wakeups_sync);
2404 if (orig_cpu != cpu)
2405 schedstat_inc(p, se.nr_wakeups_migrate);
2406 if (cpu == this_cpu)
2407 schedstat_inc(p, se.nr_wakeups_local);
2409 schedstat_inc(p, se.nr_wakeups_remote);
2410 activate_task(rq, p, 1);
2414 * Only attribute actual wakeups done by this task.
2416 if (!in_interrupt()) {
2417 struct sched_entity *se = ¤t->se;
2418 u64 sample = se->sum_exec_runtime;
2420 if (se->last_wakeup)
2421 sample -= se->last_wakeup;
2423 sample -= se->start_runtime;
2424 update_avg(&se->avg_wakeup, sample);
2426 se->last_wakeup = se->sum_exec_runtime;
2430 trace_sched_wakeup(rq, p, success);
2431 check_preempt_curr(rq, p, sync);
2433 p->state = TASK_RUNNING;
2435 if (p->sched_class->task_wake_up)
2436 p->sched_class->task_wake_up(rq, p);
2439 task_rq_unlock(rq, &flags);
2444 int wake_up_process(struct task_struct *p)
2446 return try_to_wake_up(p, TASK_ALL, 0);
2448 EXPORT_SYMBOL(wake_up_process);
2450 int wake_up_state(struct task_struct *p, unsigned int state)
2452 return try_to_wake_up(p, state, 0);
2456 * Perform scheduler related setup for a newly forked process p.
2457 * p is forked by current.
2459 * __sched_fork() is basic setup used by init_idle() too:
2461 static void __sched_fork(struct task_struct *p)
2463 p->se.exec_start = 0;
2464 p->se.sum_exec_runtime = 0;
2465 p->se.prev_sum_exec_runtime = 0;
2466 p->se.last_wakeup = 0;
2467 p->se.avg_overlap = 0;
2468 p->se.start_runtime = 0;
2469 p->se.avg_wakeup = sysctl_sched_wakeup_granularity;
2471 #ifdef CONFIG_SCHEDSTATS
2472 p->se.wait_start = 0;
2473 p->se.sum_sleep_runtime = 0;
2474 p->se.sleep_start = 0;
2475 p->se.block_start = 0;
2476 p->se.sleep_max = 0;
2477 p->se.block_max = 0;
2479 p->se.slice_max = 0;
2483 INIT_LIST_HEAD(&p->rt.run_list);
2485 INIT_LIST_HEAD(&p->se.group_node);
2487 #ifdef CONFIG_PREEMPT_NOTIFIERS
2488 INIT_HLIST_HEAD(&p->preempt_notifiers);
2492 * We mark the process as running here, but have not actually
2493 * inserted it onto the runqueue yet. This guarantees that
2494 * nobody will actually run it, and a signal or other external
2495 * event cannot wake it up and insert it on the runqueue either.
2497 p->state = TASK_RUNNING;
2501 * fork()/clone()-time setup:
2503 void sched_fork(struct task_struct *p, int clone_flags)
2505 int cpu = get_cpu();
2510 cpu = sched_balance_self(cpu, SD_BALANCE_FORK);
2512 set_task_cpu(p, cpu);
2515 * Make sure we do not leak PI boosting priority to the child:
2517 p->prio = current->normal_prio;
2518 if (!rt_prio(p->prio))
2519 p->sched_class = &fair_sched_class;
2521 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2522 if (likely(sched_info_on()))
2523 memset(&p->sched_info, 0, sizeof(p->sched_info));
2525 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2528 #ifdef CONFIG_PREEMPT
2529 /* Want to start with kernel preemption disabled. */
2530 task_thread_info(p)->preempt_count = 1;
2532 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2538 * wake_up_new_task - wake up a newly created task for the first time.
2540 * This function will do some initial scheduler statistics housekeeping
2541 * that must be done for every newly created context, then puts the task
2542 * on the runqueue and wakes it.
2544 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2546 unsigned long flags;
2549 rq = task_rq_lock(p, &flags);
2550 BUG_ON(p->state != TASK_RUNNING);
2551 update_rq_clock(rq);
2553 p->prio = effective_prio(p);
2555 if (!p->sched_class->task_new || !current->se.on_rq) {
2556 activate_task(rq, p, 0);
2559 * Let the scheduling class do new task startup
2560 * management (if any):
2562 p->sched_class->task_new(rq, p);
2565 trace_sched_wakeup_new(rq, p, 1);
2566 check_preempt_curr(rq, p, 0);
2568 if (p->sched_class->task_wake_up)
2569 p->sched_class->task_wake_up(rq, p);
2571 task_rq_unlock(rq, &flags);
2574 #ifdef CONFIG_PREEMPT_NOTIFIERS
2577 * preempt_notifier_register - tell me when current is being being preempted & rescheduled
2578 * @notifier: notifier struct to register
2580 void preempt_notifier_register(struct preempt_notifier *notifier)
2582 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2584 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2587 * preempt_notifier_unregister - no longer interested in preemption notifications
2588 * @notifier: notifier struct to unregister
2590 * This is safe to call from within a preemption notifier.
2592 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2594 hlist_del(¬ifier->link);
2596 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2598 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2600 struct preempt_notifier *notifier;
2601 struct hlist_node *node;
2603 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2604 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2608 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2609 struct task_struct *next)
2611 struct preempt_notifier *notifier;
2612 struct hlist_node *node;
2614 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2615 notifier->ops->sched_out(notifier, next);
2618 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2620 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2625 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2626 struct task_struct *next)
2630 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2633 * prepare_task_switch - prepare to switch tasks
2634 * @rq: the runqueue preparing to switch
2635 * @prev: the current task that is being switched out
2636 * @next: the task we are going to switch to.
2638 * This is called with the rq lock held and interrupts off. It must
2639 * be paired with a subsequent finish_task_switch after the context
2642 * prepare_task_switch sets up locking and calls architecture specific
2646 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2647 struct task_struct *next)
2649 fire_sched_out_preempt_notifiers(prev, next);
2650 prepare_lock_switch(rq, next);
2651 prepare_arch_switch(next);
2655 * finish_task_switch - clean up after a task-switch
2656 * @rq: runqueue associated with task-switch
2657 * @prev: the thread we just switched away from.
2659 * finish_task_switch must be called after the context switch, paired
2660 * with a prepare_task_switch call before the context switch.
2661 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2662 * and do any other architecture-specific cleanup actions.
2664 * Note that we may have delayed dropping an mm in context_switch(). If
2665 * so, we finish that here outside of the runqueue lock. (Doing it
2666 * with the lock held can cause deadlocks; see schedule() for
2669 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2670 __releases(rq->lock)
2672 struct mm_struct *mm = rq->prev_mm;
2675 int post_schedule = 0;
2677 if (current->sched_class->needs_post_schedule)
2678 post_schedule = current->sched_class->needs_post_schedule(rq);
2684 * A task struct has one reference for the use as "current".
2685 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2686 * schedule one last time. The schedule call will never return, and
2687 * the scheduled task must drop that reference.
2688 * The test for TASK_DEAD must occur while the runqueue locks are
2689 * still held, otherwise prev could be scheduled on another cpu, die
2690 * there before we look at prev->state, and then the reference would
2692 * Manfred Spraul <manfred@colorfullife.com>
2694 prev_state = prev->state;
2695 finish_arch_switch(prev);
2696 finish_lock_switch(rq, prev);
2699 current->sched_class->post_schedule(rq);
2702 fire_sched_in_preempt_notifiers(current);
2705 if (unlikely(prev_state == TASK_DEAD)) {
2707 * Remove function-return probe instances associated with this
2708 * task and put them back on the free list.
2710 kprobe_flush_task(prev);
2711 put_task_struct(prev);
2716 * schedule_tail - first thing a freshly forked thread must call.
2717 * @prev: the thread we just switched away from.
2719 asmlinkage void schedule_tail(struct task_struct *prev)
2720 __releases(rq->lock)
2722 struct rq *rq = this_rq();
2724 finish_task_switch(rq, prev);
2725 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2726 /* In this case, finish_task_switch does not reenable preemption */
2729 if (current->set_child_tid)
2730 put_user(task_pid_vnr(current), current->set_child_tid);
2734 * context_switch - switch to the new MM and the new
2735 * thread's register state.
2738 context_switch(struct rq *rq, struct task_struct *prev,
2739 struct task_struct *next)
2741 struct mm_struct *mm, *oldmm;
2743 prepare_task_switch(rq, prev, next);
2744 trace_sched_switch(rq, prev, next);
2746 oldmm = prev->active_mm;
2748 * For paravirt, this is coupled with an exit in switch_to to
2749 * combine the page table reload and the switch backend into
2752 arch_enter_lazy_cpu_mode();
2754 if (unlikely(!mm)) {
2755 next->active_mm = oldmm;
2756 atomic_inc(&oldmm->mm_count);
2757 enter_lazy_tlb(oldmm, next);
2759 switch_mm(oldmm, mm, next);
2761 if (unlikely(!prev->mm)) {
2762 prev->active_mm = NULL;
2763 rq->prev_mm = oldmm;
2766 * Since the runqueue lock will be released by the next
2767 * task (which is an invalid locking op but in the case
2768 * of the scheduler it's an obvious special-case), so we
2769 * do an early lockdep release here:
2771 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2772 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2775 /* Here we just switch the register state and the stack. */
2776 switch_to(prev, next, prev);
2780 * this_rq must be evaluated again because prev may have moved
2781 * CPUs since it called schedule(), thus the 'rq' on its stack
2782 * frame will be invalid.
2784 finish_task_switch(this_rq(), prev);
2788 * nr_running, nr_uninterruptible and nr_context_switches:
2790 * externally visible scheduler statistics: current number of runnable
2791 * threads, current number of uninterruptible-sleeping threads, total
2792 * number of context switches performed since bootup.
2794 unsigned long nr_running(void)
2796 unsigned long i, sum = 0;
2798 for_each_online_cpu(i)
2799 sum += cpu_rq(i)->nr_running;
2804 unsigned long nr_uninterruptible(void)
2806 unsigned long i, sum = 0;
2808 for_each_possible_cpu(i)
2809 sum += cpu_rq(i)->nr_uninterruptible;
2812 * Since we read the counters lockless, it might be slightly
2813 * inaccurate. Do not allow it to go below zero though:
2815 if (unlikely((long)sum < 0))
2821 unsigned long long nr_context_switches(void)
2824 unsigned long long sum = 0;
2826 for_each_possible_cpu(i)
2827 sum += cpu_rq(i)->nr_switches;
2832 unsigned long nr_iowait(void)
2834 unsigned long i, sum = 0;
2836 for_each_possible_cpu(i)
2837 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2842 unsigned long nr_active(void)
2844 unsigned long i, running = 0, uninterruptible = 0;
2846 for_each_online_cpu(i) {
2847 running += cpu_rq(i)->nr_running;
2848 uninterruptible += cpu_rq(i)->nr_uninterruptible;
2851 if (unlikely((long)uninterruptible < 0))
2852 uninterruptible = 0;
2854 return running + uninterruptible;
2858 * Update rq->cpu_load[] statistics. This function is usually called every
2859 * scheduler tick (TICK_NSEC).
2861 static void update_cpu_load(struct rq *this_rq)
2863 unsigned long this_load = this_rq->load.weight;
2866 this_rq->nr_load_updates++;
2868 /* Update our load: */
2869 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
2870 unsigned long old_load, new_load;
2872 /* scale is effectively 1 << i now, and >> i divides by scale */
2874 old_load = this_rq->cpu_load[i];
2875 new_load = this_load;
2877 * Round up the averaging division if load is increasing. This
2878 * prevents us from getting stuck on 9 if the load is 10, for
2881 if (new_load > old_load)
2882 new_load += scale-1;
2883 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
2890 * double_rq_lock - safely lock two runqueues
2892 * Note this does not disable interrupts like task_rq_lock,
2893 * you need to do so manually before calling.
2895 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
2896 __acquires(rq1->lock)
2897 __acquires(rq2->lock)
2899 BUG_ON(!irqs_disabled());
2901 spin_lock(&rq1->lock);
2902 __acquire(rq2->lock); /* Fake it out ;) */
2905 spin_lock(&rq1->lock);
2906 spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
2908 spin_lock(&rq2->lock);
2909 spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
2912 update_rq_clock(rq1);
2913 update_rq_clock(rq2);
2917 * double_rq_unlock - safely unlock two runqueues
2919 * Note this does not restore interrupts like task_rq_unlock,
2920 * you need to do so manually after calling.
2922 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
2923 __releases(rq1->lock)
2924 __releases(rq2->lock)
2926 spin_unlock(&rq1->lock);
2928 spin_unlock(&rq2->lock);
2930 __release(rq2->lock);
2934 * If dest_cpu is allowed for this process, migrate the task to it.
2935 * This is accomplished by forcing the cpu_allowed mask to only
2936 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
2937 * the cpu_allowed mask is restored.
2939 static void sched_migrate_task(struct task_struct *p, int dest_cpu)
2941 struct migration_req req;
2942 unsigned long flags;
2945 rq = task_rq_lock(p, &flags);
2946 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed)
2947 || unlikely(!cpu_active(dest_cpu)))
2950 /* force the process onto the specified CPU */
2951 if (migrate_task(p, dest_cpu, &req)) {
2952 /* Need to wait for migration thread (might exit: take ref). */
2953 struct task_struct *mt = rq->migration_thread;
2955 get_task_struct(mt);
2956 task_rq_unlock(rq, &flags);
2957 wake_up_process(mt);
2958 put_task_struct(mt);
2959 wait_for_completion(&req.done);
2964 task_rq_unlock(rq, &flags);
2968 * sched_exec - execve() is a valuable balancing opportunity, because at
2969 * this point the task has the smallest effective memory and cache footprint.
2971 void sched_exec(void)
2973 int new_cpu, this_cpu = get_cpu();
2974 new_cpu = sched_balance_self(this_cpu, SD_BALANCE_EXEC);
2976 if (new_cpu != this_cpu)
2977 sched_migrate_task(current, new_cpu);
2981 * pull_task - move a task from a remote runqueue to the local runqueue.
2982 * Both runqueues must be locked.
2984 static void pull_task(struct rq *src_rq, struct task_struct *p,
2985 struct rq *this_rq, int this_cpu)
2987 deactivate_task(src_rq, p, 0);
2988 set_task_cpu(p, this_cpu);
2989 activate_task(this_rq, p, 0);
2991 * Note that idle threads have a prio of MAX_PRIO, for this test
2992 * to be always true for them.
2994 check_preempt_curr(this_rq, p, 0);
2998 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
3001 int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu,
3002 struct sched_domain *sd, enum cpu_idle_type idle,
3006 * We do not migrate tasks that are:
3007 * 1) running (obviously), or
3008 * 2) cannot be migrated to this CPU due to cpus_allowed, or
3009 * 3) are cache-hot on their current CPU.
3011 if (!cpumask_test_cpu(this_cpu, &p->cpus_allowed)) {
3012 schedstat_inc(p, se.nr_failed_migrations_affine);
3017 if (task_running(rq, p)) {
3018 schedstat_inc(p, se.nr_failed_migrations_running);
3023 * Aggressive migration if:
3024 * 1) task is cache cold, or
3025 * 2) too many balance attempts have failed.
3028 if (!task_hot(p, rq->clock, sd) ||
3029 sd->nr_balance_failed > sd->cache_nice_tries) {
3030 #ifdef CONFIG_SCHEDSTATS
3031 if (task_hot(p, rq->clock, sd)) {
3032 schedstat_inc(sd, lb_hot_gained[idle]);
3033 schedstat_inc(p, se.nr_forced_migrations);
3039 if (task_hot(p, rq->clock, sd)) {
3040 schedstat_inc(p, se.nr_failed_migrations_hot);
3046 static unsigned long
3047 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3048 unsigned long max_load_move, struct sched_domain *sd,
3049 enum cpu_idle_type idle, int *all_pinned,
3050 int *this_best_prio, struct rq_iterator *iterator)
3052 int loops = 0, pulled = 0, pinned = 0;
3053 struct task_struct *p;
3054 long rem_load_move = max_load_move;
3056 if (max_load_move == 0)
3062 * Start the load-balancing iterator:
3064 p = iterator->start(iterator->arg);
3066 if (!p || loops++ > sysctl_sched_nr_migrate)
3069 if ((p->se.load.weight >> 1) > rem_load_move ||
3070 !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3071 p = iterator->next(iterator->arg);
3075 pull_task(busiest, p, this_rq, this_cpu);
3077 rem_load_move -= p->se.load.weight;
3079 #ifdef CONFIG_PREEMPT
3081 * NEWIDLE balancing is a source of latency, so preemptible kernels
3082 * will stop after the first task is pulled to minimize the critical
3085 if (idle == CPU_NEWLY_IDLE)
3090 * We only want to steal up to the prescribed amount of weighted load.
3092 if (rem_load_move > 0) {
3093 if (p->prio < *this_best_prio)
3094 *this_best_prio = p->prio;
3095 p = iterator->next(iterator->arg);
3100 * Right now, this is one of only two places pull_task() is called,
3101 * so we can safely collect pull_task() stats here rather than
3102 * inside pull_task().
3104 schedstat_add(sd, lb_gained[idle], pulled);
3107 *all_pinned = pinned;
3109 return max_load_move - rem_load_move;
3113 * move_tasks tries to move up to max_load_move weighted load from busiest to
3114 * this_rq, as part of a balancing operation within domain "sd".
3115 * Returns 1 if successful and 0 otherwise.
3117 * Called with both runqueues locked.
3119 static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3120 unsigned long max_load_move,
3121 struct sched_domain *sd, enum cpu_idle_type idle,
3124 const struct sched_class *class = sched_class_highest;
3125 unsigned long total_load_moved = 0;
3126 int this_best_prio = this_rq->curr->prio;
3130 class->load_balance(this_rq, this_cpu, busiest,
3131 max_load_move - total_load_moved,
3132 sd, idle, all_pinned, &this_best_prio);
3133 class = class->next;
3135 #ifdef CONFIG_PREEMPT
3137 * NEWIDLE balancing is a source of latency, so preemptible
3138 * kernels will stop after the first task is pulled to minimize
3139 * the critical section.
3141 if (idle == CPU_NEWLY_IDLE && this_rq->nr_running)
3144 } while (class && max_load_move > total_load_moved);
3146 return total_load_moved > 0;
3150 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3151 struct sched_domain *sd, enum cpu_idle_type idle,
3152 struct rq_iterator *iterator)
3154 struct task_struct *p = iterator->start(iterator->arg);
3158 if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3159 pull_task(busiest, p, this_rq, this_cpu);
3161 * Right now, this is only the second place pull_task()
3162 * is called, so we can safely collect pull_task()
3163 * stats here rather than inside pull_task().
3165 schedstat_inc(sd, lb_gained[idle]);
3169 p = iterator->next(iterator->arg);
3176 * move_one_task tries to move exactly one task from busiest to this_rq, as
3177 * part of active balancing operations within "domain".
3178 * Returns 1 if successful and 0 otherwise.
3180 * Called with both runqueues locked.
3182 static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3183 struct sched_domain *sd, enum cpu_idle_type idle)
3185 const struct sched_class *class;
3187 for (class = sched_class_highest; class; class = class->next)
3188 if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle))
3195 * find_busiest_group finds and returns the busiest CPU group within the
3196 * domain. It calculates and returns the amount of weighted load which
3197 * should be moved to restore balance via the imbalance parameter.
3199 static struct sched_group *
3200 find_busiest_group(struct sched_domain *sd, int this_cpu,
3201 unsigned long *imbalance, enum cpu_idle_type idle,
3202 int *sd_idle, const struct cpumask *cpus, int *balance)
3204 struct sched_group *busiest = NULL, *this = NULL, *group = sd->groups;
3205 unsigned long max_load, avg_load, total_load, this_load, total_pwr;
3206 unsigned long max_pull;
3207 unsigned long busiest_load_per_task, busiest_nr_running;
3208 unsigned long this_load_per_task, this_nr_running;
3209 int load_idx, group_imb = 0;
3210 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3211 int power_savings_balance = 1;
3212 unsigned long leader_nr_running = 0, min_load_per_task = 0;
3213 unsigned long min_nr_running = ULONG_MAX;
3214 struct sched_group *group_min = NULL, *group_leader = NULL;
3217 max_load = this_load = total_load = total_pwr = 0;
3218 busiest_load_per_task = busiest_nr_running = 0;
3219 this_load_per_task = this_nr_running = 0;
3221 if (idle == CPU_NOT_IDLE)
3222 load_idx = sd->busy_idx;
3223 else if (idle == CPU_NEWLY_IDLE)
3224 load_idx = sd->newidle_idx;
3226 load_idx = sd->idle_idx;
3229 unsigned long load, group_capacity, max_cpu_load, min_cpu_load;
3232 int __group_imb = 0;
3233 unsigned int balance_cpu = -1, first_idle_cpu = 0;
3234 unsigned long sum_nr_running, sum_weighted_load;
3235 unsigned long sum_avg_load_per_task;
3236 unsigned long avg_load_per_task;
3238 local_group = cpumask_test_cpu(this_cpu,
3239 sched_group_cpus(group));
3242 balance_cpu = cpumask_first(sched_group_cpus(group));
3244 /* Tally up the load of all CPUs in the group */
3245 sum_weighted_load = sum_nr_running = avg_load = 0;
3246 sum_avg_load_per_task = avg_load_per_task = 0;
3249 min_cpu_load = ~0UL;
3251 for_each_cpu_and(i, sched_group_cpus(group), cpus) {
3252 struct rq *rq = cpu_rq(i);
3254 if (*sd_idle && rq->nr_running)
3257 /* Bias balancing toward cpus of our domain */
3259 if (idle_cpu(i) && !first_idle_cpu) {
3264 load = target_load(i, load_idx);
3266 load = source_load(i, load_idx);
3267 if (load > max_cpu_load)
3268 max_cpu_load = load;
3269 if (min_cpu_load > load)
3270 min_cpu_load = load;
3274 sum_nr_running += rq->nr_running;
3275 sum_weighted_load += weighted_cpuload(i);
3277 sum_avg_load_per_task += cpu_avg_load_per_task(i);
3281 * First idle cpu or the first cpu(busiest) in this sched group
3282 * is eligible for doing load balancing at this and above
3283 * domains. In the newly idle case, we will allow all the cpu's
3284 * to do the newly idle load balance.
3286 if (idle != CPU_NEWLY_IDLE && local_group &&
3287 balance_cpu != this_cpu && balance) {
3292 total_load += avg_load;
3293 total_pwr += group->__cpu_power;
3295 /* Adjust by relative CPU power of the group */
3296 avg_load = sg_div_cpu_power(group,
3297 avg_load * SCHED_LOAD_SCALE);
3301 * Consider the group unbalanced when the imbalance is larger
3302 * than the average weight of two tasks.
3304 * APZ: with cgroup the avg task weight can vary wildly and
3305 * might not be a suitable number - should we keep a
3306 * normalized nr_running number somewhere that negates
3309 avg_load_per_task = sg_div_cpu_power(group,
3310 sum_avg_load_per_task * SCHED_LOAD_SCALE);
3312 if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task)
3315 group_capacity = group->__cpu_power / SCHED_LOAD_SCALE;
3318 this_load = avg_load;
3320 this_nr_running = sum_nr_running;
3321 this_load_per_task = sum_weighted_load;
3322 } else if (avg_load > max_load &&
3323 (sum_nr_running > group_capacity || __group_imb)) {
3324 max_load = avg_load;
3326 busiest_nr_running = sum_nr_running;
3327 busiest_load_per_task = sum_weighted_load;
3328 group_imb = __group_imb;
3331 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3333 * Busy processors will not participate in power savings
3336 if (idle == CPU_NOT_IDLE ||
3337 !(sd->flags & SD_POWERSAVINGS_BALANCE))
3341 * If the local group is idle or completely loaded
3342 * no need to do power savings balance at this domain
3344 if (local_group && (this_nr_running >= group_capacity ||
3346 power_savings_balance = 0;
3349 * If a group is already running at full capacity or idle,
3350 * don't include that group in power savings calculations
3352 if (!power_savings_balance || sum_nr_running >= group_capacity
3357 * Calculate the group which has the least non-idle load.
3358 * This is the group from where we need to pick up the load
3361 if ((sum_nr_running < min_nr_running) ||
3362 (sum_nr_running == min_nr_running &&
3363 cpumask_first(sched_group_cpus(group)) >
3364 cpumask_first(sched_group_cpus(group_min)))) {
3366 min_nr_running = sum_nr_running;
3367 min_load_per_task = sum_weighted_load /
3372 * Calculate the group which is almost near its
3373 * capacity but still has some space to pick up some load
3374 * from other group and save more power
3376 if (sum_nr_running <= group_capacity - 1) {
3377 if (sum_nr_running > leader_nr_running ||
3378 (sum_nr_running == leader_nr_running &&
3379 cpumask_first(sched_group_cpus(group)) <
3380 cpumask_first(sched_group_cpus(group_leader)))) {
3381 group_leader = group;
3382 leader_nr_running = sum_nr_running;
3387 group = group->next;
3388 } while (group != sd->groups);
3390 if (!busiest || this_load >= max_load || busiest_nr_running == 0)
3393 avg_load = (SCHED_LOAD_SCALE * total_load) / total_pwr;
3395 if (this_load >= avg_load ||
3396 100*max_load <= sd->imbalance_pct*this_load)
3399 busiest_load_per_task /= busiest_nr_running;
3401 busiest_load_per_task = min(busiest_load_per_task, avg_load);
3404 * We're trying to get all the cpus to the average_load, so we don't
3405 * want to push ourselves above the average load, nor do we wish to
3406 * reduce the max loaded cpu below the average load, as either of these
3407 * actions would just result in more rebalancing later, and ping-pong
3408 * tasks around. Thus we look for the minimum possible imbalance.
3409 * Negative imbalances (*we* are more loaded than anyone else) will
3410 * be counted as no imbalance for these purposes -- we can't fix that
3411 * by pulling tasks to us. Be careful of negative numbers as they'll
3412 * appear as very large values with unsigned longs.
3414 if (max_load <= busiest_load_per_task)
3418 * In the presence of smp nice balancing, certain scenarios can have
3419 * max load less than avg load(as we skip the groups at or below
3420 * its cpu_power, while calculating max_load..)
3422 if (max_load < avg_load) {
3424 goto small_imbalance;
3427 /* Don't want to pull so many tasks that a group would go idle */
3428 max_pull = min(max_load - avg_load, max_load - busiest_load_per_task);
3430 /* How much load to actually move to equalise the imbalance */
3431 *imbalance = min(max_pull * busiest->__cpu_power,
3432 (avg_load - this_load) * this->__cpu_power)
3436 * if *imbalance is less than the average load per runnable task
3437 * there is no gaurantee that any tasks will be moved so we'll have
3438 * a think about bumping its value to force at least one task to be
3441 if (*imbalance < busiest_load_per_task) {
3442 unsigned long tmp, pwr_now, pwr_move;
3446 pwr_move = pwr_now = 0;
3448 if (this_nr_running) {
3449 this_load_per_task /= this_nr_running;
3450 if (busiest_load_per_task > this_load_per_task)
3453 this_load_per_task = cpu_avg_load_per_task(this_cpu);
3455 if (max_load - this_load + busiest_load_per_task >=
3456 busiest_load_per_task * imbn) {
3457 *imbalance = busiest_load_per_task;
3462 * OK, we don't have enough imbalance to justify moving tasks,
3463 * however we may be able to increase total CPU power used by
3467 pwr_now += busiest->__cpu_power *
3468 min(busiest_load_per_task, max_load);
3469 pwr_now += this->__cpu_power *
3470 min(this_load_per_task, this_load);
3471 pwr_now /= SCHED_LOAD_SCALE;
3473 /* Amount of load we'd subtract */
3474 tmp = sg_div_cpu_power(busiest,
3475 busiest_load_per_task * SCHED_LOAD_SCALE);
3477 pwr_move += busiest->__cpu_power *
3478 min(busiest_load_per_task, max_load - tmp);
3480 /* Amount of load we'd add */
3481 if (max_load * busiest->__cpu_power <
3482 busiest_load_per_task * SCHED_LOAD_SCALE)
3483 tmp = sg_div_cpu_power(this,
3484 max_load * busiest->__cpu_power);
3486 tmp = sg_div_cpu_power(this,
3487 busiest_load_per_task * SCHED_LOAD_SCALE);
3488 pwr_move += this->__cpu_power *
3489 min(this_load_per_task, this_load + tmp);
3490 pwr_move /= SCHED_LOAD_SCALE;
3492 /* Move if we gain throughput */
3493 if (pwr_move > pwr_now)
3494 *imbalance = busiest_load_per_task;
3500 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3501 if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE))
3504 if (this == group_leader && group_leader != group_min) {
3505 *imbalance = min_load_per_task;
3506 if (sched_mc_power_savings >= POWERSAVINGS_BALANCE_WAKEUP) {
3507 cpu_rq(this_cpu)->rd->sched_mc_preferred_wakeup_cpu =
3508 cpumask_first(sched_group_cpus(group_leader));
3519 * find_busiest_queue - find the busiest runqueue among the cpus in group.
3522 find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle,
3523 unsigned long imbalance, const struct cpumask *cpus)
3525 struct rq *busiest = NULL, *rq;
3526 unsigned long max_load = 0;
3529 for_each_cpu(i, sched_group_cpus(group)) {
3532 if (!cpumask_test_cpu(i, cpus))
3536 wl = weighted_cpuload(i);
3538 if (rq->nr_running == 1 && wl > imbalance)
3541 if (wl > max_load) {
3551 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
3552 * so long as it is large enough.
3554 #define MAX_PINNED_INTERVAL 512
3557 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3558 * tasks if there is an imbalance.
3560 static int load_balance(int this_cpu, struct rq *this_rq,
3561 struct sched_domain *sd, enum cpu_idle_type idle,
3562 int *balance, struct cpumask *cpus)
3564 int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0;
3565 struct sched_group *group;
3566 unsigned long imbalance;
3568 unsigned long flags;
3570 cpumask_setall(cpus);
3573 * When power savings policy is enabled for the parent domain, idle
3574 * sibling can pick up load irrespective of busy siblings. In this case,
3575 * let the state of idle sibling percolate up as CPU_IDLE, instead of
3576 * portraying it as CPU_NOT_IDLE.
3578 if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER &&
3579 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3582 schedstat_inc(sd, lb_count[idle]);
3586 group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle,
3593 schedstat_inc(sd, lb_nobusyg[idle]);
3597 busiest = find_busiest_queue(group, idle, imbalance, cpus);
3599 schedstat_inc(sd, lb_nobusyq[idle]);
3603 BUG_ON(busiest == this_rq);
3605 schedstat_add(sd, lb_imbalance[idle], imbalance);
3608 if (busiest->nr_running > 1) {
3610 * Attempt to move tasks. If find_busiest_group has found
3611 * an imbalance but busiest->nr_running <= 1, the group is
3612 * still unbalanced. ld_moved simply stays zero, so it is
3613 * correctly treated as an imbalance.
3615 local_irq_save(flags);
3616 double_rq_lock(this_rq, busiest);
3617 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3618 imbalance, sd, idle, &all_pinned);
3619 double_rq_unlock(this_rq, busiest);
3620 local_irq_restore(flags);
3623 * some other cpu did the load balance for us.
3625 if (ld_moved && this_cpu != smp_processor_id())
3626 resched_cpu(this_cpu);
3628 /* All tasks on this runqueue were pinned by CPU affinity */
3629 if (unlikely(all_pinned)) {
3630 cpumask_clear_cpu(cpu_of(busiest), cpus);
3631 if (!cpumask_empty(cpus))
3638 schedstat_inc(sd, lb_failed[idle]);
3639 sd->nr_balance_failed++;
3641 if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) {
3643 spin_lock_irqsave(&busiest->lock, flags);
3645 /* don't kick the migration_thread, if the curr
3646 * task on busiest cpu can't be moved to this_cpu
3648 if (!cpumask_test_cpu(this_cpu,
3649 &busiest->curr->cpus_allowed)) {
3650 spin_unlock_irqrestore(&busiest->lock, flags);
3652 goto out_one_pinned;
3655 if (!busiest->active_balance) {
3656 busiest->active_balance = 1;
3657 busiest->push_cpu = this_cpu;
3660 spin_unlock_irqrestore(&busiest->lock, flags);
3662 wake_up_process(busiest->migration_thread);
3665 * We've kicked active balancing, reset the failure
3668 sd->nr_balance_failed = sd->cache_nice_tries+1;
3671 sd->nr_balance_failed = 0;
3673 if (likely(!active_balance)) {
3674 /* We were unbalanced, so reset the balancing interval */
3675 sd->balance_interval = sd->min_interval;
3678 * If we've begun active balancing, start to back off. This
3679 * case may not be covered by the all_pinned logic if there
3680 * is only 1 task on the busy runqueue (because we don't call
3683 if (sd->balance_interval < sd->max_interval)
3684 sd->balance_interval *= 2;
3687 if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3688 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3694 schedstat_inc(sd, lb_balanced[idle]);
3696 sd->nr_balance_failed = 0;
3699 /* tune up the balancing interval */
3700 if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) ||
3701 (sd->balance_interval < sd->max_interval))
3702 sd->balance_interval *= 2;
3704 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3705 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3716 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3717 * tasks if there is an imbalance.
3719 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
3720 * this_rq is locked.
3723 load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd,
3724 struct cpumask *cpus)
3726 struct sched_group *group;
3727 struct rq *busiest = NULL;
3728 unsigned long imbalance;
3733 cpumask_setall(cpus);
3736 * When power savings policy is enabled for the parent domain, idle
3737 * sibling can pick up load irrespective of busy siblings. In this case,
3738 * let the state of idle sibling percolate up as IDLE, instead of
3739 * portraying it as CPU_NOT_IDLE.
3741 if (sd->flags & SD_SHARE_CPUPOWER &&
3742 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3745 schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]);
3747 update_shares_locked(this_rq, sd);
3748 group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE,
3749 &sd_idle, cpus, NULL);
3751 schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]);
3755 busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus);
3757 schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]);
3761 BUG_ON(busiest == this_rq);
3763 schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance);
3766 if (busiest->nr_running > 1) {
3767 /* Attempt to move tasks */
3768 double_lock_balance(this_rq, busiest);
3769 /* this_rq->clock is already updated */
3770 update_rq_clock(busiest);
3771 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3772 imbalance, sd, CPU_NEWLY_IDLE,
3774 double_unlock_balance(this_rq, busiest);
3776 if (unlikely(all_pinned)) {
3777 cpumask_clear_cpu(cpu_of(busiest), cpus);
3778 if (!cpumask_empty(cpus))
3784 int active_balance = 0;
3786 schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]);
3787 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3788 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3791 if (sched_mc_power_savings < POWERSAVINGS_BALANCE_WAKEUP)
3794 if (sd->nr_balance_failed++ < 2)
3798 * The only task running in a non-idle cpu can be moved to this
3799 * cpu in an attempt to completely freeup the other CPU
3800 * package. The same method used to move task in load_balance()
3801 * have been extended for load_balance_newidle() to speedup
3802 * consolidation at sched_mc=POWERSAVINGS_BALANCE_WAKEUP (2)
3804 * The package power saving logic comes from
3805 * find_busiest_group(). If there are no imbalance, then
3806 * f_b_g() will return NULL. However when sched_mc={1,2} then
3807 * f_b_g() will select a group from which a running task may be
3808 * pulled to this cpu in order to make the other package idle.
3809 * If there is no opportunity to make a package idle and if
3810 * there are no imbalance, then f_b_g() will return NULL and no
3811 * action will be taken in load_balance_newidle().
3813 * Under normal task pull operation due to imbalance, there
3814 * will be more than one task in the source run queue and
3815 * move_tasks() will succeed. ld_moved will be true and this
3816 * active balance code will not be triggered.
3819 /* Lock busiest in correct order while this_rq is held */
3820 double_lock_balance(this_rq, busiest);
3823 * don't kick the migration_thread, if the curr
3824 * task on busiest cpu can't be moved to this_cpu
3826 if (!cpumask_test_cpu(this_cpu, &busiest->curr->cpus_allowed)) {
3827 double_unlock_balance(this_rq, busiest);
3832 if (!busiest->active_balance) {
3833 busiest->active_balance = 1;
3834 busiest->push_cpu = this_cpu;
3838 double_unlock_balance(this_rq, busiest);
3840 * Should not call ttwu while holding a rq->lock
3842 spin_unlock(&this_rq->lock);
3844 wake_up_process(busiest->migration_thread);
3845 spin_lock(&this_rq->lock);
3848 sd->nr_balance_failed = 0;
3850 update_shares_locked(this_rq, sd);
3854 schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]);
3855 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3856 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3858 sd->nr_balance_failed = 0;
3864 * idle_balance is called by schedule() if this_cpu is about to become
3865 * idle. Attempts to pull tasks from other CPUs.
3867 static void idle_balance(int this_cpu, struct rq *this_rq)
3869 struct sched_domain *sd;
3870 int pulled_task = 0;
3871 unsigned long next_balance = jiffies + HZ;
3872 cpumask_var_t tmpmask;
3874 if (!alloc_cpumask_var(&tmpmask, GFP_ATOMIC))
3877 for_each_domain(this_cpu, sd) {
3878 unsigned long interval;
3880 if (!(sd->flags & SD_LOAD_BALANCE))
3883 if (sd->flags & SD_BALANCE_NEWIDLE)
3884 /* If we've pulled tasks over stop searching: */
3885 pulled_task = load_balance_newidle(this_cpu, this_rq,
3888 interval = msecs_to_jiffies(sd->balance_interval);
3889 if (time_after(next_balance, sd->last_balance + interval))
3890 next_balance = sd->last_balance + interval;
3894 if (pulled_task || time_after(jiffies, this_rq->next_balance)) {
3896 * We are going idle. next_balance may be set based on
3897 * a busy processor. So reset next_balance.
3899 this_rq->next_balance = next_balance;
3901 free_cpumask_var(tmpmask);
3905 * active_load_balance is run by migration threads. It pushes running tasks
3906 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
3907 * running on each physical CPU where possible, and avoids physical /
3908 * logical imbalances.
3910 * Called with busiest_rq locked.
3912 static void active_load_balance(struct rq *busiest_rq, int busiest_cpu)
3914 int target_cpu = busiest_rq->push_cpu;
3915 struct sched_domain *sd;
3916 struct rq *target_rq;
3918 /* Is there any task to move? */
3919 if (busiest_rq->nr_running <= 1)
3922 target_rq = cpu_rq(target_cpu);
3925 * This condition is "impossible", if it occurs
3926 * we need to fix it. Originally reported by
3927 * Bjorn Helgaas on a 128-cpu setup.
3929 BUG_ON(busiest_rq == target_rq);
3931 /* move a task from busiest_rq to target_rq */
3932 double_lock_balance(busiest_rq, target_rq);
3933 update_rq_clock(busiest_rq);
3934 update_rq_clock(target_rq);
3936 /* Search for an sd spanning us and the target CPU. */
3937 for_each_domain(target_cpu, sd) {
3938 if ((sd->flags & SD_LOAD_BALANCE) &&
3939 cpumask_test_cpu(busiest_cpu, sched_domain_span(sd)))
3944 schedstat_inc(sd, alb_count);
3946 if (move_one_task(target_rq, target_cpu, busiest_rq,
3948 schedstat_inc(sd, alb_pushed);
3950 schedstat_inc(sd, alb_failed);
3952 double_unlock_balance(busiest_rq, target_rq);
3957 atomic_t load_balancer;
3958 cpumask_var_t cpu_mask;
3959 } nohz ____cacheline_aligned = {
3960 .load_balancer = ATOMIC_INIT(-1),
3964 * This routine will try to nominate the ilb (idle load balancing)
3965 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
3966 * load balancing on behalf of all those cpus. If all the cpus in the system
3967 * go into this tickless mode, then there will be no ilb owner (as there is
3968 * no need for one) and all the cpus will sleep till the next wakeup event
3971 * For the ilb owner, tick is not stopped. And this tick will be used
3972 * for idle load balancing. ilb owner will still be part of
3975 * While stopping the tick, this cpu will become the ilb owner if there
3976 * is no other owner. And will be the owner till that cpu becomes busy
3977 * or if all cpus in the system stop their ticks at which point
3978 * there is no need for ilb owner.
3980 * When the ilb owner becomes busy, it nominates another owner, during the
3981 * next busy scheduler_tick()
3983 int select_nohz_load_balancer(int stop_tick)
3985 int cpu = smp_processor_id();
3988 cpu_rq(cpu)->in_nohz_recently = 1;
3990 if (!cpu_active(cpu)) {
3991 if (atomic_read(&nohz.load_balancer) != cpu)
3995 * If we are going offline and still the leader,
3998 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4004 cpumask_set_cpu(cpu, nohz.cpu_mask);
4006 /* time for ilb owner also to sleep */
4007 if (cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
4008 if (atomic_read(&nohz.load_balancer) == cpu)
4009 atomic_set(&nohz.load_balancer, -1);
4013 if (atomic_read(&nohz.load_balancer) == -1) {
4014 /* make me the ilb owner */
4015 if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1)
4017 } else if (atomic_read(&nohz.load_balancer) == cpu)
4020 if (!cpumask_test_cpu(cpu, nohz.cpu_mask))
4023 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4025 if (atomic_read(&nohz.load_balancer) == cpu)
4026 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4033 static DEFINE_SPINLOCK(balancing);
4036 * It checks each scheduling domain to see if it is due to be balanced,
4037 * and initiates a balancing operation if so.
4039 * Balancing parameters are set up in arch_init_sched_domains.
4041 static void rebalance_domains(int cpu, enum cpu_idle_type idle)
4044 struct rq *rq = cpu_rq(cpu);
4045 unsigned long interval;
4046 struct sched_domain *sd;
4047 /* Earliest time when we have to do rebalance again */
4048 unsigned long next_balance = jiffies + 60*HZ;
4049 int update_next_balance = 0;
4053 /* Fails alloc? Rebalancing probably not a priority right now. */
4054 if (!alloc_cpumask_var(&tmp, GFP_ATOMIC))
4057 for_each_domain(cpu, sd) {
4058 if (!(sd->flags & SD_LOAD_BALANCE))
4061 interval = sd->balance_interval;
4062 if (idle != CPU_IDLE)
4063 interval *= sd->busy_factor;
4065 /* scale ms to jiffies */
4066 interval = msecs_to_jiffies(interval);
4067 if (unlikely(!interval))
4069 if (interval > HZ*NR_CPUS/10)
4070 interval = HZ*NR_CPUS/10;
4072 need_serialize = sd->flags & SD_SERIALIZE;
4074 if (need_serialize) {
4075 if (!spin_trylock(&balancing))
4079 if (time_after_eq(jiffies, sd->last_balance + interval)) {
4080 if (load_balance(cpu, rq, sd, idle, &balance, tmp)) {
4082 * We've pulled tasks over so either we're no
4083 * longer idle, or one of our SMT siblings is
4086 idle = CPU_NOT_IDLE;
4088 sd->last_balance = jiffies;
4091 spin_unlock(&balancing);
4093 if (time_after(next_balance, sd->last_balance + interval)) {
4094 next_balance = sd->last_balance + interval;
4095 update_next_balance = 1;
4099 * Stop the load balance at this level. There is another
4100 * CPU in our sched group which is doing load balancing more
4108 * next_balance will be updated only when there is a need.
4109 * When the cpu is attached to null domain for ex, it will not be
4112 if (likely(update_next_balance))
4113 rq->next_balance = next_balance;
4115 free_cpumask_var(tmp);
4119 * run_rebalance_domains is triggered when needed from the scheduler tick.
4120 * In CONFIG_NO_HZ case, the idle load balance owner will do the
4121 * rebalancing for all the cpus for whom scheduler ticks are stopped.
4123 static void run_rebalance_domains(struct softirq_action *h)
4125 int this_cpu = smp_processor_id();
4126 struct rq *this_rq = cpu_rq(this_cpu);
4127 enum cpu_idle_type idle = this_rq->idle_at_tick ?
4128 CPU_IDLE : CPU_NOT_IDLE;
4130 rebalance_domains(this_cpu, idle);
4134 * If this cpu is the owner for idle load balancing, then do the
4135 * balancing on behalf of the other idle cpus whose ticks are
4138 if (this_rq->idle_at_tick &&
4139 atomic_read(&nohz.load_balancer) == this_cpu) {
4143 for_each_cpu(balance_cpu, nohz.cpu_mask) {
4144 if (balance_cpu == this_cpu)
4148 * If this cpu gets work to do, stop the load balancing
4149 * work being done for other cpus. Next load
4150 * balancing owner will pick it up.
4155 rebalance_domains(balance_cpu, CPU_IDLE);
4157 rq = cpu_rq(balance_cpu);
4158 if (time_after(this_rq->next_balance, rq->next_balance))
4159 this_rq->next_balance = rq->next_balance;
4165 static inline int on_null_domain(int cpu)
4167 return !rcu_dereference(cpu_rq(cpu)->sd);
4171 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
4173 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
4174 * idle load balancing owner or decide to stop the periodic load balancing,
4175 * if the whole system is idle.
4177 static inline void trigger_load_balance(struct rq *rq, int cpu)
4181 * If we were in the nohz mode recently and busy at the current
4182 * scheduler tick, then check if we need to nominate new idle
4185 if (rq->in_nohz_recently && !rq->idle_at_tick) {
4186 rq->in_nohz_recently = 0;
4188 if (atomic_read(&nohz.load_balancer) == cpu) {
4189 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4190 atomic_set(&nohz.load_balancer, -1);
4193 if (atomic_read(&nohz.load_balancer) == -1) {
4195 * simple selection for now: Nominate the
4196 * first cpu in the nohz list to be the next
4199 * TBD: Traverse the sched domains and nominate
4200 * the nearest cpu in the nohz.cpu_mask.
4202 int ilb = cpumask_first(nohz.cpu_mask);
4204 if (ilb < nr_cpu_ids)
4210 * If this cpu is idle and doing idle load balancing for all the
4211 * cpus with ticks stopped, is it time for that to stop?
4213 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu &&
4214 cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
4220 * If this cpu is idle and the idle load balancing is done by
4221 * someone else, then no need raise the SCHED_SOFTIRQ
4223 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu &&
4224 cpumask_test_cpu(cpu, nohz.cpu_mask))
4227 /* Don't need to rebalance while attached to NULL domain */
4228 if (time_after_eq(jiffies, rq->next_balance) &&
4229 likely(!on_null_domain(cpu)))
4230 raise_softirq(SCHED_SOFTIRQ);
4233 #else /* CONFIG_SMP */
4236 * on UP we do not need to balance between CPUs:
4238 static inline void idle_balance(int cpu, struct rq *rq)
4244 DEFINE_PER_CPU(struct kernel_stat, kstat);
4246 EXPORT_PER_CPU_SYMBOL(kstat);
4249 * Return any ns on the sched_clock that have not yet been banked in
4250 * @p in case that task is currently running.
4252 unsigned long long task_delta_exec(struct task_struct *p)
4254 unsigned long flags;
4258 rq = task_rq_lock(p, &flags);
4260 if (task_current(rq, p)) {
4263 update_rq_clock(rq);
4264 delta_exec = rq->clock - p->se.exec_start;
4265 if ((s64)delta_exec > 0)
4269 task_rq_unlock(rq, &flags);
4275 * Account user cpu time to a process.
4276 * @p: the process that the cpu time gets accounted to
4277 * @cputime: the cpu time spent in user space since the last update
4278 * @cputime_scaled: cputime scaled by cpu frequency
4280 void account_user_time(struct task_struct *p, cputime_t cputime,
4281 cputime_t cputime_scaled)
4283 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4286 /* Add user time to process. */
4287 p->utime = cputime_add(p->utime, cputime);
4288 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
4289 account_group_user_time(p, cputime);
4291 /* Add user time to cpustat. */
4292 tmp = cputime_to_cputime64(cputime);
4293 if (TASK_NICE(p) > 0)
4294 cpustat->nice = cputime64_add(cpustat->nice, tmp);
4296 cpustat->user = cputime64_add(cpustat->user, tmp);
4297 /* Account for user time used */
4298 acct_update_integrals(p);
4302 * Account guest cpu time to a process.
4303 * @p: the process that the cpu time gets accounted to
4304 * @cputime: the cpu time spent in virtual machine since the last update
4305 * @cputime_scaled: cputime scaled by cpu frequency
4307 static void account_guest_time(struct task_struct *p, cputime_t cputime,
4308 cputime_t cputime_scaled)
4311 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4313 tmp = cputime_to_cputime64(cputime);
4315 /* Add guest time to process. */
4316 p->utime = cputime_add(p->utime, cputime);
4317 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
4318 account_group_user_time(p, cputime);
4319 p->gtime = cputime_add(p->gtime, cputime);
4321 /* Add guest time to cpustat. */
4322 cpustat->user = cputime64_add(cpustat->user, tmp);
4323 cpustat->guest = cputime64_add(cpustat->guest, tmp);
4327 * Account system cpu time to a process.
4328 * @p: the process that the cpu time gets accounted to
4329 * @hardirq_offset: the offset to subtract from hardirq_count()
4330 * @cputime: the cpu time spent in kernel space since the last update
4331 * @cputime_scaled: cputime scaled by cpu frequency
4333 void account_system_time(struct task_struct *p, int hardirq_offset,
4334 cputime_t cputime, cputime_t cputime_scaled)
4336 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4339 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
4340 account_guest_time(p, cputime, cputime_scaled);
4344 /* Add system time to process. */
4345 p->stime = cputime_add(p->stime, cputime);
4346 p->stimescaled = cputime_add(p->stimescaled, cputime_scaled);
4347 account_group_system_time(p, cputime);
4349 /* Add system time to cpustat. */
4350 tmp = cputime_to_cputime64(cputime);
4351 if (hardirq_count() - hardirq_offset)
4352 cpustat->irq = cputime64_add(cpustat->irq, tmp);
4353 else if (softirq_count())
4354 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
4356 cpustat->system = cputime64_add(cpustat->system, tmp);
4358 /* Account for system time used */
4359 acct_update_integrals(p);
4363 * Account for involuntary wait time.
4364 * @steal: the cpu time spent in involuntary wait
4366 void account_steal_time(cputime_t cputime)
4368 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4369 cputime64_t cputime64 = cputime_to_cputime64(cputime);
4371 cpustat->steal = cputime64_add(cpustat->steal, cputime64);
4375 * Account for idle time.
4376 * @cputime: the cpu time spent in idle wait
4378 void account_idle_time(cputime_t cputime)
4380 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4381 cputime64_t cputime64 = cputime_to_cputime64(cputime);
4382 struct rq *rq = this_rq();
4384 if (atomic_read(&rq->nr_iowait) > 0)
4385 cpustat->iowait = cputime64_add(cpustat->iowait, cputime64);
4387 cpustat->idle = cputime64_add(cpustat->idle, cputime64);
4390 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
4393 * Account a single tick of cpu time.
4394 * @p: the process that the cpu time gets accounted to
4395 * @user_tick: indicates if the tick is a user or a system tick
4397 void account_process_tick(struct task_struct *p, int user_tick)
4399 cputime_t one_jiffy = jiffies_to_cputime(1);
4400 cputime_t one_jiffy_scaled = cputime_to_scaled(one_jiffy);
4401 struct rq *rq = this_rq();
4404 account_user_time(p, one_jiffy, one_jiffy_scaled);
4405 else if (p != rq->idle)
4406 account_system_time(p, HARDIRQ_OFFSET, one_jiffy,
4409 account_idle_time(one_jiffy);
4413 * Account multiple ticks of steal time.
4414 * @p: the process from which the cpu time has been stolen
4415 * @ticks: number of stolen ticks
4417 void account_steal_ticks(unsigned long ticks)
4419 account_steal_time(jiffies_to_cputime(ticks));
4423 * Account multiple ticks of idle time.
4424 * @ticks: number of stolen ticks
4426 void account_idle_ticks(unsigned long ticks)
4428 account_idle_time(jiffies_to_cputime(ticks));
4434 * Use precise platform statistics if available:
4436 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
4437 cputime_t task_utime(struct task_struct *p)
4442 cputime_t task_stime(struct task_struct *p)
4447 cputime_t task_utime(struct task_struct *p)
4449 clock_t utime = cputime_to_clock_t(p->utime),
4450 total = utime + cputime_to_clock_t(p->stime);
4454 * Use CFS's precise accounting:
4456 temp = (u64)nsec_to_clock_t(p->se.sum_exec_runtime);
4460 do_div(temp, total);
4462 utime = (clock_t)temp;
4464 p->prev_utime = max(p->prev_utime, clock_t_to_cputime(utime));
4465 return p->prev_utime;
4468 cputime_t task_stime(struct task_struct *p)
4473 * Use CFS's precise accounting. (we subtract utime from
4474 * the total, to make sure the total observed by userspace
4475 * grows monotonically - apps rely on that):
4477 stime = nsec_to_clock_t(p->se.sum_exec_runtime) -
4478 cputime_to_clock_t(task_utime(p));
4481 p->prev_stime = max(p->prev_stime, clock_t_to_cputime(stime));
4483 return p->prev_stime;
4487 inline cputime_t task_gtime(struct task_struct *p)
4493 * This function gets called by the timer code, with HZ frequency.
4494 * We call it with interrupts disabled.
4496 * It also gets called by the fork code, when changing the parent's
4499 void scheduler_tick(void)
4501 int cpu = smp_processor_id();
4502 struct rq *rq = cpu_rq(cpu);
4503 struct task_struct *curr = rq->curr;
4507 spin_lock(&rq->lock);
4508 update_rq_clock(rq);
4509 update_cpu_load(rq);
4510 curr->sched_class->task_tick(rq, curr, 0);
4511 spin_unlock(&rq->lock);
4514 rq->idle_at_tick = idle_cpu(cpu);
4515 trigger_load_balance(rq, cpu);
4519 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
4520 defined(CONFIG_PREEMPT_TRACER))
4522 static inline unsigned long get_parent_ip(unsigned long addr)
4524 if (in_lock_functions(addr)) {
4525 addr = CALLER_ADDR2;
4526 if (in_lock_functions(addr))
4527 addr = CALLER_ADDR3;
4532 void __kprobes add_preempt_count(int val)
4534 #ifdef CONFIG_DEBUG_PREEMPT
4538 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
4541 preempt_count() += val;
4542 #ifdef CONFIG_DEBUG_PREEMPT
4544 * Spinlock count overflowing soon?
4546 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
4549 if (preempt_count() == val)
4550 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4552 EXPORT_SYMBOL(add_preempt_count);
4554 void __kprobes sub_preempt_count(int val)
4556 #ifdef CONFIG_DEBUG_PREEMPT
4560 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
4563 * Is the spinlock portion underflowing?
4565 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
4566 !(preempt_count() & PREEMPT_MASK)))
4570 if (preempt_count() == val)
4571 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4572 preempt_count() -= val;
4574 EXPORT_SYMBOL(sub_preempt_count);
4579 * Print scheduling while atomic bug:
4581 static noinline void __schedule_bug(struct task_struct *prev)
4583 struct pt_regs *regs = get_irq_regs();
4585 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
4586 prev->comm, prev->pid, preempt_count());
4588 debug_show_held_locks(prev);
4590 if (irqs_disabled())
4591 print_irqtrace_events(prev);
4600 * Various schedule()-time debugging checks and statistics:
4602 static inline void schedule_debug(struct task_struct *prev)
4605 * Test if we are atomic. Since do_exit() needs to call into
4606 * schedule() atomically, we ignore that path for now.
4607 * Otherwise, whine if we are scheduling when we should not be.
4609 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
4610 __schedule_bug(prev);
4612 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
4614 schedstat_inc(this_rq(), sched_count);
4615 #ifdef CONFIG_SCHEDSTATS
4616 if (unlikely(prev->lock_depth >= 0)) {
4617 schedstat_inc(this_rq(), bkl_count);
4618 schedstat_inc(prev, sched_info.bkl_count);
4623 static void put_prev_task(struct rq *rq, struct task_struct *prev)
4625 if (prev->state == TASK_RUNNING) {
4626 u64 runtime = prev->se.sum_exec_runtime;
4628 runtime -= prev->se.prev_sum_exec_runtime;
4629 runtime = min_t(u64, runtime, 2*sysctl_sched_migration_cost);
4632 * In order to avoid avg_overlap growing stale when we are
4633 * indeed overlapping and hence not getting put to sleep, grow
4634 * the avg_overlap on preemption.
4636 * We use the average preemption runtime because that
4637 * correlates to the amount of cache footprint a task can
4640 update_avg(&prev->se.avg_overlap, runtime);
4642 prev->sched_class->put_prev_task(rq, prev);
4646 * Pick up the highest-prio task:
4648 static inline struct task_struct *
4649 pick_next_task(struct rq *rq)
4651 const struct sched_class *class;
4652 struct task_struct *p;
4655 * Optimization: we know that if all tasks are in
4656 * the fair class we can call that function directly:
4658 if (likely(rq->nr_running == rq->cfs.nr_running)) {
4659 p = fair_sched_class.pick_next_task(rq);
4664 class = sched_class_highest;
4666 p = class->pick_next_task(rq);
4670 * Will never be NULL as the idle class always
4671 * returns a non-NULL p:
4673 class = class->next;
4678 * schedule() is the main scheduler function.
4680 asmlinkage void __sched schedule(void)
4682 struct task_struct *prev, *next;
4683 unsigned long *switch_count;
4689 cpu = smp_processor_id();
4693 switch_count = &prev->nivcsw;
4695 release_kernel_lock(prev);
4696 need_resched_nonpreemptible:
4698 schedule_debug(prev);
4700 if (sched_feat(HRTICK))
4703 spin_lock_irq(&rq->lock);
4704 update_rq_clock(rq);
4705 clear_tsk_need_resched(prev);
4707 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
4708 if (unlikely(signal_pending_state(prev->state, prev)))
4709 prev->state = TASK_RUNNING;
4711 deactivate_task(rq, prev, 1);
4712 switch_count = &prev->nvcsw;
4716 if (prev->sched_class->pre_schedule)
4717 prev->sched_class->pre_schedule(rq, prev);
4720 if (unlikely(!rq->nr_running))
4721 idle_balance(cpu, rq);
4723 put_prev_task(rq, prev);
4724 next = pick_next_task(rq);
4726 if (likely(prev != next)) {
4727 sched_info_switch(prev, next);
4733 context_switch(rq, prev, next); /* unlocks the rq */
4735 * the context switch might have flipped the stack from under
4736 * us, hence refresh the local variables.
4738 cpu = smp_processor_id();
4741 spin_unlock_irq(&rq->lock);
4743 if (unlikely(reacquire_kernel_lock(current) < 0))
4744 goto need_resched_nonpreemptible;
4746 preempt_enable_no_resched();
4747 if (unlikely(test_thread_flag(TIF_NEED_RESCHED)))
4750 EXPORT_SYMBOL(schedule);
4752 #ifdef CONFIG_PREEMPT
4754 * this is the entry point to schedule() from in-kernel preemption
4755 * off of preempt_enable. Kernel preemptions off return from interrupt
4756 * occur there and call schedule directly.
4758 asmlinkage void __sched preempt_schedule(void)
4760 struct thread_info *ti = current_thread_info();
4763 * If there is a non-zero preempt_count or interrupts are disabled,
4764 * we do not want to preempt the current task. Just return..
4766 if (likely(ti->preempt_count || irqs_disabled()))
4770 add_preempt_count(PREEMPT_ACTIVE);
4772 sub_preempt_count(PREEMPT_ACTIVE);
4775 * Check again in case we missed a preemption opportunity
4776 * between schedule and now.
4779 } while (need_resched());
4781 EXPORT_SYMBOL(preempt_schedule);
4784 * this is the entry point to schedule() from kernel preemption
4785 * off of irq context.
4786 * Note, that this is called and return with irqs disabled. This will
4787 * protect us against recursive calling from irq.
4789 asmlinkage void __sched preempt_schedule_irq(void)
4791 struct thread_info *ti = current_thread_info();
4793 /* Catch callers which need to be fixed */
4794 BUG_ON(ti->preempt_count || !irqs_disabled());
4797 add_preempt_count(PREEMPT_ACTIVE);
4800 local_irq_disable();
4801 sub_preempt_count(PREEMPT_ACTIVE);
4804 * Check again in case we missed a preemption opportunity
4805 * between schedule and now.
4808 } while (need_resched());
4811 #endif /* CONFIG_PREEMPT */
4813 int default_wake_function(wait_queue_t *curr, unsigned mode, int sync,
4816 return try_to_wake_up(curr->private, mode, sync);
4818 EXPORT_SYMBOL(default_wake_function);
4821 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
4822 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
4823 * number) then we wake all the non-exclusive tasks and one exclusive task.
4825 * There are circumstances in which we can try to wake a task which has already
4826 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
4827 * zero in this (rare) case, and we handle it by continuing to scan the queue.
4829 void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
4830 int nr_exclusive, int sync, void *key)
4832 wait_queue_t *curr, *next;
4834 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
4835 unsigned flags = curr->flags;
4837 if (curr->func(curr, mode, sync, key) &&
4838 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
4844 * __wake_up - wake up threads blocked on a waitqueue.
4846 * @mode: which threads
4847 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4848 * @key: is directly passed to the wakeup function
4850 void __wake_up(wait_queue_head_t *q, unsigned int mode,
4851 int nr_exclusive, void *key)
4853 unsigned long flags;
4855 spin_lock_irqsave(&q->lock, flags);
4856 __wake_up_common(q, mode, nr_exclusive, 0, key);
4857 spin_unlock_irqrestore(&q->lock, flags);
4859 EXPORT_SYMBOL(__wake_up);
4862 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
4864 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
4866 __wake_up_common(q, mode, 1, 0, NULL);
4870 * __wake_up_sync - wake up threads blocked on a waitqueue.
4872 * @mode: which threads
4873 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4875 * The sync wakeup differs that the waker knows that it will schedule
4876 * away soon, so while the target thread will be woken up, it will not
4877 * be migrated to another CPU - ie. the two threads are 'synchronized'
4878 * with each other. This can prevent needless bouncing between CPUs.
4880 * On UP it can prevent extra preemption.
4883 __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
4885 unsigned long flags;
4891 if (unlikely(!nr_exclusive))
4894 spin_lock_irqsave(&q->lock, flags);
4895 __wake_up_common(q, mode, nr_exclusive, sync, NULL);
4896 spin_unlock_irqrestore(&q->lock, flags);
4898 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
4901 * complete: - signals a single thread waiting on this completion
4902 * @x: holds the state of this particular completion
4904 * This will wake up a single thread waiting on this completion. Threads will be
4905 * awakened in the same order in which they were queued.
4907 * See also complete_all(), wait_for_completion() and related routines.
4909 void complete(struct completion *x)
4911 unsigned long flags;
4913 spin_lock_irqsave(&x->wait.lock, flags);
4915 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
4916 spin_unlock_irqrestore(&x->wait.lock, flags);
4918 EXPORT_SYMBOL(complete);
4921 * complete_all: - signals all threads waiting on this completion
4922 * @x: holds the state of this particular completion
4924 * This will wake up all threads waiting on this particular completion event.
4926 void complete_all(struct completion *x)
4928 unsigned long flags;
4930 spin_lock_irqsave(&x->wait.lock, flags);
4931 x->done += UINT_MAX/2;
4932 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
4933 spin_unlock_irqrestore(&x->wait.lock, flags);
4935 EXPORT_SYMBOL(complete_all);
4937 static inline long __sched
4938 do_wait_for_common(struct completion *x, long timeout, int state)
4941 DECLARE_WAITQUEUE(wait, current);
4943 wait.flags |= WQ_FLAG_EXCLUSIVE;
4944 __add_wait_queue_tail(&x->wait, &wait);
4946 if (signal_pending_state(state, current)) {
4947 timeout = -ERESTARTSYS;
4950 __set_current_state(state);
4951 spin_unlock_irq(&x->wait.lock);
4952 timeout = schedule_timeout(timeout);
4953 spin_lock_irq(&x->wait.lock);
4954 } while (!x->done && timeout);
4955 __remove_wait_queue(&x->wait, &wait);
4960 return timeout ?: 1;
4964 wait_for_common(struct completion *x, long timeout, int state)
4968 spin_lock_irq(&x->wait.lock);
4969 timeout = do_wait_for_common(x, timeout, state);
4970 spin_unlock_irq(&x->wait.lock);
4975 * wait_for_completion: - waits for completion of a task
4976 * @x: holds the state of this particular completion
4978 * This waits to be signaled for completion of a specific task. It is NOT
4979 * interruptible and there is no timeout.
4981 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
4982 * and interrupt capability. Also see complete().
4984 void __sched wait_for_completion(struct completion *x)
4986 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
4988 EXPORT_SYMBOL(wait_for_completion);
4991 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
4992 * @x: holds the state of this particular completion
4993 * @timeout: timeout value in jiffies
4995 * This waits for either a completion of a specific task to be signaled or for a
4996 * specified timeout to expire. The timeout is in jiffies. It is not
4999 unsigned long __sched
5000 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
5002 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
5004 EXPORT_SYMBOL(wait_for_completion_timeout);
5007 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
5008 * @x: holds the state of this particular completion
5010 * This waits for completion of a specific task to be signaled. It is
5013 int __sched wait_for_completion_interruptible(struct completion *x)
5015 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
5016 if (t == -ERESTARTSYS)
5020 EXPORT_SYMBOL(wait_for_completion_interruptible);
5023 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
5024 * @x: holds the state of this particular completion
5025 * @timeout: timeout value in jiffies
5027 * This waits for either a completion of a specific task to be signaled or for a
5028 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
5030 unsigned long __sched
5031 wait_for_completion_interruptible_timeout(struct completion *x,
5032 unsigned long timeout)
5034 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
5036 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
5039 * wait_for_completion_killable: - waits for completion of a task (killable)
5040 * @x: holds the state of this particular completion
5042 * This waits to be signaled for completion of a specific task. It can be
5043 * interrupted by a kill signal.
5045 int __sched wait_for_completion_killable(struct completion *x)
5047 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
5048 if (t == -ERESTARTSYS)
5052 EXPORT_SYMBOL(wait_for_completion_killable);
5055 * try_wait_for_completion - try to decrement a completion without blocking
5056 * @x: completion structure
5058 * Returns: 0 if a decrement cannot be done without blocking
5059 * 1 if a decrement succeeded.
5061 * If a completion is being used as a counting completion,
5062 * attempt to decrement the counter without blocking. This
5063 * enables us to avoid waiting if the resource the completion
5064 * is protecting is not available.
5066 bool try_wait_for_completion(struct completion *x)
5070 spin_lock_irq(&x->wait.lock);
5075 spin_unlock_irq(&x->wait.lock);
5078 EXPORT_SYMBOL(try_wait_for_completion);
5081 * completion_done - Test to see if a completion has any waiters
5082 * @x: completion structure
5084 * Returns: 0 if there are waiters (wait_for_completion() in progress)
5085 * 1 if there are no waiters.
5088 bool completion_done(struct completion *x)
5092 spin_lock_irq(&x->wait.lock);
5095 spin_unlock_irq(&x->wait.lock);
5098 EXPORT_SYMBOL(completion_done);
5101 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
5103 unsigned long flags;
5106 init_waitqueue_entry(&wait, current);
5108 __set_current_state(state);
5110 spin_lock_irqsave(&q->lock, flags);
5111 __add_wait_queue(q, &wait);
5112 spin_unlock(&q->lock);
5113 timeout = schedule_timeout(timeout);
5114 spin_lock_irq(&q->lock);
5115 __remove_wait_queue(q, &wait);
5116 spin_unlock_irqrestore(&q->lock, flags);
5121 void __sched interruptible_sleep_on(wait_queue_head_t *q)
5123 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
5125 EXPORT_SYMBOL(interruptible_sleep_on);
5128 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
5130 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
5132 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
5134 void __sched sleep_on(wait_queue_head_t *q)
5136 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
5138 EXPORT_SYMBOL(sleep_on);
5140 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
5142 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
5144 EXPORT_SYMBOL(sleep_on_timeout);
5146 #ifdef CONFIG_RT_MUTEXES
5149 * rt_mutex_setprio - set the current priority of a task
5151 * @prio: prio value (kernel-internal form)
5153 * This function changes the 'effective' priority of a task. It does
5154 * not touch ->normal_prio like __setscheduler().
5156 * Used by the rt_mutex code to implement priority inheritance logic.
5158 void rt_mutex_setprio(struct task_struct *p, int prio)
5160 unsigned long flags;
5161 int oldprio, on_rq, running;
5163 const struct sched_class *prev_class = p->sched_class;
5165 BUG_ON(prio < 0 || prio > MAX_PRIO);
5167 rq = task_rq_lock(p, &flags);
5168 update_rq_clock(rq);
5171 on_rq = p->se.on_rq;
5172 running = task_current(rq, p);
5174 dequeue_task(rq, p, 0);
5176 p->sched_class->put_prev_task(rq, p);
5179 p->sched_class = &rt_sched_class;
5181 p->sched_class = &fair_sched_class;
5186 p->sched_class->set_curr_task(rq);
5188 enqueue_task(rq, p, 0);
5190 check_class_changed(rq, p, prev_class, oldprio, running);
5192 task_rq_unlock(rq, &flags);
5197 void set_user_nice(struct task_struct *p, long nice)
5199 int old_prio, delta, on_rq;
5200 unsigned long flags;
5203 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
5206 * We have to be careful, if called from sys_setpriority(),
5207 * the task might be in the middle of scheduling on another CPU.
5209 rq = task_rq_lock(p, &flags);
5210 update_rq_clock(rq);
5212 * The RT priorities are set via sched_setscheduler(), but we still
5213 * allow the 'normal' nice value to be set - but as expected
5214 * it wont have any effect on scheduling until the task is
5215 * SCHED_FIFO/SCHED_RR:
5217 if (task_has_rt_policy(p)) {
5218 p->static_prio = NICE_TO_PRIO(nice);
5221 on_rq = p->se.on_rq;
5223 dequeue_task(rq, p, 0);
5225 p->static_prio = NICE_TO_PRIO(nice);
5228 p->prio = effective_prio(p);
5229 delta = p->prio - old_prio;
5232 enqueue_task(rq, p, 0);
5234 * If the task increased its priority or is running and
5235 * lowered its priority, then reschedule its CPU:
5237 if (delta < 0 || (delta > 0 && task_running(rq, p)))
5238 resched_task(rq->curr);
5241 task_rq_unlock(rq, &flags);
5243 EXPORT_SYMBOL(set_user_nice);
5246 * can_nice - check if a task can reduce its nice value
5250 int can_nice(const struct task_struct *p, const int nice)
5252 /* convert nice value [19,-20] to rlimit style value [1,40] */
5253 int nice_rlim = 20 - nice;
5255 return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur ||
5256 capable(CAP_SYS_NICE));
5259 #ifdef __ARCH_WANT_SYS_NICE
5262 * sys_nice - change the priority of the current process.
5263 * @increment: priority increment
5265 * sys_setpriority is a more generic, but much slower function that
5266 * does similar things.
5268 SYSCALL_DEFINE1(nice, int, increment)
5273 * Setpriority might change our priority at the same moment.
5274 * We don't have to worry. Conceptually one call occurs first
5275 * and we have a single winner.
5277 if (increment < -40)
5282 nice = TASK_NICE(current) + increment;
5288 if (increment < 0 && !can_nice(current, nice))
5291 retval = security_task_setnice(current, nice);
5295 set_user_nice(current, nice);
5302 * task_prio - return the priority value of a given task.
5303 * @p: the task in question.
5305 * This is the priority value as seen by users in /proc.
5306 * RT tasks are offset by -200. Normal tasks are centered
5307 * around 0, value goes from -16 to +15.
5309 int task_prio(const struct task_struct *p)
5311 return p->prio - MAX_RT_PRIO;
5315 * task_nice - return the nice value of a given task.
5316 * @p: the task in question.
5318 int task_nice(const struct task_struct *p)
5320 return TASK_NICE(p);
5322 EXPORT_SYMBOL(task_nice);
5325 * idle_cpu - is a given cpu idle currently?
5326 * @cpu: the processor in question.
5328 int idle_cpu(int cpu)
5330 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
5334 * idle_task - return the idle task for a given cpu.
5335 * @cpu: the processor in question.
5337 struct task_struct *idle_task(int cpu)
5339 return cpu_rq(cpu)->idle;
5343 * find_process_by_pid - find a process with a matching PID value.
5344 * @pid: the pid in question.
5346 static struct task_struct *find_process_by_pid(pid_t pid)
5348 return pid ? find_task_by_vpid(pid) : current;
5351 /* Actually do priority change: must hold rq lock. */
5353 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
5355 BUG_ON(p->se.on_rq);
5358 switch (p->policy) {
5362 p->sched_class = &fair_sched_class;
5366 p->sched_class = &rt_sched_class;
5370 p->rt_priority = prio;
5371 p->normal_prio = normal_prio(p);
5372 /* we are holding p->pi_lock already */
5373 p->prio = rt_mutex_getprio(p);
5378 * check the target process has a UID that matches the current process's
5380 static bool check_same_owner(struct task_struct *p)
5382 const struct cred *cred = current_cred(), *pcred;
5386 pcred = __task_cred(p);
5387 match = (cred->euid == pcred->euid ||
5388 cred->euid == pcred->uid);
5393 static int __sched_setscheduler(struct task_struct *p, int policy,
5394 struct sched_param *param, bool user)
5396 int retval, oldprio, oldpolicy = -1, on_rq, running;
5397 unsigned long flags;
5398 const struct sched_class *prev_class = p->sched_class;
5401 /* may grab non-irq protected spin_locks */
5402 BUG_ON(in_interrupt());
5404 /* double check policy once rq lock held */
5406 policy = oldpolicy = p->policy;
5407 else if (policy != SCHED_FIFO && policy != SCHED_RR &&
5408 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
5409 policy != SCHED_IDLE)
5412 * Valid priorities for SCHED_FIFO and SCHED_RR are
5413 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
5414 * SCHED_BATCH and SCHED_IDLE is 0.
5416 if (param->sched_priority < 0 ||
5417 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
5418 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
5420 if (rt_policy(policy) != (param->sched_priority != 0))
5424 * Allow unprivileged RT tasks to decrease priority:
5426 if (user && !capable(CAP_SYS_NICE)) {
5427 if (rt_policy(policy)) {
5428 unsigned long rlim_rtprio;
5430 if (!lock_task_sighand(p, &flags))
5432 rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur;
5433 unlock_task_sighand(p, &flags);
5435 /* can't set/change the rt policy */
5436 if (policy != p->policy && !rlim_rtprio)
5439 /* can't increase priority */
5440 if (param->sched_priority > p->rt_priority &&
5441 param->sched_priority > rlim_rtprio)
5445 * Like positive nice levels, dont allow tasks to
5446 * move out of SCHED_IDLE either:
5448 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
5451 /* can't change other user's priorities */
5452 if (!check_same_owner(p))
5457 #ifdef CONFIG_RT_GROUP_SCHED
5459 * Do not allow realtime tasks into groups that have no runtime
5462 if (rt_bandwidth_enabled() && rt_policy(policy) &&
5463 task_group(p)->rt_bandwidth.rt_runtime == 0)
5467 retval = security_task_setscheduler(p, policy, param);
5473 * make sure no PI-waiters arrive (or leave) while we are
5474 * changing the priority of the task:
5476 spin_lock_irqsave(&p->pi_lock, flags);
5478 * To be able to change p->policy safely, the apropriate
5479 * runqueue lock must be held.
5481 rq = __task_rq_lock(p);
5482 /* recheck policy now with rq lock held */
5483 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
5484 policy = oldpolicy = -1;
5485 __task_rq_unlock(rq);
5486 spin_unlock_irqrestore(&p->pi_lock, flags);
5489 update_rq_clock(rq);
5490 on_rq = p->se.on_rq;
5491 running = task_current(rq, p);
5493 deactivate_task(rq, p, 0);
5495 p->sched_class->put_prev_task(rq, p);
5498 __setscheduler(rq, p, policy, param->sched_priority);
5501 p->sched_class->set_curr_task(rq);
5503 activate_task(rq, p, 0);
5505 check_class_changed(rq, p, prev_class, oldprio, running);
5507 __task_rq_unlock(rq);
5508 spin_unlock_irqrestore(&p->pi_lock, flags);
5510 rt_mutex_adjust_pi(p);
5516 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
5517 * @p: the task in question.
5518 * @policy: new policy.
5519 * @param: structure containing the new RT priority.
5521 * NOTE that the task may be already dead.
5523 int sched_setscheduler(struct task_struct *p, int policy,
5524 struct sched_param *param)
5526 return __sched_setscheduler(p, policy, param, true);
5528 EXPORT_SYMBOL_GPL(sched_setscheduler);
5531 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
5532 * @p: the task in question.
5533 * @policy: new policy.
5534 * @param: structure containing the new RT priority.
5536 * Just like sched_setscheduler, only don't bother checking if the
5537 * current context has permission. For example, this is needed in
5538 * stop_machine(): we create temporary high priority worker threads,
5539 * but our caller might not have that capability.
5541 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
5542 struct sched_param *param)
5544 return __sched_setscheduler(p, policy, param, false);
5548 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
5550 struct sched_param lparam;
5551 struct task_struct *p;
5554 if (!param || pid < 0)
5556 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
5561 p = find_process_by_pid(pid);
5563 retval = sched_setscheduler(p, policy, &lparam);
5570 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
5571 * @pid: the pid in question.
5572 * @policy: new policy.
5573 * @param: structure containing the new RT priority.
5575 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
5576 struct sched_param __user *, param)
5578 /* negative values for policy are not valid */
5582 return do_sched_setscheduler(pid, policy, param);
5586 * sys_sched_setparam - set/change the RT priority of a thread
5587 * @pid: the pid in question.
5588 * @param: structure containing the new RT priority.
5590 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
5592 return do_sched_setscheduler(pid, -1, param);
5596 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
5597 * @pid: the pid in question.
5599 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
5601 struct task_struct *p;
5608 read_lock(&tasklist_lock);
5609 p = find_process_by_pid(pid);
5611 retval = security_task_getscheduler(p);
5615 read_unlock(&tasklist_lock);
5620 * sys_sched_getscheduler - get the RT priority of a thread
5621 * @pid: the pid in question.
5622 * @param: structure containing the RT priority.
5624 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
5626 struct sched_param lp;
5627 struct task_struct *p;
5630 if (!param || pid < 0)
5633 read_lock(&tasklist_lock);
5634 p = find_process_by_pid(pid);
5639 retval = security_task_getscheduler(p);
5643 lp.sched_priority = p->rt_priority;
5644 read_unlock(&tasklist_lock);
5647 * This one might sleep, we cannot do it with a spinlock held ...
5649 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
5654 read_unlock(&tasklist_lock);
5658 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
5660 cpumask_var_t cpus_allowed, new_mask;
5661 struct task_struct *p;
5665 read_lock(&tasklist_lock);
5667 p = find_process_by_pid(pid);
5669 read_unlock(&tasklist_lock);
5675 * It is not safe to call set_cpus_allowed with the
5676 * tasklist_lock held. We will bump the task_struct's
5677 * usage count and then drop tasklist_lock.
5680 read_unlock(&tasklist_lock);
5682 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
5686 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
5688 goto out_free_cpus_allowed;
5691 if (!check_same_owner(p) && !capable(CAP_SYS_NICE))
5694 retval = security_task_setscheduler(p, 0, NULL);
5698 cpuset_cpus_allowed(p, cpus_allowed);
5699 cpumask_and(new_mask, in_mask, cpus_allowed);
5701 retval = set_cpus_allowed_ptr(p, new_mask);
5704 cpuset_cpus_allowed(p, cpus_allowed);
5705 if (!cpumask_subset(new_mask, cpus_allowed)) {
5707 * We must have raced with a concurrent cpuset
5708 * update. Just reset the cpus_allowed to the
5709 * cpuset's cpus_allowed
5711 cpumask_copy(new_mask, cpus_allowed);
5716 free_cpumask_var(new_mask);
5717 out_free_cpus_allowed:
5718 free_cpumask_var(cpus_allowed);
5725 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
5726 struct cpumask *new_mask)
5728 if (len < cpumask_size())
5729 cpumask_clear(new_mask);
5730 else if (len > cpumask_size())
5731 len = cpumask_size();
5733 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
5737 * sys_sched_setaffinity - set the cpu affinity of a process
5738 * @pid: pid of the process
5739 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5740 * @user_mask_ptr: user-space pointer to the new cpu mask
5742 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
5743 unsigned long __user *, user_mask_ptr)
5745 cpumask_var_t new_mask;
5748 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
5751 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
5753 retval = sched_setaffinity(pid, new_mask);
5754 free_cpumask_var(new_mask);
5758 long sched_getaffinity(pid_t pid, struct cpumask *mask)
5760 struct task_struct *p;
5764 read_lock(&tasklist_lock);
5767 p = find_process_by_pid(pid);
5771 retval = security_task_getscheduler(p);
5775 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
5778 read_unlock(&tasklist_lock);
5785 * sys_sched_getaffinity - get the cpu affinity of a process
5786 * @pid: pid of the process
5787 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5788 * @user_mask_ptr: user-space pointer to hold the current cpu mask
5790 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
5791 unsigned long __user *, user_mask_ptr)
5796 if (len < cpumask_size())
5799 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
5802 ret = sched_getaffinity(pid, mask);
5804 if (copy_to_user(user_mask_ptr, mask, cpumask_size()))
5807 ret = cpumask_size();
5809 free_cpumask_var(mask);
5815 * sys_sched_yield - yield the current processor to other threads.
5817 * This function yields the current CPU to other tasks. If there are no
5818 * other threads running on this CPU then this function will return.
5820 SYSCALL_DEFINE0(sched_yield)
5822 struct rq *rq = this_rq_lock();
5824 schedstat_inc(rq, yld_count);
5825 current->sched_class->yield_task(rq);
5828 * Since we are going to call schedule() anyway, there's
5829 * no need to preempt or enable interrupts:
5831 __release(rq->lock);
5832 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
5833 _raw_spin_unlock(&rq->lock);
5834 preempt_enable_no_resched();
5841 static void __cond_resched(void)
5843 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
5844 __might_sleep(__FILE__, __LINE__);
5847 * The BKS might be reacquired before we have dropped
5848 * PREEMPT_ACTIVE, which could trigger a second
5849 * cond_resched() call.
5852 add_preempt_count(PREEMPT_ACTIVE);
5854 sub_preempt_count(PREEMPT_ACTIVE);
5855 } while (need_resched());
5858 int __sched _cond_resched(void)
5860 if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE) &&
5861 system_state == SYSTEM_RUNNING) {
5867 EXPORT_SYMBOL(_cond_resched);
5870 * cond_resched_lock() - if a reschedule is pending, drop the given lock,
5871 * call schedule, and on return reacquire the lock.
5873 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
5874 * operations here to prevent schedule() from being called twice (once via
5875 * spin_unlock(), once by hand).
5877 int cond_resched_lock(spinlock_t *lock)
5879 int resched = need_resched() && system_state == SYSTEM_RUNNING;
5882 if (spin_needbreak(lock) || resched) {
5884 if (resched && need_resched())
5893 EXPORT_SYMBOL(cond_resched_lock);
5895 int __sched cond_resched_softirq(void)
5897 BUG_ON(!in_softirq());
5899 if (need_resched() && system_state == SYSTEM_RUNNING) {
5907 EXPORT_SYMBOL(cond_resched_softirq);
5910 * yield - yield the current processor to other threads.
5912 * This is a shortcut for kernel-space yielding - it marks the
5913 * thread runnable and calls sys_sched_yield().
5915 void __sched yield(void)
5917 set_current_state(TASK_RUNNING);
5920 EXPORT_SYMBOL(yield);
5923 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
5924 * that process accounting knows that this is a task in IO wait state.
5926 * But don't do that if it is a deliberate, throttling IO wait (this task
5927 * has set its backing_dev_info: the queue against which it should throttle)
5929 void __sched io_schedule(void)
5931 struct rq *rq = &__raw_get_cpu_var(runqueues);
5933 delayacct_blkio_start();
5934 atomic_inc(&rq->nr_iowait);
5936 atomic_dec(&rq->nr_iowait);
5937 delayacct_blkio_end();
5939 EXPORT_SYMBOL(io_schedule);
5941 long __sched io_schedule_timeout(long timeout)
5943 struct rq *rq = &__raw_get_cpu_var(runqueues);
5946 delayacct_blkio_start();
5947 atomic_inc(&rq->nr_iowait);
5948 ret = schedule_timeout(timeout);
5949 atomic_dec(&rq->nr_iowait);
5950 delayacct_blkio_end();
5955 * sys_sched_get_priority_max - return maximum RT priority.
5956 * @policy: scheduling class.
5958 * this syscall returns the maximum rt_priority that can be used
5959 * by a given scheduling class.
5961 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
5968 ret = MAX_USER_RT_PRIO-1;
5980 * sys_sched_get_priority_min - return minimum RT priority.
5981 * @policy: scheduling class.
5983 * this syscall returns the minimum rt_priority that can be used
5984 * by a given scheduling class.
5986 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
6004 * sys_sched_rr_get_interval - return the default timeslice of a process.
6005 * @pid: pid of the process.
6006 * @interval: userspace pointer to the timeslice value.
6008 * this syscall writes the default timeslice value of a given process
6009 * into the user-space timespec buffer. A value of '0' means infinity.
6011 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
6012 struct timespec __user *, interval)
6014 struct task_struct *p;
6015 unsigned int time_slice;
6023 read_lock(&tasklist_lock);
6024 p = find_process_by_pid(pid);
6028 retval = security_task_getscheduler(p);
6033 * Time slice is 0 for SCHED_FIFO tasks and for SCHED_OTHER
6034 * tasks that are on an otherwise idle runqueue:
6037 if (p->policy == SCHED_RR) {
6038 time_slice = DEF_TIMESLICE;
6039 } else if (p->policy != SCHED_FIFO) {
6040 struct sched_entity *se = &p->se;
6041 unsigned long flags;
6044 rq = task_rq_lock(p, &flags);
6045 if (rq->cfs.load.weight)
6046 time_slice = NS_TO_JIFFIES(sched_slice(&rq->cfs, se));
6047 task_rq_unlock(rq, &flags);
6049 read_unlock(&tasklist_lock);
6050 jiffies_to_timespec(time_slice, &t);
6051 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
6055 read_unlock(&tasklist_lock);
6059 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
6061 void sched_show_task(struct task_struct *p)
6063 unsigned long free = 0;
6066 state = p->state ? __ffs(p->state) + 1 : 0;
6067 printk(KERN_INFO "%-13.13s %c", p->comm,
6068 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
6069 #if BITS_PER_LONG == 32
6070 if (state == TASK_RUNNING)
6071 printk(KERN_CONT " running ");
6073 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
6075 if (state == TASK_RUNNING)
6076 printk(KERN_CONT " running task ");
6078 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
6080 #ifdef CONFIG_DEBUG_STACK_USAGE
6082 unsigned long *n = end_of_stack(p);
6085 free = (unsigned long)n - (unsigned long)end_of_stack(p);
6088 printk(KERN_CONT "%5lu %5d %6d\n", free,
6089 task_pid_nr(p), task_pid_nr(p->real_parent));
6091 show_stack(p, NULL);
6094 void show_state_filter(unsigned long state_filter)
6096 struct task_struct *g, *p;
6098 #if BITS_PER_LONG == 32
6100 " task PC stack pid father\n");
6103 " task PC stack pid father\n");
6105 read_lock(&tasklist_lock);
6106 do_each_thread(g, p) {
6108 * reset the NMI-timeout, listing all files on a slow
6109 * console might take alot of time:
6111 touch_nmi_watchdog();
6112 if (!state_filter || (p->state & state_filter))
6114 } while_each_thread(g, p);
6116 touch_all_softlockup_watchdogs();
6118 #ifdef CONFIG_SCHED_DEBUG
6119 sysrq_sched_debug_show();
6121 read_unlock(&tasklist_lock);
6123 * Only show locks if all tasks are dumped:
6125 if (state_filter == -1)
6126 debug_show_all_locks();
6129 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
6131 idle->sched_class = &idle_sched_class;
6135 * init_idle - set up an idle thread for a given CPU
6136 * @idle: task in question
6137 * @cpu: cpu the idle task belongs to
6139 * NOTE: this function does not set the idle thread's NEED_RESCHED
6140 * flag, to make booting more robust.
6142 void __cpuinit init_idle(struct task_struct *idle, int cpu)
6144 struct rq *rq = cpu_rq(cpu);
6145 unsigned long flags;
6147 spin_lock_irqsave(&rq->lock, flags);
6150 idle->se.exec_start = sched_clock();
6152 idle->prio = idle->normal_prio = MAX_PRIO;
6153 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
6154 __set_task_cpu(idle, cpu);
6156 rq->curr = rq->idle = idle;
6157 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
6160 spin_unlock_irqrestore(&rq->lock, flags);
6162 /* Set the preempt count _outside_ the spinlocks! */
6163 #if defined(CONFIG_PREEMPT)
6164 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
6166 task_thread_info(idle)->preempt_count = 0;
6169 * The idle tasks have their own, simple scheduling class:
6171 idle->sched_class = &idle_sched_class;
6172 ftrace_graph_init_task(idle);
6176 * In a system that switches off the HZ timer nohz_cpu_mask
6177 * indicates which cpus entered this state. This is used
6178 * in the rcu update to wait only for active cpus. For system
6179 * which do not switch off the HZ timer nohz_cpu_mask should
6180 * always be CPU_BITS_NONE.
6182 cpumask_var_t nohz_cpu_mask;
6185 * Increase the granularity value when there are more CPUs,
6186 * because with more CPUs the 'effective latency' as visible
6187 * to users decreases. But the relationship is not linear,
6188 * so pick a second-best guess by going with the log2 of the
6191 * This idea comes from the SD scheduler of Con Kolivas:
6193 static inline void sched_init_granularity(void)
6195 unsigned int factor = 1 + ilog2(num_online_cpus());
6196 const unsigned long limit = 200000000;
6198 sysctl_sched_min_granularity *= factor;
6199 if (sysctl_sched_min_granularity > limit)
6200 sysctl_sched_min_granularity = limit;
6202 sysctl_sched_latency *= factor;
6203 if (sysctl_sched_latency > limit)
6204 sysctl_sched_latency = limit;
6206 sysctl_sched_wakeup_granularity *= factor;
6208 sysctl_sched_shares_ratelimit *= factor;
6213 * This is how migration works:
6215 * 1) we queue a struct migration_req structure in the source CPU's
6216 * runqueue and wake up that CPU's migration thread.
6217 * 2) we down() the locked semaphore => thread blocks.
6218 * 3) migration thread wakes up (implicitly it forces the migrated
6219 * thread off the CPU)
6220 * 4) it gets the migration request and checks whether the migrated
6221 * task is still in the wrong runqueue.
6222 * 5) if it's in the wrong runqueue then the migration thread removes
6223 * it and puts it into the right queue.
6224 * 6) migration thread up()s the semaphore.
6225 * 7) we wake up and the migration is done.
6229 * Change a given task's CPU affinity. Migrate the thread to a
6230 * proper CPU and schedule it away if the CPU it's executing on
6231 * is removed from the allowed bitmask.
6233 * NOTE: the caller must have a valid reference to the task, the
6234 * task must not exit() & deallocate itself prematurely. The
6235 * call is not atomic; no spinlocks may be held.
6237 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
6239 struct migration_req req;
6240 unsigned long flags;
6244 rq = task_rq_lock(p, &flags);
6245 if (!cpumask_intersects(new_mask, cpu_online_mask)) {
6250 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
6251 !cpumask_equal(&p->cpus_allowed, new_mask))) {
6256 if (p->sched_class->set_cpus_allowed)
6257 p->sched_class->set_cpus_allowed(p, new_mask);
6259 cpumask_copy(&p->cpus_allowed, new_mask);
6260 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
6263 /* Can the task run on the task's current CPU? If so, we're done */
6264 if (cpumask_test_cpu(task_cpu(p), new_mask))
6267 if (migrate_task(p, cpumask_any_and(cpu_online_mask, new_mask), &req)) {
6268 /* Need help from migration thread: drop lock and wait. */
6269 task_rq_unlock(rq, &flags);
6270 wake_up_process(rq->migration_thread);
6271 wait_for_completion(&req.done);
6272 tlb_migrate_finish(p->mm);
6276 task_rq_unlock(rq, &flags);
6280 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
6283 * Move (not current) task off this cpu, onto dest cpu. We're doing
6284 * this because either it can't run here any more (set_cpus_allowed()
6285 * away from this CPU, or CPU going down), or because we're
6286 * attempting to rebalance this task on exec (sched_exec).
6288 * So we race with normal scheduler movements, but that's OK, as long
6289 * as the task is no longer on this CPU.
6291 * Returns non-zero if task was successfully migrated.
6293 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
6295 struct rq *rq_dest, *rq_src;
6298 if (unlikely(!cpu_active(dest_cpu)))
6301 rq_src = cpu_rq(src_cpu);
6302 rq_dest = cpu_rq(dest_cpu);
6304 double_rq_lock(rq_src, rq_dest);
6305 /* Already moved. */
6306 if (task_cpu(p) != src_cpu)
6308 /* Affinity changed (again). */
6309 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
6312 on_rq = p->se.on_rq;
6314 deactivate_task(rq_src, p, 0);
6316 set_task_cpu(p, dest_cpu);
6318 activate_task(rq_dest, p, 0);
6319 check_preempt_curr(rq_dest, p, 0);
6324 double_rq_unlock(rq_src, rq_dest);
6329 * migration_thread - this is a highprio system thread that performs
6330 * thread migration by bumping thread off CPU then 'pushing' onto
6333 static int migration_thread(void *data)
6335 int cpu = (long)data;
6339 BUG_ON(rq->migration_thread != current);
6341 set_current_state(TASK_INTERRUPTIBLE);
6342 while (!kthread_should_stop()) {
6343 struct migration_req *req;
6344 struct list_head *head;
6346 spin_lock_irq(&rq->lock);
6348 if (cpu_is_offline(cpu)) {
6349 spin_unlock_irq(&rq->lock);
6353 if (rq->active_balance) {
6354 active_load_balance(rq, cpu);
6355 rq->active_balance = 0;
6358 head = &rq->migration_queue;
6360 if (list_empty(head)) {
6361 spin_unlock_irq(&rq->lock);
6363 set_current_state(TASK_INTERRUPTIBLE);
6366 req = list_entry(head->next, struct migration_req, list);
6367 list_del_init(head->next);
6369 spin_unlock(&rq->lock);
6370 __migrate_task(req->task, cpu, req->dest_cpu);
6373 complete(&req->done);
6375 __set_current_state(TASK_RUNNING);
6379 /* Wait for kthread_stop */
6380 set_current_state(TASK_INTERRUPTIBLE);
6381 while (!kthread_should_stop()) {
6383 set_current_state(TASK_INTERRUPTIBLE);
6385 __set_current_state(TASK_RUNNING);
6389 #ifdef CONFIG_HOTPLUG_CPU
6391 static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu)
6395 local_irq_disable();
6396 ret = __migrate_task(p, src_cpu, dest_cpu);
6402 * Figure out where task on dead CPU should go, use force if necessary.
6404 static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
6407 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(dead_cpu));
6410 /* Look for allowed, online CPU in same node. */
6411 for_each_cpu_and(dest_cpu, nodemask, cpu_online_mask)
6412 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
6415 /* Any allowed, online CPU? */
6416 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_online_mask);
6417 if (dest_cpu < nr_cpu_ids)
6420 /* No more Mr. Nice Guy. */
6421 if (dest_cpu >= nr_cpu_ids) {
6422 cpuset_cpus_allowed_locked(p, &p->cpus_allowed);
6423 dest_cpu = cpumask_any_and(cpu_online_mask, &p->cpus_allowed);
6426 * Don't tell them about moving exiting tasks or
6427 * kernel threads (both mm NULL), since they never
6430 if (p->mm && printk_ratelimit()) {
6431 printk(KERN_INFO "process %d (%s) no "
6432 "longer affine to cpu%d\n",
6433 task_pid_nr(p), p->comm, dead_cpu);
6438 /* It can have affinity changed while we were choosing. */
6439 if (unlikely(!__migrate_task_irq(p, dead_cpu, dest_cpu)))
6444 * While a dead CPU has no uninterruptible tasks queued at this point,
6445 * it might still have a nonzero ->nr_uninterruptible counter, because
6446 * for performance reasons the counter is not stricly tracking tasks to
6447 * their home CPUs. So we just add the counter to another CPU's counter,
6448 * to keep the global sum constant after CPU-down:
6450 static void migrate_nr_uninterruptible(struct rq *rq_src)
6452 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_online_mask));
6453 unsigned long flags;
6455 local_irq_save(flags);
6456 double_rq_lock(rq_src, rq_dest);
6457 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
6458 rq_src->nr_uninterruptible = 0;
6459 double_rq_unlock(rq_src, rq_dest);
6460 local_irq_restore(flags);
6463 /* Run through task list and migrate tasks from the dead cpu. */
6464 static void migrate_live_tasks(int src_cpu)
6466 struct task_struct *p, *t;
6468 read_lock(&tasklist_lock);
6470 do_each_thread(t, p) {
6474 if (task_cpu(p) == src_cpu)
6475 move_task_off_dead_cpu(src_cpu, p);
6476 } while_each_thread(t, p);
6478 read_unlock(&tasklist_lock);
6482 * Schedules idle task to be the next runnable task on current CPU.
6483 * It does so by boosting its priority to highest possible.
6484 * Used by CPU offline code.
6486 void sched_idle_next(void)
6488 int this_cpu = smp_processor_id();
6489 struct rq *rq = cpu_rq(this_cpu);
6490 struct task_struct *p = rq->idle;
6491 unsigned long flags;
6493 /* cpu has to be offline */
6494 BUG_ON(cpu_online(this_cpu));
6497 * Strictly not necessary since rest of the CPUs are stopped by now
6498 * and interrupts disabled on the current cpu.
6500 spin_lock_irqsave(&rq->lock, flags);
6502 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6504 update_rq_clock(rq);
6505 activate_task(rq, p, 0);
6507 spin_unlock_irqrestore(&rq->lock, flags);
6511 * Ensures that the idle task is using init_mm right before its cpu goes
6514 void idle_task_exit(void)
6516 struct mm_struct *mm = current->active_mm;
6518 BUG_ON(cpu_online(smp_processor_id()));
6521 switch_mm(mm, &init_mm, current);
6525 /* called under rq->lock with disabled interrupts */
6526 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
6528 struct rq *rq = cpu_rq(dead_cpu);
6530 /* Must be exiting, otherwise would be on tasklist. */
6531 BUG_ON(!p->exit_state);
6533 /* Cannot have done final schedule yet: would have vanished. */
6534 BUG_ON(p->state == TASK_DEAD);
6539 * Drop lock around migration; if someone else moves it,
6540 * that's OK. No task can be added to this CPU, so iteration is
6543 spin_unlock_irq(&rq->lock);
6544 move_task_off_dead_cpu(dead_cpu, p);
6545 spin_lock_irq(&rq->lock);
6550 /* release_task() removes task from tasklist, so we won't find dead tasks. */
6551 static void migrate_dead_tasks(unsigned int dead_cpu)
6553 struct rq *rq = cpu_rq(dead_cpu);
6554 struct task_struct *next;
6557 if (!rq->nr_running)
6559 update_rq_clock(rq);
6560 next = pick_next_task(rq);
6563 next->sched_class->put_prev_task(rq, next);
6564 migrate_dead(dead_cpu, next);
6568 #endif /* CONFIG_HOTPLUG_CPU */
6570 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
6572 static struct ctl_table sd_ctl_dir[] = {
6574 .procname = "sched_domain",
6580 static struct ctl_table sd_ctl_root[] = {
6582 .ctl_name = CTL_KERN,
6583 .procname = "kernel",
6585 .child = sd_ctl_dir,
6590 static struct ctl_table *sd_alloc_ctl_entry(int n)
6592 struct ctl_table *entry =
6593 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
6598 static void sd_free_ctl_entry(struct ctl_table **tablep)
6600 struct ctl_table *entry;
6603 * In the intermediate directories, both the child directory and
6604 * procname are dynamically allocated and could fail but the mode
6605 * will always be set. In the lowest directory the names are
6606 * static strings and all have proc handlers.
6608 for (entry = *tablep; entry->mode; entry++) {
6610 sd_free_ctl_entry(&entry->child);
6611 if (entry->proc_handler == NULL)
6612 kfree(entry->procname);
6620 set_table_entry(struct ctl_table *entry,
6621 const char *procname, void *data, int maxlen,
6622 mode_t mode, proc_handler *proc_handler)
6624 entry->procname = procname;
6626 entry->maxlen = maxlen;
6628 entry->proc_handler = proc_handler;
6631 static struct ctl_table *
6632 sd_alloc_ctl_domain_table(struct sched_domain *sd)
6634 struct ctl_table *table = sd_alloc_ctl_entry(13);
6639 set_table_entry(&table[0], "min_interval", &sd->min_interval,
6640 sizeof(long), 0644, proc_doulongvec_minmax);
6641 set_table_entry(&table[1], "max_interval", &sd->max_interval,
6642 sizeof(long), 0644, proc_doulongvec_minmax);
6643 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
6644 sizeof(int), 0644, proc_dointvec_minmax);
6645 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
6646 sizeof(int), 0644, proc_dointvec_minmax);
6647 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
6648 sizeof(int), 0644, proc_dointvec_minmax);
6649 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
6650 sizeof(int), 0644, proc_dointvec_minmax);
6651 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
6652 sizeof(int), 0644, proc_dointvec_minmax);
6653 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
6654 sizeof(int), 0644, proc_dointvec_minmax);
6655 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
6656 sizeof(int), 0644, proc_dointvec_minmax);
6657 set_table_entry(&table[9], "cache_nice_tries",
6658 &sd->cache_nice_tries,
6659 sizeof(int), 0644, proc_dointvec_minmax);
6660 set_table_entry(&table[10], "flags", &sd->flags,
6661 sizeof(int), 0644, proc_dointvec_minmax);
6662 set_table_entry(&table[11], "name", sd->name,
6663 CORENAME_MAX_SIZE, 0444, proc_dostring);
6664 /* &table[12] is terminator */
6669 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
6671 struct ctl_table *entry, *table;
6672 struct sched_domain *sd;
6673 int domain_num = 0, i;
6676 for_each_domain(cpu, sd)
6678 entry = table = sd_alloc_ctl_entry(domain_num + 1);
6683 for_each_domain(cpu, sd) {
6684 snprintf(buf, 32, "domain%d", i);
6685 entry->procname = kstrdup(buf, GFP_KERNEL);
6687 entry->child = sd_alloc_ctl_domain_table(sd);
6694 static struct ctl_table_header *sd_sysctl_header;
6695 static void register_sched_domain_sysctl(void)
6697 int i, cpu_num = num_online_cpus();
6698 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
6701 WARN_ON(sd_ctl_dir[0].child);
6702 sd_ctl_dir[0].child = entry;
6707 for_each_online_cpu(i) {
6708 snprintf(buf, 32, "cpu%d", i);
6709 entry->procname = kstrdup(buf, GFP_KERNEL);
6711 entry->child = sd_alloc_ctl_cpu_table(i);
6715 WARN_ON(sd_sysctl_header);
6716 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
6719 /* may be called multiple times per register */
6720 static void unregister_sched_domain_sysctl(void)
6722 if (sd_sysctl_header)
6723 unregister_sysctl_table(sd_sysctl_header);
6724 sd_sysctl_header = NULL;
6725 if (sd_ctl_dir[0].child)
6726 sd_free_ctl_entry(&sd_ctl_dir[0].child);
6729 static void register_sched_domain_sysctl(void)
6732 static void unregister_sched_domain_sysctl(void)
6737 static void set_rq_online(struct rq *rq)
6740 const struct sched_class *class;
6742 cpumask_set_cpu(rq->cpu, rq->rd->online);
6745 for_each_class(class) {
6746 if (class->rq_online)
6747 class->rq_online(rq);
6752 static void set_rq_offline(struct rq *rq)
6755 const struct sched_class *class;
6757 for_each_class(class) {
6758 if (class->rq_offline)
6759 class->rq_offline(rq);
6762 cpumask_clear_cpu(rq->cpu, rq->rd->online);
6768 * migration_call - callback that gets triggered when a CPU is added.
6769 * Here we can start up the necessary migration thread for the new CPU.
6771 static int __cpuinit
6772 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
6774 struct task_struct *p;
6775 int cpu = (long)hcpu;
6776 unsigned long flags;
6781 case CPU_UP_PREPARE:
6782 case CPU_UP_PREPARE_FROZEN:
6783 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
6786 kthread_bind(p, cpu);
6787 /* Must be high prio: stop_machine expects to yield to it. */
6788 rq = task_rq_lock(p, &flags);
6789 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6790 task_rq_unlock(rq, &flags);
6791 cpu_rq(cpu)->migration_thread = p;
6795 case CPU_ONLINE_FROZEN:
6796 /* Strictly unnecessary, as first user will wake it. */
6797 wake_up_process(cpu_rq(cpu)->migration_thread);
6799 /* Update our root-domain */
6801 spin_lock_irqsave(&rq->lock, flags);
6803 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
6807 spin_unlock_irqrestore(&rq->lock, flags);
6810 #ifdef CONFIG_HOTPLUG_CPU
6811 case CPU_UP_CANCELED:
6812 case CPU_UP_CANCELED_FROZEN:
6813 if (!cpu_rq(cpu)->migration_thread)
6815 /* Unbind it from offline cpu so it can run. Fall thru. */
6816 kthread_bind(cpu_rq(cpu)->migration_thread,
6817 cpumask_any(cpu_online_mask));
6818 kthread_stop(cpu_rq(cpu)->migration_thread);
6819 cpu_rq(cpu)->migration_thread = NULL;
6823 case CPU_DEAD_FROZEN:
6824 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
6825 migrate_live_tasks(cpu);
6827 kthread_stop(rq->migration_thread);
6828 rq->migration_thread = NULL;
6829 /* Idle task back to normal (off runqueue, low prio) */
6830 spin_lock_irq(&rq->lock);
6831 update_rq_clock(rq);
6832 deactivate_task(rq, rq->idle, 0);
6833 rq->idle->static_prio = MAX_PRIO;
6834 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
6835 rq->idle->sched_class = &idle_sched_class;
6836 migrate_dead_tasks(cpu);
6837 spin_unlock_irq(&rq->lock);
6839 migrate_nr_uninterruptible(rq);
6840 BUG_ON(rq->nr_running != 0);
6843 * No need to migrate the tasks: it was best-effort if
6844 * they didn't take sched_hotcpu_mutex. Just wake up
6847 spin_lock_irq(&rq->lock);
6848 while (!list_empty(&rq->migration_queue)) {
6849 struct migration_req *req;
6851 req = list_entry(rq->migration_queue.next,
6852 struct migration_req, list);
6853 list_del_init(&req->list);
6854 spin_unlock_irq(&rq->lock);
6855 complete(&req->done);
6856 spin_lock_irq(&rq->lock);
6858 spin_unlock_irq(&rq->lock);
6862 case CPU_DYING_FROZEN:
6863 /* Update our root-domain */
6865 spin_lock_irqsave(&rq->lock, flags);
6867 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
6870 spin_unlock_irqrestore(&rq->lock, flags);
6877 /* Register at highest priority so that task migration (migrate_all_tasks)
6878 * happens before everything else.
6880 static struct notifier_block __cpuinitdata migration_notifier = {
6881 .notifier_call = migration_call,
6885 static int __init migration_init(void)
6887 void *cpu = (void *)(long)smp_processor_id();
6890 /* Start one for the boot CPU: */
6891 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
6892 BUG_ON(err == NOTIFY_BAD);
6893 migration_call(&migration_notifier, CPU_ONLINE, cpu);
6894 register_cpu_notifier(&migration_notifier);
6898 early_initcall(migration_init);
6903 #ifdef CONFIG_SCHED_DEBUG
6905 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
6906 struct cpumask *groupmask)
6908 struct sched_group *group = sd->groups;
6911 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
6912 cpumask_clear(groupmask);
6914 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
6916 if (!(sd->flags & SD_LOAD_BALANCE)) {
6917 printk("does not load-balance\n");
6919 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
6924 printk(KERN_CONT "span %s level %s\n", str, sd->name);
6926 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
6927 printk(KERN_ERR "ERROR: domain->span does not contain "
6930 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
6931 printk(KERN_ERR "ERROR: domain->groups does not contain"
6935 printk(KERN_DEBUG "%*s groups:", level + 1, "");
6939 printk(KERN_ERR "ERROR: group is NULL\n");
6943 if (!group->__cpu_power) {
6944 printk(KERN_CONT "\n");
6945 printk(KERN_ERR "ERROR: domain->cpu_power not "
6950 if (!cpumask_weight(sched_group_cpus(group))) {
6951 printk(KERN_CONT "\n");
6952 printk(KERN_ERR "ERROR: empty group\n");
6956 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
6957 printk(KERN_CONT "\n");
6958 printk(KERN_ERR "ERROR: repeated CPUs\n");
6962 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
6964 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
6965 printk(KERN_CONT " %s", str);
6967 group = group->next;
6968 } while (group != sd->groups);
6969 printk(KERN_CONT "\n");
6971 if (!cpumask_equal(sched_domain_span(sd), groupmask))
6972 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
6975 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
6976 printk(KERN_ERR "ERROR: parent span is not a superset "
6977 "of domain->span\n");
6981 static void sched_domain_debug(struct sched_domain *sd, int cpu)
6983 cpumask_var_t groupmask;
6987 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
6991 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
6993 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
6994 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
6999 if (sched_domain_debug_one(sd, cpu, level, groupmask))
7006 free_cpumask_var(groupmask);
7008 #else /* !CONFIG_SCHED_DEBUG */
7009 # define sched_domain_debug(sd, cpu) do { } while (0)
7010 #endif /* CONFIG_SCHED_DEBUG */
7012 static int sd_degenerate(struct sched_domain *sd)
7014 if (cpumask_weight(sched_domain_span(sd)) == 1)
7017 /* Following flags need at least 2 groups */
7018 if (sd->flags & (SD_LOAD_BALANCE |
7019 SD_BALANCE_NEWIDLE |
7023 SD_SHARE_PKG_RESOURCES)) {
7024 if (sd->groups != sd->groups->next)
7028 /* Following flags don't use groups */
7029 if (sd->flags & (SD_WAKE_IDLE |
7038 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
7040 unsigned long cflags = sd->flags, pflags = parent->flags;
7042 if (sd_degenerate(parent))
7045 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
7048 /* Does parent contain flags not in child? */
7049 /* WAKE_BALANCE is a subset of WAKE_AFFINE */
7050 if (cflags & SD_WAKE_AFFINE)
7051 pflags &= ~SD_WAKE_BALANCE;
7052 /* Flags needing groups don't count if only 1 group in parent */
7053 if (parent->groups == parent->groups->next) {
7054 pflags &= ~(SD_LOAD_BALANCE |
7055 SD_BALANCE_NEWIDLE |
7059 SD_SHARE_PKG_RESOURCES);
7060 if (nr_node_ids == 1)
7061 pflags &= ~SD_SERIALIZE;
7063 if (~cflags & pflags)
7069 static void free_rootdomain(struct root_domain *rd)
7071 cpupri_cleanup(&rd->cpupri);
7073 free_cpumask_var(rd->rto_mask);
7074 free_cpumask_var(rd->online);
7075 free_cpumask_var(rd->span);
7079 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
7081 struct root_domain *old_rd = NULL;
7082 unsigned long flags;
7084 spin_lock_irqsave(&rq->lock, flags);
7089 if (cpumask_test_cpu(rq->cpu, old_rd->online))
7092 cpumask_clear_cpu(rq->cpu, old_rd->span);
7095 * If we dont want to free the old_rt yet then
7096 * set old_rd to NULL to skip the freeing later
7099 if (!atomic_dec_and_test(&old_rd->refcount))
7103 atomic_inc(&rd->refcount);
7106 cpumask_set_cpu(rq->cpu, rd->span);
7107 if (cpumask_test_cpu(rq->cpu, cpu_online_mask))
7110 spin_unlock_irqrestore(&rq->lock, flags);
7113 free_rootdomain(old_rd);
7116 static int __init_refok init_rootdomain(struct root_domain *rd, bool bootmem)
7118 memset(rd, 0, sizeof(*rd));
7121 alloc_bootmem_cpumask_var(&def_root_domain.span);
7122 alloc_bootmem_cpumask_var(&def_root_domain.online);
7123 alloc_bootmem_cpumask_var(&def_root_domain.rto_mask);
7124 cpupri_init(&rd->cpupri, true);
7128 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
7130 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
7132 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
7135 if (cpupri_init(&rd->cpupri, false) != 0)
7140 free_cpumask_var(rd->rto_mask);
7142 free_cpumask_var(rd->online);
7144 free_cpumask_var(rd->span);
7149 static void init_defrootdomain(void)
7151 init_rootdomain(&def_root_domain, true);
7153 atomic_set(&def_root_domain.refcount, 1);
7156 static struct root_domain *alloc_rootdomain(void)
7158 struct root_domain *rd;
7160 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
7164 if (init_rootdomain(rd, false) != 0) {
7173 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
7174 * hold the hotplug lock.
7177 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
7179 struct rq *rq = cpu_rq(cpu);
7180 struct sched_domain *tmp;
7182 /* Remove the sched domains which do not contribute to scheduling. */
7183 for (tmp = sd; tmp; ) {
7184 struct sched_domain *parent = tmp->parent;
7188 if (sd_parent_degenerate(tmp, parent)) {
7189 tmp->parent = parent->parent;
7191 parent->parent->child = tmp;
7196 if (sd && sd_degenerate(sd)) {
7202 sched_domain_debug(sd, cpu);
7204 rq_attach_root(rq, rd);
7205 rcu_assign_pointer(rq->sd, sd);
7208 /* cpus with isolated domains */
7209 static cpumask_var_t cpu_isolated_map;
7211 /* Setup the mask of cpus configured for isolated domains */
7212 static int __init isolated_cpu_setup(char *str)
7214 cpulist_parse(str, cpu_isolated_map);
7218 __setup("isolcpus=", isolated_cpu_setup);
7221 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
7222 * to a function which identifies what group(along with sched group) a CPU
7223 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
7224 * (due to the fact that we keep track of groups covered with a struct cpumask).
7226 * init_sched_build_groups will build a circular linked list of the groups
7227 * covered by the given span, and will set each group's ->cpumask correctly,
7228 * and ->cpu_power to 0.
7231 init_sched_build_groups(const struct cpumask *span,
7232 const struct cpumask *cpu_map,
7233 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
7234 struct sched_group **sg,
7235 struct cpumask *tmpmask),
7236 struct cpumask *covered, struct cpumask *tmpmask)
7238 struct sched_group *first = NULL, *last = NULL;
7241 cpumask_clear(covered);
7243 for_each_cpu(i, span) {
7244 struct sched_group *sg;
7245 int group = group_fn(i, cpu_map, &sg, tmpmask);
7248 if (cpumask_test_cpu(i, covered))
7251 cpumask_clear(sched_group_cpus(sg));
7252 sg->__cpu_power = 0;
7254 for_each_cpu(j, span) {
7255 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
7258 cpumask_set_cpu(j, covered);
7259 cpumask_set_cpu(j, sched_group_cpus(sg));
7270 #define SD_NODES_PER_DOMAIN 16
7275 * find_next_best_node - find the next node to include in a sched_domain
7276 * @node: node whose sched_domain we're building
7277 * @used_nodes: nodes already in the sched_domain
7279 * Find the next node to include in a given scheduling domain. Simply
7280 * finds the closest node not already in the @used_nodes map.
7282 * Should use nodemask_t.
7284 static int find_next_best_node(int node, nodemask_t *used_nodes)
7286 int i, n, val, min_val, best_node = 0;
7290 for (i = 0; i < nr_node_ids; i++) {
7291 /* Start at @node */
7292 n = (node + i) % nr_node_ids;
7294 if (!nr_cpus_node(n))
7297 /* Skip already used nodes */
7298 if (node_isset(n, *used_nodes))
7301 /* Simple min distance search */
7302 val = node_distance(node, n);
7304 if (val < min_val) {
7310 node_set(best_node, *used_nodes);
7315 * sched_domain_node_span - get a cpumask for a node's sched_domain
7316 * @node: node whose cpumask we're constructing
7317 * @span: resulting cpumask
7319 * Given a node, construct a good cpumask for its sched_domain to span. It
7320 * should be one that prevents unnecessary balancing, but also spreads tasks
7323 static void sched_domain_node_span(int node, struct cpumask *span)
7325 nodemask_t used_nodes;
7328 cpumask_clear(span);
7329 nodes_clear(used_nodes);
7331 cpumask_or(span, span, cpumask_of_node(node));
7332 node_set(node, used_nodes);
7334 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
7335 int next_node = find_next_best_node(node, &used_nodes);
7337 cpumask_or(span, span, cpumask_of_node(next_node));
7340 #endif /* CONFIG_NUMA */
7342 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
7345 * The cpus mask in sched_group and sched_domain hangs off the end.
7346 * FIXME: use cpumask_var_t or dynamic percpu alloc to avoid wasting space
7347 * for nr_cpu_ids < CONFIG_NR_CPUS.
7349 struct static_sched_group {
7350 struct sched_group sg;
7351 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
7354 struct static_sched_domain {
7355 struct sched_domain sd;
7356 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
7360 * SMT sched-domains:
7362 #ifdef CONFIG_SCHED_SMT
7363 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
7364 static DEFINE_PER_CPU(struct static_sched_group, sched_group_cpus);
7367 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
7368 struct sched_group **sg, struct cpumask *unused)
7371 *sg = &per_cpu(sched_group_cpus, cpu).sg;
7374 #endif /* CONFIG_SCHED_SMT */
7377 * multi-core sched-domains:
7379 #ifdef CONFIG_SCHED_MC
7380 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
7381 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
7382 #endif /* CONFIG_SCHED_MC */
7384 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
7386 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
7387 struct sched_group **sg, struct cpumask *mask)
7391 cpumask_and(mask, &per_cpu(cpu_sibling_map, cpu), cpu_map);
7392 group = cpumask_first(mask);
7394 *sg = &per_cpu(sched_group_core, group).sg;
7397 #elif defined(CONFIG_SCHED_MC)
7399 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
7400 struct sched_group **sg, struct cpumask *unused)
7403 *sg = &per_cpu(sched_group_core, cpu).sg;
7408 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
7409 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
7412 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
7413 struct sched_group **sg, struct cpumask *mask)
7416 #ifdef CONFIG_SCHED_MC
7417 cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map);
7418 group = cpumask_first(mask);
7419 #elif defined(CONFIG_SCHED_SMT)
7420 cpumask_and(mask, &per_cpu(cpu_sibling_map, cpu), cpu_map);
7421 group = cpumask_first(mask);
7426 *sg = &per_cpu(sched_group_phys, group).sg;
7432 * The init_sched_build_groups can't handle what we want to do with node
7433 * groups, so roll our own. Now each node has its own list of groups which
7434 * gets dynamically allocated.
7436 static DEFINE_PER_CPU(struct static_sched_domain, node_domains);
7437 static struct sched_group ***sched_group_nodes_bycpu;
7439 static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains);
7440 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
7442 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
7443 struct sched_group **sg,
7444 struct cpumask *nodemask)
7448 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map);
7449 group = cpumask_first(nodemask);
7452 *sg = &per_cpu(sched_group_allnodes, group).sg;
7456 static void init_numa_sched_groups_power(struct sched_group *group_head)
7458 struct sched_group *sg = group_head;
7464 for_each_cpu(j, sched_group_cpus(sg)) {
7465 struct sched_domain *sd;
7467 sd = &per_cpu(phys_domains, j).sd;
7468 if (j != cpumask_first(sched_group_cpus(sd->groups))) {
7470 * Only add "power" once for each
7476 sg_inc_cpu_power(sg, sd->groups->__cpu_power);
7479 } while (sg != group_head);
7481 #endif /* CONFIG_NUMA */
7484 /* Free memory allocated for various sched_group structures */
7485 static void free_sched_groups(const struct cpumask *cpu_map,
7486 struct cpumask *nodemask)
7490 for_each_cpu(cpu, cpu_map) {
7491 struct sched_group **sched_group_nodes
7492 = sched_group_nodes_bycpu[cpu];
7494 if (!sched_group_nodes)
7497 for (i = 0; i < nr_node_ids; i++) {
7498 struct sched_group *oldsg, *sg = sched_group_nodes[i];
7500 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
7501 if (cpumask_empty(nodemask))
7511 if (oldsg != sched_group_nodes[i])
7514 kfree(sched_group_nodes);
7515 sched_group_nodes_bycpu[cpu] = NULL;
7518 #else /* !CONFIG_NUMA */
7519 static void free_sched_groups(const struct cpumask *cpu_map,
7520 struct cpumask *nodemask)
7523 #endif /* CONFIG_NUMA */
7526 * Initialize sched groups cpu_power.
7528 * cpu_power indicates the capacity of sched group, which is used while
7529 * distributing the load between different sched groups in a sched domain.
7530 * Typically cpu_power for all the groups in a sched domain will be same unless
7531 * there are asymmetries in the topology. If there are asymmetries, group
7532 * having more cpu_power will pickup more load compared to the group having
7535 * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents
7536 * the maximum number of tasks a group can handle in the presence of other idle
7537 * or lightly loaded groups in the same sched domain.
7539 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
7541 struct sched_domain *child;
7542 struct sched_group *group;
7544 WARN_ON(!sd || !sd->groups);
7546 if (cpu != cpumask_first(sched_group_cpus(sd->groups)))
7551 sd->groups->__cpu_power = 0;
7554 * For perf policy, if the groups in child domain share resources
7555 * (for example cores sharing some portions of the cache hierarchy
7556 * or SMT), then set this domain groups cpu_power such that each group
7557 * can handle only one task, when there are other idle groups in the
7558 * same sched domain.
7560 if (!child || (!(sd->flags & SD_POWERSAVINGS_BALANCE) &&
7562 (SD_SHARE_CPUPOWER | SD_SHARE_PKG_RESOURCES)))) {
7563 sg_inc_cpu_power(sd->groups, SCHED_LOAD_SCALE);
7568 * add cpu_power of each child group to this groups cpu_power
7570 group = child->groups;
7572 sg_inc_cpu_power(sd->groups, group->__cpu_power);
7573 group = group->next;
7574 } while (group != child->groups);
7578 * Initializers for schedule domains
7579 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
7582 #ifdef CONFIG_SCHED_DEBUG
7583 # define SD_INIT_NAME(sd, type) sd->name = #type
7585 # define SD_INIT_NAME(sd, type) do { } while (0)
7588 #define SD_INIT(sd, type) sd_init_##type(sd)
7590 #define SD_INIT_FUNC(type) \
7591 static noinline void sd_init_##type(struct sched_domain *sd) \
7593 memset(sd, 0, sizeof(*sd)); \
7594 *sd = SD_##type##_INIT; \
7595 sd->level = SD_LV_##type; \
7596 SD_INIT_NAME(sd, type); \
7601 SD_INIT_FUNC(ALLNODES)
7604 #ifdef CONFIG_SCHED_SMT
7605 SD_INIT_FUNC(SIBLING)
7607 #ifdef CONFIG_SCHED_MC
7611 static int default_relax_domain_level = -1;
7613 static int __init setup_relax_domain_level(char *str)
7617 val = simple_strtoul(str, NULL, 0);
7618 if (val < SD_LV_MAX)
7619 default_relax_domain_level = val;
7623 __setup("relax_domain_level=", setup_relax_domain_level);
7625 static void set_domain_attribute(struct sched_domain *sd,
7626 struct sched_domain_attr *attr)
7630 if (!attr || attr->relax_domain_level < 0) {
7631 if (default_relax_domain_level < 0)
7634 request = default_relax_domain_level;
7636 request = attr->relax_domain_level;
7637 if (request < sd->level) {
7638 /* turn off idle balance on this domain */
7639 sd->flags &= ~(SD_WAKE_IDLE|SD_BALANCE_NEWIDLE);
7641 /* turn on idle balance on this domain */
7642 sd->flags |= (SD_WAKE_IDLE_FAR|SD_BALANCE_NEWIDLE);
7647 * Build sched domains for a given set of cpus and attach the sched domains
7648 * to the individual cpus
7650 static int __build_sched_domains(const struct cpumask *cpu_map,
7651 struct sched_domain_attr *attr)
7653 int i, err = -ENOMEM;
7654 struct root_domain *rd;
7655 cpumask_var_t nodemask, this_sibling_map, this_core_map, send_covered,
7658 cpumask_var_t domainspan, covered, notcovered;
7659 struct sched_group **sched_group_nodes = NULL;
7660 int sd_allnodes = 0;
7662 if (!alloc_cpumask_var(&domainspan, GFP_KERNEL))
7664 if (!alloc_cpumask_var(&covered, GFP_KERNEL))
7665 goto free_domainspan;
7666 if (!alloc_cpumask_var(¬covered, GFP_KERNEL))
7670 if (!alloc_cpumask_var(&nodemask, GFP_KERNEL))
7671 goto free_notcovered;
7672 if (!alloc_cpumask_var(&this_sibling_map, GFP_KERNEL))
7674 if (!alloc_cpumask_var(&this_core_map, GFP_KERNEL))
7675 goto free_this_sibling_map;
7676 if (!alloc_cpumask_var(&send_covered, GFP_KERNEL))
7677 goto free_this_core_map;
7678 if (!alloc_cpumask_var(&tmpmask, GFP_KERNEL))
7679 goto free_send_covered;
7683 * Allocate the per-node list of sched groups
7685 sched_group_nodes = kcalloc(nr_node_ids, sizeof(struct sched_group *),
7687 if (!sched_group_nodes) {
7688 printk(KERN_WARNING "Can not alloc sched group node list\n");
7693 rd = alloc_rootdomain();
7695 printk(KERN_WARNING "Cannot alloc root domain\n");
7696 goto free_sched_groups;
7700 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = sched_group_nodes;
7704 * Set up domains for cpus specified by the cpu_map.
7706 for_each_cpu(i, cpu_map) {
7707 struct sched_domain *sd = NULL, *p;
7709 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(i)), cpu_map);
7712 if (cpumask_weight(cpu_map) >
7713 SD_NODES_PER_DOMAIN*cpumask_weight(nodemask)) {
7714 sd = &per_cpu(allnodes_domains, i).sd;
7715 SD_INIT(sd, ALLNODES);
7716 set_domain_attribute(sd, attr);
7717 cpumask_copy(sched_domain_span(sd), cpu_map);
7718 cpu_to_allnodes_group(i, cpu_map, &sd->groups, tmpmask);
7724 sd = &per_cpu(node_domains, i).sd;
7726 set_domain_attribute(sd, attr);
7727 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
7731 cpumask_and(sched_domain_span(sd),
7732 sched_domain_span(sd), cpu_map);
7736 sd = &per_cpu(phys_domains, i).sd;
7738 set_domain_attribute(sd, attr);
7739 cpumask_copy(sched_domain_span(sd), nodemask);
7743 cpu_to_phys_group(i, cpu_map, &sd->groups, tmpmask);
7745 #ifdef CONFIG_SCHED_MC
7747 sd = &per_cpu(core_domains, i).sd;
7749 set_domain_attribute(sd, attr);
7750 cpumask_and(sched_domain_span(sd), cpu_map,
7751 cpu_coregroup_mask(i));
7754 cpu_to_core_group(i, cpu_map, &sd->groups, tmpmask);
7757 #ifdef CONFIG_SCHED_SMT
7759 sd = &per_cpu(cpu_domains, i).sd;
7760 SD_INIT(sd, SIBLING);
7761 set_domain_attribute(sd, attr);
7762 cpumask_and(sched_domain_span(sd),
7763 &per_cpu(cpu_sibling_map, i), cpu_map);
7766 cpu_to_cpu_group(i, cpu_map, &sd->groups, tmpmask);
7770 #ifdef CONFIG_SCHED_SMT
7771 /* Set up CPU (sibling) groups */
7772 for_each_cpu(i, cpu_map) {
7773 cpumask_and(this_sibling_map,
7774 &per_cpu(cpu_sibling_map, i), cpu_map);
7775 if (i != cpumask_first(this_sibling_map))
7778 init_sched_build_groups(this_sibling_map, cpu_map,
7780 send_covered, tmpmask);
7784 #ifdef CONFIG_SCHED_MC
7785 /* Set up multi-core groups */
7786 for_each_cpu(i, cpu_map) {
7787 cpumask_and(this_core_map, cpu_coregroup_mask(i), cpu_map);
7788 if (i != cpumask_first(this_core_map))
7791 init_sched_build_groups(this_core_map, cpu_map,
7793 send_covered, tmpmask);
7797 /* Set up physical groups */
7798 for (i = 0; i < nr_node_ids; i++) {
7799 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
7800 if (cpumask_empty(nodemask))
7803 init_sched_build_groups(nodemask, cpu_map,
7805 send_covered, tmpmask);
7809 /* Set up node groups */
7811 init_sched_build_groups(cpu_map, cpu_map,
7812 &cpu_to_allnodes_group,
7813 send_covered, tmpmask);
7816 for (i = 0; i < nr_node_ids; i++) {
7817 /* Set up node groups */
7818 struct sched_group *sg, *prev;
7821 cpumask_clear(covered);
7822 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
7823 if (cpumask_empty(nodemask)) {
7824 sched_group_nodes[i] = NULL;
7828 sched_domain_node_span(i, domainspan);
7829 cpumask_and(domainspan, domainspan, cpu_map);
7831 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
7834 printk(KERN_WARNING "Can not alloc domain group for "
7838 sched_group_nodes[i] = sg;
7839 for_each_cpu(j, nodemask) {
7840 struct sched_domain *sd;
7842 sd = &per_cpu(node_domains, j).sd;
7845 sg->__cpu_power = 0;
7846 cpumask_copy(sched_group_cpus(sg), nodemask);
7848 cpumask_or(covered, covered, nodemask);
7851 for (j = 0; j < nr_node_ids; j++) {
7852 int n = (i + j) % nr_node_ids;
7854 cpumask_complement(notcovered, covered);
7855 cpumask_and(tmpmask, notcovered, cpu_map);
7856 cpumask_and(tmpmask, tmpmask, domainspan);
7857 if (cpumask_empty(tmpmask))
7860 cpumask_and(tmpmask, tmpmask, cpumask_of_node(n));
7861 if (cpumask_empty(tmpmask))
7864 sg = kmalloc_node(sizeof(struct sched_group) +
7869 "Can not alloc domain group for node %d\n", j);
7872 sg->__cpu_power = 0;
7873 cpumask_copy(sched_group_cpus(sg), tmpmask);
7874 sg->next = prev->next;
7875 cpumask_or(covered, covered, tmpmask);
7882 /* Calculate CPU power for physical packages and nodes */
7883 #ifdef CONFIG_SCHED_SMT
7884 for_each_cpu(i, cpu_map) {
7885 struct sched_domain *sd = &per_cpu(cpu_domains, i).sd;
7887 init_sched_groups_power(i, sd);
7890 #ifdef CONFIG_SCHED_MC
7891 for_each_cpu(i, cpu_map) {
7892 struct sched_domain *sd = &per_cpu(core_domains, i).sd;
7894 init_sched_groups_power(i, sd);
7898 for_each_cpu(i, cpu_map) {
7899 struct sched_domain *sd = &per_cpu(phys_domains, i).sd;
7901 init_sched_groups_power(i, sd);
7905 for (i = 0; i < nr_node_ids; i++)
7906 init_numa_sched_groups_power(sched_group_nodes[i]);
7909 struct sched_group *sg;
7911 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
7913 init_numa_sched_groups_power(sg);
7917 /* Attach the domains */
7918 for_each_cpu(i, cpu_map) {
7919 struct sched_domain *sd;
7920 #ifdef CONFIG_SCHED_SMT
7921 sd = &per_cpu(cpu_domains, i).sd;
7922 #elif defined(CONFIG_SCHED_MC)
7923 sd = &per_cpu(core_domains, i).sd;
7925 sd = &per_cpu(phys_domains, i).sd;
7927 cpu_attach_domain(sd, rd, i);
7933 free_cpumask_var(tmpmask);
7935 free_cpumask_var(send_covered);
7937 free_cpumask_var(this_core_map);
7938 free_this_sibling_map:
7939 free_cpumask_var(this_sibling_map);
7941 free_cpumask_var(nodemask);
7944 free_cpumask_var(notcovered);
7946 free_cpumask_var(covered);
7948 free_cpumask_var(domainspan);
7955 kfree(sched_group_nodes);
7961 free_sched_groups(cpu_map, tmpmask);
7962 free_rootdomain(rd);
7967 static int build_sched_domains(const struct cpumask *cpu_map)
7969 return __build_sched_domains(cpu_map, NULL);
7972 static struct cpumask *doms_cur; /* current sched domains */
7973 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
7974 static struct sched_domain_attr *dattr_cur;
7975 /* attribues of custom domains in 'doms_cur' */
7978 * Special case: If a kmalloc of a doms_cur partition (array of
7979 * cpumask) fails, then fallback to a single sched domain,
7980 * as determined by the single cpumask fallback_doms.
7982 static cpumask_var_t fallback_doms;
7985 * arch_update_cpu_topology lets virtualized architectures update the
7986 * cpu core maps. It is supposed to return 1 if the topology changed
7987 * or 0 if it stayed the same.
7989 int __attribute__((weak)) arch_update_cpu_topology(void)
7995 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7996 * For now this just excludes isolated cpus, but could be used to
7997 * exclude other special cases in the future.
7999 static int arch_init_sched_domains(const struct cpumask *cpu_map)
8003 arch_update_cpu_topology();
8005 doms_cur = kmalloc(cpumask_size(), GFP_KERNEL);
8007 doms_cur = fallback_doms;
8008 cpumask_andnot(doms_cur, cpu_map, cpu_isolated_map);
8010 err = build_sched_domains(doms_cur);
8011 register_sched_domain_sysctl();
8016 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
8017 struct cpumask *tmpmask)
8019 free_sched_groups(cpu_map, tmpmask);
8023 * Detach sched domains from a group of cpus specified in cpu_map
8024 * These cpus will now be attached to the NULL domain
8026 static void detach_destroy_domains(const struct cpumask *cpu_map)
8028 /* Save because hotplug lock held. */
8029 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
8032 for_each_cpu(i, cpu_map)
8033 cpu_attach_domain(NULL, &def_root_domain, i);
8034 synchronize_sched();
8035 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
8038 /* handle null as "default" */
8039 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
8040 struct sched_domain_attr *new, int idx_new)
8042 struct sched_domain_attr tmp;
8049 return !memcmp(cur ? (cur + idx_cur) : &tmp,
8050 new ? (new + idx_new) : &tmp,
8051 sizeof(struct sched_domain_attr));
8055 * Partition sched domains as specified by the 'ndoms_new'
8056 * cpumasks in the array doms_new[] of cpumasks. This compares
8057 * doms_new[] to the current sched domain partitioning, doms_cur[].
8058 * It destroys each deleted domain and builds each new domain.
8060 * 'doms_new' is an array of cpumask's of length 'ndoms_new'.
8061 * The masks don't intersect (don't overlap.) We should setup one
8062 * sched domain for each mask. CPUs not in any of the cpumasks will
8063 * not be load balanced. If the same cpumask appears both in the
8064 * current 'doms_cur' domains and in the new 'doms_new', we can leave
8067 * The passed in 'doms_new' should be kmalloc'd. This routine takes
8068 * ownership of it and will kfree it when done with it. If the caller
8069 * failed the kmalloc call, then it can pass in doms_new == NULL &&
8070 * ndoms_new == 1, and partition_sched_domains() will fallback to
8071 * the single partition 'fallback_doms', it also forces the domains
8074 * If doms_new == NULL it will be replaced with cpu_online_mask.
8075 * ndoms_new == 0 is a special case for destroying existing domains,
8076 * and it will not create the default domain.
8078 * Call with hotplug lock held
8080 /* FIXME: Change to struct cpumask *doms_new[] */
8081 void partition_sched_domains(int ndoms_new, struct cpumask *doms_new,
8082 struct sched_domain_attr *dattr_new)
8087 mutex_lock(&sched_domains_mutex);
8089 /* always unregister in case we don't destroy any domains */
8090 unregister_sched_domain_sysctl();
8092 /* Let architecture update cpu core mappings. */
8093 new_topology = arch_update_cpu_topology();
8095 n = doms_new ? ndoms_new : 0;
8097 /* Destroy deleted domains */
8098 for (i = 0; i < ndoms_cur; i++) {
8099 for (j = 0; j < n && !new_topology; j++) {
8100 if (cpumask_equal(&doms_cur[i], &doms_new[j])
8101 && dattrs_equal(dattr_cur, i, dattr_new, j))
8104 /* no match - a current sched domain not in new doms_new[] */
8105 detach_destroy_domains(doms_cur + i);
8110 if (doms_new == NULL) {
8112 doms_new = fallback_doms;
8113 cpumask_andnot(&doms_new[0], cpu_online_mask, cpu_isolated_map);
8114 WARN_ON_ONCE(dattr_new);
8117 /* Build new domains */
8118 for (i = 0; i < ndoms_new; i++) {
8119 for (j = 0; j < ndoms_cur && !new_topology; j++) {
8120 if (cpumask_equal(&doms_new[i], &doms_cur[j])
8121 && dattrs_equal(dattr_new, i, dattr_cur, j))
8124 /* no match - add a new doms_new */
8125 __build_sched_domains(doms_new + i,
8126 dattr_new ? dattr_new + i : NULL);
8131 /* Remember the new sched domains */
8132 if (doms_cur != fallback_doms)
8134 kfree(dattr_cur); /* kfree(NULL) is safe */
8135 doms_cur = doms_new;
8136 dattr_cur = dattr_new;
8137 ndoms_cur = ndoms_new;
8139 register_sched_domain_sysctl();
8141 mutex_unlock(&sched_domains_mutex);
8144 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
8145 static void arch_reinit_sched_domains(void)
8149 /* Destroy domains first to force the rebuild */
8150 partition_sched_domains(0, NULL, NULL);
8152 rebuild_sched_domains();
8156 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
8158 unsigned int level = 0;
8160 if (sscanf(buf, "%u", &level) != 1)
8164 * level is always be positive so don't check for
8165 * level < POWERSAVINGS_BALANCE_NONE which is 0
8166 * What happens on 0 or 1 byte write,
8167 * need to check for count as well?
8170 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
8174 sched_smt_power_savings = level;
8176 sched_mc_power_savings = level;
8178 arch_reinit_sched_domains();
8183 #ifdef CONFIG_SCHED_MC
8184 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
8187 return sprintf(page, "%u\n", sched_mc_power_savings);
8189 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
8190 const char *buf, size_t count)
8192 return sched_power_savings_store(buf, count, 0);
8194 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
8195 sched_mc_power_savings_show,
8196 sched_mc_power_savings_store);
8199 #ifdef CONFIG_SCHED_SMT
8200 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
8203 return sprintf(page, "%u\n", sched_smt_power_savings);
8205 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
8206 const char *buf, size_t count)
8208 return sched_power_savings_store(buf, count, 1);
8210 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
8211 sched_smt_power_savings_show,
8212 sched_smt_power_savings_store);
8215 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
8219 #ifdef CONFIG_SCHED_SMT
8221 err = sysfs_create_file(&cls->kset.kobj,
8222 &attr_sched_smt_power_savings.attr);
8224 #ifdef CONFIG_SCHED_MC
8225 if (!err && mc_capable())
8226 err = sysfs_create_file(&cls->kset.kobj,
8227 &attr_sched_mc_power_savings.attr);
8231 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
8233 #ifndef CONFIG_CPUSETS
8235 * Add online and remove offline CPUs from the scheduler domains.
8236 * When cpusets are enabled they take over this function.
8238 static int update_sched_domains(struct notifier_block *nfb,
8239 unsigned long action, void *hcpu)
8243 case CPU_ONLINE_FROZEN:
8245 case CPU_DEAD_FROZEN:
8246 partition_sched_domains(1, NULL, NULL);
8255 static int update_runtime(struct notifier_block *nfb,
8256 unsigned long action, void *hcpu)
8258 int cpu = (int)(long)hcpu;
8261 case CPU_DOWN_PREPARE:
8262 case CPU_DOWN_PREPARE_FROZEN:
8263 disable_runtime(cpu_rq(cpu));
8266 case CPU_DOWN_FAILED:
8267 case CPU_DOWN_FAILED_FROZEN:
8269 case CPU_ONLINE_FROZEN:
8270 enable_runtime(cpu_rq(cpu));
8278 void __init sched_init_smp(void)
8280 cpumask_var_t non_isolated_cpus;
8282 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
8284 #if defined(CONFIG_NUMA)
8285 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
8287 BUG_ON(sched_group_nodes_bycpu == NULL);
8290 mutex_lock(&sched_domains_mutex);
8291 arch_init_sched_domains(cpu_online_mask);
8292 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
8293 if (cpumask_empty(non_isolated_cpus))
8294 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
8295 mutex_unlock(&sched_domains_mutex);
8298 #ifndef CONFIG_CPUSETS
8299 /* XXX: Theoretical race here - CPU may be hotplugged now */
8300 hotcpu_notifier(update_sched_domains, 0);
8303 /* RT runtime code needs to handle some hotplug events */
8304 hotcpu_notifier(update_runtime, 0);
8308 /* Move init over to a non-isolated CPU */
8309 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
8311 sched_init_granularity();
8312 free_cpumask_var(non_isolated_cpus);
8314 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
8315 init_sched_rt_class();
8318 void __init sched_init_smp(void)
8320 sched_init_granularity();
8322 #endif /* CONFIG_SMP */
8324 int in_sched_functions(unsigned long addr)
8326 return in_lock_functions(addr) ||
8327 (addr >= (unsigned long)__sched_text_start
8328 && addr < (unsigned long)__sched_text_end);
8331 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
8333 cfs_rq->tasks_timeline = RB_ROOT;
8334 INIT_LIST_HEAD(&cfs_rq->tasks);
8335 #ifdef CONFIG_FAIR_GROUP_SCHED
8338 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
8341 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
8343 struct rt_prio_array *array;
8346 array = &rt_rq->active;
8347 for (i = 0; i < MAX_RT_PRIO; i++) {
8348 INIT_LIST_HEAD(array->queue + i);
8349 __clear_bit(i, array->bitmap);
8351 /* delimiter for bitsearch: */
8352 __set_bit(MAX_RT_PRIO, array->bitmap);
8354 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
8355 rt_rq->highest_prio.curr = MAX_RT_PRIO;
8357 rt_rq->highest_prio.next = MAX_RT_PRIO;
8361 rt_rq->rt_nr_migratory = 0;
8362 rt_rq->overloaded = 0;
8363 plist_head_init(&rq->rt.pushable_tasks, &rq->lock);
8367 rt_rq->rt_throttled = 0;
8368 rt_rq->rt_runtime = 0;
8369 spin_lock_init(&rt_rq->rt_runtime_lock);
8371 #ifdef CONFIG_RT_GROUP_SCHED
8372 rt_rq->rt_nr_boosted = 0;
8377 #ifdef CONFIG_FAIR_GROUP_SCHED
8378 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
8379 struct sched_entity *se, int cpu, int add,
8380 struct sched_entity *parent)
8382 struct rq *rq = cpu_rq(cpu);
8383 tg->cfs_rq[cpu] = cfs_rq;
8384 init_cfs_rq(cfs_rq, rq);
8387 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
8390 /* se could be NULL for init_task_group */
8395 se->cfs_rq = &rq->cfs;
8397 se->cfs_rq = parent->my_q;
8400 se->load.weight = tg->shares;
8401 se->load.inv_weight = 0;
8402 se->parent = parent;
8406 #ifdef CONFIG_RT_GROUP_SCHED
8407 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
8408 struct sched_rt_entity *rt_se, int cpu, int add,
8409 struct sched_rt_entity *parent)
8411 struct rq *rq = cpu_rq(cpu);
8413 tg->rt_rq[cpu] = rt_rq;
8414 init_rt_rq(rt_rq, rq);
8416 rt_rq->rt_se = rt_se;
8417 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
8419 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
8421 tg->rt_se[cpu] = rt_se;
8426 rt_se->rt_rq = &rq->rt;
8428 rt_se->rt_rq = parent->my_q;
8430 rt_se->my_q = rt_rq;
8431 rt_se->parent = parent;
8432 INIT_LIST_HEAD(&rt_se->run_list);
8436 void __init sched_init(void)
8439 unsigned long alloc_size = 0, ptr;
8441 #ifdef CONFIG_FAIR_GROUP_SCHED
8442 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8444 #ifdef CONFIG_RT_GROUP_SCHED
8445 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8447 #ifdef CONFIG_USER_SCHED
8451 * As sched_init() is called before page_alloc is setup,
8452 * we use alloc_bootmem().
8455 ptr = (unsigned long)alloc_bootmem(alloc_size);
8457 #ifdef CONFIG_FAIR_GROUP_SCHED
8458 init_task_group.se = (struct sched_entity **)ptr;
8459 ptr += nr_cpu_ids * sizeof(void **);
8461 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
8462 ptr += nr_cpu_ids * sizeof(void **);
8464 #ifdef CONFIG_USER_SCHED
8465 root_task_group.se = (struct sched_entity **)ptr;
8466 ptr += nr_cpu_ids * sizeof(void **);
8468 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
8469 ptr += nr_cpu_ids * sizeof(void **);
8470 #endif /* CONFIG_USER_SCHED */
8471 #endif /* CONFIG_FAIR_GROUP_SCHED */
8472 #ifdef CONFIG_RT_GROUP_SCHED
8473 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
8474 ptr += nr_cpu_ids * sizeof(void **);
8476 init_task_group.rt_rq = (struct rt_rq **)ptr;
8477 ptr += nr_cpu_ids * sizeof(void **);
8479 #ifdef CONFIG_USER_SCHED
8480 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
8481 ptr += nr_cpu_ids * sizeof(void **);
8483 root_task_group.rt_rq = (struct rt_rq **)ptr;
8484 ptr += nr_cpu_ids * sizeof(void **);
8485 #endif /* CONFIG_USER_SCHED */
8486 #endif /* CONFIG_RT_GROUP_SCHED */
8490 init_defrootdomain();
8493 init_rt_bandwidth(&def_rt_bandwidth,
8494 global_rt_period(), global_rt_runtime());
8496 #ifdef CONFIG_RT_GROUP_SCHED
8497 init_rt_bandwidth(&init_task_group.rt_bandwidth,
8498 global_rt_period(), global_rt_runtime());
8499 #ifdef CONFIG_USER_SCHED
8500 init_rt_bandwidth(&root_task_group.rt_bandwidth,
8501 global_rt_period(), RUNTIME_INF);
8502 #endif /* CONFIG_USER_SCHED */
8503 #endif /* CONFIG_RT_GROUP_SCHED */
8505 #ifdef CONFIG_GROUP_SCHED
8506 list_add(&init_task_group.list, &task_groups);
8507 INIT_LIST_HEAD(&init_task_group.children);
8509 #ifdef CONFIG_USER_SCHED
8510 INIT_LIST_HEAD(&root_task_group.children);
8511 init_task_group.parent = &root_task_group;
8512 list_add(&init_task_group.siblings, &root_task_group.children);
8513 #endif /* CONFIG_USER_SCHED */
8514 #endif /* CONFIG_GROUP_SCHED */
8516 for_each_possible_cpu(i) {
8520 spin_lock_init(&rq->lock);
8522 init_cfs_rq(&rq->cfs, rq);
8523 init_rt_rq(&rq->rt, rq);
8524 #ifdef CONFIG_FAIR_GROUP_SCHED
8525 init_task_group.shares = init_task_group_load;
8526 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
8527 #ifdef CONFIG_CGROUP_SCHED
8529 * How much cpu bandwidth does init_task_group get?
8531 * In case of task-groups formed thr' the cgroup filesystem, it
8532 * gets 100% of the cpu resources in the system. This overall
8533 * system cpu resource is divided among the tasks of
8534 * init_task_group and its child task-groups in a fair manner,
8535 * based on each entity's (task or task-group's) weight
8536 * (se->load.weight).
8538 * In other words, if init_task_group has 10 tasks of weight
8539 * 1024) and two child groups A0 and A1 (of weight 1024 each),
8540 * then A0's share of the cpu resource is:
8542 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
8544 * We achieve this by letting init_task_group's tasks sit
8545 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
8547 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
8548 #elif defined CONFIG_USER_SCHED
8549 root_task_group.shares = NICE_0_LOAD;
8550 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL);
8552 * In case of task-groups formed thr' the user id of tasks,
8553 * init_task_group represents tasks belonging to root user.
8554 * Hence it forms a sibling of all subsequent groups formed.
8555 * In this case, init_task_group gets only a fraction of overall
8556 * system cpu resource, based on the weight assigned to root
8557 * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished
8558 * by letting tasks of init_task_group sit in a separate cfs_rq
8559 * (init_cfs_rq) and having one entity represent this group of
8560 * tasks in rq->cfs (i.e init_task_group->se[] != NULL).
8562 init_tg_cfs_entry(&init_task_group,
8563 &per_cpu(init_cfs_rq, i),
8564 &per_cpu(init_sched_entity, i), i, 1,
8565 root_task_group.se[i]);
8568 #endif /* CONFIG_FAIR_GROUP_SCHED */
8570 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
8571 #ifdef CONFIG_RT_GROUP_SCHED
8572 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
8573 #ifdef CONFIG_CGROUP_SCHED
8574 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
8575 #elif defined CONFIG_USER_SCHED
8576 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL);
8577 init_tg_rt_entry(&init_task_group,
8578 &per_cpu(init_rt_rq, i),
8579 &per_cpu(init_sched_rt_entity, i), i, 1,
8580 root_task_group.rt_se[i]);
8584 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
8585 rq->cpu_load[j] = 0;
8589 rq->active_balance = 0;
8590 rq->next_balance = jiffies;
8594 rq->migration_thread = NULL;
8595 INIT_LIST_HEAD(&rq->migration_queue);
8596 rq_attach_root(rq, &def_root_domain);
8599 atomic_set(&rq->nr_iowait, 0);
8602 set_load_weight(&init_task);
8604 #ifdef CONFIG_PREEMPT_NOTIFIERS
8605 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
8609 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
8612 #ifdef CONFIG_RT_MUTEXES
8613 plist_head_init(&init_task.pi_waiters, &init_task.pi_lock);
8617 * The boot idle thread does lazy MMU switching as well:
8619 atomic_inc(&init_mm.mm_count);
8620 enter_lazy_tlb(&init_mm, current);
8623 * Make us the idle thread. Technically, schedule() should not be
8624 * called from this thread, however somewhere below it might be,
8625 * but because we are the idle thread, we just pick up running again
8626 * when this runqueue becomes "idle".
8628 init_idle(current, smp_processor_id());
8630 * During early bootup we pretend to be a normal task:
8632 current->sched_class = &fair_sched_class;
8634 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
8635 alloc_bootmem_cpumask_var(&nohz_cpu_mask);
8638 alloc_bootmem_cpumask_var(&nohz.cpu_mask);
8640 alloc_bootmem_cpumask_var(&cpu_isolated_map);
8643 scheduler_running = 1;
8646 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
8647 void __might_sleep(char *file, int line)
8650 static unsigned long prev_jiffy; /* ratelimiting */
8652 if ((!in_atomic() && !irqs_disabled()) ||
8653 system_state != SYSTEM_RUNNING || oops_in_progress)
8655 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
8657 prev_jiffy = jiffies;
8660 "BUG: sleeping function called from invalid context at %s:%d\n",
8663 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
8664 in_atomic(), irqs_disabled(),
8665 current->pid, current->comm);
8667 debug_show_held_locks(current);
8668 if (irqs_disabled())
8669 print_irqtrace_events(current);
8673 EXPORT_SYMBOL(__might_sleep);
8676 #ifdef CONFIG_MAGIC_SYSRQ
8677 static void normalize_task(struct rq *rq, struct task_struct *p)
8681 update_rq_clock(rq);
8682 on_rq = p->se.on_rq;
8684 deactivate_task(rq, p, 0);
8685 __setscheduler(rq, p, SCHED_NORMAL, 0);
8687 activate_task(rq, p, 0);
8688 resched_task(rq->curr);
8692 void normalize_rt_tasks(void)
8694 struct task_struct *g, *p;
8695 unsigned long flags;
8698 read_lock_irqsave(&tasklist_lock, flags);
8699 do_each_thread(g, p) {
8701 * Only normalize user tasks:
8706 p->se.exec_start = 0;
8707 #ifdef CONFIG_SCHEDSTATS
8708 p->se.wait_start = 0;
8709 p->se.sleep_start = 0;
8710 p->se.block_start = 0;
8715 * Renice negative nice level userspace
8718 if (TASK_NICE(p) < 0 && p->mm)
8719 set_user_nice(p, 0);
8723 spin_lock(&p->pi_lock);
8724 rq = __task_rq_lock(p);
8726 normalize_task(rq, p);
8728 __task_rq_unlock(rq);
8729 spin_unlock(&p->pi_lock);
8730 } while_each_thread(g, p);
8732 read_unlock_irqrestore(&tasklist_lock, flags);
8735 #endif /* CONFIG_MAGIC_SYSRQ */
8739 * These functions are only useful for the IA64 MCA handling.
8741 * They can only be called when the whole system has been
8742 * stopped - every CPU needs to be quiescent, and no scheduling
8743 * activity can take place. Using them for anything else would
8744 * be a serious bug, and as a result, they aren't even visible
8745 * under any other configuration.
8749 * curr_task - return the current task for a given cpu.
8750 * @cpu: the processor in question.
8752 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8754 struct task_struct *curr_task(int cpu)
8756 return cpu_curr(cpu);
8760 * set_curr_task - set the current task for a given cpu.
8761 * @cpu: the processor in question.
8762 * @p: the task pointer to set.
8764 * Description: This function must only be used when non-maskable interrupts
8765 * are serviced on a separate stack. It allows the architecture to switch the
8766 * notion of the current task on a cpu in a non-blocking manner. This function
8767 * must be called with all CPU's synchronized, and interrupts disabled, the
8768 * and caller must save the original value of the current task (see
8769 * curr_task() above) and restore that value before reenabling interrupts and
8770 * re-starting the system.
8772 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8774 void set_curr_task(int cpu, struct task_struct *p)
8781 #ifdef CONFIG_FAIR_GROUP_SCHED
8782 static void free_fair_sched_group(struct task_group *tg)
8786 for_each_possible_cpu(i) {
8788 kfree(tg->cfs_rq[i]);
8798 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8800 struct cfs_rq *cfs_rq;
8801 struct sched_entity *se;
8805 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
8808 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
8812 tg->shares = NICE_0_LOAD;
8814 for_each_possible_cpu(i) {
8817 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
8818 GFP_KERNEL, cpu_to_node(i));
8822 se = kzalloc_node(sizeof(struct sched_entity),
8823 GFP_KERNEL, cpu_to_node(i));
8827 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
8836 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8838 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
8839 &cpu_rq(cpu)->leaf_cfs_rq_list);
8842 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8844 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
8846 #else /* !CONFG_FAIR_GROUP_SCHED */
8847 static inline void free_fair_sched_group(struct task_group *tg)
8852 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8857 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8861 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8864 #endif /* CONFIG_FAIR_GROUP_SCHED */
8866 #ifdef CONFIG_RT_GROUP_SCHED
8867 static void free_rt_sched_group(struct task_group *tg)
8871 destroy_rt_bandwidth(&tg->rt_bandwidth);
8873 for_each_possible_cpu(i) {
8875 kfree(tg->rt_rq[i]);
8877 kfree(tg->rt_se[i]);
8885 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8887 struct rt_rq *rt_rq;
8888 struct sched_rt_entity *rt_se;
8892 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
8895 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
8899 init_rt_bandwidth(&tg->rt_bandwidth,
8900 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
8902 for_each_possible_cpu(i) {
8905 rt_rq = kzalloc_node(sizeof(struct rt_rq),
8906 GFP_KERNEL, cpu_to_node(i));
8910 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
8911 GFP_KERNEL, cpu_to_node(i));
8915 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
8924 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8926 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
8927 &cpu_rq(cpu)->leaf_rt_rq_list);
8930 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8932 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
8934 #else /* !CONFIG_RT_GROUP_SCHED */
8935 static inline void free_rt_sched_group(struct task_group *tg)
8940 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8945 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8949 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8952 #endif /* CONFIG_RT_GROUP_SCHED */
8954 #ifdef CONFIG_GROUP_SCHED
8955 static void free_sched_group(struct task_group *tg)
8957 free_fair_sched_group(tg);
8958 free_rt_sched_group(tg);
8962 /* allocate runqueue etc for a new task group */
8963 struct task_group *sched_create_group(struct task_group *parent)
8965 struct task_group *tg;
8966 unsigned long flags;
8969 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
8971 return ERR_PTR(-ENOMEM);
8973 if (!alloc_fair_sched_group(tg, parent))
8976 if (!alloc_rt_sched_group(tg, parent))
8979 spin_lock_irqsave(&task_group_lock, flags);
8980 for_each_possible_cpu(i) {
8981 register_fair_sched_group(tg, i);
8982 register_rt_sched_group(tg, i);
8984 list_add_rcu(&tg->list, &task_groups);
8986 WARN_ON(!parent); /* root should already exist */
8988 tg->parent = parent;
8989 INIT_LIST_HEAD(&tg->children);
8990 list_add_rcu(&tg->siblings, &parent->children);
8991 spin_unlock_irqrestore(&task_group_lock, flags);
8996 free_sched_group(tg);
8997 return ERR_PTR(-ENOMEM);
9000 /* rcu callback to free various structures associated with a task group */
9001 static void free_sched_group_rcu(struct rcu_head *rhp)
9003 /* now it should be safe to free those cfs_rqs */
9004 free_sched_group(container_of(rhp, struct task_group, rcu));
9007 /* Destroy runqueue etc associated with a task group */
9008 void sched_destroy_group(struct task_group *tg)
9010 unsigned long flags;
9013 spin_lock_irqsave(&task_group_lock, flags);
9014 for_each_possible_cpu(i) {
9015 unregister_fair_sched_group(tg, i);
9016 unregister_rt_sched_group(tg, i);
9018 list_del_rcu(&tg->list);
9019 list_del_rcu(&tg->siblings);
9020 spin_unlock_irqrestore(&task_group_lock, flags);
9022 /* wait for possible concurrent references to cfs_rqs complete */
9023 call_rcu(&tg->rcu, free_sched_group_rcu);
9026 /* change task's runqueue when it moves between groups.
9027 * The caller of this function should have put the task in its new group
9028 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
9029 * reflect its new group.
9031 void sched_move_task(struct task_struct *tsk)
9034 unsigned long flags;
9037 rq = task_rq_lock(tsk, &flags);
9039 update_rq_clock(rq);
9041 running = task_current(rq, tsk);
9042 on_rq = tsk->se.on_rq;
9045 dequeue_task(rq, tsk, 0);
9046 if (unlikely(running))
9047 tsk->sched_class->put_prev_task(rq, tsk);
9049 set_task_rq(tsk, task_cpu(tsk));
9051 #ifdef CONFIG_FAIR_GROUP_SCHED
9052 if (tsk->sched_class->moved_group)
9053 tsk->sched_class->moved_group(tsk);
9056 if (unlikely(running))
9057 tsk->sched_class->set_curr_task(rq);
9059 enqueue_task(rq, tsk, 0);
9061 task_rq_unlock(rq, &flags);
9063 #endif /* CONFIG_GROUP_SCHED */
9065 #ifdef CONFIG_FAIR_GROUP_SCHED
9066 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
9068 struct cfs_rq *cfs_rq = se->cfs_rq;
9073 dequeue_entity(cfs_rq, se, 0);
9075 se->load.weight = shares;
9076 se->load.inv_weight = 0;
9079 enqueue_entity(cfs_rq, se, 0);
9082 static void set_se_shares(struct sched_entity *se, unsigned long shares)
9084 struct cfs_rq *cfs_rq = se->cfs_rq;
9085 struct rq *rq = cfs_rq->rq;
9086 unsigned long flags;
9088 spin_lock_irqsave(&rq->lock, flags);
9089 __set_se_shares(se, shares);
9090 spin_unlock_irqrestore(&rq->lock, flags);
9093 static DEFINE_MUTEX(shares_mutex);
9095 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
9098 unsigned long flags;
9101 * We can't change the weight of the root cgroup.
9106 if (shares < MIN_SHARES)
9107 shares = MIN_SHARES;
9108 else if (shares > MAX_SHARES)
9109 shares = MAX_SHARES;
9111 mutex_lock(&shares_mutex);
9112 if (tg->shares == shares)
9115 spin_lock_irqsave(&task_group_lock, flags);
9116 for_each_possible_cpu(i)
9117 unregister_fair_sched_group(tg, i);
9118 list_del_rcu(&tg->siblings);
9119 spin_unlock_irqrestore(&task_group_lock, flags);
9121 /* wait for any ongoing reference to this group to finish */
9122 synchronize_sched();
9125 * Now we are free to modify the group's share on each cpu
9126 * w/o tripping rebalance_share or load_balance_fair.
9128 tg->shares = shares;
9129 for_each_possible_cpu(i) {
9133 cfs_rq_set_shares(tg->cfs_rq[i], 0);
9134 set_se_shares(tg->se[i], shares);
9138 * Enable load balance activity on this group, by inserting it back on
9139 * each cpu's rq->leaf_cfs_rq_list.
9141 spin_lock_irqsave(&task_group_lock, flags);
9142 for_each_possible_cpu(i)
9143 register_fair_sched_group(tg, i);
9144 list_add_rcu(&tg->siblings, &tg->parent->children);
9145 spin_unlock_irqrestore(&task_group_lock, flags);
9147 mutex_unlock(&shares_mutex);
9151 unsigned long sched_group_shares(struct task_group *tg)
9157 #ifdef CONFIG_RT_GROUP_SCHED
9159 * Ensure that the real time constraints are schedulable.
9161 static DEFINE_MUTEX(rt_constraints_mutex);
9163 static unsigned long to_ratio(u64 period, u64 runtime)
9165 if (runtime == RUNTIME_INF)
9168 return div64_u64(runtime << 20, period);
9171 /* Must be called with tasklist_lock held */
9172 static inline int tg_has_rt_tasks(struct task_group *tg)
9174 struct task_struct *g, *p;
9176 do_each_thread(g, p) {
9177 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
9179 } while_each_thread(g, p);
9184 struct rt_schedulable_data {
9185 struct task_group *tg;
9190 static int tg_schedulable(struct task_group *tg, void *data)
9192 struct rt_schedulable_data *d = data;
9193 struct task_group *child;
9194 unsigned long total, sum = 0;
9195 u64 period, runtime;
9197 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
9198 runtime = tg->rt_bandwidth.rt_runtime;
9201 period = d->rt_period;
9202 runtime = d->rt_runtime;
9205 #ifdef CONFIG_USER_SCHED
9206 if (tg == &root_task_group) {
9207 period = global_rt_period();
9208 runtime = global_rt_runtime();
9213 * Cannot have more runtime than the period.
9215 if (runtime > period && runtime != RUNTIME_INF)
9219 * Ensure we don't starve existing RT tasks.
9221 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
9224 total = to_ratio(period, runtime);
9227 * Nobody can have more than the global setting allows.
9229 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
9233 * The sum of our children's runtime should not exceed our own.
9235 list_for_each_entry_rcu(child, &tg->children, siblings) {
9236 period = ktime_to_ns(child->rt_bandwidth.rt_period);
9237 runtime = child->rt_bandwidth.rt_runtime;
9239 if (child == d->tg) {
9240 period = d->rt_period;
9241 runtime = d->rt_runtime;
9244 sum += to_ratio(period, runtime);
9253 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
9255 struct rt_schedulable_data data = {
9257 .rt_period = period,
9258 .rt_runtime = runtime,
9261 return walk_tg_tree(tg_schedulable, tg_nop, &data);
9264 static int tg_set_bandwidth(struct task_group *tg,
9265 u64 rt_period, u64 rt_runtime)
9269 mutex_lock(&rt_constraints_mutex);
9270 read_lock(&tasklist_lock);
9271 err = __rt_schedulable(tg, rt_period, rt_runtime);
9275 spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
9276 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
9277 tg->rt_bandwidth.rt_runtime = rt_runtime;
9279 for_each_possible_cpu(i) {
9280 struct rt_rq *rt_rq = tg->rt_rq[i];
9282 spin_lock(&rt_rq->rt_runtime_lock);
9283 rt_rq->rt_runtime = rt_runtime;
9284 spin_unlock(&rt_rq->rt_runtime_lock);
9286 spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
9288 read_unlock(&tasklist_lock);
9289 mutex_unlock(&rt_constraints_mutex);
9294 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
9296 u64 rt_runtime, rt_period;
9298 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
9299 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
9300 if (rt_runtime_us < 0)
9301 rt_runtime = RUNTIME_INF;
9303 return tg_set_bandwidth(tg, rt_period, rt_runtime);
9306 long sched_group_rt_runtime(struct task_group *tg)
9310 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
9313 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
9314 do_div(rt_runtime_us, NSEC_PER_USEC);
9315 return rt_runtime_us;
9318 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
9320 u64 rt_runtime, rt_period;
9322 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
9323 rt_runtime = tg->rt_bandwidth.rt_runtime;
9328 return tg_set_bandwidth(tg, rt_period, rt_runtime);
9331 long sched_group_rt_period(struct task_group *tg)
9335 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
9336 do_div(rt_period_us, NSEC_PER_USEC);
9337 return rt_period_us;
9340 static int sched_rt_global_constraints(void)
9342 u64 runtime, period;
9345 if (sysctl_sched_rt_period <= 0)
9348 runtime = global_rt_runtime();
9349 period = global_rt_period();
9352 * Sanity check on the sysctl variables.
9354 if (runtime > period && runtime != RUNTIME_INF)
9357 mutex_lock(&rt_constraints_mutex);
9358 read_lock(&tasklist_lock);
9359 ret = __rt_schedulable(NULL, 0, 0);
9360 read_unlock(&tasklist_lock);
9361 mutex_unlock(&rt_constraints_mutex);
9366 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
9368 /* Don't accept realtime tasks when there is no way for them to run */
9369 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
9375 #else /* !CONFIG_RT_GROUP_SCHED */
9376 static int sched_rt_global_constraints(void)
9378 unsigned long flags;
9381 if (sysctl_sched_rt_period <= 0)
9384 spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
9385 for_each_possible_cpu(i) {
9386 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
9388 spin_lock(&rt_rq->rt_runtime_lock);
9389 rt_rq->rt_runtime = global_rt_runtime();
9390 spin_unlock(&rt_rq->rt_runtime_lock);
9392 spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
9396 #endif /* CONFIG_RT_GROUP_SCHED */
9398 int sched_rt_handler(struct ctl_table *table, int write,
9399 struct file *filp, void __user *buffer, size_t *lenp,
9403 int old_period, old_runtime;
9404 static DEFINE_MUTEX(mutex);
9407 old_period = sysctl_sched_rt_period;
9408 old_runtime = sysctl_sched_rt_runtime;
9410 ret = proc_dointvec(table, write, filp, buffer, lenp, ppos);
9412 if (!ret && write) {
9413 ret = sched_rt_global_constraints();
9415 sysctl_sched_rt_period = old_period;
9416 sysctl_sched_rt_runtime = old_runtime;
9418 def_rt_bandwidth.rt_runtime = global_rt_runtime();
9419 def_rt_bandwidth.rt_period =
9420 ns_to_ktime(global_rt_period());
9423 mutex_unlock(&mutex);
9428 #ifdef CONFIG_CGROUP_SCHED
9430 /* return corresponding task_group object of a cgroup */
9431 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
9433 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
9434 struct task_group, css);
9437 static struct cgroup_subsys_state *
9438 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
9440 struct task_group *tg, *parent;
9442 if (!cgrp->parent) {
9443 /* This is early initialization for the top cgroup */
9444 return &init_task_group.css;
9447 parent = cgroup_tg(cgrp->parent);
9448 tg = sched_create_group(parent);
9450 return ERR_PTR(-ENOMEM);
9456 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9458 struct task_group *tg = cgroup_tg(cgrp);
9460 sched_destroy_group(tg);
9464 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9465 struct task_struct *tsk)
9467 #ifdef CONFIG_RT_GROUP_SCHED
9468 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
9471 /* We don't support RT-tasks being in separate groups */
9472 if (tsk->sched_class != &fair_sched_class)
9480 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9481 struct cgroup *old_cont, struct task_struct *tsk)
9483 sched_move_task(tsk);
9486 #ifdef CONFIG_FAIR_GROUP_SCHED
9487 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
9490 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
9493 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
9495 struct task_group *tg = cgroup_tg(cgrp);
9497 return (u64) tg->shares;
9499 #endif /* CONFIG_FAIR_GROUP_SCHED */
9501 #ifdef CONFIG_RT_GROUP_SCHED
9502 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
9505 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
9508 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
9510 return sched_group_rt_runtime(cgroup_tg(cgrp));
9513 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
9516 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
9519 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
9521 return sched_group_rt_period(cgroup_tg(cgrp));
9523 #endif /* CONFIG_RT_GROUP_SCHED */
9525 static struct cftype cpu_files[] = {
9526 #ifdef CONFIG_FAIR_GROUP_SCHED
9529 .read_u64 = cpu_shares_read_u64,
9530 .write_u64 = cpu_shares_write_u64,
9533 #ifdef CONFIG_RT_GROUP_SCHED
9535 .name = "rt_runtime_us",
9536 .read_s64 = cpu_rt_runtime_read,
9537 .write_s64 = cpu_rt_runtime_write,
9540 .name = "rt_period_us",
9541 .read_u64 = cpu_rt_period_read_uint,
9542 .write_u64 = cpu_rt_period_write_uint,
9547 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
9549 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
9552 struct cgroup_subsys cpu_cgroup_subsys = {
9554 .create = cpu_cgroup_create,
9555 .destroy = cpu_cgroup_destroy,
9556 .can_attach = cpu_cgroup_can_attach,
9557 .attach = cpu_cgroup_attach,
9558 .populate = cpu_cgroup_populate,
9559 .subsys_id = cpu_cgroup_subsys_id,
9563 #endif /* CONFIG_CGROUP_SCHED */
9565 #ifdef CONFIG_CGROUP_CPUACCT
9568 * CPU accounting code for task groups.
9570 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
9571 * (balbir@in.ibm.com).
9574 /* track cpu usage of a group of tasks and its child groups */
9576 struct cgroup_subsys_state css;
9577 /* cpuusage holds pointer to a u64-type object on every cpu */
9579 struct cpuacct *parent;
9582 struct cgroup_subsys cpuacct_subsys;
9584 /* return cpu accounting group corresponding to this container */
9585 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
9587 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
9588 struct cpuacct, css);
9591 /* return cpu accounting group to which this task belongs */
9592 static inline struct cpuacct *task_ca(struct task_struct *tsk)
9594 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
9595 struct cpuacct, css);
9598 /* create a new cpu accounting group */
9599 static struct cgroup_subsys_state *cpuacct_create(
9600 struct cgroup_subsys *ss, struct cgroup *cgrp)
9602 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
9605 return ERR_PTR(-ENOMEM);
9607 ca->cpuusage = alloc_percpu(u64);
9608 if (!ca->cpuusage) {
9610 return ERR_PTR(-ENOMEM);
9614 ca->parent = cgroup_ca(cgrp->parent);
9619 /* destroy an existing cpu accounting group */
9621 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9623 struct cpuacct *ca = cgroup_ca(cgrp);
9625 free_percpu(ca->cpuusage);
9629 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
9631 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9634 #ifndef CONFIG_64BIT
9636 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
9638 spin_lock_irq(&cpu_rq(cpu)->lock);
9640 spin_unlock_irq(&cpu_rq(cpu)->lock);
9648 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
9650 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9652 #ifndef CONFIG_64BIT
9654 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
9656 spin_lock_irq(&cpu_rq(cpu)->lock);
9658 spin_unlock_irq(&cpu_rq(cpu)->lock);
9664 /* return total cpu usage (in nanoseconds) of a group */
9665 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
9667 struct cpuacct *ca = cgroup_ca(cgrp);
9668 u64 totalcpuusage = 0;
9671 for_each_present_cpu(i)
9672 totalcpuusage += cpuacct_cpuusage_read(ca, i);
9674 return totalcpuusage;
9677 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
9680 struct cpuacct *ca = cgroup_ca(cgrp);
9689 for_each_present_cpu(i)
9690 cpuacct_cpuusage_write(ca, i, 0);
9696 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
9699 struct cpuacct *ca = cgroup_ca(cgroup);
9703 for_each_present_cpu(i) {
9704 percpu = cpuacct_cpuusage_read(ca, i);
9705 seq_printf(m, "%llu ", (unsigned long long) percpu);
9707 seq_printf(m, "\n");
9711 static struct cftype files[] = {
9714 .read_u64 = cpuusage_read,
9715 .write_u64 = cpuusage_write,
9718 .name = "usage_percpu",
9719 .read_seq_string = cpuacct_percpu_seq_read,
9724 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
9726 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
9730 * charge this task's execution time to its accounting group.
9732 * called with rq->lock held.
9734 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
9739 if (unlikely(!cpuacct_subsys.active))
9742 cpu = task_cpu(tsk);
9745 for (; ca; ca = ca->parent) {
9746 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9747 *cpuusage += cputime;
9751 struct cgroup_subsys cpuacct_subsys = {
9753 .create = cpuacct_create,
9754 .destroy = cpuacct_destroy,
9755 .populate = cpuacct_populate,
9756 .subsys_id = cpuacct_subsys_id,
9758 #endif /* CONFIG_CGROUP_CPUACCT */