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), *new_rq = cpu_rq(new_cpu);
2064 struct cfs_rq *old_cfsrq = task_cfs_rq(p),
2065 *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu);
2068 clock_offset = old_rq->clock - new_rq->clock;
2070 trace_sched_migrate_task(p, new_cpu);
2072 #ifdef CONFIG_SCHEDSTATS
2073 if (p->se.wait_start)
2074 p->se.wait_start -= clock_offset;
2075 if (p->se.sleep_start)
2076 p->se.sleep_start -= clock_offset;
2077 if (p->se.block_start)
2078 p->se.block_start -= clock_offset;
2080 if (old_cpu != new_cpu) {
2081 p->se.nr_migrations++;
2082 #ifdef CONFIG_SCHEDSTATS
2083 if (task_hot(p, old_rq->clock, NULL))
2084 schedstat_inc(p, se.nr_forced2_migrations);
2086 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS,
2089 p->se.vruntime -= old_cfsrq->min_vruntime -
2090 new_cfsrq->min_vruntime;
2092 __set_task_cpu(p, new_cpu);
2095 struct migration_req {
2096 struct list_head list;
2098 struct task_struct *task;
2101 struct completion done;
2105 * The task's runqueue lock must be held.
2106 * Returns true if you have to wait for migration thread.
2109 migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req)
2111 struct rq *rq = task_rq(p);
2114 * If the task is not on a runqueue (and not running), then
2115 * it is sufficient to simply update the task's cpu field.
2117 if (!p->se.on_rq && !task_running(rq, p)) {
2118 update_rq_clock(rq);
2119 set_task_cpu(p, dest_cpu);
2123 init_completion(&req->done);
2125 req->dest_cpu = dest_cpu;
2126 list_add(&req->list, &rq->migration_queue);
2132 * wait_task_context_switch - wait for a thread to complete at least one
2135 * @p must not be current.
2137 void wait_task_context_switch(struct task_struct *p)
2139 unsigned long nvcsw, nivcsw, flags;
2147 * The runqueue is assigned before the actual context
2148 * switch. We need to take the runqueue lock.
2150 * We could check initially without the lock but it is
2151 * very likely that we need to take the lock in every
2154 rq = task_rq_lock(p, &flags);
2155 running = task_running(rq, p);
2156 task_rq_unlock(rq, &flags);
2158 if (likely(!running))
2161 * The switch count is incremented before the actual
2162 * context switch. We thus wait for two switches to be
2163 * sure at least one completed.
2165 if ((p->nvcsw - nvcsw) > 1)
2167 if ((p->nivcsw - nivcsw) > 1)
2175 * wait_task_inactive - wait for a thread to unschedule.
2177 * If @match_state is nonzero, it's the @p->state value just checked and
2178 * not expected to change. If it changes, i.e. @p might have woken up,
2179 * then return zero. When we succeed in waiting for @p to be off its CPU,
2180 * we return a positive number (its total switch count). If a second call
2181 * a short while later returns the same number, the caller can be sure that
2182 * @p has remained unscheduled the whole time.
2184 * The caller must ensure that the task *will* unschedule sometime soon,
2185 * else this function might spin for a *long* time. This function can't
2186 * be called with interrupts off, or it may introduce deadlock with
2187 * smp_call_function() if an IPI is sent by the same process we are
2188 * waiting to become inactive.
2190 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2192 unsigned long flags;
2199 * We do the initial early heuristics without holding
2200 * any task-queue locks at all. We'll only try to get
2201 * the runqueue lock when things look like they will
2207 * If the task is actively running on another CPU
2208 * still, just relax and busy-wait without holding
2211 * NOTE! Since we don't hold any locks, it's not
2212 * even sure that "rq" stays as the right runqueue!
2213 * But we don't care, since "task_running()" will
2214 * return false if the runqueue has changed and p
2215 * is actually now running somewhere else!
2217 while (task_running(rq, p)) {
2218 if (match_state && unlikely(p->state != match_state))
2224 * Ok, time to look more closely! We need the rq
2225 * lock now, to be *sure*. If we're wrong, we'll
2226 * just go back and repeat.
2228 rq = task_rq_lock(p, &flags);
2229 trace_sched_wait_task(rq, p);
2230 running = task_running(rq, p);
2231 on_rq = p->se.on_rq;
2233 if (!match_state || p->state == match_state)
2234 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
2235 task_rq_unlock(rq, &flags);
2238 * If it changed from the expected state, bail out now.
2240 if (unlikely(!ncsw))
2244 * Was it really running after all now that we
2245 * checked with the proper locks actually held?
2247 * Oops. Go back and try again..
2249 if (unlikely(running)) {
2255 * It's not enough that it's not actively running,
2256 * it must be off the runqueue _entirely_, and not
2259 * So if it was still runnable (but just not actively
2260 * running right now), it's preempted, and we should
2261 * yield - it could be a while.
2263 if (unlikely(on_rq)) {
2264 schedule_timeout_uninterruptible(1);
2269 * Ahh, all good. It wasn't running, and it wasn't
2270 * runnable, which means that it will never become
2271 * running in the future either. We're all done!
2280 * kick_process - kick a running thread to enter/exit the kernel
2281 * @p: the to-be-kicked thread
2283 * Cause a process which is running on another CPU to enter
2284 * kernel-mode, without any delay. (to get signals handled.)
2286 * NOTE: this function doesnt have to take the runqueue lock,
2287 * because all it wants to ensure is that the remote task enters
2288 * the kernel. If the IPI races and the task has been migrated
2289 * to another CPU then no harm is done and the purpose has been
2292 void kick_process(struct task_struct *p)
2298 if ((cpu != smp_processor_id()) && task_curr(p))
2299 smp_send_reschedule(cpu);
2302 EXPORT_SYMBOL_GPL(kick_process);
2303 #endif /* CONFIG_SMP */
2306 * task_oncpu_function_call - call a function on the cpu on which a task runs
2307 * @p: the task to evaluate
2308 * @func: the function to be called
2309 * @info: the function call argument
2311 * Calls the function @func when the task is currently running. This might
2312 * be on the current CPU, which just calls the function directly
2314 void task_oncpu_function_call(struct task_struct *p,
2315 void (*func) (void *info), void *info)
2322 smp_call_function_single(cpu, func, info, 1);
2328 int select_task_rq(struct task_struct *p, int sd_flags, int wake_flags)
2330 return p->sched_class->select_task_rq(p, sd_flags, wake_flags);
2335 * try_to_wake_up - wake up a thread
2336 * @p: the to-be-woken-up thread
2337 * @state: the mask of task states that can be woken
2338 * @sync: do a synchronous wakeup?
2340 * Put it on the run-queue if it's not already there. The "current"
2341 * thread is always on the run-queue (except when the actual
2342 * re-schedule is in progress), and as such you're allowed to do
2343 * the simpler "current->state = TASK_RUNNING" to mark yourself
2344 * runnable without the overhead of this.
2346 * returns failure only if the task is already active.
2348 static int try_to_wake_up(struct task_struct *p, unsigned int state,
2351 int cpu, orig_cpu, this_cpu, success = 0;
2352 unsigned long flags;
2353 struct rq *rq, *orig_rq;
2355 if (!sched_feat(SYNC_WAKEUPS))
2356 wake_flags &= ~WF_SYNC;
2358 this_cpu = get_cpu();
2361 rq = orig_rq = task_rq_lock(p, &flags);
2362 update_rq_clock(rq);
2363 if (!(p->state & state))
2373 if (unlikely(task_running(rq, p)))
2377 * In order to handle concurrent wakeups and release the rq->lock
2378 * we put the task in TASK_WAKING state.
2380 * First fix up the nr_uninterruptible count:
2382 if (task_contributes_to_load(p))
2383 rq->nr_uninterruptible--;
2384 p->state = TASK_WAKING;
2385 task_rq_unlock(rq, &flags);
2387 cpu = select_task_rq(p, SD_BALANCE_WAKE, wake_flags);
2388 if (cpu != orig_cpu) {
2389 local_irq_save(flags);
2391 update_rq_clock(rq);
2392 set_task_cpu(p, cpu);
2393 local_irq_restore(flags);
2395 rq = task_rq_lock(p, &flags);
2397 WARN_ON(p->state != TASK_WAKING);
2400 #ifdef CONFIG_SCHEDSTATS
2401 schedstat_inc(rq, ttwu_count);
2402 if (cpu == this_cpu)
2403 schedstat_inc(rq, ttwu_local);
2405 struct sched_domain *sd;
2406 for_each_domain(this_cpu, sd) {
2407 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2408 schedstat_inc(sd, ttwu_wake_remote);
2413 #endif /* CONFIG_SCHEDSTATS */
2416 #endif /* CONFIG_SMP */
2417 schedstat_inc(p, se.nr_wakeups);
2418 if (wake_flags & WF_SYNC)
2419 schedstat_inc(p, se.nr_wakeups_sync);
2420 if (orig_cpu != cpu)
2421 schedstat_inc(p, se.nr_wakeups_migrate);
2422 if (cpu == this_cpu)
2423 schedstat_inc(p, se.nr_wakeups_local);
2425 schedstat_inc(p, se.nr_wakeups_remote);
2426 activate_task(rq, p, 1);
2430 * Only attribute actual wakeups done by this task.
2432 if (!in_interrupt()) {
2433 struct sched_entity *se = ¤t->se;
2434 u64 sample = se->sum_exec_runtime;
2436 if (se->last_wakeup)
2437 sample -= se->last_wakeup;
2439 sample -= se->start_runtime;
2440 update_avg(&se->avg_wakeup, sample);
2442 se->last_wakeup = se->sum_exec_runtime;
2446 trace_sched_wakeup(rq, p, success);
2447 check_preempt_curr(rq, p, wake_flags);
2449 p->state = TASK_RUNNING;
2451 if (p->sched_class->task_wake_up)
2452 p->sched_class->task_wake_up(rq, p);
2454 if (unlikely(rq->idle_stamp)) {
2455 u64 delta = rq->clock - rq->idle_stamp;
2456 u64 max = 2*sysctl_sched_migration_cost;
2461 update_avg(&rq->avg_idle, delta);
2466 task_rq_unlock(rq, &flags);
2473 * wake_up_process - Wake up a specific process
2474 * @p: The process to be woken up.
2476 * Attempt to wake up the nominated process and move it to the set of runnable
2477 * processes. Returns 1 if the process was woken up, 0 if it was already
2480 * It may be assumed that this function implies a write memory barrier before
2481 * changing the task state if and only if any tasks are woken up.
2483 int wake_up_process(struct task_struct *p)
2485 return try_to_wake_up(p, TASK_ALL, 0);
2487 EXPORT_SYMBOL(wake_up_process);
2489 int wake_up_state(struct task_struct *p, unsigned int state)
2491 return try_to_wake_up(p, state, 0);
2495 * Perform scheduler related setup for a newly forked process p.
2496 * p is forked by current.
2498 * __sched_fork() is basic setup used by init_idle() too:
2500 static void __sched_fork(struct task_struct *p)
2502 p->se.exec_start = 0;
2503 p->se.sum_exec_runtime = 0;
2504 p->se.prev_sum_exec_runtime = 0;
2505 p->se.nr_migrations = 0;
2506 p->se.last_wakeup = 0;
2507 p->se.avg_overlap = 0;
2508 p->se.start_runtime = 0;
2509 p->se.avg_wakeup = sysctl_sched_wakeup_granularity;
2510 p->se.avg_running = 0;
2512 #ifdef CONFIG_SCHEDSTATS
2513 p->se.wait_start = 0;
2515 p->se.wait_count = 0;
2518 p->se.sleep_start = 0;
2519 p->se.sleep_max = 0;
2520 p->se.sum_sleep_runtime = 0;
2522 p->se.block_start = 0;
2523 p->se.block_max = 0;
2525 p->se.slice_max = 0;
2527 p->se.nr_migrations_cold = 0;
2528 p->se.nr_failed_migrations_affine = 0;
2529 p->se.nr_failed_migrations_running = 0;
2530 p->se.nr_failed_migrations_hot = 0;
2531 p->se.nr_forced_migrations = 0;
2532 p->se.nr_forced2_migrations = 0;
2534 p->se.nr_wakeups = 0;
2535 p->se.nr_wakeups_sync = 0;
2536 p->se.nr_wakeups_migrate = 0;
2537 p->se.nr_wakeups_local = 0;
2538 p->se.nr_wakeups_remote = 0;
2539 p->se.nr_wakeups_affine = 0;
2540 p->se.nr_wakeups_affine_attempts = 0;
2541 p->se.nr_wakeups_passive = 0;
2542 p->se.nr_wakeups_idle = 0;
2546 INIT_LIST_HEAD(&p->rt.run_list);
2548 INIT_LIST_HEAD(&p->se.group_node);
2550 #ifdef CONFIG_PREEMPT_NOTIFIERS
2551 INIT_HLIST_HEAD(&p->preempt_notifiers);
2555 * We mark the process as running here, but have not actually
2556 * inserted it onto the runqueue yet. This guarantees that
2557 * nobody will actually run it, and a signal or other external
2558 * event cannot wake it up and insert it on the runqueue either.
2560 p->state = TASK_RUNNING;
2564 * fork()/clone()-time setup:
2566 void sched_fork(struct task_struct *p, int clone_flags)
2568 int cpu = get_cpu();
2569 unsigned long flags;
2574 * Revert to default priority/policy on fork if requested.
2576 if (unlikely(p->sched_reset_on_fork)) {
2577 if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) {
2578 p->policy = SCHED_NORMAL;
2579 p->normal_prio = p->static_prio;
2582 if (PRIO_TO_NICE(p->static_prio) < 0) {
2583 p->static_prio = NICE_TO_PRIO(0);
2584 p->normal_prio = p->static_prio;
2589 * We don't need the reset flag anymore after the fork. It has
2590 * fulfilled its duty:
2592 p->sched_reset_on_fork = 0;
2596 * Make sure we do not leak PI boosting priority to the child.
2598 p->prio = current->normal_prio;
2600 if (!rt_prio(p->prio))
2601 p->sched_class = &fair_sched_class;
2604 cpu = select_task_rq(p, SD_BALANCE_FORK, 0);
2606 local_irq_save(flags);
2607 update_rq_clock(cpu_rq(cpu));
2608 set_task_cpu(p, cpu);
2609 local_irq_restore(flags);
2611 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2612 if (likely(sched_info_on()))
2613 memset(&p->sched_info, 0, sizeof(p->sched_info));
2615 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2618 #ifdef CONFIG_PREEMPT
2619 /* Want to start with kernel preemption disabled. */
2620 task_thread_info(p)->preempt_count = 1;
2622 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2628 * wake_up_new_task - wake up a newly created task for the first time.
2630 * This function will do some initial scheduler statistics housekeeping
2631 * that must be done for every newly created context, then puts the task
2632 * on the runqueue and wakes it.
2634 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2636 unsigned long flags;
2639 rq = task_rq_lock(p, &flags);
2640 BUG_ON(p->state != TASK_RUNNING);
2641 update_rq_clock(rq);
2643 if (!p->sched_class->task_new || !current->se.on_rq) {
2644 activate_task(rq, p, 0);
2647 * Let the scheduling class do new task startup
2648 * management (if any):
2650 p->sched_class->task_new(rq, p);
2653 trace_sched_wakeup_new(rq, p, 1);
2654 check_preempt_curr(rq, p, WF_FORK);
2656 if (p->sched_class->task_wake_up)
2657 p->sched_class->task_wake_up(rq, p);
2659 task_rq_unlock(rq, &flags);
2662 #ifdef CONFIG_PREEMPT_NOTIFIERS
2665 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2666 * @notifier: notifier struct to register
2668 void preempt_notifier_register(struct preempt_notifier *notifier)
2670 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2672 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2675 * preempt_notifier_unregister - no longer interested in preemption notifications
2676 * @notifier: notifier struct to unregister
2678 * This is safe to call from within a preemption notifier.
2680 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2682 hlist_del(¬ifier->link);
2684 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2686 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
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_in(notifier, raw_smp_processor_id());
2696 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2697 struct task_struct *next)
2699 struct preempt_notifier *notifier;
2700 struct hlist_node *node;
2702 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2703 notifier->ops->sched_out(notifier, next);
2706 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2708 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2713 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2714 struct task_struct *next)
2718 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2721 * prepare_task_switch - prepare to switch tasks
2722 * @rq: the runqueue preparing to switch
2723 * @prev: the current task that is being switched out
2724 * @next: the task we are going to switch to.
2726 * This is called with the rq lock held and interrupts off. It must
2727 * be paired with a subsequent finish_task_switch after the context
2730 * prepare_task_switch sets up locking and calls architecture specific
2734 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2735 struct task_struct *next)
2737 fire_sched_out_preempt_notifiers(prev, next);
2738 prepare_lock_switch(rq, next);
2739 prepare_arch_switch(next);
2743 * finish_task_switch - clean up after a task-switch
2744 * @rq: runqueue associated with task-switch
2745 * @prev: the thread we just switched away from.
2747 * finish_task_switch must be called after the context switch, paired
2748 * with a prepare_task_switch call before the context switch.
2749 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2750 * and do any other architecture-specific cleanup actions.
2752 * Note that we may have delayed dropping an mm in context_switch(). If
2753 * so, we finish that here outside of the runqueue lock. (Doing it
2754 * with the lock held can cause deadlocks; see schedule() for
2757 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2758 __releases(rq->lock)
2760 struct mm_struct *mm = rq->prev_mm;
2766 * A task struct has one reference for the use as "current".
2767 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2768 * schedule one last time. The schedule call will never return, and
2769 * the scheduled task must drop that reference.
2770 * The test for TASK_DEAD must occur while the runqueue locks are
2771 * still held, otherwise prev could be scheduled on another cpu, die
2772 * there before we look at prev->state, and then the reference would
2774 * Manfred Spraul <manfred@colorfullife.com>
2776 prev_state = prev->state;
2777 finish_arch_switch(prev);
2778 perf_event_task_sched_in(current, cpu_of(rq));
2779 finish_lock_switch(rq, prev);
2781 fire_sched_in_preempt_notifiers(current);
2784 if (unlikely(prev_state == TASK_DEAD)) {
2786 * Remove function-return probe instances associated with this
2787 * task and put them back on the free list.
2789 kprobe_flush_task(prev);
2790 put_task_struct(prev);
2796 /* assumes rq->lock is held */
2797 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
2799 if (prev->sched_class->pre_schedule)
2800 prev->sched_class->pre_schedule(rq, prev);
2803 /* rq->lock is NOT held, but preemption is disabled */
2804 static inline void post_schedule(struct rq *rq)
2806 if (rq->post_schedule) {
2807 unsigned long flags;
2809 spin_lock_irqsave(&rq->lock, flags);
2810 if (rq->curr->sched_class->post_schedule)
2811 rq->curr->sched_class->post_schedule(rq);
2812 spin_unlock_irqrestore(&rq->lock, flags);
2814 rq->post_schedule = 0;
2820 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
2824 static inline void post_schedule(struct rq *rq)
2831 * schedule_tail - first thing a freshly forked thread must call.
2832 * @prev: the thread we just switched away from.
2834 asmlinkage void schedule_tail(struct task_struct *prev)
2835 __releases(rq->lock)
2837 struct rq *rq = this_rq();
2839 finish_task_switch(rq, prev);
2842 * FIXME: do we need to worry about rq being invalidated by the
2847 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2848 /* In this case, finish_task_switch does not reenable preemption */
2851 if (current->set_child_tid)
2852 put_user(task_pid_vnr(current), current->set_child_tid);
2856 * context_switch - switch to the new MM and the new
2857 * thread's register state.
2860 context_switch(struct rq *rq, struct task_struct *prev,
2861 struct task_struct *next)
2863 struct mm_struct *mm, *oldmm;
2865 prepare_task_switch(rq, prev, next);
2866 trace_sched_switch(rq, prev, next);
2868 oldmm = prev->active_mm;
2870 * For paravirt, this is coupled with an exit in switch_to to
2871 * combine the page table reload and the switch backend into
2874 arch_start_context_switch(prev);
2877 next->active_mm = oldmm;
2878 atomic_inc(&oldmm->mm_count);
2879 enter_lazy_tlb(oldmm, next);
2881 switch_mm(oldmm, mm, next);
2883 if (likely(!prev->mm)) {
2884 prev->active_mm = NULL;
2885 rq->prev_mm = oldmm;
2888 * Since the runqueue lock will be released by the next
2889 * task (which is an invalid locking op but in the case
2890 * of the scheduler it's an obvious special-case), so we
2891 * do an early lockdep release here:
2893 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2894 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2897 /* Here we just switch the register state and the stack. */
2898 switch_to(prev, next, prev);
2902 * this_rq must be evaluated again because prev may have moved
2903 * CPUs since it called schedule(), thus the 'rq' on its stack
2904 * frame will be invalid.
2906 finish_task_switch(this_rq(), prev);
2910 * nr_running, nr_uninterruptible and nr_context_switches:
2912 * externally visible scheduler statistics: current number of runnable
2913 * threads, current number of uninterruptible-sleeping threads, total
2914 * number of context switches performed since bootup.
2916 unsigned long nr_running(void)
2918 unsigned long i, sum = 0;
2920 for_each_online_cpu(i)
2921 sum += cpu_rq(i)->nr_running;
2926 unsigned long nr_uninterruptible(void)
2928 unsigned long i, sum = 0;
2930 for_each_possible_cpu(i)
2931 sum += cpu_rq(i)->nr_uninterruptible;
2934 * Since we read the counters lockless, it might be slightly
2935 * inaccurate. Do not allow it to go below zero though:
2937 if (unlikely((long)sum < 0))
2943 unsigned long long nr_context_switches(void)
2946 unsigned long long sum = 0;
2948 for_each_possible_cpu(i)
2949 sum += cpu_rq(i)->nr_switches;
2954 unsigned long nr_iowait(void)
2956 unsigned long i, sum = 0;
2958 for_each_possible_cpu(i)
2959 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2964 unsigned long nr_iowait_cpu(void)
2966 struct rq *this = this_rq();
2967 return atomic_read(&this->nr_iowait);
2970 unsigned long this_cpu_load(void)
2972 struct rq *this = this_rq();
2973 return this->cpu_load[0];
2977 /* Variables and functions for calc_load */
2978 static atomic_long_t calc_load_tasks;
2979 static unsigned long calc_load_update;
2980 unsigned long avenrun[3];
2981 EXPORT_SYMBOL(avenrun);
2984 * get_avenrun - get the load average array
2985 * @loads: pointer to dest load array
2986 * @offset: offset to add
2987 * @shift: shift count to shift the result left
2989 * These values are estimates at best, so no need for locking.
2991 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
2993 loads[0] = (avenrun[0] + offset) << shift;
2994 loads[1] = (avenrun[1] + offset) << shift;
2995 loads[2] = (avenrun[2] + offset) << shift;
2998 static unsigned long
2999 calc_load(unsigned long load, unsigned long exp, unsigned long active)
3002 load += active * (FIXED_1 - exp);
3003 return load >> FSHIFT;
3007 * calc_load - update the avenrun load estimates 10 ticks after the
3008 * CPUs have updated calc_load_tasks.
3010 void calc_global_load(void)
3012 unsigned long upd = calc_load_update + 10;
3015 if (time_before(jiffies, upd))
3018 active = atomic_long_read(&calc_load_tasks);
3019 active = active > 0 ? active * FIXED_1 : 0;
3021 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
3022 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
3023 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
3025 calc_load_update += LOAD_FREQ;
3029 * Either called from update_cpu_load() or from a cpu going idle
3031 static void calc_load_account_active(struct rq *this_rq)
3033 long nr_active, delta;
3035 nr_active = this_rq->nr_running;
3036 nr_active += (long) this_rq->nr_uninterruptible;
3038 if (nr_active != this_rq->calc_load_active) {
3039 delta = nr_active - this_rq->calc_load_active;
3040 this_rq->calc_load_active = nr_active;
3041 atomic_long_add(delta, &calc_load_tasks);
3046 * Update rq->cpu_load[] statistics. This function is usually called every
3047 * scheduler tick (TICK_NSEC).
3049 static void update_cpu_load(struct rq *this_rq)
3051 unsigned long this_load = this_rq->load.weight;
3054 this_rq->nr_load_updates++;
3056 /* Update our load: */
3057 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
3058 unsigned long old_load, new_load;
3060 /* scale is effectively 1 << i now, and >> i divides by scale */
3062 old_load = this_rq->cpu_load[i];
3063 new_load = this_load;
3065 * Round up the averaging division if load is increasing. This
3066 * prevents us from getting stuck on 9 if the load is 10, for
3069 if (new_load > old_load)
3070 new_load += scale-1;
3071 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
3074 if (time_after_eq(jiffies, this_rq->calc_load_update)) {
3075 this_rq->calc_load_update += LOAD_FREQ;
3076 calc_load_account_active(this_rq);
3083 * double_rq_lock - safely lock two runqueues
3085 * Note this does not disable interrupts like task_rq_lock,
3086 * you need to do so manually before calling.
3088 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
3089 __acquires(rq1->lock)
3090 __acquires(rq2->lock)
3092 BUG_ON(!irqs_disabled());
3094 spin_lock(&rq1->lock);
3095 __acquire(rq2->lock); /* Fake it out ;) */
3098 spin_lock(&rq1->lock);
3099 spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
3101 spin_lock(&rq2->lock);
3102 spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
3105 update_rq_clock(rq1);
3106 update_rq_clock(rq2);
3110 * double_rq_unlock - safely unlock two runqueues
3112 * Note this does not restore interrupts like task_rq_unlock,
3113 * you need to do so manually after calling.
3115 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
3116 __releases(rq1->lock)
3117 __releases(rq2->lock)
3119 spin_unlock(&rq1->lock);
3121 spin_unlock(&rq2->lock);
3123 __release(rq2->lock);
3127 * If dest_cpu is allowed for this process, migrate the task to it.
3128 * This is accomplished by forcing the cpu_allowed mask to only
3129 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
3130 * the cpu_allowed mask is restored.
3132 static void sched_migrate_task(struct task_struct *p, int dest_cpu)
3134 struct migration_req req;
3135 unsigned long flags;
3138 rq = task_rq_lock(p, &flags);
3139 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed)
3140 || unlikely(!cpu_active(dest_cpu)))
3143 /* force the process onto the specified CPU */
3144 if (migrate_task(p, dest_cpu, &req)) {
3145 /* Need to wait for migration thread (might exit: take ref). */
3146 struct task_struct *mt = rq->migration_thread;
3148 get_task_struct(mt);
3149 task_rq_unlock(rq, &flags);
3150 wake_up_process(mt);
3151 put_task_struct(mt);
3152 wait_for_completion(&req.done);
3157 task_rq_unlock(rq, &flags);
3161 * sched_exec - execve() is a valuable balancing opportunity, because at
3162 * this point the task has the smallest effective memory and cache footprint.
3164 void sched_exec(void)
3166 int new_cpu, this_cpu = get_cpu();
3167 new_cpu = select_task_rq(current, SD_BALANCE_EXEC, 0);
3169 if (new_cpu != this_cpu)
3170 sched_migrate_task(current, new_cpu);
3174 * pull_task - move a task from a remote runqueue to the local runqueue.
3175 * Both runqueues must be locked.
3177 static void pull_task(struct rq *src_rq, struct task_struct *p,
3178 struct rq *this_rq, int this_cpu)
3180 deactivate_task(src_rq, p, 0);
3181 set_task_cpu(p, this_cpu);
3182 activate_task(this_rq, p, 0);
3184 * Note that idle threads have a prio of MAX_PRIO, for this test
3185 * to be always true for them.
3187 check_preempt_curr(this_rq, p, 0);
3191 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
3194 int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu,
3195 struct sched_domain *sd, enum cpu_idle_type idle,
3198 int tsk_cache_hot = 0;
3200 * We do not migrate tasks that are:
3201 * 1) running (obviously), or
3202 * 2) cannot be migrated to this CPU due to cpus_allowed, or
3203 * 3) are cache-hot on their current CPU.
3205 if (!cpumask_test_cpu(this_cpu, &p->cpus_allowed)) {
3206 schedstat_inc(p, se.nr_failed_migrations_affine);
3211 if (task_running(rq, p)) {
3212 schedstat_inc(p, se.nr_failed_migrations_running);
3217 * Aggressive migration if:
3218 * 1) task is cache cold, or
3219 * 2) too many balance attempts have failed.
3222 tsk_cache_hot = task_hot(p, rq->clock, sd);
3223 if (!tsk_cache_hot ||
3224 sd->nr_balance_failed > sd->cache_nice_tries) {
3225 #ifdef CONFIG_SCHEDSTATS
3226 if (tsk_cache_hot) {
3227 schedstat_inc(sd, lb_hot_gained[idle]);
3228 schedstat_inc(p, se.nr_forced_migrations);
3234 if (tsk_cache_hot) {
3235 schedstat_inc(p, se.nr_failed_migrations_hot);
3241 static unsigned long
3242 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3243 unsigned long max_load_move, struct sched_domain *sd,
3244 enum cpu_idle_type idle, int *all_pinned,
3245 int *this_best_prio, struct rq_iterator *iterator)
3247 int loops = 0, pulled = 0, pinned = 0;
3248 struct task_struct *p;
3249 long rem_load_move = max_load_move;
3251 if (max_load_move == 0)
3257 * Start the load-balancing iterator:
3259 p = iterator->start(iterator->arg);
3261 if (!p || loops++ > sysctl_sched_nr_migrate)
3264 if ((p->se.load.weight >> 1) > rem_load_move ||
3265 !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3266 p = iterator->next(iterator->arg);
3270 pull_task(busiest, p, this_rq, this_cpu);
3272 rem_load_move -= p->se.load.weight;
3274 #ifdef CONFIG_PREEMPT
3276 * NEWIDLE balancing is a source of latency, so preemptible kernels
3277 * will stop after the first task is pulled to minimize the critical
3280 if (idle == CPU_NEWLY_IDLE)
3285 * We only want to steal up to the prescribed amount of weighted load.
3287 if (rem_load_move > 0) {
3288 if (p->prio < *this_best_prio)
3289 *this_best_prio = p->prio;
3290 p = iterator->next(iterator->arg);
3295 * Right now, this is one of only two places pull_task() is called,
3296 * so we can safely collect pull_task() stats here rather than
3297 * inside pull_task().
3299 schedstat_add(sd, lb_gained[idle], pulled);
3302 *all_pinned = pinned;
3304 return max_load_move - rem_load_move;
3308 * move_tasks tries to move up to max_load_move weighted load from busiest to
3309 * this_rq, as part of a balancing operation within domain "sd".
3310 * Returns 1 if successful and 0 otherwise.
3312 * Called with both runqueues locked.
3314 static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3315 unsigned long max_load_move,
3316 struct sched_domain *sd, enum cpu_idle_type idle,
3319 const struct sched_class *class = sched_class_highest;
3320 unsigned long total_load_moved = 0;
3321 int this_best_prio = this_rq->curr->prio;
3325 class->load_balance(this_rq, this_cpu, busiest,
3326 max_load_move - total_load_moved,
3327 sd, idle, all_pinned, &this_best_prio);
3328 class = class->next;
3330 #ifdef CONFIG_PREEMPT
3332 * NEWIDLE balancing is a source of latency, so preemptible
3333 * kernels will stop after the first task is pulled to minimize
3334 * the critical section.
3336 if (idle == CPU_NEWLY_IDLE && this_rq->nr_running)
3339 } while (class && max_load_move > total_load_moved);
3341 return total_load_moved > 0;
3345 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3346 struct sched_domain *sd, enum cpu_idle_type idle,
3347 struct rq_iterator *iterator)
3349 struct task_struct *p = iterator->start(iterator->arg);
3353 if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3354 pull_task(busiest, p, this_rq, this_cpu);
3356 * Right now, this is only the second place pull_task()
3357 * is called, so we can safely collect pull_task()
3358 * stats here rather than inside pull_task().
3360 schedstat_inc(sd, lb_gained[idle]);
3364 p = iterator->next(iterator->arg);
3371 * move_one_task tries to move exactly one task from busiest to this_rq, as
3372 * part of active balancing operations within "domain".
3373 * Returns 1 if successful and 0 otherwise.
3375 * Called with both runqueues locked.
3377 static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3378 struct sched_domain *sd, enum cpu_idle_type idle)
3380 const struct sched_class *class;
3382 for_each_class(class) {
3383 if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle))
3389 /********** Helpers for find_busiest_group ************************/
3391 * sd_lb_stats - Structure to store the statistics of a sched_domain
3392 * during load balancing.
3394 struct sd_lb_stats {
3395 struct sched_group *busiest; /* Busiest group in this sd */
3396 struct sched_group *this; /* Local group in this sd */
3397 unsigned long total_load; /* Total load of all groups in sd */
3398 unsigned long total_pwr; /* Total power of all groups in sd */
3399 unsigned long avg_load; /* Average load across all groups in sd */
3401 /** Statistics of this group */
3402 unsigned long this_load;
3403 unsigned long this_load_per_task;
3404 unsigned long this_nr_running;
3406 /* Statistics of the busiest group */
3407 unsigned long max_load;
3408 unsigned long busiest_load_per_task;
3409 unsigned long busiest_nr_running;
3411 int group_imb; /* Is there imbalance in this sd */
3412 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3413 int power_savings_balance; /* Is powersave balance needed for this sd */
3414 struct sched_group *group_min; /* Least loaded group in sd */
3415 struct sched_group *group_leader; /* Group which relieves group_min */
3416 unsigned long min_load_per_task; /* load_per_task in group_min */
3417 unsigned long leader_nr_running; /* Nr running of group_leader */
3418 unsigned long min_nr_running; /* Nr running of group_min */
3423 * sg_lb_stats - stats of a sched_group required for load_balancing
3425 struct sg_lb_stats {
3426 unsigned long avg_load; /*Avg load across the CPUs of the group */
3427 unsigned long group_load; /* Total load over the CPUs of the group */
3428 unsigned long sum_nr_running; /* Nr tasks running in the group */
3429 unsigned long sum_weighted_load; /* Weighted load of group's tasks */
3430 unsigned long group_capacity;
3431 int group_imb; /* Is there an imbalance in the group ? */
3435 * group_first_cpu - Returns the first cpu in the cpumask of a sched_group.
3436 * @group: The group whose first cpu is to be returned.
3438 static inline unsigned int group_first_cpu(struct sched_group *group)
3440 return cpumask_first(sched_group_cpus(group));
3444 * get_sd_load_idx - Obtain the load index for a given sched domain.
3445 * @sd: The sched_domain whose load_idx is to be obtained.
3446 * @idle: The Idle status of the CPU for whose sd load_icx is obtained.
3448 static inline int get_sd_load_idx(struct sched_domain *sd,
3449 enum cpu_idle_type idle)
3455 load_idx = sd->busy_idx;
3458 case CPU_NEWLY_IDLE:
3459 load_idx = sd->newidle_idx;
3462 load_idx = sd->idle_idx;
3470 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3472 * init_sd_power_savings_stats - Initialize power savings statistics for
3473 * the given sched_domain, during load balancing.
3475 * @sd: Sched domain whose power-savings statistics are to be initialized.
3476 * @sds: Variable containing the statistics for sd.
3477 * @idle: Idle status of the CPU at which we're performing load-balancing.
3479 static inline void init_sd_power_savings_stats(struct sched_domain *sd,
3480 struct sd_lb_stats *sds, enum cpu_idle_type idle)
3483 * Busy processors will not participate in power savings
3486 if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE))
3487 sds->power_savings_balance = 0;
3489 sds->power_savings_balance = 1;
3490 sds->min_nr_running = ULONG_MAX;
3491 sds->leader_nr_running = 0;
3496 * update_sd_power_savings_stats - Update the power saving stats for a
3497 * sched_domain while performing load balancing.
3499 * @group: sched_group belonging to the sched_domain under consideration.
3500 * @sds: Variable containing the statistics of the sched_domain
3501 * @local_group: Does group contain the CPU for which we're performing
3503 * @sgs: Variable containing the statistics of the group.
3505 static inline void update_sd_power_savings_stats(struct sched_group *group,
3506 struct sd_lb_stats *sds, int local_group, struct sg_lb_stats *sgs)
3509 if (!sds->power_savings_balance)
3513 * If the local group is idle or completely loaded
3514 * no need to do power savings balance at this domain
3516 if (local_group && (sds->this_nr_running >= sgs->group_capacity ||
3517 !sds->this_nr_running))
3518 sds->power_savings_balance = 0;
3521 * If a group is already running at full capacity or idle,
3522 * don't include that group in power savings calculations
3524 if (!sds->power_savings_balance ||
3525 sgs->sum_nr_running >= sgs->group_capacity ||
3526 !sgs->sum_nr_running)
3530 * Calculate the group which has the least non-idle load.
3531 * This is the group from where we need to pick up the load
3534 if ((sgs->sum_nr_running < sds->min_nr_running) ||
3535 (sgs->sum_nr_running == sds->min_nr_running &&
3536 group_first_cpu(group) > group_first_cpu(sds->group_min))) {
3537 sds->group_min = group;
3538 sds->min_nr_running = sgs->sum_nr_running;
3539 sds->min_load_per_task = sgs->sum_weighted_load /
3540 sgs->sum_nr_running;
3544 * Calculate the group which is almost near its
3545 * capacity but still has some space to pick up some load
3546 * from other group and save more power
3548 if (sgs->sum_nr_running + 1 > sgs->group_capacity)
3551 if (sgs->sum_nr_running > sds->leader_nr_running ||
3552 (sgs->sum_nr_running == sds->leader_nr_running &&
3553 group_first_cpu(group) < group_first_cpu(sds->group_leader))) {
3554 sds->group_leader = group;
3555 sds->leader_nr_running = sgs->sum_nr_running;
3560 * check_power_save_busiest_group - see if there is potential for some power-savings balance
3561 * @sds: Variable containing the statistics of the sched_domain
3562 * under consideration.
3563 * @this_cpu: Cpu at which we're currently performing load-balancing.
3564 * @imbalance: Variable to store the imbalance.
3567 * Check if we have potential to perform some power-savings balance.
3568 * If yes, set the busiest group to be the least loaded group in the
3569 * sched_domain, so that it's CPUs can be put to idle.
3571 * Returns 1 if there is potential to perform power-savings balance.
3574 static inline int check_power_save_busiest_group(struct sd_lb_stats *sds,
3575 int this_cpu, unsigned long *imbalance)
3577 if (!sds->power_savings_balance)
3580 if (sds->this != sds->group_leader ||
3581 sds->group_leader == sds->group_min)
3584 *imbalance = sds->min_load_per_task;
3585 sds->busiest = sds->group_min;
3590 #else /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
3591 static inline void init_sd_power_savings_stats(struct sched_domain *sd,
3592 struct sd_lb_stats *sds, enum cpu_idle_type idle)
3597 static inline void update_sd_power_savings_stats(struct sched_group *group,
3598 struct sd_lb_stats *sds, int local_group, struct sg_lb_stats *sgs)
3603 static inline int check_power_save_busiest_group(struct sd_lb_stats *sds,
3604 int this_cpu, unsigned long *imbalance)
3608 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
3611 unsigned long default_scale_freq_power(struct sched_domain *sd, int cpu)
3613 return SCHED_LOAD_SCALE;
3616 unsigned long __weak arch_scale_freq_power(struct sched_domain *sd, int cpu)
3618 return default_scale_freq_power(sd, cpu);
3621 unsigned long default_scale_smt_power(struct sched_domain *sd, int cpu)
3623 unsigned long weight = cpumask_weight(sched_domain_span(sd));
3624 unsigned long smt_gain = sd->smt_gain;
3631 unsigned long __weak arch_scale_smt_power(struct sched_domain *sd, int cpu)
3633 return default_scale_smt_power(sd, cpu);
3636 unsigned long scale_rt_power(int cpu)
3638 struct rq *rq = cpu_rq(cpu);
3639 u64 total, available;
3641 sched_avg_update(rq);
3643 total = sched_avg_period() + (rq->clock - rq->age_stamp);
3644 available = total - rq->rt_avg;
3646 if (unlikely((s64)total < SCHED_LOAD_SCALE))
3647 total = SCHED_LOAD_SCALE;
3649 total >>= SCHED_LOAD_SHIFT;
3651 return div_u64(available, total);
3654 static void update_cpu_power(struct sched_domain *sd, int cpu)
3656 unsigned long weight = cpumask_weight(sched_domain_span(sd));
3657 unsigned long power = SCHED_LOAD_SCALE;
3658 struct sched_group *sdg = sd->groups;
3660 if (sched_feat(ARCH_POWER))
3661 power *= arch_scale_freq_power(sd, cpu);
3663 power *= default_scale_freq_power(sd, cpu);
3665 power >>= SCHED_LOAD_SHIFT;
3667 if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) {
3668 if (sched_feat(ARCH_POWER))
3669 power *= arch_scale_smt_power(sd, cpu);
3671 power *= default_scale_smt_power(sd, cpu);
3673 power >>= SCHED_LOAD_SHIFT;
3676 power *= scale_rt_power(cpu);
3677 power >>= SCHED_LOAD_SHIFT;
3682 sdg->cpu_power = power;
3685 static void update_group_power(struct sched_domain *sd, int cpu)
3687 struct sched_domain *child = sd->child;
3688 struct sched_group *group, *sdg = sd->groups;
3689 unsigned long power;
3692 update_cpu_power(sd, cpu);
3698 group = child->groups;
3700 power += group->cpu_power;
3701 group = group->next;
3702 } while (group != child->groups);
3704 sdg->cpu_power = power;
3708 * update_sg_lb_stats - Update sched_group's statistics for load balancing.
3709 * @sd: The sched_domain whose statistics are to be updated.
3710 * @group: sched_group whose statistics are to be updated.
3711 * @this_cpu: Cpu for which load balance is currently performed.
3712 * @idle: Idle status of this_cpu
3713 * @load_idx: Load index of sched_domain of this_cpu for load calc.
3714 * @sd_idle: Idle status of the sched_domain containing group.
3715 * @local_group: Does group contain this_cpu.
3716 * @cpus: Set of cpus considered for load balancing.
3717 * @balance: Should we balance.
3718 * @sgs: variable to hold the statistics for this group.
3720 static inline void update_sg_lb_stats(struct sched_domain *sd,
3721 struct sched_group *group, int this_cpu,
3722 enum cpu_idle_type idle, int load_idx, int *sd_idle,
3723 int local_group, const struct cpumask *cpus,
3724 int *balance, struct sg_lb_stats *sgs)
3726 unsigned long load, max_cpu_load, min_cpu_load;
3728 unsigned int balance_cpu = -1, first_idle_cpu = 0;
3729 unsigned long sum_avg_load_per_task;
3730 unsigned long avg_load_per_task;
3733 balance_cpu = group_first_cpu(group);
3734 if (balance_cpu == this_cpu)
3735 update_group_power(sd, this_cpu);
3738 /* Tally up the load of all CPUs in the group */
3739 sum_avg_load_per_task = avg_load_per_task = 0;
3741 min_cpu_load = ~0UL;
3743 for_each_cpu_and(i, sched_group_cpus(group), cpus) {
3744 struct rq *rq = cpu_rq(i);
3746 if (*sd_idle && rq->nr_running)
3749 /* Bias balancing toward cpus of our domain */
3751 if (idle_cpu(i) && !first_idle_cpu) {
3756 load = target_load(i, load_idx);
3758 load = source_load(i, load_idx);
3759 if (load > max_cpu_load)
3760 max_cpu_load = load;
3761 if (min_cpu_load > load)
3762 min_cpu_load = load;
3765 sgs->group_load += load;
3766 sgs->sum_nr_running += rq->nr_running;
3767 sgs->sum_weighted_load += weighted_cpuload(i);
3769 sum_avg_load_per_task += cpu_avg_load_per_task(i);
3773 * First idle cpu or the first cpu(busiest) in this sched group
3774 * is eligible for doing load balancing at this and above
3775 * domains. In the newly idle case, we will allow all the cpu's
3776 * to do the newly idle load balance.
3778 if (idle != CPU_NEWLY_IDLE && local_group &&
3779 balance_cpu != this_cpu && balance) {
3784 /* Adjust by relative CPU power of the group */
3785 sgs->avg_load = (sgs->group_load * SCHED_LOAD_SCALE) / group->cpu_power;
3789 * Consider the group unbalanced when the imbalance is larger
3790 * than the average weight of two tasks.
3792 * APZ: with cgroup the avg task weight can vary wildly and
3793 * might not be a suitable number - should we keep a
3794 * normalized nr_running number somewhere that negates
3797 avg_load_per_task = (sum_avg_load_per_task * SCHED_LOAD_SCALE) /
3800 if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task)
3803 sgs->group_capacity =
3804 DIV_ROUND_CLOSEST(group->cpu_power, SCHED_LOAD_SCALE);
3808 * update_sd_lb_stats - Update sched_group's statistics for load balancing.
3809 * @sd: sched_domain whose statistics are to be updated.
3810 * @this_cpu: Cpu for which load balance is currently performed.
3811 * @idle: Idle status of this_cpu
3812 * @sd_idle: Idle status of the sched_domain containing group.
3813 * @cpus: Set of cpus considered for load balancing.
3814 * @balance: Should we balance.
3815 * @sds: variable to hold the statistics for this sched_domain.
3817 static inline void update_sd_lb_stats(struct sched_domain *sd, int this_cpu,
3818 enum cpu_idle_type idle, int *sd_idle,
3819 const struct cpumask *cpus, int *balance,
3820 struct sd_lb_stats *sds)
3822 struct sched_domain *child = sd->child;
3823 struct sched_group *group = sd->groups;
3824 struct sg_lb_stats sgs;
3825 int load_idx, prefer_sibling = 0;
3827 if (child && child->flags & SD_PREFER_SIBLING)
3830 init_sd_power_savings_stats(sd, sds, idle);
3831 load_idx = get_sd_load_idx(sd, idle);
3836 local_group = cpumask_test_cpu(this_cpu,
3837 sched_group_cpus(group));
3838 memset(&sgs, 0, sizeof(sgs));
3839 update_sg_lb_stats(sd, group, this_cpu, idle, load_idx, sd_idle,
3840 local_group, cpus, balance, &sgs);
3842 if (local_group && balance && !(*balance))
3845 sds->total_load += sgs.group_load;
3846 sds->total_pwr += group->cpu_power;
3849 * In case the child domain prefers tasks go to siblings
3850 * first, lower the group capacity to one so that we'll try
3851 * and move all the excess tasks away.
3854 sgs.group_capacity = min(sgs.group_capacity, 1UL);
3857 sds->this_load = sgs.avg_load;
3859 sds->this_nr_running = sgs.sum_nr_running;
3860 sds->this_load_per_task = sgs.sum_weighted_load;
3861 } else if (sgs.avg_load > sds->max_load &&
3862 (sgs.sum_nr_running > sgs.group_capacity ||
3864 sds->max_load = sgs.avg_load;
3865 sds->busiest = group;
3866 sds->busiest_nr_running = sgs.sum_nr_running;
3867 sds->busiest_load_per_task = sgs.sum_weighted_load;
3868 sds->group_imb = sgs.group_imb;
3871 update_sd_power_savings_stats(group, sds, local_group, &sgs);
3872 group = group->next;
3873 } while (group != sd->groups);
3877 * fix_small_imbalance - Calculate the minor imbalance that exists
3878 * amongst the groups of a sched_domain, during
3880 * @sds: Statistics of the sched_domain whose imbalance is to be calculated.
3881 * @this_cpu: The cpu at whose sched_domain we're performing load-balance.
3882 * @imbalance: Variable to store the imbalance.
3884 static inline void fix_small_imbalance(struct sd_lb_stats *sds,
3885 int this_cpu, unsigned long *imbalance)
3887 unsigned long tmp, pwr_now = 0, pwr_move = 0;
3888 unsigned int imbn = 2;
3890 if (sds->this_nr_running) {
3891 sds->this_load_per_task /= sds->this_nr_running;
3892 if (sds->busiest_load_per_task >
3893 sds->this_load_per_task)
3896 sds->this_load_per_task =
3897 cpu_avg_load_per_task(this_cpu);
3899 if (sds->max_load - sds->this_load + sds->busiest_load_per_task >=
3900 sds->busiest_load_per_task * imbn) {
3901 *imbalance = sds->busiest_load_per_task;
3906 * OK, we don't have enough imbalance to justify moving tasks,
3907 * however we may be able to increase total CPU power used by
3911 pwr_now += sds->busiest->cpu_power *
3912 min(sds->busiest_load_per_task, sds->max_load);
3913 pwr_now += sds->this->cpu_power *
3914 min(sds->this_load_per_task, sds->this_load);
3915 pwr_now /= SCHED_LOAD_SCALE;
3917 /* Amount of load we'd subtract */
3918 tmp = (sds->busiest_load_per_task * SCHED_LOAD_SCALE) /
3919 sds->busiest->cpu_power;
3920 if (sds->max_load > tmp)
3921 pwr_move += sds->busiest->cpu_power *
3922 min(sds->busiest_load_per_task, sds->max_load - tmp);
3924 /* Amount of load we'd add */
3925 if (sds->max_load * sds->busiest->cpu_power <
3926 sds->busiest_load_per_task * SCHED_LOAD_SCALE)
3927 tmp = (sds->max_load * sds->busiest->cpu_power) /
3928 sds->this->cpu_power;
3930 tmp = (sds->busiest_load_per_task * SCHED_LOAD_SCALE) /
3931 sds->this->cpu_power;
3932 pwr_move += sds->this->cpu_power *
3933 min(sds->this_load_per_task, sds->this_load + tmp);
3934 pwr_move /= SCHED_LOAD_SCALE;
3936 /* Move if we gain throughput */
3937 if (pwr_move > pwr_now)
3938 *imbalance = sds->busiest_load_per_task;
3942 * calculate_imbalance - Calculate the amount of imbalance present within the
3943 * groups of a given sched_domain during load balance.
3944 * @sds: statistics of the sched_domain whose imbalance is to be calculated.
3945 * @this_cpu: Cpu for which currently load balance is being performed.
3946 * @imbalance: The variable to store the imbalance.
3948 static inline void calculate_imbalance(struct sd_lb_stats *sds, int this_cpu,
3949 unsigned long *imbalance)
3951 unsigned long max_pull;
3953 * In the presence of smp nice balancing, certain scenarios can have
3954 * max load less than avg load(as we skip the groups at or below
3955 * its cpu_power, while calculating max_load..)
3957 if (sds->max_load < sds->avg_load) {
3959 return fix_small_imbalance(sds, this_cpu, imbalance);
3962 /* Don't want to pull so many tasks that a group would go idle */
3963 max_pull = min(sds->max_load - sds->avg_load,
3964 sds->max_load - sds->busiest_load_per_task);
3966 /* How much load to actually move to equalise the imbalance */
3967 *imbalance = min(max_pull * sds->busiest->cpu_power,
3968 (sds->avg_load - sds->this_load) * sds->this->cpu_power)
3972 * if *imbalance is less than the average load per runnable task
3973 * there is no gaurantee that any tasks will be moved so we'll have
3974 * a think about bumping its value to force at least one task to be
3977 if (*imbalance < sds->busiest_load_per_task)
3978 return fix_small_imbalance(sds, this_cpu, imbalance);
3981 /******* find_busiest_group() helpers end here *********************/
3984 * find_busiest_group - Returns the busiest group within the sched_domain
3985 * if there is an imbalance. If there isn't an imbalance, and
3986 * the user has opted for power-savings, it returns a group whose
3987 * CPUs can be put to idle by rebalancing those tasks elsewhere, if
3988 * such a group exists.
3990 * Also calculates the amount of weighted load which should be moved
3991 * to restore balance.
3993 * @sd: The sched_domain whose busiest group is to be returned.
3994 * @this_cpu: The cpu for which load balancing is currently being performed.
3995 * @imbalance: Variable which stores amount of weighted load which should
3996 * be moved to restore balance/put a group to idle.
3997 * @idle: The idle status of this_cpu.
3998 * @sd_idle: The idleness of sd
3999 * @cpus: The set of CPUs under consideration for load-balancing.
4000 * @balance: Pointer to a variable indicating if this_cpu
4001 * is the appropriate cpu to perform load balancing at this_level.
4003 * Returns: - the busiest group if imbalance exists.
4004 * - If no imbalance and user has opted for power-savings balance,
4005 * return the least loaded group whose CPUs can be
4006 * put to idle by rebalancing its tasks onto our group.
4008 static struct sched_group *
4009 find_busiest_group(struct sched_domain *sd, int this_cpu,
4010 unsigned long *imbalance, enum cpu_idle_type idle,
4011 int *sd_idle, const struct cpumask *cpus, int *balance)
4013 struct sd_lb_stats sds;
4015 memset(&sds, 0, sizeof(sds));
4018 * Compute the various statistics relavent for load balancing at
4021 update_sd_lb_stats(sd, this_cpu, idle, sd_idle, cpus,
4024 /* Cases where imbalance does not exist from POV of this_cpu */
4025 /* 1) this_cpu is not the appropriate cpu to perform load balancing
4027 * 2) There is no busy sibling group to pull from.
4028 * 3) This group is the busiest group.
4029 * 4) This group is more busy than the avg busieness at this
4031 * 5) The imbalance is within the specified limit.
4032 * 6) Any rebalance would lead to ping-pong
4034 if (balance && !(*balance))
4037 if (!sds.busiest || sds.busiest_nr_running == 0)
4040 if (sds.this_load >= sds.max_load)
4043 sds.avg_load = (SCHED_LOAD_SCALE * sds.total_load) / sds.total_pwr;
4045 if (sds.this_load >= sds.avg_load)
4048 if (100 * sds.max_load <= sd->imbalance_pct * sds.this_load)
4051 sds.busiest_load_per_task /= sds.busiest_nr_running;
4053 sds.busiest_load_per_task =
4054 min(sds.busiest_load_per_task, sds.avg_load);
4057 * We're trying to get all the cpus to the average_load, so we don't
4058 * want to push ourselves above the average load, nor do we wish to
4059 * reduce the max loaded cpu below the average load, as either of these
4060 * actions would just result in more rebalancing later, and ping-pong
4061 * tasks around. Thus we look for the minimum possible imbalance.
4062 * Negative imbalances (*we* are more loaded than anyone else) will
4063 * be counted as no imbalance for these purposes -- we can't fix that
4064 * by pulling tasks to us. Be careful of negative numbers as they'll
4065 * appear as very large values with unsigned longs.
4067 if (sds.max_load <= sds.busiest_load_per_task)
4070 /* Looks like there is an imbalance. Compute it */
4071 calculate_imbalance(&sds, this_cpu, imbalance);
4076 * There is no obvious imbalance. But check if we can do some balancing
4079 if (check_power_save_busiest_group(&sds, this_cpu, imbalance))
4087 * find_busiest_queue - find the busiest runqueue among the cpus in group.
4090 find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle,
4091 unsigned long imbalance, const struct cpumask *cpus)
4093 struct rq *busiest = NULL, *rq;
4094 unsigned long max_load = 0;
4097 for_each_cpu(i, sched_group_cpus(group)) {
4098 unsigned long power = power_of(i);
4099 unsigned long capacity = DIV_ROUND_CLOSEST(power, SCHED_LOAD_SCALE);
4102 if (!cpumask_test_cpu(i, cpus))
4106 wl = weighted_cpuload(i) * SCHED_LOAD_SCALE;
4109 if (capacity && rq->nr_running == 1 && wl > imbalance)
4112 if (wl > max_load) {
4122 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
4123 * so long as it is large enough.
4125 #define MAX_PINNED_INTERVAL 512
4127 /* Working cpumask for load_balance and load_balance_newidle. */
4128 static DEFINE_PER_CPU(cpumask_var_t, load_balance_tmpmask);
4131 * Check this_cpu to ensure it is balanced within domain. Attempt to move
4132 * tasks if there is an imbalance.
4134 static int load_balance(int this_cpu, struct rq *this_rq,
4135 struct sched_domain *sd, enum cpu_idle_type idle,
4138 int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0;
4139 struct sched_group *group;
4140 unsigned long imbalance;
4142 unsigned long flags;
4143 struct cpumask *cpus = __get_cpu_var(load_balance_tmpmask);
4145 cpumask_copy(cpus, cpu_active_mask);
4148 * When power savings policy is enabled for the parent domain, idle
4149 * sibling can pick up load irrespective of busy siblings. In this case,
4150 * let the state of idle sibling percolate up as CPU_IDLE, instead of
4151 * portraying it as CPU_NOT_IDLE.
4153 if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER &&
4154 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4157 schedstat_inc(sd, lb_count[idle]);
4161 group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle,
4168 schedstat_inc(sd, lb_nobusyg[idle]);
4172 busiest = find_busiest_queue(group, idle, imbalance, cpus);
4174 schedstat_inc(sd, lb_nobusyq[idle]);
4178 BUG_ON(busiest == this_rq);
4180 schedstat_add(sd, lb_imbalance[idle], imbalance);
4183 if (busiest->nr_running > 1) {
4185 * Attempt to move tasks. If find_busiest_group has found
4186 * an imbalance but busiest->nr_running <= 1, the group is
4187 * still unbalanced. ld_moved simply stays zero, so it is
4188 * correctly treated as an imbalance.
4190 local_irq_save(flags);
4191 double_rq_lock(this_rq, busiest);
4192 ld_moved = move_tasks(this_rq, this_cpu, busiest,
4193 imbalance, sd, idle, &all_pinned);
4194 double_rq_unlock(this_rq, busiest);
4195 local_irq_restore(flags);
4198 * some other cpu did the load balance for us.
4200 if (ld_moved && this_cpu != smp_processor_id())
4201 resched_cpu(this_cpu);
4203 /* All tasks on this runqueue were pinned by CPU affinity */
4204 if (unlikely(all_pinned)) {
4205 cpumask_clear_cpu(cpu_of(busiest), cpus);
4206 if (!cpumask_empty(cpus))
4213 schedstat_inc(sd, lb_failed[idle]);
4214 sd->nr_balance_failed++;
4216 if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) {
4218 spin_lock_irqsave(&busiest->lock, flags);
4220 /* don't kick the migration_thread, if the curr
4221 * task on busiest cpu can't be moved to this_cpu
4223 if (!cpumask_test_cpu(this_cpu,
4224 &busiest->curr->cpus_allowed)) {
4225 spin_unlock_irqrestore(&busiest->lock, flags);
4227 goto out_one_pinned;
4230 if (!busiest->active_balance) {
4231 busiest->active_balance = 1;
4232 busiest->push_cpu = this_cpu;
4235 spin_unlock_irqrestore(&busiest->lock, flags);
4237 wake_up_process(busiest->migration_thread);
4240 * We've kicked active balancing, reset the failure
4243 sd->nr_balance_failed = sd->cache_nice_tries+1;
4246 sd->nr_balance_failed = 0;
4248 if (likely(!active_balance)) {
4249 /* We were unbalanced, so reset the balancing interval */
4250 sd->balance_interval = sd->min_interval;
4253 * If we've begun active balancing, start to back off. This
4254 * case may not be covered by the all_pinned logic if there
4255 * is only 1 task on the busy runqueue (because we don't call
4258 if (sd->balance_interval < sd->max_interval)
4259 sd->balance_interval *= 2;
4262 if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4263 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4269 schedstat_inc(sd, lb_balanced[idle]);
4271 sd->nr_balance_failed = 0;
4274 /* tune up the balancing interval */
4275 if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) ||
4276 (sd->balance_interval < sd->max_interval))
4277 sd->balance_interval *= 2;
4279 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4280 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4291 * Check this_cpu to ensure it is balanced within domain. Attempt to move
4292 * tasks if there is an imbalance.
4294 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
4295 * this_rq is locked.
4298 load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd)
4300 struct sched_group *group;
4301 struct rq *busiest = NULL;
4302 unsigned long imbalance;
4306 struct cpumask *cpus = __get_cpu_var(load_balance_tmpmask);
4308 cpumask_copy(cpus, cpu_active_mask);
4311 * When power savings policy is enabled for the parent domain, idle
4312 * sibling can pick up load irrespective of busy siblings. In this case,
4313 * let the state of idle sibling percolate up as IDLE, instead of
4314 * portraying it as CPU_NOT_IDLE.
4316 if (sd->flags & SD_SHARE_CPUPOWER &&
4317 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4320 schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]);
4322 update_shares_locked(this_rq, sd);
4323 group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE,
4324 &sd_idle, cpus, NULL);
4326 schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]);
4330 busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus);
4332 schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]);
4336 BUG_ON(busiest == this_rq);
4338 schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance);
4341 if (busiest->nr_running > 1) {
4342 /* Attempt to move tasks */
4343 double_lock_balance(this_rq, busiest);
4344 /* this_rq->clock is already updated */
4345 update_rq_clock(busiest);
4346 ld_moved = move_tasks(this_rq, this_cpu, busiest,
4347 imbalance, sd, CPU_NEWLY_IDLE,
4349 double_unlock_balance(this_rq, busiest);
4351 if (unlikely(all_pinned)) {
4352 cpumask_clear_cpu(cpu_of(busiest), cpus);
4353 if (!cpumask_empty(cpus))
4359 int active_balance = 0;
4361 schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]);
4362 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4363 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4366 if (sched_mc_power_savings < POWERSAVINGS_BALANCE_WAKEUP)
4369 if (sd->nr_balance_failed++ < 2)
4373 * The only task running in a non-idle cpu can be moved to this
4374 * cpu in an attempt to completely freeup the other CPU
4375 * package. The same method used to move task in load_balance()
4376 * have been extended for load_balance_newidle() to speedup
4377 * consolidation at sched_mc=POWERSAVINGS_BALANCE_WAKEUP (2)
4379 * The package power saving logic comes from
4380 * find_busiest_group(). If there are no imbalance, then
4381 * f_b_g() will return NULL. However when sched_mc={1,2} then
4382 * f_b_g() will select a group from which a running task may be
4383 * pulled to this cpu in order to make the other package idle.
4384 * If there is no opportunity to make a package idle and if
4385 * there are no imbalance, then f_b_g() will return NULL and no
4386 * action will be taken in load_balance_newidle().
4388 * Under normal task pull operation due to imbalance, there
4389 * will be more than one task in the source run queue and
4390 * move_tasks() will succeed. ld_moved will be true and this
4391 * active balance code will not be triggered.
4394 /* Lock busiest in correct order while this_rq is held */
4395 double_lock_balance(this_rq, busiest);
4398 * don't kick the migration_thread, if the curr
4399 * task on busiest cpu can't be moved to this_cpu
4401 if (!cpumask_test_cpu(this_cpu, &busiest->curr->cpus_allowed)) {
4402 double_unlock_balance(this_rq, busiest);
4407 if (!busiest->active_balance) {
4408 busiest->active_balance = 1;
4409 busiest->push_cpu = this_cpu;
4413 double_unlock_balance(this_rq, busiest);
4415 * Should not call ttwu while holding a rq->lock
4417 spin_unlock(&this_rq->lock);
4419 wake_up_process(busiest->migration_thread);
4420 spin_lock(&this_rq->lock);
4423 sd->nr_balance_failed = 0;
4425 update_shares_locked(this_rq, sd);
4429 schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]);
4430 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
4431 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
4433 sd->nr_balance_failed = 0;
4439 * idle_balance is called by schedule() if this_cpu is about to become
4440 * idle. Attempts to pull tasks from other CPUs.
4442 static void idle_balance(int this_cpu, struct rq *this_rq)
4444 struct sched_domain *sd;
4445 int pulled_task = 0;
4446 unsigned long next_balance = jiffies + HZ;
4448 this_rq->idle_stamp = this_rq->clock;
4450 if (this_rq->avg_idle < sysctl_sched_migration_cost)
4453 for_each_domain(this_cpu, sd) {
4454 unsigned long interval;
4456 if (!(sd->flags & SD_LOAD_BALANCE))
4459 if (sd->flags & SD_BALANCE_NEWIDLE)
4460 /* If we've pulled tasks over stop searching: */
4461 pulled_task = load_balance_newidle(this_cpu, this_rq,
4464 interval = msecs_to_jiffies(sd->balance_interval);
4465 if (time_after(next_balance, sd->last_balance + interval))
4466 next_balance = sd->last_balance + interval;
4468 this_rq->idle_stamp = 0;
4472 if (pulled_task || time_after(jiffies, this_rq->next_balance)) {
4474 * We are going idle. next_balance may be set based on
4475 * a busy processor. So reset next_balance.
4477 this_rq->next_balance = next_balance;
4482 * active_load_balance is run by migration threads. It pushes running tasks
4483 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
4484 * running on each physical CPU where possible, and avoids physical /
4485 * logical imbalances.
4487 * Called with busiest_rq locked.
4489 static void active_load_balance(struct rq *busiest_rq, int busiest_cpu)
4491 int target_cpu = busiest_rq->push_cpu;
4492 struct sched_domain *sd;
4493 struct rq *target_rq;
4495 /* Is there any task to move? */
4496 if (busiest_rq->nr_running <= 1)
4499 target_rq = cpu_rq(target_cpu);
4502 * This condition is "impossible", if it occurs
4503 * we need to fix it. Originally reported by
4504 * Bjorn Helgaas on a 128-cpu setup.
4506 BUG_ON(busiest_rq == target_rq);
4508 /* move a task from busiest_rq to target_rq */
4509 double_lock_balance(busiest_rq, target_rq);
4510 update_rq_clock(busiest_rq);
4511 update_rq_clock(target_rq);
4513 /* Search for an sd spanning us and the target CPU. */
4514 for_each_domain(target_cpu, sd) {
4515 if ((sd->flags & SD_LOAD_BALANCE) &&
4516 cpumask_test_cpu(busiest_cpu, sched_domain_span(sd)))
4521 schedstat_inc(sd, alb_count);
4523 if (move_one_task(target_rq, target_cpu, busiest_rq,
4525 schedstat_inc(sd, alb_pushed);
4527 schedstat_inc(sd, alb_failed);
4529 double_unlock_balance(busiest_rq, target_rq);
4534 atomic_t load_balancer;
4535 cpumask_var_t cpu_mask;
4536 cpumask_var_t ilb_grp_nohz_mask;
4537 } nohz ____cacheline_aligned = {
4538 .load_balancer = ATOMIC_INIT(-1),
4541 int get_nohz_load_balancer(void)
4543 return atomic_read(&nohz.load_balancer);
4546 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
4548 * lowest_flag_domain - Return lowest sched_domain containing flag.
4549 * @cpu: The cpu whose lowest level of sched domain is to
4551 * @flag: The flag to check for the lowest sched_domain
4552 * for the given cpu.
4554 * Returns the lowest sched_domain of a cpu which contains the given flag.
4556 static inline struct sched_domain *lowest_flag_domain(int cpu, int flag)
4558 struct sched_domain *sd;
4560 for_each_domain(cpu, sd)
4561 if (sd && (sd->flags & flag))
4568 * for_each_flag_domain - Iterates over sched_domains containing the flag.
4569 * @cpu: The cpu whose domains we're iterating over.
4570 * @sd: variable holding the value of the power_savings_sd
4572 * @flag: The flag to filter the sched_domains to be iterated.
4574 * Iterates over all the scheduler domains for a given cpu that has the 'flag'
4575 * set, starting from the lowest sched_domain to the highest.
4577 #define for_each_flag_domain(cpu, sd, flag) \
4578 for (sd = lowest_flag_domain(cpu, flag); \
4579 (sd && (sd->flags & flag)); sd = sd->parent)
4582 * is_semi_idle_group - Checks if the given sched_group is semi-idle.
4583 * @ilb_group: group to be checked for semi-idleness
4585 * Returns: 1 if the group is semi-idle. 0 otherwise.
4587 * We define a sched_group to be semi idle if it has atleast one idle-CPU
4588 * and atleast one non-idle CPU. This helper function checks if the given
4589 * sched_group is semi-idle or not.
4591 static inline int is_semi_idle_group(struct sched_group *ilb_group)
4593 cpumask_and(nohz.ilb_grp_nohz_mask, nohz.cpu_mask,
4594 sched_group_cpus(ilb_group));
4597 * A sched_group is semi-idle when it has atleast one busy cpu
4598 * and atleast one idle cpu.
4600 if (cpumask_empty(nohz.ilb_grp_nohz_mask))
4603 if (cpumask_equal(nohz.ilb_grp_nohz_mask, sched_group_cpus(ilb_group)))
4609 * find_new_ilb - Finds the optimum idle load balancer for nomination.
4610 * @cpu: The cpu which is nominating a new idle_load_balancer.
4612 * Returns: Returns the id of the idle load balancer if it exists,
4613 * Else, returns >= nr_cpu_ids.
4615 * This algorithm picks the idle load balancer such that it belongs to a
4616 * semi-idle powersavings sched_domain. The idea is to try and avoid
4617 * completely idle packages/cores just for the purpose of idle load balancing
4618 * when there are other idle cpu's which are better suited for that job.
4620 static int find_new_ilb(int cpu)
4622 struct sched_domain *sd;
4623 struct sched_group *ilb_group;
4626 * Have idle load balancer selection from semi-idle packages only
4627 * when power-aware load balancing is enabled
4629 if (!(sched_smt_power_savings || sched_mc_power_savings))
4633 * Optimize for the case when we have no idle CPUs or only one
4634 * idle CPU. Don't walk the sched_domain hierarchy in such cases
4636 if (cpumask_weight(nohz.cpu_mask) < 2)
4639 for_each_flag_domain(cpu, sd, SD_POWERSAVINGS_BALANCE) {
4640 ilb_group = sd->groups;
4643 if (is_semi_idle_group(ilb_group))
4644 return cpumask_first(nohz.ilb_grp_nohz_mask);
4646 ilb_group = ilb_group->next;
4648 } while (ilb_group != sd->groups);
4652 return cpumask_first(nohz.cpu_mask);
4654 #else /* (CONFIG_SCHED_MC || CONFIG_SCHED_SMT) */
4655 static inline int find_new_ilb(int call_cpu)
4657 return cpumask_first(nohz.cpu_mask);
4662 * This routine will try to nominate the ilb (idle load balancing)
4663 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
4664 * load balancing on behalf of all those cpus. If all the cpus in the system
4665 * go into this tickless mode, then there will be no ilb owner (as there is
4666 * no need for one) and all the cpus will sleep till the next wakeup event
4669 * For the ilb owner, tick is not stopped. And this tick will be used
4670 * for idle load balancing. ilb owner will still be part of
4673 * While stopping the tick, this cpu will become the ilb owner if there
4674 * is no other owner. And will be the owner till that cpu becomes busy
4675 * or if all cpus in the system stop their ticks at which point
4676 * there is no need for ilb owner.
4678 * When the ilb owner becomes busy, it nominates another owner, during the
4679 * next busy scheduler_tick()
4681 int select_nohz_load_balancer(int stop_tick)
4683 int cpu = smp_processor_id();
4686 cpu_rq(cpu)->in_nohz_recently = 1;
4688 if (!cpu_active(cpu)) {
4689 if (atomic_read(&nohz.load_balancer) != cpu)
4693 * If we are going offline and still the leader,
4696 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4702 cpumask_set_cpu(cpu, nohz.cpu_mask);
4704 /* time for ilb owner also to sleep */
4705 if (cpumask_weight(nohz.cpu_mask) == num_active_cpus()) {
4706 if (atomic_read(&nohz.load_balancer) == cpu)
4707 atomic_set(&nohz.load_balancer, -1);
4711 if (atomic_read(&nohz.load_balancer) == -1) {
4712 /* make me the ilb owner */
4713 if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1)
4715 } else if (atomic_read(&nohz.load_balancer) == cpu) {
4718 if (!(sched_smt_power_savings ||
4719 sched_mc_power_savings))
4722 * Check to see if there is a more power-efficient
4725 new_ilb = find_new_ilb(cpu);
4726 if (new_ilb < nr_cpu_ids && new_ilb != cpu) {
4727 atomic_set(&nohz.load_balancer, -1);
4728 resched_cpu(new_ilb);
4734 if (!cpumask_test_cpu(cpu, nohz.cpu_mask))
4737 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4739 if (atomic_read(&nohz.load_balancer) == cpu)
4740 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4747 static DEFINE_SPINLOCK(balancing);
4750 * It checks each scheduling domain to see if it is due to be balanced,
4751 * and initiates a balancing operation if so.
4753 * Balancing parameters are set up in arch_init_sched_domains.
4755 static void rebalance_domains(int cpu, enum cpu_idle_type idle)
4758 struct rq *rq = cpu_rq(cpu);
4759 unsigned long interval;
4760 struct sched_domain *sd;
4761 /* Earliest time when we have to do rebalance again */
4762 unsigned long next_balance = jiffies + 60*HZ;
4763 int update_next_balance = 0;
4766 for_each_domain(cpu, sd) {
4767 if (!(sd->flags & SD_LOAD_BALANCE))
4770 interval = sd->balance_interval;
4771 if (idle != CPU_IDLE)
4772 interval *= sd->busy_factor;
4774 /* scale ms to jiffies */
4775 interval = msecs_to_jiffies(interval);
4776 if (unlikely(!interval))
4778 if (interval > HZ*NR_CPUS/10)
4779 interval = HZ*NR_CPUS/10;
4781 need_serialize = sd->flags & SD_SERIALIZE;
4783 if (need_serialize) {
4784 if (!spin_trylock(&balancing))
4788 if (time_after_eq(jiffies, sd->last_balance + interval)) {
4789 if (load_balance(cpu, rq, sd, idle, &balance)) {
4791 * We've pulled tasks over so either we're no
4792 * longer idle, or one of our SMT siblings is
4795 idle = CPU_NOT_IDLE;
4797 sd->last_balance = jiffies;
4800 spin_unlock(&balancing);
4802 if (time_after(next_balance, sd->last_balance + interval)) {
4803 next_balance = sd->last_balance + interval;
4804 update_next_balance = 1;
4808 * Stop the load balance at this level. There is another
4809 * CPU in our sched group which is doing load balancing more
4817 * next_balance will be updated only when there is a need.
4818 * When the cpu is attached to null domain for ex, it will not be
4821 if (likely(update_next_balance))
4822 rq->next_balance = next_balance;
4826 * run_rebalance_domains is triggered when needed from the scheduler tick.
4827 * In CONFIG_NO_HZ case, the idle load balance owner will do the
4828 * rebalancing for all the cpus for whom scheduler ticks are stopped.
4830 static void run_rebalance_domains(struct softirq_action *h)
4832 int this_cpu = smp_processor_id();
4833 struct rq *this_rq = cpu_rq(this_cpu);
4834 enum cpu_idle_type idle = this_rq->idle_at_tick ?
4835 CPU_IDLE : CPU_NOT_IDLE;
4837 rebalance_domains(this_cpu, idle);
4841 * If this cpu is the owner for idle load balancing, then do the
4842 * balancing on behalf of the other idle cpus whose ticks are
4845 if (this_rq->idle_at_tick &&
4846 atomic_read(&nohz.load_balancer) == this_cpu) {
4850 for_each_cpu(balance_cpu, nohz.cpu_mask) {
4851 if (balance_cpu == this_cpu)
4855 * If this cpu gets work to do, stop the load balancing
4856 * work being done for other cpus. Next load
4857 * balancing owner will pick it up.
4862 rebalance_domains(balance_cpu, CPU_IDLE);
4864 rq = cpu_rq(balance_cpu);
4865 if (time_after(this_rq->next_balance, rq->next_balance))
4866 this_rq->next_balance = rq->next_balance;
4872 static inline int on_null_domain(int cpu)
4874 return !rcu_dereference(cpu_rq(cpu)->sd);
4878 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
4880 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
4881 * idle load balancing owner or decide to stop the periodic load balancing,
4882 * if the whole system is idle.
4884 static inline void trigger_load_balance(struct rq *rq, int cpu)
4888 * If we were in the nohz mode recently and busy at the current
4889 * scheduler tick, then check if we need to nominate new idle
4892 if (rq->in_nohz_recently && !rq->idle_at_tick) {
4893 rq->in_nohz_recently = 0;
4895 if (atomic_read(&nohz.load_balancer) == cpu) {
4896 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4897 atomic_set(&nohz.load_balancer, -1);
4900 if (atomic_read(&nohz.load_balancer) == -1) {
4901 int ilb = find_new_ilb(cpu);
4903 if (ilb < nr_cpu_ids)
4909 * If this cpu is idle and doing idle load balancing for all the
4910 * cpus with ticks stopped, is it time for that to stop?
4912 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu &&
4913 cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
4919 * If this cpu is idle and the idle load balancing is done by
4920 * someone else, then no need raise the SCHED_SOFTIRQ
4922 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu &&
4923 cpumask_test_cpu(cpu, nohz.cpu_mask))
4926 /* Don't need to rebalance while attached to NULL domain */
4927 if (time_after_eq(jiffies, rq->next_balance) &&
4928 likely(!on_null_domain(cpu)))
4929 raise_softirq(SCHED_SOFTIRQ);
4932 #else /* CONFIG_SMP */
4935 * on UP we do not need to balance between CPUs:
4937 static inline void idle_balance(int cpu, struct rq *rq)
4943 DEFINE_PER_CPU(struct kernel_stat, kstat);
4945 EXPORT_PER_CPU_SYMBOL(kstat);
4948 * Return any ns on the sched_clock that have not yet been accounted in
4949 * @p in case that task is currently running.
4951 * Called with task_rq_lock() held on @rq.
4953 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
4957 if (task_current(rq, p)) {
4958 update_rq_clock(rq);
4959 ns = rq->clock - p->se.exec_start;
4967 unsigned long long task_delta_exec(struct task_struct *p)
4969 unsigned long flags;
4973 rq = task_rq_lock(p, &flags);
4974 ns = do_task_delta_exec(p, rq);
4975 task_rq_unlock(rq, &flags);
4981 * Return accounted runtime for the task.
4982 * In case the task is currently running, return the runtime plus current's
4983 * pending runtime that have not been accounted yet.
4985 unsigned long long task_sched_runtime(struct task_struct *p)
4987 unsigned long flags;
4991 rq = task_rq_lock(p, &flags);
4992 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
4993 task_rq_unlock(rq, &flags);
4999 * Return sum_exec_runtime for the thread group.
5000 * In case the task is currently running, return the sum plus current's
5001 * pending runtime that have not been accounted yet.
5003 * Note that the thread group might have other running tasks as well,
5004 * so the return value not includes other pending runtime that other
5005 * running tasks might have.
5007 unsigned long long thread_group_sched_runtime(struct task_struct *p)
5009 struct task_cputime totals;
5010 unsigned long flags;
5014 rq = task_rq_lock(p, &flags);
5015 thread_group_cputime(p, &totals);
5016 ns = totals.sum_exec_runtime + do_task_delta_exec(p, rq);
5017 task_rq_unlock(rq, &flags);
5023 * Account user cpu time to a process.
5024 * @p: the process that the cpu time gets accounted to
5025 * @cputime: the cpu time spent in user space since the last update
5026 * @cputime_scaled: cputime scaled by cpu frequency
5028 void account_user_time(struct task_struct *p, cputime_t cputime,
5029 cputime_t cputime_scaled)
5031 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5034 /* Add user time to process. */
5035 p->utime = cputime_add(p->utime, cputime);
5036 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
5037 account_group_user_time(p, cputime);
5039 /* Add user time to cpustat. */
5040 tmp = cputime_to_cputime64(cputime);
5041 if (TASK_NICE(p) > 0)
5042 cpustat->nice = cputime64_add(cpustat->nice, tmp);
5044 cpustat->user = cputime64_add(cpustat->user, tmp);
5046 cpuacct_update_stats(p, CPUACCT_STAT_USER, cputime);
5047 /* Account for user time used */
5048 acct_update_integrals(p);
5052 * Account guest cpu time to a process.
5053 * @p: the process that the cpu time gets accounted to
5054 * @cputime: the cpu time spent in virtual machine since the last update
5055 * @cputime_scaled: cputime scaled by cpu frequency
5057 static void account_guest_time(struct task_struct *p, cputime_t cputime,
5058 cputime_t cputime_scaled)
5061 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5063 tmp = cputime_to_cputime64(cputime);
5065 /* Add guest time to process. */
5066 p->utime = cputime_add(p->utime, cputime);
5067 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
5068 account_group_user_time(p, cputime);
5069 p->gtime = cputime_add(p->gtime, cputime);
5071 /* Add guest time to cpustat. */
5072 if (TASK_NICE(p) > 0) {
5073 cpustat->nice = cputime64_add(cpustat->nice, tmp);
5074 cpustat->guest_nice = cputime64_add(cpustat->guest_nice, tmp);
5076 cpustat->user = cputime64_add(cpustat->user, tmp);
5077 cpustat->guest = cputime64_add(cpustat->guest, tmp);
5082 * Account system cpu time to a process.
5083 * @p: the process that the cpu time gets accounted to
5084 * @hardirq_offset: the offset to subtract from hardirq_count()
5085 * @cputime: the cpu time spent in kernel space since the last update
5086 * @cputime_scaled: cputime scaled by cpu frequency
5088 void account_system_time(struct task_struct *p, int hardirq_offset,
5089 cputime_t cputime, cputime_t cputime_scaled)
5091 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5094 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
5095 account_guest_time(p, cputime, cputime_scaled);
5099 /* Add system time to process. */
5100 p->stime = cputime_add(p->stime, cputime);
5101 p->stimescaled = cputime_add(p->stimescaled, cputime_scaled);
5102 account_group_system_time(p, cputime);
5104 /* Add system time to cpustat. */
5105 tmp = cputime_to_cputime64(cputime);
5106 if (hardirq_count() - hardirq_offset)
5107 cpustat->irq = cputime64_add(cpustat->irq, tmp);
5108 else if (softirq_count())
5109 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
5111 cpustat->system = cputime64_add(cpustat->system, tmp);
5113 cpuacct_update_stats(p, CPUACCT_STAT_SYSTEM, cputime);
5115 /* Account for system time used */
5116 acct_update_integrals(p);
5120 * Account for involuntary wait time.
5121 * @steal: the cpu time spent in involuntary wait
5123 void account_steal_time(cputime_t cputime)
5125 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5126 cputime64_t cputime64 = cputime_to_cputime64(cputime);
5128 cpustat->steal = cputime64_add(cpustat->steal, cputime64);
5132 * Account for idle time.
5133 * @cputime: the cpu time spent in idle wait
5135 void account_idle_time(cputime_t cputime)
5137 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
5138 cputime64_t cputime64 = cputime_to_cputime64(cputime);
5139 struct rq *rq = this_rq();
5141 if (atomic_read(&rq->nr_iowait) > 0)
5142 cpustat->iowait = cputime64_add(cpustat->iowait, cputime64);
5144 cpustat->idle = cputime64_add(cpustat->idle, cputime64);
5147 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
5150 * Account a single tick of cpu time.
5151 * @p: the process that the cpu time gets accounted to
5152 * @user_tick: indicates if the tick is a user or a system tick
5154 void account_process_tick(struct task_struct *p, int user_tick)
5156 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
5157 struct rq *rq = this_rq();
5160 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
5161 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
5162 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
5165 account_idle_time(cputime_one_jiffy);
5169 * Account multiple ticks of steal time.
5170 * @p: the process from which the cpu time has been stolen
5171 * @ticks: number of stolen ticks
5173 void account_steal_ticks(unsigned long ticks)
5175 account_steal_time(jiffies_to_cputime(ticks));
5179 * Account multiple ticks of idle time.
5180 * @ticks: number of stolen ticks
5182 void account_idle_ticks(unsigned long ticks)
5184 account_idle_time(jiffies_to_cputime(ticks));
5190 * Use precise platform statistics if available:
5192 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
5193 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5199 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5201 struct task_cputime cputime;
5203 thread_group_cputime(p, &cputime);
5205 *ut = cputime.utime;
5206 *st = cputime.stime;
5210 #ifndef nsecs_to_cputime
5211 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
5214 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5216 cputime_t rtime, utime = p->utime, total = cputime_add(utime, p->stime);
5219 * Use CFS's precise accounting:
5221 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
5226 temp = (u64)(rtime * utime);
5227 do_div(temp, total);
5228 utime = (cputime_t)temp;
5233 * Compare with previous values, to keep monotonicity:
5235 p->prev_utime = max(p->prev_utime, utime);
5236 p->prev_stime = max(p->prev_stime, cputime_sub(rtime, p->prev_utime));
5238 *ut = p->prev_utime;
5239 *st = p->prev_stime;
5243 * Must be called with siglock held.
5245 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
5247 struct signal_struct *sig = p->signal;
5248 struct task_cputime cputime;
5249 cputime_t rtime, utime, total;
5251 thread_group_cputime(p, &cputime);
5253 total = cputime_add(cputime.utime, cputime.stime);
5254 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
5259 temp = (u64)(rtime * cputime.utime);
5260 do_div(temp, total);
5261 utime = (cputime_t)temp;
5265 sig->prev_utime = max(sig->prev_utime, utime);
5266 sig->prev_stime = max(sig->prev_stime,
5267 cputime_sub(rtime, sig->prev_utime));
5269 *ut = sig->prev_utime;
5270 *st = sig->prev_stime;
5275 * This function gets called by the timer code, with HZ frequency.
5276 * We call it with interrupts disabled.
5278 * It also gets called by the fork code, when changing the parent's
5281 void scheduler_tick(void)
5283 int cpu = smp_processor_id();
5284 struct rq *rq = cpu_rq(cpu);
5285 struct task_struct *curr = rq->curr;
5289 spin_lock(&rq->lock);
5290 update_rq_clock(rq);
5291 update_cpu_load(rq);
5292 curr->sched_class->task_tick(rq, curr, 0);
5293 spin_unlock(&rq->lock);
5295 perf_event_task_tick(curr, cpu);
5298 rq->idle_at_tick = idle_cpu(cpu);
5299 trigger_load_balance(rq, cpu);
5303 notrace unsigned long get_parent_ip(unsigned long addr)
5305 if (in_lock_functions(addr)) {
5306 addr = CALLER_ADDR2;
5307 if (in_lock_functions(addr))
5308 addr = CALLER_ADDR3;
5313 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
5314 defined(CONFIG_PREEMPT_TRACER))
5316 void __kprobes add_preempt_count(int val)
5318 #ifdef CONFIG_DEBUG_PREEMPT
5322 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
5325 preempt_count() += val;
5326 #ifdef CONFIG_DEBUG_PREEMPT
5328 * Spinlock count overflowing soon?
5330 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
5333 if (preempt_count() == val)
5334 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
5336 EXPORT_SYMBOL(add_preempt_count);
5338 void __kprobes sub_preempt_count(int val)
5340 #ifdef CONFIG_DEBUG_PREEMPT
5344 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
5347 * Is the spinlock portion underflowing?
5349 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
5350 !(preempt_count() & PREEMPT_MASK)))
5354 if (preempt_count() == val)
5355 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
5356 preempt_count() -= val;
5358 EXPORT_SYMBOL(sub_preempt_count);
5363 * Print scheduling while atomic bug:
5365 static noinline void __schedule_bug(struct task_struct *prev)
5367 struct pt_regs *regs = get_irq_regs();
5369 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
5370 prev->comm, prev->pid, preempt_count());
5372 debug_show_held_locks(prev);
5374 if (irqs_disabled())
5375 print_irqtrace_events(prev);
5384 * Various schedule()-time debugging checks and statistics:
5386 static inline void schedule_debug(struct task_struct *prev)
5389 * Test if we are atomic. Since do_exit() needs to call into
5390 * schedule() atomically, we ignore that path for now.
5391 * Otherwise, whine if we are scheduling when we should not be.
5393 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
5394 __schedule_bug(prev);
5396 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
5398 schedstat_inc(this_rq(), sched_count);
5399 #ifdef CONFIG_SCHEDSTATS
5400 if (unlikely(prev->lock_depth >= 0)) {
5401 schedstat_inc(this_rq(), bkl_count);
5402 schedstat_inc(prev, sched_info.bkl_count);
5407 static void put_prev_task(struct rq *rq, struct task_struct *p)
5409 u64 runtime = p->se.sum_exec_runtime - p->se.prev_sum_exec_runtime;
5411 update_avg(&p->se.avg_running, runtime);
5413 if (p->state == TASK_RUNNING) {
5415 * In order to avoid avg_overlap growing stale when we are
5416 * indeed overlapping and hence not getting put to sleep, grow
5417 * the avg_overlap on preemption.
5419 * We use the average preemption runtime because that
5420 * correlates to the amount of cache footprint a task can
5423 runtime = min_t(u64, runtime, 2*sysctl_sched_migration_cost);
5424 update_avg(&p->se.avg_overlap, runtime);
5426 update_avg(&p->se.avg_running, 0);
5428 p->sched_class->put_prev_task(rq, p);
5432 * Pick up the highest-prio task:
5434 static inline struct task_struct *
5435 pick_next_task(struct rq *rq)
5437 const struct sched_class *class;
5438 struct task_struct *p;
5441 * Optimization: we know that if all tasks are in
5442 * the fair class we can call that function directly:
5444 if (likely(rq->nr_running == rq->cfs.nr_running)) {
5445 p = fair_sched_class.pick_next_task(rq);
5450 class = sched_class_highest;
5452 p = class->pick_next_task(rq);
5456 * Will never be NULL as the idle class always
5457 * returns a non-NULL p:
5459 class = class->next;
5464 * schedule() is the main scheduler function.
5466 asmlinkage void __sched schedule(void)
5468 struct task_struct *prev, *next;
5469 unsigned long *switch_count;
5475 cpu = smp_processor_id();
5479 switch_count = &prev->nivcsw;
5481 release_kernel_lock(prev);
5482 need_resched_nonpreemptible:
5484 schedule_debug(prev);
5486 if (sched_feat(HRTICK))
5489 spin_lock_irq(&rq->lock);
5490 update_rq_clock(rq);
5491 clear_tsk_need_resched(prev);
5493 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
5494 if (unlikely(signal_pending_state(prev->state, prev)))
5495 prev->state = TASK_RUNNING;
5497 deactivate_task(rq, prev, 1);
5498 switch_count = &prev->nvcsw;
5501 pre_schedule(rq, prev);
5503 if (unlikely(!rq->nr_running))
5504 idle_balance(cpu, rq);
5506 put_prev_task(rq, prev);
5507 next = pick_next_task(rq);
5509 if (likely(prev != next)) {
5510 sched_info_switch(prev, next);
5511 perf_event_task_sched_out(prev, next, cpu);
5517 context_switch(rq, prev, next); /* unlocks the rq */
5519 * the context switch might have flipped the stack from under
5520 * us, hence refresh the local variables.
5522 cpu = smp_processor_id();
5525 spin_unlock_irq(&rq->lock);
5529 if (unlikely(reacquire_kernel_lock(current) < 0))
5530 goto need_resched_nonpreemptible;
5532 preempt_enable_no_resched();
5536 EXPORT_SYMBOL(schedule);
5538 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
5540 * Look out! "owner" is an entirely speculative pointer
5541 * access and not reliable.
5543 int mutex_spin_on_owner(struct mutex *lock, struct thread_info *owner)
5548 if (!sched_feat(OWNER_SPIN))
5551 #ifdef CONFIG_DEBUG_PAGEALLOC
5553 * Need to access the cpu field knowing that
5554 * DEBUG_PAGEALLOC could have unmapped it if
5555 * the mutex owner just released it and exited.
5557 if (probe_kernel_address(&owner->cpu, cpu))
5564 * Even if the access succeeded (likely case),
5565 * the cpu field may no longer be valid.
5567 if (cpu >= nr_cpumask_bits)
5571 * We need to validate that we can do a
5572 * get_cpu() and that we have the percpu area.
5574 if (!cpu_online(cpu))
5581 * Owner changed, break to re-assess state.
5583 if (lock->owner != owner)
5587 * Is that owner really running on that cpu?
5589 if (task_thread_info(rq->curr) != owner || need_resched())
5599 #ifdef CONFIG_PREEMPT
5601 * this is the entry point to schedule() from in-kernel preemption
5602 * off of preempt_enable. Kernel preemptions off return from interrupt
5603 * occur there and call schedule directly.
5605 asmlinkage void __sched preempt_schedule(void)
5607 struct thread_info *ti = current_thread_info();
5610 * If there is a non-zero preempt_count or interrupts are disabled,
5611 * we do not want to preempt the current task. Just return..
5613 if (likely(ti->preempt_count || irqs_disabled()))
5617 add_preempt_count(PREEMPT_ACTIVE);
5619 sub_preempt_count(PREEMPT_ACTIVE);
5622 * Check again in case we missed a preemption opportunity
5623 * between schedule and now.
5626 } while (need_resched());
5628 EXPORT_SYMBOL(preempt_schedule);
5631 * this is the entry point to schedule() from kernel preemption
5632 * off of irq context.
5633 * Note, that this is called and return with irqs disabled. This will
5634 * protect us against recursive calling from irq.
5636 asmlinkage void __sched preempt_schedule_irq(void)
5638 struct thread_info *ti = current_thread_info();
5640 /* Catch callers which need to be fixed */
5641 BUG_ON(ti->preempt_count || !irqs_disabled());
5644 add_preempt_count(PREEMPT_ACTIVE);
5647 local_irq_disable();
5648 sub_preempt_count(PREEMPT_ACTIVE);
5651 * Check again in case we missed a preemption opportunity
5652 * between schedule and now.
5655 } while (need_resched());
5658 #endif /* CONFIG_PREEMPT */
5660 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
5663 return try_to_wake_up(curr->private, mode, wake_flags);
5665 EXPORT_SYMBOL(default_wake_function);
5668 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
5669 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
5670 * number) then we wake all the non-exclusive tasks and one exclusive task.
5672 * There are circumstances in which we can try to wake a task which has already
5673 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
5674 * zero in this (rare) case, and we handle it by continuing to scan the queue.
5676 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
5677 int nr_exclusive, int wake_flags, void *key)
5679 wait_queue_t *curr, *next;
5681 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
5682 unsigned flags = curr->flags;
5684 if (curr->func(curr, mode, wake_flags, key) &&
5685 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
5691 * __wake_up - wake up threads blocked on a waitqueue.
5693 * @mode: which threads
5694 * @nr_exclusive: how many wake-one or wake-many threads to wake up
5695 * @key: is directly passed to the wakeup function
5697 * It may be assumed that this function implies a write memory barrier before
5698 * changing the task state if and only if any tasks are woken up.
5700 void __wake_up(wait_queue_head_t *q, unsigned int mode,
5701 int nr_exclusive, void *key)
5703 unsigned long flags;
5705 spin_lock_irqsave(&q->lock, flags);
5706 __wake_up_common(q, mode, nr_exclusive, 0, key);
5707 spin_unlock_irqrestore(&q->lock, flags);
5709 EXPORT_SYMBOL(__wake_up);
5712 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
5714 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
5716 __wake_up_common(q, mode, 1, 0, NULL);
5719 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
5721 __wake_up_common(q, mode, 1, 0, key);
5725 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
5727 * @mode: which threads
5728 * @nr_exclusive: how many wake-one or wake-many threads to wake up
5729 * @key: opaque value to be passed to wakeup targets
5731 * The sync wakeup differs that the waker knows that it will schedule
5732 * away soon, so while the target thread will be woken up, it will not
5733 * be migrated to another CPU - ie. the two threads are 'synchronized'
5734 * with each other. This can prevent needless bouncing between CPUs.
5736 * On UP it can prevent extra preemption.
5738 * It may be assumed that this function implies a write memory barrier before
5739 * changing the task state if and only if any tasks are woken up.
5741 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
5742 int nr_exclusive, void *key)
5744 unsigned long flags;
5745 int wake_flags = WF_SYNC;
5750 if (unlikely(!nr_exclusive))
5753 spin_lock_irqsave(&q->lock, flags);
5754 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
5755 spin_unlock_irqrestore(&q->lock, flags);
5757 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
5760 * __wake_up_sync - see __wake_up_sync_key()
5762 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
5764 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
5766 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
5769 * complete: - signals a single thread waiting on this completion
5770 * @x: holds the state of this particular completion
5772 * This will wake up a single thread waiting on this completion. Threads will be
5773 * awakened in the same order in which they were queued.
5775 * See also complete_all(), wait_for_completion() and related routines.
5777 * It may be assumed that this function implies a write memory barrier before
5778 * changing the task state if and only if any tasks are woken up.
5780 void complete(struct completion *x)
5782 unsigned long flags;
5784 spin_lock_irqsave(&x->wait.lock, flags);
5786 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
5787 spin_unlock_irqrestore(&x->wait.lock, flags);
5789 EXPORT_SYMBOL(complete);
5792 * complete_all: - signals all threads waiting on this completion
5793 * @x: holds the state of this particular completion
5795 * This will wake up all threads waiting on this particular completion event.
5797 * It may be assumed that this function implies a write memory barrier before
5798 * changing the task state if and only if any tasks are woken up.
5800 void complete_all(struct completion *x)
5802 unsigned long flags;
5804 spin_lock_irqsave(&x->wait.lock, flags);
5805 x->done += UINT_MAX/2;
5806 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
5807 spin_unlock_irqrestore(&x->wait.lock, flags);
5809 EXPORT_SYMBOL(complete_all);
5811 static inline long __sched
5812 do_wait_for_common(struct completion *x, long timeout, int state)
5815 DECLARE_WAITQUEUE(wait, current);
5817 wait.flags |= WQ_FLAG_EXCLUSIVE;
5818 __add_wait_queue_tail(&x->wait, &wait);
5820 if (signal_pending_state(state, current)) {
5821 timeout = -ERESTARTSYS;
5824 __set_current_state(state);
5825 spin_unlock_irq(&x->wait.lock);
5826 timeout = schedule_timeout(timeout);
5827 spin_lock_irq(&x->wait.lock);
5828 } while (!x->done && timeout);
5829 __remove_wait_queue(&x->wait, &wait);
5834 return timeout ?: 1;
5838 wait_for_common(struct completion *x, long timeout, int state)
5842 spin_lock_irq(&x->wait.lock);
5843 timeout = do_wait_for_common(x, timeout, state);
5844 spin_unlock_irq(&x->wait.lock);
5849 * wait_for_completion: - waits for completion of a task
5850 * @x: holds the state of this particular completion
5852 * This waits to be signaled for completion of a specific task. It is NOT
5853 * interruptible and there is no timeout.
5855 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
5856 * and interrupt capability. Also see complete().
5858 void __sched wait_for_completion(struct completion *x)
5860 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
5862 EXPORT_SYMBOL(wait_for_completion);
5865 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
5866 * @x: holds the state of this particular completion
5867 * @timeout: timeout value in jiffies
5869 * This waits for either a completion of a specific task to be signaled or for a
5870 * specified timeout to expire. The timeout is in jiffies. It is not
5873 unsigned long __sched
5874 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
5876 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
5878 EXPORT_SYMBOL(wait_for_completion_timeout);
5881 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
5882 * @x: holds the state of this particular completion
5884 * This waits for completion of a specific task to be signaled. It is
5887 int __sched wait_for_completion_interruptible(struct completion *x)
5889 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
5890 if (t == -ERESTARTSYS)
5894 EXPORT_SYMBOL(wait_for_completion_interruptible);
5897 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
5898 * @x: holds the state of this particular completion
5899 * @timeout: timeout value in jiffies
5901 * This waits for either a completion of a specific task to be signaled or for a
5902 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
5904 unsigned long __sched
5905 wait_for_completion_interruptible_timeout(struct completion *x,
5906 unsigned long timeout)
5908 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
5910 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
5913 * wait_for_completion_killable: - waits for completion of a task (killable)
5914 * @x: holds the state of this particular completion
5916 * This waits to be signaled for completion of a specific task. It can be
5917 * interrupted by a kill signal.
5919 int __sched wait_for_completion_killable(struct completion *x)
5921 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
5922 if (t == -ERESTARTSYS)
5926 EXPORT_SYMBOL(wait_for_completion_killable);
5929 * try_wait_for_completion - try to decrement a completion without blocking
5930 * @x: completion structure
5932 * Returns: 0 if a decrement cannot be done without blocking
5933 * 1 if a decrement succeeded.
5935 * If a completion is being used as a counting completion,
5936 * attempt to decrement the counter without blocking. This
5937 * enables us to avoid waiting if the resource the completion
5938 * is protecting is not available.
5940 bool try_wait_for_completion(struct completion *x)
5944 spin_lock_irq(&x->wait.lock);
5949 spin_unlock_irq(&x->wait.lock);
5952 EXPORT_SYMBOL(try_wait_for_completion);
5955 * completion_done - Test to see if a completion has any waiters
5956 * @x: completion structure
5958 * Returns: 0 if there are waiters (wait_for_completion() in progress)
5959 * 1 if there are no waiters.
5962 bool completion_done(struct completion *x)
5966 spin_lock_irq(&x->wait.lock);
5969 spin_unlock_irq(&x->wait.lock);
5972 EXPORT_SYMBOL(completion_done);
5975 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
5977 unsigned long flags;
5980 init_waitqueue_entry(&wait, current);
5982 __set_current_state(state);
5984 spin_lock_irqsave(&q->lock, flags);
5985 __add_wait_queue(q, &wait);
5986 spin_unlock(&q->lock);
5987 timeout = schedule_timeout(timeout);
5988 spin_lock_irq(&q->lock);
5989 __remove_wait_queue(q, &wait);
5990 spin_unlock_irqrestore(&q->lock, flags);
5995 void __sched interruptible_sleep_on(wait_queue_head_t *q)
5997 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
5999 EXPORT_SYMBOL(interruptible_sleep_on);
6002 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
6004 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
6006 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
6008 void __sched sleep_on(wait_queue_head_t *q)
6010 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
6012 EXPORT_SYMBOL(sleep_on);
6014 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
6016 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
6018 EXPORT_SYMBOL(sleep_on_timeout);
6020 #ifdef CONFIG_RT_MUTEXES
6023 * rt_mutex_setprio - set the current priority of a task
6025 * @prio: prio value (kernel-internal form)
6027 * This function changes the 'effective' priority of a task. It does
6028 * not touch ->normal_prio like __setscheduler().
6030 * Used by the rt_mutex code to implement priority inheritance logic.
6032 void rt_mutex_setprio(struct task_struct *p, int prio)
6034 unsigned long flags;
6035 int oldprio, on_rq, running;
6037 const struct sched_class *prev_class = p->sched_class;
6039 BUG_ON(prio < 0 || prio > MAX_PRIO);
6041 rq = task_rq_lock(p, &flags);
6042 update_rq_clock(rq);
6045 on_rq = p->se.on_rq;
6046 running = task_current(rq, p);
6048 dequeue_task(rq, p, 0);
6050 p->sched_class->put_prev_task(rq, p);
6053 p->sched_class = &rt_sched_class;
6055 p->sched_class = &fair_sched_class;
6060 p->sched_class->set_curr_task(rq);
6062 enqueue_task(rq, p, 0);
6064 check_class_changed(rq, p, prev_class, oldprio, running);
6066 task_rq_unlock(rq, &flags);
6071 void set_user_nice(struct task_struct *p, long nice)
6073 int old_prio, delta, on_rq;
6074 unsigned long flags;
6077 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
6080 * We have to be careful, if called from sys_setpriority(),
6081 * the task might be in the middle of scheduling on another CPU.
6083 rq = task_rq_lock(p, &flags);
6084 update_rq_clock(rq);
6086 * The RT priorities are set via sched_setscheduler(), but we still
6087 * allow the 'normal' nice value to be set - but as expected
6088 * it wont have any effect on scheduling until the task is
6089 * SCHED_FIFO/SCHED_RR:
6091 if (task_has_rt_policy(p)) {
6092 p->static_prio = NICE_TO_PRIO(nice);
6095 on_rq = p->se.on_rq;
6097 dequeue_task(rq, p, 0);
6099 p->static_prio = NICE_TO_PRIO(nice);
6102 p->prio = effective_prio(p);
6103 delta = p->prio - old_prio;
6106 enqueue_task(rq, p, 0);
6108 * If the task increased its priority or is running and
6109 * lowered its priority, then reschedule its CPU:
6111 if (delta < 0 || (delta > 0 && task_running(rq, p)))
6112 resched_task(rq->curr);
6115 task_rq_unlock(rq, &flags);
6117 EXPORT_SYMBOL(set_user_nice);
6120 * can_nice - check if a task can reduce its nice value
6124 int can_nice(const struct task_struct *p, const int nice)
6126 /* convert nice value [19,-20] to rlimit style value [1,40] */
6127 int nice_rlim = 20 - nice;
6129 return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur ||
6130 capable(CAP_SYS_NICE));
6133 #ifdef __ARCH_WANT_SYS_NICE
6136 * sys_nice - change the priority of the current process.
6137 * @increment: priority increment
6139 * sys_setpriority is a more generic, but much slower function that
6140 * does similar things.
6142 SYSCALL_DEFINE1(nice, int, increment)
6147 * Setpriority might change our priority at the same moment.
6148 * We don't have to worry. Conceptually one call occurs first
6149 * and we have a single winner.
6151 if (increment < -40)
6156 nice = TASK_NICE(current) + increment;
6162 if (increment < 0 && !can_nice(current, nice))
6165 retval = security_task_setnice(current, nice);
6169 set_user_nice(current, nice);
6176 * task_prio - return the priority value of a given task.
6177 * @p: the task in question.
6179 * This is the priority value as seen by users in /proc.
6180 * RT tasks are offset by -200. Normal tasks are centered
6181 * around 0, value goes from -16 to +15.
6183 int task_prio(const struct task_struct *p)
6185 return p->prio - MAX_RT_PRIO;
6189 * task_nice - return the nice value of a given task.
6190 * @p: the task in question.
6192 int task_nice(const struct task_struct *p)
6194 return TASK_NICE(p);
6196 EXPORT_SYMBOL(task_nice);
6199 * idle_cpu - is a given cpu idle currently?
6200 * @cpu: the processor in question.
6202 int idle_cpu(int cpu)
6204 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
6208 * idle_task - return the idle task for a given cpu.
6209 * @cpu: the processor in question.
6211 struct task_struct *idle_task(int cpu)
6213 return cpu_rq(cpu)->idle;
6217 * find_process_by_pid - find a process with a matching PID value.
6218 * @pid: the pid in question.
6220 static struct task_struct *find_process_by_pid(pid_t pid)
6222 return pid ? find_task_by_vpid(pid) : current;
6225 /* Actually do priority change: must hold rq lock. */
6227 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
6229 BUG_ON(p->se.on_rq);
6232 p->rt_priority = prio;
6233 p->normal_prio = normal_prio(p);
6234 /* we are holding p->pi_lock already */
6235 p->prio = rt_mutex_getprio(p);
6236 if (rt_prio(p->prio))
6237 p->sched_class = &rt_sched_class;
6239 p->sched_class = &fair_sched_class;
6244 * check the target process has a UID that matches the current process's
6246 static bool check_same_owner(struct task_struct *p)
6248 const struct cred *cred = current_cred(), *pcred;
6252 pcred = __task_cred(p);
6253 match = (cred->euid == pcred->euid ||
6254 cred->euid == pcred->uid);
6259 static int __sched_setscheduler(struct task_struct *p, int policy,
6260 struct sched_param *param, bool user)
6262 int retval, oldprio, oldpolicy = -1, on_rq, running;
6263 unsigned long flags;
6264 const struct sched_class *prev_class = p->sched_class;
6268 /* may grab non-irq protected spin_locks */
6269 BUG_ON(in_interrupt());
6271 /* double check policy once rq lock held */
6273 reset_on_fork = p->sched_reset_on_fork;
6274 policy = oldpolicy = p->policy;
6276 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
6277 policy &= ~SCHED_RESET_ON_FORK;
6279 if (policy != SCHED_FIFO && policy != SCHED_RR &&
6280 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
6281 policy != SCHED_IDLE)
6286 * Valid priorities for SCHED_FIFO and SCHED_RR are
6287 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
6288 * SCHED_BATCH and SCHED_IDLE is 0.
6290 if (param->sched_priority < 0 ||
6291 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
6292 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
6294 if (rt_policy(policy) != (param->sched_priority != 0))
6298 * Allow unprivileged RT tasks to decrease priority:
6300 if (user && !capable(CAP_SYS_NICE)) {
6301 if (rt_policy(policy)) {
6302 unsigned long rlim_rtprio;
6304 if (!lock_task_sighand(p, &flags))
6306 rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur;
6307 unlock_task_sighand(p, &flags);
6309 /* can't set/change the rt policy */
6310 if (policy != p->policy && !rlim_rtprio)
6313 /* can't increase priority */
6314 if (param->sched_priority > p->rt_priority &&
6315 param->sched_priority > rlim_rtprio)
6319 * Like positive nice levels, dont allow tasks to
6320 * move out of SCHED_IDLE either:
6322 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
6325 /* can't change other user's priorities */
6326 if (!check_same_owner(p))
6329 /* Normal users shall not reset the sched_reset_on_fork flag */
6330 if (p->sched_reset_on_fork && !reset_on_fork)
6335 #ifdef CONFIG_RT_GROUP_SCHED
6337 * Do not allow realtime tasks into groups that have no runtime
6340 if (rt_bandwidth_enabled() && rt_policy(policy) &&
6341 task_group(p)->rt_bandwidth.rt_runtime == 0)
6345 retval = security_task_setscheduler(p, policy, param);
6351 * make sure no PI-waiters arrive (or leave) while we are
6352 * changing the priority of the task:
6354 spin_lock_irqsave(&p->pi_lock, flags);
6356 * To be able to change p->policy safely, the apropriate
6357 * runqueue lock must be held.
6359 rq = __task_rq_lock(p);
6360 /* recheck policy now with rq lock held */
6361 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
6362 policy = oldpolicy = -1;
6363 __task_rq_unlock(rq);
6364 spin_unlock_irqrestore(&p->pi_lock, flags);
6367 update_rq_clock(rq);
6368 on_rq = p->se.on_rq;
6369 running = task_current(rq, p);
6371 deactivate_task(rq, p, 0);
6373 p->sched_class->put_prev_task(rq, p);
6375 p->sched_reset_on_fork = reset_on_fork;
6378 __setscheduler(rq, p, policy, param->sched_priority);
6381 p->sched_class->set_curr_task(rq);
6383 activate_task(rq, p, 0);
6385 check_class_changed(rq, p, prev_class, oldprio, running);
6387 __task_rq_unlock(rq);
6388 spin_unlock_irqrestore(&p->pi_lock, flags);
6390 rt_mutex_adjust_pi(p);
6396 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
6397 * @p: the task in question.
6398 * @policy: new policy.
6399 * @param: structure containing the new RT priority.
6401 * NOTE that the task may be already dead.
6403 int sched_setscheduler(struct task_struct *p, int policy,
6404 struct sched_param *param)
6406 return __sched_setscheduler(p, policy, param, true);
6408 EXPORT_SYMBOL_GPL(sched_setscheduler);
6411 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
6412 * @p: the task in question.
6413 * @policy: new policy.
6414 * @param: structure containing the new RT priority.
6416 * Just like sched_setscheduler, only don't bother checking if the
6417 * current context has permission. For example, this is needed in
6418 * stop_machine(): we create temporary high priority worker threads,
6419 * but our caller might not have that capability.
6421 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
6422 struct sched_param *param)
6424 return __sched_setscheduler(p, policy, param, false);
6428 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
6430 struct sched_param lparam;
6431 struct task_struct *p;
6434 if (!param || pid < 0)
6436 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
6441 p = find_process_by_pid(pid);
6443 retval = sched_setscheduler(p, policy, &lparam);
6450 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
6451 * @pid: the pid in question.
6452 * @policy: new policy.
6453 * @param: structure containing the new RT priority.
6455 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
6456 struct sched_param __user *, param)
6458 /* negative values for policy are not valid */
6462 return do_sched_setscheduler(pid, policy, param);
6466 * sys_sched_setparam - set/change the RT priority of a thread
6467 * @pid: the pid in question.
6468 * @param: structure containing the new RT priority.
6470 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
6472 return do_sched_setscheduler(pid, -1, param);
6476 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
6477 * @pid: the pid in question.
6479 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
6481 struct task_struct *p;
6488 read_lock(&tasklist_lock);
6489 p = find_process_by_pid(pid);
6491 retval = security_task_getscheduler(p);
6494 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
6496 read_unlock(&tasklist_lock);
6501 * sys_sched_getparam - get the RT priority of a thread
6502 * @pid: the pid in question.
6503 * @param: structure containing the RT priority.
6505 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
6507 struct sched_param lp;
6508 struct task_struct *p;
6511 if (!param || pid < 0)
6514 read_lock(&tasklist_lock);
6515 p = find_process_by_pid(pid);
6520 retval = security_task_getscheduler(p);
6524 lp.sched_priority = p->rt_priority;
6525 read_unlock(&tasklist_lock);
6528 * This one might sleep, we cannot do it with a spinlock held ...
6530 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
6535 read_unlock(&tasklist_lock);
6539 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
6541 cpumask_var_t cpus_allowed, new_mask;
6542 struct task_struct *p;
6546 read_lock(&tasklist_lock);
6548 p = find_process_by_pid(pid);
6550 read_unlock(&tasklist_lock);
6556 * It is not safe to call set_cpus_allowed with the
6557 * tasklist_lock held. We will bump the task_struct's
6558 * usage count and then drop tasklist_lock.
6561 read_unlock(&tasklist_lock);
6563 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
6567 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
6569 goto out_free_cpus_allowed;
6572 if (!check_same_owner(p) && !capable(CAP_SYS_NICE))
6575 retval = security_task_setscheduler(p, 0, NULL);
6579 cpuset_cpus_allowed(p, cpus_allowed);
6580 cpumask_and(new_mask, in_mask, cpus_allowed);
6582 retval = set_cpus_allowed_ptr(p, new_mask);
6585 cpuset_cpus_allowed(p, cpus_allowed);
6586 if (!cpumask_subset(new_mask, cpus_allowed)) {
6588 * We must have raced with a concurrent cpuset
6589 * update. Just reset the cpus_allowed to the
6590 * cpuset's cpus_allowed
6592 cpumask_copy(new_mask, cpus_allowed);
6597 free_cpumask_var(new_mask);
6598 out_free_cpus_allowed:
6599 free_cpumask_var(cpus_allowed);
6606 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
6607 struct cpumask *new_mask)
6609 if (len < cpumask_size())
6610 cpumask_clear(new_mask);
6611 else if (len > cpumask_size())
6612 len = cpumask_size();
6614 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
6618 * sys_sched_setaffinity - set the cpu affinity of a process
6619 * @pid: pid of the process
6620 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
6621 * @user_mask_ptr: user-space pointer to the new cpu mask
6623 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
6624 unsigned long __user *, user_mask_ptr)
6626 cpumask_var_t new_mask;
6629 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
6632 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
6634 retval = sched_setaffinity(pid, new_mask);
6635 free_cpumask_var(new_mask);
6639 long sched_getaffinity(pid_t pid, struct cpumask *mask)
6641 struct task_struct *p;
6642 unsigned long flags;
6647 read_lock(&tasklist_lock);
6650 p = find_process_by_pid(pid);
6654 retval = security_task_getscheduler(p);
6658 rq = task_rq_lock(p, &flags);
6659 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
6660 task_rq_unlock(rq, &flags);
6663 read_unlock(&tasklist_lock);
6670 * sys_sched_getaffinity - get the cpu affinity of a process
6671 * @pid: pid of the process
6672 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
6673 * @user_mask_ptr: user-space pointer to hold the current cpu mask
6675 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
6676 unsigned long __user *, user_mask_ptr)
6681 if (len < cpumask_size())
6684 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
6687 ret = sched_getaffinity(pid, mask);
6689 if (copy_to_user(user_mask_ptr, mask, cpumask_size()))
6692 ret = cpumask_size();
6694 free_cpumask_var(mask);
6700 * sys_sched_yield - yield the current processor to other threads.
6702 * This function yields the current CPU to other tasks. If there are no
6703 * other threads running on this CPU then this function will return.
6705 SYSCALL_DEFINE0(sched_yield)
6707 struct rq *rq = this_rq_lock();
6709 schedstat_inc(rq, yld_count);
6710 current->sched_class->yield_task(rq);
6713 * Since we are going to call schedule() anyway, there's
6714 * no need to preempt or enable interrupts:
6716 __release(rq->lock);
6717 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
6718 _raw_spin_unlock(&rq->lock);
6719 preempt_enable_no_resched();
6726 static inline int should_resched(void)
6728 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
6731 static void __cond_resched(void)
6733 add_preempt_count(PREEMPT_ACTIVE);
6735 sub_preempt_count(PREEMPT_ACTIVE);
6738 int __sched _cond_resched(void)
6740 if (should_resched()) {
6746 EXPORT_SYMBOL(_cond_resched);
6749 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
6750 * call schedule, and on return reacquire the lock.
6752 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
6753 * operations here to prevent schedule() from being called twice (once via
6754 * spin_unlock(), once by hand).
6756 int __cond_resched_lock(spinlock_t *lock)
6758 int resched = should_resched();
6761 lockdep_assert_held(lock);
6763 if (spin_needbreak(lock) || resched) {
6774 EXPORT_SYMBOL(__cond_resched_lock);
6776 int __sched __cond_resched_softirq(void)
6778 BUG_ON(!in_softirq());
6780 if (should_resched()) {
6788 EXPORT_SYMBOL(__cond_resched_softirq);
6791 * yield - yield the current processor to other threads.
6793 * This is a shortcut for kernel-space yielding - it marks the
6794 * thread runnable and calls sys_sched_yield().
6796 void __sched yield(void)
6798 set_current_state(TASK_RUNNING);
6801 EXPORT_SYMBOL(yield);
6804 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
6805 * that process accounting knows that this is a task in IO wait state.
6807 void __sched io_schedule(void)
6809 struct rq *rq = raw_rq();
6811 delayacct_blkio_start();
6812 atomic_inc(&rq->nr_iowait);
6813 current->in_iowait = 1;
6815 current->in_iowait = 0;
6816 atomic_dec(&rq->nr_iowait);
6817 delayacct_blkio_end();
6819 EXPORT_SYMBOL(io_schedule);
6821 long __sched io_schedule_timeout(long timeout)
6823 struct rq *rq = raw_rq();
6826 delayacct_blkio_start();
6827 atomic_inc(&rq->nr_iowait);
6828 current->in_iowait = 1;
6829 ret = schedule_timeout(timeout);
6830 current->in_iowait = 0;
6831 atomic_dec(&rq->nr_iowait);
6832 delayacct_blkio_end();
6837 * sys_sched_get_priority_max - return maximum RT priority.
6838 * @policy: scheduling class.
6840 * this syscall returns the maximum rt_priority that can be used
6841 * by a given scheduling class.
6843 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
6850 ret = MAX_USER_RT_PRIO-1;
6862 * sys_sched_get_priority_min - return minimum RT priority.
6863 * @policy: scheduling class.
6865 * this syscall returns the minimum rt_priority that can be used
6866 * by a given scheduling class.
6868 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
6886 * sys_sched_rr_get_interval - return the default timeslice of a process.
6887 * @pid: pid of the process.
6888 * @interval: userspace pointer to the timeslice value.
6890 * this syscall writes the default timeslice value of a given process
6891 * into the user-space timespec buffer. A value of '0' means infinity.
6893 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
6894 struct timespec __user *, interval)
6896 struct task_struct *p;
6897 unsigned int time_slice;
6898 unsigned long flags;
6907 read_lock(&tasklist_lock);
6908 p = find_process_by_pid(pid);
6912 retval = security_task_getscheduler(p);
6916 rq = task_rq_lock(p, &flags);
6917 time_slice = p->sched_class->get_rr_interval(rq, p);
6918 task_rq_unlock(rq, &flags);
6920 read_unlock(&tasklist_lock);
6921 jiffies_to_timespec(time_slice, &t);
6922 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
6926 read_unlock(&tasklist_lock);
6930 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
6932 void sched_show_task(struct task_struct *p)
6934 unsigned long free = 0;
6937 state = p->state ? __ffs(p->state) + 1 : 0;
6938 printk(KERN_INFO "%-13.13s %c", p->comm,
6939 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
6940 #if BITS_PER_LONG == 32
6941 if (state == TASK_RUNNING)
6942 printk(KERN_CONT " running ");
6944 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
6946 if (state == TASK_RUNNING)
6947 printk(KERN_CONT " running task ");
6949 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
6951 #ifdef CONFIG_DEBUG_STACK_USAGE
6952 free = stack_not_used(p);
6954 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
6955 task_pid_nr(p), task_pid_nr(p->real_parent),
6956 (unsigned long)task_thread_info(p)->flags);
6958 show_stack(p, NULL);
6961 void show_state_filter(unsigned long state_filter)
6963 struct task_struct *g, *p;
6965 #if BITS_PER_LONG == 32
6967 " task PC stack pid father\n");
6970 " task PC stack pid father\n");
6972 read_lock(&tasklist_lock);
6973 do_each_thread(g, p) {
6975 * reset the NMI-timeout, listing all files on a slow
6976 * console might take alot of time:
6978 touch_nmi_watchdog();
6979 if (!state_filter || (p->state & state_filter))
6981 } while_each_thread(g, p);
6983 touch_all_softlockup_watchdogs();
6985 #ifdef CONFIG_SCHED_DEBUG
6986 sysrq_sched_debug_show();
6988 read_unlock(&tasklist_lock);
6990 * Only show locks if all tasks are dumped:
6993 debug_show_all_locks();
6996 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
6998 idle->sched_class = &idle_sched_class;
7002 * init_idle - set up an idle thread for a given CPU
7003 * @idle: task in question
7004 * @cpu: cpu the idle task belongs to
7006 * NOTE: this function does not set the idle thread's NEED_RESCHED
7007 * flag, to make booting more robust.
7009 void __cpuinit init_idle(struct task_struct *idle, int cpu)
7011 struct rq *rq = cpu_rq(cpu);
7012 unsigned long flags;
7014 spin_lock_irqsave(&rq->lock, flags);
7017 idle->se.exec_start = sched_clock();
7019 idle->prio = idle->normal_prio = MAX_PRIO;
7020 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
7021 __set_task_cpu(idle, cpu);
7023 rq->curr = rq->idle = idle;
7024 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
7027 spin_unlock_irqrestore(&rq->lock, flags);
7029 /* Set the preempt count _outside_ the spinlocks! */
7030 #if defined(CONFIG_PREEMPT)
7031 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
7033 task_thread_info(idle)->preempt_count = 0;
7036 * The idle tasks have their own, simple scheduling class:
7038 idle->sched_class = &idle_sched_class;
7039 ftrace_graph_init_task(idle);
7043 * In a system that switches off the HZ timer nohz_cpu_mask
7044 * indicates which cpus entered this state. This is used
7045 * in the rcu update to wait only for active cpus. For system
7046 * which do not switch off the HZ timer nohz_cpu_mask should
7047 * always be CPU_BITS_NONE.
7049 cpumask_var_t nohz_cpu_mask;
7052 * Increase the granularity value when there are more CPUs,
7053 * because with more CPUs the 'effective latency' as visible
7054 * to users decreases. But the relationship is not linear,
7055 * so pick a second-best guess by going with the log2 of the
7058 * This idea comes from the SD scheduler of Con Kolivas:
7060 static inline void sched_init_granularity(void)
7062 unsigned int factor = 1 + ilog2(num_online_cpus());
7063 const unsigned long limit = 200000000;
7065 sysctl_sched_min_granularity *= factor;
7066 if (sysctl_sched_min_granularity > limit)
7067 sysctl_sched_min_granularity = limit;
7069 sysctl_sched_latency *= factor;
7070 if (sysctl_sched_latency > limit)
7071 sysctl_sched_latency = limit;
7073 sysctl_sched_wakeup_granularity *= factor;
7075 sysctl_sched_shares_ratelimit *= factor;
7080 * This is how migration works:
7082 * 1) we queue a struct migration_req structure in the source CPU's
7083 * runqueue and wake up that CPU's migration thread.
7084 * 2) we down() the locked semaphore => thread blocks.
7085 * 3) migration thread wakes up (implicitly it forces the migrated
7086 * thread off the CPU)
7087 * 4) it gets the migration request and checks whether the migrated
7088 * task is still in the wrong runqueue.
7089 * 5) if it's in the wrong runqueue then the migration thread removes
7090 * it and puts it into the right queue.
7091 * 6) migration thread up()s the semaphore.
7092 * 7) we wake up and the migration is done.
7096 * Change a given task's CPU affinity. Migrate the thread to a
7097 * proper CPU and schedule it away if the CPU it's executing on
7098 * is removed from the allowed bitmask.
7100 * NOTE: the caller must have a valid reference to the task, the
7101 * task must not exit() & deallocate itself prematurely. The
7102 * call is not atomic; no spinlocks may be held.
7104 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
7106 struct migration_req req;
7107 unsigned long flags;
7111 rq = task_rq_lock(p, &flags);
7112 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
7117 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
7118 !cpumask_equal(&p->cpus_allowed, new_mask))) {
7123 if (p->sched_class->set_cpus_allowed)
7124 p->sched_class->set_cpus_allowed(p, new_mask);
7126 cpumask_copy(&p->cpus_allowed, new_mask);
7127 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
7130 /* Can the task run on the task's current CPU? If so, we're done */
7131 if (cpumask_test_cpu(task_cpu(p), new_mask))
7134 if (migrate_task(p, cpumask_any_and(cpu_active_mask, new_mask), &req)) {
7135 /* Need help from migration thread: drop lock and wait. */
7136 struct task_struct *mt = rq->migration_thread;
7138 get_task_struct(mt);
7139 task_rq_unlock(rq, &flags);
7140 wake_up_process(rq->migration_thread);
7141 put_task_struct(mt);
7142 wait_for_completion(&req.done);
7143 tlb_migrate_finish(p->mm);
7147 task_rq_unlock(rq, &flags);
7151 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
7154 * Move (not current) task off this cpu, onto dest cpu. We're doing
7155 * this because either it can't run here any more (set_cpus_allowed()
7156 * away from this CPU, or CPU going down), or because we're
7157 * attempting to rebalance this task on exec (sched_exec).
7159 * So we race with normal scheduler movements, but that's OK, as long
7160 * as the task is no longer on this CPU.
7162 * Returns non-zero if task was successfully migrated.
7164 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
7166 struct rq *rq_dest, *rq_src;
7169 if (unlikely(!cpu_active(dest_cpu)))
7172 rq_src = cpu_rq(src_cpu);
7173 rq_dest = cpu_rq(dest_cpu);
7175 double_rq_lock(rq_src, rq_dest);
7176 /* Already moved. */
7177 if (task_cpu(p) != src_cpu)
7179 /* Affinity changed (again). */
7180 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
7183 on_rq = p->se.on_rq;
7185 deactivate_task(rq_src, p, 0);
7187 set_task_cpu(p, dest_cpu);
7189 activate_task(rq_dest, p, 0);
7190 check_preempt_curr(rq_dest, p, 0);
7195 double_rq_unlock(rq_src, rq_dest);
7199 #define RCU_MIGRATION_IDLE 0
7200 #define RCU_MIGRATION_NEED_QS 1
7201 #define RCU_MIGRATION_GOT_QS 2
7202 #define RCU_MIGRATION_MUST_SYNC 3
7205 * migration_thread - this is a highprio system thread that performs
7206 * thread migration by bumping thread off CPU then 'pushing' onto
7209 static int migration_thread(void *data)
7212 int cpu = (long)data;
7216 BUG_ON(rq->migration_thread != current);
7218 set_current_state(TASK_INTERRUPTIBLE);
7219 while (!kthread_should_stop()) {
7220 struct migration_req *req;
7221 struct list_head *head;
7223 spin_lock_irq(&rq->lock);
7225 if (cpu_is_offline(cpu)) {
7226 spin_unlock_irq(&rq->lock);
7230 if (rq->active_balance) {
7231 active_load_balance(rq, cpu);
7232 rq->active_balance = 0;
7235 head = &rq->migration_queue;
7237 if (list_empty(head)) {
7238 spin_unlock_irq(&rq->lock);
7240 set_current_state(TASK_INTERRUPTIBLE);
7243 req = list_entry(head->next, struct migration_req, list);
7244 list_del_init(head->next);
7246 if (req->task != NULL) {
7247 spin_unlock(&rq->lock);
7248 __migrate_task(req->task, cpu, req->dest_cpu);
7249 } else if (likely(cpu == (badcpu = smp_processor_id()))) {
7250 req->dest_cpu = RCU_MIGRATION_GOT_QS;
7251 spin_unlock(&rq->lock);
7253 req->dest_cpu = RCU_MIGRATION_MUST_SYNC;
7254 spin_unlock(&rq->lock);
7255 WARN_ONCE(1, "migration_thread() on CPU %d, expected %d\n", badcpu, cpu);
7259 complete(&req->done);
7261 __set_current_state(TASK_RUNNING);
7266 #ifdef CONFIG_HOTPLUG_CPU
7268 static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu)
7272 local_irq_disable();
7273 ret = __migrate_task(p, src_cpu, dest_cpu);
7279 * Figure out where task on dead CPU should go, use force if necessary.
7281 static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
7284 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(dead_cpu));
7287 /* Look for allowed, online CPU in same node. */
7288 for_each_cpu_and(dest_cpu, nodemask, cpu_active_mask)
7289 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
7292 /* Any allowed, online CPU? */
7293 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_active_mask);
7294 if (dest_cpu < nr_cpu_ids)
7297 /* No more Mr. Nice Guy. */
7298 if (dest_cpu >= nr_cpu_ids) {
7299 cpuset_cpus_allowed_locked(p, &p->cpus_allowed);
7300 dest_cpu = cpumask_any_and(cpu_active_mask, &p->cpus_allowed);
7303 * Don't tell them about moving exiting tasks or
7304 * kernel threads (both mm NULL), since they never
7307 if (p->mm && printk_ratelimit()) {
7308 printk(KERN_INFO "process %d (%s) no "
7309 "longer affine to cpu%d\n",
7310 task_pid_nr(p), p->comm, dead_cpu);
7315 /* It can have affinity changed while we were choosing. */
7316 if (unlikely(!__migrate_task_irq(p, dead_cpu, dest_cpu)))
7321 * While a dead CPU has no uninterruptible tasks queued at this point,
7322 * it might still have a nonzero ->nr_uninterruptible counter, because
7323 * for performance reasons the counter is not stricly tracking tasks to
7324 * their home CPUs. So we just add the counter to another CPU's counter,
7325 * to keep the global sum constant after CPU-down:
7327 static void migrate_nr_uninterruptible(struct rq *rq_src)
7329 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
7330 unsigned long flags;
7332 local_irq_save(flags);
7333 double_rq_lock(rq_src, rq_dest);
7334 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
7335 rq_src->nr_uninterruptible = 0;
7336 double_rq_unlock(rq_src, rq_dest);
7337 local_irq_restore(flags);
7340 /* Run through task list and migrate tasks from the dead cpu. */
7341 static void migrate_live_tasks(int src_cpu)
7343 struct task_struct *p, *t;
7345 read_lock(&tasklist_lock);
7347 do_each_thread(t, p) {
7351 if (task_cpu(p) == src_cpu)
7352 move_task_off_dead_cpu(src_cpu, p);
7353 } while_each_thread(t, p);
7355 read_unlock(&tasklist_lock);
7359 * Schedules idle task to be the next runnable task on current CPU.
7360 * It does so by boosting its priority to highest possible.
7361 * Used by CPU offline code.
7363 void sched_idle_next(void)
7365 int this_cpu = smp_processor_id();
7366 struct rq *rq = cpu_rq(this_cpu);
7367 struct task_struct *p = rq->idle;
7368 unsigned long flags;
7370 /* cpu has to be offline */
7371 BUG_ON(cpu_online(this_cpu));
7374 * Strictly not necessary since rest of the CPUs are stopped by now
7375 * and interrupts disabled on the current cpu.
7377 spin_lock_irqsave(&rq->lock, flags);
7379 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
7381 update_rq_clock(rq);
7382 activate_task(rq, p, 0);
7384 spin_unlock_irqrestore(&rq->lock, flags);
7388 * Ensures that the idle task is using init_mm right before its cpu goes
7391 void idle_task_exit(void)
7393 struct mm_struct *mm = current->active_mm;
7395 BUG_ON(cpu_online(smp_processor_id()));
7398 switch_mm(mm, &init_mm, current);
7402 /* called under rq->lock with disabled interrupts */
7403 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
7405 struct rq *rq = cpu_rq(dead_cpu);
7407 /* Must be exiting, otherwise would be on tasklist. */
7408 BUG_ON(!p->exit_state);
7410 /* Cannot have done final schedule yet: would have vanished. */
7411 BUG_ON(p->state == TASK_DEAD);
7416 * Drop lock around migration; if someone else moves it,
7417 * that's OK. No task can be added to this CPU, so iteration is
7420 spin_unlock_irq(&rq->lock);
7421 move_task_off_dead_cpu(dead_cpu, p);
7422 spin_lock_irq(&rq->lock);
7427 /* release_task() removes task from tasklist, so we won't find dead tasks. */
7428 static void migrate_dead_tasks(unsigned int dead_cpu)
7430 struct rq *rq = cpu_rq(dead_cpu);
7431 struct task_struct *next;
7434 if (!rq->nr_running)
7436 update_rq_clock(rq);
7437 next = pick_next_task(rq);
7440 next->sched_class->put_prev_task(rq, next);
7441 migrate_dead(dead_cpu, next);
7447 * remove the tasks which were accounted by rq from calc_load_tasks.
7449 static void calc_global_load_remove(struct rq *rq)
7451 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
7452 rq->calc_load_active = 0;
7454 #endif /* CONFIG_HOTPLUG_CPU */
7456 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
7458 static struct ctl_table sd_ctl_dir[] = {
7460 .procname = "sched_domain",
7466 static struct ctl_table sd_ctl_root[] = {
7468 .ctl_name = CTL_KERN,
7469 .procname = "kernel",
7471 .child = sd_ctl_dir,
7476 static struct ctl_table *sd_alloc_ctl_entry(int n)
7478 struct ctl_table *entry =
7479 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
7484 static void sd_free_ctl_entry(struct ctl_table **tablep)
7486 struct ctl_table *entry;
7489 * In the intermediate directories, both the child directory and
7490 * procname are dynamically allocated and could fail but the mode
7491 * will always be set. In the lowest directory the names are
7492 * static strings and all have proc handlers.
7494 for (entry = *tablep; entry->mode; entry++) {
7496 sd_free_ctl_entry(&entry->child);
7497 if (entry->proc_handler == NULL)
7498 kfree(entry->procname);
7506 set_table_entry(struct ctl_table *entry,
7507 const char *procname, void *data, int maxlen,
7508 mode_t mode, proc_handler *proc_handler)
7510 entry->procname = procname;
7512 entry->maxlen = maxlen;
7514 entry->proc_handler = proc_handler;
7517 static struct ctl_table *
7518 sd_alloc_ctl_domain_table(struct sched_domain *sd)
7520 struct ctl_table *table = sd_alloc_ctl_entry(13);
7525 set_table_entry(&table[0], "min_interval", &sd->min_interval,
7526 sizeof(long), 0644, proc_doulongvec_minmax);
7527 set_table_entry(&table[1], "max_interval", &sd->max_interval,
7528 sizeof(long), 0644, proc_doulongvec_minmax);
7529 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
7530 sizeof(int), 0644, proc_dointvec_minmax);
7531 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
7532 sizeof(int), 0644, proc_dointvec_minmax);
7533 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
7534 sizeof(int), 0644, proc_dointvec_minmax);
7535 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
7536 sizeof(int), 0644, proc_dointvec_minmax);
7537 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
7538 sizeof(int), 0644, proc_dointvec_minmax);
7539 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
7540 sizeof(int), 0644, proc_dointvec_minmax);
7541 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
7542 sizeof(int), 0644, proc_dointvec_minmax);
7543 set_table_entry(&table[9], "cache_nice_tries",
7544 &sd->cache_nice_tries,
7545 sizeof(int), 0644, proc_dointvec_minmax);
7546 set_table_entry(&table[10], "flags", &sd->flags,
7547 sizeof(int), 0644, proc_dointvec_minmax);
7548 set_table_entry(&table[11], "name", sd->name,
7549 CORENAME_MAX_SIZE, 0444, proc_dostring);
7550 /* &table[12] is terminator */
7555 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
7557 struct ctl_table *entry, *table;
7558 struct sched_domain *sd;
7559 int domain_num = 0, i;
7562 for_each_domain(cpu, sd)
7564 entry = table = sd_alloc_ctl_entry(domain_num + 1);
7569 for_each_domain(cpu, sd) {
7570 snprintf(buf, 32, "domain%d", i);
7571 entry->procname = kstrdup(buf, GFP_KERNEL);
7573 entry->child = sd_alloc_ctl_domain_table(sd);
7580 static struct ctl_table_header *sd_sysctl_header;
7581 static void register_sched_domain_sysctl(void)
7583 int i, cpu_num = num_possible_cpus();
7584 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
7587 WARN_ON(sd_ctl_dir[0].child);
7588 sd_ctl_dir[0].child = entry;
7593 for_each_possible_cpu(i) {
7594 snprintf(buf, 32, "cpu%d", i);
7595 entry->procname = kstrdup(buf, GFP_KERNEL);
7597 entry->child = sd_alloc_ctl_cpu_table(i);
7601 WARN_ON(sd_sysctl_header);
7602 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
7605 /* may be called multiple times per register */
7606 static void unregister_sched_domain_sysctl(void)
7608 if (sd_sysctl_header)
7609 unregister_sysctl_table(sd_sysctl_header);
7610 sd_sysctl_header = NULL;
7611 if (sd_ctl_dir[0].child)
7612 sd_free_ctl_entry(&sd_ctl_dir[0].child);
7615 static void register_sched_domain_sysctl(void)
7618 static void unregister_sched_domain_sysctl(void)
7623 static void set_rq_online(struct rq *rq)
7626 const struct sched_class *class;
7628 cpumask_set_cpu(rq->cpu, rq->rd->online);
7631 for_each_class(class) {
7632 if (class->rq_online)
7633 class->rq_online(rq);
7638 static void set_rq_offline(struct rq *rq)
7641 const struct sched_class *class;
7643 for_each_class(class) {
7644 if (class->rq_offline)
7645 class->rq_offline(rq);
7648 cpumask_clear_cpu(rq->cpu, rq->rd->online);
7654 * migration_call - callback that gets triggered when a CPU is added.
7655 * Here we can start up the necessary migration thread for the new CPU.
7657 static int __cpuinit
7658 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
7660 struct task_struct *p;
7661 int cpu = (long)hcpu;
7662 unsigned long flags;
7667 case CPU_UP_PREPARE:
7668 case CPU_UP_PREPARE_FROZEN:
7669 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
7672 kthread_bind(p, cpu);
7673 /* Must be high prio: stop_machine expects to yield to it. */
7674 rq = task_rq_lock(p, &flags);
7675 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
7676 task_rq_unlock(rq, &flags);
7678 cpu_rq(cpu)->migration_thread = p;
7679 rq->calc_load_update = calc_load_update;
7683 case CPU_ONLINE_FROZEN:
7684 /* Strictly unnecessary, as first user will wake it. */
7685 wake_up_process(cpu_rq(cpu)->migration_thread);
7687 /* Update our root-domain */
7689 spin_lock_irqsave(&rq->lock, flags);
7691 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
7695 spin_unlock_irqrestore(&rq->lock, flags);
7698 #ifdef CONFIG_HOTPLUG_CPU
7699 case CPU_UP_CANCELED:
7700 case CPU_UP_CANCELED_FROZEN:
7701 if (!cpu_rq(cpu)->migration_thread)
7703 /* Unbind it from offline cpu so it can run. Fall thru. */
7704 kthread_bind(cpu_rq(cpu)->migration_thread,
7705 cpumask_any(cpu_online_mask));
7706 kthread_stop(cpu_rq(cpu)->migration_thread);
7707 put_task_struct(cpu_rq(cpu)->migration_thread);
7708 cpu_rq(cpu)->migration_thread = NULL;
7712 case CPU_DEAD_FROZEN:
7713 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
7714 migrate_live_tasks(cpu);
7716 kthread_stop(rq->migration_thread);
7717 put_task_struct(rq->migration_thread);
7718 rq->migration_thread = NULL;
7719 /* Idle task back to normal (off runqueue, low prio) */
7720 spin_lock_irq(&rq->lock);
7721 update_rq_clock(rq);
7722 deactivate_task(rq, rq->idle, 0);
7723 rq->idle->static_prio = MAX_PRIO;
7724 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
7725 rq->idle->sched_class = &idle_sched_class;
7726 migrate_dead_tasks(cpu);
7727 spin_unlock_irq(&rq->lock);
7729 migrate_nr_uninterruptible(rq);
7730 BUG_ON(rq->nr_running != 0);
7731 calc_global_load_remove(rq);
7733 * No need to migrate the tasks: it was best-effort if
7734 * they didn't take sched_hotcpu_mutex. Just wake up
7737 spin_lock_irq(&rq->lock);
7738 while (!list_empty(&rq->migration_queue)) {
7739 struct migration_req *req;
7741 req = list_entry(rq->migration_queue.next,
7742 struct migration_req, list);
7743 list_del_init(&req->list);
7744 spin_unlock_irq(&rq->lock);
7745 complete(&req->done);
7746 spin_lock_irq(&rq->lock);
7748 spin_unlock_irq(&rq->lock);
7752 case CPU_DYING_FROZEN:
7753 /* Update our root-domain */
7755 spin_lock_irqsave(&rq->lock, flags);
7757 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
7760 spin_unlock_irqrestore(&rq->lock, flags);
7768 * Register at high priority so that task migration (migrate_all_tasks)
7769 * happens before everything else. This has to be lower priority than
7770 * the notifier in the perf_event subsystem, though.
7772 static struct notifier_block __cpuinitdata migration_notifier = {
7773 .notifier_call = migration_call,
7777 static int __init migration_init(void)
7779 void *cpu = (void *)(long)smp_processor_id();
7782 /* Start one for the boot CPU: */
7783 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
7784 BUG_ON(err == NOTIFY_BAD);
7785 migration_call(&migration_notifier, CPU_ONLINE, cpu);
7786 register_cpu_notifier(&migration_notifier);
7790 early_initcall(migration_init);
7795 #ifdef CONFIG_SCHED_DEBUG
7797 static __read_mostly int sched_domain_debug_enabled;
7799 static int __init sched_domain_debug_setup(char *str)
7801 sched_domain_debug_enabled = 1;
7805 early_param("sched_debug", sched_domain_debug_setup);
7807 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
7808 struct cpumask *groupmask)
7810 struct sched_group *group = sd->groups;
7813 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
7814 cpumask_clear(groupmask);
7816 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
7818 if (!(sd->flags & SD_LOAD_BALANCE)) {
7819 printk("does not load-balance\n");
7821 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
7826 printk(KERN_CONT "span %s level %s\n", str, sd->name);
7828 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
7829 printk(KERN_ERR "ERROR: domain->span does not contain "
7832 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
7833 printk(KERN_ERR "ERROR: domain->groups does not contain"
7837 printk(KERN_DEBUG "%*s groups:", level + 1, "");
7841 printk(KERN_ERR "ERROR: group is NULL\n");
7845 if (!group->cpu_power) {
7846 printk(KERN_CONT "\n");
7847 printk(KERN_ERR "ERROR: domain->cpu_power not "
7852 if (!cpumask_weight(sched_group_cpus(group))) {
7853 printk(KERN_CONT "\n");
7854 printk(KERN_ERR "ERROR: empty group\n");
7858 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
7859 printk(KERN_CONT "\n");
7860 printk(KERN_ERR "ERROR: repeated CPUs\n");
7864 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
7866 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
7868 printk(KERN_CONT " %s", str);
7869 if (group->cpu_power != SCHED_LOAD_SCALE) {
7870 printk(KERN_CONT " (cpu_power = %d)",
7874 group = group->next;
7875 } while (group != sd->groups);
7876 printk(KERN_CONT "\n");
7878 if (!cpumask_equal(sched_domain_span(sd), groupmask))
7879 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
7882 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
7883 printk(KERN_ERR "ERROR: parent span is not a superset "
7884 "of domain->span\n");
7888 static void sched_domain_debug(struct sched_domain *sd, int cpu)
7890 cpumask_var_t groupmask;
7893 if (!sched_domain_debug_enabled)
7897 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
7901 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
7903 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
7904 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
7909 if (sched_domain_debug_one(sd, cpu, level, groupmask))
7916 free_cpumask_var(groupmask);
7918 #else /* !CONFIG_SCHED_DEBUG */
7919 # define sched_domain_debug(sd, cpu) do { } while (0)
7920 #endif /* CONFIG_SCHED_DEBUG */
7922 static int sd_degenerate(struct sched_domain *sd)
7924 if (cpumask_weight(sched_domain_span(sd)) == 1)
7927 /* Following flags need at least 2 groups */
7928 if (sd->flags & (SD_LOAD_BALANCE |
7929 SD_BALANCE_NEWIDLE |
7933 SD_SHARE_PKG_RESOURCES)) {
7934 if (sd->groups != sd->groups->next)
7938 /* Following flags don't use groups */
7939 if (sd->flags & (SD_WAKE_AFFINE))
7946 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
7948 unsigned long cflags = sd->flags, pflags = parent->flags;
7950 if (sd_degenerate(parent))
7953 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
7956 /* Flags needing groups don't count if only 1 group in parent */
7957 if (parent->groups == parent->groups->next) {
7958 pflags &= ~(SD_LOAD_BALANCE |
7959 SD_BALANCE_NEWIDLE |
7963 SD_SHARE_PKG_RESOURCES);
7964 if (nr_node_ids == 1)
7965 pflags &= ~SD_SERIALIZE;
7967 if (~cflags & pflags)
7973 static void free_rootdomain(struct root_domain *rd)
7975 synchronize_sched();
7977 cpupri_cleanup(&rd->cpupri);
7979 free_cpumask_var(rd->rto_mask);
7980 free_cpumask_var(rd->online);
7981 free_cpumask_var(rd->span);
7985 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
7987 struct root_domain *old_rd = NULL;
7988 unsigned long flags;
7990 spin_lock_irqsave(&rq->lock, flags);
7995 if (cpumask_test_cpu(rq->cpu, old_rd->online))
7998 cpumask_clear_cpu(rq->cpu, old_rd->span);
8001 * If we dont want to free the old_rt yet then
8002 * set old_rd to NULL to skip the freeing later
8005 if (!atomic_dec_and_test(&old_rd->refcount))
8009 atomic_inc(&rd->refcount);
8012 cpumask_set_cpu(rq->cpu, rd->span);
8013 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
8016 spin_unlock_irqrestore(&rq->lock, flags);
8019 free_rootdomain(old_rd);
8022 static int init_rootdomain(struct root_domain *rd, bool bootmem)
8024 gfp_t gfp = GFP_KERNEL;
8026 memset(rd, 0, sizeof(*rd));
8031 if (!alloc_cpumask_var(&rd->span, gfp))
8033 if (!alloc_cpumask_var(&rd->online, gfp))
8035 if (!alloc_cpumask_var(&rd->rto_mask, gfp))
8038 if (cpupri_init(&rd->cpupri, bootmem) != 0)
8043 free_cpumask_var(rd->rto_mask);
8045 free_cpumask_var(rd->online);
8047 free_cpumask_var(rd->span);
8052 static void init_defrootdomain(void)
8054 init_rootdomain(&def_root_domain, true);
8056 atomic_set(&def_root_domain.refcount, 1);
8059 static struct root_domain *alloc_rootdomain(void)
8061 struct root_domain *rd;
8063 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
8067 if (init_rootdomain(rd, false) != 0) {
8076 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
8077 * hold the hotplug lock.
8080 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
8082 struct rq *rq = cpu_rq(cpu);
8083 struct sched_domain *tmp;
8085 /* Remove the sched domains which do not contribute to scheduling. */
8086 for (tmp = sd; tmp; ) {
8087 struct sched_domain *parent = tmp->parent;
8091 if (sd_parent_degenerate(tmp, parent)) {
8092 tmp->parent = parent->parent;
8094 parent->parent->child = tmp;
8099 if (sd && sd_degenerate(sd)) {
8105 sched_domain_debug(sd, cpu);
8107 rq_attach_root(rq, rd);
8108 rcu_assign_pointer(rq->sd, sd);
8111 /* cpus with isolated domains */
8112 static cpumask_var_t cpu_isolated_map;
8114 /* Setup the mask of cpus configured for isolated domains */
8115 static int __init isolated_cpu_setup(char *str)
8117 alloc_bootmem_cpumask_var(&cpu_isolated_map);
8118 cpulist_parse(str, cpu_isolated_map);
8122 __setup("isolcpus=", isolated_cpu_setup);
8125 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
8126 * to a function which identifies what group(along with sched group) a CPU
8127 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
8128 * (due to the fact that we keep track of groups covered with a struct cpumask).
8130 * init_sched_build_groups will build a circular linked list of the groups
8131 * covered by the given span, and will set each group's ->cpumask correctly,
8132 * and ->cpu_power to 0.
8135 init_sched_build_groups(const struct cpumask *span,
8136 const struct cpumask *cpu_map,
8137 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
8138 struct sched_group **sg,
8139 struct cpumask *tmpmask),
8140 struct cpumask *covered, struct cpumask *tmpmask)
8142 struct sched_group *first = NULL, *last = NULL;
8145 cpumask_clear(covered);
8147 for_each_cpu(i, span) {
8148 struct sched_group *sg;
8149 int group = group_fn(i, cpu_map, &sg, tmpmask);
8152 if (cpumask_test_cpu(i, covered))
8155 cpumask_clear(sched_group_cpus(sg));
8158 for_each_cpu(j, span) {
8159 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
8162 cpumask_set_cpu(j, covered);
8163 cpumask_set_cpu(j, sched_group_cpus(sg));
8174 #define SD_NODES_PER_DOMAIN 16
8179 * find_next_best_node - find the next node to include in a sched_domain
8180 * @node: node whose sched_domain we're building
8181 * @used_nodes: nodes already in the sched_domain
8183 * Find the next node to include in a given scheduling domain. Simply
8184 * finds the closest node not already in the @used_nodes map.
8186 * Should use nodemask_t.
8188 static int find_next_best_node(int node, nodemask_t *used_nodes)
8190 int i, n, val, min_val, best_node = 0;
8194 for (i = 0; i < nr_node_ids; i++) {
8195 /* Start at @node */
8196 n = (node + i) % nr_node_ids;
8198 if (!nr_cpus_node(n))
8201 /* Skip already used nodes */
8202 if (node_isset(n, *used_nodes))
8205 /* Simple min distance search */
8206 val = node_distance(node, n);
8208 if (val < min_val) {
8214 node_set(best_node, *used_nodes);
8219 * sched_domain_node_span - get a cpumask for a node's sched_domain
8220 * @node: node whose cpumask we're constructing
8221 * @span: resulting cpumask
8223 * Given a node, construct a good cpumask for its sched_domain to span. It
8224 * should be one that prevents unnecessary balancing, but also spreads tasks
8227 static void sched_domain_node_span(int node, struct cpumask *span)
8229 nodemask_t used_nodes;
8232 cpumask_clear(span);
8233 nodes_clear(used_nodes);
8235 cpumask_or(span, span, cpumask_of_node(node));
8236 node_set(node, used_nodes);
8238 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
8239 int next_node = find_next_best_node(node, &used_nodes);
8241 cpumask_or(span, span, cpumask_of_node(next_node));
8244 #endif /* CONFIG_NUMA */
8246 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
8249 * The cpus mask in sched_group and sched_domain hangs off the end.
8251 * ( See the the comments in include/linux/sched.h:struct sched_group
8252 * and struct sched_domain. )
8254 struct static_sched_group {
8255 struct sched_group sg;
8256 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
8259 struct static_sched_domain {
8260 struct sched_domain sd;
8261 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
8267 cpumask_var_t domainspan;
8268 cpumask_var_t covered;
8269 cpumask_var_t notcovered;
8271 cpumask_var_t nodemask;
8272 cpumask_var_t this_sibling_map;
8273 cpumask_var_t this_core_map;
8274 cpumask_var_t send_covered;
8275 cpumask_var_t tmpmask;
8276 struct sched_group **sched_group_nodes;
8277 struct root_domain *rd;
8281 sa_sched_groups = 0,
8286 sa_this_sibling_map,
8288 sa_sched_group_nodes,
8298 * SMT sched-domains:
8300 #ifdef CONFIG_SCHED_SMT
8301 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
8302 static DEFINE_PER_CPU(struct static_sched_group, sched_group_cpus);
8305 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
8306 struct sched_group **sg, struct cpumask *unused)
8309 *sg = &per_cpu(sched_group_cpus, cpu).sg;
8312 #endif /* CONFIG_SCHED_SMT */
8315 * multi-core sched-domains:
8317 #ifdef CONFIG_SCHED_MC
8318 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
8319 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
8320 #endif /* CONFIG_SCHED_MC */
8322 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
8324 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
8325 struct sched_group **sg, struct cpumask *mask)
8329 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
8330 group = cpumask_first(mask);
8332 *sg = &per_cpu(sched_group_core, group).sg;
8335 #elif defined(CONFIG_SCHED_MC)
8337 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
8338 struct sched_group **sg, struct cpumask *unused)
8341 *sg = &per_cpu(sched_group_core, cpu).sg;
8346 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
8347 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
8350 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
8351 struct sched_group **sg, struct cpumask *mask)
8354 #ifdef CONFIG_SCHED_MC
8355 cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map);
8356 group = cpumask_first(mask);
8357 #elif defined(CONFIG_SCHED_SMT)
8358 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
8359 group = cpumask_first(mask);
8364 *sg = &per_cpu(sched_group_phys, group).sg;
8370 * The init_sched_build_groups can't handle what we want to do with node
8371 * groups, so roll our own. Now each node has its own list of groups which
8372 * gets dynamically allocated.
8374 static DEFINE_PER_CPU(struct static_sched_domain, node_domains);
8375 static struct sched_group ***sched_group_nodes_bycpu;
8377 static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains);
8378 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
8380 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
8381 struct sched_group **sg,
8382 struct cpumask *nodemask)
8386 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map);
8387 group = cpumask_first(nodemask);
8390 *sg = &per_cpu(sched_group_allnodes, group).sg;
8394 static void init_numa_sched_groups_power(struct sched_group *group_head)
8396 struct sched_group *sg = group_head;
8402 for_each_cpu(j, sched_group_cpus(sg)) {
8403 struct sched_domain *sd;
8405 sd = &per_cpu(phys_domains, j).sd;
8406 if (j != group_first_cpu(sd->groups)) {
8408 * Only add "power" once for each
8414 sg->cpu_power += sd->groups->cpu_power;
8417 } while (sg != group_head);
8420 static int build_numa_sched_groups(struct s_data *d,
8421 const struct cpumask *cpu_map, int num)
8423 struct sched_domain *sd;
8424 struct sched_group *sg, *prev;
8427 cpumask_clear(d->covered);
8428 cpumask_and(d->nodemask, cpumask_of_node(num), cpu_map);
8429 if (cpumask_empty(d->nodemask)) {
8430 d->sched_group_nodes[num] = NULL;
8434 sched_domain_node_span(num, d->domainspan);
8435 cpumask_and(d->domainspan, d->domainspan, cpu_map);
8437 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
8440 printk(KERN_WARNING "Can not alloc domain group for node %d\n",
8444 d->sched_group_nodes[num] = sg;
8446 for_each_cpu(j, d->nodemask) {
8447 sd = &per_cpu(node_domains, j).sd;
8452 cpumask_copy(sched_group_cpus(sg), d->nodemask);
8454 cpumask_or(d->covered, d->covered, d->nodemask);
8457 for (j = 0; j < nr_node_ids; j++) {
8458 n = (num + j) % nr_node_ids;
8459 cpumask_complement(d->notcovered, d->covered);
8460 cpumask_and(d->tmpmask, d->notcovered, cpu_map);
8461 cpumask_and(d->tmpmask, d->tmpmask, d->domainspan);
8462 if (cpumask_empty(d->tmpmask))
8464 cpumask_and(d->tmpmask, d->tmpmask, cpumask_of_node(n));
8465 if (cpumask_empty(d->tmpmask))
8467 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
8471 "Can not alloc domain group for node %d\n", j);
8475 cpumask_copy(sched_group_cpus(sg), d->tmpmask);
8476 sg->next = prev->next;
8477 cpumask_or(d->covered, d->covered, d->tmpmask);
8484 #endif /* CONFIG_NUMA */
8487 /* Free memory allocated for various sched_group structures */
8488 static void free_sched_groups(const struct cpumask *cpu_map,
8489 struct cpumask *nodemask)
8493 for_each_cpu(cpu, cpu_map) {
8494 struct sched_group **sched_group_nodes
8495 = sched_group_nodes_bycpu[cpu];
8497 if (!sched_group_nodes)
8500 for (i = 0; i < nr_node_ids; i++) {
8501 struct sched_group *oldsg, *sg = sched_group_nodes[i];
8503 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
8504 if (cpumask_empty(nodemask))
8514 if (oldsg != sched_group_nodes[i])
8517 kfree(sched_group_nodes);
8518 sched_group_nodes_bycpu[cpu] = NULL;
8521 #else /* !CONFIG_NUMA */
8522 static void free_sched_groups(const struct cpumask *cpu_map,
8523 struct cpumask *nodemask)
8526 #endif /* CONFIG_NUMA */
8529 * Initialize sched groups cpu_power.
8531 * cpu_power indicates the capacity of sched group, which is used while
8532 * distributing the load between different sched groups in a sched domain.
8533 * Typically cpu_power for all the groups in a sched domain will be same unless
8534 * there are asymmetries in the topology. If there are asymmetries, group
8535 * having more cpu_power will pickup more load compared to the group having
8538 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
8540 struct sched_domain *child;
8541 struct sched_group *group;
8545 WARN_ON(!sd || !sd->groups);
8547 if (cpu != group_first_cpu(sd->groups))
8552 sd->groups->cpu_power = 0;
8555 power = SCHED_LOAD_SCALE;
8556 weight = cpumask_weight(sched_domain_span(sd));
8558 * SMT siblings share the power of a single core.
8559 * Usually multiple threads get a better yield out of
8560 * that one core than a single thread would have,
8561 * reflect that in sd->smt_gain.
8563 if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) {
8564 power *= sd->smt_gain;
8566 power >>= SCHED_LOAD_SHIFT;
8568 sd->groups->cpu_power += power;
8573 * Add cpu_power of each child group to this groups cpu_power.
8575 group = child->groups;
8577 sd->groups->cpu_power += group->cpu_power;
8578 group = group->next;
8579 } while (group != child->groups);
8583 * Initializers for schedule domains
8584 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
8587 #ifdef CONFIG_SCHED_DEBUG
8588 # define SD_INIT_NAME(sd, type) sd->name = #type
8590 # define SD_INIT_NAME(sd, type) do { } while (0)
8593 #define SD_INIT(sd, type) sd_init_##type(sd)
8595 #define SD_INIT_FUNC(type) \
8596 static noinline void sd_init_##type(struct sched_domain *sd) \
8598 memset(sd, 0, sizeof(*sd)); \
8599 *sd = SD_##type##_INIT; \
8600 sd->level = SD_LV_##type; \
8601 SD_INIT_NAME(sd, type); \
8606 SD_INIT_FUNC(ALLNODES)
8609 #ifdef CONFIG_SCHED_SMT
8610 SD_INIT_FUNC(SIBLING)
8612 #ifdef CONFIG_SCHED_MC
8616 static int default_relax_domain_level = -1;
8618 static int __init setup_relax_domain_level(char *str)
8622 val = simple_strtoul(str, NULL, 0);
8623 if (val < SD_LV_MAX)
8624 default_relax_domain_level = val;
8628 __setup("relax_domain_level=", setup_relax_domain_level);
8630 static void set_domain_attribute(struct sched_domain *sd,
8631 struct sched_domain_attr *attr)
8635 if (!attr || attr->relax_domain_level < 0) {
8636 if (default_relax_domain_level < 0)
8639 request = default_relax_domain_level;
8641 request = attr->relax_domain_level;
8642 if (request < sd->level) {
8643 /* turn off idle balance on this domain */
8644 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
8646 /* turn on idle balance on this domain */
8647 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
8651 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
8652 const struct cpumask *cpu_map)
8655 case sa_sched_groups:
8656 free_sched_groups(cpu_map, d->tmpmask); /* fall through */
8657 d->sched_group_nodes = NULL;
8659 free_rootdomain(d->rd); /* fall through */
8661 free_cpumask_var(d->tmpmask); /* fall through */
8662 case sa_send_covered:
8663 free_cpumask_var(d->send_covered); /* fall through */
8664 case sa_this_core_map:
8665 free_cpumask_var(d->this_core_map); /* fall through */
8666 case sa_this_sibling_map:
8667 free_cpumask_var(d->this_sibling_map); /* fall through */
8669 free_cpumask_var(d->nodemask); /* fall through */
8670 case sa_sched_group_nodes:
8672 kfree(d->sched_group_nodes); /* fall through */
8674 free_cpumask_var(d->notcovered); /* fall through */
8676 free_cpumask_var(d->covered); /* fall through */
8678 free_cpumask_var(d->domainspan); /* fall through */
8685 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
8686 const struct cpumask *cpu_map)
8689 if (!alloc_cpumask_var(&d->domainspan, GFP_KERNEL))
8691 if (!alloc_cpumask_var(&d->covered, GFP_KERNEL))
8692 return sa_domainspan;
8693 if (!alloc_cpumask_var(&d->notcovered, GFP_KERNEL))
8695 /* Allocate the per-node list of sched groups */
8696 d->sched_group_nodes = kcalloc(nr_node_ids,
8697 sizeof(struct sched_group *), GFP_KERNEL);
8698 if (!d->sched_group_nodes) {
8699 printk(KERN_WARNING "Can not alloc sched group node list\n");
8700 return sa_notcovered;
8702 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = d->sched_group_nodes;
8704 if (!alloc_cpumask_var(&d->nodemask, GFP_KERNEL))
8705 return sa_sched_group_nodes;
8706 if (!alloc_cpumask_var(&d->this_sibling_map, GFP_KERNEL))
8708 if (!alloc_cpumask_var(&d->this_core_map, GFP_KERNEL))
8709 return sa_this_sibling_map;
8710 if (!alloc_cpumask_var(&d->send_covered, GFP_KERNEL))
8711 return sa_this_core_map;
8712 if (!alloc_cpumask_var(&d->tmpmask, GFP_KERNEL))
8713 return sa_send_covered;
8714 d->rd = alloc_rootdomain();
8716 printk(KERN_WARNING "Cannot alloc root domain\n");
8719 return sa_rootdomain;
8722 static struct sched_domain *__build_numa_sched_domains(struct s_data *d,
8723 const struct cpumask *cpu_map, struct sched_domain_attr *attr, int i)
8725 struct sched_domain *sd = NULL;
8727 struct sched_domain *parent;
8730 if (cpumask_weight(cpu_map) >
8731 SD_NODES_PER_DOMAIN * cpumask_weight(d->nodemask)) {
8732 sd = &per_cpu(allnodes_domains, i).sd;
8733 SD_INIT(sd, ALLNODES);
8734 set_domain_attribute(sd, attr);
8735 cpumask_copy(sched_domain_span(sd), cpu_map);
8736 cpu_to_allnodes_group(i, cpu_map, &sd->groups, d->tmpmask);
8741 sd = &per_cpu(node_domains, i).sd;
8743 set_domain_attribute(sd, attr);
8744 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
8745 sd->parent = parent;
8748 cpumask_and(sched_domain_span(sd), sched_domain_span(sd), cpu_map);
8753 static struct sched_domain *__build_cpu_sched_domain(struct s_data *d,
8754 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
8755 struct sched_domain *parent, int i)
8757 struct sched_domain *sd;
8758 sd = &per_cpu(phys_domains, i).sd;
8760 set_domain_attribute(sd, attr);
8761 cpumask_copy(sched_domain_span(sd), d->nodemask);
8762 sd->parent = parent;
8765 cpu_to_phys_group(i, cpu_map, &sd->groups, d->tmpmask);
8769 static struct sched_domain *__build_mc_sched_domain(struct s_data *d,
8770 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
8771 struct sched_domain *parent, int i)
8773 struct sched_domain *sd = parent;
8774 #ifdef CONFIG_SCHED_MC
8775 sd = &per_cpu(core_domains, i).sd;
8777 set_domain_attribute(sd, attr);
8778 cpumask_and(sched_domain_span(sd), cpu_map, cpu_coregroup_mask(i));
8779 sd->parent = parent;
8781 cpu_to_core_group(i, cpu_map, &sd->groups, d->tmpmask);
8786 static struct sched_domain *__build_smt_sched_domain(struct s_data *d,
8787 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
8788 struct sched_domain *parent, int i)
8790 struct sched_domain *sd = parent;
8791 #ifdef CONFIG_SCHED_SMT
8792 sd = &per_cpu(cpu_domains, i).sd;
8793 SD_INIT(sd, SIBLING);
8794 set_domain_attribute(sd, attr);
8795 cpumask_and(sched_domain_span(sd), cpu_map, topology_thread_cpumask(i));
8796 sd->parent = parent;
8798 cpu_to_cpu_group(i, cpu_map, &sd->groups, d->tmpmask);
8803 static void build_sched_groups(struct s_data *d, enum sched_domain_level l,
8804 const struct cpumask *cpu_map, int cpu)
8807 #ifdef CONFIG_SCHED_SMT
8808 case SD_LV_SIBLING: /* set up CPU (sibling) groups */
8809 cpumask_and(d->this_sibling_map, cpu_map,
8810 topology_thread_cpumask(cpu));
8811 if (cpu == cpumask_first(d->this_sibling_map))
8812 init_sched_build_groups(d->this_sibling_map, cpu_map,
8814 d->send_covered, d->tmpmask);
8817 #ifdef CONFIG_SCHED_MC
8818 case SD_LV_MC: /* set up multi-core groups */
8819 cpumask_and(d->this_core_map, cpu_map, cpu_coregroup_mask(cpu));
8820 if (cpu == cpumask_first(d->this_core_map))
8821 init_sched_build_groups(d->this_core_map, cpu_map,
8823 d->send_covered, d->tmpmask);
8826 case SD_LV_CPU: /* set up physical groups */
8827 cpumask_and(d->nodemask, cpumask_of_node(cpu), cpu_map);
8828 if (!cpumask_empty(d->nodemask))
8829 init_sched_build_groups(d->nodemask, cpu_map,
8831 d->send_covered, d->tmpmask);
8834 case SD_LV_ALLNODES:
8835 init_sched_build_groups(cpu_map, cpu_map, &cpu_to_allnodes_group,
8836 d->send_covered, d->tmpmask);
8845 * Build sched domains for a given set of cpus and attach the sched domains
8846 * to the individual cpus
8848 static int __build_sched_domains(const struct cpumask *cpu_map,
8849 struct sched_domain_attr *attr)
8851 enum s_alloc alloc_state = sa_none;
8853 struct sched_domain *sd;
8859 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
8860 if (alloc_state != sa_rootdomain)
8862 alloc_state = sa_sched_groups;
8865 * Set up domains for cpus specified by the cpu_map.
8867 for_each_cpu(i, cpu_map) {
8868 cpumask_and(d.nodemask, cpumask_of_node(cpu_to_node(i)),
8871 sd = __build_numa_sched_domains(&d, cpu_map, attr, i);
8872 sd = __build_cpu_sched_domain(&d, cpu_map, attr, sd, i);
8873 sd = __build_mc_sched_domain(&d, cpu_map, attr, sd, i);
8874 sd = __build_smt_sched_domain(&d, cpu_map, attr, sd, i);
8877 for_each_cpu(i, cpu_map) {
8878 build_sched_groups(&d, SD_LV_SIBLING, cpu_map, i);
8879 build_sched_groups(&d, SD_LV_MC, cpu_map, i);
8882 /* Set up physical groups */
8883 for (i = 0; i < nr_node_ids; i++)
8884 build_sched_groups(&d, SD_LV_CPU, cpu_map, i);
8887 /* Set up node groups */
8889 build_sched_groups(&d, SD_LV_ALLNODES, cpu_map, 0);
8891 for (i = 0; i < nr_node_ids; i++)
8892 if (build_numa_sched_groups(&d, cpu_map, i))
8896 /* Calculate CPU power for physical packages and nodes */
8897 #ifdef CONFIG_SCHED_SMT
8898 for_each_cpu(i, cpu_map) {
8899 sd = &per_cpu(cpu_domains, i).sd;
8900 init_sched_groups_power(i, sd);
8903 #ifdef CONFIG_SCHED_MC
8904 for_each_cpu(i, cpu_map) {
8905 sd = &per_cpu(core_domains, i).sd;
8906 init_sched_groups_power(i, sd);
8910 for_each_cpu(i, cpu_map) {
8911 sd = &per_cpu(phys_domains, i).sd;
8912 init_sched_groups_power(i, sd);
8916 for (i = 0; i < nr_node_ids; i++)
8917 init_numa_sched_groups_power(d.sched_group_nodes[i]);
8919 if (d.sd_allnodes) {
8920 struct sched_group *sg;
8922 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
8924 init_numa_sched_groups_power(sg);
8928 /* Attach the domains */
8929 for_each_cpu(i, cpu_map) {
8930 #ifdef CONFIG_SCHED_SMT
8931 sd = &per_cpu(cpu_domains, i).sd;
8932 #elif defined(CONFIG_SCHED_MC)
8933 sd = &per_cpu(core_domains, i).sd;
8935 sd = &per_cpu(phys_domains, i).sd;
8937 cpu_attach_domain(sd, d.rd, i);
8940 d.sched_group_nodes = NULL; /* don't free this we still need it */
8941 __free_domain_allocs(&d, sa_tmpmask, cpu_map);
8945 __free_domain_allocs(&d, alloc_state, cpu_map);
8949 static int build_sched_domains(const struct cpumask *cpu_map)
8951 return __build_sched_domains(cpu_map, NULL);
8954 static cpumask_var_t *doms_cur; /* current sched domains */
8955 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
8956 static struct sched_domain_attr *dattr_cur;
8957 /* attribues of custom domains in 'doms_cur' */
8960 * Special case: If a kmalloc of a doms_cur partition (array of
8961 * cpumask) fails, then fallback to a single sched domain,
8962 * as determined by the single cpumask fallback_doms.
8964 static cpumask_var_t fallback_doms;
8967 * arch_update_cpu_topology lets virtualized architectures update the
8968 * cpu core maps. It is supposed to return 1 if the topology changed
8969 * or 0 if it stayed the same.
8971 int __attribute__((weak)) arch_update_cpu_topology(void)
8976 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
8979 cpumask_var_t *doms;
8981 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
8984 for (i = 0; i < ndoms; i++) {
8985 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
8986 free_sched_domains(doms, i);
8993 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
8996 for (i = 0; i < ndoms; i++)
8997 free_cpumask_var(doms[i]);
9002 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
9003 * For now this just excludes isolated cpus, but could be used to
9004 * exclude other special cases in the future.
9006 static int arch_init_sched_domains(const struct cpumask *cpu_map)
9010 arch_update_cpu_topology();
9012 doms_cur = alloc_sched_domains(ndoms_cur);
9014 doms_cur = &fallback_doms;
9015 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
9017 err = build_sched_domains(doms_cur[0]);
9018 register_sched_domain_sysctl();
9023 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
9024 struct cpumask *tmpmask)
9026 free_sched_groups(cpu_map, tmpmask);
9030 * Detach sched domains from a group of cpus specified in cpu_map
9031 * These cpus will now be attached to the NULL domain
9033 static void detach_destroy_domains(const struct cpumask *cpu_map)
9035 /* Save because hotplug lock held. */
9036 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
9039 for_each_cpu(i, cpu_map)
9040 cpu_attach_domain(NULL, &def_root_domain, i);
9041 synchronize_sched();
9042 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
9045 /* handle null as "default" */
9046 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
9047 struct sched_domain_attr *new, int idx_new)
9049 struct sched_domain_attr tmp;
9056 return !memcmp(cur ? (cur + idx_cur) : &tmp,
9057 new ? (new + idx_new) : &tmp,
9058 sizeof(struct sched_domain_attr));
9062 * Partition sched domains as specified by the 'ndoms_new'
9063 * cpumasks in the array doms_new[] of cpumasks. This compares
9064 * doms_new[] to the current sched domain partitioning, doms_cur[].
9065 * It destroys each deleted domain and builds each new domain.
9067 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
9068 * The masks don't intersect (don't overlap.) We should setup one
9069 * sched domain for each mask. CPUs not in any of the cpumasks will
9070 * not be load balanced. If the same cpumask appears both in the
9071 * current 'doms_cur' domains and in the new 'doms_new', we can leave
9074 * The passed in 'doms_new' should be allocated using
9075 * alloc_sched_domains. This routine takes ownership of it and will
9076 * free_sched_domains it when done with it. If the caller failed the
9077 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
9078 * and partition_sched_domains() will fallback to the single partition
9079 * 'fallback_doms', it also forces the domains to be rebuilt.
9081 * If doms_new == NULL it will be replaced with cpu_online_mask.
9082 * ndoms_new == 0 is a special case for destroying existing domains,
9083 * and it will not create the default domain.
9085 * Call with hotplug lock held
9087 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
9088 struct sched_domain_attr *dattr_new)
9093 mutex_lock(&sched_domains_mutex);
9095 /* always unregister in case we don't destroy any domains */
9096 unregister_sched_domain_sysctl();
9098 /* Let architecture update cpu core mappings. */
9099 new_topology = arch_update_cpu_topology();
9101 n = doms_new ? ndoms_new : 0;
9103 /* Destroy deleted domains */
9104 for (i = 0; i < ndoms_cur; i++) {
9105 for (j = 0; j < n && !new_topology; j++) {
9106 if (cpumask_equal(doms_cur[i], doms_new[j])
9107 && dattrs_equal(dattr_cur, i, dattr_new, j))
9110 /* no match - a current sched domain not in new doms_new[] */
9111 detach_destroy_domains(doms_cur[i]);
9116 if (doms_new == NULL) {
9118 doms_new = &fallback_doms;
9119 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
9120 WARN_ON_ONCE(dattr_new);
9123 /* Build new domains */
9124 for (i = 0; i < ndoms_new; i++) {
9125 for (j = 0; j < ndoms_cur && !new_topology; j++) {
9126 if (cpumask_equal(doms_new[i], doms_cur[j])
9127 && dattrs_equal(dattr_new, i, dattr_cur, j))
9130 /* no match - add a new doms_new */
9131 __build_sched_domains(doms_new[i],
9132 dattr_new ? dattr_new + i : NULL);
9137 /* Remember the new sched domains */
9138 if (doms_cur != &fallback_doms)
9139 free_sched_domains(doms_cur, ndoms_cur);
9140 kfree(dattr_cur); /* kfree(NULL) is safe */
9141 doms_cur = doms_new;
9142 dattr_cur = dattr_new;
9143 ndoms_cur = ndoms_new;
9145 register_sched_domain_sysctl();
9147 mutex_unlock(&sched_domains_mutex);
9150 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
9151 static void arch_reinit_sched_domains(void)
9155 /* Destroy domains first to force the rebuild */
9156 partition_sched_domains(0, NULL, NULL);
9158 rebuild_sched_domains();
9162 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
9164 unsigned int level = 0;
9166 if (sscanf(buf, "%u", &level) != 1)
9170 * level is always be positive so don't check for
9171 * level < POWERSAVINGS_BALANCE_NONE which is 0
9172 * What happens on 0 or 1 byte write,
9173 * need to check for count as well?
9176 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
9180 sched_smt_power_savings = level;
9182 sched_mc_power_savings = level;
9184 arch_reinit_sched_domains();
9189 #ifdef CONFIG_SCHED_MC
9190 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
9193 return sprintf(page, "%u\n", sched_mc_power_savings);
9195 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
9196 const char *buf, size_t count)
9198 return sched_power_savings_store(buf, count, 0);
9200 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
9201 sched_mc_power_savings_show,
9202 sched_mc_power_savings_store);
9205 #ifdef CONFIG_SCHED_SMT
9206 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
9209 return sprintf(page, "%u\n", sched_smt_power_savings);
9211 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
9212 const char *buf, size_t count)
9214 return sched_power_savings_store(buf, count, 1);
9216 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
9217 sched_smt_power_savings_show,
9218 sched_smt_power_savings_store);
9221 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
9225 #ifdef CONFIG_SCHED_SMT
9227 err = sysfs_create_file(&cls->kset.kobj,
9228 &attr_sched_smt_power_savings.attr);
9230 #ifdef CONFIG_SCHED_MC
9231 if (!err && mc_capable())
9232 err = sysfs_create_file(&cls->kset.kobj,
9233 &attr_sched_mc_power_savings.attr);
9237 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
9239 #ifndef CONFIG_CPUSETS
9241 * Add online and remove offline CPUs from the scheduler domains.
9242 * When cpusets are enabled they take over this function.
9244 static int update_sched_domains(struct notifier_block *nfb,
9245 unsigned long action, void *hcpu)
9249 case CPU_ONLINE_FROZEN:
9250 case CPU_DOWN_PREPARE:
9251 case CPU_DOWN_PREPARE_FROZEN:
9252 case CPU_DOWN_FAILED:
9253 case CPU_DOWN_FAILED_FROZEN:
9254 partition_sched_domains(1, NULL, NULL);
9263 static int update_runtime(struct notifier_block *nfb,
9264 unsigned long action, void *hcpu)
9266 int cpu = (int)(long)hcpu;
9269 case CPU_DOWN_PREPARE:
9270 case CPU_DOWN_PREPARE_FROZEN:
9271 disable_runtime(cpu_rq(cpu));
9274 case CPU_DOWN_FAILED:
9275 case CPU_DOWN_FAILED_FROZEN:
9277 case CPU_ONLINE_FROZEN:
9278 enable_runtime(cpu_rq(cpu));
9286 void __init sched_init_smp(void)
9288 cpumask_var_t non_isolated_cpus;
9290 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
9291 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
9293 #if defined(CONFIG_NUMA)
9294 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
9296 BUG_ON(sched_group_nodes_bycpu == NULL);
9299 mutex_lock(&sched_domains_mutex);
9300 arch_init_sched_domains(cpu_active_mask);
9301 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
9302 if (cpumask_empty(non_isolated_cpus))
9303 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
9304 mutex_unlock(&sched_domains_mutex);
9307 #ifndef CONFIG_CPUSETS
9308 /* XXX: Theoretical race here - CPU may be hotplugged now */
9309 hotcpu_notifier(update_sched_domains, 0);
9312 /* RT runtime code needs to handle some hotplug events */
9313 hotcpu_notifier(update_runtime, 0);
9317 /* Move init over to a non-isolated CPU */
9318 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
9320 sched_init_granularity();
9321 free_cpumask_var(non_isolated_cpus);
9323 init_sched_rt_class();
9326 void __init sched_init_smp(void)
9328 sched_init_granularity();
9330 #endif /* CONFIG_SMP */
9332 const_debug unsigned int sysctl_timer_migration = 1;
9334 int in_sched_functions(unsigned long addr)
9336 return in_lock_functions(addr) ||
9337 (addr >= (unsigned long)__sched_text_start
9338 && addr < (unsigned long)__sched_text_end);
9341 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
9343 cfs_rq->tasks_timeline = RB_ROOT;
9344 INIT_LIST_HEAD(&cfs_rq->tasks);
9345 #ifdef CONFIG_FAIR_GROUP_SCHED
9348 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
9351 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
9353 struct rt_prio_array *array;
9356 array = &rt_rq->active;
9357 for (i = 0; i < MAX_RT_PRIO; i++) {
9358 INIT_LIST_HEAD(array->queue + i);
9359 __clear_bit(i, array->bitmap);
9361 /* delimiter for bitsearch: */
9362 __set_bit(MAX_RT_PRIO, array->bitmap);
9364 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
9365 rt_rq->highest_prio.curr = MAX_RT_PRIO;
9367 rt_rq->highest_prio.next = MAX_RT_PRIO;
9371 rt_rq->rt_nr_migratory = 0;
9372 rt_rq->overloaded = 0;
9373 plist_head_init(&rt_rq->pushable_tasks, &rq->lock);
9377 rt_rq->rt_throttled = 0;
9378 rt_rq->rt_runtime = 0;
9379 spin_lock_init(&rt_rq->rt_runtime_lock);
9381 #ifdef CONFIG_RT_GROUP_SCHED
9382 rt_rq->rt_nr_boosted = 0;
9387 #ifdef CONFIG_FAIR_GROUP_SCHED
9388 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
9389 struct sched_entity *se, int cpu, int add,
9390 struct sched_entity *parent)
9392 struct rq *rq = cpu_rq(cpu);
9393 tg->cfs_rq[cpu] = cfs_rq;
9394 init_cfs_rq(cfs_rq, rq);
9397 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
9400 /* se could be NULL for init_task_group */
9405 se->cfs_rq = &rq->cfs;
9407 se->cfs_rq = parent->my_q;
9410 se->load.weight = tg->shares;
9411 se->load.inv_weight = 0;
9412 se->parent = parent;
9416 #ifdef CONFIG_RT_GROUP_SCHED
9417 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
9418 struct sched_rt_entity *rt_se, int cpu, int add,
9419 struct sched_rt_entity *parent)
9421 struct rq *rq = cpu_rq(cpu);
9423 tg->rt_rq[cpu] = rt_rq;
9424 init_rt_rq(rt_rq, rq);
9426 rt_rq->rt_se = rt_se;
9427 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
9429 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
9431 tg->rt_se[cpu] = rt_se;
9436 rt_se->rt_rq = &rq->rt;
9438 rt_se->rt_rq = parent->my_q;
9440 rt_se->my_q = rt_rq;
9441 rt_se->parent = parent;
9442 INIT_LIST_HEAD(&rt_se->run_list);
9446 void __init sched_init(void)
9449 unsigned long alloc_size = 0, ptr;
9451 #ifdef CONFIG_FAIR_GROUP_SCHED
9452 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
9454 #ifdef CONFIG_RT_GROUP_SCHED
9455 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
9457 #ifdef CONFIG_USER_SCHED
9460 #ifdef CONFIG_CPUMASK_OFFSTACK
9461 alloc_size += num_possible_cpus() * cpumask_size();
9464 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
9466 #ifdef CONFIG_FAIR_GROUP_SCHED
9467 init_task_group.se = (struct sched_entity **)ptr;
9468 ptr += nr_cpu_ids * sizeof(void **);
9470 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
9471 ptr += nr_cpu_ids * sizeof(void **);
9473 #ifdef CONFIG_USER_SCHED
9474 root_task_group.se = (struct sched_entity **)ptr;
9475 ptr += nr_cpu_ids * sizeof(void **);
9477 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
9478 ptr += nr_cpu_ids * sizeof(void **);
9479 #endif /* CONFIG_USER_SCHED */
9480 #endif /* CONFIG_FAIR_GROUP_SCHED */
9481 #ifdef CONFIG_RT_GROUP_SCHED
9482 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
9483 ptr += nr_cpu_ids * sizeof(void **);
9485 init_task_group.rt_rq = (struct rt_rq **)ptr;
9486 ptr += nr_cpu_ids * sizeof(void **);
9488 #ifdef CONFIG_USER_SCHED
9489 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
9490 ptr += nr_cpu_ids * sizeof(void **);
9492 root_task_group.rt_rq = (struct rt_rq **)ptr;
9493 ptr += nr_cpu_ids * sizeof(void **);
9494 #endif /* CONFIG_USER_SCHED */
9495 #endif /* CONFIG_RT_GROUP_SCHED */
9496 #ifdef CONFIG_CPUMASK_OFFSTACK
9497 for_each_possible_cpu(i) {
9498 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
9499 ptr += cpumask_size();
9501 #endif /* CONFIG_CPUMASK_OFFSTACK */
9505 init_defrootdomain();
9508 init_rt_bandwidth(&def_rt_bandwidth,
9509 global_rt_period(), global_rt_runtime());
9511 #ifdef CONFIG_RT_GROUP_SCHED
9512 init_rt_bandwidth(&init_task_group.rt_bandwidth,
9513 global_rt_period(), global_rt_runtime());
9514 #ifdef CONFIG_USER_SCHED
9515 init_rt_bandwidth(&root_task_group.rt_bandwidth,
9516 global_rt_period(), RUNTIME_INF);
9517 #endif /* CONFIG_USER_SCHED */
9518 #endif /* CONFIG_RT_GROUP_SCHED */
9520 #ifdef CONFIG_GROUP_SCHED
9521 list_add(&init_task_group.list, &task_groups);
9522 INIT_LIST_HEAD(&init_task_group.children);
9524 #ifdef CONFIG_USER_SCHED
9525 INIT_LIST_HEAD(&root_task_group.children);
9526 init_task_group.parent = &root_task_group;
9527 list_add(&init_task_group.siblings, &root_task_group.children);
9528 #endif /* CONFIG_USER_SCHED */
9529 #endif /* CONFIG_GROUP_SCHED */
9531 #if defined CONFIG_FAIR_GROUP_SCHED && defined CONFIG_SMP
9532 update_shares_data = __alloc_percpu(nr_cpu_ids * sizeof(unsigned long),
9533 __alignof__(unsigned long));
9535 for_each_possible_cpu(i) {
9539 spin_lock_init(&rq->lock);
9541 rq->calc_load_active = 0;
9542 rq->calc_load_update = jiffies + LOAD_FREQ;
9543 init_cfs_rq(&rq->cfs, rq);
9544 init_rt_rq(&rq->rt, rq);
9545 #ifdef CONFIG_FAIR_GROUP_SCHED
9546 init_task_group.shares = init_task_group_load;
9547 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
9548 #ifdef CONFIG_CGROUP_SCHED
9550 * How much cpu bandwidth does init_task_group get?
9552 * In case of task-groups formed thr' the cgroup filesystem, it
9553 * gets 100% of the cpu resources in the system. This overall
9554 * system cpu resource is divided among the tasks of
9555 * init_task_group and its child task-groups in a fair manner,
9556 * based on each entity's (task or task-group's) weight
9557 * (se->load.weight).
9559 * In other words, if init_task_group has 10 tasks of weight
9560 * 1024) and two child groups A0 and A1 (of weight 1024 each),
9561 * then A0's share of the cpu resource is:
9563 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
9565 * We achieve this by letting init_task_group's tasks sit
9566 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
9568 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
9569 #elif defined CONFIG_USER_SCHED
9570 root_task_group.shares = NICE_0_LOAD;
9571 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL);
9573 * In case of task-groups formed thr' the user id of tasks,
9574 * init_task_group represents tasks belonging to root user.
9575 * Hence it forms a sibling of all subsequent groups formed.
9576 * In this case, init_task_group gets only a fraction of overall
9577 * system cpu resource, based on the weight assigned to root
9578 * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished
9579 * by letting tasks of init_task_group sit in a separate cfs_rq
9580 * (init_tg_cfs_rq) and having one entity represent this group of
9581 * tasks in rq->cfs (i.e init_task_group->se[] != NULL).
9583 init_tg_cfs_entry(&init_task_group,
9584 &per_cpu(init_tg_cfs_rq, i),
9585 &per_cpu(init_sched_entity, i), i, 1,
9586 root_task_group.se[i]);
9589 #endif /* CONFIG_FAIR_GROUP_SCHED */
9591 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
9592 #ifdef CONFIG_RT_GROUP_SCHED
9593 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
9594 #ifdef CONFIG_CGROUP_SCHED
9595 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
9596 #elif defined CONFIG_USER_SCHED
9597 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL);
9598 init_tg_rt_entry(&init_task_group,
9599 &per_cpu(init_rt_rq, i),
9600 &per_cpu(init_sched_rt_entity, i), i, 1,
9601 root_task_group.rt_se[i]);
9605 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
9606 rq->cpu_load[j] = 0;
9610 rq->post_schedule = 0;
9611 rq->active_balance = 0;
9612 rq->next_balance = jiffies;
9616 rq->migration_thread = NULL;
9618 rq->avg_idle = 2*sysctl_sched_migration_cost;
9619 INIT_LIST_HEAD(&rq->migration_queue);
9620 rq_attach_root(rq, &def_root_domain);
9623 atomic_set(&rq->nr_iowait, 0);
9626 set_load_weight(&init_task);
9628 #ifdef CONFIG_PREEMPT_NOTIFIERS
9629 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
9633 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
9636 #ifdef CONFIG_RT_MUTEXES
9637 plist_head_init(&init_task.pi_waiters, &init_task.pi_lock);
9641 * The boot idle thread does lazy MMU switching as well:
9643 atomic_inc(&init_mm.mm_count);
9644 enter_lazy_tlb(&init_mm, current);
9647 * Make us the idle thread. Technically, schedule() should not be
9648 * called from this thread, however somewhere below it might be,
9649 * but because we are the idle thread, we just pick up running again
9650 * when this runqueue becomes "idle".
9652 init_idle(current, smp_processor_id());
9654 calc_load_update = jiffies + LOAD_FREQ;
9657 * During early bootup we pretend to be a normal task:
9659 current->sched_class = &fair_sched_class;
9661 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
9662 zalloc_cpumask_var(&nohz_cpu_mask, GFP_NOWAIT);
9665 zalloc_cpumask_var(&nohz.cpu_mask, GFP_NOWAIT);
9666 alloc_cpumask_var(&nohz.ilb_grp_nohz_mask, GFP_NOWAIT);
9668 /* May be allocated at isolcpus cmdline parse time */
9669 if (cpu_isolated_map == NULL)
9670 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
9675 scheduler_running = 1;
9678 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
9679 static inline int preempt_count_equals(int preempt_offset)
9681 int nested = preempt_count() & ~PREEMPT_ACTIVE;
9683 return (nested == PREEMPT_INATOMIC_BASE + preempt_offset);
9686 void __might_sleep(char *file, int line, int preempt_offset)
9689 static unsigned long prev_jiffy; /* ratelimiting */
9691 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
9692 system_state != SYSTEM_RUNNING || oops_in_progress)
9694 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
9696 prev_jiffy = jiffies;
9699 "BUG: sleeping function called from invalid context at %s:%d\n",
9702 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
9703 in_atomic(), irqs_disabled(),
9704 current->pid, current->comm);
9706 debug_show_held_locks(current);
9707 if (irqs_disabled())
9708 print_irqtrace_events(current);
9712 EXPORT_SYMBOL(__might_sleep);
9715 #ifdef CONFIG_MAGIC_SYSRQ
9716 static void normalize_task(struct rq *rq, struct task_struct *p)
9720 update_rq_clock(rq);
9721 on_rq = p->se.on_rq;
9723 deactivate_task(rq, p, 0);
9724 __setscheduler(rq, p, SCHED_NORMAL, 0);
9726 activate_task(rq, p, 0);
9727 resched_task(rq->curr);
9731 void normalize_rt_tasks(void)
9733 struct task_struct *g, *p;
9734 unsigned long flags;
9737 read_lock_irqsave(&tasklist_lock, flags);
9738 do_each_thread(g, p) {
9740 * Only normalize user tasks:
9745 p->se.exec_start = 0;
9746 #ifdef CONFIG_SCHEDSTATS
9747 p->se.wait_start = 0;
9748 p->se.sleep_start = 0;
9749 p->se.block_start = 0;
9754 * Renice negative nice level userspace
9757 if (TASK_NICE(p) < 0 && p->mm)
9758 set_user_nice(p, 0);
9762 spin_lock(&p->pi_lock);
9763 rq = __task_rq_lock(p);
9765 normalize_task(rq, p);
9767 __task_rq_unlock(rq);
9768 spin_unlock(&p->pi_lock);
9769 } while_each_thread(g, p);
9771 read_unlock_irqrestore(&tasklist_lock, flags);
9774 #endif /* CONFIG_MAGIC_SYSRQ */
9778 * These functions are only useful for the IA64 MCA handling.
9780 * They can only be called when the whole system has been
9781 * stopped - every CPU needs to be quiescent, and no scheduling
9782 * activity can take place. Using them for anything else would
9783 * be a serious bug, and as a result, they aren't even visible
9784 * under any other configuration.
9788 * curr_task - return the current task for a given cpu.
9789 * @cpu: the processor in question.
9791 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
9793 struct task_struct *curr_task(int cpu)
9795 return cpu_curr(cpu);
9799 * set_curr_task - set the current task for a given cpu.
9800 * @cpu: the processor in question.
9801 * @p: the task pointer to set.
9803 * Description: This function must only be used when non-maskable interrupts
9804 * are serviced on a separate stack. It allows the architecture to switch the
9805 * notion of the current task on a cpu in a non-blocking manner. This function
9806 * must be called with all CPU's synchronized, and interrupts disabled, the
9807 * and caller must save the original value of the current task (see
9808 * curr_task() above) and restore that value before reenabling interrupts and
9809 * re-starting the system.
9811 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
9813 void set_curr_task(int cpu, struct task_struct *p)
9820 #ifdef CONFIG_FAIR_GROUP_SCHED
9821 static void free_fair_sched_group(struct task_group *tg)
9825 for_each_possible_cpu(i) {
9827 kfree(tg->cfs_rq[i]);
9837 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
9839 struct cfs_rq *cfs_rq;
9840 struct sched_entity *se;
9844 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
9847 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
9851 tg->shares = NICE_0_LOAD;
9853 for_each_possible_cpu(i) {
9856 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
9857 GFP_KERNEL, cpu_to_node(i));
9861 se = kzalloc_node(sizeof(struct sched_entity),
9862 GFP_KERNEL, cpu_to_node(i));
9866 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
9875 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
9877 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
9878 &cpu_rq(cpu)->leaf_cfs_rq_list);
9881 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
9883 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
9885 #else /* !CONFG_FAIR_GROUP_SCHED */
9886 static inline void free_fair_sched_group(struct task_group *tg)
9891 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
9896 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
9900 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
9903 #endif /* CONFIG_FAIR_GROUP_SCHED */
9905 #ifdef CONFIG_RT_GROUP_SCHED
9906 static void free_rt_sched_group(struct task_group *tg)
9910 destroy_rt_bandwidth(&tg->rt_bandwidth);
9912 for_each_possible_cpu(i) {
9914 kfree(tg->rt_rq[i]);
9916 kfree(tg->rt_se[i]);
9924 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
9926 struct rt_rq *rt_rq;
9927 struct sched_rt_entity *rt_se;
9931 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
9934 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
9938 init_rt_bandwidth(&tg->rt_bandwidth,
9939 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
9941 for_each_possible_cpu(i) {
9944 rt_rq = kzalloc_node(sizeof(struct rt_rq),
9945 GFP_KERNEL, cpu_to_node(i));
9949 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
9950 GFP_KERNEL, cpu_to_node(i));
9954 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
9963 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
9965 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
9966 &cpu_rq(cpu)->leaf_rt_rq_list);
9969 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
9971 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
9973 #else /* !CONFIG_RT_GROUP_SCHED */
9974 static inline void free_rt_sched_group(struct task_group *tg)
9979 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
9984 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
9988 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
9991 #endif /* CONFIG_RT_GROUP_SCHED */
9993 #ifdef CONFIG_GROUP_SCHED
9994 static void free_sched_group(struct task_group *tg)
9996 free_fair_sched_group(tg);
9997 free_rt_sched_group(tg);
10001 /* allocate runqueue etc for a new task group */
10002 struct task_group *sched_create_group(struct task_group *parent)
10004 struct task_group *tg;
10005 unsigned long flags;
10008 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
10010 return ERR_PTR(-ENOMEM);
10012 if (!alloc_fair_sched_group(tg, parent))
10015 if (!alloc_rt_sched_group(tg, parent))
10018 spin_lock_irqsave(&task_group_lock, flags);
10019 for_each_possible_cpu(i) {
10020 register_fair_sched_group(tg, i);
10021 register_rt_sched_group(tg, i);
10023 list_add_rcu(&tg->list, &task_groups);
10025 WARN_ON(!parent); /* root should already exist */
10027 tg->parent = parent;
10028 INIT_LIST_HEAD(&tg->children);
10029 list_add_rcu(&tg->siblings, &parent->children);
10030 spin_unlock_irqrestore(&task_group_lock, flags);
10035 free_sched_group(tg);
10036 return ERR_PTR(-ENOMEM);
10039 /* rcu callback to free various structures associated with a task group */
10040 static void free_sched_group_rcu(struct rcu_head *rhp)
10042 /* now it should be safe to free those cfs_rqs */
10043 free_sched_group(container_of(rhp, struct task_group, rcu));
10046 /* Destroy runqueue etc associated with a task group */
10047 void sched_destroy_group(struct task_group *tg)
10049 unsigned long flags;
10052 spin_lock_irqsave(&task_group_lock, flags);
10053 for_each_possible_cpu(i) {
10054 unregister_fair_sched_group(tg, i);
10055 unregister_rt_sched_group(tg, i);
10057 list_del_rcu(&tg->list);
10058 list_del_rcu(&tg->siblings);
10059 spin_unlock_irqrestore(&task_group_lock, flags);
10061 /* wait for possible concurrent references to cfs_rqs complete */
10062 call_rcu(&tg->rcu, free_sched_group_rcu);
10065 /* change task's runqueue when it moves between groups.
10066 * The caller of this function should have put the task in its new group
10067 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
10068 * reflect its new group.
10070 void sched_move_task(struct task_struct *tsk)
10072 int on_rq, running;
10073 unsigned long flags;
10076 rq = task_rq_lock(tsk, &flags);
10078 update_rq_clock(rq);
10080 running = task_current(rq, tsk);
10081 on_rq = tsk->se.on_rq;
10084 dequeue_task(rq, tsk, 0);
10085 if (unlikely(running))
10086 tsk->sched_class->put_prev_task(rq, tsk);
10088 set_task_rq(tsk, task_cpu(tsk));
10090 #ifdef CONFIG_FAIR_GROUP_SCHED
10091 if (tsk->sched_class->moved_group)
10092 tsk->sched_class->moved_group(tsk);
10095 if (unlikely(running))
10096 tsk->sched_class->set_curr_task(rq);
10098 enqueue_task(rq, tsk, 0);
10100 task_rq_unlock(rq, &flags);
10102 #endif /* CONFIG_GROUP_SCHED */
10104 #ifdef CONFIG_FAIR_GROUP_SCHED
10105 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
10107 struct cfs_rq *cfs_rq = se->cfs_rq;
10112 dequeue_entity(cfs_rq, se, 0);
10114 se->load.weight = shares;
10115 se->load.inv_weight = 0;
10118 enqueue_entity(cfs_rq, se, 0);
10121 static void set_se_shares(struct sched_entity *se, unsigned long shares)
10123 struct cfs_rq *cfs_rq = se->cfs_rq;
10124 struct rq *rq = cfs_rq->rq;
10125 unsigned long flags;
10127 spin_lock_irqsave(&rq->lock, flags);
10128 __set_se_shares(se, shares);
10129 spin_unlock_irqrestore(&rq->lock, flags);
10132 static DEFINE_MUTEX(shares_mutex);
10134 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
10137 unsigned long flags;
10140 * We can't change the weight of the root cgroup.
10145 if (shares < MIN_SHARES)
10146 shares = MIN_SHARES;
10147 else if (shares > MAX_SHARES)
10148 shares = MAX_SHARES;
10150 mutex_lock(&shares_mutex);
10151 if (tg->shares == shares)
10154 spin_lock_irqsave(&task_group_lock, flags);
10155 for_each_possible_cpu(i)
10156 unregister_fair_sched_group(tg, i);
10157 list_del_rcu(&tg->siblings);
10158 spin_unlock_irqrestore(&task_group_lock, flags);
10160 /* wait for any ongoing reference to this group to finish */
10161 synchronize_sched();
10164 * Now we are free to modify the group's share on each cpu
10165 * w/o tripping rebalance_share or load_balance_fair.
10167 tg->shares = shares;
10168 for_each_possible_cpu(i) {
10170 * force a rebalance
10172 cfs_rq_set_shares(tg->cfs_rq[i], 0);
10173 set_se_shares(tg->se[i], shares);
10177 * Enable load balance activity on this group, by inserting it back on
10178 * each cpu's rq->leaf_cfs_rq_list.
10180 spin_lock_irqsave(&task_group_lock, flags);
10181 for_each_possible_cpu(i)
10182 register_fair_sched_group(tg, i);
10183 list_add_rcu(&tg->siblings, &tg->parent->children);
10184 spin_unlock_irqrestore(&task_group_lock, flags);
10186 mutex_unlock(&shares_mutex);
10190 unsigned long sched_group_shares(struct task_group *tg)
10196 #ifdef CONFIG_RT_GROUP_SCHED
10198 * Ensure that the real time constraints are schedulable.
10200 static DEFINE_MUTEX(rt_constraints_mutex);
10202 static unsigned long to_ratio(u64 period, u64 runtime)
10204 if (runtime == RUNTIME_INF)
10207 return div64_u64(runtime << 20, period);
10210 /* Must be called with tasklist_lock held */
10211 static inline int tg_has_rt_tasks(struct task_group *tg)
10213 struct task_struct *g, *p;
10215 do_each_thread(g, p) {
10216 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
10218 } while_each_thread(g, p);
10223 struct rt_schedulable_data {
10224 struct task_group *tg;
10229 static int tg_schedulable(struct task_group *tg, void *data)
10231 struct rt_schedulable_data *d = data;
10232 struct task_group *child;
10233 unsigned long total, sum = 0;
10234 u64 period, runtime;
10236 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
10237 runtime = tg->rt_bandwidth.rt_runtime;
10240 period = d->rt_period;
10241 runtime = d->rt_runtime;
10244 #ifdef CONFIG_USER_SCHED
10245 if (tg == &root_task_group) {
10246 period = global_rt_period();
10247 runtime = global_rt_runtime();
10252 * Cannot have more runtime than the period.
10254 if (runtime > period && runtime != RUNTIME_INF)
10258 * Ensure we don't starve existing RT tasks.
10260 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
10263 total = to_ratio(period, runtime);
10266 * Nobody can have more than the global setting allows.
10268 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
10272 * The sum of our children's runtime should not exceed our own.
10274 list_for_each_entry_rcu(child, &tg->children, siblings) {
10275 period = ktime_to_ns(child->rt_bandwidth.rt_period);
10276 runtime = child->rt_bandwidth.rt_runtime;
10278 if (child == d->tg) {
10279 period = d->rt_period;
10280 runtime = d->rt_runtime;
10283 sum += to_ratio(period, runtime);
10292 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
10294 struct rt_schedulable_data data = {
10296 .rt_period = period,
10297 .rt_runtime = runtime,
10300 return walk_tg_tree(tg_schedulable, tg_nop, &data);
10303 static int tg_set_bandwidth(struct task_group *tg,
10304 u64 rt_period, u64 rt_runtime)
10308 mutex_lock(&rt_constraints_mutex);
10309 read_lock(&tasklist_lock);
10310 err = __rt_schedulable(tg, rt_period, rt_runtime);
10314 spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
10315 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
10316 tg->rt_bandwidth.rt_runtime = rt_runtime;
10318 for_each_possible_cpu(i) {
10319 struct rt_rq *rt_rq = tg->rt_rq[i];
10321 spin_lock(&rt_rq->rt_runtime_lock);
10322 rt_rq->rt_runtime = rt_runtime;
10323 spin_unlock(&rt_rq->rt_runtime_lock);
10325 spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
10327 read_unlock(&tasklist_lock);
10328 mutex_unlock(&rt_constraints_mutex);
10333 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
10335 u64 rt_runtime, rt_period;
10337 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
10338 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
10339 if (rt_runtime_us < 0)
10340 rt_runtime = RUNTIME_INF;
10342 return tg_set_bandwidth(tg, rt_period, rt_runtime);
10345 long sched_group_rt_runtime(struct task_group *tg)
10349 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
10352 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
10353 do_div(rt_runtime_us, NSEC_PER_USEC);
10354 return rt_runtime_us;
10357 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
10359 u64 rt_runtime, rt_period;
10361 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
10362 rt_runtime = tg->rt_bandwidth.rt_runtime;
10364 if (rt_period == 0)
10367 return tg_set_bandwidth(tg, rt_period, rt_runtime);
10370 long sched_group_rt_period(struct task_group *tg)
10374 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
10375 do_div(rt_period_us, NSEC_PER_USEC);
10376 return rt_period_us;
10379 static int sched_rt_global_constraints(void)
10381 u64 runtime, period;
10384 if (sysctl_sched_rt_period <= 0)
10387 runtime = global_rt_runtime();
10388 period = global_rt_period();
10391 * Sanity check on the sysctl variables.
10393 if (runtime > period && runtime != RUNTIME_INF)
10396 mutex_lock(&rt_constraints_mutex);
10397 read_lock(&tasklist_lock);
10398 ret = __rt_schedulable(NULL, 0, 0);
10399 read_unlock(&tasklist_lock);
10400 mutex_unlock(&rt_constraints_mutex);
10405 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
10407 /* Don't accept realtime tasks when there is no way for them to run */
10408 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
10414 #else /* !CONFIG_RT_GROUP_SCHED */
10415 static int sched_rt_global_constraints(void)
10417 unsigned long flags;
10420 if (sysctl_sched_rt_period <= 0)
10424 * There's always some RT tasks in the root group
10425 * -- migration, kstopmachine etc..
10427 if (sysctl_sched_rt_runtime == 0)
10430 spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
10431 for_each_possible_cpu(i) {
10432 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
10434 spin_lock(&rt_rq->rt_runtime_lock);
10435 rt_rq->rt_runtime = global_rt_runtime();
10436 spin_unlock(&rt_rq->rt_runtime_lock);
10438 spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
10442 #endif /* CONFIG_RT_GROUP_SCHED */
10444 int sched_rt_handler(struct ctl_table *table, int write,
10445 void __user *buffer, size_t *lenp,
10449 int old_period, old_runtime;
10450 static DEFINE_MUTEX(mutex);
10452 mutex_lock(&mutex);
10453 old_period = sysctl_sched_rt_period;
10454 old_runtime = sysctl_sched_rt_runtime;
10456 ret = proc_dointvec(table, write, buffer, lenp, ppos);
10458 if (!ret && write) {
10459 ret = sched_rt_global_constraints();
10461 sysctl_sched_rt_period = old_period;
10462 sysctl_sched_rt_runtime = old_runtime;
10464 def_rt_bandwidth.rt_runtime = global_rt_runtime();
10465 def_rt_bandwidth.rt_period =
10466 ns_to_ktime(global_rt_period());
10469 mutex_unlock(&mutex);
10474 #ifdef CONFIG_CGROUP_SCHED
10476 /* return corresponding task_group object of a cgroup */
10477 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
10479 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
10480 struct task_group, css);
10483 static struct cgroup_subsys_state *
10484 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
10486 struct task_group *tg, *parent;
10488 if (!cgrp->parent) {
10489 /* This is early initialization for the top cgroup */
10490 return &init_task_group.css;
10493 parent = cgroup_tg(cgrp->parent);
10494 tg = sched_create_group(parent);
10496 return ERR_PTR(-ENOMEM);
10502 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
10504 struct task_group *tg = cgroup_tg(cgrp);
10506 sched_destroy_group(tg);
10510 cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
10512 #ifdef CONFIG_RT_GROUP_SCHED
10513 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
10516 /* We don't support RT-tasks being in separate groups */
10517 if (tsk->sched_class != &fair_sched_class)
10524 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
10525 struct task_struct *tsk, bool threadgroup)
10527 int retval = cpu_cgroup_can_attach_task(cgrp, tsk);
10531 struct task_struct *c;
10533 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
10534 retval = cpu_cgroup_can_attach_task(cgrp, c);
10546 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
10547 struct cgroup *old_cont, struct task_struct *tsk,
10550 sched_move_task(tsk);
10552 struct task_struct *c;
10554 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
10555 sched_move_task(c);
10561 #ifdef CONFIG_FAIR_GROUP_SCHED
10562 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
10565 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
10568 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
10570 struct task_group *tg = cgroup_tg(cgrp);
10572 return (u64) tg->shares;
10574 #endif /* CONFIG_FAIR_GROUP_SCHED */
10576 #ifdef CONFIG_RT_GROUP_SCHED
10577 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
10580 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
10583 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
10585 return sched_group_rt_runtime(cgroup_tg(cgrp));
10588 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
10591 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
10594 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
10596 return sched_group_rt_period(cgroup_tg(cgrp));
10598 #endif /* CONFIG_RT_GROUP_SCHED */
10600 static struct cftype cpu_files[] = {
10601 #ifdef CONFIG_FAIR_GROUP_SCHED
10604 .read_u64 = cpu_shares_read_u64,
10605 .write_u64 = cpu_shares_write_u64,
10608 #ifdef CONFIG_RT_GROUP_SCHED
10610 .name = "rt_runtime_us",
10611 .read_s64 = cpu_rt_runtime_read,
10612 .write_s64 = cpu_rt_runtime_write,
10615 .name = "rt_period_us",
10616 .read_u64 = cpu_rt_period_read_uint,
10617 .write_u64 = cpu_rt_period_write_uint,
10622 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
10624 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
10627 struct cgroup_subsys cpu_cgroup_subsys = {
10629 .create = cpu_cgroup_create,
10630 .destroy = cpu_cgroup_destroy,
10631 .can_attach = cpu_cgroup_can_attach,
10632 .attach = cpu_cgroup_attach,
10633 .populate = cpu_cgroup_populate,
10634 .subsys_id = cpu_cgroup_subsys_id,
10638 #endif /* CONFIG_CGROUP_SCHED */
10640 #ifdef CONFIG_CGROUP_CPUACCT
10643 * CPU accounting code for task groups.
10645 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
10646 * (balbir@in.ibm.com).
10649 /* track cpu usage of a group of tasks and its child groups */
10651 struct cgroup_subsys_state css;
10652 /* cpuusage holds pointer to a u64-type object on every cpu */
10654 struct percpu_counter cpustat[CPUACCT_STAT_NSTATS];
10655 struct cpuacct *parent;
10658 struct cgroup_subsys cpuacct_subsys;
10660 /* return cpu accounting group corresponding to this container */
10661 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
10663 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
10664 struct cpuacct, css);
10667 /* return cpu accounting group to which this task belongs */
10668 static inline struct cpuacct *task_ca(struct task_struct *tsk)
10670 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
10671 struct cpuacct, css);
10674 /* create a new cpu accounting group */
10675 static struct cgroup_subsys_state *cpuacct_create(
10676 struct cgroup_subsys *ss, struct cgroup *cgrp)
10678 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
10684 ca->cpuusage = alloc_percpu(u64);
10688 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
10689 if (percpu_counter_init(&ca->cpustat[i], 0))
10690 goto out_free_counters;
10693 ca->parent = cgroup_ca(cgrp->parent);
10699 percpu_counter_destroy(&ca->cpustat[i]);
10700 free_percpu(ca->cpuusage);
10704 return ERR_PTR(-ENOMEM);
10707 /* destroy an existing cpu accounting group */
10709 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
10711 struct cpuacct *ca = cgroup_ca(cgrp);
10714 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
10715 percpu_counter_destroy(&ca->cpustat[i]);
10716 free_percpu(ca->cpuusage);
10720 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
10722 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
10725 #ifndef CONFIG_64BIT
10727 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
10729 spin_lock_irq(&cpu_rq(cpu)->lock);
10731 spin_unlock_irq(&cpu_rq(cpu)->lock);
10739 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
10741 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
10743 #ifndef CONFIG_64BIT
10745 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
10747 spin_lock_irq(&cpu_rq(cpu)->lock);
10749 spin_unlock_irq(&cpu_rq(cpu)->lock);
10755 /* return total cpu usage (in nanoseconds) of a group */
10756 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
10758 struct cpuacct *ca = cgroup_ca(cgrp);
10759 u64 totalcpuusage = 0;
10762 for_each_present_cpu(i)
10763 totalcpuusage += cpuacct_cpuusage_read(ca, i);
10765 return totalcpuusage;
10768 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
10771 struct cpuacct *ca = cgroup_ca(cgrp);
10780 for_each_present_cpu(i)
10781 cpuacct_cpuusage_write(ca, i, 0);
10787 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
10788 struct seq_file *m)
10790 struct cpuacct *ca = cgroup_ca(cgroup);
10794 for_each_present_cpu(i) {
10795 percpu = cpuacct_cpuusage_read(ca, i);
10796 seq_printf(m, "%llu ", (unsigned long long) percpu);
10798 seq_printf(m, "\n");
10802 static const char *cpuacct_stat_desc[] = {
10803 [CPUACCT_STAT_USER] = "user",
10804 [CPUACCT_STAT_SYSTEM] = "system",
10807 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
10808 struct cgroup_map_cb *cb)
10810 struct cpuacct *ca = cgroup_ca(cgrp);
10813 for (i = 0; i < CPUACCT_STAT_NSTATS; i++) {
10814 s64 val = percpu_counter_read(&ca->cpustat[i]);
10815 val = cputime64_to_clock_t(val);
10816 cb->fill(cb, cpuacct_stat_desc[i], val);
10821 static struct cftype files[] = {
10824 .read_u64 = cpuusage_read,
10825 .write_u64 = cpuusage_write,
10828 .name = "usage_percpu",
10829 .read_seq_string = cpuacct_percpu_seq_read,
10833 .read_map = cpuacct_stats_show,
10837 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
10839 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
10843 * charge this task's execution time to its accounting group.
10845 * called with rq->lock held.
10847 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
10849 struct cpuacct *ca;
10852 if (unlikely(!cpuacct_subsys.active))
10855 cpu = task_cpu(tsk);
10861 for (; ca; ca = ca->parent) {
10862 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
10863 *cpuusage += cputime;
10870 * Charge the system/user time to the task's accounting group.
10872 static void cpuacct_update_stats(struct task_struct *tsk,
10873 enum cpuacct_stat_index idx, cputime_t val)
10875 struct cpuacct *ca;
10877 if (unlikely(!cpuacct_subsys.active))
10884 percpu_counter_add(&ca->cpustat[idx], val);
10890 struct cgroup_subsys cpuacct_subsys = {
10892 .create = cpuacct_create,
10893 .destroy = cpuacct_destroy,
10894 .populate = cpuacct_populate,
10895 .subsys_id = cpuacct_subsys_id,
10897 #endif /* CONFIG_CGROUP_CPUACCT */
10901 int rcu_expedited_torture_stats(char *page)
10905 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
10907 void synchronize_sched_expedited(void)
10910 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
10912 #else /* #ifndef CONFIG_SMP */
10914 static DEFINE_PER_CPU(struct migration_req, rcu_migration_req);
10915 static DEFINE_MUTEX(rcu_sched_expedited_mutex);
10917 #define RCU_EXPEDITED_STATE_POST -2
10918 #define RCU_EXPEDITED_STATE_IDLE -1
10920 static int rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
10922 int rcu_expedited_torture_stats(char *page)
10927 cnt += sprintf(&page[cnt], "state: %d /", rcu_expedited_state);
10928 for_each_online_cpu(cpu) {
10929 cnt += sprintf(&page[cnt], " %d:%d",
10930 cpu, per_cpu(rcu_migration_req, cpu).dest_cpu);
10932 cnt += sprintf(&page[cnt], "\n");
10935 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
10937 static long synchronize_sched_expedited_count;
10940 * Wait for an rcu-sched grace period to elapse, but use "big hammer"
10941 * approach to force grace period to end quickly. This consumes
10942 * significant time on all CPUs, and is thus not recommended for
10943 * any sort of common-case code.
10945 * Note that it is illegal to call this function while holding any
10946 * lock that is acquired by a CPU-hotplug notifier. Failing to
10947 * observe this restriction will result in deadlock.
10949 void synchronize_sched_expedited(void)
10952 unsigned long flags;
10953 bool need_full_sync = 0;
10955 struct migration_req *req;
10959 smp_mb(); /* ensure prior mod happens before capturing snap. */
10960 snap = ACCESS_ONCE(synchronize_sched_expedited_count) + 1;
10962 while (!mutex_trylock(&rcu_sched_expedited_mutex)) {
10964 if (trycount++ < 10)
10965 udelay(trycount * num_online_cpus());
10967 synchronize_sched();
10970 if (ACCESS_ONCE(synchronize_sched_expedited_count) - snap > 0) {
10971 smp_mb(); /* ensure test happens before caller kfree */
10976 rcu_expedited_state = RCU_EXPEDITED_STATE_POST;
10977 for_each_online_cpu(cpu) {
10979 req = &per_cpu(rcu_migration_req, cpu);
10980 init_completion(&req->done);
10982 req->dest_cpu = RCU_MIGRATION_NEED_QS;
10983 spin_lock_irqsave(&rq->lock, flags);
10984 list_add(&req->list, &rq->migration_queue);
10985 spin_unlock_irqrestore(&rq->lock, flags);
10986 wake_up_process(rq->migration_thread);
10988 for_each_online_cpu(cpu) {
10989 rcu_expedited_state = cpu;
10990 req = &per_cpu(rcu_migration_req, cpu);
10992 wait_for_completion(&req->done);
10993 spin_lock_irqsave(&rq->lock, flags);
10994 if (unlikely(req->dest_cpu == RCU_MIGRATION_MUST_SYNC))
10995 need_full_sync = 1;
10996 req->dest_cpu = RCU_MIGRATION_IDLE;
10997 spin_unlock_irqrestore(&rq->lock, flags);
10999 rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
11000 synchronize_sched_expedited_count++;
11001 mutex_unlock(&rcu_sched_expedited_mutex);
11003 if (need_full_sync)
11004 synchronize_sched();
11006 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
11008 #endif /* #else #ifndef CONFIG_SMP */