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/perf_event.h>
43 #include <linux/security.h>
44 #include <linux/notifier.h>
45 #include <linux/profile.h>
46 #include <linux/freezer.h>
47 #include <linux/vmalloc.h>
48 #include <linux/blkdev.h>
49 #include <linux/delay.h>
50 #include <linux/pid_namespace.h>
51 #include <linux/smp.h>
52 #include <linux/threads.h>
53 #include <linux/timer.h>
54 #include <linux/rcupdate.h>
55 #include <linux/cpu.h>
56 #include <linux/cpuset.h>
57 #include <linux/percpu.h>
58 #include <linux/kthread.h>
59 #include <linux/proc_fs.h>
60 #include <linux/seq_file.h>
61 #include <linux/sysctl.h>
62 #include <linux/syscalls.h>
63 #include <linux/times.h>
64 #include <linux/tsacct_kern.h>
65 #include <linux/kprobes.h>
66 #include <linux/delayacct.h>
67 #include <linux/unistd.h>
68 #include <linux/pagemap.h>
69 #include <linux/hrtimer.h>
70 #include <linux/tick.h>
71 #include <linux/debugfs.h>
72 #include <linux/ctype.h>
73 #include <linux/ftrace.h>
76 #include <asm/irq_regs.h>
78 #include "sched_cpupri.h"
80 #define CREATE_TRACE_POINTS
81 #include <trace/events/sched.h>
84 * Convert user-nice values [ -20 ... 0 ... 19 ]
85 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
88 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
89 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
90 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
93 * 'User priority' is the nice value converted to something we
94 * can work with better when scaling various scheduler parameters,
95 * it's a [ 0 ... 39 ] range.
97 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
98 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
99 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
102 * Helpers for converting nanosecond timing to jiffy resolution
104 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
106 #define NICE_0_LOAD SCHED_LOAD_SCALE
107 #define NICE_0_SHIFT SCHED_LOAD_SHIFT
110 * These are the 'tuning knobs' of the scheduler:
112 * default timeslice is 100 msecs (used only for SCHED_RR tasks).
113 * Timeslices get refilled after they expire.
115 #define DEF_TIMESLICE (100 * HZ / 1000)
118 * single value that denotes runtime == period, ie unlimited time.
120 #define RUNTIME_INF ((u64)~0ULL)
122 static inline int rt_policy(int policy)
124 if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR))
129 static inline int task_has_rt_policy(struct task_struct *p)
131 return rt_policy(p->policy);
135 * This is the priority-queue data structure of the RT scheduling class:
137 struct rt_prio_array {
138 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
139 struct list_head queue[MAX_RT_PRIO];
142 struct rt_bandwidth {
143 /* nests inside the rq lock: */
144 spinlock_t rt_runtime_lock;
147 struct hrtimer rt_period_timer;
150 static struct rt_bandwidth def_rt_bandwidth;
152 static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun);
154 static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer)
156 struct rt_bandwidth *rt_b =
157 container_of(timer, struct rt_bandwidth, rt_period_timer);
163 now = hrtimer_cb_get_time(timer);
164 overrun = hrtimer_forward(timer, now, rt_b->rt_period);
169 idle = do_sched_rt_period_timer(rt_b, overrun);
172 return idle ? HRTIMER_NORESTART : HRTIMER_RESTART;
176 void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime)
178 rt_b->rt_period = ns_to_ktime(period);
179 rt_b->rt_runtime = runtime;
181 spin_lock_init(&rt_b->rt_runtime_lock);
183 hrtimer_init(&rt_b->rt_period_timer,
184 CLOCK_MONOTONIC, HRTIMER_MODE_REL);
185 rt_b->rt_period_timer.function = sched_rt_period_timer;
188 static inline int rt_bandwidth_enabled(void)
190 return sysctl_sched_rt_runtime >= 0;
193 static void start_rt_bandwidth(struct rt_bandwidth *rt_b)
197 if (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF)
200 if (hrtimer_active(&rt_b->rt_period_timer))
203 spin_lock(&rt_b->rt_runtime_lock);
208 if (hrtimer_active(&rt_b->rt_period_timer))
211 now = hrtimer_cb_get_time(&rt_b->rt_period_timer);
212 hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period);
214 soft = hrtimer_get_softexpires(&rt_b->rt_period_timer);
215 hard = hrtimer_get_expires(&rt_b->rt_period_timer);
216 delta = ktime_to_ns(ktime_sub(hard, soft));
217 __hrtimer_start_range_ns(&rt_b->rt_period_timer, soft, delta,
218 HRTIMER_MODE_ABS_PINNED, 0);
220 spin_unlock(&rt_b->rt_runtime_lock);
223 #ifdef CONFIG_RT_GROUP_SCHED
224 static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b)
226 hrtimer_cancel(&rt_b->rt_period_timer);
231 * sched_domains_mutex serializes calls to arch_init_sched_domains,
232 * detach_destroy_domains and partition_sched_domains.
234 static DEFINE_MUTEX(sched_domains_mutex);
236 #ifdef CONFIG_GROUP_SCHED
238 #include <linux/cgroup.h>
242 static LIST_HEAD(task_groups);
244 /* task group related information */
246 #ifdef CONFIG_CGROUP_SCHED
247 struct cgroup_subsys_state css;
250 #ifdef CONFIG_USER_SCHED
254 #ifdef CONFIG_FAIR_GROUP_SCHED
255 /* schedulable entities of this group on each cpu */
256 struct sched_entity **se;
257 /* runqueue "owned" by this group on each cpu */
258 struct cfs_rq **cfs_rq;
259 unsigned long shares;
262 #ifdef CONFIG_RT_GROUP_SCHED
263 struct sched_rt_entity **rt_se;
264 struct rt_rq **rt_rq;
266 struct rt_bandwidth rt_bandwidth;
270 struct list_head list;
272 struct task_group *parent;
273 struct list_head siblings;
274 struct list_head children;
277 #ifdef CONFIG_USER_SCHED
279 /* Helper function to pass uid information to create_sched_user() */
280 void set_tg_uid(struct user_struct *user)
282 user->tg->uid = user->uid;
287 * Every UID task group (including init_task_group aka UID-0) will
288 * be a child to this group.
290 struct task_group root_task_group;
292 #ifdef CONFIG_FAIR_GROUP_SCHED
293 /* Default task group's sched entity on each cpu */
294 static DEFINE_PER_CPU(struct sched_entity, init_sched_entity);
295 /* Default task group's cfs_rq on each cpu */
296 static DEFINE_PER_CPU_SHARED_ALIGNED(struct cfs_rq, init_tg_cfs_rq);
297 #endif /* CONFIG_FAIR_GROUP_SCHED */
299 #ifdef CONFIG_RT_GROUP_SCHED
300 static DEFINE_PER_CPU(struct sched_rt_entity, init_sched_rt_entity);
301 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rt_rq, init_rt_rq);
302 #endif /* CONFIG_RT_GROUP_SCHED */
303 #else /* !CONFIG_USER_SCHED */
304 #define root_task_group init_task_group
305 #endif /* CONFIG_USER_SCHED */
307 /* task_group_lock serializes add/remove of task groups and also changes to
308 * a task group's cpu shares.
310 static DEFINE_SPINLOCK(task_group_lock);
312 #ifdef CONFIG_FAIR_GROUP_SCHED
315 static int root_task_group_empty(void)
317 return list_empty(&root_task_group.children);
321 #ifdef CONFIG_USER_SCHED
322 # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD)
323 #else /* !CONFIG_USER_SCHED */
324 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
325 #endif /* CONFIG_USER_SCHED */
328 * A weight of 0 or 1 can cause arithmetics problems.
329 * A weight of a cfs_rq is the sum of weights of which entities
330 * are queued on this cfs_rq, so a weight of a entity should not be
331 * too large, so as the shares value of a task group.
332 * (The default weight is 1024 - so there's no practical
333 * limitation from this.)
336 #define MAX_SHARES (1UL << 18)
338 static int init_task_group_load = INIT_TASK_GROUP_LOAD;
341 /* Default task group.
342 * Every task in system belong to this group at bootup.
344 struct task_group init_task_group;
346 /* return group to which a task belongs */
347 static inline struct task_group *task_group(struct task_struct *p)
349 struct task_group *tg;
351 #ifdef CONFIG_USER_SCHED
353 tg = __task_cred(p)->user->tg;
355 #elif defined(CONFIG_CGROUP_SCHED)
356 tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id),
357 struct task_group, css);
359 tg = &init_task_group;
364 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
365 static inline void set_task_rq(struct task_struct *p, unsigned int cpu)
367 #ifdef CONFIG_FAIR_GROUP_SCHED
368 p->se.cfs_rq = task_group(p)->cfs_rq[cpu];
369 p->se.parent = task_group(p)->se[cpu];
372 #ifdef CONFIG_RT_GROUP_SCHED
373 p->rt.rt_rq = task_group(p)->rt_rq[cpu];
374 p->rt.parent = task_group(p)->rt_se[cpu];
380 static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { }
381 static inline struct task_group *task_group(struct task_struct *p)
386 #endif /* CONFIG_GROUP_SCHED */
388 /* CFS-related fields in a runqueue */
390 struct load_weight load;
391 unsigned long nr_running;
396 struct rb_root tasks_timeline;
397 struct rb_node *rb_leftmost;
399 struct list_head tasks;
400 struct list_head *balance_iterator;
403 * 'curr' points to currently running entity on this cfs_rq.
404 * It is set to NULL otherwise (i.e when none are currently running).
406 struct sched_entity *curr, *next, *last;
408 unsigned int nr_spread_over;
410 #ifdef CONFIG_FAIR_GROUP_SCHED
411 struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */
414 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
415 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
416 * (like users, containers etc.)
418 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
419 * list is used during load balance.
421 struct list_head leaf_cfs_rq_list;
422 struct task_group *tg; /* group that "owns" this runqueue */
426 * the part of load.weight contributed by tasks
428 unsigned long task_weight;
431 * h_load = weight * f(tg)
433 * Where f(tg) is the recursive weight fraction assigned to
436 unsigned long h_load;
439 * this cpu's part of tg->shares
441 unsigned long shares;
444 * load.weight at the time we set shares
446 unsigned long rq_weight;
451 /* Real-Time classes' related field in a runqueue: */
453 struct rt_prio_array active;
454 unsigned long rt_nr_running;
455 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
457 int curr; /* highest queued rt task prio */
459 int next; /* next highest */
464 unsigned long rt_nr_migratory;
465 unsigned long rt_nr_total;
467 struct plist_head pushable_tasks;
472 /* Nests inside the rq lock: */
473 spinlock_t rt_runtime_lock;
475 #ifdef CONFIG_RT_GROUP_SCHED
476 unsigned long rt_nr_boosted;
479 struct list_head leaf_rt_rq_list;
480 struct task_group *tg;
481 struct sched_rt_entity *rt_se;
488 * We add the notion of a root-domain which will be used to define per-domain
489 * variables. Each exclusive cpuset essentially defines an island domain by
490 * fully partitioning the member cpus from any other cpuset. Whenever a new
491 * exclusive cpuset is created, we also create and attach a new root-domain
498 cpumask_var_t online;
501 * The "RT overload" flag: it gets set if a CPU has more than
502 * one runnable RT task.
504 cpumask_var_t rto_mask;
507 struct cpupri cpupri;
512 * By default the system creates a single root-domain with all cpus as
513 * members (mimicking the global state we have today).
515 static struct root_domain def_root_domain;
520 * This is the main, per-CPU runqueue data structure.
522 * Locking rule: those places that want to lock multiple runqueues
523 * (such as the load balancing or the thread migration code), lock
524 * acquire operations must be ordered by ascending &runqueue.
531 * nr_running and cpu_load should be in the same cacheline because
532 * remote CPUs use both these fields when doing load calculation.
534 unsigned long nr_running;
535 #define CPU_LOAD_IDX_MAX 5
536 unsigned long cpu_load[CPU_LOAD_IDX_MAX];
538 unsigned char in_nohz_recently;
540 /* capture load from *all* tasks on this cpu: */
541 struct load_weight load;
542 unsigned long nr_load_updates;
548 #ifdef CONFIG_FAIR_GROUP_SCHED
549 /* list of leaf cfs_rq on this cpu: */
550 struct list_head leaf_cfs_rq_list;
552 #ifdef CONFIG_RT_GROUP_SCHED
553 struct list_head leaf_rt_rq_list;
557 * This is part of a global counter where only the total sum
558 * over all CPUs matters. A task can increase this counter on
559 * one CPU and if it got migrated afterwards it may decrease
560 * it on another CPU. Always updated under the runqueue lock:
562 unsigned long nr_uninterruptible;
564 struct task_struct *curr, *idle;
565 unsigned long next_balance;
566 struct mm_struct *prev_mm;
573 struct root_domain *rd;
574 struct sched_domain *sd;
576 unsigned char idle_at_tick;
577 /* For active balancing */
581 /* cpu of this runqueue: */
585 unsigned long avg_load_per_task;
587 struct task_struct *migration_thread;
588 struct list_head migration_queue;
596 /* calc_load related fields */
597 unsigned long calc_load_update;
598 long calc_load_active;
600 #ifdef CONFIG_SCHED_HRTICK
602 int hrtick_csd_pending;
603 struct call_single_data hrtick_csd;
605 struct hrtimer hrtick_timer;
608 #ifdef CONFIG_SCHEDSTATS
610 struct sched_info rq_sched_info;
611 unsigned long long rq_cpu_time;
612 /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */
614 /* sys_sched_yield() stats */
615 unsigned int yld_count;
617 /* schedule() stats */
618 unsigned int sched_switch;
619 unsigned int sched_count;
620 unsigned int sched_goidle;
622 /* try_to_wake_up() stats */
623 unsigned int ttwu_count;
624 unsigned int ttwu_local;
627 unsigned int bkl_count;
631 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
634 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
636 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
639 static inline int cpu_of(struct rq *rq)
649 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
650 * See detach_destroy_domains: synchronize_sched for details.
652 * The domain tree of any CPU may only be accessed from within
653 * preempt-disabled sections.
655 #define for_each_domain(cpu, __sd) \
656 for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
658 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
659 #define this_rq() (&__get_cpu_var(runqueues))
660 #define task_rq(p) cpu_rq(task_cpu(p))
661 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
662 #define raw_rq() (&__raw_get_cpu_var(runqueues))
664 inline void update_rq_clock(struct rq *rq)
666 rq->clock = sched_clock_cpu(cpu_of(rq));
670 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
672 #ifdef CONFIG_SCHED_DEBUG
673 # define const_debug __read_mostly
675 # define const_debug static const
680 * @cpu: the processor in question.
682 * Returns true if the current cpu runqueue is locked.
683 * This interface allows printk to be called with the runqueue lock
684 * held and know whether or not it is OK to wake up the klogd.
686 int runqueue_is_locked(int cpu)
688 return spin_is_locked(&cpu_rq(cpu)->lock);
692 * Debugging: various feature bits
695 #define SCHED_FEAT(name, enabled) \
696 __SCHED_FEAT_##name ,
699 #include "sched_features.h"
704 #define SCHED_FEAT(name, enabled) \
705 (1UL << __SCHED_FEAT_##name) * enabled |
707 const_debug unsigned int sysctl_sched_features =
708 #include "sched_features.h"
713 #ifdef CONFIG_SCHED_DEBUG
714 #define SCHED_FEAT(name, enabled) \
717 static __read_mostly char *sched_feat_names[] = {
718 #include "sched_features.h"
724 static int sched_feat_show(struct seq_file *m, void *v)
728 for (i = 0; sched_feat_names[i]; i++) {
729 if (!(sysctl_sched_features & (1UL << i)))
731 seq_printf(m, "%s ", sched_feat_names[i]);
739 sched_feat_write(struct file *filp, const char __user *ubuf,
740 size_t cnt, loff_t *ppos)
750 if (copy_from_user(&buf, ubuf, cnt))
755 if (strncmp(buf, "NO_", 3) == 0) {
760 for (i = 0; sched_feat_names[i]; i++) {
761 int len = strlen(sched_feat_names[i]);
763 if (strncmp(cmp, sched_feat_names[i], len) == 0) {
765 sysctl_sched_features &= ~(1UL << i);
767 sysctl_sched_features |= (1UL << i);
772 if (!sched_feat_names[i])
780 static int sched_feat_open(struct inode *inode, struct file *filp)
782 return single_open(filp, sched_feat_show, NULL);
785 static const struct file_operations sched_feat_fops = {
786 .open = sched_feat_open,
787 .write = sched_feat_write,
790 .release = single_release,
793 static __init int sched_init_debug(void)
795 debugfs_create_file("sched_features", 0644, NULL, NULL,
800 late_initcall(sched_init_debug);
804 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
807 * Number of tasks to iterate in a single balance run.
808 * Limited because this is done with IRQs disabled.
810 const_debug unsigned int sysctl_sched_nr_migrate = 32;
813 * ratelimit for updating the group shares.
816 unsigned int sysctl_sched_shares_ratelimit = 250000;
819 * Inject some fuzzyness into changing the per-cpu group shares
820 * this avoids remote rq-locks at the expense of fairness.
823 unsigned int sysctl_sched_shares_thresh = 4;
826 * period over which we average the RT time consumption, measured
831 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
834 * period over which we measure -rt task cpu usage in us.
837 unsigned int sysctl_sched_rt_period = 1000000;
839 static __read_mostly int scheduler_running;
842 * part of the period that we allow rt tasks to run in us.
845 int sysctl_sched_rt_runtime = 950000;
847 static inline u64 global_rt_period(void)
849 return (u64)sysctl_sched_rt_period * NSEC_PER_USEC;
852 static inline u64 global_rt_runtime(void)
854 if (sysctl_sched_rt_runtime < 0)
857 return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC;
860 #ifndef prepare_arch_switch
861 # define prepare_arch_switch(next) do { } while (0)
863 #ifndef finish_arch_switch
864 # define finish_arch_switch(prev) do { } while (0)
867 static inline int task_current(struct rq *rq, struct task_struct *p)
869 return rq->curr == p;
872 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
873 static inline int task_running(struct rq *rq, struct task_struct *p)
875 return task_current(rq, p);
878 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
882 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
884 #ifdef CONFIG_DEBUG_SPINLOCK
885 /* this is a valid case when another task releases the spinlock */
886 rq->lock.owner = current;
889 * If we are tracking spinlock dependencies then we have to
890 * fix up the runqueue lock - which gets 'carried over' from
893 spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_);
895 spin_unlock_irq(&rq->lock);
898 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
899 static inline int task_running(struct rq *rq, struct task_struct *p)
904 return task_current(rq, p);
908 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
912 * We can optimise this out completely for !SMP, because the
913 * SMP rebalancing from interrupt is the only thing that cares
918 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
919 spin_unlock_irq(&rq->lock);
921 spin_unlock(&rq->lock);
925 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
929 * After ->oncpu is cleared, the task can be moved to a different CPU.
930 * We must ensure this doesn't happen until the switch is completely
936 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
940 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
943 * __task_rq_lock - lock the runqueue a given task resides on.
944 * Must be called interrupts disabled.
946 static inline struct rq *__task_rq_lock(struct task_struct *p)
950 struct rq *rq = task_rq(p);
951 spin_lock(&rq->lock);
952 if (likely(rq == task_rq(p)))
954 spin_unlock(&rq->lock);
959 * task_rq_lock - lock the runqueue a given task resides on and disable
960 * interrupts. Note the ordering: we can safely lookup the task_rq without
961 * explicitly disabling preemption.
963 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
969 local_irq_save(*flags);
971 spin_lock(&rq->lock);
972 if (likely(rq == task_rq(p)))
974 spin_unlock_irqrestore(&rq->lock, *flags);
978 void task_rq_unlock_wait(struct task_struct *p)
980 struct rq *rq = task_rq(p);
982 smp_mb(); /* spin-unlock-wait is not a full memory barrier */
983 spin_unlock_wait(&rq->lock);
986 static void __task_rq_unlock(struct rq *rq)
989 spin_unlock(&rq->lock);
992 static inline void task_rq_unlock(struct rq *rq, unsigned long *flags)
995 spin_unlock_irqrestore(&rq->lock, *flags);
999 * this_rq_lock - lock this runqueue and disable interrupts.
1001 static struct rq *this_rq_lock(void)
1002 __acquires(rq->lock)
1006 local_irq_disable();
1008 spin_lock(&rq->lock);
1013 #ifdef CONFIG_SCHED_HRTICK
1015 * Use HR-timers to deliver accurate preemption points.
1017 * Its all a bit involved since we cannot program an hrt while holding the
1018 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1021 * When we get rescheduled we reprogram the hrtick_timer outside of the
1027 * - enabled by features
1028 * - hrtimer is actually high res
1030 static inline int hrtick_enabled(struct rq *rq)
1032 if (!sched_feat(HRTICK))
1034 if (!cpu_active(cpu_of(rq)))
1036 return hrtimer_is_hres_active(&rq->hrtick_timer);
1039 static void hrtick_clear(struct rq *rq)
1041 if (hrtimer_active(&rq->hrtick_timer))
1042 hrtimer_cancel(&rq->hrtick_timer);
1046 * High-resolution timer tick.
1047 * Runs from hardirq context with interrupts disabled.
1049 static enum hrtimer_restart hrtick(struct hrtimer *timer)
1051 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
1053 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
1055 spin_lock(&rq->lock);
1056 update_rq_clock(rq);
1057 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
1058 spin_unlock(&rq->lock);
1060 return HRTIMER_NORESTART;
1065 * called from hardirq (IPI) context
1067 static void __hrtick_start(void *arg)
1069 struct rq *rq = arg;
1071 spin_lock(&rq->lock);
1072 hrtimer_restart(&rq->hrtick_timer);
1073 rq->hrtick_csd_pending = 0;
1074 spin_unlock(&rq->lock);
1078 * Called to set the hrtick timer state.
1080 * called with rq->lock held and irqs disabled
1082 static void hrtick_start(struct rq *rq, u64 delay)
1084 struct hrtimer *timer = &rq->hrtick_timer;
1085 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
1087 hrtimer_set_expires(timer, time);
1089 if (rq == this_rq()) {
1090 hrtimer_restart(timer);
1091 } else if (!rq->hrtick_csd_pending) {
1092 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0);
1093 rq->hrtick_csd_pending = 1;
1098 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
1100 int cpu = (int)(long)hcpu;
1103 case CPU_UP_CANCELED:
1104 case CPU_UP_CANCELED_FROZEN:
1105 case CPU_DOWN_PREPARE:
1106 case CPU_DOWN_PREPARE_FROZEN:
1108 case CPU_DEAD_FROZEN:
1109 hrtick_clear(cpu_rq(cpu));
1116 static __init void init_hrtick(void)
1118 hotcpu_notifier(hotplug_hrtick, 0);
1122 * Called to set the hrtick timer state.
1124 * called with rq->lock held and irqs disabled
1126 static void hrtick_start(struct rq *rq, u64 delay)
1128 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
1129 HRTIMER_MODE_REL_PINNED, 0);
1132 static inline void init_hrtick(void)
1135 #endif /* CONFIG_SMP */
1137 static void init_rq_hrtick(struct rq *rq)
1140 rq->hrtick_csd_pending = 0;
1142 rq->hrtick_csd.flags = 0;
1143 rq->hrtick_csd.func = __hrtick_start;
1144 rq->hrtick_csd.info = rq;
1147 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1148 rq->hrtick_timer.function = hrtick;
1150 #else /* CONFIG_SCHED_HRTICK */
1151 static inline void hrtick_clear(struct rq *rq)
1155 static inline void init_rq_hrtick(struct rq *rq)
1159 static inline void init_hrtick(void)
1162 #endif /* CONFIG_SCHED_HRTICK */
1165 * resched_task - mark a task 'to be rescheduled now'.
1167 * On UP this means the setting of the need_resched flag, on SMP it
1168 * might also involve a cross-CPU call to trigger the scheduler on
1173 #ifndef tsk_is_polling
1174 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1177 static void resched_task(struct task_struct *p)
1181 assert_spin_locked(&task_rq(p)->lock);
1183 if (test_tsk_need_resched(p))
1186 set_tsk_need_resched(p);
1189 if (cpu == smp_processor_id())
1192 /* NEED_RESCHED must be visible before we test polling */
1194 if (!tsk_is_polling(p))
1195 smp_send_reschedule(cpu);
1198 static void resched_cpu(int cpu)
1200 struct rq *rq = cpu_rq(cpu);
1201 unsigned long flags;
1203 if (!spin_trylock_irqsave(&rq->lock, flags))
1205 resched_task(cpu_curr(cpu));
1206 spin_unlock_irqrestore(&rq->lock, flags);
1211 * When add_timer_on() enqueues a timer into the timer wheel of an
1212 * idle CPU then this timer might expire before the next timer event
1213 * which is scheduled to wake up that CPU. In case of a completely
1214 * idle system the next event might even be infinite time into the
1215 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1216 * leaves the inner idle loop so the newly added timer is taken into
1217 * account when the CPU goes back to idle and evaluates the timer
1218 * wheel for the next timer event.
1220 void wake_up_idle_cpu(int cpu)
1222 struct rq *rq = cpu_rq(cpu);
1224 if (cpu == smp_processor_id())
1228 * This is safe, as this function is called with the timer
1229 * wheel base lock of (cpu) held. When the CPU is on the way
1230 * to idle and has not yet set rq->curr to idle then it will
1231 * be serialized on the timer wheel base lock and take the new
1232 * timer into account automatically.
1234 if (rq->curr != rq->idle)
1238 * We can set TIF_RESCHED on the idle task of the other CPU
1239 * lockless. The worst case is that the other CPU runs the
1240 * idle task through an additional NOOP schedule()
1242 set_tsk_need_resched(rq->idle);
1244 /* NEED_RESCHED must be visible before we test polling */
1246 if (!tsk_is_polling(rq->idle))
1247 smp_send_reschedule(cpu);
1249 #endif /* CONFIG_NO_HZ */
1251 static u64 sched_avg_period(void)
1253 return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2;
1256 static void sched_avg_update(struct rq *rq)
1258 s64 period = sched_avg_period();
1260 while ((s64)(rq->clock - rq->age_stamp) > period) {
1261 rq->age_stamp += period;
1266 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1268 rq->rt_avg += rt_delta;
1269 sched_avg_update(rq);
1272 #else /* !CONFIG_SMP */
1273 static void resched_task(struct task_struct *p)
1275 assert_spin_locked(&task_rq(p)->lock);
1276 set_tsk_need_resched(p);
1279 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1282 #endif /* CONFIG_SMP */
1284 #if BITS_PER_LONG == 32
1285 # define WMULT_CONST (~0UL)
1287 # define WMULT_CONST (1UL << 32)
1290 #define WMULT_SHIFT 32
1293 * Shift right and round:
1295 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1298 * delta *= weight / lw
1300 static unsigned long
1301 calc_delta_mine(unsigned long delta_exec, unsigned long weight,
1302 struct load_weight *lw)
1306 if (!lw->inv_weight) {
1307 if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST))
1310 lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2)
1314 tmp = (u64)delta_exec * weight;
1316 * Check whether we'd overflow the 64-bit multiplication:
1318 if (unlikely(tmp > WMULT_CONST))
1319 tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight,
1322 tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT);
1324 return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX);
1327 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
1333 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
1340 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1341 * of tasks with abnormal "nice" values across CPUs the contribution that
1342 * each task makes to its run queue's load is weighted according to its
1343 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1344 * scaled version of the new time slice allocation that they receive on time
1348 #define WEIGHT_IDLEPRIO 3
1349 #define WMULT_IDLEPRIO 1431655765
1352 * Nice levels are multiplicative, with a gentle 10% change for every
1353 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1354 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1355 * that remained on nice 0.
1357 * The "10% effect" is relative and cumulative: from _any_ nice level,
1358 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1359 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1360 * If a task goes up by ~10% and another task goes down by ~10% then
1361 * the relative distance between them is ~25%.)
1363 static const int prio_to_weight[40] = {
1364 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1365 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1366 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1367 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1368 /* 0 */ 1024, 820, 655, 526, 423,
1369 /* 5 */ 335, 272, 215, 172, 137,
1370 /* 10 */ 110, 87, 70, 56, 45,
1371 /* 15 */ 36, 29, 23, 18, 15,
1375 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1377 * In cases where the weight does not change often, we can use the
1378 * precalculated inverse to speed up arithmetics by turning divisions
1379 * into multiplications:
1381 static const u32 prio_to_wmult[40] = {
1382 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1383 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1384 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1385 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1386 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1387 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1388 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1389 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1392 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup);
1395 * runqueue iterator, to support SMP load-balancing between different
1396 * scheduling classes, without having to expose their internal data
1397 * structures to the load-balancing proper:
1399 struct rq_iterator {
1401 struct task_struct *(*start)(void *);
1402 struct task_struct *(*next)(void *);
1406 static unsigned long
1407 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
1408 unsigned long max_load_move, struct sched_domain *sd,
1409 enum cpu_idle_type idle, int *all_pinned,
1410 int *this_best_prio, struct rq_iterator *iterator);
1413 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
1414 struct sched_domain *sd, enum cpu_idle_type idle,
1415 struct rq_iterator *iterator);
1418 /* Time spent by the tasks of the cpu accounting group executing in ... */
1419 enum cpuacct_stat_index {
1420 CPUACCT_STAT_USER, /* ... user mode */
1421 CPUACCT_STAT_SYSTEM, /* ... kernel mode */
1423 CPUACCT_STAT_NSTATS,
1426 #ifdef CONFIG_CGROUP_CPUACCT
1427 static void cpuacct_charge(struct task_struct *tsk, u64 cputime);
1428 static void cpuacct_update_stats(struct task_struct *tsk,
1429 enum cpuacct_stat_index idx, cputime_t val);
1431 static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {}
1432 static inline void cpuacct_update_stats(struct task_struct *tsk,
1433 enum cpuacct_stat_index idx, cputime_t val) {}
1436 static inline void inc_cpu_load(struct rq *rq, unsigned long load)
1438 update_load_add(&rq->load, load);
1441 static inline void dec_cpu_load(struct rq *rq, unsigned long load)
1443 update_load_sub(&rq->load, load);
1446 #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED)
1447 typedef int (*tg_visitor)(struct task_group *, void *);
1450 * Iterate the full tree, calling @down when first entering a node and @up when
1451 * leaving it for the final time.
1453 static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
1455 struct task_group *parent, *child;
1459 parent = &root_task_group;
1461 ret = (*down)(parent, data);
1464 list_for_each_entry_rcu(child, &parent->children, siblings) {
1471 ret = (*up)(parent, data);
1476 parent = parent->parent;
1485 static int tg_nop(struct task_group *tg, void *data)
1492 /* Used instead of source_load when we know the type == 0 */
1493 static unsigned long weighted_cpuload(const int cpu)
1495 return cpu_rq(cpu)->load.weight;
1499 * Return a low guess at the load of a migration-source cpu weighted
1500 * according to the scheduling class and "nice" value.
1502 * We want to under-estimate the load of migration sources, to
1503 * balance conservatively.
1505 static unsigned long source_load(int cpu, int type)
1507 struct rq *rq = cpu_rq(cpu);
1508 unsigned long total = weighted_cpuload(cpu);
1510 if (type == 0 || !sched_feat(LB_BIAS))
1513 return min(rq->cpu_load[type-1], total);
1517 * Return a high guess at the load of a migration-target cpu weighted
1518 * according to the scheduling class and "nice" value.
1520 static unsigned long target_load(int cpu, int type)
1522 struct rq *rq = cpu_rq(cpu);
1523 unsigned long total = weighted_cpuload(cpu);
1525 if (type == 0 || !sched_feat(LB_BIAS))
1528 return max(rq->cpu_load[type-1], total);
1531 static struct sched_group *group_of(int cpu)
1533 struct sched_domain *sd = rcu_dereference(cpu_rq(cpu)->sd);
1541 static unsigned long power_of(int cpu)
1543 struct sched_group *group = group_of(cpu);
1546 return SCHED_LOAD_SCALE;
1548 return group->cpu_power;
1551 static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd);
1553 static unsigned long cpu_avg_load_per_task(int cpu)
1555 struct rq *rq = cpu_rq(cpu);
1556 unsigned long nr_running = ACCESS_ONCE(rq->nr_running);
1559 rq->avg_load_per_task = rq->load.weight / nr_running;
1561 rq->avg_load_per_task = 0;
1563 return rq->avg_load_per_task;
1566 #ifdef CONFIG_FAIR_GROUP_SCHED
1568 static __read_mostly unsigned long *update_shares_data;
1570 static void __set_se_shares(struct sched_entity *se, unsigned long shares);
1573 * Calculate and set the cpu's group shares.
1575 static void update_group_shares_cpu(struct task_group *tg, int cpu,
1576 unsigned long sd_shares,
1577 unsigned long sd_rq_weight,
1578 unsigned long *usd_rq_weight)
1580 unsigned long shares, rq_weight;
1583 rq_weight = usd_rq_weight[cpu];
1586 rq_weight = NICE_0_LOAD;
1590 * \Sum_j shares_j * rq_weight_i
1591 * shares_i = -----------------------------
1592 * \Sum_j rq_weight_j
1594 shares = (sd_shares * rq_weight) / sd_rq_weight;
1595 shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES);
1597 if (abs(shares - tg->se[cpu]->load.weight) >
1598 sysctl_sched_shares_thresh) {
1599 struct rq *rq = cpu_rq(cpu);
1600 unsigned long flags;
1602 spin_lock_irqsave(&rq->lock, flags);
1603 tg->cfs_rq[cpu]->rq_weight = boost ? 0 : rq_weight;
1604 tg->cfs_rq[cpu]->shares = boost ? 0 : shares;
1605 __set_se_shares(tg->se[cpu], shares);
1606 spin_unlock_irqrestore(&rq->lock, flags);
1611 * Re-compute the task group their per cpu shares over the given domain.
1612 * This needs to be done in a bottom-up fashion because the rq weight of a
1613 * parent group depends on the shares of its child groups.
1615 static int tg_shares_up(struct task_group *tg, void *data)
1617 unsigned long weight, rq_weight = 0, shares = 0;
1618 unsigned long *usd_rq_weight;
1619 struct sched_domain *sd = data;
1620 unsigned long flags;
1626 local_irq_save(flags);
1627 usd_rq_weight = per_cpu_ptr(update_shares_data, smp_processor_id());
1629 for_each_cpu(i, sched_domain_span(sd)) {
1630 weight = tg->cfs_rq[i]->load.weight;
1631 usd_rq_weight[i] = weight;
1634 * If there are currently no tasks on the cpu pretend there
1635 * is one of average load so that when a new task gets to
1636 * run here it will not get delayed by group starvation.
1639 weight = NICE_0_LOAD;
1641 rq_weight += weight;
1642 shares += tg->cfs_rq[i]->shares;
1645 if ((!shares && rq_weight) || shares > tg->shares)
1646 shares = tg->shares;
1648 if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE))
1649 shares = tg->shares;
1651 for_each_cpu(i, sched_domain_span(sd))
1652 update_group_shares_cpu(tg, i, shares, rq_weight, usd_rq_weight);
1654 local_irq_restore(flags);
1660 * Compute the cpu's hierarchical load factor for each task group.
1661 * This needs to be done in a top-down fashion because the load of a child
1662 * group is a fraction of its parents load.
1664 static int tg_load_down(struct task_group *tg, void *data)
1667 long cpu = (long)data;
1670 load = cpu_rq(cpu)->load.weight;
1672 load = tg->parent->cfs_rq[cpu]->h_load;
1673 load *= tg->cfs_rq[cpu]->shares;
1674 load /= tg->parent->cfs_rq[cpu]->load.weight + 1;
1677 tg->cfs_rq[cpu]->h_load = load;
1682 static void update_shares(struct sched_domain *sd)
1687 if (root_task_group_empty())
1690 now = cpu_clock(raw_smp_processor_id());
1691 elapsed = now - sd->last_update;
1693 if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) {
1694 sd->last_update = now;
1695 walk_tg_tree(tg_nop, tg_shares_up, sd);
1699 static void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1701 if (root_task_group_empty())
1704 spin_unlock(&rq->lock);
1706 spin_lock(&rq->lock);
1709 static void update_h_load(long cpu)
1711 if (root_task_group_empty())
1714 walk_tg_tree(tg_load_down, tg_nop, (void *)cpu);
1719 static inline void update_shares(struct sched_domain *sd)
1723 static inline void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1729 #ifdef CONFIG_PREEMPT
1731 static void double_rq_lock(struct rq *rq1, struct rq *rq2);
1734 * fair double_lock_balance: Safely acquires both rq->locks in a fair
1735 * way at the expense of forcing extra atomic operations in all
1736 * invocations. This assures that the double_lock is acquired using the
1737 * same underlying policy as the spinlock_t on this architecture, which
1738 * reduces latency compared to the unfair variant below. However, it
1739 * also adds more overhead and therefore may reduce throughput.
1741 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1742 __releases(this_rq->lock)
1743 __acquires(busiest->lock)
1744 __acquires(this_rq->lock)
1746 spin_unlock(&this_rq->lock);
1747 double_rq_lock(this_rq, busiest);
1754 * Unfair double_lock_balance: Optimizes throughput at the expense of
1755 * latency by eliminating extra atomic operations when the locks are
1756 * already in proper order on entry. This favors lower cpu-ids and will
1757 * grant the double lock to lower cpus over higher ids under contention,
1758 * regardless of entry order into the function.
1760 static int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1761 __releases(this_rq->lock)
1762 __acquires(busiest->lock)
1763 __acquires(this_rq->lock)
1767 if (unlikely(!spin_trylock(&busiest->lock))) {
1768 if (busiest < this_rq) {
1769 spin_unlock(&this_rq->lock);
1770 spin_lock(&busiest->lock);
1771 spin_lock_nested(&this_rq->lock, SINGLE_DEPTH_NESTING);
1774 spin_lock_nested(&busiest->lock, SINGLE_DEPTH_NESTING);
1779 #endif /* CONFIG_PREEMPT */
1782 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
1784 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
1786 if (unlikely(!irqs_disabled())) {
1787 /* printk() doesn't work good under rq->lock */
1788 spin_unlock(&this_rq->lock);
1792 return _double_lock_balance(this_rq, busiest);
1795 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
1796 __releases(busiest->lock)
1798 spin_unlock(&busiest->lock);
1799 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
1803 #ifdef CONFIG_FAIR_GROUP_SCHED
1804 static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares)
1807 cfs_rq->shares = shares;
1812 static void calc_load_account_active(struct rq *this_rq);
1814 #include "sched_stats.h"
1815 #include "sched_idletask.c"
1816 #include "sched_fair.c"
1817 #include "sched_rt.c"
1818 #ifdef CONFIG_SCHED_DEBUG
1819 # include "sched_debug.c"
1822 #define sched_class_highest (&rt_sched_class)
1823 #define for_each_class(class) \
1824 for (class = sched_class_highest; class; class = class->next)
1826 static void inc_nr_running(struct rq *rq)
1831 static void dec_nr_running(struct rq *rq)
1836 static void set_load_weight(struct task_struct *p)
1838 if (task_has_rt_policy(p)) {
1839 p->se.load.weight = prio_to_weight[0] * 2;
1840 p->se.load.inv_weight = prio_to_wmult[0] >> 1;
1845 * SCHED_IDLE tasks get minimal weight:
1847 if (p->policy == SCHED_IDLE) {
1848 p->se.load.weight = WEIGHT_IDLEPRIO;
1849 p->se.load.inv_weight = WMULT_IDLEPRIO;
1853 p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO];
1854 p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO];
1857 static void update_avg(u64 *avg, u64 sample)
1859 s64 diff = sample - *avg;
1863 static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup)
1866 p->se.start_runtime = p->se.sum_exec_runtime;
1868 sched_info_queued(p);
1869 p->sched_class->enqueue_task(rq, p, wakeup);
1873 static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep)
1876 if (p->se.last_wakeup) {
1877 update_avg(&p->se.avg_overlap,
1878 p->se.sum_exec_runtime - p->se.last_wakeup);
1879 p->se.last_wakeup = 0;
1881 update_avg(&p->se.avg_wakeup,
1882 sysctl_sched_wakeup_granularity);
1886 sched_info_dequeued(p);
1887 p->sched_class->dequeue_task(rq, p, sleep);
1892 * __normal_prio - return the priority that is based on the static prio
1894 static inline int __normal_prio(struct task_struct *p)
1896 return p->static_prio;
1900 * Calculate the expected normal priority: i.e. priority
1901 * without taking RT-inheritance into account. Might be
1902 * boosted by interactivity modifiers. Changes upon fork,
1903 * setprio syscalls, and whenever the interactivity
1904 * estimator recalculates.
1906 static inline int normal_prio(struct task_struct *p)
1910 if (task_has_rt_policy(p))
1911 prio = MAX_RT_PRIO-1 - p->rt_priority;
1913 prio = __normal_prio(p);
1918 * Calculate the current priority, i.e. the priority
1919 * taken into account by the scheduler. This value might
1920 * be boosted by RT tasks, or might be boosted by
1921 * interactivity modifiers. Will be RT if the task got
1922 * RT-boosted. If not then it returns p->normal_prio.
1924 static int effective_prio(struct task_struct *p)
1926 p->normal_prio = normal_prio(p);
1928 * If we are RT tasks or we were boosted to RT priority,
1929 * keep the priority unchanged. Otherwise, update priority
1930 * to the normal priority:
1932 if (!rt_prio(p->prio))
1933 return p->normal_prio;
1938 * activate_task - move a task to the runqueue.
1940 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup)
1942 if (task_contributes_to_load(p))
1943 rq->nr_uninterruptible--;
1945 enqueue_task(rq, p, wakeup);
1950 * deactivate_task - remove a task from the runqueue.
1952 static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep)
1954 if (task_contributes_to_load(p))
1955 rq->nr_uninterruptible++;
1957 dequeue_task(rq, p, sleep);
1962 * task_curr - is this task currently executing on a CPU?
1963 * @p: the task in question.
1965 inline int task_curr(const struct task_struct *p)
1967 return cpu_curr(task_cpu(p)) == p;
1970 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1972 set_task_rq(p, cpu);
1975 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1976 * successfuly executed on another CPU. We must ensure that updates of
1977 * per-task data have been completed by this moment.
1980 task_thread_info(p)->cpu = cpu;
1984 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1985 const struct sched_class *prev_class,
1986 int oldprio, int running)
1988 if (prev_class != p->sched_class) {
1989 if (prev_class->switched_from)
1990 prev_class->switched_from(rq, p, running);
1991 p->sched_class->switched_to(rq, p, running);
1993 p->sched_class->prio_changed(rq, p, oldprio, running);
1997 * kthread_bind - bind a just-created kthread to a cpu.
1998 * @p: thread created by kthread_create().
1999 * @cpu: cpu (might not be online, must be possible) for @k to run on.
2001 * Description: This function is equivalent to set_cpus_allowed(),
2002 * except that @cpu doesn't need to be online, and the thread must be
2003 * stopped (i.e., just returned from kthread_create()).
2005 * Function lives here instead of kthread.c because it messes with
2006 * scheduler internals which require locking.
2008 void kthread_bind(struct task_struct *p, unsigned int cpu)
2010 struct rq *rq = cpu_rq(cpu);
2011 unsigned long flags;
2013 /* Must have done schedule() in kthread() before we set_task_cpu */
2014 if (!wait_task_inactive(p, TASK_UNINTERRUPTIBLE)) {
2019 spin_lock_irqsave(&rq->lock, flags);
2020 update_rq_clock(rq);
2021 set_task_cpu(p, cpu);
2022 p->cpus_allowed = cpumask_of_cpu(cpu);
2023 p->rt.nr_cpus_allowed = 1;
2024 p->flags |= PF_THREAD_BOUND;
2025 spin_unlock_irqrestore(&rq->lock, flags);
2027 EXPORT_SYMBOL(kthread_bind);
2031 * Is this task likely cache-hot:
2034 task_hot(struct task_struct *p, u64 now, struct sched_domain *sd)
2039 * Buddy candidates are cache hot:
2041 if (sched_feat(CACHE_HOT_BUDDY) && this_rq()->nr_running &&
2042 (&p->se == cfs_rq_of(&p->se)->next ||
2043 &p->se == cfs_rq_of(&p->se)->last))
2046 if (p->sched_class != &fair_sched_class)
2049 if (sysctl_sched_migration_cost == -1)
2051 if (sysctl_sched_migration_cost == 0)
2054 delta = now - p->se.exec_start;
2056 return delta < (s64)sysctl_sched_migration_cost;
2060 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
2062 int old_cpu = task_cpu(p);
2063 struct rq *old_rq = cpu_rq(old_cpu);
2064 struct cfs_rq *old_cfsrq = task_cfs_rq(p),
2065 *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu);
2067 trace_sched_migrate_task(p, new_cpu);
2069 if (old_cpu != new_cpu) {
2070 p->se.nr_migrations++;
2071 #ifdef CONFIG_SCHEDSTATS
2072 if (task_hot(p, old_rq->clock, NULL))
2073 schedstat_inc(p, se.nr_forced2_migrations);
2075 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS,
2078 p->se.vruntime -= old_cfsrq->min_vruntime -
2079 new_cfsrq->min_vruntime;
2081 __set_task_cpu(p, new_cpu);
2084 struct migration_req {
2085 struct list_head list;
2087 struct task_struct *task;
2090 struct completion done;
2094 * The task's runqueue lock must be held.
2095 * Returns true if you have to wait for migration thread.
2098 migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req)
2100 struct rq *rq = task_rq(p);
2103 * If the task is not on a runqueue (and not running), then
2104 * it is sufficient to simply update the task's cpu field.
2106 if (!p->se.on_rq && !task_running(rq, p)) {
2107 update_rq_clock(rq);
2108 set_task_cpu(p, dest_cpu);
2112 init_completion(&req->done);
2114 req->dest_cpu = dest_cpu;
2115 list_add(&req->list, &rq->migration_queue);
2121 * wait_task_context_switch - wait for a thread to complete at least one
2124 * @p must not be current.
2126 void wait_task_context_switch(struct task_struct *p)
2128 unsigned long nvcsw, nivcsw, flags;
2136 * The runqueue is assigned before the actual context
2137 * switch. We need to take the runqueue lock.
2139 * We could check initially without the lock but it is
2140 * very likely that we need to take the lock in every
2143 rq = task_rq_lock(p, &flags);
2144 running = task_running(rq, p);
2145 task_rq_unlock(rq, &flags);
2147 if (likely(!running))
2150 * The switch count is incremented before the actual
2151 * context switch. We thus wait for two switches to be
2152 * sure at least one completed.
2154 if ((p->nvcsw - nvcsw) > 1)
2156 if ((p->nivcsw - nivcsw) > 1)
2164 * wait_task_inactive - wait for a thread to unschedule.
2166 * If @match_state is nonzero, it's the @p->state value just checked and
2167 * not expected to change. If it changes, i.e. @p might have woken up,
2168 * then return zero. When we succeed in waiting for @p to be off its CPU,
2169 * we return a positive number (its total switch count). If a second call
2170 * a short while later returns the same number, the caller can be sure that
2171 * @p has remained unscheduled the whole time.
2173 * The caller must ensure that the task *will* unschedule sometime soon,
2174 * else this function might spin for a *long* time. This function can't
2175 * be called with interrupts off, or it may introduce deadlock with
2176 * smp_call_function() if an IPI is sent by the same process we are
2177 * waiting to become inactive.
2179 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2181 unsigned long flags;
2188 * We do the initial early heuristics without holding
2189 * any task-queue locks at all. We'll only try to get
2190 * the runqueue lock when things look like they will
2196 * If the task is actively running on another CPU
2197 * still, just relax and busy-wait without holding
2200 * NOTE! Since we don't hold any locks, it's not
2201 * even sure that "rq" stays as the right runqueue!
2202 * But we don't care, since "task_running()" will
2203 * return false if the runqueue has changed and p
2204 * is actually now running somewhere else!
2206 while (task_running(rq, p)) {
2207 if (match_state && unlikely(p->state != match_state))
2213 * Ok, time to look more closely! We need the rq
2214 * lock now, to be *sure*. If we're wrong, we'll
2215 * just go back and repeat.
2217 rq = task_rq_lock(p, &flags);
2218 trace_sched_wait_task(rq, p);
2219 running = task_running(rq, p);
2220 on_rq = p->se.on_rq;
2222 if (!match_state || p->state == match_state)
2223 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
2224 task_rq_unlock(rq, &flags);
2227 * If it changed from the expected state, bail out now.
2229 if (unlikely(!ncsw))
2233 * Was it really running after all now that we
2234 * checked with the proper locks actually held?
2236 * Oops. Go back and try again..
2238 if (unlikely(running)) {
2244 * It's not enough that it's not actively running,
2245 * it must be off the runqueue _entirely_, and not
2248 * So if it was still runnable (but just not actively
2249 * running right now), it's preempted, and we should
2250 * yield - it could be a while.
2252 if (unlikely(on_rq)) {
2253 schedule_timeout_uninterruptible(1);
2258 * Ahh, all good. It wasn't running, and it wasn't
2259 * runnable, which means that it will never become
2260 * running in the future either. We're all done!
2269 * kick_process - kick a running thread to enter/exit the kernel
2270 * @p: the to-be-kicked thread
2272 * Cause a process which is running on another CPU to enter
2273 * kernel-mode, without any delay. (to get signals handled.)
2275 * NOTE: this function doesnt have to take the runqueue lock,
2276 * because all it wants to ensure is that the remote task enters
2277 * the kernel. If the IPI races and the task has been migrated
2278 * to another CPU then no harm is done and the purpose has been
2281 void kick_process(struct task_struct *p)
2287 if ((cpu != smp_processor_id()) && task_curr(p))
2288 smp_send_reschedule(cpu);
2291 EXPORT_SYMBOL_GPL(kick_process);
2292 #endif /* CONFIG_SMP */
2295 * task_oncpu_function_call - call a function on the cpu on which a task runs
2296 * @p: the task to evaluate
2297 * @func: the function to be called
2298 * @info: the function call argument
2300 * Calls the function @func when the task is currently running. This might
2301 * be on the current CPU, which just calls the function directly
2303 void task_oncpu_function_call(struct task_struct *p,
2304 void (*func) (void *info), void *info)
2311 smp_call_function_single(cpu, func, info, 1);
2317 int select_task_rq(struct task_struct *p, int sd_flags, int wake_flags)
2319 return p->sched_class->select_task_rq(p, sd_flags, wake_flags);
2324 * try_to_wake_up - wake up a thread
2325 * @p: the to-be-woken-up thread
2326 * @state: the mask of task states that can be woken
2327 * @sync: do a synchronous wakeup?
2329 * Put it on the run-queue if it's not already there. The "current"
2330 * thread is always on the run-queue (except when the actual
2331 * re-schedule is in progress), and as such you're allowed to do
2332 * the simpler "current->state = TASK_RUNNING" to mark yourself
2333 * runnable without the overhead of this.
2335 * returns failure only if the task is already active.
2337 static int try_to_wake_up(struct task_struct *p, unsigned int state,
2340 int cpu, orig_cpu, this_cpu, success = 0;
2341 unsigned long flags;
2342 struct rq *rq, *orig_rq;
2344 if (!sched_feat(SYNC_WAKEUPS))
2345 wake_flags &= ~WF_SYNC;
2347 this_cpu = get_cpu();
2350 rq = orig_rq = task_rq_lock(p, &flags);
2351 update_rq_clock(rq);
2352 if (!(p->state & state))
2362 if (unlikely(task_running(rq, p)))
2366 * In order to handle concurrent wakeups and release the rq->lock
2367 * we put the task in TASK_WAKING state.
2369 * First fix up the nr_uninterruptible count:
2371 if (task_contributes_to_load(p))
2372 rq->nr_uninterruptible--;
2373 p->state = TASK_WAKING;
2374 task_rq_unlock(rq, &flags);
2376 cpu = select_task_rq(p, SD_BALANCE_WAKE, wake_flags);
2377 if (cpu != orig_cpu) {
2378 local_irq_save(flags);
2380 update_rq_clock(rq);
2381 set_task_cpu(p, cpu);
2382 local_irq_restore(flags);
2384 rq = task_rq_lock(p, &flags);
2386 WARN_ON(p->state != TASK_WAKING);
2389 #ifdef CONFIG_SCHEDSTATS
2390 schedstat_inc(rq, ttwu_count);
2391 if (cpu == this_cpu)
2392 schedstat_inc(rq, ttwu_local);
2394 struct sched_domain *sd;
2395 for_each_domain(this_cpu, sd) {
2396 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2397 schedstat_inc(sd, ttwu_wake_remote);
2402 #endif /* CONFIG_SCHEDSTATS */
2405 #endif /* CONFIG_SMP */
2406 schedstat_inc(p, se.nr_wakeups);
2407 if (wake_flags & WF_SYNC)
2408 schedstat_inc(p, se.nr_wakeups_sync);
2409 if (orig_cpu != cpu)
2410 schedstat_inc(p, se.nr_wakeups_migrate);
2411 if (cpu == this_cpu)
2412 schedstat_inc(p, se.nr_wakeups_local);
2414 schedstat_inc(p, se.nr_wakeups_remote);
2415 activate_task(rq, p, 1);
2419 * Only attribute actual wakeups done by this task.
2421 if (!in_interrupt()) {
2422 struct sched_entity *se = ¤t->se;
2423 u64 sample = se->sum_exec_runtime;
2425 if (se->last_wakeup)
2426 sample -= se->last_wakeup;
2428 sample -= se->start_runtime;
2429 update_avg(&se->avg_wakeup, sample);
2431 se->last_wakeup = se->sum_exec_runtime;
2435 trace_sched_wakeup(rq, p, success);
2436 check_preempt_curr(rq, p, wake_flags);
2438 p->state = TASK_RUNNING;
2440 if (p->sched_class->task_wake_up)
2441 p->sched_class->task_wake_up(rq, p);
2443 if (unlikely(rq->idle_stamp)) {
2444 u64 delta = rq->clock - rq->idle_stamp;
2445 u64 max = 2*sysctl_sched_migration_cost;
2450 update_avg(&rq->avg_idle, delta);
2455 task_rq_unlock(rq, &flags);
2462 * wake_up_process - Wake up a specific process
2463 * @p: The process to be woken up.
2465 * Attempt to wake up the nominated process and move it to the set of runnable
2466 * processes. Returns 1 if the process was woken up, 0 if it was already
2469 * It may be assumed that this function implies a write memory barrier before
2470 * changing the task state if and only if any tasks are woken up.
2472 int wake_up_process(struct task_struct *p)
2474 return try_to_wake_up(p, TASK_ALL, 0);
2476 EXPORT_SYMBOL(wake_up_process);
2478 int wake_up_state(struct task_struct *p, unsigned int state)
2480 return try_to_wake_up(p, state, 0);
2484 * Perform scheduler related setup for a newly forked process p.
2485 * p is forked by current.
2487 * __sched_fork() is basic setup used by init_idle() too:
2489 static void __sched_fork(struct task_struct *p)
2491 p->se.exec_start = 0;
2492 p->se.sum_exec_runtime = 0;
2493 p->se.prev_sum_exec_runtime = 0;
2494 p->se.nr_migrations = 0;
2495 p->se.last_wakeup = 0;
2496 p->se.avg_overlap = 0;
2497 p->se.start_runtime = 0;
2498 p->se.avg_wakeup = sysctl_sched_wakeup_granularity;
2499 p->se.avg_running = 0;
2501 #ifdef CONFIG_SCHEDSTATS
2502 p->se.wait_start = 0;
2504 p->se.wait_count = 0;
2507 p->se.sleep_start = 0;
2508 p->se.sleep_max = 0;
2509 p->se.sum_sleep_runtime = 0;
2511 p->se.block_start = 0;
2512 p->se.block_max = 0;
2514 p->se.slice_max = 0;
2516 p->se.nr_migrations_cold = 0;
2517 p->se.nr_failed_migrations_affine = 0;
2518 p->se.nr_failed_migrations_running = 0;
2519 p->se.nr_failed_migrations_hot = 0;
2520 p->se.nr_forced_migrations = 0;
2521 p->se.nr_forced2_migrations = 0;
2523 p->se.nr_wakeups = 0;
2524 p->se.nr_wakeups_sync = 0;
2525 p->se.nr_wakeups_migrate = 0;
2526 p->se.nr_wakeups_local = 0;
2527 p->se.nr_wakeups_remote = 0;
2528 p->se.nr_wakeups_affine = 0;
2529 p->se.nr_wakeups_affine_attempts = 0;
2530 p->se.nr_wakeups_passive = 0;
2531 p->se.nr_wakeups_idle = 0;
2535 INIT_LIST_HEAD(&p->rt.run_list);
2537 INIT_LIST_HEAD(&p->se.group_node);
2539 #ifdef CONFIG_PREEMPT_NOTIFIERS
2540 INIT_HLIST_HEAD(&p->preempt_notifiers);
2544 * We mark the process as running here, but have not actually
2545 * inserted it onto the runqueue yet. This guarantees that
2546 * nobody will actually run it, and a signal or other external
2547 * event cannot wake it up and insert it on the runqueue either.
2549 p->state = TASK_RUNNING;
2553 * fork()/clone()-time setup:
2555 void sched_fork(struct task_struct *p, int clone_flags)
2557 int cpu = get_cpu();
2558 unsigned long flags;
2563 * Revert to default priority/policy on fork if requested.
2565 if (unlikely(p->sched_reset_on_fork)) {
2566 if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) {
2567 p->policy = SCHED_NORMAL;
2568 p->normal_prio = p->static_prio;
2571 if (PRIO_TO_NICE(p->static_prio) < 0) {
2572 p->static_prio = NICE_TO_PRIO(0);
2573 p->normal_prio = p->static_prio;
2578 * We don't need the reset flag anymore after the fork. It has
2579 * fulfilled its duty:
2581 p->sched_reset_on_fork = 0;
2585 * Make sure we do not leak PI boosting priority to the child.
2587 p->prio = current->normal_prio;
2589 if (!rt_prio(p->prio))
2590 p->sched_class = &fair_sched_class;
2593 cpu = select_task_rq(p, SD_BALANCE_FORK, 0);
2595 local_irq_save(flags);
2596 update_rq_clock(cpu_rq(cpu));
2597 set_task_cpu(p, cpu);
2598 local_irq_restore(flags);
2600 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2601 if (likely(sched_info_on()))
2602 memset(&p->sched_info, 0, sizeof(p->sched_info));
2604 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2607 #ifdef CONFIG_PREEMPT
2608 /* Want to start with kernel preemption disabled. */
2609 task_thread_info(p)->preempt_count = 1;
2611 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2617 * wake_up_new_task - wake up a newly created task for the first time.
2619 * This function will do some initial scheduler statistics housekeeping
2620 * that must be done for every newly created context, then puts the task
2621 * on the runqueue and wakes it.
2623 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2625 unsigned long flags;
2628 rq = task_rq_lock(p, &flags);
2629 BUG_ON(p->state != TASK_RUNNING);
2630 update_rq_clock(rq);
2632 if (!p->sched_class->task_new || !current->se.on_rq) {
2633 activate_task(rq, p, 0);
2636 * Let the scheduling class do new task startup
2637 * management (if any):
2639 p->sched_class->task_new(rq, p);
2642 trace_sched_wakeup_new(rq, p, 1);
2643 check_preempt_curr(rq, p, WF_FORK);
2645 if (p->sched_class->task_wake_up)
2646 p->sched_class->task_wake_up(rq, p);
2648 task_rq_unlock(rq, &flags);
2651 #ifdef CONFIG_PREEMPT_NOTIFIERS
2654 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2655 * @notifier: notifier struct to register
2657 void preempt_notifier_register(struct preempt_notifier *notifier)
2659 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2661 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2664 * preempt_notifier_unregister - no longer interested in preemption notifications
2665 * @notifier: notifier struct to unregister
2667 * This is safe to call from within a preemption notifier.
2669 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2671 hlist_del(¬ifier->link);
2673 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2675 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2677 struct preempt_notifier *notifier;
2678 struct hlist_node *node;
2680 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2681 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2685 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2686 struct task_struct *next)
2688 struct preempt_notifier *notifier;
2689 struct hlist_node *node;
2691 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2692 notifier->ops->sched_out(notifier, next);
2695 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2697 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2702 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2703 struct task_struct *next)
2707 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2710 * prepare_task_switch - prepare to switch tasks
2711 * @rq: the runqueue preparing to switch
2712 * @prev: the current task that is being switched out
2713 * @next: the task we are going to switch to.
2715 * This is called with the rq lock held and interrupts off. It must
2716 * be paired with a subsequent finish_task_switch after the context
2719 * prepare_task_switch sets up locking and calls architecture specific
2723 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2724 struct task_struct *next)
2726 fire_sched_out_preempt_notifiers(prev, next);
2727 prepare_lock_switch(rq, next);
2728 prepare_arch_switch(next);
2732 * finish_task_switch - clean up after a task-switch
2733 * @rq: runqueue associated with task-switch
2734 * @prev: the thread we just switched away from.
2736 * finish_task_switch must be called after the context switch, paired
2737 * with a prepare_task_switch call before the context switch.
2738 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2739 * and do any other architecture-specific cleanup actions.
2741 * Note that we may have delayed dropping an mm in context_switch(). If
2742 * so, we finish that here outside of the runqueue lock. (Doing it
2743 * with the lock held can cause deadlocks; see schedule() for
2746 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2747 __releases(rq->lock)
2749 struct mm_struct *mm = rq->prev_mm;
2755 * A task struct has one reference for the use as "current".
2756 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2757 * schedule one last time. The schedule call will never return, and
2758 * the scheduled task must drop that reference.
2759 * The test for TASK_DEAD must occur while the runqueue locks are
2760 * still held, otherwise prev could be scheduled on another cpu, die
2761 * there before we look at prev->state, and then the reference would
2763 * Manfred Spraul <manfred@colorfullife.com>
2765 prev_state = prev->state;
2766 finish_arch_switch(prev);
2767 perf_event_task_sched_in(current, cpu_of(rq));
2768 finish_lock_switch(rq, prev);
2770 fire_sched_in_preempt_notifiers(current);
2773 if (unlikely(prev_state == TASK_DEAD)) {
2775 * Remove function-return probe instances associated with this
2776 * task and put them back on the free list.
2778 kprobe_flush_task(prev);
2779 put_task_struct(prev);
2785 /* assumes rq->lock is held */
2786 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
2788 if (prev->sched_class->pre_schedule)
2789 prev->sched_class->pre_schedule(rq, prev);
2792 /* rq->lock is NOT held, but preemption is disabled */
2793 static inline void post_schedule(struct rq *rq)
2795 if (rq->post_schedule) {
2796 unsigned long flags;
2798 spin_lock_irqsave(&rq->lock, flags);
2799 if (rq->curr->sched_class->post_schedule)
2800 rq->curr->sched_class->post_schedule(rq);
2801 spin_unlock_irqrestore(&rq->lock, flags);
2803 rq->post_schedule = 0;
2809 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
2813 static inline void post_schedule(struct rq *rq)
2820 * schedule_tail - first thing a freshly forked thread must call.
2821 * @prev: the thread we just switched away from.
2823 asmlinkage void schedule_tail(struct task_struct *prev)
2824 __releases(rq->lock)
2826 struct rq *rq = this_rq();
2828 finish_task_switch(rq, prev);
2831 * FIXME: do we need to worry about rq being invalidated by the
2836 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2837 /* In this case, finish_task_switch does not reenable preemption */
2840 if (current->set_child_tid)
2841 put_user(task_pid_vnr(current), current->set_child_tid);
2845 * context_switch - switch to the new MM and the new
2846 * thread's register state.
2849 context_switch(struct rq *rq, struct task_struct *prev,
2850 struct task_struct *next)
2852 struct mm_struct *mm, *oldmm;
2854 prepare_task_switch(rq, prev, next);
2855 trace_sched_switch(rq, prev, next);
2857 oldmm = prev->active_mm;
2859 * For paravirt, this is coupled with an exit in switch_to to
2860 * combine the page table reload and the switch backend into
2863 arch_start_context_switch(prev);
2866 next->active_mm = oldmm;
2867 atomic_inc(&oldmm->mm_count);
2868 enter_lazy_tlb(oldmm, next);
2870 switch_mm(oldmm, mm, next);
2872 if (likely(!prev->mm)) {
2873 prev->active_mm = NULL;
2874 rq->prev_mm = oldmm;
2877 * Since the runqueue lock will be released by the next
2878 * task (which is an invalid locking op but in the case
2879 * of the scheduler it's an obvious special-case), so we
2880 * do an early lockdep release here:
2882 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2883 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2886 /* Here we just switch the register state and the stack. */
2887 switch_to(prev, next, prev);
2891 * this_rq must be evaluated again because prev may have moved
2892 * CPUs since it called schedule(), thus the 'rq' on its stack
2893 * frame will be invalid.
2895 finish_task_switch(this_rq(), prev);
2899 * nr_running, nr_uninterruptible and nr_context_switches:
2901 * externally visible scheduler statistics: current number of runnable
2902 * threads, current number of uninterruptible-sleeping threads, total
2903 * number of context switches performed since bootup.
2905 unsigned long nr_running(void)
2907 unsigned long i, sum = 0;
2909 for_each_online_cpu(i)
2910 sum += cpu_rq(i)->nr_running;
2915 unsigned long nr_uninterruptible(void)
2917 unsigned long i, sum = 0;
2919 for_each_possible_cpu(i)
2920 sum += cpu_rq(i)->nr_uninterruptible;
2923 * Since we read the counters lockless, it might be slightly
2924 * inaccurate. Do not allow it to go below zero though:
2926 if (unlikely((long)sum < 0))
2932 unsigned long long nr_context_switches(void)
2935 unsigned long long sum = 0;
2937 for_each_possible_cpu(i)
2938 sum += cpu_rq(i)->nr_switches;
2943 unsigned long nr_iowait(void)
2945 unsigned long i, sum = 0;
2947 for_each_possible_cpu(i)
2948 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2953 unsigned long nr_iowait_cpu(void)
2955 struct rq *this = this_rq();
2956 return atomic_read(&this->nr_iowait);
2959 unsigned long this_cpu_load(void)
2961 struct rq *this = this_rq();
2962 return this->cpu_load[0];
2966 /* Variables and functions for calc_load */
2967 static atomic_long_t calc_load_tasks;
2968 static unsigned long calc_load_update;
2969 unsigned long avenrun[3];
2970 EXPORT_SYMBOL(avenrun);
2973 * get_avenrun - get the load average array
2974 * @loads: pointer to dest load array
2975 * @offset: offset to add
2976 * @shift: shift count to shift the result left
2978 * These values are estimates at best, so no need for locking.
2980 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
2982 loads[0] = (avenrun[0] + offset) << shift;
2983 loads[1] = (avenrun[1] + offset) << shift;
2984 loads[2] = (avenrun[2] + offset) << shift;
2987 static unsigned long
2988 calc_load(unsigned long load, unsigned long exp, unsigned long active)
2991 load += active * (FIXED_1 - exp);
2992 return load >> FSHIFT;
2996 * calc_load - update the avenrun load estimates 10 ticks after the
2997 * CPUs have updated calc_load_tasks.
2999 void calc_global_load(void)
3001 unsigned long upd = calc_load_update + 10;
3004 if (time_before(jiffies, upd))
3007 active = atomic_long_read(&calc_load_tasks);
3008 active = active > 0 ? active * FIXED_1 : 0;
3010 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
3011 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
3012 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
3014 calc_load_update += LOAD_FREQ;
3018 * Either called from update_cpu_load() or from a cpu going idle
3020 static void calc_load_account_active(struct rq *this_rq)
3022 long nr_active, delta;
3024 nr_active = this_rq->nr_running;
3025 nr_active += (long) this_rq->nr_uninterruptible;
3027 if (nr_active != this_rq->calc_load_active) {
3028 delta = nr_active - this_rq->calc_load_active;
3029 this_rq->calc_load_active = nr_active;
3030 atomic_long_add(delta, &calc_load_tasks);
3035 * Update rq->cpu_load[] statistics. This function is usually called every
3036 * scheduler tick (TICK_NSEC).
3038 static void update_cpu_load(struct rq *this_rq)
3040 unsigned long this_load = this_rq->load.weight;
3043 this_rq->nr_load_updates++;
3045 /* Update our load: */
3046 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
3047 unsigned long old_load, new_load;
3049 /* scale is effectively 1 << i now, and >> i divides by scale */
3051 old_load = this_rq->cpu_load[i];
3052 new_load = this_load;
3054 * Round up the averaging division if load is increasing. This
3055 * prevents us from getting stuck on 9 if the load is 10, for
3058 if (new_load > old_load)
3059 new_load += scale-1;
3060 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
3063 if (time_after_eq(jiffies, this_rq->calc_load_update)) {
3064 this_rq->calc_load_update += LOAD_FREQ;
3065 calc_load_account_active(this_rq);
3072 * double_rq_lock - safely lock two runqueues
3074 * Note this does not disable interrupts like task_rq_lock,
3075 * you need to do so manually before calling.
3077 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
3078 __acquires(rq1->lock)
3079 __acquires(rq2->lock)
3081 BUG_ON(!irqs_disabled());
3083 spin_lock(&rq1->lock);
3084 __acquire(rq2->lock); /* Fake it out ;) */
3087 spin_lock(&rq1->lock);
3088 spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
3090 spin_lock(&rq2->lock);
3091 spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
3094 update_rq_clock(rq1);
3095 update_rq_clock(rq2);
3099 * double_rq_unlock - safely unlock two runqueues
3101 * Note this does not restore interrupts like task_rq_unlock,
3102 * you need to do so manually after calling.
3104 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
3105 __releases(rq1->lock)
3106 __releases(rq2->lock)
3108 spin_unlock(&rq1->lock);
3110 spin_unlock(&rq2->lock);
3112 __release(rq2->lock);
3116 * If dest_cpu is allowed for this process, migrate the task to it.
3117 * This is accomplished by forcing the cpu_allowed mask to only
3118 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
3119 * the cpu_allowed mask is restored.
3121 static void sched_migrate_task(struct task_struct *p, int dest_cpu)
3123 struct migration_req req;
3124 unsigned long flags;
3127 rq = task_rq_lock(p, &flags);
3128 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed)
3129 || unlikely(!cpu_active(dest_cpu)))
3132 /* force the process onto the specified CPU */
3133 if (migrate_task(p, dest_cpu, &req)) {
3134 /* Need to wait for migration thread (might exit: take ref). */
3135 struct task_struct *mt = rq->migration_thread;
3137 get_task_struct(mt);
3138 task_rq_unlock(rq, &flags);
3139 wake_up_process(mt);
3140 put_task_struct(mt);
3141 wait_for_completion(&req.done);
3146 task_rq_unlock(rq, &flags);
3150 * sched_exec - execve() is a valuable balancing opportunity, because at
3151 * this point the task has the smallest effective memory and cache footprint.
3153 void sched_exec(void)
3155 int new_cpu, this_cpu = get_cpu();
3156 new_cpu = select_task_rq(current, SD_BALANCE_EXEC, 0);
3158 if (new_cpu != this_cpu)
3159 sched_migrate_task(current, new_cpu);
3163 * pull_task - move a task from a remote runqueue to the local runqueue.
3164 * Both runqueues must be locked.
3166 static void pull_task(struct rq *src_rq, struct task_struct *p,
3167 struct rq *this_rq, int this_cpu)
3169 deactivate_task(src_rq, p, 0);
3170 set_task_cpu(p, this_cpu);
3171 activate_task(this_rq, p, 0);
3173 * Note that idle threads have a prio of MAX_PRIO, for this test
3174 * to be always true for them.
3176 check_preempt_curr(this_rq, p, 0);
3180 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
3183 int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu,
3184 struct sched_domain *sd, enum cpu_idle_type idle,
3187 int tsk_cache_hot = 0;
3189 * We do not migrate tasks that are:
3190 * 1) running (obviously), or
3191 * 2) cannot be migrated to this CPU due to cpus_allowed, or
3192 * 3) are cache-hot on their current CPU.
3194 if (!cpumask_test_cpu(this_cpu, &p->cpus_allowed)) {
3195 schedstat_inc(p, se.nr_failed_migrations_affine);
3200 if (task_running(rq, p)) {
3201 schedstat_inc(p, se.nr_failed_migrations_running);
3206 * Aggressive migration if:
3207 * 1) task is cache cold, or
3208 * 2) too many balance attempts have failed.
3211 tsk_cache_hot = task_hot(p, rq->clock, sd);
3212 if (!tsk_cache_hot ||
3213 sd->nr_balance_failed > sd->cache_nice_tries) {
3214 #ifdef CONFIG_SCHEDSTATS
3215 if (tsk_cache_hot) {
3216 schedstat_inc(sd, lb_hot_gained[idle]);
3217 schedstat_inc(p, se.nr_forced_migrations);
3223 if (tsk_cache_hot) {
3224 schedstat_inc(p, se.nr_failed_migrations_hot);
3230 static unsigned long
3231 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3232 unsigned long max_load_move, struct sched_domain *sd,
3233 enum cpu_idle_type idle, int *all_pinned,
3234 int *this_best_prio, struct rq_iterator *iterator)
3236 int loops = 0, pulled = 0, pinned = 0;
3237 struct task_struct *p;
3238 long rem_load_move = max_load_move;
3240 if (max_load_move == 0)
3246 * Start the load-balancing iterator:
3248 p = iterator->start(iterator->arg);
3250 if (!p || loops++ > sysctl_sched_nr_migrate)
3253 if ((p->se.load.weight >> 1) > rem_load_move ||
3254 !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3255 p = iterator->next(iterator->arg);
3259 pull_task(busiest, p, this_rq, this_cpu);
3261 rem_load_move -= p->se.load.weight;
3263 #ifdef CONFIG_PREEMPT
3265 * NEWIDLE balancing is a source of latency, so preemptible kernels
3266 * will stop after the first task is pulled to minimize the critical
3269 if (idle == CPU_NEWLY_IDLE)
3274 * We only want to steal up to the prescribed amount of weighted load.
3276 if (rem_load_move > 0) {
3277 if (p->prio < *this_best_prio)
3278 *this_best_prio = p->prio;
3279 p = iterator->next(iterator->arg);
3284 * Right now, this is one of only two places pull_task() is called,
3285 * so we can safely collect pull_task() stats here rather than
3286 * inside pull_task().
3288 schedstat_add(sd, lb_gained[idle], pulled);
3291 *all_pinned = pinned;
3293 return max_load_move - rem_load_move;
3297 * move_tasks tries to move up to max_load_move weighted load from busiest to
3298 * this_rq, as part of a balancing operation within domain "sd".
3299 * Returns 1 if successful and 0 otherwise.
3301 * Called with both runqueues locked.
3303 static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3304 unsigned long max_load_move,
3305 struct sched_domain *sd, enum cpu_idle_type idle,
3308 const struct sched_class *class = sched_class_highest;
3309 unsigned long total_load_moved = 0;
3310 int this_best_prio = this_rq->curr->prio;
3314 class->load_balance(this_rq, this_cpu, busiest,
3315 max_load_move - total_load_moved,
3316 sd, idle, all_pinned, &this_best_prio);
3317 class = class->next;
3319 #ifdef CONFIG_PREEMPT
3321 * NEWIDLE balancing is a source of latency, so preemptible
3322 * kernels will stop after the first task is pulled to minimize
3323 * the critical section.
3325 if (idle == CPU_NEWLY_IDLE && this_rq->nr_running)
3328 } while (class && max_load_move > total_load_moved);
3330 return total_load_moved > 0;
3334 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3335 struct sched_domain *sd, enum cpu_idle_type idle,
3336 struct rq_iterator *iterator)
3338 struct task_struct *p = iterator->start(iterator->arg);
3342 if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3343 pull_task(busiest, p, this_rq, this_cpu);
3345 * Right now, this is only the second place pull_task()
3346 * is called, so we can safely collect pull_task()
3347 * stats here rather than inside pull_task().
3349 schedstat_inc(sd, lb_gained[idle]);
3353 p = iterator->next(iterator->arg);
3360 * move_one_task tries to move exactly one task from busiest to this_rq, as
3361 * part of active balancing operations within "domain".
3362 * Returns 1 if successful and 0 otherwise.
3364 * Called with both runqueues locked.
3366 static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3367 struct sched_domain *sd, enum cpu_idle_type idle)
3369 const struct sched_class *class;
3371 for_each_class(class) {
3372 if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle))
3378 /********** Helpers for find_busiest_group ************************/
3380 * sd_lb_stats - Structure to store the statistics of a sched_domain
3381 * during load balancing.
3383 struct sd_lb_stats {
3384 struct sched_group *busiest; /* Busiest group in this sd */
3385 struct sched_group *this; /* Local group in this sd */
3386 unsigned long total_load; /* Total load of all groups in sd */
3387 unsigned long total_pwr; /* Total power of all groups in sd */
3388 unsigned long avg_load; /* Average load across all groups in sd */
3390 /** Statistics of this group */
3391 unsigned long this_load;
3392 unsigned long this_load_per_task;
3393 unsigned long this_nr_running;
3395 /* Statistics of the busiest group */
3396 unsigned long max_load;
3397 unsigned long busiest_load_per_task;
3398 unsigned long busiest_nr_running;
3400 int group_imb; /* Is there imbalance in this sd */
3401 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3402 int power_savings_balance; /* Is powersave balance needed for this sd */
3403 struct sched_group *group_min; /* Least loaded group in sd */
3404 struct sched_group *group_leader; /* Group which relieves group_min */
3405 unsigned long min_load_per_task; /* load_per_task in group_min */
3406 unsigned long leader_nr_running; /* Nr running of group_leader */
3407 unsigned long min_nr_running; /* Nr running of group_min */
3412 * sg_lb_stats - stats of a sched_group required for load_balancing
3414 struct sg_lb_stats {
3415 unsigned long avg_load; /*Avg load across the CPUs of the group */
3416 unsigned long group_load; /* Total load over the CPUs of the group */
3417 unsigned long sum_nr_running; /* Nr tasks running in the group */
3418 unsigned long sum_weighted_load; /* Weighted load of group's tasks */
3419 unsigned long group_capacity;
3420 int group_imb; /* Is there an imbalance in the group ? */
3424 * group_first_cpu - Returns the first cpu in the cpumask of a sched_group.
3425 * @group: The group whose first cpu is to be returned.
3427 static inline unsigned int group_first_cpu(struct sched_group *group)
3429 return cpumask_first(sched_group_cpus(group));
3433 * get_sd_load_idx - Obtain the load index for a given sched domain.
3434 * @sd: The sched_domain whose load_idx is to be obtained.
3435 * @idle: The Idle status of the CPU for whose sd load_icx is obtained.
3437 static inline int get_sd_load_idx(struct sched_domain *sd,
3438 enum cpu_idle_type idle)
3444 load_idx = sd->busy_idx;
3447 case CPU_NEWLY_IDLE:
3448 load_idx = sd->newidle_idx;
3451 load_idx = sd->idle_idx;
3459 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3461 * init_sd_power_savings_stats - Initialize power savings statistics for
3462 * the given sched_domain, during load balancing.
3464 * @sd: Sched domain whose power-savings statistics are to be initialized.
3465 * @sds: Variable containing the statistics for sd.
3466 * @idle: Idle status of the CPU at which we're performing load-balancing.
3468 static inline void init_sd_power_savings_stats(struct sched_domain *sd,
3469 struct sd_lb_stats *sds, enum cpu_idle_type idle)
3472 * Busy processors will not participate in power savings
3475 if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE))
3476 sds->power_savings_balance = 0;
3478 sds->power_savings_balance = 1;
3479 sds->min_nr_running = ULONG_MAX;
3480 sds->leader_nr_running = 0;
3485 * update_sd_power_savings_stats - Update the power saving stats for a
3486 * sched_domain while performing load balancing.
3488 * @group: sched_group belonging to the sched_domain under consideration.
3489 * @sds: Variable containing the statistics of the sched_domain
3490 * @local_group: Does group contain the CPU for which we're performing
3492 * @sgs: Variable containing the statistics of the group.
3494 static inline void update_sd_power_savings_stats(struct sched_group *group,
3495 struct sd_lb_stats *sds, int local_group, struct sg_lb_stats *sgs)
3498 if (!sds->power_savings_balance)
3502 * If the local group is idle or completely loaded
3503 * no need to do power savings balance at this domain
3505 if (local_group && (sds->this_nr_running >= sgs->group_capacity ||
3506 !sds->this_nr_running))
3507 sds->power_savings_balance = 0;
3510 * If a group is already running at full capacity or idle,
3511 * don't include that group in power savings calculations
3513 if (!sds->power_savings_balance ||
3514 sgs->sum_nr_running >= sgs->group_capacity ||
3515 !sgs->sum_nr_running)
3519 * Calculate the group which has the least non-idle load.
3520 * This is the group from where we need to pick up the load
3523 if ((sgs->sum_nr_running < sds->min_nr_running) ||
3524 (sgs->sum_nr_running == sds->min_nr_running &&
3525 group_first_cpu(group) > group_first_cpu(sds->group_min))) {
3526 sds->group_min = group;
3527 sds->min_nr_running = sgs->sum_nr_running;
3528 sds->min_load_per_task = sgs->sum_weighted_load /
3529 sgs->sum_nr_running;
3533 * Calculate the group which is almost near its
3534 * capacity but still has some space to pick up some load
3535 * from other group and save more power
3537 if (sgs->sum_nr_running + 1 > sgs->group_capacity)
3540 if (sgs->sum_nr_running > sds->leader_nr_running ||
3541 (sgs->sum_nr_running == sds->leader_nr_running &&
3542 group_first_cpu(group) < group_first_cpu(sds->group_leader))) {
3543 sds->group_leader = group;
3544 sds->leader_nr_running = sgs->sum_nr_running;
3549 * check_power_save_busiest_group - see if there is potential for some power-savings balance
3550 * @sds: Variable containing the statistics of the sched_domain
3551 * under consideration.
3552 * @this_cpu: Cpu at which we're currently performing load-balancing.
3553 * @imbalance: Variable to store the imbalance.
3556 * Check if we have potential to perform some power-savings balance.
3557 * If yes, set the busiest group to be the least loaded group in the
3558 * sched_domain, so that it's CPUs can be put to idle.
3560 * Returns 1 if there is potential to perform power-savings balance.
3563 static inline int check_power_save_busiest_group(struct sd_lb_stats *sds,
3564 int this_cpu, unsigned long *imbalance)
3566 if (!sds->power_savings_balance)
3569 if (sds->this != sds->group_leader ||
3570 sds->group_leader == sds->group_min)
3573 *imbalance = sds->min_load_per_task;
3574 sds->busiest = sds->group_min;
3579 #else /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
3580 static inline void init_sd_power_savings_stats(struct sched_domain *sd,
3581 struct sd_lb_stats *sds, enum cpu_idle_type idle)
3586 static inline void update_sd_power_savings_stats(struct sched_group *group,
3587 struct sd_lb_stats *sds, int local_group, struct sg_lb_stats *sgs)
3592 static inline int check_power_save_busiest_group(struct sd_lb_stats *sds,
3593 int this_cpu, unsigned long *imbalance)
3597 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
3600 unsigned long default_scale_freq_power(struct sched_domain *sd, int cpu)
3602 return SCHED_LOAD_SCALE;
3605 unsigned long __weak arch_scale_freq_power(struct sched_domain *sd, int cpu)
3607 return default_scale_freq_power(sd, cpu);
3610 unsigned long default_scale_smt_power(struct sched_domain *sd, int cpu)
3612 unsigned long weight = cpumask_weight(sched_domain_span(sd));
3613 unsigned long smt_gain = sd->smt_gain;
3620 unsigned long __weak arch_scale_smt_power(struct sched_domain *sd, int cpu)
3622 return default_scale_smt_power(sd, cpu);
3625 unsigned long scale_rt_power(int cpu)
3627 struct rq *rq = cpu_rq(cpu);
3628 u64 total, available;
3630 sched_avg_update(rq);
3632 total = sched_avg_period() + (rq->clock - rq->age_stamp);
3633 available = total - rq->rt_avg;
3635 if (unlikely((s64)total < SCHED_LOAD_SCALE))
3636 total = SCHED_LOAD_SCALE;
3638 total >>= SCHED_LOAD_SHIFT;
3640 return div_u64(available, total);
3643 static void update_cpu_power(struct sched_domain *sd, int cpu)
3645 unsigned long weight = cpumask_weight(sched_domain_span(sd));
3646 unsigned long power = SCHED_LOAD_SCALE;
3647 struct sched_group *sdg = sd->groups;
3649 if (sched_feat(ARCH_POWER))
3650 power *= arch_scale_freq_power(sd, cpu);
3652 power *= default_scale_freq_power(sd, cpu);
3654 power >>= SCHED_LOAD_SHIFT;
3656 if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) {
3657 if (sched_feat(ARCH_POWER))
3658 power *= arch_scale_smt_power(sd, cpu);
3660 power *= default_scale_smt_power(sd, cpu);
3662 power >>= SCHED_LOAD_SHIFT;
3665 power *= scale_rt_power(cpu);
3666 power >>= SCHED_LOAD_SHIFT;
3671 sdg->cpu_power = power;
3674 static void update_group_power(struct sched_domain *sd, int cpu)
3676 struct sched_domain *child = sd->child;
3677 struct sched_group *group, *sdg = sd->groups;
3678 unsigned long power;
3681 update_cpu_power(sd, cpu);
3687 group = child->groups;
3689 power += group->cpu_power;
3690 group = group->next;
3691 } while (group != child->groups);
3693 sdg->cpu_power = power;
3697 * update_sg_lb_stats - Update sched_group's statistics for load balancing.
3698 * @sd: The sched_domain whose statistics are to be updated.
3699 * @group: sched_group whose statistics are to be updated.
3700 * @this_cpu: Cpu for which load balance is currently performed.
3701 * @idle: Idle status of this_cpu
3702 * @load_idx: Load index of sched_domain of this_cpu for load calc.
3703 * @sd_idle: Idle status of the sched_domain containing group.
3704 * @local_group: Does group contain this_cpu.
3705 * @cpus: Set of cpus considered for load balancing.
3706 * @balance: Should we balance.
3707 * @sgs: variable to hold the statistics for this group.
3709 static inline void update_sg_lb_stats(struct sched_domain *sd,
3710 struct sched_group *group, int this_cpu,
3711 enum cpu_idle_type idle, int load_idx, int *sd_idle,
3712 int local_group, const struct cpumask *cpus,
3713 int *balance, struct sg_lb_stats *sgs)
3715 unsigned long load, max_cpu_load, min_cpu_load;
3717 unsigned int balance_cpu = -1, first_idle_cpu = 0;
3718 unsigned long sum_avg_load_per_task;
3719 unsigned long avg_load_per_task;
3722 balance_cpu = group_first_cpu(group);
3723 if (balance_cpu == this_cpu)
3724 update_group_power(sd, this_cpu);
3727 /* Tally up the load of all CPUs in the group */
3728 sum_avg_load_per_task = avg_load_per_task = 0;
3730 min_cpu_load = ~0UL;
3732 for_each_cpu_and(i, sched_group_cpus(group), cpus) {
3733 struct rq *rq = cpu_rq(i);
3735 if (*sd_idle && rq->nr_running)
3738 /* Bias balancing toward cpus of our domain */
3740 if (idle_cpu(i) && !first_idle_cpu) {
3745 load = target_load(i, load_idx);
3747 load = source_load(i, load_idx);
3748 if (load > max_cpu_load)
3749 max_cpu_load = load;
3750 if (min_cpu_load > load)
3751 min_cpu_load = load;
3754 sgs->group_load += load;
3755 sgs->sum_nr_running += rq->nr_running;
3756 sgs->sum_weighted_load += weighted_cpuload(i);
3758 sum_avg_load_per_task += cpu_avg_load_per_task(i);
3762 * First idle cpu or the first cpu(busiest) in this sched group
3763 * is eligible for doing load balancing at this and above
3764 * domains. In the newly idle case, we will allow all the cpu's
3765 * to do the newly idle load balance.
3767 if (idle != CPU_NEWLY_IDLE && local_group &&
3768 balance_cpu != this_cpu && balance) {
3773 /* Adjust by relative CPU power of the group */
3774 sgs->avg_load = (sgs->group_load * SCHED_LOAD_SCALE) / group->cpu_power;
3778 * Consider the group unbalanced when the imbalance is larger
3779 * than the average weight of two tasks.
3781 * APZ: with cgroup the avg task weight can vary wildly and
3782 * might not be a suitable number - should we keep a
3783 * normalized nr_running number somewhere that negates
3786 avg_load_per_task = (sum_avg_load_per_task * SCHED_LOAD_SCALE) /
3789 if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task)
3792 sgs->group_capacity =
3793 DIV_ROUND_CLOSEST(group->cpu_power, SCHED_LOAD_SCALE);
3797 * update_sd_lb_stats - Update sched_group's statistics for load balancing.
3798 * @sd: sched_domain whose statistics are to be updated.
3799 * @this_cpu: Cpu for which load balance is currently performed.
3800 * @idle: Idle status of this_cpu
3801 * @sd_idle: Idle status of the sched_domain containing group.
3802 * @cpus: Set of cpus considered for load balancing.
3803 * @balance: Should we balance.
3804 * @sds: variable to hold the statistics for this sched_domain.
3806 static inline void update_sd_lb_stats(struct sched_domain *sd, int this_cpu,
3807 enum cpu_idle_type idle, int *sd_idle,
3808 const struct cpumask *cpus, int *balance,
3809 struct sd_lb_stats *sds)
3811 struct sched_domain *child = sd->child;
3812 struct sched_group *group = sd->groups;
3813 struct sg_lb_stats sgs;
3814 int load_idx, prefer_sibling = 0;
3816 if (child && child->flags & SD_PREFER_SIBLING)
3819 init_sd_power_savings_stats(sd, sds, idle);
3820 load_idx = get_sd_load_idx(sd, idle);
3825 local_group = cpumask_test_cpu(this_cpu,
3826 sched_group_cpus(group));
3827 memset(&sgs, 0, sizeof(sgs));
3828 update_sg_lb_stats(sd, group, this_cpu, idle, load_idx, sd_idle,
3829 local_group, cpus, balance, &sgs);
3831 if (local_group && balance && !(*balance))
3834 sds->total_load += sgs.group_load;
3835 sds->total_pwr += group->cpu_power;
3838 * In case the child domain prefers tasks go to siblings
3839 * first, lower the group capacity to one so that we'll try
3840 * and move all the excess tasks away.
3843 sgs.group_capacity = min(sgs.group_capacity, 1UL);
3846 sds->this_load = sgs.avg_load;
3848 sds->this_nr_running = sgs.sum_nr_running;
3849 sds->this_load_per_task = sgs.sum_weighted_load;
3850 } else if (sgs.avg_load > sds->max_load &&
3851 (sgs.sum_nr_running > sgs.group_capacity ||
3853 sds->max_load = sgs.avg_load;
3854 sds->busiest = group;
3855 sds->busiest_nr_running = sgs.sum_nr_running;
3856 sds->busiest_load_per_task = sgs.sum_weighted_load;
3857 sds->group_imb = sgs.group_imb;
3860 update_sd_power_savings_stats(group, sds, local_group, &sgs);
3861 group = group->next;
3862 } while (group != sd->groups);
3866 * fix_small_imbalance - Calculate the minor imbalance that exists
3867 * amongst the groups of a sched_domain, during
3869 * @sds: Statistics of the sched_domain whose imbalance is to be calculated.
3870 * @this_cpu: The cpu at whose sched_domain we're performing load-balance.
3871 * @imbalance: Variable to store the imbalance.
3873 static inline void fix_small_imbalance(struct sd_lb_stats *sds,
3874 int this_cpu, unsigned long *imbalance)
3876 unsigned long tmp, pwr_now = 0, pwr_move = 0;
3877 unsigned int imbn = 2;
3879 if (sds->this_nr_running) {
3880 sds->this_load_per_task /= sds->this_nr_running;
3881 if (sds->busiest_load_per_task >
3882 sds->this_load_per_task)
3885 sds->this_load_per_task =
3886 cpu_avg_load_per_task(this_cpu);
3888 if (sds->max_load - sds->this_load + sds->busiest_load_per_task >=
3889 sds->busiest_load_per_task * imbn) {
3890 *imbalance = sds->busiest_load_per_task;
3895 * OK, we don't have enough imbalance to justify moving tasks,
3896 * however we may be able to increase total CPU power used by
3900 pwr_now += sds->busiest->cpu_power *
3901 min(sds->busiest_load_per_task, sds->max_load);
3902 pwr_now += sds->this->cpu_power *
3903 min(sds->this_load_per_task, sds->this_load);
3904 pwr_now /= SCHED_LOAD_SCALE;
3906 /* Amount of load we'd subtract */
3907 tmp = (sds->busiest_load_per_task * SCHED_LOAD_SCALE) /
3908 sds->busiest->cpu_power;
3909 if (sds->max_load > tmp)
3910 pwr_move += sds->busiest->cpu_power *
3911 min(sds->busiest_load_per_task, sds->max_load - tmp);
3913 /* Amount of load we'd add */
3914 if (sds->max_load * sds->busiest->cpu_power <
3915 sds->busiest_load_per_task * SCHED_LOAD_SCALE)
3916 tmp = (sds->max_load * sds->busiest->cpu_power) /
3917 sds->this->cpu_power;
3919 tmp = (sds->busiest_load_per_task * SCHED_LOAD_SCALE) /
3920 sds->this->cpu_power;
3921 pwr_move += sds->this->cpu_power *
3922 min(sds->this_load_per_task, sds->this_load + tmp);
3923 pwr_move /= SCHED_LOAD_SCALE;
3925 /* Move if we gain throughput */
3926 if (pwr_move > pwr_now)
3927 *imbalance = sds->busiest_load_per_task;
3931 * calculate_imbalance - Calculate the amount of imbalance present within the
3932 * groups of a given sched_domain during load balance.
3933 * @sds: statistics of the sched_domain whose imbalance is to be calculated.
3934 * @this_cpu: Cpu for which currently load balance is being performed.
3935 * @imbalance: The variable to store the imbalance.
3937 static inline void calculate_imbalance(struct sd_lb_stats *sds, int this_cpu,
3938 unsigned long *imbalance)
3940 unsigned long max_pull;
3942 * In the presence of smp nice balancing, certain scenarios can have
3943 * max load less than avg load(as we skip the groups at or below
3944 * its cpu_power, while calculating max_load..)
3946 if (sds->max_load < sds->avg_load) {
3948 return fix_small_imbalance(sds, this_cpu, imbalance);
3951 /* Don't want to pull so many tasks that a group would go idle */
3952 max_pull = min(sds->max_load - sds->avg_load,
3953 sds->max_load - sds->busiest_load_per_task);
3955 /* How much load to actually move to equalise the imbalance */
3956 *imbalance = min(max_pull * sds->busiest->cpu_power,
3957 (sds->avg_load - sds->this_load) * sds->this->cpu_power)
3961 * if *imbalance is less than the average load per runnable task
3962 * there is no gaurantee that any tasks will be moved so we'll have
3963 * a think about bumping its value to force at least one task to be
3966 if (*imbalance < sds->busiest_load_per_task)
3967 return fix_small_imbalance(sds, this_cpu, imbalance);
3970 /******* find_busiest_group() helpers end here *********************/
3973 * find_busiest_group - Returns the busiest group within the sched_domain
3974 * if there is an imbalance. If there isn't an imbalance, and
3975 * the user has opted for power-savings, it returns a group whose
3976 * CPUs can be put to idle by rebalancing those tasks elsewhere, if
3977 * such a group exists.
3979 * Also calculates the amount of weighted load which should be moved
3980 * to restore balance.
3982 * @sd: The sched_domain whose busiest group is to be returned.
3983 * @this_cpu: The cpu for which load balancing is currently being performed.
3984 * @imbalance: Variable which stores amount of weighted load which should
3985 * be moved to restore balance/put a group to idle.
3986 * @idle: The idle status of this_cpu.
3987 * @sd_idle: The idleness of sd
3988 * @cpus: The set of CPUs under consideration for load-balancing.
3989 * @balance: Pointer to a variable indicating if this_cpu
3990 * is the appropriate cpu to perform load balancing at this_level.
3992 * Returns: - the busiest group if imbalance exists.
3993 * - If no imbalance and user has opted for power-savings balance,
3994 * return the least loaded group whose CPUs can be
3995 * put to idle by rebalancing its tasks onto our group.
3997 static struct sched_group *
3998 find_busiest_group(struct sched_domain *sd, int this_cpu,
3999 unsigned long *imbalance, enum cpu_idle_type idle,
4000 int *sd_idle, const struct cpumask *cpus, int *balance)
4002 struct sd_lb_stats sds;
4004 memset(&sds, 0, sizeof(sds));
4007 * Compute the various statistics relavent for load balancing at
4010 update_sd_lb_stats(sd, this_cpu, idle, sd_idle, cpus,
4013 /* Cases where imbalance does not exist from POV of this_cpu */
4014 /* 1) this_cpu is not the appropriate cpu to perform load balancing
4016 * 2) There is no busy sibling group to pull from.
4017 * 3) This group is the busiest group.
4018 * 4) This group is more busy than the avg busieness at this
4020 * 5) The imbalance is within the specified limit.
4021 * 6) Any rebalance would lead to ping-pong
4023 if (balance && !(*balance))
4026 if (!sds.busiest || sds.busiest_nr_running == 0)
4029 if (sds.this_load >= sds.max_load)
4032 sds.avg_load = (SCHED_LOAD_SCALE * sds.total_load) / sds.total_pwr;
4034 if (sds.this_load >= sds.avg_load)
4037 if (100 * sds.max_load <= sd->imbalance_pct * sds.this_load)
4040 sds.busiest_load_per_task /= sds.busiest_nr_running;
4042 sds.busiest_load_per_task =
4043 min(sds.busiest_load_per_task, sds.avg_load);
4046 * We're trying to get all the cpus to the average_load, so we don't
4047 * want to push ourselves above the average load, nor do we wish to
4048 * reduce the max loaded cpu below the average load, as either of these
4049 * actions would just result in more rebalancing later, and ping-pong
4050 * tasks around. Thus we look for the minimum possible imbalance.
4051 * Negative imbalances (*we* are more loaded than anyone else) will
4052 * be counted as no imbalance for these purposes -- we can't fix that
4053 * by pulling tasks to us. Be careful of negative numbers as they'll
4054 * appear as very large values with unsigned longs.
4056 if (sds.max_load <= sds.busiest_load_per_task)
4059 /* Looks like there is an imbalance. Compute it */
4060 calculate_imbalance(&sds, this_cpu, imbalance);
4065 * There is no obvious imbalance. But check if we can do some balancing
4068 if (check_power_save_busiest_group(&sds, this_cpu, imbalance))
4076 * find_busiest_queue - find the busiest runqueue among the cpus in group.
4079 find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle,
4080 unsigned long imbalance, const struct cpumask *cpus)
4082 struct rq *busiest = NULL, *rq;
4083 unsigned long max_load = 0;
4086 for_each_cpu(i, sched_group_cpus(group)) {
4087 unsigned long power = power_of(i);
4088 unsigned long capacity = DIV_ROUND_CLOSEST(power, SCHED_LOAD_SCALE);
4091 if (!cpumask_test_cpu(i, cpus))
4095 wl = weighted_cpuload(i) * SCHED_LOAD_SCALE;
4098 if (capacity && rq->nr_running == 1 && wl > imbalance)
4101 if (wl > max_load) {
4111 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
4112 * so long as it is large enough.
4114 #define MAX_PINNED_INTERVAL 512
4116 /* Working cpumask for load_balance and load_balance_newidle. */
4117 static DEFINE_PER_CPU(cpumask_var_t, load_balance_tmpmask);
4120 * Check this_cpu to ensure it is balanced within domain. Attempt to move
4121 * tasks if there is an imbalance.
4123 static int load_balance(int this_cpu, struct rq *this_rq,
4124 struct sched_domain *sd, enum cpu_idle_type idle,
4127 int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0;
4128 struct sched_group *group;
4129 unsigned long imbalance;
4131 unsigned long flags;
4132 struct cpumask *cpus = __get_cpu_var(load_balance_tmpmask);
4134 cpumask_copy(cpus, cpu_active_mask);
4137 * When power savings policy is enabled for the parent domain, idle
4138 * sibling can pick up load irrespective of busy siblings. In this case,
4139 * let the state of idle sibling percolate up as CPU_IDLE, instead of
4140 * portraying it as CPU_NOT_IDLE.
4142 if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER &&
4143 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4146 schedstat_inc(sd, lb_count[idle]);
4150 group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle,
4157 schedstat_inc(sd, lb_nobusyg[idle]);
4161 busiest = find_busiest_queue(group, idle, imbalance, cpus);
4163 schedstat_inc(sd, lb_nobusyq[idle]);
4167 BUG_ON(busiest == this_rq);
4169 schedstat_add(sd, lb_imbalance[idle], imbalance);
4172 if (busiest->nr_running > 1) {
4174 * Attempt to move tasks. If find_busiest_group has found
4175 * an imbalance but busiest->nr_running <= 1, the group is
4176 * still unbalanced. ld_moved simply stays zero, so it is
4177 * correctly treated as an imbalance.
4179 local_irq_save(flags);
4180 double_rq_lock(this_rq, busiest);
4181 ld_moved = move_tasks(this_rq, this_cpu, busiest,
4182 imbalance, sd, idle, &all_pinned);
4183 double_rq_unlock(this_rq, busiest);
4184 local_irq_restore(flags);
4187 * some other cpu did the load balance for us.
4189 if (ld_moved && this_cpu != smp_processor_id())
4190 resched_cpu(this_cpu);
4192 /* All tasks on this runqueue were pinned by CPU affinity */
4193 if (unlikely(all_pinned)) {
4194 cpumask_clear_cpu(cpu_of(busiest), cpus);
4195 if (!cpumask_empty(cpus))
4202 schedstat_inc(sd, lb_failed[idle]);
4203 sd->nr_balance_failed++;
4205 if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) {
4207 spin_lock_irqsave(&busiest->lock, flags);
4209 /* don't kick the migration_thread, if the curr
4210 * task on busiest cpu can't be moved to this_cpu
4212 if (!cpumask_test_cpu(this_cpu,
4213 &busiest->curr->cpus_allowed)) {
4214 spin_unlock_irqrestore(&busiest->lock, flags);
4216 goto out_one_pinned;
4219 if (!busiest->active_balance) {
4220 busiest->active_balance = 1;
4221 busiest->push_cpu = this_cpu;
4224 spin_unlock_irqrestore(&busiest->lock, flags);
4226 wake_up_process(busiest->migration_thread);
4229 * We've kicked active balancing, reset the failure
4232 sd->nr_balance_failed = sd->cache_nice_tries+1;
4235 sd->nr_balance_failed = 0;
4237 if (likely(!active_balance)) {
4238 /* We were unbalanced, so reset the balancing interval */
4239 sd->balance_interval = sd->min_interval;
4242 * If we've begun active balancing, start to back off. This
4243 * case may not be covered by the all_pinned logic if there
4244 * is only 1 task on the busy runqueue (because we don't call
4247 if (sd->balance_interval < sd->max_interval)
4248 sd->balance_interval *= 2;
4251 if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4252 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4258 schedstat_inc(sd, lb_balanced[idle]);
4260 sd->nr_balance_failed = 0;
4263 /* tune up the balancing interval */
4264 if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) ||
4265 (sd->balance_interval < sd->max_interval))
4266 sd->balance_interval *= 2;
4268 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4269 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4280 * Check this_cpu to ensure it is balanced within domain. Attempt to move
4281 * tasks if there is an imbalance.
4283 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
4284 * this_rq is locked.
4287 load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd)
4289 struct sched_group *group;
4290 struct rq *busiest = NULL;
4291 unsigned long imbalance;
4295 struct cpumask *cpus = __get_cpu_var(load_balance_tmpmask);
4297 cpumask_copy(cpus, cpu_active_mask);
4300 * When power savings policy is enabled for the parent domain, idle
4301 * sibling can pick up load irrespective of busy siblings. In this case,
4302 * let the state of idle sibling percolate up as IDLE, instead of
4303 * portraying it as CPU_NOT_IDLE.
4305 if (sd->flags & SD_SHARE_CPUPOWER &&
4306 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4309 schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]);
4311 update_shares_locked(this_rq, sd);
4312 group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE,
4313 &sd_idle, cpus, NULL);
4315 schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]);
4319 busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus);
4321 schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]);
4325 BUG_ON(busiest == this_rq);
4327 schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance);
4330 if (busiest->nr_running > 1) {
4331 /* Attempt to move tasks */
4332 double_lock_balance(this_rq, busiest);
4333 /* this_rq->clock is already updated */
4334 update_rq_clock(busiest);
4335 ld_moved = move_tasks(this_rq, this_cpu, busiest,
4336 imbalance, sd, CPU_NEWLY_IDLE,
4338 double_unlock_balance(this_rq, busiest);
4340 if (unlikely(all_pinned)) {
4341 cpumask_clear_cpu(cpu_of(busiest), cpus);
4342 if (!cpumask_empty(cpus))
4348 int active_balance = 0;
4350 schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]);
4351 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4352 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4355 if (sched_mc_power_savings < POWERSAVINGS_BALANCE_WAKEUP)
4358 if (sd->nr_balance_failed++ < 2)
4362 * The only task running in a non-idle cpu can be moved to this
4363 * cpu in an attempt to completely freeup the other CPU
4364 * package. The same method used to move task in load_balance()
4365 * have been extended for load_balance_newidle() to speedup
4366 * consolidation at sched_mc=POWERSAVINGS_BALANCE_WAKEUP (2)
4368 * The package power saving logic comes from
4369 * find_busiest_group(). If there are no imbalance, then
4370 * f_b_g() will return NULL. However when sched_mc={1,2} then
4371 * f_b_g() will select a group from which a running task may be
4372 * pulled to this cpu in order to make the other package idle.
4373 * If there is no opportunity to make a package idle and if
4374 * there are no imbalance, then f_b_g() will return NULL and no
4375 * action will be taken in load_balance_newidle().
4377 * Under normal task pull operation due to imbalance, there
4378 * will be more than one task in the source run queue and
4379 * move_tasks() will succeed. ld_moved will be true and this
4380 * active balance code will not be triggered.
4383 /* Lock busiest in correct order while this_rq is held */
4384 double_lock_balance(this_rq, busiest);
4387 * don't kick the migration_thread, if the curr
4388 * task on busiest cpu can't be moved to this_cpu
4390 if (!cpumask_test_cpu(this_cpu, &busiest->curr->cpus_allowed)) {
4391 double_unlock_balance(this_rq, busiest);
4396 if (!busiest->active_balance) {
4397 busiest->active_balance = 1;
4398 busiest->push_cpu = this_cpu;
4402 double_unlock_balance(this_rq, busiest);
4404 * Should not call ttwu while holding a rq->lock
4406 spin_unlock(&this_rq->lock);
4408 wake_up_process(busiest->migration_thread);
4409 spin_lock(&this_rq->lock);
4412 sd->nr_balance_failed = 0;
4414 update_shares_locked(this_rq, sd);
4418 schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]);
4419 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4420 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4422 sd->nr_balance_failed = 0;
4428 * idle_balance is called by schedule() if this_cpu is about to become
4429 * idle. Attempts to pull tasks from other CPUs.
4431 static void idle_balance(int this_cpu, struct rq *this_rq)
4433 struct sched_domain *sd;
4434 int pulled_task = 0;
4435 unsigned long next_balance = jiffies + HZ;
4437 this_rq->idle_stamp = this_rq->clock;
4439 if (this_rq->avg_idle < sysctl_sched_migration_cost)
4442 for_each_domain(this_cpu, sd) {
4443 unsigned long interval;
4445 if (!(sd->flags & SD_LOAD_BALANCE))
4448 if (sd->flags & SD_BALANCE_NEWIDLE)
4449 /* If we've pulled tasks over stop searching: */
4450 pulled_task = load_balance_newidle(this_cpu, this_rq,
4453 interval = msecs_to_jiffies(sd->balance_interval);
4454 if (time_after(next_balance, sd->last_balance + interval))
4455 next_balance = sd->last_balance + interval;
4457 this_rq->idle_stamp = 0;
4461 if (pulled_task || time_after(jiffies, this_rq->next_balance)) {
4463 * We are going idle. next_balance may be set based on
4464 * a busy processor. So reset next_balance.
4466 this_rq->next_balance = next_balance;
4471 * active_load_balance is run by migration threads. It pushes running tasks
4472 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
4473 * running on each physical CPU where possible, and avoids physical /
4474 * logical imbalances.
4476 * Called with busiest_rq locked.
4478 static void active_load_balance(struct rq *busiest_rq, int busiest_cpu)
4480 int target_cpu = busiest_rq->push_cpu;
4481 struct sched_domain *sd;
4482 struct rq *target_rq;
4484 /* Is there any task to move? */
4485 if (busiest_rq->nr_running <= 1)
4488 target_rq = cpu_rq(target_cpu);
4491 * This condition is "impossible", if it occurs
4492 * we need to fix it. Originally reported by
4493 * Bjorn Helgaas on a 128-cpu setup.
4495 BUG_ON(busiest_rq == target_rq);
4497 /* move a task from busiest_rq to target_rq */
4498 double_lock_balance(busiest_rq, target_rq);
4499 update_rq_clock(busiest_rq);
4500 update_rq_clock(target_rq);
4502 /* Search for an sd spanning us and the target CPU. */
4503 for_each_domain(target_cpu, sd) {
4504 if ((sd->flags & SD_LOAD_BALANCE) &&
4505 cpumask_test_cpu(busiest_cpu, sched_domain_span(sd)))
4510 schedstat_inc(sd, alb_count);
4512 if (move_one_task(target_rq, target_cpu, busiest_rq,
4514 schedstat_inc(sd, alb_pushed);
4516 schedstat_inc(sd, alb_failed);
4518 double_unlock_balance(busiest_rq, target_rq);
4523 atomic_t load_balancer;
4524 cpumask_var_t cpu_mask;
4525 cpumask_var_t ilb_grp_nohz_mask;
4526 } nohz ____cacheline_aligned = {
4527 .load_balancer = ATOMIC_INIT(-1),
4530 int get_nohz_load_balancer(void)
4532 return atomic_read(&nohz.load_balancer);
4535 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
4537 * lowest_flag_domain - Return lowest sched_domain containing flag.
4538 * @cpu: The cpu whose lowest level of sched domain is to
4540 * @flag: The flag to check for the lowest sched_domain
4541 * for the given cpu.
4543 * Returns the lowest sched_domain of a cpu which contains the given flag.
4545 static inline struct sched_domain *lowest_flag_domain(int cpu, int flag)
4547 struct sched_domain *sd;
4549 for_each_domain(cpu, sd)
4550 if (sd && (sd->flags & flag))
4557 * for_each_flag_domain - Iterates over sched_domains containing the flag.
4558 * @cpu: The cpu whose domains we're iterating over.
4559 * @sd: variable holding the value of the power_savings_sd
4561 * @flag: The flag to filter the sched_domains to be iterated.
4563 * Iterates over all the scheduler domains for a given cpu that has the 'flag'
4564 * set, starting from the lowest sched_domain to the highest.
4566 #define for_each_flag_domain(cpu, sd, flag) \
4567 for (sd = lowest_flag_domain(cpu, flag); \
4568 (sd && (sd->flags & flag)); sd = sd->parent)
4571 * is_semi_idle_group - Checks if the given sched_group is semi-idle.
4572 * @ilb_group: group to be checked for semi-idleness
4574 * Returns: 1 if the group is semi-idle. 0 otherwise.
4576 * We define a sched_group to be semi idle if it has atleast one idle-CPU
4577 * and atleast one non-idle CPU. This helper function checks if the given
4578 * sched_group is semi-idle or not.
4580 static inline int is_semi_idle_group(struct sched_group *ilb_group)
4582 cpumask_and(nohz.ilb_grp_nohz_mask, nohz.cpu_mask,
4583 sched_group_cpus(ilb_group));
4586 * A sched_group is semi-idle when it has atleast one busy cpu
4587 * and atleast one idle cpu.
4589 if (cpumask_empty(nohz.ilb_grp_nohz_mask))
4592 if (cpumask_equal(nohz.ilb_grp_nohz_mask, sched_group_cpus(ilb_group)))
4598 * find_new_ilb - Finds the optimum idle load balancer for nomination.
4599 * @cpu: The cpu which is nominating a new idle_load_balancer.
4601 * Returns: Returns the id of the idle load balancer if it exists,
4602 * Else, returns >= nr_cpu_ids.
4604 * This algorithm picks the idle load balancer such that it belongs to a
4605 * semi-idle powersavings sched_domain. The idea is to try and avoid
4606 * completely idle packages/cores just for the purpose of idle load balancing
4607 * when there are other idle cpu's which are better suited for that job.
4609 static int find_new_ilb(int cpu)
4611 struct sched_domain *sd;
4612 struct sched_group *ilb_group;
4615 * Have idle load balancer selection from semi-idle packages only
4616 * when power-aware load balancing is enabled
4618 if (!(sched_smt_power_savings || sched_mc_power_savings))
4622 * Optimize for the case when we have no idle CPUs or only one
4623 * idle CPU. Don't walk the sched_domain hierarchy in such cases
4625 if (cpumask_weight(nohz.cpu_mask) < 2)
4628 for_each_flag_domain(cpu, sd, SD_POWERSAVINGS_BALANCE) {
4629 ilb_group = sd->groups;
4632 if (is_semi_idle_group(ilb_group))
4633 return cpumask_first(nohz.ilb_grp_nohz_mask);
4635 ilb_group = ilb_group->next;
4637 } while (ilb_group != sd->groups);
4641 return cpumask_first(nohz.cpu_mask);
4643 #else /* (CONFIG_SCHED_MC || CONFIG_SCHED_SMT) */
4644 static inline int find_new_ilb(int call_cpu)
4646 return cpumask_first(nohz.cpu_mask);
4651 * This routine will try to nominate the ilb (idle load balancing)
4652 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
4653 * load balancing on behalf of all those cpus. If all the cpus in the system
4654 * go into this tickless mode, then there will be no ilb owner (as there is
4655 * no need for one) and all the cpus will sleep till the next wakeup event
4658 * For the ilb owner, tick is not stopped. And this tick will be used
4659 * for idle load balancing. ilb owner will still be part of
4662 * While stopping the tick, this cpu will become the ilb owner if there
4663 * is no other owner. And will be the owner till that cpu becomes busy
4664 * or if all cpus in the system stop their ticks at which point
4665 * there is no need for ilb owner.
4667 * When the ilb owner becomes busy, it nominates another owner, during the
4668 * next busy scheduler_tick()
4670 int select_nohz_load_balancer(int stop_tick)
4672 int cpu = smp_processor_id();
4675 cpu_rq(cpu)->in_nohz_recently = 1;
4677 if (!cpu_active(cpu)) {
4678 if (atomic_read(&nohz.load_balancer) != cpu)
4682 * If we are going offline and still the leader,
4685 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4691 cpumask_set_cpu(cpu, nohz.cpu_mask);
4693 /* time for ilb owner also to sleep */
4694 if (cpumask_weight(nohz.cpu_mask) == num_active_cpus()) {
4695 if (atomic_read(&nohz.load_balancer) == cpu)
4696 atomic_set(&nohz.load_balancer, -1);
4700 if (atomic_read(&nohz.load_balancer) == -1) {
4701 /* make me the ilb owner */
4702 if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1)
4704 } else if (atomic_read(&nohz.load_balancer) == cpu) {
4707 if (!(sched_smt_power_savings ||
4708 sched_mc_power_savings))
4711 * Check to see if there is a more power-efficient
4714 new_ilb = find_new_ilb(cpu);
4715 if (new_ilb < nr_cpu_ids && new_ilb != cpu) {
4716 atomic_set(&nohz.load_balancer, -1);
4717 resched_cpu(new_ilb);
4723 if (!cpumask_test_cpu(cpu, nohz.cpu_mask))
4726 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4728 if (atomic_read(&nohz.load_balancer) == cpu)
4729 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4736 static DEFINE_SPINLOCK(balancing);
4739 * It checks each scheduling domain to see if it is due to be balanced,
4740 * and initiates a balancing operation if so.
4742 * Balancing parameters are set up in arch_init_sched_domains.
4744 static void rebalance_domains(int cpu, enum cpu_idle_type idle)
4747 struct rq *rq = cpu_rq(cpu);
4748 unsigned long interval;
4749 struct sched_domain *sd;
4750 /* Earliest time when we have to do rebalance again */
4751 unsigned long next_balance = jiffies + 60*HZ;
4752 int update_next_balance = 0;
4755 for_each_domain(cpu, sd) {
4756 if (!(sd->flags & SD_LOAD_BALANCE))
4759 interval = sd->balance_interval;
4760 if (idle != CPU_IDLE)
4761 interval *= sd->busy_factor;
4763 /* scale ms to jiffies */
4764 interval = msecs_to_jiffies(interval);
4765 if (unlikely(!interval))
4767 if (interval > HZ*NR_CPUS/10)
4768 interval = HZ*NR_CPUS/10;
4770 need_serialize = sd->flags & SD_SERIALIZE;
4772 if (need_serialize) {
4773 if (!spin_trylock(&balancing))
4777 if (time_after_eq(jiffies, sd->last_balance + interval)) {
4778 if (load_balance(cpu, rq, sd, idle, &balance)) {
4780 * We've pulled tasks over so either we're no
4781 * longer idle, or one of our SMT siblings is
4784 idle = CPU_NOT_IDLE;
4786 sd->last_balance = jiffies;
4789 spin_unlock(&balancing);
4791 if (time_after(next_balance, sd->last_balance + interval)) {
4792 next_balance = sd->last_balance + interval;
4793 update_next_balance = 1;
4797 * Stop the load balance at this level. There is another
4798 * CPU in our sched group which is doing load balancing more
4806 * next_balance will be updated only when there is a need.
4807 * When the cpu is attached to null domain for ex, it will not be
4810 if (likely(update_next_balance))
4811 rq->next_balance = next_balance;
4815 * run_rebalance_domains is triggered when needed from the scheduler tick.
4816 * In CONFIG_NO_HZ case, the idle load balance owner will do the
4817 * rebalancing for all the cpus for whom scheduler ticks are stopped.
4819 static void run_rebalance_domains(struct softirq_action *h)
4821 int this_cpu = smp_processor_id();
4822 struct rq *this_rq = cpu_rq(this_cpu);
4823 enum cpu_idle_type idle = this_rq->idle_at_tick ?
4824 CPU_IDLE : CPU_NOT_IDLE;
4826 rebalance_domains(this_cpu, idle);
4830 * If this cpu is the owner for idle load balancing, then do the
4831 * balancing on behalf of the other idle cpus whose ticks are
4834 if (this_rq->idle_at_tick &&
4835 atomic_read(&nohz.load_balancer) == this_cpu) {
4839 for_each_cpu(balance_cpu, nohz.cpu_mask) {
4840 if (balance_cpu == this_cpu)
4844 * If this cpu gets work to do, stop the load balancing
4845 * work being done for other cpus. Next load
4846 * balancing owner will pick it up.
4851 rebalance_domains(balance_cpu, CPU_IDLE);
4853 rq = cpu_rq(balance_cpu);
4854 if (time_after(this_rq->next_balance, rq->next_balance))
4855 this_rq->next_balance = rq->next_balance;
4861 static inline int on_null_domain(int cpu)
4863 return !rcu_dereference(cpu_rq(cpu)->sd);
4867 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
4869 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
4870 * idle load balancing owner or decide to stop the periodic load balancing,
4871 * if the whole system is idle.
4873 static inline void trigger_load_balance(struct rq *rq, int cpu)
4877 * If we were in the nohz mode recently and busy at the current
4878 * scheduler tick, then check if we need to nominate new idle
4881 if (rq->in_nohz_recently && !rq->idle_at_tick) {
4882 rq->in_nohz_recently = 0;
4884 if (atomic_read(&nohz.load_balancer) == cpu) {
4885 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4886 atomic_set(&nohz.load_balancer, -1);
4889 if (atomic_read(&nohz.load_balancer) == -1) {
4890 int ilb = find_new_ilb(cpu);
4892 if (ilb < nr_cpu_ids)
4898 * If this cpu is idle and doing idle load balancing for all the
4899 * cpus with ticks stopped, is it time for that to stop?
4901 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu &&
4902 cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
4908 * If this cpu is idle and the idle load balancing is done by
4909 * someone else, then no need raise the SCHED_SOFTIRQ
4911 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu &&
4912 cpumask_test_cpu(cpu, nohz.cpu_mask))
4915 /* Don't need to rebalance while attached to NULL domain */
4916 if (time_after_eq(jiffies, rq->next_balance) &&
4917 likely(!on_null_domain(cpu)))
4918 raise_softirq(SCHED_SOFTIRQ);
4921 #else /* CONFIG_SMP */
4924 * on UP we do not need to balance between CPUs:
4926 static inline void idle_balance(int cpu, struct rq *rq)
4932 DEFINE_PER_CPU(struct kernel_stat, kstat);
4934 EXPORT_PER_CPU_SYMBOL(kstat);
4937 * Return any ns on the sched_clock that have not yet been accounted in
4938 * @p in case that task is currently running.
4940 * Called with task_rq_lock() held on @rq.
4942 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
4946 if (task_current(rq, p)) {
4947 update_rq_clock(rq);
4948 ns = rq->clock - p->se.exec_start;
4956 unsigned long long task_delta_exec(struct task_struct *p)
4958 unsigned long flags;
4962 rq = task_rq_lock(p, &flags);
4963 ns = do_task_delta_exec(p, rq);
4964 task_rq_unlock(rq, &flags);
4970 * Return accounted runtime for the task.
4971 * In case the task is currently running, return the runtime plus current's
4972 * pending runtime that have not been accounted yet.
4974 unsigned long long task_sched_runtime(struct task_struct *p)
4976 unsigned long flags;
4980 rq = task_rq_lock(p, &flags);
4981 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
4982 task_rq_unlock(rq, &flags);
4988 * Return sum_exec_runtime for the thread group.
4989 * In case the task is currently running, return the sum plus current's
4990 * pending runtime that have not been accounted yet.
4992 * Note that the thread group might have other running tasks as well,
4993 * so the return value not includes other pending runtime that other
4994 * running tasks might have.
4996 unsigned long long thread_group_sched_runtime(struct task_struct *p)
4998 struct task_cputime totals;
4999 unsigned long flags;
5003 rq = task_rq_lock(p, &flags);
5004 thread_group_cputime(p, &totals);
5005 ns = totals.sum_exec_runtime + do_task_delta_exec(p, rq);
5006 task_rq_unlock(rq, &flags);
5012 * Account user cpu time to a process.
5013 * @p: the process that the cpu time gets accounted to
5014 * @cputime: the cpu time spent in user space since the last update
5015 * @cputime_scaled: cputime scaled by cpu frequency
5017 void account_user_time(struct task_struct *p, cputime_t cputime,
5018 cputime_t cputime_scaled)
5020 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5023 /* Add user time to process. */
5024 p->utime = cputime_add(p->utime, cputime);
5025 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
5026 account_group_user_time(p, cputime);
5028 /* Add user time to cpustat. */
5029 tmp = cputime_to_cputime64(cputime);
5030 if (TASK_NICE(p) > 0)
5031 cpustat->nice = cputime64_add(cpustat->nice, tmp);
5033 cpustat->user = cputime64_add(cpustat->user, tmp);
5035 cpuacct_update_stats(p, CPUACCT_STAT_USER, cputime);
5036 /* Account for user time used */
5037 acct_update_integrals(p);
5041 * Account guest cpu time to a process.
5042 * @p: the process that the cpu time gets accounted to
5043 * @cputime: the cpu time spent in virtual machine since the last update
5044 * @cputime_scaled: cputime scaled by cpu frequency
5046 static void account_guest_time(struct task_struct *p, cputime_t cputime,
5047 cputime_t cputime_scaled)
5050 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5052 tmp = cputime_to_cputime64(cputime);
5054 /* Add guest time to process. */
5055 p->utime = cputime_add(p->utime, cputime);
5056 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
5057 account_group_user_time(p, cputime);
5058 p->gtime = cputime_add(p->gtime, cputime);
5060 /* Add guest time to cpustat. */
5061 if (TASK_NICE(p) > 0) {
5062 cpustat->nice = cputime64_add(cpustat->nice, tmp);
5063 cpustat->guest_nice = cputime64_add(cpustat->guest_nice, tmp);
5065 cpustat->user = cputime64_add(cpustat->user, tmp);
5066 cpustat->guest = cputime64_add(cpustat->guest, tmp);
5071 * Account system cpu time to a process.
5072 * @p: the process that the cpu time gets accounted to
5073 * @hardirq_offset: the offset to subtract from hardirq_count()
5074 * @cputime: the cpu time spent in kernel space since the last update
5075 * @cputime_scaled: cputime scaled by cpu frequency
5077 void account_system_time(struct task_struct *p, int hardirq_offset,
5078 cputime_t cputime, cputime_t cputime_scaled)
5080 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5083 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
5084 account_guest_time(p, cputime, cputime_scaled);
5088 /* Add system time to process. */
5089 p->stime = cputime_add(p->stime, cputime);
5090 p->stimescaled = cputime_add(p->stimescaled, cputime_scaled);
5091 account_group_system_time(p, cputime);
5093 /* Add system time to cpustat. */
5094 tmp = cputime_to_cputime64(cputime);
5095 if (hardirq_count() - hardirq_offset)
5096 cpustat->irq = cputime64_add(cpustat->irq, tmp);
5097 else if (softirq_count())
5098 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
5100 cpustat->system = cputime64_add(cpustat->system, tmp);
5102 cpuacct_update_stats(p, CPUACCT_STAT_SYSTEM, cputime);
5104 /* Account for system time used */
5105 acct_update_integrals(p);
5109 * Account for involuntary wait time.
5110 * @steal: the cpu time spent in involuntary wait
5112 void account_steal_time(cputime_t cputime)
5114 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5115 cputime64_t cputime64 = cputime_to_cputime64(cputime);
5117 cpustat->steal = cputime64_add(cpustat->steal, cputime64);
5121 * Account for idle time.
5122 * @cputime: the cpu time spent in idle wait
5124 void account_idle_time(cputime_t cputime)
5126 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5127 cputime64_t cputime64 = cputime_to_cputime64(cputime);
5128 struct rq *rq = this_rq();
5130 if (atomic_read(&rq->nr_iowait) > 0)
5131 cpustat->iowait = cputime64_add(cpustat->iowait, cputime64);
5133 cpustat->idle = cputime64_add(cpustat->idle, cputime64);
5136 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
5139 * Account a single tick of cpu time.
5140 * @p: the process that the cpu time gets accounted to
5141 * @user_tick: indicates if the tick is a user or a system tick
5143 void account_process_tick(struct task_struct *p, int user_tick)
5145 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
5146 struct rq *rq = this_rq();
5149 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
5150 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
5151 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
5154 account_idle_time(cputime_one_jiffy);
5158 * Account multiple ticks of steal time.
5159 * @p: the process from which the cpu time has been stolen
5160 * @ticks: number of stolen ticks
5162 void account_steal_ticks(unsigned long ticks)
5164 account_steal_time(jiffies_to_cputime(ticks));
5168 * Account multiple ticks of idle time.
5169 * @ticks: number of stolen ticks
5171 void account_idle_ticks(unsigned long ticks)
5173 account_idle_time(jiffies_to_cputime(ticks));
5179 * Use precise platform statistics if available:
5181 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
5182 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5188 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5190 struct task_cputime cputime;
5192 thread_group_cputime(p, &cputime);
5194 *ut = cputime.utime;
5195 *st = cputime.stime;
5199 #ifndef nsecs_to_cputime
5200 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
5203 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5205 cputime_t rtime, utime = p->utime, total = cputime_add(utime, p->stime);
5208 * Use CFS's precise accounting:
5210 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
5215 temp = (u64)(rtime * utime);
5216 do_div(temp, total);
5217 utime = (cputime_t)temp;
5222 * Compare with previous values, to keep monotonicity:
5224 p->prev_utime = max(p->prev_utime, utime);
5225 p->prev_stime = max(p->prev_stime, cputime_sub(rtime, p->prev_utime));
5227 *ut = p->prev_utime;
5228 *st = p->prev_stime;
5232 * Must be called with siglock held.
5234 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5236 struct signal_struct *sig = p->signal;
5237 struct task_cputime cputime;
5238 cputime_t rtime, utime, total;
5240 thread_group_cputime(p, &cputime);
5242 total = cputime_add(cputime.utime, cputime.stime);
5243 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
5248 temp = (u64)(rtime * cputime.utime);
5249 do_div(temp, total);
5250 utime = (cputime_t)temp;
5254 sig->prev_utime = max(sig->prev_utime, utime);
5255 sig->prev_stime = max(sig->prev_stime,
5256 cputime_sub(rtime, sig->prev_utime));
5258 *ut = sig->prev_utime;
5259 *st = sig->prev_stime;
5264 * This function gets called by the timer code, with HZ frequency.
5265 * We call it with interrupts disabled.
5267 * It also gets called by the fork code, when changing the parent's
5270 void scheduler_tick(void)
5272 int cpu = smp_processor_id();
5273 struct rq *rq = cpu_rq(cpu);
5274 struct task_struct *curr = rq->curr;
5278 spin_lock(&rq->lock);
5279 update_rq_clock(rq);
5280 update_cpu_load(rq);
5281 curr->sched_class->task_tick(rq, curr, 0);
5282 spin_unlock(&rq->lock);
5284 perf_event_task_tick(curr, cpu);
5287 rq->idle_at_tick = idle_cpu(cpu);
5288 trigger_load_balance(rq, cpu);
5292 notrace unsigned long get_parent_ip(unsigned long addr)
5294 if (in_lock_functions(addr)) {
5295 addr = CALLER_ADDR2;
5296 if (in_lock_functions(addr))
5297 addr = CALLER_ADDR3;
5302 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
5303 defined(CONFIG_PREEMPT_TRACER))
5305 void __kprobes add_preempt_count(int val)
5307 #ifdef CONFIG_DEBUG_PREEMPT
5311 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
5314 preempt_count() += val;
5315 #ifdef CONFIG_DEBUG_PREEMPT
5317 * Spinlock count overflowing soon?
5319 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
5322 if (preempt_count() == val)
5323 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
5325 EXPORT_SYMBOL(add_preempt_count);
5327 void __kprobes sub_preempt_count(int val)
5329 #ifdef CONFIG_DEBUG_PREEMPT
5333 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
5336 * Is the spinlock portion underflowing?
5338 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
5339 !(preempt_count() & PREEMPT_MASK)))
5343 if (preempt_count() == val)
5344 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
5345 preempt_count() -= val;
5347 EXPORT_SYMBOL(sub_preempt_count);
5352 * Print scheduling while atomic bug:
5354 static noinline void __schedule_bug(struct task_struct *prev)
5356 struct pt_regs *regs = get_irq_regs();
5358 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
5359 prev->comm, prev->pid, preempt_count());
5361 debug_show_held_locks(prev);
5363 if (irqs_disabled())
5364 print_irqtrace_events(prev);
5373 * Various schedule()-time debugging checks and statistics:
5375 static inline void schedule_debug(struct task_struct *prev)
5378 * Test if we are atomic. Since do_exit() needs to call into
5379 * schedule() atomically, we ignore that path for now.
5380 * Otherwise, whine if we are scheduling when we should not be.
5382 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
5383 __schedule_bug(prev);
5385 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
5387 schedstat_inc(this_rq(), sched_count);
5388 #ifdef CONFIG_SCHEDSTATS
5389 if (unlikely(prev->lock_depth >= 0)) {
5390 schedstat_inc(this_rq(), bkl_count);
5391 schedstat_inc(prev, sched_info.bkl_count);
5396 static void put_prev_task(struct rq *rq, struct task_struct *p)
5398 u64 runtime = p->se.sum_exec_runtime - p->se.prev_sum_exec_runtime;
5400 update_avg(&p->se.avg_running, runtime);
5402 if (p->state == TASK_RUNNING) {
5404 * In order to avoid avg_overlap growing stale when we are
5405 * indeed overlapping and hence not getting put to sleep, grow
5406 * the avg_overlap on preemption.
5408 * We use the average preemption runtime because that
5409 * correlates to the amount of cache footprint a task can
5412 runtime = min_t(u64, runtime, 2*sysctl_sched_migration_cost);
5413 update_avg(&p->se.avg_overlap, runtime);
5415 update_avg(&p->se.avg_running, 0);
5417 p->sched_class->put_prev_task(rq, p);
5421 * Pick up the highest-prio task:
5423 static inline struct task_struct *
5424 pick_next_task(struct rq *rq)
5426 const struct sched_class *class;
5427 struct task_struct *p;
5430 * Optimization: we know that if all tasks are in
5431 * the fair class we can call that function directly:
5433 if (likely(rq->nr_running == rq->cfs.nr_running)) {
5434 p = fair_sched_class.pick_next_task(rq);
5439 class = sched_class_highest;
5441 p = class->pick_next_task(rq);
5445 * Will never be NULL as the idle class always
5446 * returns a non-NULL p:
5448 class = class->next;
5453 * schedule() is the main scheduler function.
5455 asmlinkage void __sched schedule(void)
5457 struct task_struct *prev, *next;
5458 unsigned long *switch_count;
5464 cpu = smp_processor_id();
5468 switch_count = &prev->nivcsw;
5470 release_kernel_lock(prev);
5471 need_resched_nonpreemptible:
5473 schedule_debug(prev);
5475 if (sched_feat(HRTICK))
5478 spin_lock_irq(&rq->lock);
5479 update_rq_clock(rq);
5480 clear_tsk_need_resched(prev);
5482 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
5483 if (unlikely(signal_pending_state(prev->state, prev)))
5484 prev->state = TASK_RUNNING;
5486 deactivate_task(rq, prev, 1);
5487 switch_count = &prev->nvcsw;
5490 pre_schedule(rq, prev);
5492 if (unlikely(!rq->nr_running))
5493 idle_balance(cpu, rq);
5495 put_prev_task(rq, prev);
5496 next = pick_next_task(rq);
5498 if (likely(prev != next)) {
5499 sched_info_switch(prev, next);
5500 perf_event_task_sched_out(prev, next, cpu);
5506 context_switch(rq, prev, next); /* unlocks the rq */
5508 * the context switch might have flipped the stack from under
5509 * us, hence refresh the local variables.
5511 cpu = smp_processor_id();
5514 spin_unlock_irq(&rq->lock);
5518 if (unlikely(reacquire_kernel_lock(current) < 0))
5519 goto need_resched_nonpreemptible;
5521 preempt_enable_no_resched();
5525 EXPORT_SYMBOL(schedule);
5527 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
5529 * Look out! "owner" is an entirely speculative pointer
5530 * access and not reliable.
5532 int mutex_spin_on_owner(struct mutex *lock, struct thread_info *owner)
5537 if (!sched_feat(OWNER_SPIN))
5540 #ifdef CONFIG_DEBUG_PAGEALLOC
5542 * Need to access the cpu field knowing that
5543 * DEBUG_PAGEALLOC could have unmapped it if
5544 * the mutex owner just released it and exited.
5546 if (probe_kernel_address(&owner->cpu, cpu))
5553 * Even if the access succeeded (likely case),
5554 * the cpu field may no longer be valid.
5556 if (cpu >= nr_cpumask_bits)
5560 * We need to validate that we can do a
5561 * get_cpu() and that we have the percpu area.
5563 if (!cpu_online(cpu))
5570 * Owner changed, break to re-assess state.
5572 if (lock->owner != owner)
5576 * Is that owner really running on that cpu?
5578 if (task_thread_info(rq->curr) != owner || need_resched())
5588 #ifdef CONFIG_PREEMPT
5590 * this is the entry point to schedule() from in-kernel preemption
5591 * off of preempt_enable. Kernel preemptions off return from interrupt
5592 * occur there and call schedule directly.
5594 asmlinkage void __sched preempt_schedule(void)
5596 struct thread_info *ti = current_thread_info();
5599 * If there is a non-zero preempt_count or interrupts are disabled,
5600 * we do not want to preempt the current task. Just return..
5602 if (likely(ti->preempt_count || irqs_disabled()))
5606 add_preempt_count(PREEMPT_ACTIVE);
5608 sub_preempt_count(PREEMPT_ACTIVE);
5611 * Check again in case we missed a preemption opportunity
5612 * between schedule and now.
5615 } while (need_resched());
5617 EXPORT_SYMBOL(preempt_schedule);
5620 * this is the entry point to schedule() from kernel preemption
5621 * off of irq context.
5622 * Note, that this is called and return with irqs disabled. This will
5623 * protect us against recursive calling from irq.
5625 asmlinkage void __sched preempt_schedule_irq(void)
5627 struct thread_info *ti = current_thread_info();
5629 /* Catch callers which need to be fixed */
5630 BUG_ON(ti->preempt_count || !irqs_disabled());
5633 add_preempt_count(PREEMPT_ACTIVE);
5636 local_irq_disable();
5637 sub_preempt_count(PREEMPT_ACTIVE);
5640 * Check again in case we missed a preemption opportunity
5641 * between schedule and now.
5644 } while (need_resched());
5647 #endif /* CONFIG_PREEMPT */
5649 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
5652 return try_to_wake_up(curr->private, mode, wake_flags);
5654 EXPORT_SYMBOL(default_wake_function);
5657 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
5658 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
5659 * number) then we wake all the non-exclusive tasks and one exclusive task.
5661 * There are circumstances in which we can try to wake a task which has already
5662 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
5663 * zero in this (rare) case, and we handle it by continuing to scan the queue.
5665 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
5666 int nr_exclusive, int wake_flags, void *key)
5668 wait_queue_t *curr, *next;
5670 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
5671 unsigned flags = curr->flags;
5673 if (curr->func(curr, mode, wake_flags, key) &&
5674 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
5680 * __wake_up - wake up threads blocked on a waitqueue.
5682 * @mode: which threads
5683 * @nr_exclusive: how many wake-one or wake-many threads to wake up
5684 * @key: is directly passed to the wakeup function
5686 * It may be assumed that this function implies a write memory barrier before
5687 * changing the task state if and only if any tasks are woken up.
5689 void __wake_up(wait_queue_head_t *q, unsigned int mode,
5690 int nr_exclusive, void *key)
5692 unsigned long flags;
5694 spin_lock_irqsave(&q->lock, flags);
5695 __wake_up_common(q, mode, nr_exclusive, 0, key);
5696 spin_unlock_irqrestore(&q->lock, flags);
5698 EXPORT_SYMBOL(__wake_up);
5701 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
5703 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
5705 __wake_up_common(q, mode, 1, 0, NULL);
5708 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
5710 __wake_up_common(q, mode, 1, 0, key);
5714 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
5716 * @mode: which threads
5717 * @nr_exclusive: how many wake-one or wake-many threads to wake up
5718 * @key: opaque value to be passed to wakeup targets
5720 * The sync wakeup differs that the waker knows that it will schedule
5721 * away soon, so while the target thread will be woken up, it will not
5722 * be migrated to another CPU - ie. the two threads are 'synchronized'
5723 * with each other. This can prevent needless bouncing between CPUs.
5725 * On UP it can prevent extra preemption.
5727 * It may be assumed that this function implies a write memory barrier before
5728 * changing the task state if and only if any tasks are woken up.
5730 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
5731 int nr_exclusive, void *key)
5733 unsigned long flags;
5734 int wake_flags = WF_SYNC;
5739 if (unlikely(!nr_exclusive))
5742 spin_lock_irqsave(&q->lock, flags);
5743 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
5744 spin_unlock_irqrestore(&q->lock, flags);
5746 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
5749 * __wake_up_sync - see __wake_up_sync_key()
5751 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
5753 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
5755 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
5758 * complete: - signals a single thread waiting on this completion
5759 * @x: holds the state of this particular completion
5761 * This will wake up a single thread waiting on this completion. Threads will be
5762 * awakened in the same order in which they were queued.
5764 * See also complete_all(), wait_for_completion() and related routines.
5766 * It may be assumed that this function implies a write memory barrier before
5767 * changing the task state if and only if any tasks are woken up.
5769 void complete(struct completion *x)
5771 unsigned long flags;
5773 spin_lock_irqsave(&x->wait.lock, flags);
5775 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
5776 spin_unlock_irqrestore(&x->wait.lock, flags);
5778 EXPORT_SYMBOL(complete);
5781 * complete_all: - signals all threads waiting on this completion
5782 * @x: holds the state of this particular completion
5784 * This will wake up all threads waiting on this particular completion event.
5786 * It may be assumed that this function implies a write memory barrier before
5787 * changing the task state if and only if any tasks are woken up.
5789 void complete_all(struct completion *x)
5791 unsigned long flags;
5793 spin_lock_irqsave(&x->wait.lock, flags);
5794 x->done += UINT_MAX/2;
5795 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
5796 spin_unlock_irqrestore(&x->wait.lock, flags);
5798 EXPORT_SYMBOL(complete_all);
5800 static inline long __sched
5801 do_wait_for_common(struct completion *x, long timeout, int state)
5804 DECLARE_WAITQUEUE(wait, current);
5806 wait.flags |= WQ_FLAG_EXCLUSIVE;
5807 __add_wait_queue_tail(&x->wait, &wait);
5809 if (signal_pending_state(state, current)) {
5810 timeout = -ERESTARTSYS;
5813 __set_current_state(state);
5814 spin_unlock_irq(&x->wait.lock);
5815 timeout = schedule_timeout(timeout);
5816 spin_lock_irq(&x->wait.lock);
5817 } while (!x->done && timeout);
5818 __remove_wait_queue(&x->wait, &wait);
5823 return timeout ?: 1;
5827 wait_for_common(struct completion *x, long timeout, int state)
5831 spin_lock_irq(&x->wait.lock);
5832 timeout = do_wait_for_common(x, timeout, state);
5833 spin_unlock_irq(&x->wait.lock);
5838 * wait_for_completion: - waits for completion of a task
5839 * @x: holds the state of this particular completion
5841 * This waits to be signaled for completion of a specific task. It is NOT
5842 * interruptible and there is no timeout.
5844 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
5845 * and interrupt capability. Also see complete().
5847 void __sched wait_for_completion(struct completion *x)
5849 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
5851 EXPORT_SYMBOL(wait_for_completion);
5854 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
5855 * @x: holds the state of this particular completion
5856 * @timeout: timeout value in jiffies
5858 * This waits for either a completion of a specific task to be signaled or for a
5859 * specified timeout to expire. The timeout is in jiffies. It is not
5862 unsigned long __sched
5863 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
5865 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
5867 EXPORT_SYMBOL(wait_for_completion_timeout);
5870 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
5871 * @x: holds the state of this particular completion
5873 * This waits for completion of a specific task to be signaled. It is
5876 int __sched wait_for_completion_interruptible(struct completion *x)
5878 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
5879 if (t == -ERESTARTSYS)
5883 EXPORT_SYMBOL(wait_for_completion_interruptible);
5886 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
5887 * @x: holds the state of this particular completion
5888 * @timeout: timeout value in jiffies
5890 * This waits for either a completion of a specific task to be signaled or for a
5891 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
5893 unsigned long __sched
5894 wait_for_completion_interruptible_timeout(struct completion *x,
5895 unsigned long timeout)
5897 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
5899 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
5902 * wait_for_completion_killable: - waits for completion of a task (killable)
5903 * @x: holds the state of this particular completion
5905 * This waits to be signaled for completion of a specific task. It can be
5906 * interrupted by a kill signal.
5908 int __sched wait_for_completion_killable(struct completion *x)
5910 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
5911 if (t == -ERESTARTSYS)
5915 EXPORT_SYMBOL(wait_for_completion_killable);
5918 * try_wait_for_completion - try to decrement a completion without blocking
5919 * @x: completion structure
5921 * Returns: 0 if a decrement cannot be done without blocking
5922 * 1 if a decrement succeeded.
5924 * If a completion is being used as a counting completion,
5925 * attempt to decrement the counter without blocking. This
5926 * enables us to avoid waiting if the resource the completion
5927 * is protecting is not available.
5929 bool try_wait_for_completion(struct completion *x)
5933 spin_lock_irq(&x->wait.lock);
5938 spin_unlock_irq(&x->wait.lock);
5941 EXPORT_SYMBOL(try_wait_for_completion);
5944 * completion_done - Test to see if a completion has any waiters
5945 * @x: completion structure
5947 * Returns: 0 if there are waiters (wait_for_completion() in progress)
5948 * 1 if there are no waiters.
5951 bool completion_done(struct completion *x)
5955 spin_lock_irq(&x->wait.lock);
5958 spin_unlock_irq(&x->wait.lock);
5961 EXPORT_SYMBOL(completion_done);
5964 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
5966 unsigned long flags;
5969 init_waitqueue_entry(&wait, current);
5971 __set_current_state(state);
5973 spin_lock_irqsave(&q->lock, flags);
5974 __add_wait_queue(q, &wait);
5975 spin_unlock(&q->lock);
5976 timeout = schedule_timeout(timeout);
5977 spin_lock_irq(&q->lock);
5978 __remove_wait_queue(q, &wait);
5979 spin_unlock_irqrestore(&q->lock, flags);
5984 void __sched interruptible_sleep_on(wait_queue_head_t *q)
5986 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
5988 EXPORT_SYMBOL(interruptible_sleep_on);
5991 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
5993 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
5995 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
5997 void __sched sleep_on(wait_queue_head_t *q)
5999 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
6001 EXPORT_SYMBOL(sleep_on);
6003 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
6005 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
6007 EXPORT_SYMBOL(sleep_on_timeout);
6009 #ifdef CONFIG_RT_MUTEXES
6012 * rt_mutex_setprio - set the current priority of a task
6014 * @prio: prio value (kernel-internal form)
6016 * This function changes the 'effective' priority of a task. It does
6017 * not touch ->normal_prio like __setscheduler().
6019 * Used by the rt_mutex code to implement priority inheritance logic.
6021 void rt_mutex_setprio(struct task_struct *p, int prio)
6023 unsigned long flags;
6024 int oldprio, on_rq, running;
6026 const struct sched_class *prev_class = p->sched_class;
6028 BUG_ON(prio < 0 || prio > MAX_PRIO);
6030 rq = task_rq_lock(p, &flags);
6031 update_rq_clock(rq);
6034 on_rq = p->se.on_rq;
6035 running = task_current(rq, p);
6037 dequeue_task(rq, p, 0);
6039 p->sched_class->put_prev_task(rq, p);
6042 p->sched_class = &rt_sched_class;
6044 p->sched_class = &fair_sched_class;
6049 p->sched_class->set_curr_task(rq);
6051 enqueue_task(rq, p, 0);
6053 check_class_changed(rq, p, prev_class, oldprio, running);
6055 task_rq_unlock(rq, &flags);
6060 void set_user_nice(struct task_struct *p, long nice)
6062 int old_prio, delta, on_rq;
6063 unsigned long flags;
6066 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
6069 * We have to be careful, if called from sys_setpriority(),
6070 * the task might be in the middle of scheduling on another CPU.
6072 rq = task_rq_lock(p, &flags);
6073 update_rq_clock(rq);
6075 * The RT priorities are set via sched_setscheduler(), but we still
6076 * allow the 'normal' nice value to be set - but as expected
6077 * it wont have any effect on scheduling until the task is
6078 * SCHED_FIFO/SCHED_RR:
6080 if (task_has_rt_policy(p)) {
6081 p->static_prio = NICE_TO_PRIO(nice);
6084 on_rq = p->se.on_rq;
6086 dequeue_task(rq, p, 0);
6088 p->static_prio = NICE_TO_PRIO(nice);
6091 p->prio = effective_prio(p);
6092 delta = p->prio - old_prio;
6095 enqueue_task(rq, p, 0);
6097 * If the task increased its priority or is running and
6098 * lowered its priority, then reschedule its CPU:
6100 if (delta < 0 || (delta > 0 && task_running(rq, p)))
6101 resched_task(rq->curr);
6104 task_rq_unlock(rq, &flags);
6106 EXPORT_SYMBOL(set_user_nice);
6109 * can_nice - check if a task can reduce its nice value
6113 int can_nice(const struct task_struct *p, const int nice)
6115 /* convert nice value [19,-20] to rlimit style value [1,40] */
6116 int nice_rlim = 20 - nice;
6118 return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur ||
6119 capable(CAP_SYS_NICE));
6122 #ifdef __ARCH_WANT_SYS_NICE
6125 * sys_nice - change the priority of the current process.
6126 * @increment: priority increment
6128 * sys_setpriority is a more generic, but much slower function that
6129 * does similar things.
6131 SYSCALL_DEFINE1(nice, int, increment)
6136 * Setpriority might change our priority at the same moment.
6137 * We don't have to worry. Conceptually one call occurs first
6138 * and we have a single winner.
6140 if (increment < -40)
6145 nice = TASK_NICE(current) + increment;
6151 if (increment < 0 && !can_nice(current, nice))
6154 retval = security_task_setnice(current, nice);
6158 set_user_nice(current, nice);
6165 * task_prio - return the priority value of a given task.
6166 * @p: the task in question.
6168 * This is the priority value as seen by users in /proc.
6169 * RT tasks are offset by -200. Normal tasks are centered
6170 * around 0, value goes from -16 to +15.
6172 int task_prio(const struct task_struct *p)
6174 return p->prio - MAX_RT_PRIO;
6178 * task_nice - return the nice value of a given task.
6179 * @p: the task in question.
6181 int task_nice(const struct task_struct *p)
6183 return TASK_NICE(p);
6185 EXPORT_SYMBOL(task_nice);
6188 * idle_cpu - is a given cpu idle currently?
6189 * @cpu: the processor in question.
6191 int idle_cpu(int cpu)
6193 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
6197 * idle_task - return the idle task for a given cpu.
6198 * @cpu: the processor in question.
6200 struct task_struct *idle_task(int cpu)
6202 return cpu_rq(cpu)->idle;
6206 * find_process_by_pid - find a process with a matching PID value.
6207 * @pid: the pid in question.
6209 static struct task_struct *find_process_by_pid(pid_t pid)
6211 return pid ? find_task_by_vpid(pid) : current;
6214 /* Actually do priority change: must hold rq lock. */
6216 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
6218 BUG_ON(p->se.on_rq);
6221 p->rt_priority = prio;
6222 p->normal_prio = normal_prio(p);
6223 /* we are holding p->pi_lock already */
6224 p->prio = rt_mutex_getprio(p);
6225 if (rt_prio(p->prio))
6226 p->sched_class = &rt_sched_class;
6228 p->sched_class = &fair_sched_class;
6233 * check the target process has a UID that matches the current process's
6235 static bool check_same_owner(struct task_struct *p)
6237 const struct cred *cred = current_cred(), *pcred;
6241 pcred = __task_cred(p);
6242 match = (cred->euid == pcred->euid ||
6243 cred->euid == pcred->uid);
6248 static int __sched_setscheduler(struct task_struct *p, int policy,
6249 struct sched_param *param, bool user)
6251 int retval, oldprio, oldpolicy = -1, on_rq, running;
6252 unsigned long flags;
6253 const struct sched_class *prev_class = p->sched_class;
6257 /* may grab non-irq protected spin_locks */
6258 BUG_ON(in_interrupt());
6260 /* double check policy once rq lock held */
6262 reset_on_fork = p->sched_reset_on_fork;
6263 policy = oldpolicy = p->policy;
6265 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
6266 policy &= ~SCHED_RESET_ON_FORK;
6268 if (policy != SCHED_FIFO && policy != SCHED_RR &&
6269 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
6270 policy != SCHED_IDLE)
6275 * Valid priorities for SCHED_FIFO and SCHED_RR are
6276 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
6277 * SCHED_BATCH and SCHED_IDLE is 0.
6279 if (param->sched_priority < 0 ||
6280 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
6281 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
6283 if (rt_policy(policy) != (param->sched_priority != 0))
6287 * Allow unprivileged RT tasks to decrease priority:
6289 if (user && !capable(CAP_SYS_NICE)) {
6290 if (rt_policy(policy)) {
6291 unsigned long rlim_rtprio;
6293 if (!lock_task_sighand(p, &flags))
6295 rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur;
6296 unlock_task_sighand(p, &flags);
6298 /* can't set/change the rt policy */
6299 if (policy != p->policy && !rlim_rtprio)
6302 /* can't increase priority */
6303 if (param->sched_priority > p->rt_priority &&
6304 param->sched_priority > rlim_rtprio)
6308 * Like positive nice levels, dont allow tasks to
6309 * move out of SCHED_IDLE either:
6311 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
6314 /* can't change other user's priorities */
6315 if (!check_same_owner(p))
6318 /* Normal users shall not reset the sched_reset_on_fork flag */
6319 if (p->sched_reset_on_fork && !reset_on_fork)
6324 #ifdef CONFIG_RT_GROUP_SCHED
6326 * Do not allow realtime tasks into groups that have no runtime
6329 if (rt_bandwidth_enabled() && rt_policy(policy) &&
6330 task_group(p)->rt_bandwidth.rt_runtime == 0)
6334 retval = security_task_setscheduler(p, policy, param);
6340 * make sure no PI-waiters arrive (or leave) while we are
6341 * changing the priority of the task:
6343 spin_lock_irqsave(&p->pi_lock, flags);
6345 * To be able to change p->policy safely, the apropriate
6346 * runqueue lock must be held.
6348 rq = __task_rq_lock(p);
6349 /* recheck policy now with rq lock held */
6350 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
6351 policy = oldpolicy = -1;
6352 __task_rq_unlock(rq);
6353 spin_unlock_irqrestore(&p->pi_lock, flags);
6356 update_rq_clock(rq);
6357 on_rq = p->se.on_rq;
6358 running = task_current(rq, p);
6360 deactivate_task(rq, p, 0);
6362 p->sched_class->put_prev_task(rq, p);
6364 p->sched_reset_on_fork = reset_on_fork;
6367 __setscheduler(rq, p, policy, param->sched_priority);
6370 p->sched_class->set_curr_task(rq);
6372 activate_task(rq, p, 0);
6374 check_class_changed(rq, p, prev_class, oldprio, running);
6376 __task_rq_unlock(rq);
6377 spin_unlock_irqrestore(&p->pi_lock, flags);
6379 rt_mutex_adjust_pi(p);
6385 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
6386 * @p: the task in question.
6387 * @policy: new policy.
6388 * @param: structure containing the new RT priority.
6390 * NOTE that the task may be already dead.
6392 int sched_setscheduler(struct task_struct *p, int policy,
6393 struct sched_param *param)
6395 return __sched_setscheduler(p, policy, param, true);
6397 EXPORT_SYMBOL_GPL(sched_setscheduler);
6400 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
6401 * @p: the task in question.
6402 * @policy: new policy.
6403 * @param: structure containing the new RT priority.
6405 * Just like sched_setscheduler, only don't bother checking if the
6406 * current context has permission. For example, this is needed in
6407 * stop_machine(): we create temporary high priority worker threads,
6408 * but our caller might not have that capability.
6410 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
6411 struct sched_param *param)
6413 return __sched_setscheduler(p, policy, param, false);
6417 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
6419 struct sched_param lparam;
6420 struct task_struct *p;
6423 if (!param || pid < 0)
6425 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
6430 p = find_process_by_pid(pid);
6432 retval = sched_setscheduler(p, policy, &lparam);
6439 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
6440 * @pid: the pid in question.
6441 * @policy: new policy.
6442 * @param: structure containing the new RT priority.
6444 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
6445 struct sched_param __user *, param)
6447 /* negative values for policy are not valid */
6451 return do_sched_setscheduler(pid, policy, param);
6455 * sys_sched_setparam - set/change the RT priority of a thread
6456 * @pid: the pid in question.
6457 * @param: structure containing the new RT priority.
6459 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
6461 return do_sched_setscheduler(pid, -1, param);
6465 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
6466 * @pid: the pid in question.
6468 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
6470 struct task_struct *p;
6477 read_lock(&tasklist_lock);
6478 p = find_process_by_pid(pid);
6480 retval = security_task_getscheduler(p);
6483 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
6485 read_unlock(&tasklist_lock);
6490 * sys_sched_getparam - get the RT priority of a thread
6491 * @pid: the pid in question.
6492 * @param: structure containing the RT priority.
6494 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
6496 struct sched_param lp;
6497 struct task_struct *p;
6500 if (!param || pid < 0)
6503 read_lock(&tasklist_lock);
6504 p = find_process_by_pid(pid);
6509 retval = security_task_getscheduler(p);
6513 lp.sched_priority = p->rt_priority;
6514 read_unlock(&tasklist_lock);
6517 * This one might sleep, we cannot do it with a spinlock held ...
6519 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
6524 read_unlock(&tasklist_lock);
6528 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
6530 cpumask_var_t cpus_allowed, new_mask;
6531 struct task_struct *p;
6535 read_lock(&tasklist_lock);
6537 p = find_process_by_pid(pid);
6539 read_unlock(&tasklist_lock);
6545 * It is not safe to call set_cpus_allowed with the
6546 * tasklist_lock held. We will bump the task_struct's
6547 * usage count and then drop tasklist_lock.
6550 read_unlock(&tasklist_lock);
6552 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
6556 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
6558 goto out_free_cpus_allowed;
6561 if (!check_same_owner(p) && !capable(CAP_SYS_NICE))
6564 retval = security_task_setscheduler(p, 0, NULL);
6568 cpuset_cpus_allowed(p, cpus_allowed);
6569 cpumask_and(new_mask, in_mask, cpus_allowed);
6571 retval = set_cpus_allowed_ptr(p, new_mask);
6574 cpuset_cpus_allowed(p, cpus_allowed);
6575 if (!cpumask_subset(new_mask, cpus_allowed)) {
6577 * We must have raced with a concurrent cpuset
6578 * update. Just reset the cpus_allowed to the
6579 * cpuset's cpus_allowed
6581 cpumask_copy(new_mask, cpus_allowed);
6586 free_cpumask_var(new_mask);
6587 out_free_cpus_allowed:
6588 free_cpumask_var(cpus_allowed);
6595 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
6596 struct cpumask *new_mask)
6598 if (len < cpumask_size())
6599 cpumask_clear(new_mask);
6600 else if (len > cpumask_size())
6601 len = cpumask_size();
6603 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
6607 * sys_sched_setaffinity - set the cpu affinity of a process
6608 * @pid: pid of the process
6609 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
6610 * @user_mask_ptr: user-space pointer to the new cpu mask
6612 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
6613 unsigned long __user *, user_mask_ptr)
6615 cpumask_var_t new_mask;
6618 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
6621 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
6623 retval = sched_setaffinity(pid, new_mask);
6624 free_cpumask_var(new_mask);
6628 long sched_getaffinity(pid_t pid, struct cpumask *mask)
6630 struct task_struct *p;
6631 unsigned long flags;
6636 read_lock(&tasklist_lock);
6639 p = find_process_by_pid(pid);
6643 retval = security_task_getscheduler(p);
6647 rq = task_rq_lock(p, &flags);
6648 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
6649 task_rq_unlock(rq, &flags);
6652 read_unlock(&tasklist_lock);
6659 * sys_sched_getaffinity - get the cpu affinity of a process
6660 * @pid: pid of the process
6661 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
6662 * @user_mask_ptr: user-space pointer to hold the current cpu mask
6664 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
6665 unsigned long __user *, user_mask_ptr)
6670 if (len < cpumask_size())
6673 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
6676 ret = sched_getaffinity(pid, mask);
6678 if (copy_to_user(user_mask_ptr, mask, cpumask_size()))
6681 ret = cpumask_size();
6683 free_cpumask_var(mask);
6689 * sys_sched_yield - yield the current processor to other threads.
6691 * This function yields the current CPU to other tasks. If there are no
6692 * other threads running on this CPU then this function will return.
6694 SYSCALL_DEFINE0(sched_yield)
6696 struct rq *rq = this_rq_lock();
6698 schedstat_inc(rq, yld_count);
6699 current->sched_class->yield_task(rq);
6702 * Since we are going to call schedule() anyway, there's
6703 * no need to preempt or enable interrupts:
6705 __release(rq->lock);
6706 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
6707 _raw_spin_unlock(&rq->lock);
6708 preempt_enable_no_resched();
6715 static inline int should_resched(void)
6717 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
6720 static void __cond_resched(void)
6722 add_preempt_count(PREEMPT_ACTIVE);
6724 sub_preempt_count(PREEMPT_ACTIVE);
6727 int __sched _cond_resched(void)
6729 if (should_resched()) {
6735 EXPORT_SYMBOL(_cond_resched);
6738 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
6739 * call schedule, and on return reacquire the lock.
6741 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
6742 * operations here to prevent schedule() from being called twice (once via
6743 * spin_unlock(), once by hand).
6745 int __cond_resched_lock(spinlock_t *lock)
6747 int resched = should_resched();
6750 lockdep_assert_held(lock);
6752 if (spin_needbreak(lock) || resched) {
6763 EXPORT_SYMBOL(__cond_resched_lock);
6765 int __sched __cond_resched_softirq(void)
6767 BUG_ON(!in_softirq());
6769 if (should_resched()) {
6777 EXPORT_SYMBOL(__cond_resched_softirq);
6780 * yield - yield the current processor to other threads.
6782 * This is a shortcut for kernel-space yielding - it marks the
6783 * thread runnable and calls sys_sched_yield().
6785 void __sched yield(void)
6787 set_current_state(TASK_RUNNING);
6790 EXPORT_SYMBOL(yield);
6793 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
6794 * that process accounting knows that this is a task in IO wait state.
6796 void __sched io_schedule(void)
6798 struct rq *rq = raw_rq();
6800 delayacct_blkio_start();
6801 atomic_inc(&rq->nr_iowait);
6802 current->in_iowait = 1;
6804 current->in_iowait = 0;
6805 atomic_dec(&rq->nr_iowait);
6806 delayacct_blkio_end();
6808 EXPORT_SYMBOL(io_schedule);
6810 long __sched io_schedule_timeout(long timeout)
6812 struct rq *rq = raw_rq();
6815 delayacct_blkio_start();
6816 atomic_inc(&rq->nr_iowait);
6817 current->in_iowait = 1;
6818 ret = schedule_timeout(timeout);
6819 current->in_iowait = 0;
6820 atomic_dec(&rq->nr_iowait);
6821 delayacct_blkio_end();
6826 * sys_sched_get_priority_max - return maximum RT priority.
6827 * @policy: scheduling class.
6829 * this syscall returns the maximum rt_priority that can be used
6830 * by a given scheduling class.
6832 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
6839 ret = MAX_USER_RT_PRIO-1;
6851 * sys_sched_get_priority_min - return minimum RT priority.
6852 * @policy: scheduling class.
6854 * this syscall returns the minimum rt_priority that can be used
6855 * by a given scheduling class.
6857 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
6875 * sys_sched_rr_get_interval - return the default timeslice of a process.
6876 * @pid: pid of the process.
6877 * @interval: userspace pointer to the timeslice value.
6879 * this syscall writes the default timeslice value of a given process
6880 * into the user-space timespec buffer. A value of '0' means infinity.
6882 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
6883 struct timespec __user *, interval)
6885 struct task_struct *p;
6886 unsigned int time_slice;
6887 unsigned long flags;
6896 read_lock(&tasklist_lock);
6897 p = find_process_by_pid(pid);
6901 retval = security_task_getscheduler(p);
6905 rq = task_rq_lock(p, &flags);
6906 time_slice = p->sched_class->get_rr_interval(rq, p);
6907 task_rq_unlock(rq, &flags);
6909 read_unlock(&tasklist_lock);
6910 jiffies_to_timespec(time_slice, &t);
6911 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
6915 read_unlock(&tasklist_lock);
6919 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
6921 void sched_show_task(struct task_struct *p)
6923 unsigned long free = 0;
6926 state = p->state ? __ffs(p->state) + 1 : 0;
6927 printk(KERN_INFO "%-13.13s %c", p->comm,
6928 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
6929 #if BITS_PER_LONG == 32
6930 if (state == TASK_RUNNING)
6931 printk(KERN_CONT " running ");
6933 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
6935 if (state == TASK_RUNNING)
6936 printk(KERN_CONT " running task ");
6938 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
6940 #ifdef CONFIG_DEBUG_STACK_USAGE
6941 free = stack_not_used(p);
6943 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
6944 task_pid_nr(p), task_pid_nr(p->real_parent),
6945 (unsigned long)task_thread_info(p)->flags);
6947 show_stack(p, NULL);
6950 void show_state_filter(unsigned long state_filter)
6952 struct task_struct *g, *p;
6954 #if BITS_PER_LONG == 32
6956 " task PC stack pid father\n");
6959 " task PC stack pid father\n");
6961 read_lock(&tasklist_lock);
6962 do_each_thread(g, p) {
6964 * reset the NMI-timeout, listing all files on a slow
6965 * console might take alot of time:
6967 touch_nmi_watchdog();
6968 if (!state_filter || (p->state & state_filter))
6970 } while_each_thread(g, p);
6972 touch_all_softlockup_watchdogs();
6974 #ifdef CONFIG_SCHED_DEBUG
6975 sysrq_sched_debug_show();
6977 read_unlock(&tasklist_lock);
6979 * Only show locks if all tasks are dumped:
6982 debug_show_all_locks();
6985 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
6987 idle->sched_class = &idle_sched_class;
6991 * init_idle - set up an idle thread for a given CPU
6992 * @idle: task in question
6993 * @cpu: cpu the idle task belongs to
6995 * NOTE: this function does not set the idle thread's NEED_RESCHED
6996 * flag, to make booting more robust.
6998 void __cpuinit init_idle(struct task_struct *idle, int cpu)
7000 struct rq *rq = cpu_rq(cpu);
7001 unsigned long flags;
7003 spin_lock_irqsave(&rq->lock, flags);
7006 idle->se.exec_start = sched_clock();
7008 idle->prio = idle->normal_prio = MAX_PRIO;
7009 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
7010 __set_task_cpu(idle, cpu);
7012 rq->curr = rq->idle = idle;
7013 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
7016 spin_unlock_irqrestore(&rq->lock, flags);
7018 /* Set the preempt count _outside_ the spinlocks! */
7019 #if defined(CONFIG_PREEMPT)
7020 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
7022 task_thread_info(idle)->preempt_count = 0;
7025 * The idle tasks have their own, simple scheduling class:
7027 idle->sched_class = &idle_sched_class;
7028 ftrace_graph_init_task(idle);
7032 * In a system that switches off the HZ timer nohz_cpu_mask
7033 * indicates which cpus entered this state. This is used
7034 * in the rcu update to wait only for active cpus. For system
7035 * which do not switch off the HZ timer nohz_cpu_mask should
7036 * always be CPU_BITS_NONE.
7038 cpumask_var_t nohz_cpu_mask;
7041 * Increase the granularity value when there are more CPUs,
7042 * because with more CPUs the 'effective latency' as visible
7043 * to users decreases. But the relationship is not linear,
7044 * so pick a second-best guess by going with the log2 of the
7047 * This idea comes from the SD scheduler of Con Kolivas:
7049 static inline void sched_init_granularity(void)
7051 unsigned int factor = 1 + ilog2(num_online_cpus());
7052 const unsigned long limit = 200000000;
7054 sysctl_sched_min_granularity *= factor;
7055 if (sysctl_sched_min_granularity > limit)
7056 sysctl_sched_min_granularity = limit;
7058 sysctl_sched_latency *= factor;
7059 if (sysctl_sched_latency > limit)
7060 sysctl_sched_latency = limit;
7062 sysctl_sched_wakeup_granularity *= factor;
7064 sysctl_sched_shares_ratelimit *= factor;
7069 * This is how migration works:
7071 * 1) we queue a struct migration_req structure in the source CPU's
7072 * runqueue and wake up that CPU's migration thread.
7073 * 2) we down() the locked semaphore => thread blocks.
7074 * 3) migration thread wakes up (implicitly it forces the migrated
7075 * thread off the CPU)
7076 * 4) it gets the migration request and checks whether the migrated
7077 * task is still in the wrong runqueue.
7078 * 5) if it's in the wrong runqueue then the migration thread removes
7079 * it and puts it into the right queue.
7080 * 6) migration thread up()s the semaphore.
7081 * 7) we wake up and the migration is done.
7085 * Change a given task's CPU affinity. Migrate the thread to a
7086 * proper CPU and schedule it away if the CPU it's executing on
7087 * is removed from the allowed bitmask.
7089 * NOTE: the caller must have a valid reference to the task, the
7090 * task must not exit() & deallocate itself prematurely. The
7091 * call is not atomic; no spinlocks may be held.
7093 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
7095 struct migration_req req;
7096 unsigned long flags;
7100 rq = task_rq_lock(p, &flags);
7101 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
7106 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
7107 !cpumask_equal(&p->cpus_allowed, new_mask))) {
7112 if (p->sched_class->set_cpus_allowed)
7113 p->sched_class->set_cpus_allowed(p, new_mask);
7115 cpumask_copy(&p->cpus_allowed, new_mask);
7116 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
7119 /* Can the task run on the task's current CPU? If so, we're done */
7120 if (cpumask_test_cpu(task_cpu(p), new_mask))
7123 if (migrate_task(p, cpumask_any_and(cpu_active_mask, new_mask), &req)) {
7124 /* Need help from migration thread: drop lock and wait. */
7125 struct task_struct *mt = rq->migration_thread;
7127 get_task_struct(mt);
7128 task_rq_unlock(rq, &flags);
7129 wake_up_process(rq->migration_thread);
7130 put_task_struct(mt);
7131 wait_for_completion(&req.done);
7132 tlb_migrate_finish(p->mm);
7136 task_rq_unlock(rq, &flags);
7140 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
7143 * Move (not current) task off this cpu, onto dest cpu. We're doing
7144 * this because either it can't run here any more (set_cpus_allowed()
7145 * away from this CPU, or CPU going down), or because we're
7146 * attempting to rebalance this task on exec (sched_exec).
7148 * So we race with normal scheduler movements, but that's OK, as long
7149 * as the task is no longer on this CPU.
7151 * Returns non-zero if task was successfully migrated.
7153 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
7155 struct rq *rq_dest, *rq_src;
7158 if (unlikely(!cpu_active(dest_cpu)))
7161 rq_src = cpu_rq(src_cpu);
7162 rq_dest = cpu_rq(dest_cpu);
7164 double_rq_lock(rq_src, rq_dest);
7165 /* Already moved. */
7166 if (task_cpu(p) != src_cpu)
7168 /* Affinity changed (again). */
7169 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
7172 on_rq = p->se.on_rq;
7174 deactivate_task(rq_src, p, 0);
7176 set_task_cpu(p, dest_cpu);
7178 activate_task(rq_dest, p, 0);
7179 check_preempt_curr(rq_dest, p, 0);
7184 double_rq_unlock(rq_src, rq_dest);
7188 #define RCU_MIGRATION_IDLE 0
7189 #define RCU_MIGRATION_NEED_QS 1
7190 #define RCU_MIGRATION_GOT_QS 2
7191 #define RCU_MIGRATION_MUST_SYNC 3
7194 * migration_thread - this is a highprio system thread that performs
7195 * thread migration by bumping thread off CPU then 'pushing' onto
7198 static int migration_thread(void *data)
7201 int cpu = (long)data;
7205 BUG_ON(rq->migration_thread != current);
7207 set_current_state(TASK_INTERRUPTIBLE);
7208 while (!kthread_should_stop()) {
7209 struct migration_req *req;
7210 struct list_head *head;
7212 spin_lock_irq(&rq->lock);
7214 if (cpu_is_offline(cpu)) {
7215 spin_unlock_irq(&rq->lock);
7219 if (rq->active_balance) {
7220 active_load_balance(rq, cpu);
7221 rq->active_balance = 0;
7224 head = &rq->migration_queue;
7226 if (list_empty(head)) {
7227 spin_unlock_irq(&rq->lock);
7229 set_current_state(TASK_INTERRUPTIBLE);
7232 req = list_entry(head->next, struct migration_req, list);
7233 list_del_init(head->next);
7235 if (req->task != NULL) {
7236 spin_unlock(&rq->lock);
7237 __migrate_task(req->task, cpu, req->dest_cpu);
7238 } else if (likely(cpu == (badcpu = smp_processor_id()))) {
7239 req->dest_cpu = RCU_MIGRATION_GOT_QS;
7240 spin_unlock(&rq->lock);
7242 req->dest_cpu = RCU_MIGRATION_MUST_SYNC;
7243 spin_unlock(&rq->lock);
7244 WARN_ONCE(1, "migration_thread() on CPU %d, expected %d\n", badcpu, cpu);
7248 complete(&req->done);
7250 __set_current_state(TASK_RUNNING);
7255 #ifdef CONFIG_HOTPLUG_CPU
7257 static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu)
7261 local_irq_disable();
7262 ret = __migrate_task(p, src_cpu, dest_cpu);
7268 * Figure out where task on dead CPU should go, use force if necessary.
7270 static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
7273 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(dead_cpu));
7276 /* Look for allowed, online CPU in same node. */
7277 for_each_cpu_and(dest_cpu, nodemask, cpu_active_mask)
7278 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
7281 /* Any allowed, online CPU? */
7282 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_active_mask);
7283 if (dest_cpu < nr_cpu_ids)
7286 /* No more Mr. Nice Guy. */
7287 if (dest_cpu >= nr_cpu_ids) {
7288 cpuset_cpus_allowed_locked(p, &p->cpus_allowed);
7289 dest_cpu = cpumask_any_and(cpu_active_mask, &p->cpus_allowed);
7292 * Don't tell them about moving exiting tasks or
7293 * kernel threads (both mm NULL), since they never
7296 if (p->mm && printk_ratelimit()) {
7297 printk(KERN_INFO "process %d (%s) no "
7298 "longer affine to cpu%d\n",
7299 task_pid_nr(p), p->comm, dead_cpu);
7304 /* It can have affinity changed while we were choosing. */
7305 if (unlikely(!__migrate_task_irq(p, dead_cpu, dest_cpu)))
7310 * While a dead CPU has no uninterruptible tasks queued at this point,
7311 * it might still have a nonzero ->nr_uninterruptible counter, because
7312 * for performance reasons the counter is not stricly tracking tasks to
7313 * their home CPUs. So we just add the counter to another CPU's counter,
7314 * to keep the global sum constant after CPU-down:
7316 static void migrate_nr_uninterruptible(struct rq *rq_src)
7318 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
7319 unsigned long flags;
7321 local_irq_save(flags);
7322 double_rq_lock(rq_src, rq_dest);
7323 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
7324 rq_src->nr_uninterruptible = 0;
7325 double_rq_unlock(rq_src, rq_dest);
7326 local_irq_restore(flags);
7329 /* Run through task list and migrate tasks from the dead cpu. */
7330 static void migrate_live_tasks(int src_cpu)
7332 struct task_struct *p, *t;
7334 read_lock(&tasklist_lock);
7336 do_each_thread(t, p) {
7340 if (task_cpu(p) == src_cpu)
7341 move_task_off_dead_cpu(src_cpu, p);
7342 } while_each_thread(t, p);
7344 read_unlock(&tasklist_lock);
7348 * Schedules idle task to be the next runnable task on current CPU.
7349 * It does so by boosting its priority to highest possible.
7350 * Used by CPU offline code.
7352 void sched_idle_next(void)
7354 int this_cpu = smp_processor_id();
7355 struct rq *rq = cpu_rq(this_cpu);
7356 struct task_struct *p = rq->idle;
7357 unsigned long flags;
7359 /* cpu has to be offline */
7360 BUG_ON(cpu_online(this_cpu));
7363 * Strictly not necessary since rest of the CPUs are stopped by now
7364 * and interrupts disabled on the current cpu.
7366 spin_lock_irqsave(&rq->lock, flags);
7368 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
7370 update_rq_clock(rq);
7371 activate_task(rq, p, 0);
7373 spin_unlock_irqrestore(&rq->lock, flags);
7377 * Ensures that the idle task is using init_mm right before its cpu goes
7380 void idle_task_exit(void)
7382 struct mm_struct *mm = current->active_mm;
7384 BUG_ON(cpu_online(smp_processor_id()));
7387 switch_mm(mm, &init_mm, current);
7391 /* called under rq->lock with disabled interrupts */
7392 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
7394 struct rq *rq = cpu_rq(dead_cpu);
7396 /* Must be exiting, otherwise would be on tasklist. */
7397 BUG_ON(!p->exit_state);
7399 /* Cannot have done final schedule yet: would have vanished. */
7400 BUG_ON(p->state == TASK_DEAD);
7405 * Drop lock around migration; if someone else moves it,
7406 * that's OK. No task can be added to this CPU, so iteration is
7409 spin_unlock_irq(&rq->lock);
7410 move_task_off_dead_cpu(dead_cpu, p);
7411 spin_lock_irq(&rq->lock);
7416 /* release_task() removes task from tasklist, so we won't find dead tasks. */
7417 static void migrate_dead_tasks(unsigned int dead_cpu)
7419 struct rq *rq = cpu_rq(dead_cpu);
7420 struct task_struct *next;
7423 if (!rq->nr_running)
7425 update_rq_clock(rq);
7426 next = pick_next_task(rq);
7429 next->sched_class->put_prev_task(rq, next);
7430 migrate_dead(dead_cpu, next);
7436 * remove the tasks which were accounted by rq from calc_load_tasks.
7438 static void calc_global_load_remove(struct rq *rq)
7440 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
7441 rq->calc_load_active = 0;
7443 #endif /* CONFIG_HOTPLUG_CPU */
7445 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
7447 static struct ctl_table sd_ctl_dir[] = {
7449 .procname = "sched_domain",
7455 static struct ctl_table sd_ctl_root[] = {
7457 .ctl_name = CTL_KERN,
7458 .procname = "kernel",
7460 .child = sd_ctl_dir,
7465 static struct ctl_table *sd_alloc_ctl_entry(int n)
7467 struct ctl_table *entry =
7468 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
7473 static void sd_free_ctl_entry(struct ctl_table **tablep)
7475 struct ctl_table *entry;
7478 * In the intermediate directories, both the child directory and
7479 * procname are dynamically allocated and could fail but the mode
7480 * will always be set. In the lowest directory the names are
7481 * static strings and all have proc handlers.
7483 for (entry = *tablep; entry->mode; entry++) {
7485 sd_free_ctl_entry(&entry->child);
7486 if (entry->proc_handler == NULL)
7487 kfree(entry->procname);
7495 set_table_entry(struct ctl_table *entry,
7496 const char *procname, void *data, int maxlen,
7497 mode_t mode, proc_handler *proc_handler)
7499 entry->procname = procname;
7501 entry->maxlen = maxlen;
7503 entry->proc_handler = proc_handler;
7506 static struct ctl_table *
7507 sd_alloc_ctl_domain_table(struct sched_domain *sd)
7509 struct ctl_table *table = sd_alloc_ctl_entry(13);
7514 set_table_entry(&table[0], "min_interval", &sd->min_interval,
7515 sizeof(long), 0644, proc_doulongvec_minmax);
7516 set_table_entry(&table[1], "max_interval", &sd->max_interval,
7517 sizeof(long), 0644, proc_doulongvec_minmax);
7518 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
7519 sizeof(int), 0644, proc_dointvec_minmax);
7520 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
7521 sizeof(int), 0644, proc_dointvec_minmax);
7522 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
7523 sizeof(int), 0644, proc_dointvec_minmax);
7524 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
7525 sizeof(int), 0644, proc_dointvec_minmax);
7526 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
7527 sizeof(int), 0644, proc_dointvec_minmax);
7528 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
7529 sizeof(int), 0644, proc_dointvec_minmax);
7530 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
7531 sizeof(int), 0644, proc_dointvec_minmax);
7532 set_table_entry(&table[9], "cache_nice_tries",
7533 &sd->cache_nice_tries,
7534 sizeof(int), 0644, proc_dointvec_minmax);
7535 set_table_entry(&table[10], "flags", &sd->flags,
7536 sizeof(int), 0644, proc_dointvec_minmax);
7537 set_table_entry(&table[11], "name", sd->name,
7538 CORENAME_MAX_SIZE, 0444, proc_dostring);
7539 /* &table[12] is terminator */
7544 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
7546 struct ctl_table *entry, *table;
7547 struct sched_domain *sd;
7548 int domain_num = 0, i;
7551 for_each_domain(cpu, sd)
7553 entry = table = sd_alloc_ctl_entry(domain_num + 1);
7558 for_each_domain(cpu, sd) {
7559 snprintf(buf, 32, "domain%d", i);
7560 entry->procname = kstrdup(buf, GFP_KERNEL);
7562 entry->child = sd_alloc_ctl_domain_table(sd);
7569 static struct ctl_table_header *sd_sysctl_header;
7570 static void register_sched_domain_sysctl(void)
7572 int i, cpu_num = num_possible_cpus();
7573 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
7576 WARN_ON(sd_ctl_dir[0].child);
7577 sd_ctl_dir[0].child = entry;
7582 for_each_possible_cpu(i) {
7583 snprintf(buf, 32, "cpu%d", i);
7584 entry->procname = kstrdup(buf, GFP_KERNEL);
7586 entry->child = sd_alloc_ctl_cpu_table(i);
7590 WARN_ON(sd_sysctl_header);
7591 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
7594 /* may be called multiple times per register */
7595 static void unregister_sched_domain_sysctl(void)
7597 if (sd_sysctl_header)
7598 unregister_sysctl_table(sd_sysctl_header);
7599 sd_sysctl_header = NULL;
7600 if (sd_ctl_dir[0].child)
7601 sd_free_ctl_entry(&sd_ctl_dir[0].child);
7604 static void register_sched_domain_sysctl(void)
7607 static void unregister_sched_domain_sysctl(void)
7612 static void set_rq_online(struct rq *rq)
7615 const struct sched_class *class;
7617 cpumask_set_cpu(rq->cpu, rq->rd->online);
7620 for_each_class(class) {
7621 if (class->rq_online)
7622 class->rq_online(rq);
7627 static void set_rq_offline(struct rq *rq)
7630 const struct sched_class *class;
7632 for_each_class(class) {
7633 if (class->rq_offline)
7634 class->rq_offline(rq);
7637 cpumask_clear_cpu(rq->cpu, rq->rd->online);
7643 * migration_call - callback that gets triggered when a CPU is added.
7644 * Here we can start up the necessary migration thread for the new CPU.
7646 static int __cpuinit
7647 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
7649 struct task_struct *p;
7650 int cpu = (long)hcpu;
7651 unsigned long flags;
7656 case CPU_UP_PREPARE:
7657 case CPU_UP_PREPARE_FROZEN:
7658 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
7661 kthread_bind(p, cpu);
7662 /* Must be high prio: stop_machine expects to yield to it. */
7663 rq = task_rq_lock(p, &flags);
7664 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
7665 task_rq_unlock(rq, &flags);
7667 cpu_rq(cpu)->migration_thread = p;
7668 rq->calc_load_update = calc_load_update;
7672 case CPU_ONLINE_FROZEN:
7673 /* Strictly unnecessary, as first user will wake it. */
7674 wake_up_process(cpu_rq(cpu)->migration_thread);
7676 /* Update our root-domain */
7678 spin_lock_irqsave(&rq->lock, flags);
7680 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
7684 spin_unlock_irqrestore(&rq->lock, flags);
7687 #ifdef CONFIG_HOTPLUG_CPU
7688 case CPU_UP_CANCELED:
7689 case CPU_UP_CANCELED_FROZEN:
7690 if (!cpu_rq(cpu)->migration_thread)
7692 /* Unbind it from offline cpu so it can run. Fall thru. */
7693 kthread_bind(cpu_rq(cpu)->migration_thread,
7694 cpumask_any(cpu_online_mask));
7695 kthread_stop(cpu_rq(cpu)->migration_thread);
7696 put_task_struct(cpu_rq(cpu)->migration_thread);
7697 cpu_rq(cpu)->migration_thread = NULL;
7701 case CPU_DEAD_FROZEN:
7702 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
7703 migrate_live_tasks(cpu);
7705 kthread_stop(rq->migration_thread);
7706 put_task_struct(rq->migration_thread);
7707 rq->migration_thread = NULL;
7708 /* Idle task back to normal (off runqueue, low prio) */
7709 spin_lock_irq(&rq->lock);
7710 update_rq_clock(rq);
7711 deactivate_task(rq, rq->idle, 0);
7712 rq->idle->static_prio = MAX_PRIO;
7713 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
7714 rq->idle->sched_class = &idle_sched_class;
7715 migrate_dead_tasks(cpu);
7716 spin_unlock_irq(&rq->lock);
7718 migrate_nr_uninterruptible(rq);
7719 BUG_ON(rq->nr_running != 0);
7720 calc_global_load_remove(rq);
7722 * No need to migrate the tasks: it was best-effort if
7723 * they didn't take sched_hotcpu_mutex. Just wake up
7726 spin_lock_irq(&rq->lock);
7727 while (!list_empty(&rq->migration_queue)) {
7728 struct migration_req *req;
7730 req = list_entry(rq->migration_queue.next,
7731 struct migration_req, list);
7732 list_del_init(&req->list);
7733 spin_unlock_irq(&rq->lock);
7734 complete(&req->done);
7735 spin_lock_irq(&rq->lock);
7737 spin_unlock_irq(&rq->lock);
7741 case CPU_DYING_FROZEN:
7742 /* Update our root-domain */
7744 spin_lock_irqsave(&rq->lock, flags);
7746 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
7749 spin_unlock_irqrestore(&rq->lock, flags);
7757 * Register at high priority so that task migration (migrate_all_tasks)
7758 * happens before everything else. This has to be lower priority than
7759 * the notifier in the perf_event subsystem, though.
7761 static struct notifier_block __cpuinitdata migration_notifier = {
7762 .notifier_call = migration_call,
7766 static int __init migration_init(void)
7768 void *cpu = (void *)(long)smp_processor_id();
7771 /* Start one for the boot CPU: */
7772 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
7773 BUG_ON(err == NOTIFY_BAD);
7774 migration_call(&migration_notifier, CPU_ONLINE, cpu);
7775 register_cpu_notifier(&migration_notifier);
7779 early_initcall(migration_init);
7784 #ifdef CONFIG_SCHED_DEBUG
7786 static __read_mostly int sched_domain_debug_enabled;
7788 static int __init sched_domain_debug_setup(char *str)
7790 sched_domain_debug_enabled = 1;
7794 early_param("sched_debug", sched_domain_debug_setup);
7796 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
7797 struct cpumask *groupmask)
7799 struct sched_group *group = sd->groups;
7802 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
7803 cpumask_clear(groupmask);
7805 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
7807 if (!(sd->flags & SD_LOAD_BALANCE)) {
7808 printk("does not load-balance\n");
7810 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
7815 printk(KERN_CONT "span %s level %s\n", str, sd->name);
7817 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
7818 printk(KERN_ERR "ERROR: domain->span does not contain "
7821 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
7822 printk(KERN_ERR "ERROR: domain->groups does not contain"
7826 printk(KERN_DEBUG "%*s groups:", level + 1, "");
7830 printk(KERN_ERR "ERROR: group is NULL\n");
7834 if (!group->cpu_power) {
7835 printk(KERN_CONT "\n");
7836 printk(KERN_ERR "ERROR: domain->cpu_power not "
7841 if (!cpumask_weight(sched_group_cpus(group))) {
7842 printk(KERN_CONT "\n");
7843 printk(KERN_ERR "ERROR: empty group\n");
7847 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
7848 printk(KERN_CONT "\n");
7849 printk(KERN_ERR "ERROR: repeated CPUs\n");
7853 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
7855 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
7857 printk(KERN_CONT " %s", str);
7858 if (group->cpu_power != SCHED_LOAD_SCALE) {
7859 printk(KERN_CONT " (cpu_power = %d)",
7863 group = group->next;
7864 } while (group != sd->groups);
7865 printk(KERN_CONT "\n");
7867 if (!cpumask_equal(sched_domain_span(sd), groupmask))
7868 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
7871 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
7872 printk(KERN_ERR "ERROR: parent span is not a superset "
7873 "of domain->span\n");
7877 static void sched_domain_debug(struct sched_domain *sd, int cpu)
7879 cpumask_var_t groupmask;
7882 if (!sched_domain_debug_enabled)
7886 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
7890 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
7892 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
7893 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
7898 if (sched_domain_debug_one(sd, cpu, level, groupmask))
7905 free_cpumask_var(groupmask);
7907 #else /* !CONFIG_SCHED_DEBUG */
7908 # define sched_domain_debug(sd, cpu) do { } while (0)
7909 #endif /* CONFIG_SCHED_DEBUG */
7911 static int sd_degenerate(struct sched_domain *sd)
7913 if (cpumask_weight(sched_domain_span(sd)) == 1)
7916 /* Following flags need at least 2 groups */
7917 if (sd->flags & (SD_LOAD_BALANCE |
7918 SD_BALANCE_NEWIDLE |
7922 SD_SHARE_PKG_RESOURCES)) {
7923 if (sd->groups != sd->groups->next)
7927 /* Following flags don't use groups */
7928 if (sd->flags & (SD_WAKE_AFFINE))
7935 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
7937 unsigned long cflags = sd->flags, pflags = parent->flags;
7939 if (sd_degenerate(parent))
7942 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
7945 /* Flags needing groups don't count if only 1 group in parent */
7946 if (parent->groups == parent->groups->next) {
7947 pflags &= ~(SD_LOAD_BALANCE |
7948 SD_BALANCE_NEWIDLE |
7952 SD_SHARE_PKG_RESOURCES);
7953 if (nr_node_ids == 1)
7954 pflags &= ~SD_SERIALIZE;
7956 if (~cflags & pflags)
7962 static void free_rootdomain(struct root_domain *rd)
7964 synchronize_sched();
7966 cpupri_cleanup(&rd->cpupri);
7968 free_cpumask_var(rd->rto_mask);
7969 free_cpumask_var(rd->online);
7970 free_cpumask_var(rd->span);
7974 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
7976 struct root_domain *old_rd = NULL;
7977 unsigned long flags;
7979 spin_lock_irqsave(&rq->lock, flags);
7984 if (cpumask_test_cpu(rq->cpu, old_rd->online))
7987 cpumask_clear_cpu(rq->cpu, old_rd->span);
7990 * If we dont want to free the old_rt yet then
7991 * set old_rd to NULL to skip the freeing later
7994 if (!atomic_dec_and_test(&old_rd->refcount))
7998 atomic_inc(&rd->refcount);
8001 cpumask_set_cpu(rq->cpu, rd->span);
8002 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
8005 spin_unlock_irqrestore(&rq->lock, flags);
8008 free_rootdomain(old_rd);
8011 static int init_rootdomain(struct root_domain *rd, bool bootmem)
8013 gfp_t gfp = GFP_KERNEL;
8015 memset(rd, 0, sizeof(*rd));
8020 if (!alloc_cpumask_var(&rd->span, gfp))
8022 if (!alloc_cpumask_var(&rd->online, gfp))
8024 if (!alloc_cpumask_var(&rd->rto_mask, gfp))
8027 if (cpupri_init(&rd->cpupri, bootmem) != 0)
8032 free_cpumask_var(rd->rto_mask);
8034 free_cpumask_var(rd->online);
8036 free_cpumask_var(rd->span);
8041 static void init_defrootdomain(void)
8043 init_rootdomain(&def_root_domain, true);
8045 atomic_set(&def_root_domain.refcount, 1);
8048 static struct root_domain *alloc_rootdomain(void)
8050 struct root_domain *rd;
8052 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
8056 if (init_rootdomain(rd, false) != 0) {
8065 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
8066 * hold the hotplug lock.
8069 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
8071 struct rq *rq = cpu_rq(cpu);
8072 struct sched_domain *tmp;
8074 /* Remove the sched domains which do not contribute to scheduling. */
8075 for (tmp = sd; tmp; ) {
8076 struct sched_domain *parent = tmp->parent;
8080 if (sd_parent_degenerate(tmp, parent)) {
8081 tmp->parent = parent->parent;
8083 parent->parent->child = tmp;
8088 if (sd && sd_degenerate(sd)) {
8094 sched_domain_debug(sd, cpu);
8096 rq_attach_root(rq, rd);
8097 rcu_assign_pointer(rq->sd, sd);
8100 /* cpus with isolated domains */
8101 static cpumask_var_t cpu_isolated_map;
8103 /* Setup the mask of cpus configured for isolated domains */
8104 static int __init isolated_cpu_setup(char *str)
8106 alloc_bootmem_cpumask_var(&cpu_isolated_map);
8107 cpulist_parse(str, cpu_isolated_map);
8111 __setup("isolcpus=", isolated_cpu_setup);
8114 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
8115 * to a function which identifies what group(along with sched group) a CPU
8116 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
8117 * (due to the fact that we keep track of groups covered with a struct cpumask).
8119 * init_sched_build_groups will build a circular linked list of the groups
8120 * covered by the given span, and will set each group's ->cpumask correctly,
8121 * and ->cpu_power to 0.
8124 init_sched_build_groups(const struct cpumask *span,
8125 const struct cpumask *cpu_map,
8126 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
8127 struct sched_group **sg,
8128 struct cpumask *tmpmask),
8129 struct cpumask *covered, struct cpumask *tmpmask)
8131 struct sched_group *first = NULL, *last = NULL;
8134 cpumask_clear(covered);
8136 for_each_cpu(i, span) {
8137 struct sched_group *sg;
8138 int group = group_fn(i, cpu_map, &sg, tmpmask);
8141 if (cpumask_test_cpu(i, covered))
8144 cpumask_clear(sched_group_cpus(sg));
8147 for_each_cpu(j, span) {
8148 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
8151 cpumask_set_cpu(j, covered);
8152 cpumask_set_cpu(j, sched_group_cpus(sg));
8163 #define SD_NODES_PER_DOMAIN 16
8168 * find_next_best_node - find the next node to include in a sched_domain
8169 * @node: node whose sched_domain we're building
8170 * @used_nodes: nodes already in the sched_domain
8172 * Find the next node to include in a given scheduling domain. Simply
8173 * finds the closest node not already in the @used_nodes map.
8175 * Should use nodemask_t.
8177 static int find_next_best_node(int node, nodemask_t *used_nodes)
8179 int i, n, val, min_val, best_node = 0;
8183 for (i = 0; i < nr_node_ids; i++) {
8184 /* Start at @node */
8185 n = (node + i) % nr_node_ids;
8187 if (!nr_cpus_node(n))
8190 /* Skip already used nodes */
8191 if (node_isset(n, *used_nodes))
8194 /* Simple min distance search */
8195 val = node_distance(node, n);
8197 if (val < min_val) {
8203 node_set(best_node, *used_nodes);
8208 * sched_domain_node_span - get a cpumask for a node's sched_domain
8209 * @node: node whose cpumask we're constructing
8210 * @span: resulting cpumask
8212 * Given a node, construct a good cpumask for its sched_domain to span. It
8213 * should be one that prevents unnecessary balancing, but also spreads tasks
8216 static void sched_domain_node_span(int node, struct cpumask *span)
8218 nodemask_t used_nodes;
8221 cpumask_clear(span);
8222 nodes_clear(used_nodes);
8224 cpumask_or(span, span, cpumask_of_node(node));
8225 node_set(node, used_nodes);
8227 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
8228 int next_node = find_next_best_node(node, &used_nodes);
8230 cpumask_or(span, span, cpumask_of_node(next_node));
8233 #endif /* CONFIG_NUMA */
8235 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
8238 * The cpus mask in sched_group and sched_domain hangs off the end.
8240 * ( See the the comments in include/linux/sched.h:struct sched_group
8241 * and struct sched_domain. )
8243 struct static_sched_group {
8244 struct sched_group sg;
8245 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
8248 struct static_sched_domain {
8249 struct sched_domain sd;
8250 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
8256 cpumask_var_t domainspan;
8257 cpumask_var_t covered;
8258 cpumask_var_t notcovered;
8260 cpumask_var_t nodemask;
8261 cpumask_var_t this_sibling_map;
8262 cpumask_var_t this_core_map;
8263 cpumask_var_t send_covered;
8264 cpumask_var_t tmpmask;
8265 struct sched_group **sched_group_nodes;
8266 struct root_domain *rd;
8270 sa_sched_groups = 0,
8275 sa_this_sibling_map,
8277 sa_sched_group_nodes,
8287 * SMT sched-domains:
8289 #ifdef CONFIG_SCHED_SMT
8290 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
8291 static DEFINE_PER_CPU(struct static_sched_group, sched_group_cpus);
8294 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
8295 struct sched_group **sg, struct cpumask *unused)
8298 *sg = &per_cpu(sched_group_cpus, cpu).sg;
8301 #endif /* CONFIG_SCHED_SMT */
8304 * multi-core sched-domains:
8306 #ifdef CONFIG_SCHED_MC
8307 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
8308 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
8309 #endif /* CONFIG_SCHED_MC */
8311 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
8313 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
8314 struct sched_group **sg, struct cpumask *mask)
8318 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
8319 group = cpumask_first(mask);
8321 *sg = &per_cpu(sched_group_core, group).sg;
8324 #elif defined(CONFIG_SCHED_MC)
8326 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
8327 struct sched_group **sg, struct cpumask *unused)
8330 *sg = &per_cpu(sched_group_core, cpu).sg;
8335 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
8336 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
8339 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
8340 struct sched_group **sg, struct cpumask *mask)
8343 #ifdef CONFIG_SCHED_MC
8344 cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map);
8345 group = cpumask_first(mask);
8346 #elif defined(CONFIG_SCHED_SMT)
8347 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
8348 group = cpumask_first(mask);
8353 *sg = &per_cpu(sched_group_phys, group).sg;
8359 * The init_sched_build_groups can't handle what we want to do with node
8360 * groups, so roll our own. Now each node has its own list of groups which
8361 * gets dynamically allocated.
8363 static DEFINE_PER_CPU(struct static_sched_domain, node_domains);
8364 static struct sched_group ***sched_group_nodes_bycpu;
8366 static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains);
8367 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
8369 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
8370 struct sched_group **sg,
8371 struct cpumask *nodemask)
8375 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map);
8376 group = cpumask_first(nodemask);
8379 *sg = &per_cpu(sched_group_allnodes, group).sg;
8383 static void init_numa_sched_groups_power(struct sched_group *group_head)
8385 struct sched_group *sg = group_head;
8391 for_each_cpu(j, sched_group_cpus(sg)) {
8392 struct sched_domain *sd;
8394 sd = &per_cpu(phys_domains, j).sd;
8395 if (j != group_first_cpu(sd->groups)) {
8397 * Only add "power" once for each
8403 sg->cpu_power += sd->groups->cpu_power;
8406 } while (sg != group_head);
8409 static int build_numa_sched_groups(struct s_data *d,
8410 const struct cpumask *cpu_map, int num)
8412 struct sched_domain *sd;
8413 struct sched_group *sg, *prev;
8416 cpumask_clear(d->covered);
8417 cpumask_and(d->nodemask, cpumask_of_node(num), cpu_map);
8418 if (cpumask_empty(d->nodemask)) {
8419 d->sched_group_nodes[num] = NULL;
8423 sched_domain_node_span(num, d->domainspan);
8424 cpumask_and(d->domainspan, d->domainspan, cpu_map);
8426 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
8429 printk(KERN_WARNING "Can not alloc domain group for node %d\n",
8433 d->sched_group_nodes[num] = sg;
8435 for_each_cpu(j, d->nodemask) {
8436 sd = &per_cpu(node_domains, j).sd;
8441 cpumask_copy(sched_group_cpus(sg), d->nodemask);
8443 cpumask_or(d->covered, d->covered, d->nodemask);
8446 for (j = 0; j < nr_node_ids; j++) {
8447 n = (num + j) % nr_node_ids;
8448 cpumask_complement(d->notcovered, d->covered);
8449 cpumask_and(d->tmpmask, d->notcovered, cpu_map);
8450 cpumask_and(d->tmpmask, d->tmpmask, d->domainspan);
8451 if (cpumask_empty(d->tmpmask))
8453 cpumask_and(d->tmpmask, d->tmpmask, cpumask_of_node(n));
8454 if (cpumask_empty(d->tmpmask))
8456 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
8460 "Can not alloc domain group for node %d\n", j);
8464 cpumask_copy(sched_group_cpus(sg), d->tmpmask);
8465 sg->next = prev->next;
8466 cpumask_or(d->covered, d->covered, d->tmpmask);
8473 #endif /* CONFIG_NUMA */
8476 /* Free memory allocated for various sched_group structures */
8477 static void free_sched_groups(const struct cpumask *cpu_map,
8478 struct cpumask *nodemask)
8482 for_each_cpu(cpu, cpu_map) {
8483 struct sched_group **sched_group_nodes
8484 = sched_group_nodes_bycpu[cpu];
8486 if (!sched_group_nodes)
8489 for (i = 0; i < nr_node_ids; i++) {
8490 struct sched_group *oldsg, *sg = sched_group_nodes[i];
8492 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
8493 if (cpumask_empty(nodemask))
8503 if (oldsg != sched_group_nodes[i])
8506 kfree(sched_group_nodes);
8507 sched_group_nodes_bycpu[cpu] = NULL;
8510 #else /* !CONFIG_NUMA */
8511 static void free_sched_groups(const struct cpumask *cpu_map,
8512 struct cpumask *nodemask)
8515 #endif /* CONFIG_NUMA */
8518 * Initialize sched groups cpu_power.
8520 * cpu_power indicates the capacity of sched group, which is used while
8521 * distributing the load between different sched groups in a sched domain.
8522 * Typically cpu_power for all the groups in a sched domain will be same unless
8523 * there are asymmetries in the topology. If there are asymmetries, group
8524 * having more cpu_power will pickup more load compared to the group having
8527 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
8529 struct sched_domain *child;
8530 struct sched_group *group;
8534 WARN_ON(!sd || !sd->groups);
8536 if (cpu != group_first_cpu(sd->groups))
8541 sd->groups->cpu_power = 0;
8544 power = SCHED_LOAD_SCALE;
8545 weight = cpumask_weight(sched_domain_span(sd));
8547 * SMT siblings share the power of a single core.
8548 * Usually multiple threads get a better yield out of
8549 * that one core than a single thread would have,
8550 * reflect that in sd->smt_gain.
8552 if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) {
8553 power *= sd->smt_gain;
8555 power >>= SCHED_LOAD_SHIFT;
8557 sd->groups->cpu_power += power;
8562 * Add cpu_power of each child group to this groups cpu_power.
8564 group = child->groups;
8566 sd->groups->cpu_power += group->cpu_power;
8567 group = group->next;
8568 } while (group != child->groups);
8572 * Initializers for schedule domains
8573 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
8576 #ifdef CONFIG_SCHED_DEBUG
8577 # define SD_INIT_NAME(sd, type) sd->name = #type
8579 # define SD_INIT_NAME(sd, type) do { } while (0)
8582 #define SD_INIT(sd, type) sd_init_##type(sd)
8584 #define SD_INIT_FUNC(type) \
8585 static noinline void sd_init_##type(struct sched_domain *sd) \
8587 memset(sd, 0, sizeof(*sd)); \
8588 *sd = SD_##type##_INIT; \
8589 sd->level = SD_LV_##type; \
8590 SD_INIT_NAME(sd, type); \
8595 SD_INIT_FUNC(ALLNODES)
8598 #ifdef CONFIG_SCHED_SMT
8599 SD_INIT_FUNC(SIBLING)
8601 #ifdef CONFIG_SCHED_MC
8605 static int default_relax_domain_level = -1;
8607 static int __init setup_relax_domain_level(char *str)
8611 val = simple_strtoul(str, NULL, 0);
8612 if (val < SD_LV_MAX)
8613 default_relax_domain_level = val;
8617 __setup("relax_domain_level=", setup_relax_domain_level);
8619 static void set_domain_attribute(struct sched_domain *sd,
8620 struct sched_domain_attr *attr)
8624 if (!attr || attr->relax_domain_level < 0) {
8625 if (default_relax_domain_level < 0)
8628 request = default_relax_domain_level;
8630 request = attr->relax_domain_level;
8631 if (request < sd->level) {
8632 /* turn off idle balance on this domain */
8633 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
8635 /* turn on idle balance on this domain */
8636 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
8640 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
8641 const struct cpumask *cpu_map)
8644 case sa_sched_groups:
8645 free_sched_groups(cpu_map, d->tmpmask); /* fall through */
8646 d->sched_group_nodes = NULL;
8648 free_rootdomain(d->rd); /* fall through */
8650 free_cpumask_var(d->tmpmask); /* fall through */
8651 case sa_send_covered:
8652 free_cpumask_var(d->send_covered); /* fall through */
8653 case sa_this_core_map:
8654 free_cpumask_var(d->this_core_map); /* fall through */
8655 case sa_this_sibling_map:
8656 free_cpumask_var(d->this_sibling_map); /* fall through */
8658 free_cpumask_var(d->nodemask); /* fall through */
8659 case sa_sched_group_nodes:
8661 kfree(d->sched_group_nodes); /* fall through */
8663 free_cpumask_var(d->notcovered); /* fall through */
8665 free_cpumask_var(d->covered); /* fall through */
8667 free_cpumask_var(d->domainspan); /* fall through */
8674 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
8675 const struct cpumask *cpu_map)
8678 if (!alloc_cpumask_var(&d->domainspan, GFP_KERNEL))
8680 if (!alloc_cpumask_var(&d->covered, GFP_KERNEL))
8681 return sa_domainspan;
8682 if (!alloc_cpumask_var(&d->notcovered, GFP_KERNEL))
8684 /* Allocate the per-node list of sched groups */
8685 d->sched_group_nodes = kcalloc(nr_node_ids,
8686 sizeof(struct sched_group *), GFP_KERNEL);
8687 if (!d->sched_group_nodes) {
8688 printk(KERN_WARNING "Can not alloc sched group node list\n");
8689 return sa_notcovered;
8691 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = d->sched_group_nodes;
8693 if (!alloc_cpumask_var(&d->nodemask, GFP_KERNEL))
8694 return sa_sched_group_nodes;
8695 if (!alloc_cpumask_var(&d->this_sibling_map, GFP_KERNEL))
8697 if (!alloc_cpumask_var(&d->this_core_map, GFP_KERNEL))
8698 return sa_this_sibling_map;
8699 if (!alloc_cpumask_var(&d->send_covered, GFP_KERNEL))
8700 return sa_this_core_map;
8701 if (!alloc_cpumask_var(&d->tmpmask, GFP_KERNEL))
8702 return sa_send_covered;
8703 d->rd = alloc_rootdomain();
8705 printk(KERN_WARNING "Cannot alloc root domain\n");
8708 return sa_rootdomain;
8711 static struct sched_domain *__build_numa_sched_domains(struct s_data *d,
8712 const struct cpumask *cpu_map, struct sched_domain_attr *attr, int i)
8714 struct sched_domain *sd = NULL;
8716 struct sched_domain *parent;
8719 if (cpumask_weight(cpu_map) >
8720 SD_NODES_PER_DOMAIN * cpumask_weight(d->nodemask)) {
8721 sd = &per_cpu(allnodes_domains, i).sd;
8722 SD_INIT(sd, ALLNODES);
8723 set_domain_attribute(sd, attr);
8724 cpumask_copy(sched_domain_span(sd), cpu_map);
8725 cpu_to_allnodes_group(i, cpu_map, &sd->groups, d->tmpmask);
8730 sd = &per_cpu(node_domains, i).sd;
8732 set_domain_attribute(sd, attr);
8733 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
8734 sd->parent = parent;
8737 cpumask_and(sched_domain_span(sd), sched_domain_span(sd), cpu_map);
8742 static struct sched_domain *__build_cpu_sched_domain(struct s_data *d,
8743 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
8744 struct sched_domain *parent, int i)
8746 struct sched_domain *sd;
8747 sd = &per_cpu(phys_domains, i).sd;
8749 set_domain_attribute(sd, attr);
8750 cpumask_copy(sched_domain_span(sd), d->nodemask);
8751 sd->parent = parent;
8754 cpu_to_phys_group(i, cpu_map, &sd->groups, d->tmpmask);
8758 static struct sched_domain *__build_mc_sched_domain(struct s_data *d,
8759 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
8760 struct sched_domain *parent, int i)
8762 struct sched_domain *sd = parent;
8763 #ifdef CONFIG_SCHED_MC
8764 sd = &per_cpu(core_domains, i).sd;
8766 set_domain_attribute(sd, attr);
8767 cpumask_and(sched_domain_span(sd), cpu_map, cpu_coregroup_mask(i));
8768 sd->parent = parent;
8770 cpu_to_core_group(i, cpu_map, &sd->groups, d->tmpmask);
8775 static struct sched_domain *__build_smt_sched_domain(struct s_data *d,
8776 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
8777 struct sched_domain *parent, int i)
8779 struct sched_domain *sd = parent;
8780 #ifdef CONFIG_SCHED_SMT
8781 sd = &per_cpu(cpu_domains, i).sd;
8782 SD_INIT(sd, SIBLING);
8783 set_domain_attribute(sd, attr);
8784 cpumask_and(sched_domain_span(sd), cpu_map, topology_thread_cpumask(i));
8785 sd->parent = parent;
8787 cpu_to_cpu_group(i, cpu_map, &sd->groups, d->tmpmask);
8792 static void build_sched_groups(struct s_data *d, enum sched_domain_level l,
8793 const struct cpumask *cpu_map, int cpu)
8796 #ifdef CONFIG_SCHED_SMT
8797 case SD_LV_SIBLING: /* set up CPU (sibling) groups */
8798 cpumask_and(d->this_sibling_map, cpu_map,
8799 topology_thread_cpumask(cpu));
8800 if (cpu == cpumask_first(d->this_sibling_map))
8801 init_sched_build_groups(d->this_sibling_map, cpu_map,
8803 d->send_covered, d->tmpmask);
8806 #ifdef CONFIG_SCHED_MC
8807 case SD_LV_MC: /* set up multi-core groups */
8808 cpumask_and(d->this_core_map, cpu_map, cpu_coregroup_mask(cpu));
8809 if (cpu == cpumask_first(d->this_core_map))
8810 init_sched_build_groups(d->this_core_map, cpu_map,
8812 d->send_covered, d->tmpmask);
8815 case SD_LV_CPU: /* set up physical groups */
8816 cpumask_and(d->nodemask, cpumask_of_node(cpu), cpu_map);
8817 if (!cpumask_empty(d->nodemask))
8818 init_sched_build_groups(d->nodemask, cpu_map,
8820 d->send_covered, d->tmpmask);
8823 case SD_LV_ALLNODES:
8824 init_sched_build_groups(cpu_map, cpu_map, &cpu_to_allnodes_group,
8825 d->send_covered, d->tmpmask);
8834 * Build sched domains for a given set of cpus and attach the sched domains
8835 * to the individual cpus
8837 static int __build_sched_domains(const struct cpumask *cpu_map,
8838 struct sched_domain_attr *attr)
8840 enum s_alloc alloc_state = sa_none;
8842 struct sched_domain *sd;
8848 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
8849 if (alloc_state != sa_rootdomain)
8851 alloc_state = sa_sched_groups;
8854 * Set up domains for cpus specified by the cpu_map.
8856 for_each_cpu(i, cpu_map) {
8857 cpumask_and(d.nodemask, cpumask_of_node(cpu_to_node(i)),
8860 sd = __build_numa_sched_domains(&d, cpu_map, attr, i);
8861 sd = __build_cpu_sched_domain(&d, cpu_map, attr, sd, i);
8862 sd = __build_mc_sched_domain(&d, cpu_map, attr, sd, i);
8863 sd = __build_smt_sched_domain(&d, cpu_map, attr, sd, i);
8866 for_each_cpu(i, cpu_map) {
8867 build_sched_groups(&d, SD_LV_SIBLING, cpu_map, i);
8868 build_sched_groups(&d, SD_LV_MC, cpu_map, i);
8871 /* Set up physical groups */
8872 for (i = 0; i < nr_node_ids; i++)
8873 build_sched_groups(&d, SD_LV_CPU, cpu_map, i);
8876 /* Set up node groups */
8878 build_sched_groups(&d, SD_LV_ALLNODES, cpu_map, 0);
8880 for (i = 0; i < nr_node_ids; i++)
8881 if (build_numa_sched_groups(&d, cpu_map, i))
8885 /* Calculate CPU power for physical packages and nodes */
8886 #ifdef CONFIG_SCHED_SMT
8887 for_each_cpu(i, cpu_map) {
8888 sd = &per_cpu(cpu_domains, i).sd;
8889 init_sched_groups_power(i, sd);
8892 #ifdef CONFIG_SCHED_MC
8893 for_each_cpu(i, cpu_map) {
8894 sd = &per_cpu(core_domains, i).sd;
8895 init_sched_groups_power(i, sd);
8899 for_each_cpu(i, cpu_map) {
8900 sd = &per_cpu(phys_domains, i).sd;
8901 init_sched_groups_power(i, sd);
8905 for (i = 0; i < nr_node_ids; i++)
8906 init_numa_sched_groups_power(d.sched_group_nodes[i]);
8908 if (d.sd_allnodes) {
8909 struct sched_group *sg;
8911 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
8913 init_numa_sched_groups_power(sg);
8917 /* Attach the domains */
8918 for_each_cpu(i, cpu_map) {
8919 #ifdef CONFIG_SCHED_SMT
8920 sd = &per_cpu(cpu_domains, i).sd;
8921 #elif defined(CONFIG_SCHED_MC)
8922 sd = &per_cpu(core_domains, i).sd;
8924 sd = &per_cpu(phys_domains, i).sd;
8926 cpu_attach_domain(sd, d.rd, i);
8929 d.sched_group_nodes = NULL; /* don't free this we still need it */
8930 __free_domain_allocs(&d, sa_tmpmask, cpu_map);
8934 __free_domain_allocs(&d, alloc_state, cpu_map);
8938 static int build_sched_domains(const struct cpumask *cpu_map)
8940 return __build_sched_domains(cpu_map, NULL);
8943 static cpumask_var_t *doms_cur; /* current sched domains */
8944 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
8945 static struct sched_domain_attr *dattr_cur;
8946 /* attribues of custom domains in 'doms_cur' */
8949 * Special case: If a kmalloc of a doms_cur partition (array of
8950 * cpumask) fails, then fallback to a single sched domain,
8951 * as determined by the single cpumask fallback_doms.
8953 static cpumask_var_t fallback_doms;
8956 * arch_update_cpu_topology lets virtualized architectures update the
8957 * cpu core maps. It is supposed to return 1 if the topology changed
8958 * or 0 if it stayed the same.
8960 int __attribute__((weak)) arch_update_cpu_topology(void)
8965 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
8968 cpumask_var_t *doms;
8970 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
8973 for (i = 0; i < ndoms; i++) {
8974 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
8975 free_sched_domains(doms, i);
8982 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
8985 for (i = 0; i < ndoms; i++)
8986 free_cpumask_var(doms[i]);
8991 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
8992 * For now this just excludes isolated cpus, but could be used to
8993 * exclude other special cases in the future.
8995 static int arch_init_sched_domains(const struct cpumask *cpu_map)
8999 arch_update_cpu_topology();
9001 doms_cur = alloc_sched_domains(ndoms_cur);
9003 doms_cur = &fallback_doms;
9004 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
9006 err = build_sched_domains(doms_cur[0]);
9007 register_sched_domain_sysctl();
9012 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
9013 struct cpumask *tmpmask)
9015 free_sched_groups(cpu_map, tmpmask);
9019 * Detach sched domains from a group of cpus specified in cpu_map
9020 * These cpus will now be attached to the NULL domain
9022 static void detach_destroy_domains(const struct cpumask *cpu_map)
9024 /* Save because hotplug lock held. */
9025 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
9028 for_each_cpu(i, cpu_map)
9029 cpu_attach_domain(NULL, &def_root_domain, i);
9030 synchronize_sched();
9031 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
9034 /* handle null as "default" */
9035 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
9036 struct sched_domain_attr *new, int idx_new)
9038 struct sched_domain_attr tmp;
9045 return !memcmp(cur ? (cur + idx_cur) : &tmp,
9046 new ? (new + idx_new) : &tmp,
9047 sizeof(struct sched_domain_attr));
9051 * Partition sched domains as specified by the 'ndoms_new'
9052 * cpumasks in the array doms_new[] of cpumasks. This compares
9053 * doms_new[] to the current sched domain partitioning, doms_cur[].
9054 * It destroys each deleted domain and builds each new domain.
9056 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
9057 * The masks don't intersect (don't overlap.) We should setup one
9058 * sched domain for each mask. CPUs not in any of the cpumasks will
9059 * not be load balanced. If the same cpumask appears both in the
9060 * current 'doms_cur' domains and in the new 'doms_new', we can leave
9063 * The passed in 'doms_new' should be allocated using
9064 * alloc_sched_domains. This routine takes ownership of it and will
9065 * free_sched_domains it when done with it. If the caller failed the
9066 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
9067 * and partition_sched_domains() will fallback to the single partition
9068 * 'fallback_doms', it also forces the domains to be rebuilt.
9070 * If doms_new == NULL it will be replaced with cpu_online_mask.
9071 * ndoms_new == 0 is a special case for destroying existing domains,
9072 * and it will not create the default domain.
9074 * Call with hotplug lock held
9076 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
9077 struct sched_domain_attr *dattr_new)
9082 mutex_lock(&sched_domains_mutex);
9084 /* always unregister in case we don't destroy any domains */
9085 unregister_sched_domain_sysctl();
9087 /* Let architecture update cpu core mappings. */
9088 new_topology = arch_update_cpu_topology();
9090 n = doms_new ? ndoms_new : 0;
9092 /* Destroy deleted domains */
9093 for (i = 0; i < ndoms_cur; i++) {
9094 for (j = 0; j < n && !new_topology; j++) {
9095 if (cpumask_equal(doms_cur[i], doms_new[j])
9096 && dattrs_equal(dattr_cur, i, dattr_new, j))
9099 /* no match - a current sched domain not in new doms_new[] */
9100 detach_destroy_domains(doms_cur[i]);
9105 if (doms_new == NULL) {
9107 doms_new = &fallback_doms;
9108 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
9109 WARN_ON_ONCE(dattr_new);
9112 /* Build new domains */
9113 for (i = 0; i < ndoms_new; i++) {
9114 for (j = 0; j < ndoms_cur && !new_topology; j++) {
9115 if (cpumask_equal(doms_new[i], doms_cur[j])
9116 && dattrs_equal(dattr_new, i, dattr_cur, j))
9119 /* no match - add a new doms_new */
9120 __build_sched_domains(doms_new[i],
9121 dattr_new ? dattr_new + i : NULL);
9126 /* Remember the new sched domains */
9127 if (doms_cur != &fallback_doms)
9128 free_sched_domains(doms_cur, ndoms_cur);
9129 kfree(dattr_cur); /* kfree(NULL) is safe */
9130 doms_cur = doms_new;
9131 dattr_cur = dattr_new;
9132 ndoms_cur = ndoms_new;
9134 register_sched_domain_sysctl();
9136 mutex_unlock(&sched_domains_mutex);
9139 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
9140 static void arch_reinit_sched_domains(void)
9144 /* Destroy domains first to force the rebuild */
9145 partition_sched_domains(0, NULL, NULL);
9147 rebuild_sched_domains();
9151 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
9153 unsigned int level = 0;
9155 if (sscanf(buf, "%u", &level) != 1)
9159 * level is always be positive so don't check for
9160 * level < POWERSAVINGS_BALANCE_NONE which is 0
9161 * What happens on 0 or 1 byte write,
9162 * need to check for count as well?
9165 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
9169 sched_smt_power_savings = level;
9171 sched_mc_power_savings = level;
9173 arch_reinit_sched_domains();
9178 #ifdef CONFIG_SCHED_MC
9179 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
9182 return sprintf(page, "%u\n", sched_mc_power_savings);
9184 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
9185 const char *buf, size_t count)
9187 return sched_power_savings_store(buf, count, 0);
9189 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
9190 sched_mc_power_savings_show,
9191 sched_mc_power_savings_store);
9194 #ifdef CONFIG_SCHED_SMT
9195 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
9198 return sprintf(page, "%u\n", sched_smt_power_savings);
9200 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
9201 const char *buf, size_t count)
9203 return sched_power_savings_store(buf, count, 1);
9205 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
9206 sched_smt_power_savings_show,
9207 sched_smt_power_savings_store);
9210 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
9214 #ifdef CONFIG_SCHED_SMT
9216 err = sysfs_create_file(&cls->kset.kobj,
9217 &attr_sched_smt_power_savings.attr);
9219 #ifdef CONFIG_SCHED_MC
9220 if (!err && mc_capable())
9221 err = sysfs_create_file(&cls->kset.kobj,
9222 &attr_sched_mc_power_savings.attr);
9226 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
9228 #ifndef CONFIG_CPUSETS
9230 * Add online and remove offline CPUs from the scheduler domains.
9231 * When cpusets are enabled they take over this function.
9233 static int update_sched_domains(struct notifier_block *nfb,
9234 unsigned long action, void *hcpu)
9238 case CPU_ONLINE_FROZEN:
9239 case CPU_DOWN_PREPARE:
9240 case CPU_DOWN_PREPARE_FROZEN:
9241 case CPU_DOWN_FAILED:
9242 case CPU_DOWN_FAILED_FROZEN:
9243 partition_sched_domains(1, NULL, NULL);
9252 static int update_runtime(struct notifier_block *nfb,
9253 unsigned long action, void *hcpu)
9255 int cpu = (int)(long)hcpu;
9258 case CPU_DOWN_PREPARE:
9259 case CPU_DOWN_PREPARE_FROZEN:
9260 disable_runtime(cpu_rq(cpu));
9263 case CPU_DOWN_FAILED:
9264 case CPU_DOWN_FAILED_FROZEN:
9266 case CPU_ONLINE_FROZEN:
9267 enable_runtime(cpu_rq(cpu));
9275 void __init sched_init_smp(void)
9277 cpumask_var_t non_isolated_cpus;
9279 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
9280 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
9282 #if defined(CONFIG_NUMA)
9283 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
9285 BUG_ON(sched_group_nodes_bycpu == NULL);
9288 mutex_lock(&sched_domains_mutex);
9289 arch_init_sched_domains(cpu_active_mask);
9290 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
9291 if (cpumask_empty(non_isolated_cpus))
9292 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
9293 mutex_unlock(&sched_domains_mutex);
9296 #ifndef CONFIG_CPUSETS
9297 /* XXX: Theoretical race here - CPU may be hotplugged now */
9298 hotcpu_notifier(update_sched_domains, 0);
9301 /* RT runtime code needs to handle some hotplug events */
9302 hotcpu_notifier(update_runtime, 0);
9306 /* Move init over to a non-isolated CPU */
9307 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
9309 sched_init_granularity();
9310 free_cpumask_var(non_isolated_cpus);
9312 init_sched_rt_class();
9315 void __init sched_init_smp(void)
9317 sched_init_granularity();
9319 #endif /* CONFIG_SMP */
9321 const_debug unsigned int sysctl_timer_migration = 1;
9323 int in_sched_functions(unsigned long addr)
9325 return in_lock_functions(addr) ||
9326 (addr >= (unsigned long)__sched_text_start
9327 && addr < (unsigned long)__sched_text_end);
9330 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
9332 cfs_rq->tasks_timeline = RB_ROOT;
9333 INIT_LIST_HEAD(&cfs_rq->tasks);
9334 #ifdef CONFIG_FAIR_GROUP_SCHED
9337 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
9340 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
9342 struct rt_prio_array *array;
9345 array = &rt_rq->active;
9346 for (i = 0; i < MAX_RT_PRIO; i++) {
9347 INIT_LIST_HEAD(array->queue + i);
9348 __clear_bit(i, array->bitmap);
9350 /* delimiter for bitsearch: */
9351 __set_bit(MAX_RT_PRIO, array->bitmap);
9353 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
9354 rt_rq->highest_prio.curr = MAX_RT_PRIO;
9356 rt_rq->highest_prio.next = MAX_RT_PRIO;
9360 rt_rq->rt_nr_migratory = 0;
9361 rt_rq->overloaded = 0;
9362 plist_head_init(&rt_rq->pushable_tasks, &rq->lock);
9366 rt_rq->rt_throttled = 0;
9367 rt_rq->rt_runtime = 0;
9368 spin_lock_init(&rt_rq->rt_runtime_lock);
9370 #ifdef CONFIG_RT_GROUP_SCHED
9371 rt_rq->rt_nr_boosted = 0;
9376 #ifdef CONFIG_FAIR_GROUP_SCHED
9377 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
9378 struct sched_entity *se, int cpu, int add,
9379 struct sched_entity *parent)
9381 struct rq *rq = cpu_rq(cpu);
9382 tg->cfs_rq[cpu] = cfs_rq;
9383 init_cfs_rq(cfs_rq, rq);
9386 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
9389 /* se could be NULL for init_task_group */
9394 se->cfs_rq = &rq->cfs;
9396 se->cfs_rq = parent->my_q;
9399 se->load.weight = tg->shares;
9400 se->load.inv_weight = 0;
9401 se->parent = parent;
9405 #ifdef CONFIG_RT_GROUP_SCHED
9406 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
9407 struct sched_rt_entity *rt_se, int cpu, int add,
9408 struct sched_rt_entity *parent)
9410 struct rq *rq = cpu_rq(cpu);
9412 tg->rt_rq[cpu] = rt_rq;
9413 init_rt_rq(rt_rq, rq);
9415 rt_rq->rt_se = rt_se;
9416 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
9418 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
9420 tg->rt_se[cpu] = rt_se;
9425 rt_se->rt_rq = &rq->rt;
9427 rt_se->rt_rq = parent->my_q;
9429 rt_se->my_q = rt_rq;
9430 rt_se->parent = parent;
9431 INIT_LIST_HEAD(&rt_se->run_list);
9435 void __init sched_init(void)
9438 unsigned long alloc_size = 0, ptr;
9440 #ifdef CONFIG_FAIR_GROUP_SCHED
9441 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
9443 #ifdef CONFIG_RT_GROUP_SCHED
9444 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
9446 #ifdef CONFIG_USER_SCHED
9449 #ifdef CONFIG_CPUMASK_OFFSTACK
9450 alloc_size += num_possible_cpus() * cpumask_size();
9453 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
9455 #ifdef CONFIG_FAIR_GROUP_SCHED
9456 init_task_group.se = (struct sched_entity **)ptr;
9457 ptr += nr_cpu_ids * sizeof(void **);
9459 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
9460 ptr += nr_cpu_ids * sizeof(void **);
9462 #ifdef CONFIG_USER_SCHED
9463 root_task_group.se = (struct sched_entity **)ptr;
9464 ptr += nr_cpu_ids * sizeof(void **);
9466 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
9467 ptr += nr_cpu_ids * sizeof(void **);
9468 #endif /* CONFIG_USER_SCHED */
9469 #endif /* CONFIG_FAIR_GROUP_SCHED */
9470 #ifdef CONFIG_RT_GROUP_SCHED
9471 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
9472 ptr += nr_cpu_ids * sizeof(void **);
9474 init_task_group.rt_rq = (struct rt_rq **)ptr;
9475 ptr += nr_cpu_ids * sizeof(void **);
9477 #ifdef CONFIG_USER_SCHED
9478 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
9479 ptr += nr_cpu_ids * sizeof(void **);
9481 root_task_group.rt_rq = (struct rt_rq **)ptr;
9482 ptr += nr_cpu_ids * sizeof(void **);
9483 #endif /* CONFIG_USER_SCHED */
9484 #endif /* CONFIG_RT_GROUP_SCHED */
9485 #ifdef CONFIG_CPUMASK_OFFSTACK
9486 for_each_possible_cpu(i) {
9487 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
9488 ptr += cpumask_size();
9490 #endif /* CONFIG_CPUMASK_OFFSTACK */
9494 init_defrootdomain();
9497 init_rt_bandwidth(&def_rt_bandwidth,
9498 global_rt_period(), global_rt_runtime());
9500 #ifdef CONFIG_RT_GROUP_SCHED
9501 init_rt_bandwidth(&init_task_group.rt_bandwidth,
9502 global_rt_period(), global_rt_runtime());
9503 #ifdef CONFIG_USER_SCHED
9504 init_rt_bandwidth(&root_task_group.rt_bandwidth,
9505 global_rt_period(), RUNTIME_INF);
9506 #endif /* CONFIG_USER_SCHED */
9507 #endif /* CONFIG_RT_GROUP_SCHED */
9509 #ifdef CONFIG_GROUP_SCHED
9510 list_add(&init_task_group.list, &task_groups);
9511 INIT_LIST_HEAD(&init_task_group.children);
9513 #ifdef CONFIG_USER_SCHED
9514 INIT_LIST_HEAD(&root_task_group.children);
9515 init_task_group.parent = &root_task_group;
9516 list_add(&init_task_group.siblings, &root_task_group.children);
9517 #endif /* CONFIG_USER_SCHED */
9518 #endif /* CONFIG_GROUP_SCHED */
9520 #if defined CONFIG_FAIR_GROUP_SCHED && defined CONFIG_SMP
9521 update_shares_data = __alloc_percpu(nr_cpu_ids * sizeof(unsigned long),
9522 __alignof__(unsigned long));
9524 for_each_possible_cpu(i) {
9528 spin_lock_init(&rq->lock);
9530 rq->calc_load_active = 0;
9531 rq->calc_load_update = jiffies + LOAD_FREQ;
9532 init_cfs_rq(&rq->cfs, rq);
9533 init_rt_rq(&rq->rt, rq);
9534 #ifdef CONFIG_FAIR_GROUP_SCHED
9535 init_task_group.shares = init_task_group_load;
9536 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
9537 #ifdef CONFIG_CGROUP_SCHED
9539 * How much cpu bandwidth does init_task_group get?
9541 * In case of task-groups formed thr' the cgroup filesystem, it
9542 * gets 100% of the cpu resources in the system. This overall
9543 * system cpu resource is divided among the tasks of
9544 * init_task_group and its child task-groups in a fair manner,
9545 * based on each entity's (task or task-group's) weight
9546 * (se->load.weight).
9548 * In other words, if init_task_group has 10 tasks of weight
9549 * 1024) and two child groups A0 and A1 (of weight 1024 each),
9550 * then A0's share of the cpu resource is:
9552 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
9554 * We achieve this by letting init_task_group's tasks sit
9555 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
9557 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
9558 #elif defined CONFIG_USER_SCHED
9559 root_task_group.shares = NICE_0_LOAD;
9560 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL);
9562 * In case of task-groups formed thr' the user id of tasks,
9563 * init_task_group represents tasks belonging to root user.
9564 * Hence it forms a sibling of all subsequent groups formed.
9565 * In this case, init_task_group gets only a fraction of overall
9566 * system cpu resource, based on the weight assigned to root
9567 * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished
9568 * by letting tasks of init_task_group sit in a separate cfs_rq
9569 * (init_tg_cfs_rq) and having one entity represent this group of
9570 * tasks in rq->cfs (i.e init_task_group->se[] != NULL).
9572 init_tg_cfs_entry(&init_task_group,
9573 &per_cpu(init_tg_cfs_rq, i),
9574 &per_cpu(init_sched_entity, i), i, 1,
9575 root_task_group.se[i]);
9578 #endif /* CONFIG_FAIR_GROUP_SCHED */
9580 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
9581 #ifdef CONFIG_RT_GROUP_SCHED
9582 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
9583 #ifdef CONFIG_CGROUP_SCHED
9584 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
9585 #elif defined CONFIG_USER_SCHED
9586 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL);
9587 init_tg_rt_entry(&init_task_group,
9588 &per_cpu(init_rt_rq, i),
9589 &per_cpu(init_sched_rt_entity, i), i, 1,
9590 root_task_group.rt_se[i]);
9594 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
9595 rq->cpu_load[j] = 0;
9599 rq->post_schedule = 0;
9600 rq->active_balance = 0;
9601 rq->next_balance = jiffies;
9605 rq->migration_thread = NULL;
9607 rq->avg_idle = 2*sysctl_sched_migration_cost;
9608 INIT_LIST_HEAD(&rq->migration_queue);
9609 rq_attach_root(rq, &def_root_domain);
9612 atomic_set(&rq->nr_iowait, 0);
9615 set_load_weight(&init_task);
9617 #ifdef CONFIG_PREEMPT_NOTIFIERS
9618 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
9622 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
9625 #ifdef CONFIG_RT_MUTEXES
9626 plist_head_init(&init_task.pi_waiters, &init_task.pi_lock);
9630 * The boot idle thread does lazy MMU switching as well:
9632 atomic_inc(&init_mm.mm_count);
9633 enter_lazy_tlb(&init_mm, current);
9636 * Make us the idle thread. Technically, schedule() should not be
9637 * called from this thread, however somewhere below it might be,
9638 * but because we are the idle thread, we just pick up running again
9639 * when this runqueue becomes "idle".
9641 init_idle(current, smp_processor_id());
9643 calc_load_update = jiffies + LOAD_FREQ;
9646 * During early bootup we pretend to be a normal task:
9648 current->sched_class = &fair_sched_class;
9650 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
9651 zalloc_cpumask_var(&nohz_cpu_mask, GFP_NOWAIT);
9654 zalloc_cpumask_var(&nohz.cpu_mask, GFP_NOWAIT);
9655 alloc_cpumask_var(&nohz.ilb_grp_nohz_mask, GFP_NOWAIT);
9657 /* May be allocated at isolcpus cmdline parse time */
9658 if (cpu_isolated_map == NULL)
9659 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
9664 scheduler_running = 1;
9667 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
9668 static inline int preempt_count_equals(int preempt_offset)
9670 int nested = preempt_count() & ~PREEMPT_ACTIVE;
9672 return (nested == PREEMPT_INATOMIC_BASE + preempt_offset);
9675 void __might_sleep(char *file, int line, int preempt_offset)
9678 static unsigned long prev_jiffy; /* ratelimiting */
9680 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
9681 system_state != SYSTEM_RUNNING || oops_in_progress)
9683 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
9685 prev_jiffy = jiffies;
9688 "BUG: sleeping function called from invalid context at %s:%d\n",
9691 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
9692 in_atomic(), irqs_disabled(),
9693 current->pid, current->comm);
9695 debug_show_held_locks(current);
9696 if (irqs_disabled())
9697 print_irqtrace_events(current);
9701 EXPORT_SYMBOL(__might_sleep);
9704 #ifdef CONFIG_MAGIC_SYSRQ
9705 static void normalize_task(struct rq *rq, struct task_struct *p)
9709 update_rq_clock(rq);
9710 on_rq = p->se.on_rq;
9712 deactivate_task(rq, p, 0);
9713 __setscheduler(rq, p, SCHED_NORMAL, 0);
9715 activate_task(rq, p, 0);
9716 resched_task(rq->curr);
9720 void normalize_rt_tasks(void)
9722 struct task_struct *g, *p;
9723 unsigned long flags;
9726 read_lock_irqsave(&tasklist_lock, flags);
9727 do_each_thread(g, p) {
9729 * Only normalize user tasks:
9734 p->se.exec_start = 0;
9735 #ifdef CONFIG_SCHEDSTATS
9736 p->se.wait_start = 0;
9737 p->se.sleep_start = 0;
9738 p->se.block_start = 0;
9743 * Renice negative nice level userspace
9746 if (TASK_NICE(p) < 0 && p->mm)
9747 set_user_nice(p, 0);
9751 spin_lock(&p->pi_lock);
9752 rq = __task_rq_lock(p);
9754 normalize_task(rq, p);
9756 __task_rq_unlock(rq);
9757 spin_unlock(&p->pi_lock);
9758 } while_each_thread(g, p);
9760 read_unlock_irqrestore(&tasklist_lock, flags);
9763 #endif /* CONFIG_MAGIC_SYSRQ */
9767 * These functions are only useful for the IA64 MCA handling.
9769 * They can only be called when the whole system has been
9770 * stopped - every CPU needs to be quiescent, and no scheduling
9771 * activity can take place. Using them for anything else would
9772 * be a serious bug, and as a result, they aren't even visible
9773 * under any other configuration.
9777 * curr_task - return the current task for a given cpu.
9778 * @cpu: the processor in question.
9780 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
9782 struct task_struct *curr_task(int cpu)
9784 return cpu_curr(cpu);
9788 * set_curr_task - set the current task for a given cpu.
9789 * @cpu: the processor in question.
9790 * @p: the task pointer to set.
9792 * Description: This function must only be used when non-maskable interrupts
9793 * are serviced on a separate stack. It allows the architecture to switch the
9794 * notion of the current task on a cpu in a non-blocking manner. This function
9795 * must be called with all CPU's synchronized, and interrupts disabled, the
9796 * and caller must save the original value of the current task (see
9797 * curr_task() above) and restore that value before reenabling interrupts and
9798 * re-starting the system.
9800 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
9802 void set_curr_task(int cpu, struct task_struct *p)
9809 #ifdef CONFIG_FAIR_GROUP_SCHED
9810 static void free_fair_sched_group(struct task_group *tg)
9814 for_each_possible_cpu(i) {
9816 kfree(tg->cfs_rq[i]);
9826 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
9828 struct cfs_rq *cfs_rq;
9829 struct sched_entity *se;
9833 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
9836 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
9840 tg->shares = NICE_0_LOAD;
9842 for_each_possible_cpu(i) {
9845 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
9846 GFP_KERNEL, cpu_to_node(i));
9850 se = kzalloc_node(sizeof(struct sched_entity),
9851 GFP_KERNEL, cpu_to_node(i));
9855 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
9864 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
9866 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
9867 &cpu_rq(cpu)->leaf_cfs_rq_list);
9870 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
9872 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
9874 #else /* !CONFG_FAIR_GROUP_SCHED */
9875 static inline void free_fair_sched_group(struct task_group *tg)
9880 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
9885 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
9889 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
9892 #endif /* CONFIG_FAIR_GROUP_SCHED */
9894 #ifdef CONFIG_RT_GROUP_SCHED
9895 static void free_rt_sched_group(struct task_group *tg)
9899 destroy_rt_bandwidth(&tg->rt_bandwidth);
9901 for_each_possible_cpu(i) {
9903 kfree(tg->rt_rq[i]);
9905 kfree(tg->rt_se[i]);
9913 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
9915 struct rt_rq *rt_rq;
9916 struct sched_rt_entity *rt_se;
9920 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
9923 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
9927 init_rt_bandwidth(&tg->rt_bandwidth,
9928 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
9930 for_each_possible_cpu(i) {
9933 rt_rq = kzalloc_node(sizeof(struct rt_rq),
9934 GFP_KERNEL, cpu_to_node(i));
9938 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
9939 GFP_KERNEL, cpu_to_node(i));
9943 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
9952 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
9954 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
9955 &cpu_rq(cpu)->leaf_rt_rq_list);
9958 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
9960 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
9962 #else /* !CONFIG_RT_GROUP_SCHED */
9963 static inline void free_rt_sched_group(struct task_group *tg)
9968 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
9973 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
9977 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
9980 #endif /* CONFIG_RT_GROUP_SCHED */
9982 #ifdef CONFIG_GROUP_SCHED
9983 static void free_sched_group(struct task_group *tg)
9985 free_fair_sched_group(tg);
9986 free_rt_sched_group(tg);
9990 /* allocate runqueue etc for a new task group */
9991 struct task_group *sched_create_group(struct task_group *parent)
9993 struct task_group *tg;
9994 unsigned long flags;
9997 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
9999 return ERR_PTR(-ENOMEM);
10001 if (!alloc_fair_sched_group(tg, parent))
10004 if (!alloc_rt_sched_group(tg, parent))
10007 spin_lock_irqsave(&task_group_lock, flags);
10008 for_each_possible_cpu(i) {
10009 register_fair_sched_group(tg, i);
10010 register_rt_sched_group(tg, i);
10012 list_add_rcu(&tg->list, &task_groups);
10014 WARN_ON(!parent); /* root should already exist */
10016 tg->parent = parent;
10017 INIT_LIST_HEAD(&tg->children);
10018 list_add_rcu(&tg->siblings, &parent->children);
10019 spin_unlock_irqrestore(&task_group_lock, flags);
10024 free_sched_group(tg);
10025 return ERR_PTR(-ENOMEM);
10028 /* rcu callback to free various structures associated with a task group */
10029 static void free_sched_group_rcu(struct rcu_head *rhp)
10031 /* now it should be safe to free those cfs_rqs */
10032 free_sched_group(container_of(rhp, struct task_group, rcu));
10035 /* Destroy runqueue etc associated with a task group */
10036 void sched_destroy_group(struct task_group *tg)
10038 unsigned long flags;
10041 spin_lock_irqsave(&task_group_lock, flags);
10042 for_each_possible_cpu(i) {
10043 unregister_fair_sched_group(tg, i);
10044 unregister_rt_sched_group(tg, i);
10046 list_del_rcu(&tg->list);
10047 list_del_rcu(&tg->siblings);
10048 spin_unlock_irqrestore(&task_group_lock, flags);
10050 /* wait for possible concurrent references to cfs_rqs complete */
10051 call_rcu(&tg->rcu, free_sched_group_rcu);
10054 /* change task's runqueue when it moves between groups.
10055 * The caller of this function should have put the task in its new group
10056 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
10057 * reflect its new group.
10059 void sched_move_task(struct task_struct *tsk)
10061 int on_rq, running;
10062 unsigned long flags;
10065 rq = task_rq_lock(tsk, &flags);
10067 update_rq_clock(rq);
10069 running = task_current(rq, tsk);
10070 on_rq = tsk->se.on_rq;
10073 dequeue_task(rq, tsk, 0);
10074 if (unlikely(running))
10075 tsk->sched_class->put_prev_task(rq, tsk);
10077 set_task_rq(tsk, task_cpu(tsk));
10079 #ifdef CONFIG_FAIR_GROUP_SCHED
10080 if (tsk->sched_class->moved_group)
10081 tsk->sched_class->moved_group(tsk);
10084 if (unlikely(running))
10085 tsk->sched_class->set_curr_task(rq);
10087 enqueue_task(rq, tsk, 0);
10089 task_rq_unlock(rq, &flags);
10091 #endif /* CONFIG_GROUP_SCHED */
10093 #ifdef CONFIG_FAIR_GROUP_SCHED
10094 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
10096 struct cfs_rq *cfs_rq = se->cfs_rq;
10101 dequeue_entity(cfs_rq, se, 0);
10103 se->load.weight = shares;
10104 se->load.inv_weight = 0;
10107 enqueue_entity(cfs_rq, se, 0);
10110 static void set_se_shares(struct sched_entity *se, unsigned long shares)
10112 struct cfs_rq *cfs_rq = se->cfs_rq;
10113 struct rq *rq = cfs_rq->rq;
10114 unsigned long flags;
10116 spin_lock_irqsave(&rq->lock, flags);
10117 __set_se_shares(se, shares);
10118 spin_unlock_irqrestore(&rq->lock, flags);
10121 static DEFINE_MUTEX(shares_mutex);
10123 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
10126 unsigned long flags;
10129 * We can't change the weight of the root cgroup.
10134 if (shares < MIN_SHARES)
10135 shares = MIN_SHARES;
10136 else if (shares > MAX_SHARES)
10137 shares = MAX_SHARES;
10139 mutex_lock(&shares_mutex);
10140 if (tg->shares == shares)
10143 spin_lock_irqsave(&task_group_lock, flags);
10144 for_each_possible_cpu(i)
10145 unregister_fair_sched_group(tg, i);
10146 list_del_rcu(&tg->siblings);
10147 spin_unlock_irqrestore(&task_group_lock, flags);
10149 /* wait for any ongoing reference to this group to finish */
10150 synchronize_sched();
10153 * Now we are free to modify the group's share on each cpu
10154 * w/o tripping rebalance_share or load_balance_fair.
10156 tg->shares = shares;
10157 for_each_possible_cpu(i) {
10159 * force a rebalance
10161 cfs_rq_set_shares(tg->cfs_rq[i], 0);
10162 set_se_shares(tg->se[i], shares);
10166 * Enable load balance activity on this group, by inserting it back on
10167 * each cpu's rq->leaf_cfs_rq_list.
10169 spin_lock_irqsave(&task_group_lock, flags);
10170 for_each_possible_cpu(i)
10171 register_fair_sched_group(tg, i);
10172 list_add_rcu(&tg->siblings, &tg->parent->children);
10173 spin_unlock_irqrestore(&task_group_lock, flags);
10175 mutex_unlock(&shares_mutex);
10179 unsigned long sched_group_shares(struct task_group *tg)
10185 #ifdef CONFIG_RT_GROUP_SCHED
10187 * Ensure that the real time constraints are schedulable.
10189 static DEFINE_MUTEX(rt_constraints_mutex);
10191 static unsigned long to_ratio(u64 period, u64 runtime)
10193 if (runtime == RUNTIME_INF)
10196 return div64_u64(runtime << 20, period);
10199 /* Must be called with tasklist_lock held */
10200 static inline int tg_has_rt_tasks(struct task_group *tg)
10202 struct task_struct *g, *p;
10204 do_each_thread(g, p) {
10205 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
10207 } while_each_thread(g, p);
10212 struct rt_schedulable_data {
10213 struct task_group *tg;
10218 static int tg_schedulable(struct task_group *tg, void *data)
10220 struct rt_schedulable_data *d = data;
10221 struct task_group *child;
10222 unsigned long total, sum = 0;
10223 u64 period, runtime;
10225 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
10226 runtime = tg->rt_bandwidth.rt_runtime;
10229 period = d->rt_period;
10230 runtime = d->rt_runtime;
10233 #ifdef CONFIG_USER_SCHED
10234 if (tg == &root_task_group) {
10235 period = global_rt_period();
10236 runtime = global_rt_runtime();
10241 * Cannot have more runtime than the period.
10243 if (runtime > period && runtime != RUNTIME_INF)
10247 * Ensure we don't starve existing RT tasks.
10249 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
10252 total = to_ratio(period, runtime);
10255 * Nobody can have more than the global setting allows.
10257 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
10261 * The sum of our children's runtime should not exceed our own.
10263 list_for_each_entry_rcu(child, &tg->children, siblings) {
10264 period = ktime_to_ns(child->rt_bandwidth.rt_period);
10265 runtime = child->rt_bandwidth.rt_runtime;
10267 if (child == d->tg) {
10268 period = d->rt_period;
10269 runtime = d->rt_runtime;
10272 sum += to_ratio(period, runtime);
10281 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
10283 struct rt_schedulable_data data = {
10285 .rt_period = period,
10286 .rt_runtime = runtime,
10289 return walk_tg_tree(tg_schedulable, tg_nop, &data);
10292 static int tg_set_bandwidth(struct task_group *tg,
10293 u64 rt_period, u64 rt_runtime)
10297 mutex_lock(&rt_constraints_mutex);
10298 read_lock(&tasklist_lock);
10299 err = __rt_schedulable(tg, rt_period, rt_runtime);
10303 spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
10304 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
10305 tg->rt_bandwidth.rt_runtime = rt_runtime;
10307 for_each_possible_cpu(i) {
10308 struct rt_rq *rt_rq = tg->rt_rq[i];
10310 spin_lock(&rt_rq->rt_runtime_lock);
10311 rt_rq->rt_runtime = rt_runtime;
10312 spin_unlock(&rt_rq->rt_runtime_lock);
10314 spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
10316 read_unlock(&tasklist_lock);
10317 mutex_unlock(&rt_constraints_mutex);
10322 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
10324 u64 rt_runtime, rt_period;
10326 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
10327 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
10328 if (rt_runtime_us < 0)
10329 rt_runtime = RUNTIME_INF;
10331 return tg_set_bandwidth(tg, rt_period, rt_runtime);
10334 long sched_group_rt_runtime(struct task_group *tg)
10338 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
10341 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
10342 do_div(rt_runtime_us, NSEC_PER_USEC);
10343 return rt_runtime_us;
10346 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
10348 u64 rt_runtime, rt_period;
10350 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
10351 rt_runtime = tg->rt_bandwidth.rt_runtime;
10353 if (rt_period == 0)
10356 return tg_set_bandwidth(tg, rt_period, rt_runtime);
10359 long sched_group_rt_period(struct task_group *tg)
10363 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
10364 do_div(rt_period_us, NSEC_PER_USEC);
10365 return rt_period_us;
10368 static int sched_rt_global_constraints(void)
10370 u64 runtime, period;
10373 if (sysctl_sched_rt_period <= 0)
10376 runtime = global_rt_runtime();
10377 period = global_rt_period();
10380 * Sanity check on the sysctl variables.
10382 if (runtime > period && runtime != RUNTIME_INF)
10385 mutex_lock(&rt_constraints_mutex);
10386 read_lock(&tasklist_lock);
10387 ret = __rt_schedulable(NULL, 0, 0);
10388 read_unlock(&tasklist_lock);
10389 mutex_unlock(&rt_constraints_mutex);
10394 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
10396 /* Don't accept realtime tasks when there is no way for them to run */
10397 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
10403 #else /* !CONFIG_RT_GROUP_SCHED */
10404 static int sched_rt_global_constraints(void)
10406 unsigned long flags;
10409 if (sysctl_sched_rt_period <= 0)
10413 * There's always some RT tasks in the root group
10414 * -- migration, kstopmachine etc..
10416 if (sysctl_sched_rt_runtime == 0)
10419 spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
10420 for_each_possible_cpu(i) {
10421 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
10423 spin_lock(&rt_rq->rt_runtime_lock);
10424 rt_rq->rt_runtime = global_rt_runtime();
10425 spin_unlock(&rt_rq->rt_runtime_lock);
10427 spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
10431 #endif /* CONFIG_RT_GROUP_SCHED */
10433 int sched_rt_handler(struct ctl_table *table, int write,
10434 void __user *buffer, size_t *lenp,
10438 int old_period, old_runtime;
10439 static DEFINE_MUTEX(mutex);
10441 mutex_lock(&mutex);
10442 old_period = sysctl_sched_rt_period;
10443 old_runtime = sysctl_sched_rt_runtime;
10445 ret = proc_dointvec(table, write, buffer, lenp, ppos);
10447 if (!ret && write) {
10448 ret = sched_rt_global_constraints();
10450 sysctl_sched_rt_period = old_period;
10451 sysctl_sched_rt_runtime = old_runtime;
10453 def_rt_bandwidth.rt_runtime = global_rt_runtime();
10454 def_rt_bandwidth.rt_period =
10455 ns_to_ktime(global_rt_period());
10458 mutex_unlock(&mutex);
10463 #ifdef CONFIG_CGROUP_SCHED
10465 /* return corresponding task_group object of a cgroup */
10466 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
10468 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
10469 struct task_group, css);
10472 static struct cgroup_subsys_state *
10473 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
10475 struct task_group *tg, *parent;
10477 if (!cgrp->parent) {
10478 /* This is early initialization for the top cgroup */
10479 return &init_task_group.css;
10482 parent = cgroup_tg(cgrp->parent);
10483 tg = sched_create_group(parent);
10485 return ERR_PTR(-ENOMEM);
10491 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
10493 struct task_group *tg = cgroup_tg(cgrp);
10495 sched_destroy_group(tg);
10499 cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
10501 #ifdef CONFIG_RT_GROUP_SCHED
10502 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
10505 /* We don't support RT-tasks being in separate groups */
10506 if (tsk->sched_class != &fair_sched_class)
10513 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
10514 struct task_struct *tsk, bool threadgroup)
10516 int retval = cpu_cgroup_can_attach_task(cgrp, tsk);
10520 struct task_struct *c;
10522 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
10523 retval = cpu_cgroup_can_attach_task(cgrp, c);
10535 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
10536 struct cgroup *old_cont, struct task_struct *tsk,
10539 sched_move_task(tsk);
10541 struct task_struct *c;
10543 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
10544 sched_move_task(c);
10550 #ifdef CONFIG_FAIR_GROUP_SCHED
10551 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
10554 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
10557 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
10559 struct task_group *tg = cgroup_tg(cgrp);
10561 return (u64) tg->shares;
10563 #endif /* CONFIG_FAIR_GROUP_SCHED */
10565 #ifdef CONFIG_RT_GROUP_SCHED
10566 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
10569 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
10572 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
10574 return sched_group_rt_runtime(cgroup_tg(cgrp));
10577 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
10580 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
10583 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
10585 return sched_group_rt_period(cgroup_tg(cgrp));
10587 #endif /* CONFIG_RT_GROUP_SCHED */
10589 static struct cftype cpu_files[] = {
10590 #ifdef CONFIG_FAIR_GROUP_SCHED
10593 .read_u64 = cpu_shares_read_u64,
10594 .write_u64 = cpu_shares_write_u64,
10597 #ifdef CONFIG_RT_GROUP_SCHED
10599 .name = "rt_runtime_us",
10600 .read_s64 = cpu_rt_runtime_read,
10601 .write_s64 = cpu_rt_runtime_write,
10604 .name = "rt_period_us",
10605 .read_u64 = cpu_rt_period_read_uint,
10606 .write_u64 = cpu_rt_period_write_uint,
10611 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
10613 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
10616 struct cgroup_subsys cpu_cgroup_subsys = {
10618 .create = cpu_cgroup_create,
10619 .destroy = cpu_cgroup_destroy,
10620 .can_attach = cpu_cgroup_can_attach,
10621 .attach = cpu_cgroup_attach,
10622 .populate = cpu_cgroup_populate,
10623 .subsys_id = cpu_cgroup_subsys_id,
10627 #endif /* CONFIG_CGROUP_SCHED */
10629 #ifdef CONFIG_CGROUP_CPUACCT
10632 * CPU accounting code for task groups.
10634 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
10635 * (balbir@in.ibm.com).
10638 /* track cpu usage of a group of tasks and its child groups */
10640 struct cgroup_subsys_state css;
10641 /* cpuusage holds pointer to a u64-type object on every cpu */
10643 struct percpu_counter cpustat[CPUACCT_STAT_NSTATS];
10644 struct cpuacct *parent;
10647 struct cgroup_subsys cpuacct_subsys;
10649 /* return cpu accounting group corresponding to this container */
10650 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
10652 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
10653 struct cpuacct, css);
10656 /* return cpu accounting group to which this task belongs */
10657 static inline struct cpuacct *task_ca(struct task_struct *tsk)
10659 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
10660 struct cpuacct, css);
10663 /* create a new cpu accounting group */
10664 static struct cgroup_subsys_state *cpuacct_create(
10665 struct cgroup_subsys *ss, struct cgroup *cgrp)
10667 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
10673 ca->cpuusage = alloc_percpu(u64);
10677 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
10678 if (percpu_counter_init(&ca->cpustat[i], 0))
10679 goto out_free_counters;
10682 ca->parent = cgroup_ca(cgrp->parent);
10688 percpu_counter_destroy(&ca->cpustat[i]);
10689 free_percpu(ca->cpuusage);
10693 return ERR_PTR(-ENOMEM);
10696 /* destroy an existing cpu accounting group */
10698 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
10700 struct cpuacct *ca = cgroup_ca(cgrp);
10703 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
10704 percpu_counter_destroy(&ca->cpustat[i]);
10705 free_percpu(ca->cpuusage);
10709 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
10711 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
10714 #ifndef CONFIG_64BIT
10716 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
10718 spin_lock_irq(&cpu_rq(cpu)->lock);
10720 spin_unlock_irq(&cpu_rq(cpu)->lock);
10728 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
10730 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
10732 #ifndef CONFIG_64BIT
10734 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
10736 spin_lock_irq(&cpu_rq(cpu)->lock);
10738 spin_unlock_irq(&cpu_rq(cpu)->lock);
10744 /* return total cpu usage (in nanoseconds) of a group */
10745 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
10747 struct cpuacct *ca = cgroup_ca(cgrp);
10748 u64 totalcpuusage = 0;
10751 for_each_present_cpu(i)
10752 totalcpuusage += cpuacct_cpuusage_read(ca, i);
10754 return totalcpuusage;
10757 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
10760 struct cpuacct *ca = cgroup_ca(cgrp);
10769 for_each_present_cpu(i)
10770 cpuacct_cpuusage_write(ca, i, 0);
10776 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
10777 struct seq_file *m)
10779 struct cpuacct *ca = cgroup_ca(cgroup);
10783 for_each_present_cpu(i) {
10784 percpu = cpuacct_cpuusage_read(ca, i);
10785 seq_printf(m, "%llu ", (unsigned long long) percpu);
10787 seq_printf(m, "\n");
10791 static const char *cpuacct_stat_desc[] = {
10792 [CPUACCT_STAT_USER] = "user",
10793 [CPUACCT_STAT_SYSTEM] = "system",
10796 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
10797 struct cgroup_map_cb *cb)
10799 struct cpuacct *ca = cgroup_ca(cgrp);
10802 for (i = 0; i < CPUACCT_STAT_NSTATS; i++) {
10803 s64 val = percpu_counter_read(&ca->cpustat[i]);
10804 val = cputime64_to_clock_t(val);
10805 cb->fill(cb, cpuacct_stat_desc[i], val);
10810 static struct cftype files[] = {
10813 .read_u64 = cpuusage_read,
10814 .write_u64 = cpuusage_write,
10817 .name = "usage_percpu",
10818 .read_seq_string = cpuacct_percpu_seq_read,
10822 .read_map = cpuacct_stats_show,
10826 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
10828 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
10832 * charge this task's execution time to its accounting group.
10834 * called with rq->lock held.
10836 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
10838 struct cpuacct *ca;
10841 if (unlikely(!cpuacct_subsys.active))
10844 cpu = task_cpu(tsk);
10850 for (; ca; ca = ca->parent) {
10851 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
10852 *cpuusage += cputime;
10859 * Charge the system/user time to the task's accounting group.
10861 static void cpuacct_update_stats(struct task_struct *tsk,
10862 enum cpuacct_stat_index idx, cputime_t val)
10864 struct cpuacct *ca;
10866 if (unlikely(!cpuacct_subsys.active))
10873 percpu_counter_add(&ca->cpustat[idx], val);
10879 struct cgroup_subsys cpuacct_subsys = {
10881 .create = cpuacct_create,
10882 .destroy = cpuacct_destroy,
10883 .populate = cpuacct_populate,
10884 .subsys_id = cpuacct_subsys_id,
10886 #endif /* CONFIG_CGROUP_CPUACCT */
10890 int rcu_expedited_torture_stats(char *page)
10894 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
10896 void synchronize_sched_expedited(void)
10899 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
10901 #else /* #ifndef CONFIG_SMP */
10903 static DEFINE_PER_CPU(struct migration_req, rcu_migration_req);
10904 static DEFINE_MUTEX(rcu_sched_expedited_mutex);
10906 #define RCU_EXPEDITED_STATE_POST -2
10907 #define RCU_EXPEDITED_STATE_IDLE -1
10909 static int rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
10911 int rcu_expedited_torture_stats(char *page)
10916 cnt += sprintf(&page[cnt], "state: %d /", rcu_expedited_state);
10917 for_each_online_cpu(cpu) {
10918 cnt += sprintf(&page[cnt], " %d:%d",
10919 cpu, per_cpu(rcu_migration_req, cpu).dest_cpu);
10921 cnt += sprintf(&page[cnt], "\n");
10924 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
10926 static long synchronize_sched_expedited_count;
10929 * Wait for an rcu-sched grace period to elapse, but use "big hammer"
10930 * approach to force grace period to end quickly. This consumes
10931 * significant time on all CPUs, and is thus not recommended for
10932 * any sort of common-case code.
10934 * Note that it is illegal to call this function while holding any
10935 * lock that is acquired by a CPU-hotplug notifier. Failing to
10936 * observe this restriction will result in deadlock.
10938 void synchronize_sched_expedited(void)
10941 unsigned long flags;
10942 bool need_full_sync = 0;
10944 struct migration_req *req;
10948 smp_mb(); /* ensure prior mod happens before capturing snap. */
10949 snap = ACCESS_ONCE(synchronize_sched_expedited_count) + 1;
10951 while (!mutex_trylock(&rcu_sched_expedited_mutex)) {
10953 if (trycount++ < 10)
10954 udelay(trycount * num_online_cpus());
10956 synchronize_sched();
10959 if (ACCESS_ONCE(synchronize_sched_expedited_count) - snap > 0) {
10960 smp_mb(); /* ensure test happens before caller kfree */
10965 rcu_expedited_state = RCU_EXPEDITED_STATE_POST;
10966 for_each_online_cpu(cpu) {
10968 req = &per_cpu(rcu_migration_req, cpu);
10969 init_completion(&req->done);
10971 req->dest_cpu = RCU_MIGRATION_NEED_QS;
10972 spin_lock_irqsave(&rq->lock, flags);
10973 list_add(&req->list, &rq->migration_queue);
10974 spin_unlock_irqrestore(&rq->lock, flags);
10975 wake_up_process(rq->migration_thread);
10977 for_each_online_cpu(cpu) {
10978 rcu_expedited_state = cpu;
10979 req = &per_cpu(rcu_migration_req, cpu);
10981 wait_for_completion(&req->done);
10982 spin_lock_irqsave(&rq->lock, flags);
10983 if (unlikely(req->dest_cpu == RCU_MIGRATION_MUST_SYNC))
10984 need_full_sync = 1;
10985 req->dest_cpu = RCU_MIGRATION_IDLE;
10986 spin_unlock_irqrestore(&rq->lock, flags);
10988 rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
10989 synchronize_sched_expedited_count++;
10990 mutex_unlock(&rcu_sched_expedited_mutex);
10992 if (need_full_sync)
10993 synchronize_sched();
10995 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
10997 #endif /* #else #ifndef CONFIG_SMP */