4 * Kernel scheduler and related syscalls
6 * Copyright (C) 1991-2002 Linus Torvalds
8 * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and
9 * make semaphores SMP safe
10 * 1998-11-19 Implemented schedule_timeout() and related stuff
12 * 2002-01-04 New ultra-scalable O(1) scheduler by Ingo Molnar:
13 * hybrid priority-list and round-robin design with
14 * an array-switch method of distributing timeslices
15 * and per-CPU runqueues. Cleanups and useful suggestions
16 * by Davide Libenzi, preemptible kernel bits by Robert Love.
17 * 2003-09-03 Interactivity tuning by Con Kolivas.
18 * 2004-04-02 Scheduler domains code by Nick Piggin
19 * 2007-04-15 Work begun on replacing all interactivity tuning with a
20 * fair scheduling design by Con Kolivas.
21 * 2007-05-05 Load balancing (smp-nice) and other improvements
23 * 2007-05-06 Interactivity improvements to CFS by Mike Galbraith
24 * 2007-07-01 Group scheduling enhancements by Srivatsa Vaddagiri
25 * 2007-11-29 RT balancing improvements by Steven Rostedt, Gregory Haskins,
26 * Thomas Gleixner, Mike Kravetz
30 #include <linux/module.h>
31 #include <linux/nmi.h>
32 #include <linux/init.h>
33 #include <linux/uaccess.h>
34 #include <linux/highmem.h>
35 #include <linux/smp_lock.h>
36 #include <asm/mmu_context.h>
37 #include <linux/interrupt.h>
38 #include <linux/capability.h>
39 #include <linux/completion.h>
40 #include <linux/kernel_stat.h>
41 #include <linux/debug_locks.h>
42 #include <linux/security.h>
43 #include <linux/notifier.h>
44 #include <linux/profile.h>
45 #include <linux/freezer.h>
46 #include <linux/vmalloc.h>
47 #include <linux/blkdev.h>
48 #include <linux/delay.h>
49 #include <linux/pid_namespace.h>
50 #include <linux/smp.h>
51 #include <linux/threads.h>
52 #include <linux/timer.h>
53 #include <linux/rcupdate.h>
54 #include <linux/cpu.h>
55 #include <linux/cpuset.h>
56 #include <linux/percpu.h>
57 #include <linux/kthread.h>
58 #include <linux/proc_fs.h>
59 #include <linux/seq_file.h>
60 #include <linux/sysctl.h>
61 #include <linux/syscalls.h>
62 #include <linux/times.h>
63 #include <linux/tsacct_kern.h>
64 #include <linux/kprobes.h>
65 #include <linux/delayacct.h>
66 #include <linux/reciprocal_div.h>
67 #include <linux/unistd.h>
68 #include <linux/pagemap.h>
69 #include <linux/hrtimer.h>
70 #include <linux/tick.h>
71 #include <linux/bootmem.h>
72 #include <linux/debugfs.h>
73 #include <linux/ctype.h>
74 #include <linux/ftrace.h>
75 #include <trace/sched.h>
78 #include <asm/irq_regs.h>
80 #include "sched_cpupri.h"
83 * Convert user-nice values [ -20 ... 0 ... 19 ]
84 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
87 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
88 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
89 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
92 * 'User priority' is the nice value converted to something we
93 * can work with better when scaling various scheduler parameters,
94 * it's a [ 0 ... 39 ] range.
96 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
97 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
98 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
101 * Helpers for converting nanosecond timing to jiffy resolution
103 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
105 #define NICE_0_LOAD SCHED_LOAD_SCALE
106 #define NICE_0_SHIFT SCHED_LOAD_SHIFT
109 * These are the 'tuning knobs' of the scheduler:
111 * default timeslice is 100 msecs (used only for SCHED_RR tasks).
112 * Timeslices get refilled after they expire.
114 #define DEF_TIMESLICE (100 * HZ / 1000)
117 * single value that denotes runtime == period, ie unlimited time.
119 #define RUNTIME_INF ((u64)~0ULL)
121 DEFINE_TRACE(sched_wait_task);
122 DEFINE_TRACE(sched_wakeup);
123 DEFINE_TRACE(sched_wakeup_new);
124 DEFINE_TRACE(sched_switch);
125 DEFINE_TRACE(sched_migrate_task);
129 static void double_rq_lock(struct rq *rq1, struct rq *rq2);
132 * Divide a load by a sched group cpu_power : (load / sg->__cpu_power)
133 * Since cpu_power is a 'constant', we can use a reciprocal divide.
135 static inline u32 sg_div_cpu_power(const struct sched_group *sg, u32 load)
137 return reciprocal_divide(load, sg->reciprocal_cpu_power);
141 * Each time a sched group cpu_power is changed,
142 * we must compute its reciprocal value
144 static inline void sg_inc_cpu_power(struct sched_group *sg, u32 val)
146 sg->__cpu_power += val;
147 sg->reciprocal_cpu_power = reciprocal_value(sg->__cpu_power);
151 static inline int rt_policy(int policy)
153 if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR))
158 static inline int task_has_rt_policy(struct task_struct *p)
160 return rt_policy(p->policy);
164 * This is the priority-queue data structure of the RT scheduling class:
166 struct rt_prio_array {
167 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
168 struct list_head queue[MAX_RT_PRIO];
171 struct rt_bandwidth {
172 /* nests inside the rq lock: */
173 spinlock_t rt_runtime_lock;
176 struct hrtimer rt_period_timer;
179 static struct rt_bandwidth def_rt_bandwidth;
181 static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun);
183 static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer)
185 struct rt_bandwidth *rt_b =
186 container_of(timer, struct rt_bandwidth, rt_period_timer);
192 now = hrtimer_cb_get_time(timer);
193 overrun = hrtimer_forward(timer, now, rt_b->rt_period);
198 idle = do_sched_rt_period_timer(rt_b, overrun);
201 return idle ? HRTIMER_NORESTART : HRTIMER_RESTART;
205 void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime)
207 rt_b->rt_period = ns_to_ktime(period);
208 rt_b->rt_runtime = runtime;
210 spin_lock_init(&rt_b->rt_runtime_lock);
212 hrtimer_init(&rt_b->rt_period_timer,
213 CLOCK_MONOTONIC, HRTIMER_MODE_REL);
214 rt_b->rt_period_timer.function = sched_rt_period_timer;
217 static inline int rt_bandwidth_enabled(void)
219 return sysctl_sched_rt_runtime >= 0;
222 static void start_rt_bandwidth(struct rt_bandwidth *rt_b)
226 if (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF)
229 if (hrtimer_active(&rt_b->rt_period_timer))
232 spin_lock(&rt_b->rt_runtime_lock);
234 if (hrtimer_active(&rt_b->rt_period_timer))
237 now = hrtimer_cb_get_time(&rt_b->rt_period_timer);
238 hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period);
239 hrtimer_start_expires(&rt_b->rt_period_timer,
242 spin_unlock(&rt_b->rt_runtime_lock);
245 #ifdef CONFIG_RT_GROUP_SCHED
246 static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b)
248 hrtimer_cancel(&rt_b->rt_period_timer);
253 * sched_domains_mutex serializes calls to arch_init_sched_domains,
254 * detach_destroy_domains and partition_sched_domains.
256 static DEFINE_MUTEX(sched_domains_mutex);
258 #ifdef CONFIG_GROUP_SCHED
260 #include <linux/cgroup.h>
264 static LIST_HEAD(task_groups);
266 /* task group related information */
268 #ifdef CONFIG_CGROUP_SCHED
269 struct cgroup_subsys_state css;
272 #ifdef CONFIG_USER_SCHED
276 #ifdef CONFIG_FAIR_GROUP_SCHED
277 /* schedulable entities of this group on each cpu */
278 struct sched_entity **se;
279 /* runqueue "owned" by this group on each cpu */
280 struct cfs_rq **cfs_rq;
281 unsigned long shares;
284 #ifdef CONFIG_RT_GROUP_SCHED
285 struct sched_rt_entity **rt_se;
286 struct rt_rq **rt_rq;
288 struct rt_bandwidth rt_bandwidth;
292 struct list_head list;
294 struct task_group *parent;
295 struct list_head siblings;
296 struct list_head children;
299 #ifdef CONFIG_USER_SCHED
301 /* Helper function to pass uid information to create_sched_user() */
302 void set_tg_uid(struct user_struct *user)
304 user->tg->uid = user->uid;
309 * Every UID task group (including init_task_group aka UID-0) will
310 * be a child to this group.
312 struct task_group root_task_group;
314 #ifdef CONFIG_FAIR_GROUP_SCHED
315 /* Default task group's sched entity on each cpu */
316 static DEFINE_PER_CPU(struct sched_entity, init_sched_entity);
317 /* Default task group's cfs_rq on each cpu */
318 static DEFINE_PER_CPU(struct cfs_rq, init_cfs_rq) ____cacheline_aligned_in_smp;
319 #endif /* CONFIG_FAIR_GROUP_SCHED */
321 #ifdef CONFIG_RT_GROUP_SCHED
322 static DEFINE_PER_CPU(struct sched_rt_entity, init_sched_rt_entity);
323 static DEFINE_PER_CPU(struct rt_rq, init_rt_rq) ____cacheline_aligned_in_smp;
324 #endif /* CONFIG_RT_GROUP_SCHED */
325 #else /* !CONFIG_USER_SCHED */
326 #define root_task_group init_task_group
327 #endif /* CONFIG_USER_SCHED */
329 /* task_group_lock serializes add/remove of task groups and also changes to
330 * a task group's cpu shares.
332 static DEFINE_SPINLOCK(task_group_lock);
335 static int root_task_group_empty(void)
337 return list_empty(&root_task_group.children);
341 #ifdef CONFIG_FAIR_GROUP_SCHED
342 #ifdef CONFIG_USER_SCHED
343 # define INIT_TASK_GROUP_LOAD (2*NICE_0_LOAD)
344 #else /* !CONFIG_USER_SCHED */
345 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
346 #endif /* CONFIG_USER_SCHED */
349 * A weight of 0 or 1 can cause arithmetics problems.
350 * A weight of a cfs_rq is the sum of weights of which entities
351 * are queued on this cfs_rq, so a weight of a entity should not be
352 * too large, so as the shares value of a task group.
353 * (The default weight is 1024 - so there's no practical
354 * limitation from this.)
357 #define MAX_SHARES (1UL << 18)
359 static int init_task_group_load = INIT_TASK_GROUP_LOAD;
362 /* Default task group.
363 * Every task in system belong to this group at bootup.
365 struct task_group init_task_group;
367 /* return group to which a task belongs */
368 static inline struct task_group *task_group(struct task_struct *p)
370 struct task_group *tg;
372 #ifdef CONFIG_USER_SCHED
374 tg = __task_cred(p)->user->tg;
376 #elif defined(CONFIG_CGROUP_SCHED)
377 tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id),
378 struct task_group, css);
380 tg = &init_task_group;
385 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
386 static inline void set_task_rq(struct task_struct *p, unsigned int cpu)
388 #ifdef CONFIG_FAIR_GROUP_SCHED
389 p->se.cfs_rq = task_group(p)->cfs_rq[cpu];
390 p->se.parent = task_group(p)->se[cpu];
393 #ifdef CONFIG_RT_GROUP_SCHED
394 p->rt.rt_rq = task_group(p)->rt_rq[cpu];
395 p->rt.parent = task_group(p)->rt_se[cpu];
402 static int root_task_group_empty(void)
408 static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { }
409 static inline struct task_group *task_group(struct task_struct *p)
414 #endif /* CONFIG_GROUP_SCHED */
416 /* CFS-related fields in a runqueue */
418 struct load_weight load;
419 unsigned long nr_running;
424 struct rb_root tasks_timeline;
425 struct rb_node *rb_leftmost;
427 struct list_head tasks;
428 struct list_head *balance_iterator;
431 * 'curr' points to currently running entity on this cfs_rq.
432 * It is set to NULL otherwise (i.e when none are currently running).
434 struct sched_entity *curr, *next, *last;
436 unsigned int nr_spread_over;
438 #ifdef CONFIG_FAIR_GROUP_SCHED
439 struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */
442 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
443 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
444 * (like users, containers etc.)
446 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
447 * list is used during load balance.
449 struct list_head leaf_cfs_rq_list;
450 struct task_group *tg; /* group that "owns" this runqueue */
454 * the part of load.weight contributed by tasks
456 unsigned long task_weight;
459 * h_load = weight * f(tg)
461 * Where f(tg) is the recursive weight fraction assigned to
464 unsigned long h_load;
467 * this cpu's part of tg->shares
469 unsigned long shares;
472 * load.weight at the time we set shares
474 unsigned long rq_weight;
479 /* Real-Time classes' related field in a runqueue: */
481 struct rt_prio_array active;
482 unsigned long rt_nr_running;
483 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
485 int curr; /* highest queued rt task prio */
487 int next; /* next highest */
492 unsigned long rt_nr_migratory;
494 struct plist_head pushable_tasks;
499 /* Nests inside the rq lock: */
500 spinlock_t rt_runtime_lock;
502 #ifdef CONFIG_RT_GROUP_SCHED
503 unsigned long rt_nr_boosted;
506 struct list_head leaf_rt_rq_list;
507 struct task_group *tg;
508 struct sched_rt_entity *rt_se;
515 * We add the notion of a root-domain which will be used to define per-domain
516 * variables. Each exclusive cpuset essentially defines an island domain by
517 * fully partitioning the member cpus from any other cpuset. Whenever a new
518 * exclusive cpuset is created, we also create and attach a new root-domain
525 cpumask_var_t online;
528 * The "RT overload" flag: it gets set if a CPU has more than
529 * one runnable RT task.
531 cpumask_var_t rto_mask;
534 struct cpupri cpupri;
536 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
538 * Preferred wake up cpu nominated by sched_mc balance that will be
539 * used when most cpus are idle in the system indicating overall very
540 * low system utilisation. Triggered at POWERSAVINGS_BALANCE_WAKEUP(2)
542 unsigned int sched_mc_preferred_wakeup_cpu;
547 * By default the system creates a single root-domain with all cpus as
548 * members (mimicking the global state we have today).
550 static struct root_domain def_root_domain;
555 * This is the main, per-CPU runqueue data structure.
557 * Locking rule: those places that want to lock multiple runqueues
558 * (such as the load balancing or the thread migration code), lock
559 * acquire operations must be ordered by ascending &runqueue.
566 * nr_running and cpu_load should be in the same cacheline because
567 * remote CPUs use both these fields when doing load calculation.
569 unsigned long nr_running;
570 #define CPU_LOAD_IDX_MAX 5
571 unsigned long cpu_load[CPU_LOAD_IDX_MAX];
573 unsigned long last_tick_seen;
574 unsigned char in_nohz_recently;
576 /* capture load from *all* tasks on this cpu: */
577 struct load_weight load;
578 unsigned long nr_load_updates;
584 #ifdef CONFIG_FAIR_GROUP_SCHED
585 /* list of leaf cfs_rq on this cpu: */
586 struct list_head leaf_cfs_rq_list;
588 #ifdef CONFIG_RT_GROUP_SCHED
589 struct list_head leaf_rt_rq_list;
593 * This is part of a global counter where only the total sum
594 * over all CPUs matters. A task can increase this counter on
595 * one CPU and if it got migrated afterwards it may decrease
596 * it on another CPU. Always updated under the runqueue lock:
598 unsigned long nr_uninterruptible;
600 struct task_struct *curr, *idle;
601 unsigned long next_balance;
602 struct mm_struct *prev_mm;
609 struct root_domain *rd;
610 struct sched_domain *sd;
612 unsigned char idle_at_tick;
613 /* For active balancing */
616 /* cpu of this runqueue: */
620 unsigned long avg_load_per_task;
622 struct task_struct *migration_thread;
623 struct list_head migration_queue;
626 #ifdef CONFIG_SCHED_HRTICK
628 int hrtick_csd_pending;
629 struct call_single_data hrtick_csd;
631 struct hrtimer hrtick_timer;
634 #ifdef CONFIG_SCHEDSTATS
636 struct sched_info rq_sched_info;
637 unsigned long long rq_cpu_time;
638 /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */
640 /* sys_sched_yield() stats */
641 unsigned int yld_count;
643 /* schedule() stats */
644 unsigned int sched_switch;
645 unsigned int sched_count;
646 unsigned int sched_goidle;
648 /* try_to_wake_up() stats */
649 unsigned int ttwu_count;
650 unsigned int ttwu_local;
653 unsigned int bkl_count;
657 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
659 static inline void check_preempt_curr(struct rq *rq, struct task_struct *p, int sync)
661 rq->curr->sched_class->check_preempt_curr(rq, p, sync);
664 static inline int cpu_of(struct rq *rq)
674 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
675 * See detach_destroy_domains: synchronize_sched for details.
677 * The domain tree of any CPU may only be accessed from within
678 * preempt-disabled sections.
680 #define for_each_domain(cpu, __sd) \
681 for (__sd = rcu_dereference(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
683 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
684 #define this_rq() (&__get_cpu_var(runqueues))
685 #define task_rq(p) cpu_rq(task_cpu(p))
686 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
688 static inline void update_rq_clock(struct rq *rq)
690 rq->clock = sched_clock_cpu(cpu_of(rq));
694 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
696 #ifdef CONFIG_SCHED_DEBUG
697 # define const_debug __read_mostly
699 # define const_debug static const
705 * Returns true if the current cpu runqueue is locked.
706 * This interface allows printk to be called with the runqueue lock
707 * held and know whether or not it is OK to wake up the klogd.
709 int runqueue_is_locked(void)
712 struct rq *rq = cpu_rq(cpu);
715 ret = spin_is_locked(&rq->lock);
721 * Debugging: various feature bits
724 #define SCHED_FEAT(name, enabled) \
725 __SCHED_FEAT_##name ,
728 #include "sched_features.h"
733 #define SCHED_FEAT(name, enabled) \
734 (1UL << __SCHED_FEAT_##name) * enabled |
736 const_debug unsigned int sysctl_sched_features =
737 #include "sched_features.h"
742 #ifdef CONFIG_SCHED_DEBUG
743 #define SCHED_FEAT(name, enabled) \
746 static __read_mostly char *sched_feat_names[] = {
747 #include "sched_features.h"
753 static int sched_feat_show(struct seq_file *m, void *v)
757 for (i = 0; sched_feat_names[i]; i++) {
758 if (!(sysctl_sched_features & (1UL << i)))
760 seq_printf(m, "%s ", sched_feat_names[i]);
768 sched_feat_write(struct file *filp, const char __user *ubuf,
769 size_t cnt, loff_t *ppos)
779 if (copy_from_user(&buf, ubuf, cnt))
784 if (strncmp(buf, "NO_", 3) == 0) {
789 for (i = 0; sched_feat_names[i]; i++) {
790 int len = strlen(sched_feat_names[i]);
792 if (strncmp(cmp, sched_feat_names[i], len) == 0) {
794 sysctl_sched_features &= ~(1UL << i);
796 sysctl_sched_features |= (1UL << i);
801 if (!sched_feat_names[i])
809 static int sched_feat_open(struct inode *inode, struct file *filp)
811 return single_open(filp, sched_feat_show, NULL);
814 static struct file_operations sched_feat_fops = {
815 .open = sched_feat_open,
816 .write = sched_feat_write,
819 .release = single_release,
822 static __init int sched_init_debug(void)
824 debugfs_create_file("sched_features", 0644, NULL, NULL,
829 late_initcall(sched_init_debug);
833 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
836 * Number of tasks to iterate in a single balance run.
837 * Limited because this is done with IRQs disabled.
839 const_debug unsigned int sysctl_sched_nr_migrate = 32;
842 * ratelimit for updating the group shares.
845 unsigned int sysctl_sched_shares_ratelimit = 250000;
848 * Inject some fuzzyness into changing the per-cpu group shares
849 * this avoids remote rq-locks at the expense of fairness.
852 unsigned int sysctl_sched_shares_thresh = 4;
855 * period over which we measure -rt task cpu usage in us.
858 unsigned int sysctl_sched_rt_period = 1000000;
860 static __read_mostly int scheduler_running;
863 * part of the period that we allow rt tasks to run in us.
866 int sysctl_sched_rt_runtime = 950000;
868 static inline u64 global_rt_period(void)
870 return (u64)sysctl_sched_rt_period * NSEC_PER_USEC;
873 static inline u64 global_rt_runtime(void)
875 if (sysctl_sched_rt_runtime < 0)
878 return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC;
881 #ifndef prepare_arch_switch
882 # define prepare_arch_switch(next) do { } while (0)
884 #ifndef finish_arch_switch
885 # define finish_arch_switch(prev) do { } while (0)
888 static inline int task_current(struct rq *rq, struct task_struct *p)
890 return rq->curr == p;
893 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
894 static inline int task_running(struct rq *rq, struct task_struct *p)
896 return task_current(rq, p);
899 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
903 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
905 #ifdef CONFIG_DEBUG_SPINLOCK
906 /* this is a valid case when another task releases the spinlock */
907 rq->lock.owner = current;
910 * If we are tracking spinlock dependencies then we have to
911 * fix up the runqueue lock - which gets 'carried over' from
914 spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_);
916 spin_unlock_irq(&rq->lock);
919 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
920 static inline int task_running(struct rq *rq, struct task_struct *p)
925 return task_current(rq, p);
929 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
933 * We can optimise this out completely for !SMP, because the
934 * SMP rebalancing from interrupt is the only thing that cares
939 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
940 spin_unlock_irq(&rq->lock);
942 spin_unlock(&rq->lock);
946 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
950 * After ->oncpu is cleared, the task can be moved to a different CPU.
951 * We must ensure this doesn't happen until the switch is completely
957 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
961 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
964 * __task_rq_lock - lock the runqueue a given task resides on.
965 * Must be called interrupts disabled.
967 static inline struct rq *__task_rq_lock(struct task_struct *p)
971 struct rq *rq = task_rq(p);
972 spin_lock(&rq->lock);
973 if (likely(rq == task_rq(p)))
975 spin_unlock(&rq->lock);
980 * task_rq_lock - lock the runqueue a given task resides on and disable
981 * interrupts. Note the ordering: we can safely lookup the task_rq without
982 * explicitly disabling preemption.
984 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
990 local_irq_save(*flags);
992 spin_lock(&rq->lock);
993 if (likely(rq == task_rq(p)))
995 spin_unlock_irqrestore(&rq->lock, *flags);
999 void task_rq_unlock_wait(struct task_struct *p)
1001 struct rq *rq = task_rq(p);
1003 smp_mb(); /* spin-unlock-wait is not a full memory barrier */
1004 spin_unlock_wait(&rq->lock);
1007 static void __task_rq_unlock(struct rq *rq)
1008 __releases(rq->lock)
1010 spin_unlock(&rq->lock);
1013 static inline void task_rq_unlock(struct rq *rq, unsigned long *flags)
1014 __releases(rq->lock)
1016 spin_unlock_irqrestore(&rq->lock, *flags);
1020 * this_rq_lock - lock this runqueue and disable interrupts.
1022 static struct rq *this_rq_lock(void)
1023 __acquires(rq->lock)
1027 local_irq_disable();
1029 spin_lock(&rq->lock);
1034 #ifdef CONFIG_SCHED_HRTICK
1036 * Use HR-timers to deliver accurate preemption points.
1038 * Its all a bit involved since we cannot program an hrt while holding the
1039 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1042 * When we get rescheduled we reprogram the hrtick_timer outside of the
1048 * - enabled by features
1049 * - hrtimer is actually high res
1051 static inline int hrtick_enabled(struct rq *rq)
1053 if (!sched_feat(HRTICK))
1055 if (!cpu_active(cpu_of(rq)))
1057 return hrtimer_is_hres_active(&rq->hrtick_timer);
1060 static void hrtick_clear(struct rq *rq)
1062 if (hrtimer_active(&rq->hrtick_timer))
1063 hrtimer_cancel(&rq->hrtick_timer);
1067 * High-resolution timer tick.
1068 * Runs from hardirq context with interrupts disabled.
1070 static enum hrtimer_restart hrtick(struct hrtimer *timer)
1072 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
1074 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
1076 spin_lock(&rq->lock);
1077 update_rq_clock(rq);
1078 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
1079 spin_unlock(&rq->lock);
1081 return HRTIMER_NORESTART;
1086 * called from hardirq (IPI) context
1088 static void __hrtick_start(void *arg)
1090 struct rq *rq = arg;
1092 spin_lock(&rq->lock);
1093 hrtimer_restart(&rq->hrtick_timer);
1094 rq->hrtick_csd_pending = 0;
1095 spin_unlock(&rq->lock);
1099 * Called to set the hrtick timer state.
1101 * called with rq->lock held and irqs disabled
1103 static void hrtick_start(struct rq *rq, u64 delay)
1105 struct hrtimer *timer = &rq->hrtick_timer;
1106 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
1108 hrtimer_set_expires(timer, time);
1110 if (rq == this_rq()) {
1111 hrtimer_restart(timer);
1112 } else if (!rq->hrtick_csd_pending) {
1113 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd);
1114 rq->hrtick_csd_pending = 1;
1119 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
1121 int cpu = (int)(long)hcpu;
1124 case CPU_UP_CANCELED:
1125 case CPU_UP_CANCELED_FROZEN:
1126 case CPU_DOWN_PREPARE:
1127 case CPU_DOWN_PREPARE_FROZEN:
1129 case CPU_DEAD_FROZEN:
1130 hrtick_clear(cpu_rq(cpu));
1137 static __init void init_hrtick(void)
1139 hotcpu_notifier(hotplug_hrtick, 0);
1143 * Called to set the hrtick timer state.
1145 * called with rq->lock held and irqs disabled
1147 static void hrtick_start(struct rq *rq, u64 delay)
1149 hrtimer_start(&rq->hrtick_timer, ns_to_ktime(delay), HRTIMER_MODE_REL);
1152 static inline void init_hrtick(void)
1155 #endif /* CONFIG_SMP */
1157 static void init_rq_hrtick(struct rq *rq)
1160 rq->hrtick_csd_pending = 0;
1162 rq->hrtick_csd.flags = 0;
1163 rq->hrtick_csd.func = __hrtick_start;
1164 rq->hrtick_csd.info = rq;
1167 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1168 rq->hrtick_timer.function = hrtick;
1170 #else /* CONFIG_SCHED_HRTICK */
1171 static inline void hrtick_clear(struct rq *rq)
1175 static inline void init_rq_hrtick(struct rq *rq)
1179 static inline void init_hrtick(void)
1182 #endif /* CONFIG_SCHED_HRTICK */
1185 * resched_task - mark a task 'to be rescheduled now'.
1187 * On UP this means the setting of the need_resched flag, on SMP it
1188 * might also involve a cross-CPU call to trigger the scheduler on
1193 #ifndef tsk_is_polling
1194 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1197 static void resched_task(struct task_struct *p)
1201 assert_spin_locked(&task_rq(p)->lock);
1203 if (test_tsk_need_resched(p))
1206 set_tsk_need_resched(p);
1209 if (cpu == smp_processor_id())
1212 /* NEED_RESCHED must be visible before we test polling */
1214 if (!tsk_is_polling(p))
1215 smp_send_reschedule(cpu);
1218 static void resched_cpu(int cpu)
1220 struct rq *rq = cpu_rq(cpu);
1221 unsigned long flags;
1223 if (!spin_trylock_irqsave(&rq->lock, flags))
1225 resched_task(cpu_curr(cpu));
1226 spin_unlock_irqrestore(&rq->lock, flags);
1231 * When add_timer_on() enqueues a timer into the timer wheel of an
1232 * idle CPU then this timer might expire before the next timer event
1233 * which is scheduled to wake up that CPU. In case of a completely
1234 * idle system the next event might even be infinite time into the
1235 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1236 * leaves the inner idle loop so the newly added timer is taken into
1237 * account when the CPU goes back to idle and evaluates the timer
1238 * wheel for the next timer event.
1240 void wake_up_idle_cpu(int cpu)
1242 struct rq *rq = cpu_rq(cpu);
1244 if (cpu == smp_processor_id())
1248 * This is safe, as this function is called with the timer
1249 * wheel base lock of (cpu) held. When the CPU is on the way
1250 * to idle and has not yet set rq->curr to idle then it will
1251 * be serialized on the timer wheel base lock and take the new
1252 * timer into account automatically.
1254 if (rq->curr != rq->idle)
1258 * We can set TIF_RESCHED on the idle task of the other CPU
1259 * lockless. The worst case is that the other CPU runs the
1260 * idle task through an additional NOOP schedule()
1262 set_tsk_need_resched(rq->idle);
1264 /* NEED_RESCHED must be visible before we test polling */
1266 if (!tsk_is_polling(rq->idle))
1267 smp_send_reschedule(cpu);
1269 #endif /* CONFIG_NO_HZ */
1271 #else /* !CONFIG_SMP */
1272 static void resched_task(struct task_struct *p)
1274 assert_spin_locked(&task_rq(p)->lock);
1275 set_tsk_need_resched(p);
1277 #endif /* CONFIG_SMP */
1279 #if BITS_PER_LONG == 32
1280 # define WMULT_CONST (~0UL)
1282 # define WMULT_CONST (1UL << 32)
1285 #define WMULT_SHIFT 32
1288 * Shift right and round:
1290 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1293 * delta *= weight / lw
1295 static unsigned long
1296 calc_delta_mine(unsigned long delta_exec, unsigned long weight,
1297 struct load_weight *lw)
1301 if (!lw->inv_weight) {
1302 if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST))
1305 lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2)
1309 tmp = (u64)delta_exec * weight;
1311 * Check whether we'd overflow the 64-bit multiplication:
1313 if (unlikely(tmp > WMULT_CONST))
1314 tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight,
1317 tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT);
1319 return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX);
1322 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
1328 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
1335 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1336 * of tasks with abnormal "nice" values across CPUs the contribution that
1337 * each task makes to its run queue's load is weighted according to its
1338 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1339 * scaled version of the new time slice allocation that they receive on time
1343 #define WEIGHT_IDLEPRIO 3
1344 #define WMULT_IDLEPRIO 1431655765
1347 * Nice levels are multiplicative, with a gentle 10% change for every
1348 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1349 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1350 * that remained on nice 0.
1352 * The "10% effect" is relative and cumulative: from _any_ nice level,
1353 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1354 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1355 * If a task goes up by ~10% and another task goes down by ~10% then
1356 * the relative distance between them is ~25%.)
1358 static const int prio_to_weight[40] = {
1359 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1360 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1361 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1362 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1363 /* 0 */ 1024, 820, 655, 526, 423,
1364 /* 5 */ 335, 272, 215, 172, 137,
1365 /* 10 */ 110, 87, 70, 56, 45,
1366 /* 15 */ 36, 29, 23, 18, 15,
1370 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1372 * In cases where the weight does not change often, we can use the
1373 * precalculated inverse to speed up arithmetics by turning divisions
1374 * into multiplications:
1376 static const u32 prio_to_wmult[40] = {
1377 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1378 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1379 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1380 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1381 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1382 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1383 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1384 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1387 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup);
1390 * runqueue iterator, to support SMP load-balancing between different
1391 * scheduling classes, without having to expose their internal data
1392 * structures to the load-balancing proper:
1394 struct rq_iterator {
1396 struct task_struct *(*start)(void *);
1397 struct task_struct *(*next)(void *);
1401 static unsigned long
1402 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
1403 unsigned long max_load_move, struct sched_domain *sd,
1404 enum cpu_idle_type idle, int *all_pinned,
1405 int *this_best_prio, struct rq_iterator *iterator);
1408 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
1409 struct sched_domain *sd, enum cpu_idle_type idle,
1410 struct rq_iterator *iterator);
1413 #ifdef CONFIG_CGROUP_CPUACCT
1414 static void cpuacct_charge(struct task_struct *tsk, u64 cputime);
1416 static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {}
1419 static inline void inc_cpu_load(struct rq *rq, unsigned long load)
1421 update_load_add(&rq->load, load);
1424 static inline void dec_cpu_load(struct rq *rq, unsigned long load)
1426 update_load_sub(&rq->load, load);
1429 #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED)
1430 typedef int (*tg_visitor)(struct task_group *, void *);
1433 * Iterate the full tree, calling @down when first entering a node and @up when
1434 * leaving it for the final time.
1436 static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
1438 struct task_group *parent, *child;
1442 parent = &root_task_group;
1444 ret = (*down)(parent, data);
1447 list_for_each_entry_rcu(child, &parent->children, siblings) {
1454 ret = (*up)(parent, data);
1459 parent = parent->parent;
1468 static int tg_nop(struct task_group *tg, void *data)
1475 static unsigned long source_load(int cpu, int type);
1476 static unsigned long target_load(int cpu, int type);
1477 static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd);
1479 static unsigned long cpu_avg_load_per_task(int cpu)
1481 struct rq *rq = cpu_rq(cpu);
1482 unsigned long nr_running = ACCESS_ONCE(rq->nr_running);
1485 rq->avg_load_per_task = rq->load.weight / nr_running;
1487 rq->avg_load_per_task = 0;
1489 return rq->avg_load_per_task;
1492 #ifdef CONFIG_FAIR_GROUP_SCHED
1494 static void __set_se_shares(struct sched_entity *se, unsigned long shares);
1497 * Calculate and set the cpu's group shares.
1500 update_group_shares_cpu(struct task_group *tg, int cpu,
1501 unsigned long sd_shares, unsigned long sd_rq_weight)
1503 unsigned long shares;
1504 unsigned long rq_weight;
1509 rq_weight = tg->cfs_rq[cpu]->rq_weight;
1512 * \Sum shares * rq_weight
1513 * shares = -----------------------
1517 shares = (sd_shares * rq_weight) / sd_rq_weight;
1518 shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES);
1520 if (abs(shares - tg->se[cpu]->load.weight) >
1521 sysctl_sched_shares_thresh) {
1522 struct rq *rq = cpu_rq(cpu);
1523 unsigned long flags;
1525 spin_lock_irqsave(&rq->lock, flags);
1526 tg->cfs_rq[cpu]->shares = shares;
1528 __set_se_shares(tg->se[cpu], shares);
1529 spin_unlock_irqrestore(&rq->lock, flags);
1534 * Re-compute the task group their per cpu shares over the given domain.
1535 * This needs to be done in a bottom-up fashion because the rq weight of a
1536 * parent group depends on the shares of its child groups.
1538 static int tg_shares_up(struct task_group *tg, void *data)
1540 unsigned long weight, rq_weight = 0;
1541 unsigned long shares = 0;
1542 struct sched_domain *sd = data;
1545 for_each_cpu(i, sched_domain_span(sd)) {
1547 * If there are currently no tasks on the cpu pretend there
1548 * is one of average load so that when a new task gets to
1549 * run here it will not get delayed by group starvation.
1551 weight = tg->cfs_rq[i]->load.weight;
1553 weight = NICE_0_LOAD;
1555 tg->cfs_rq[i]->rq_weight = weight;
1556 rq_weight += weight;
1557 shares += tg->cfs_rq[i]->shares;
1560 if ((!shares && rq_weight) || shares > tg->shares)
1561 shares = tg->shares;
1563 if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE))
1564 shares = tg->shares;
1566 for_each_cpu(i, sched_domain_span(sd))
1567 update_group_shares_cpu(tg, i, shares, rq_weight);
1573 * Compute the cpu's hierarchical load factor for each task group.
1574 * This needs to be done in a top-down fashion because the load of a child
1575 * group is a fraction of its parents load.
1577 static int tg_load_down(struct task_group *tg, void *data)
1580 long cpu = (long)data;
1583 load = cpu_rq(cpu)->load.weight;
1585 load = tg->parent->cfs_rq[cpu]->h_load;
1586 load *= tg->cfs_rq[cpu]->shares;
1587 load /= tg->parent->cfs_rq[cpu]->load.weight + 1;
1590 tg->cfs_rq[cpu]->h_load = load;
1595 static void update_shares(struct sched_domain *sd)
1597 u64 now = cpu_clock(raw_smp_processor_id());
1598 s64 elapsed = now - sd->last_update;
1600 if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) {
1601 sd->last_update = now;
1602 walk_tg_tree(tg_nop, tg_shares_up, sd);
1606 static void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1608 spin_unlock(&rq->lock);
1610 spin_lock(&rq->lock);
1613 static void update_h_load(long cpu)
1615 walk_tg_tree(tg_load_down, tg_nop, (void *)cpu);
1620 static inline void update_shares(struct sched_domain *sd)
1624 static inline void update_shares_locked(struct rq *rq, struct sched_domain *sd)
1630 #ifdef CONFIG_PREEMPT
1633 * fair double_lock_balance: Safely acquires both rq->locks in a fair
1634 * way at the expense of forcing extra atomic operations in all
1635 * invocations. This assures that the double_lock is acquired using the
1636 * same underlying policy as the spinlock_t on this architecture, which
1637 * reduces latency compared to the unfair variant below. However, it
1638 * also adds more overhead and therefore may reduce throughput.
1640 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1641 __releases(this_rq->lock)
1642 __acquires(busiest->lock)
1643 __acquires(this_rq->lock)
1645 spin_unlock(&this_rq->lock);
1646 double_rq_lock(this_rq, busiest);
1653 * Unfair double_lock_balance: Optimizes throughput at the expense of
1654 * latency by eliminating extra atomic operations when the locks are
1655 * already in proper order on entry. This favors lower cpu-ids and will
1656 * grant the double lock to lower cpus over higher ids under contention,
1657 * regardless of entry order into the function.
1659 static int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1660 __releases(this_rq->lock)
1661 __acquires(busiest->lock)
1662 __acquires(this_rq->lock)
1666 if (unlikely(!spin_trylock(&busiest->lock))) {
1667 if (busiest < this_rq) {
1668 spin_unlock(&this_rq->lock);
1669 spin_lock(&busiest->lock);
1670 spin_lock_nested(&this_rq->lock, SINGLE_DEPTH_NESTING);
1673 spin_lock_nested(&busiest->lock, SINGLE_DEPTH_NESTING);
1678 #endif /* CONFIG_PREEMPT */
1681 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
1683 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
1685 if (unlikely(!irqs_disabled())) {
1686 /* printk() doesn't work good under rq->lock */
1687 spin_unlock(&this_rq->lock);
1691 return _double_lock_balance(this_rq, busiest);
1694 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
1695 __releases(busiest->lock)
1697 spin_unlock(&busiest->lock);
1698 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
1702 #ifdef CONFIG_FAIR_GROUP_SCHED
1703 static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares)
1706 cfs_rq->shares = shares;
1711 #include "sched_stats.h"
1712 #include "sched_idletask.c"
1713 #include "sched_fair.c"
1714 #include "sched_rt.c"
1715 #ifdef CONFIG_SCHED_DEBUG
1716 # include "sched_debug.c"
1719 #define sched_class_highest (&rt_sched_class)
1720 #define for_each_class(class) \
1721 for (class = sched_class_highest; class; class = class->next)
1723 static void inc_nr_running(struct rq *rq)
1728 static void dec_nr_running(struct rq *rq)
1733 static void set_load_weight(struct task_struct *p)
1735 if (task_has_rt_policy(p)) {
1736 p->se.load.weight = prio_to_weight[0] * 2;
1737 p->se.load.inv_weight = prio_to_wmult[0] >> 1;
1742 * SCHED_IDLE tasks get minimal weight:
1744 if (p->policy == SCHED_IDLE) {
1745 p->se.load.weight = WEIGHT_IDLEPRIO;
1746 p->se.load.inv_weight = WMULT_IDLEPRIO;
1750 p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO];
1751 p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO];
1754 static void update_avg(u64 *avg, u64 sample)
1756 s64 diff = sample - *avg;
1760 static void enqueue_task(struct rq *rq, struct task_struct *p, int wakeup)
1763 p->se.start_runtime = p->se.sum_exec_runtime;
1765 sched_info_queued(p);
1766 p->sched_class->enqueue_task(rq, p, wakeup);
1770 static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep)
1773 if (p->se.last_wakeup) {
1774 update_avg(&p->se.avg_overlap,
1775 p->se.sum_exec_runtime - p->se.last_wakeup);
1776 p->se.last_wakeup = 0;
1778 update_avg(&p->se.avg_wakeup,
1779 sysctl_sched_wakeup_granularity);
1783 sched_info_dequeued(p);
1784 p->sched_class->dequeue_task(rq, p, sleep);
1789 * __normal_prio - return the priority that is based on the static prio
1791 static inline int __normal_prio(struct task_struct *p)
1793 return p->static_prio;
1797 * Calculate the expected normal priority: i.e. priority
1798 * without taking RT-inheritance into account. Might be
1799 * boosted by interactivity modifiers. Changes upon fork,
1800 * setprio syscalls, and whenever the interactivity
1801 * estimator recalculates.
1803 static inline int normal_prio(struct task_struct *p)
1807 if (task_has_rt_policy(p))
1808 prio = MAX_RT_PRIO-1 - p->rt_priority;
1810 prio = __normal_prio(p);
1815 * Calculate the current priority, i.e. the priority
1816 * taken into account by the scheduler. This value might
1817 * be boosted by RT tasks, or might be boosted by
1818 * interactivity modifiers. Will be RT if the task got
1819 * RT-boosted. If not then it returns p->normal_prio.
1821 static int effective_prio(struct task_struct *p)
1823 p->normal_prio = normal_prio(p);
1825 * If we are RT tasks or we were boosted to RT priority,
1826 * keep the priority unchanged. Otherwise, update priority
1827 * to the normal priority:
1829 if (!rt_prio(p->prio))
1830 return p->normal_prio;
1835 * activate_task - move a task to the runqueue.
1837 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup)
1839 if (task_contributes_to_load(p))
1840 rq->nr_uninterruptible--;
1842 enqueue_task(rq, p, wakeup);
1847 * deactivate_task - remove a task from the runqueue.
1849 static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep)
1851 if (task_contributes_to_load(p))
1852 rq->nr_uninterruptible++;
1854 dequeue_task(rq, p, sleep);
1859 * task_curr - is this task currently executing on a CPU?
1860 * @p: the task in question.
1862 inline int task_curr(const struct task_struct *p)
1864 return cpu_curr(task_cpu(p)) == p;
1867 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1869 set_task_rq(p, cpu);
1872 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1873 * successfuly executed on another CPU. We must ensure that updates of
1874 * per-task data have been completed by this moment.
1877 task_thread_info(p)->cpu = cpu;
1881 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1882 const struct sched_class *prev_class,
1883 int oldprio, int running)
1885 if (prev_class != p->sched_class) {
1886 if (prev_class->switched_from)
1887 prev_class->switched_from(rq, p, running);
1888 p->sched_class->switched_to(rq, p, running);
1890 p->sched_class->prio_changed(rq, p, oldprio, running);
1895 /* Used instead of source_load when we know the type == 0 */
1896 static unsigned long weighted_cpuload(const int cpu)
1898 return cpu_rq(cpu)->load.weight;
1902 * Is this task likely cache-hot:
1905 task_hot(struct task_struct *p, u64 now, struct sched_domain *sd)
1910 * Buddy candidates are cache hot:
1912 if (sched_feat(CACHE_HOT_BUDDY) &&
1913 (&p->se == cfs_rq_of(&p->se)->next ||
1914 &p->se == cfs_rq_of(&p->se)->last))
1917 if (p->sched_class != &fair_sched_class)
1920 if (sysctl_sched_migration_cost == -1)
1922 if (sysctl_sched_migration_cost == 0)
1925 delta = now - p->se.exec_start;
1927 return delta < (s64)sysctl_sched_migration_cost;
1931 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
1933 int old_cpu = task_cpu(p);
1934 struct rq *old_rq = cpu_rq(old_cpu), *new_rq = cpu_rq(new_cpu);
1935 struct cfs_rq *old_cfsrq = task_cfs_rq(p),
1936 *new_cfsrq = cpu_cfs_rq(old_cfsrq, new_cpu);
1939 clock_offset = old_rq->clock - new_rq->clock;
1941 trace_sched_migrate_task(p, task_cpu(p), new_cpu);
1943 #ifdef CONFIG_SCHEDSTATS
1944 if (p->se.wait_start)
1945 p->se.wait_start -= clock_offset;
1946 if (p->se.sleep_start)
1947 p->se.sleep_start -= clock_offset;
1948 if (p->se.block_start)
1949 p->se.block_start -= clock_offset;
1950 if (old_cpu != new_cpu) {
1951 schedstat_inc(p, se.nr_migrations);
1952 if (task_hot(p, old_rq->clock, NULL))
1953 schedstat_inc(p, se.nr_forced2_migrations);
1956 p->se.vruntime -= old_cfsrq->min_vruntime -
1957 new_cfsrq->min_vruntime;
1959 __set_task_cpu(p, new_cpu);
1962 struct migration_req {
1963 struct list_head list;
1965 struct task_struct *task;
1968 struct completion done;
1972 * The task's runqueue lock must be held.
1973 * Returns true if you have to wait for migration thread.
1976 migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req)
1978 struct rq *rq = task_rq(p);
1981 * If the task is not on a runqueue (and not running), then
1982 * it is sufficient to simply update the task's cpu field.
1984 if (!p->se.on_rq && !task_running(rq, p)) {
1985 set_task_cpu(p, dest_cpu);
1989 init_completion(&req->done);
1991 req->dest_cpu = dest_cpu;
1992 list_add(&req->list, &rq->migration_queue);
1998 * wait_task_inactive - wait for a thread to unschedule.
2000 * If @match_state is nonzero, it's the @p->state value just checked and
2001 * not expected to change. If it changes, i.e. @p might have woken up,
2002 * then return zero. When we succeed in waiting for @p to be off its CPU,
2003 * we return a positive number (its total switch count). If a second call
2004 * a short while later returns the same number, the caller can be sure that
2005 * @p has remained unscheduled the whole time.
2007 * The caller must ensure that the task *will* unschedule sometime soon,
2008 * else this function might spin for a *long* time. This function can't
2009 * be called with interrupts off, or it may introduce deadlock with
2010 * smp_call_function() if an IPI is sent by the same process we are
2011 * waiting to become inactive.
2013 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2015 unsigned long flags;
2022 * We do the initial early heuristics without holding
2023 * any task-queue locks at all. We'll only try to get
2024 * the runqueue lock when things look like they will
2030 * If the task is actively running on another CPU
2031 * still, just relax and busy-wait without holding
2034 * NOTE! Since we don't hold any locks, it's not
2035 * even sure that "rq" stays as the right runqueue!
2036 * But we don't care, since "task_running()" will
2037 * return false if the runqueue has changed and p
2038 * is actually now running somewhere else!
2040 while (task_running(rq, p)) {
2041 if (match_state && unlikely(p->state != match_state))
2047 * Ok, time to look more closely! We need the rq
2048 * lock now, to be *sure*. If we're wrong, we'll
2049 * just go back and repeat.
2051 rq = task_rq_lock(p, &flags);
2052 trace_sched_wait_task(rq, p);
2053 running = task_running(rq, p);
2054 on_rq = p->se.on_rq;
2056 if (!match_state || p->state == match_state)
2057 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
2058 task_rq_unlock(rq, &flags);
2061 * If it changed from the expected state, bail out now.
2063 if (unlikely(!ncsw))
2067 * Was it really running after all now that we
2068 * checked with the proper locks actually held?
2070 * Oops. Go back and try again..
2072 if (unlikely(running)) {
2078 * It's not enough that it's not actively running,
2079 * it must be off the runqueue _entirely_, and not
2082 * So if it was still runnable (but just not actively
2083 * running right now), it's preempted, and we should
2084 * yield - it could be a while.
2086 if (unlikely(on_rq)) {
2087 schedule_timeout_uninterruptible(1);
2092 * Ahh, all good. It wasn't running, and it wasn't
2093 * runnable, which means that it will never become
2094 * running in the future either. We're all done!
2103 * kick_process - kick a running thread to enter/exit the kernel
2104 * @p: the to-be-kicked thread
2106 * Cause a process which is running on another CPU to enter
2107 * kernel-mode, without any delay. (to get signals handled.)
2109 * NOTE: this function doesnt have to take the runqueue lock,
2110 * because all it wants to ensure is that the remote task enters
2111 * the kernel. If the IPI races and the task has been migrated
2112 * to another CPU then no harm is done and the purpose has been
2115 void kick_process(struct task_struct *p)
2121 if ((cpu != smp_processor_id()) && task_curr(p))
2122 smp_send_reschedule(cpu);
2127 * Return a low guess at the load of a migration-source cpu weighted
2128 * according to the scheduling class and "nice" value.
2130 * We want to under-estimate the load of migration sources, to
2131 * balance conservatively.
2133 static unsigned long source_load(int cpu, int type)
2135 struct rq *rq = cpu_rq(cpu);
2136 unsigned long total = weighted_cpuload(cpu);
2138 if (type == 0 || !sched_feat(LB_BIAS))
2141 return min(rq->cpu_load[type-1], total);
2145 * Return a high guess at the load of a migration-target cpu weighted
2146 * according to the scheduling class and "nice" value.
2148 static unsigned long target_load(int cpu, int type)
2150 struct rq *rq = cpu_rq(cpu);
2151 unsigned long total = weighted_cpuload(cpu);
2153 if (type == 0 || !sched_feat(LB_BIAS))
2156 return max(rq->cpu_load[type-1], total);
2160 * find_idlest_group finds and returns the least busy CPU group within the
2163 static struct sched_group *
2164 find_idlest_group(struct sched_domain *sd, struct task_struct *p, int this_cpu)
2166 struct sched_group *idlest = NULL, *this = NULL, *group = sd->groups;
2167 unsigned long min_load = ULONG_MAX, this_load = 0;
2168 int load_idx = sd->forkexec_idx;
2169 int imbalance = 100 + (sd->imbalance_pct-100)/2;
2172 unsigned long load, avg_load;
2176 /* Skip over this group if it has no CPUs allowed */
2177 if (!cpumask_intersects(sched_group_cpus(group),
2181 local_group = cpumask_test_cpu(this_cpu,
2182 sched_group_cpus(group));
2184 /* Tally up the load of all CPUs in the group */
2187 for_each_cpu(i, sched_group_cpus(group)) {
2188 /* Bias balancing toward cpus of our domain */
2190 load = source_load(i, load_idx);
2192 load = target_load(i, load_idx);
2197 /* Adjust by relative CPU power of the group */
2198 avg_load = sg_div_cpu_power(group,
2199 avg_load * SCHED_LOAD_SCALE);
2202 this_load = avg_load;
2204 } else if (avg_load < min_load) {
2205 min_load = avg_load;
2208 } while (group = group->next, group != sd->groups);
2210 if (!idlest || 100*this_load < imbalance*min_load)
2216 * find_idlest_cpu - find the idlest cpu among the cpus in group.
2219 find_idlest_cpu(struct sched_group *group, struct task_struct *p, int this_cpu)
2221 unsigned long load, min_load = ULONG_MAX;
2225 /* Traverse only the allowed CPUs */
2226 for_each_cpu_and(i, sched_group_cpus(group), &p->cpus_allowed) {
2227 load = weighted_cpuload(i);
2229 if (load < min_load || (load == min_load && i == this_cpu)) {
2239 * sched_balance_self: balance the current task (running on cpu) in domains
2240 * that have the 'flag' flag set. In practice, this is SD_BALANCE_FORK and
2243 * Balance, ie. select the least loaded group.
2245 * Returns the target CPU number, or the same CPU if no balancing is needed.
2247 * preempt must be disabled.
2249 static int sched_balance_self(int cpu, int flag)
2251 struct task_struct *t = current;
2252 struct sched_domain *tmp, *sd = NULL;
2254 for_each_domain(cpu, tmp) {
2256 * If power savings logic is enabled for a domain, stop there.
2258 if (tmp->flags & SD_POWERSAVINGS_BALANCE)
2260 if (tmp->flags & flag)
2268 struct sched_group *group;
2269 int new_cpu, weight;
2271 if (!(sd->flags & flag)) {
2276 group = find_idlest_group(sd, t, cpu);
2282 new_cpu = find_idlest_cpu(group, t, cpu);
2283 if (new_cpu == -1 || new_cpu == cpu) {
2284 /* Now try balancing at a lower domain level of cpu */
2289 /* Now try balancing at a lower domain level of new_cpu */
2291 weight = cpumask_weight(sched_domain_span(sd));
2293 for_each_domain(cpu, tmp) {
2294 if (weight <= cpumask_weight(sched_domain_span(tmp)))
2296 if (tmp->flags & flag)
2299 /* while loop will break here if sd == NULL */
2305 #endif /* CONFIG_SMP */
2308 * try_to_wake_up - wake up a thread
2309 * @p: the to-be-woken-up thread
2310 * @state: the mask of task states that can be woken
2311 * @sync: do a synchronous wakeup?
2313 * Put it on the run-queue if it's not already there. The "current"
2314 * thread is always on the run-queue (except when the actual
2315 * re-schedule is in progress), and as such you're allowed to do
2316 * the simpler "current->state = TASK_RUNNING" to mark yourself
2317 * runnable without the overhead of this.
2319 * returns failure only if the task is already active.
2321 static int try_to_wake_up(struct task_struct *p, unsigned int state, int sync)
2323 int cpu, orig_cpu, this_cpu, success = 0;
2324 unsigned long flags;
2328 if (!sched_feat(SYNC_WAKEUPS))
2332 if (sched_feat(LB_WAKEUP_UPDATE) && !root_task_group_empty()) {
2333 struct sched_domain *sd;
2335 this_cpu = raw_smp_processor_id();
2338 for_each_domain(this_cpu, sd) {
2339 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2348 rq = task_rq_lock(p, &flags);
2349 update_rq_clock(rq);
2350 old_state = p->state;
2351 if (!(old_state & state))
2359 this_cpu = smp_processor_id();
2362 if (unlikely(task_running(rq, p)))
2365 cpu = p->sched_class->select_task_rq(p, sync);
2366 if (cpu != orig_cpu) {
2367 set_task_cpu(p, cpu);
2368 task_rq_unlock(rq, &flags);
2369 /* might preempt at this point */
2370 rq = task_rq_lock(p, &flags);
2371 old_state = p->state;
2372 if (!(old_state & state))
2377 this_cpu = smp_processor_id();
2381 #ifdef CONFIG_SCHEDSTATS
2382 schedstat_inc(rq, ttwu_count);
2383 if (cpu == this_cpu)
2384 schedstat_inc(rq, ttwu_local);
2386 struct sched_domain *sd;
2387 for_each_domain(this_cpu, sd) {
2388 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2389 schedstat_inc(sd, ttwu_wake_remote);
2394 #endif /* CONFIG_SCHEDSTATS */
2397 #endif /* CONFIG_SMP */
2398 schedstat_inc(p, se.nr_wakeups);
2400 schedstat_inc(p, se.nr_wakeups_sync);
2401 if (orig_cpu != cpu)
2402 schedstat_inc(p, se.nr_wakeups_migrate);
2403 if (cpu == this_cpu)
2404 schedstat_inc(p, se.nr_wakeups_local);
2406 schedstat_inc(p, se.nr_wakeups_remote);
2407 activate_task(rq, p, 1);
2411 * Only attribute actual wakeups done by this task.
2413 if (!in_interrupt()) {
2414 struct sched_entity *se = ¤t->se;
2415 u64 sample = se->sum_exec_runtime;
2417 if (se->last_wakeup)
2418 sample -= se->last_wakeup;
2420 sample -= se->start_runtime;
2421 update_avg(&se->avg_wakeup, sample);
2423 se->last_wakeup = se->sum_exec_runtime;
2427 trace_sched_wakeup(rq, p, success);
2428 check_preempt_curr(rq, p, sync);
2430 p->state = TASK_RUNNING;
2432 if (p->sched_class->task_wake_up)
2433 p->sched_class->task_wake_up(rq, p);
2436 task_rq_unlock(rq, &flags);
2441 int wake_up_process(struct task_struct *p)
2443 return try_to_wake_up(p, TASK_ALL, 0);
2445 EXPORT_SYMBOL(wake_up_process);
2447 int wake_up_state(struct task_struct *p, unsigned int state)
2449 return try_to_wake_up(p, state, 0);
2453 * Perform scheduler related setup for a newly forked process p.
2454 * p is forked by current.
2456 * __sched_fork() is basic setup used by init_idle() too:
2458 static void __sched_fork(struct task_struct *p)
2460 p->se.exec_start = 0;
2461 p->se.sum_exec_runtime = 0;
2462 p->se.prev_sum_exec_runtime = 0;
2463 p->se.last_wakeup = 0;
2464 p->se.avg_overlap = 0;
2465 p->se.start_runtime = 0;
2466 p->se.avg_wakeup = sysctl_sched_wakeup_granularity;
2468 #ifdef CONFIG_SCHEDSTATS
2469 p->se.wait_start = 0;
2470 p->se.sum_sleep_runtime = 0;
2471 p->se.sleep_start = 0;
2472 p->se.block_start = 0;
2473 p->se.sleep_max = 0;
2474 p->se.block_max = 0;
2476 p->se.slice_max = 0;
2480 INIT_LIST_HEAD(&p->rt.run_list);
2482 INIT_LIST_HEAD(&p->se.group_node);
2484 #ifdef CONFIG_PREEMPT_NOTIFIERS
2485 INIT_HLIST_HEAD(&p->preempt_notifiers);
2489 * We mark the process as running here, but have not actually
2490 * inserted it onto the runqueue yet. This guarantees that
2491 * nobody will actually run it, and a signal or other external
2492 * event cannot wake it up and insert it on the runqueue either.
2494 p->state = TASK_RUNNING;
2498 * fork()/clone()-time setup:
2500 void sched_fork(struct task_struct *p, int clone_flags)
2502 int cpu = get_cpu();
2507 cpu = sched_balance_self(cpu, SD_BALANCE_FORK);
2509 set_task_cpu(p, cpu);
2512 * Make sure we do not leak PI boosting priority to the child:
2514 p->prio = current->normal_prio;
2515 if (!rt_prio(p->prio))
2516 p->sched_class = &fair_sched_class;
2518 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2519 if (likely(sched_info_on()))
2520 memset(&p->sched_info, 0, sizeof(p->sched_info));
2522 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2525 #ifdef CONFIG_PREEMPT
2526 /* Want to start with kernel preemption disabled. */
2527 task_thread_info(p)->preempt_count = 1;
2529 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2535 * wake_up_new_task - wake up a newly created task for the first time.
2537 * This function will do some initial scheduler statistics housekeeping
2538 * that must be done for every newly created context, then puts the task
2539 * on the runqueue and wakes it.
2541 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2543 unsigned long flags;
2546 rq = task_rq_lock(p, &flags);
2547 BUG_ON(p->state != TASK_RUNNING);
2548 update_rq_clock(rq);
2550 p->prio = effective_prio(p);
2552 if (!p->sched_class->task_new || !current->se.on_rq) {
2553 activate_task(rq, p, 0);
2556 * Let the scheduling class do new task startup
2557 * management (if any):
2559 p->sched_class->task_new(rq, p);
2562 trace_sched_wakeup_new(rq, p, 1);
2563 check_preempt_curr(rq, p, 0);
2565 if (p->sched_class->task_wake_up)
2566 p->sched_class->task_wake_up(rq, p);
2568 task_rq_unlock(rq, &flags);
2571 #ifdef CONFIG_PREEMPT_NOTIFIERS
2574 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2575 * @notifier: notifier struct to register
2577 void preempt_notifier_register(struct preempt_notifier *notifier)
2579 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2581 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2584 * preempt_notifier_unregister - no longer interested in preemption notifications
2585 * @notifier: notifier struct to unregister
2587 * This is safe to call from within a preemption notifier.
2589 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2591 hlist_del(¬ifier->link);
2593 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2595 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2597 struct preempt_notifier *notifier;
2598 struct hlist_node *node;
2600 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2601 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2605 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2606 struct task_struct *next)
2608 struct preempt_notifier *notifier;
2609 struct hlist_node *node;
2611 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2612 notifier->ops->sched_out(notifier, next);
2615 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2617 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2622 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2623 struct task_struct *next)
2627 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2630 * prepare_task_switch - prepare to switch tasks
2631 * @rq: the runqueue preparing to switch
2632 * @prev: the current task that is being switched out
2633 * @next: the task we are going to switch to.
2635 * This is called with the rq lock held and interrupts off. It must
2636 * be paired with a subsequent finish_task_switch after the context
2639 * prepare_task_switch sets up locking and calls architecture specific
2643 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2644 struct task_struct *next)
2646 fire_sched_out_preempt_notifiers(prev, next);
2647 prepare_lock_switch(rq, next);
2648 prepare_arch_switch(next);
2652 * finish_task_switch - clean up after a task-switch
2653 * @rq: runqueue associated with task-switch
2654 * @prev: the thread we just switched away from.
2656 * finish_task_switch must be called after the context switch, paired
2657 * with a prepare_task_switch call before the context switch.
2658 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2659 * and do any other architecture-specific cleanup actions.
2661 * Note that we may have delayed dropping an mm in context_switch(). If
2662 * so, we finish that here outside of the runqueue lock. (Doing it
2663 * with the lock held can cause deadlocks; see schedule() for
2666 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2667 __releases(rq->lock)
2669 struct mm_struct *mm = rq->prev_mm;
2672 int post_schedule = 0;
2674 if (current->sched_class->needs_post_schedule)
2675 post_schedule = current->sched_class->needs_post_schedule(rq);
2681 * A task struct has one reference for the use as "current".
2682 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2683 * schedule one last time. The schedule call will never return, and
2684 * the scheduled task must drop that reference.
2685 * The test for TASK_DEAD must occur while the runqueue locks are
2686 * still held, otherwise prev could be scheduled on another cpu, die
2687 * there before we look at prev->state, and then the reference would
2689 * Manfred Spraul <manfred@colorfullife.com>
2691 prev_state = prev->state;
2692 finish_arch_switch(prev);
2693 finish_lock_switch(rq, prev);
2696 current->sched_class->post_schedule(rq);
2699 fire_sched_in_preempt_notifiers(current);
2702 if (unlikely(prev_state == TASK_DEAD)) {
2704 * Remove function-return probe instances associated with this
2705 * task and put them back on the free list.
2707 kprobe_flush_task(prev);
2708 put_task_struct(prev);
2713 * schedule_tail - first thing a freshly forked thread must call.
2714 * @prev: the thread we just switched away from.
2716 asmlinkage void schedule_tail(struct task_struct *prev)
2717 __releases(rq->lock)
2719 struct rq *rq = this_rq();
2721 finish_task_switch(rq, prev);
2722 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2723 /* In this case, finish_task_switch does not reenable preemption */
2726 if (current->set_child_tid)
2727 put_user(task_pid_vnr(current), current->set_child_tid);
2731 * context_switch - switch to the new MM and the new
2732 * thread's register state.
2735 context_switch(struct rq *rq, struct task_struct *prev,
2736 struct task_struct *next)
2738 struct mm_struct *mm, *oldmm;
2740 prepare_task_switch(rq, prev, next);
2741 trace_sched_switch(rq, prev, next);
2743 oldmm = prev->active_mm;
2745 * For paravirt, this is coupled with an exit in switch_to to
2746 * combine the page table reload and the switch backend into
2749 arch_enter_lazy_cpu_mode();
2751 if (unlikely(!mm)) {
2752 next->active_mm = oldmm;
2753 atomic_inc(&oldmm->mm_count);
2754 enter_lazy_tlb(oldmm, next);
2756 switch_mm(oldmm, mm, next);
2758 if (unlikely(!prev->mm)) {
2759 prev->active_mm = NULL;
2760 rq->prev_mm = oldmm;
2763 * Since the runqueue lock will be released by the next
2764 * task (which is an invalid locking op but in the case
2765 * of the scheduler it's an obvious special-case), so we
2766 * do an early lockdep release here:
2768 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2769 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2772 /* Here we just switch the register state and the stack. */
2773 switch_to(prev, next, prev);
2777 * this_rq must be evaluated again because prev may have moved
2778 * CPUs since it called schedule(), thus the 'rq' on its stack
2779 * frame will be invalid.
2781 finish_task_switch(this_rq(), prev);
2785 * nr_running, nr_uninterruptible and nr_context_switches:
2787 * externally visible scheduler statistics: current number of runnable
2788 * threads, current number of uninterruptible-sleeping threads, total
2789 * number of context switches performed since bootup.
2791 unsigned long nr_running(void)
2793 unsigned long i, sum = 0;
2795 for_each_online_cpu(i)
2796 sum += cpu_rq(i)->nr_running;
2801 unsigned long nr_uninterruptible(void)
2803 unsigned long i, sum = 0;
2805 for_each_possible_cpu(i)
2806 sum += cpu_rq(i)->nr_uninterruptible;
2809 * Since we read the counters lockless, it might be slightly
2810 * inaccurate. Do not allow it to go below zero though:
2812 if (unlikely((long)sum < 0))
2818 unsigned long long nr_context_switches(void)
2821 unsigned long long sum = 0;
2823 for_each_possible_cpu(i)
2824 sum += cpu_rq(i)->nr_switches;
2829 unsigned long nr_iowait(void)
2831 unsigned long i, sum = 0;
2833 for_each_possible_cpu(i)
2834 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2839 unsigned long nr_active(void)
2841 unsigned long i, running = 0, uninterruptible = 0;
2843 for_each_online_cpu(i) {
2844 running += cpu_rq(i)->nr_running;
2845 uninterruptible += cpu_rq(i)->nr_uninterruptible;
2848 if (unlikely((long)uninterruptible < 0))
2849 uninterruptible = 0;
2851 return running + uninterruptible;
2855 * Update rq->cpu_load[] statistics. This function is usually called every
2856 * scheduler tick (TICK_NSEC).
2858 static void update_cpu_load(struct rq *this_rq)
2860 unsigned long this_load = this_rq->load.weight;
2863 this_rq->nr_load_updates++;
2865 /* Update our load: */
2866 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
2867 unsigned long old_load, new_load;
2869 /* scale is effectively 1 << i now, and >> i divides by scale */
2871 old_load = this_rq->cpu_load[i];
2872 new_load = this_load;
2874 * Round up the averaging division if load is increasing. This
2875 * prevents us from getting stuck on 9 if the load is 10, for
2878 if (new_load > old_load)
2879 new_load += scale-1;
2880 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
2887 * double_rq_lock - safely lock two runqueues
2889 * Note this does not disable interrupts like task_rq_lock,
2890 * you need to do so manually before calling.
2892 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
2893 __acquires(rq1->lock)
2894 __acquires(rq2->lock)
2896 BUG_ON(!irqs_disabled());
2898 spin_lock(&rq1->lock);
2899 __acquire(rq2->lock); /* Fake it out ;) */
2902 spin_lock(&rq1->lock);
2903 spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
2905 spin_lock(&rq2->lock);
2906 spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
2909 update_rq_clock(rq1);
2910 update_rq_clock(rq2);
2914 * double_rq_unlock - safely unlock two runqueues
2916 * Note this does not restore interrupts like task_rq_unlock,
2917 * you need to do so manually after calling.
2919 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
2920 __releases(rq1->lock)
2921 __releases(rq2->lock)
2923 spin_unlock(&rq1->lock);
2925 spin_unlock(&rq2->lock);
2927 __release(rq2->lock);
2931 * If dest_cpu is allowed for this process, migrate the task to it.
2932 * This is accomplished by forcing the cpu_allowed mask to only
2933 * allow dest_cpu, which will force the cpu onto dest_cpu. Then
2934 * the cpu_allowed mask is restored.
2936 static void sched_migrate_task(struct task_struct *p, int dest_cpu)
2938 struct migration_req req;
2939 unsigned long flags;
2942 rq = task_rq_lock(p, &flags);
2943 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed)
2944 || unlikely(!cpu_active(dest_cpu)))
2947 /* force the process onto the specified CPU */
2948 if (migrate_task(p, dest_cpu, &req)) {
2949 /* Need to wait for migration thread (might exit: take ref). */
2950 struct task_struct *mt = rq->migration_thread;
2952 get_task_struct(mt);
2953 task_rq_unlock(rq, &flags);
2954 wake_up_process(mt);
2955 put_task_struct(mt);
2956 wait_for_completion(&req.done);
2961 task_rq_unlock(rq, &flags);
2965 * sched_exec - execve() is a valuable balancing opportunity, because at
2966 * this point the task has the smallest effective memory and cache footprint.
2968 void sched_exec(void)
2970 int new_cpu, this_cpu = get_cpu();
2971 new_cpu = sched_balance_self(this_cpu, SD_BALANCE_EXEC);
2973 if (new_cpu != this_cpu)
2974 sched_migrate_task(current, new_cpu);
2978 * pull_task - move a task from a remote runqueue to the local runqueue.
2979 * Both runqueues must be locked.
2981 static void pull_task(struct rq *src_rq, struct task_struct *p,
2982 struct rq *this_rq, int this_cpu)
2984 deactivate_task(src_rq, p, 0);
2985 set_task_cpu(p, this_cpu);
2986 activate_task(this_rq, p, 0);
2988 * Note that idle threads have a prio of MAX_PRIO, for this test
2989 * to be always true for them.
2991 check_preempt_curr(this_rq, p, 0);
2995 * can_migrate_task - may task p from runqueue rq be migrated to this_cpu?
2998 int can_migrate_task(struct task_struct *p, struct rq *rq, int this_cpu,
2999 struct sched_domain *sd, enum cpu_idle_type idle,
3002 int tsk_cache_hot = 0;
3004 * We do not migrate tasks that are:
3005 * 1) running (obviously), or
3006 * 2) cannot be migrated to this CPU due to cpus_allowed, or
3007 * 3) are cache-hot on their current CPU.
3009 if (!cpumask_test_cpu(this_cpu, &p->cpus_allowed)) {
3010 schedstat_inc(p, se.nr_failed_migrations_affine);
3015 if (task_running(rq, p)) {
3016 schedstat_inc(p, se.nr_failed_migrations_running);
3021 * Aggressive migration if:
3022 * 1) task is cache cold, or
3023 * 2) too many balance attempts have failed.
3026 tsk_cache_hot = task_hot(p, rq->clock, sd);
3027 if (!tsk_cache_hot ||
3028 sd->nr_balance_failed > sd->cache_nice_tries) {
3029 #ifdef CONFIG_SCHEDSTATS
3030 if (tsk_cache_hot) {
3031 schedstat_inc(sd, lb_hot_gained[idle]);
3032 schedstat_inc(p, se.nr_forced_migrations);
3038 if (tsk_cache_hot) {
3039 schedstat_inc(p, se.nr_failed_migrations_hot);
3045 static unsigned long
3046 balance_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3047 unsigned long max_load_move, struct sched_domain *sd,
3048 enum cpu_idle_type idle, int *all_pinned,
3049 int *this_best_prio, struct rq_iterator *iterator)
3051 int loops = 0, pulled = 0, pinned = 0;
3052 struct task_struct *p;
3053 long rem_load_move = max_load_move;
3055 if (max_load_move == 0)
3061 * Start the load-balancing iterator:
3063 p = iterator->start(iterator->arg);
3065 if (!p || loops++ > sysctl_sched_nr_migrate)
3068 if ((p->se.load.weight >> 1) > rem_load_move ||
3069 !can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3070 p = iterator->next(iterator->arg);
3074 pull_task(busiest, p, this_rq, this_cpu);
3076 rem_load_move -= p->se.load.weight;
3078 #ifdef CONFIG_PREEMPT
3080 * NEWIDLE balancing is a source of latency, so preemptible kernels
3081 * will stop after the first task is pulled to minimize the critical
3084 if (idle == CPU_NEWLY_IDLE)
3089 * We only want to steal up to the prescribed amount of weighted load.
3091 if (rem_load_move > 0) {
3092 if (p->prio < *this_best_prio)
3093 *this_best_prio = p->prio;
3094 p = iterator->next(iterator->arg);
3099 * Right now, this is one of only two places pull_task() is called,
3100 * so we can safely collect pull_task() stats here rather than
3101 * inside pull_task().
3103 schedstat_add(sd, lb_gained[idle], pulled);
3106 *all_pinned = pinned;
3108 return max_load_move - rem_load_move;
3112 * move_tasks tries to move up to max_load_move weighted load from busiest to
3113 * this_rq, as part of a balancing operation within domain "sd".
3114 * Returns 1 if successful and 0 otherwise.
3116 * Called with both runqueues locked.
3118 static int move_tasks(struct rq *this_rq, int this_cpu, struct rq *busiest,
3119 unsigned long max_load_move,
3120 struct sched_domain *sd, enum cpu_idle_type idle,
3123 const struct sched_class *class = sched_class_highest;
3124 unsigned long total_load_moved = 0;
3125 int this_best_prio = this_rq->curr->prio;
3129 class->load_balance(this_rq, this_cpu, busiest,
3130 max_load_move - total_load_moved,
3131 sd, idle, all_pinned, &this_best_prio);
3132 class = class->next;
3134 #ifdef CONFIG_PREEMPT
3136 * NEWIDLE balancing is a source of latency, so preemptible
3137 * kernels will stop after the first task is pulled to minimize
3138 * the critical section.
3140 if (idle == CPU_NEWLY_IDLE && this_rq->nr_running)
3143 } while (class && max_load_move > total_load_moved);
3145 return total_load_moved > 0;
3149 iter_move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3150 struct sched_domain *sd, enum cpu_idle_type idle,
3151 struct rq_iterator *iterator)
3153 struct task_struct *p = iterator->start(iterator->arg);
3157 if (can_migrate_task(p, busiest, this_cpu, sd, idle, &pinned)) {
3158 pull_task(busiest, p, this_rq, this_cpu);
3160 * Right now, this is only the second place pull_task()
3161 * is called, so we can safely collect pull_task()
3162 * stats here rather than inside pull_task().
3164 schedstat_inc(sd, lb_gained[idle]);
3168 p = iterator->next(iterator->arg);
3175 * move_one_task tries to move exactly one task from busiest to this_rq, as
3176 * part of active balancing operations within "domain".
3177 * Returns 1 if successful and 0 otherwise.
3179 * Called with both runqueues locked.
3181 static int move_one_task(struct rq *this_rq, int this_cpu, struct rq *busiest,
3182 struct sched_domain *sd, enum cpu_idle_type idle)
3184 const struct sched_class *class;
3186 for (class = sched_class_highest; class; class = class->next)
3187 if (class->move_one_task(this_rq, this_cpu, busiest, sd, idle))
3192 /********** Helpers for find_busiest_group ************************/
3194 * sd_lb_stats - Structure to store the statistics of a sched_domain
3195 * during load balancing.
3197 struct sd_lb_stats {
3198 struct sched_group *busiest; /* Busiest group in this sd */
3199 struct sched_group *this; /* Local group in this sd */
3200 unsigned long total_load; /* Total load of all groups in sd */
3201 unsigned long total_pwr; /* Total power of all groups in sd */
3202 unsigned long avg_load; /* Average load across all groups in sd */
3204 /** Statistics of this group */
3205 unsigned long this_load;
3206 unsigned long this_load_per_task;
3207 unsigned long this_nr_running;
3209 /* Statistics of the busiest group */
3210 unsigned long max_load;
3211 unsigned long busiest_load_per_task;
3212 unsigned long busiest_nr_running;
3214 int group_imb; /* Is there imbalance in this sd */
3215 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3216 int power_savings_balance; /* Is powersave balance needed for this sd */
3217 struct sched_group *group_min; /* Least loaded group in sd */
3218 struct sched_group *group_leader; /* Group which relieves group_min */
3219 unsigned long min_load_per_task; /* load_per_task in group_min */
3220 unsigned long leader_nr_running; /* Nr running of group_leader */
3221 unsigned long min_nr_running; /* Nr running of group_min */
3226 * sg_lb_stats - stats of a sched_group required for load_balancing
3228 struct sg_lb_stats {
3229 unsigned long avg_load; /*Avg load across the CPUs of the group */
3230 unsigned long group_load; /* Total load over the CPUs of the group */
3231 unsigned long sum_nr_running; /* Nr tasks running in the group */
3232 unsigned long sum_weighted_load; /* Weighted load of group's tasks */
3233 unsigned long group_capacity;
3234 int group_imb; /* Is there an imbalance in the group ? */
3238 * group_first_cpu - Returns the first cpu in the cpumask of a sched_group.
3239 * @group: The group whose first cpu is to be returned.
3241 static inline unsigned int group_first_cpu(struct sched_group *group)
3243 return cpumask_first(sched_group_cpus(group));
3247 * get_sd_load_idx - Obtain the load index for a given sched domain.
3248 * @sd: The sched_domain whose load_idx is to be obtained.
3249 * @idle: The Idle status of the CPU for whose sd load_icx is obtained.
3251 static inline int get_sd_load_idx(struct sched_domain *sd,
3252 enum cpu_idle_type idle)
3258 load_idx = sd->busy_idx;
3261 case CPU_NEWLY_IDLE:
3262 load_idx = sd->newidle_idx;
3265 load_idx = sd->idle_idx;
3274 * update_sg_lb_stats - Update sched_group's statistics for load balancing.
3275 * @group: sched_group whose statistics are to be updated.
3276 * @this_cpu: Cpu for which load balance is currently performed.
3277 * @idle: Idle status of this_cpu
3278 * @load_idx: Load index of sched_domain of this_cpu for load calc.
3279 * @sd_idle: Idle status of the sched_domain containing group.
3280 * @local_group: Does group contain this_cpu.
3281 * @cpus: Set of cpus considered for load balancing.
3282 * @balance: Should we balance.
3283 * @sgs: variable to hold the statistics for this group.
3285 static inline void update_sg_lb_stats(struct sched_group *group, int this_cpu,
3286 enum cpu_idle_type idle, int load_idx, int *sd_idle,
3287 int local_group, const struct cpumask *cpus,
3288 int *balance, struct sg_lb_stats *sgs)
3290 unsigned long load, max_cpu_load, min_cpu_load;
3292 unsigned int balance_cpu = -1, first_idle_cpu = 0;
3293 unsigned long sum_avg_load_per_task;
3294 unsigned long avg_load_per_task;
3297 balance_cpu = group_first_cpu(group);
3299 /* Tally up the load of all CPUs in the group */
3300 sum_avg_load_per_task = avg_load_per_task = 0;
3302 min_cpu_load = ~0UL;
3304 for_each_cpu_and(i, sched_group_cpus(group), cpus) {
3305 struct rq *rq = cpu_rq(i);
3307 if (*sd_idle && rq->nr_running)
3310 /* Bias balancing toward cpus of our domain */
3312 if (idle_cpu(i) && !first_idle_cpu) {
3317 load = target_load(i, load_idx);
3319 load = source_load(i, load_idx);
3320 if (load > max_cpu_load)
3321 max_cpu_load = load;
3322 if (min_cpu_load > load)
3323 min_cpu_load = load;
3326 sgs->group_load += load;
3327 sgs->sum_nr_running += rq->nr_running;
3328 sgs->sum_weighted_load += weighted_cpuload(i);
3330 sum_avg_load_per_task += cpu_avg_load_per_task(i);
3334 * First idle cpu or the first cpu(busiest) in this sched group
3335 * is eligible for doing load balancing at this and above
3336 * domains. In the newly idle case, we will allow all the cpu's
3337 * to do the newly idle load balance.
3339 if (idle != CPU_NEWLY_IDLE && local_group &&
3340 balance_cpu != this_cpu && balance) {
3345 /* Adjust by relative CPU power of the group */
3346 sgs->avg_load = sg_div_cpu_power(group,
3347 sgs->group_load * SCHED_LOAD_SCALE);
3351 * Consider the group unbalanced when the imbalance is larger
3352 * than the average weight of two tasks.
3354 * APZ: with cgroup the avg task weight can vary wildly and
3355 * might not be a suitable number - should we keep a
3356 * normalized nr_running number somewhere that negates
3359 avg_load_per_task = sg_div_cpu_power(group,
3360 sum_avg_load_per_task * SCHED_LOAD_SCALE);
3362 if ((max_cpu_load - min_cpu_load) > 2*avg_load_per_task)
3365 sgs->group_capacity = group->__cpu_power / SCHED_LOAD_SCALE;
3368 /******* find_busiest_group() helpers end here *********************/
3371 * find_busiest_group finds and returns the busiest CPU group within the
3372 * domain. It calculates and returns the amount of weighted load which
3373 * should be moved to restore balance via the imbalance parameter.
3375 static struct sched_group *
3376 find_busiest_group(struct sched_domain *sd, int this_cpu,
3377 unsigned long *imbalance, enum cpu_idle_type idle,
3378 int *sd_idle, const struct cpumask *cpus, int *balance)
3380 struct sd_lb_stats sds;
3381 struct sched_group *group = sd->groups;
3382 unsigned long max_pull;
3385 memset(&sds, 0, sizeof(sds));
3386 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3387 sds.power_savings_balance = 1;
3388 sds.min_nr_running = ULONG_MAX;
3390 load_idx = get_sd_load_idx(sd, idle);
3393 struct sg_lb_stats sgs;
3396 local_group = cpumask_test_cpu(this_cpu,
3397 sched_group_cpus(group));
3398 memset(&sgs, 0, sizeof(sgs));
3399 update_sg_lb_stats(group, this_cpu, idle, load_idx, sd_idle,
3400 local_group, cpus, balance, &sgs);
3402 if (balance && !(*balance))
3405 sds.total_load += sgs.group_load;
3406 sds.total_pwr += group->__cpu_power;
3409 sds.this_load = sgs.avg_load;
3411 sds.this_nr_running = sgs.sum_nr_running;
3412 sds.this_load_per_task = sgs.sum_weighted_load;
3413 } else if (sgs.avg_load > sds.max_load &&
3414 (sgs.sum_nr_running > sgs.group_capacity ||
3416 sds.max_load = sgs.avg_load;
3417 sds.busiest = group;
3418 sds.busiest_nr_running = sgs.sum_nr_running;
3419 sds.busiest_load_per_task = sgs.sum_weighted_load;
3420 sds.group_imb = sgs.group_imb;
3423 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3425 * Busy processors will not participate in power savings
3428 if (idle == CPU_NOT_IDLE ||
3429 !(sd->flags & SD_POWERSAVINGS_BALANCE))
3433 * If the local group is idle or completely loaded
3434 * no need to do power savings balance at this domain
3437 (sds.this_nr_running >= sgs.group_capacity ||
3438 !sds.this_nr_running))
3439 sds.power_savings_balance = 0;
3442 * If a group is already running at full capacity or idle,
3443 * don't include that group in power savings calculations
3445 if (!sds.power_savings_balance ||
3446 sgs.sum_nr_running >= sgs.group_capacity ||
3447 !sgs.sum_nr_running)
3451 * Calculate the group which has the least non-idle load.
3452 * This is the group from where we need to pick up the load
3455 if ((sgs.sum_nr_running < sds.min_nr_running) ||
3456 (sgs.sum_nr_running == sds.min_nr_running &&
3457 group_first_cpu(group) >
3458 group_first_cpu(sds.group_min))) {
3459 sds.group_min = group;
3460 sds.min_nr_running = sgs.sum_nr_running;
3461 sds.min_load_per_task = sgs.sum_weighted_load /
3466 * Calculate the group which is almost near its
3467 * capacity but still has some space to pick up some load
3468 * from other group and save more power
3470 if (sgs.sum_nr_running > sgs.group_capacity - 1)
3473 if (sgs.sum_nr_running > sds.leader_nr_running ||
3474 (sgs.sum_nr_running == sds.leader_nr_running &&
3475 group_first_cpu(group) <
3476 group_first_cpu(sds.group_leader))) {
3477 sds.group_leader = group;
3478 sds.leader_nr_running = sgs.sum_nr_running;
3482 group = group->next;
3483 } while (group != sd->groups);
3485 if (!sds.busiest || sds.this_load >= sds.max_load
3486 || sds.busiest_nr_running == 0)
3489 sds.avg_load = (SCHED_LOAD_SCALE * sds.total_load) / sds.total_pwr;
3491 if (sds.this_load >= sds.avg_load ||
3492 100*sds.max_load <= sd->imbalance_pct * sds.this_load)
3495 sds.busiest_load_per_task /= sds.busiest_nr_running;
3497 sds.busiest_load_per_task =
3498 min(sds.busiest_load_per_task, sds.avg_load);
3501 * We're trying to get all the cpus to the average_load, so we don't
3502 * want to push ourselves above the average load, nor do we wish to
3503 * reduce the max loaded cpu below the average load, as either of these
3504 * actions would just result in more rebalancing later, and ping-pong
3505 * tasks around. Thus we look for the minimum possible imbalance.
3506 * Negative imbalances (*we* are more loaded than anyone else) will
3507 * be counted as no imbalance for these purposes -- we can't fix that
3508 * by pulling tasks to us. Be careful of negative numbers as they'll
3509 * appear as very large values with unsigned longs.
3511 if (sds.max_load <= sds.busiest_load_per_task)
3515 * In the presence of smp nice balancing, certain scenarios can have
3516 * max load less than avg load(as we skip the groups at or below
3517 * its cpu_power, while calculating max_load..)
3519 if (sds.max_load < sds.avg_load) {
3521 goto small_imbalance;
3524 /* Don't want to pull so many tasks that a group would go idle */
3525 max_pull = min(sds.max_load - sds.avg_load,
3526 sds.max_load - sds.busiest_load_per_task);
3528 /* How much load to actually move to equalise the imbalance */
3529 *imbalance = min(max_pull * sds.busiest->__cpu_power,
3530 (sds.avg_load - sds.this_load) * sds.this->__cpu_power)
3534 * if *imbalance is less than the average load per runnable task
3535 * there is no gaurantee that any tasks will be moved so we'll have
3536 * a think about bumping its value to force at least one task to be
3539 if (*imbalance < sds.busiest_load_per_task) {
3540 unsigned long tmp, pwr_now, pwr_move;
3544 pwr_move = pwr_now = 0;
3546 if (sds.this_nr_running) {
3547 sds.this_load_per_task /= sds.this_nr_running;
3548 if (sds.busiest_load_per_task >
3549 sds.this_load_per_task)
3552 sds.this_load_per_task =
3553 cpu_avg_load_per_task(this_cpu);
3555 if (sds.max_load - sds.this_load +
3556 sds.busiest_load_per_task >=
3557 sds.busiest_load_per_task * imbn) {
3558 *imbalance = sds.busiest_load_per_task;
3563 * OK, we don't have enough imbalance to justify moving tasks,
3564 * however we may be able to increase total CPU power used by
3568 pwr_now += sds.busiest->__cpu_power *
3569 min(sds.busiest_load_per_task, sds.max_load);
3570 pwr_now += sds.this->__cpu_power *
3571 min(sds.this_load_per_task, sds.this_load);
3572 pwr_now /= SCHED_LOAD_SCALE;
3574 /* Amount of load we'd subtract */
3575 tmp = sg_div_cpu_power(sds.busiest,
3576 sds.busiest_load_per_task * SCHED_LOAD_SCALE);
3577 if (sds.max_load > tmp)
3578 pwr_move += sds.busiest->__cpu_power *
3579 min(sds.busiest_load_per_task,
3580 sds.max_load - tmp);
3582 /* Amount of load we'd add */
3583 if (sds.max_load * sds.busiest->__cpu_power <
3584 sds.busiest_load_per_task * SCHED_LOAD_SCALE)
3585 tmp = sg_div_cpu_power(sds.this,
3586 sds.max_load * sds.busiest->__cpu_power);
3588 tmp = sg_div_cpu_power(sds.this,
3589 sds.busiest_load_per_task * SCHED_LOAD_SCALE);
3590 pwr_move += sds.this->__cpu_power *
3591 min(sds.this_load_per_task,
3592 sds.this_load + tmp);
3593 pwr_move /= SCHED_LOAD_SCALE;
3595 /* Move if we gain throughput */
3596 if (pwr_move > pwr_now)
3597 *imbalance = sds.busiest_load_per_task;
3603 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
3604 if (idle == CPU_NOT_IDLE || !(sd->flags & SD_POWERSAVINGS_BALANCE))
3607 if (sds.this != sds.group_leader || sds.group_leader == sds.group_min)
3610 *imbalance = sds.min_load_per_task;
3611 if (sched_mc_power_savings >= POWERSAVINGS_BALANCE_WAKEUP) {
3612 cpu_rq(this_cpu)->rd->sched_mc_preferred_wakeup_cpu =
3613 group_first_cpu(sds.group_leader);
3615 return sds.group_min;
3624 * find_busiest_queue - find the busiest runqueue among the cpus in group.
3627 find_busiest_queue(struct sched_group *group, enum cpu_idle_type idle,
3628 unsigned long imbalance, const struct cpumask *cpus)
3630 struct rq *busiest = NULL, *rq;
3631 unsigned long max_load = 0;
3634 for_each_cpu(i, sched_group_cpus(group)) {
3637 if (!cpumask_test_cpu(i, cpus))
3641 wl = weighted_cpuload(i);
3643 if (rq->nr_running == 1 && wl > imbalance)
3646 if (wl > max_load) {
3656 * Max backoff if we encounter pinned tasks. Pretty arbitrary value, but
3657 * so long as it is large enough.
3659 #define MAX_PINNED_INTERVAL 512
3662 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3663 * tasks if there is an imbalance.
3665 static int load_balance(int this_cpu, struct rq *this_rq,
3666 struct sched_domain *sd, enum cpu_idle_type idle,
3667 int *balance, struct cpumask *cpus)
3669 int ld_moved, all_pinned = 0, active_balance = 0, sd_idle = 0;
3670 struct sched_group *group;
3671 unsigned long imbalance;
3673 unsigned long flags;
3675 cpumask_setall(cpus);
3678 * When power savings policy is enabled for the parent domain, idle
3679 * sibling can pick up load irrespective of busy siblings. In this case,
3680 * let the state of idle sibling percolate up as CPU_IDLE, instead of
3681 * portraying it as CPU_NOT_IDLE.
3683 if (idle != CPU_NOT_IDLE && sd->flags & SD_SHARE_CPUPOWER &&
3684 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3687 schedstat_inc(sd, lb_count[idle]);
3691 group = find_busiest_group(sd, this_cpu, &imbalance, idle, &sd_idle,
3698 schedstat_inc(sd, lb_nobusyg[idle]);
3702 busiest = find_busiest_queue(group, idle, imbalance, cpus);
3704 schedstat_inc(sd, lb_nobusyq[idle]);
3708 BUG_ON(busiest == this_rq);
3710 schedstat_add(sd, lb_imbalance[idle], imbalance);
3713 if (busiest->nr_running > 1) {
3715 * Attempt to move tasks. If find_busiest_group has found
3716 * an imbalance but busiest->nr_running <= 1, the group is
3717 * still unbalanced. ld_moved simply stays zero, so it is
3718 * correctly treated as an imbalance.
3720 local_irq_save(flags);
3721 double_rq_lock(this_rq, busiest);
3722 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3723 imbalance, sd, idle, &all_pinned);
3724 double_rq_unlock(this_rq, busiest);
3725 local_irq_restore(flags);
3728 * some other cpu did the load balance for us.
3730 if (ld_moved && this_cpu != smp_processor_id())
3731 resched_cpu(this_cpu);
3733 /* All tasks on this runqueue were pinned by CPU affinity */
3734 if (unlikely(all_pinned)) {
3735 cpumask_clear_cpu(cpu_of(busiest), cpus);
3736 if (!cpumask_empty(cpus))
3743 schedstat_inc(sd, lb_failed[idle]);
3744 sd->nr_balance_failed++;
3746 if (unlikely(sd->nr_balance_failed > sd->cache_nice_tries+2)) {
3748 spin_lock_irqsave(&busiest->lock, flags);
3750 /* don't kick the migration_thread, if the curr
3751 * task on busiest cpu can't be moved to this_cpu
3753 if (!cpumask_test_cpu(this_cpu,
3754 &busiest->curr->cpus_allowed)) {
3755 spin_unlock_irqrestore(&busiest->lock, flags);
3757 goto out_one_pinned;
3760 if (!busiest->active_balance) {
3761 busiest->active_balance = 1;
3762 busiest->push_cpu = this_cpu;
3765 spin_unlock_irqrestore(&busiest->lock, flags);
3767 wake_up_process(busiest->migration_thread);
3770 * We've kicked active balancing, reset the failure
3773 sd->nr_balance_failed = sd->cache_nice_tries+1;
3776 sd->nr_balance_failed = 0;
3778 if (likely(!active_balance)) {
3779 /* We were unbalanced, so reset the balancing interval */
3780 sd->balance_interval = sd->min_interval;
3783 * If we've begun active balancing, start to back off. This
3784 * case may not be covered by the all_pinned logic if there
3785 * is only 1 task on the busy runqueue (because we don't call
3788 if (sd->balance_interval < sd->max_interval)
3789 sd->balance_interval *= 2;
3792 if (!ld_moved && !sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3793 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3799 schedstat_inc(sd, lb_balanced[idle]);
3801 sd->nr_balance_failed = 0;
3804 /* tune up the balancing interval */
3805 if ((all_pinned && sd->balance_interval < MAX_PINNED_INTERVAL) ||
3806 (sd->balance_interval < sd->max_interval))
3807 sd->balance_interval *= 2;
3809 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3810 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3821 * Check this_cpu to ensure it is balanced within domain. Attempt to move
3822 * tasks if there is an imbalance.
3824 * Called from schedule when this_rq is about to become idle (CPU_NEWLY_IDLE).
3825 * this_rq is locked.
3828 load_balance_newidle(int this_cpu, struct rq *this_rq, struct sched_domain *sd,
3829 struct cpumask *cpus)
3831 struct sched_group *group;
3832 struct rq *busiest = NULL;
3833 unsigned long imbalance;
3838 cpumask_setall(cpus);
3841 * When power savings policy is enabled for the parent domain, idle
3842 * sibling can pick up load irrespective of busy siblings. In this case,
3843 * let the state of idle sibling percolate up as IDLE, instead of
3844 * portraying it as CPU_NOT_IDLE.
3846 if (sd->flags & SD_SHARE_CPUPOWER &&
3847 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3850 schedstat_inc(sd, lb_count[CPU_NEWLY_IDLE]);
3852 update_shares_locked(this_rq, sd);
3853 group = find_busiest_group(sd, this_cpu, &imbalance, CPU_NEWLY_IDLE,
3854 &sd_idle, cpus, NULL);
3856 schedstat_inc(sd, lb_nobusyg[CPU_NEWLY_IDLE]);
3860 busiest = find_busiest_queue(group, CPU_NEWLY_IDLE, imbalance, cpus);
3862 schedstat_inc(sd, lb_nobusyq[CPU_NEWLY_IDLE]);
3866 BUG_ON(busiest == this_rq);
3868 schedstat_add(sd, lb_imbalance[CPU_NEWLY_IDLE], imbalance);
3871 if (busiest->nr_running > 1) {
3872 /* Attempt to move tasks */
3873 double_lock_balance(this_rq, busiest);
3874 /* this_rq->clock is already updated */
3875 update_rq_clock(busiest);
3876 ld_moved = move_tasks(this_rq, this_cpu, busiest,
3877 imbalance, sd, CPU_NEWLY_IDLE,
3879 double_unlock_balance(this_rq, busiest);
3881 if (unlikely(all_pinned)) {
3882 cpumask_clear_cpu(cpu_of(busiest), cpus);
3883 if (!cpumask_empty(cpus))
3889 int active_balance = 0;
3891 schedstat_inc(sd, lb_failed[CPU_NEWLY_IDLE]);
3892 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3893 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3896 if (sched_mc_power_savings < POWERSAVINGS_BALANCE_WAKEUP)
3899 if (sd->nr_balance_failed++ < 2)
3903 * The only task running in a non-idle cpu can be moved to this
3904 * cpu in an attempt to completely freeup the other CPU
3905 * package. The same method used to move task in load_balance()
3906 * have been extended for load_balance_newidle() to speedup
3907 * consolidation at sched_mc=POWERSAVINGS_BALANCE_WAKEUP (2)
3909 * The package power saving logic comes from
3910 * find_busiest_group(). If there are no imbalance, then
3911 * f_b_g() will return NULL. However when sched_mc={1,2} then
3912 * f_b_g() will select a group from which a running task may be
3913 * pulled to this cpu in order to make the other package idle.
3914 * If there is no opportunity to make a package idle and if
3915 * there are no imbalance, then f_b_g() will return NULL and no
3916 * action will be taken in load_balance_newidle().
3918 * Under normal task pull operation due to imbalance, there
3919 * will be more than one task in the source run queue and
3920 * move_tasks() will succeed. ld_moved will be true and this
3921 * active balance code will not be triggered.
3924 /* Lock busiest in correct order while this_rq is held */
3925 double_lock_balance(this_rq, busiest);
3928 * don't kick the migration_thread, if the curr
3929 * task on busiest cpu can't be moved to this_cpu
3931 if (!cpumask_test_cpu(this_cpu, &busiest->curr->cpus_allowed)) {
3932 double_unlock_balance(this_rq, busiest);
3937 if (!busiest->active_balance) {
3938 busiest->active_balance = 1;
3939 busiest->push_cpu = this_cpu;
3943 double_unlock_balance(this_rq, busiest);
3945 * Should not call ttwu while holding a rq->lock
3947 spin_unlock(&this_rq->lock);
3949 wake_up_process(busiest->migration_thread);
3950 spin_lock(&this_rq->lock);
3953 sd->nr_balance_failed = 0;
3955 update_shares_locked(this_rq, sd);
3959 schedstat_inc(sd, lb_balanced[CPU_NEWLY_IDLE]);
3960 if (!sd_idle && sd->flags & SD_SHARE_CPUPOWER &&
3961 !test_sd_parent(sd, SD_POWERSAVINGS_BALANCE))
3963 sd->nr_balance_failed = 0;
3969 * idle_balance is called by schedule() if this_cpu is about to become
3970 * idle. Attempts to pull tasks from other CPUs.
3972 static void idle_balance(int this_cpu, struct rq *this_rq)
3974 struct sched_domain *sd;
3975 int pulled_task = 0;
3976 unsigned long next_balance = jiffies + HZ;
3977 cpumask_var_t tmpmask;
3979 if (!alloc_cpumask_var(&tmpmask, GFP_ATOMIC))
3982 for_each_domain(this_cpu, sd) {
3983 unsigned long interval;
3985 if (!(sd->flags & SD_LOAD_BALANCE))
3988 if (sd->flags & SD_BALANCE_NEWIDLE)
3989 /* If we've pulled tasks over stop searching: */
3990 pulled_task = load_balance_newidle(this_cpu, this_rq,
3993 interval = msecs_to_jiffies(sd->balance_interval);
3994 if (time_after(next_balance, sd->last_balance + interval))
3995 next_balance = sd->last_balance + interval;
3999 if (pulled_task || time_after(jiffies, this_rq->next_balance)) {
4001 * We are going idle. next_balance may be set based on
4002 * a busy processor. So reset next_balance.
4004 this_rq->next_balance = next_balance;
4006 free_cpumask_var(tmpmask);
4010 * active_load_balance is run by migration threads. It pushes running tasks
4011 * off the busiest CPU onto idle CPUs. It requires at least 1 task to be
4012 * running on each physical CPU where possible, and avoids physical /
4013 * logical imbalances.
4015 * Called with busiest_rq locked.
4017 static void active_load_balance(struct rq *busiest_rq, int busiest_cpu)
4019 int target_cpu = busiest_rq->push_cpu;
4020 struct sched_domain *sd;
4021 struct rq *target_rq;
4023 /* Is there any task to move? */
4024 if (busiest_rq->nr_running <= 1)
4027 target_rq = cpu_rq(target_cpu);
4030 * This condition is "impossible", if it occurs
4031 * we need to fix it. Originally reported by
4032 * Bjorn Helgaas on a 128-cpu setup.
4034 BUG_ON(busiest_rq == target_rq);
4036 /* move a task from busiest_rq to target_rq */
4037 double_lock_balance(busiest_rq, target_rq);
4038 update_rq_clock(busiest_rq);
4039 update_rq_clock(target_rq);
4041 /* Search for an sd spanning us and the target CPU. */
4042 for_each_domain(target_cpu, sd) {
4043 if ((sd->flags & SD_LOAD_BALANCE) &&
4044 cpumask_test_cpu(busiest_cpu, sched_domain_span(sd)))
4049 schedstat_inc(sd, alb_count);
4051 if (move_one_task(target_rq, target_cpu, busiest_rq,
4053 schedstat_inc(sd, alb_pushed);
4055 schedstat_inc(sd, alb_failed);
4057 double_unlock_balance(busiest_rq, target_rq);
4062 atomic_t load_balancer;
4063 cpumask_var_t cpu_mask;
4064 } nohz ____cacheline_aligned = {
4065 .load_balancer = ATOMIC_INIT(-1),
4069 * This routine will try to nominate the ilb (idle load balancing)
4070 * owner among the cpus whose ticks are stopped. ilb owner will do the idle
4071 * load balancing on behalf of all those cpus. If all the cpus in the system
4072 * go into this tickless mode, then there will be no ilb owner (as there is
4073 * no need for one) and all the cpus will sleep till the next wakeup event
4076 * For the ilb owner, tick is not stopped. And this tick will be used
4077 * for idle load balancing. ilb owner will still be part of
4080 * While stopping the tick, this cpu will become the ilb owner if there
4081 * is no other owner. And will be the owner till that cpu becomes busy
4082 * or if all cpus in the system stop their ticks at which point
4083 * there is no need for ilb owner.
4085 * When the ilb owner becomes busy, it nominates another owner, during the
4086 * next busy scheduler_tick()
4088 int select_nohz_load_balancer(int stop_tick)
4090 int cpu = smp_processor_id();
4093 cpu_rq(cpu)->in_nohz_recently = 1;
4095 if (!cpu_active(cpu)) {
4096 if (atomic_read(&nohz.load_balancer) != cpu)
4100 * If we are going offline and still the leader,
4103 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4109 cpumask_set_cpu(cpu, nohz.cpu_mask);
4111 /* time for ilb owner also to sleep */
4112 if (cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
4113 if (atomic_read(&nohz.load_balancer) == cpu)
4114 atomic_set(&nohz.load_balancer, -1);
4118 if (atomic_read(&nohz.load_balancer) == -1) {
4119 /* make me the ilb owner */
4120 if (atomic_cmpxchg(&nohz.load_balancer, -1, cpu) == -1)
4122 } else if (atomic_read(&nohz.load_balancer) == cpu)
4125 if (!cpumask_test_cpu(cpu, nohz.cpu_mask))
4128 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4130 if (atomic_read(&nohz.load_balancer) == cpu)
4131 if (atomic_cmpxchg(&nohz.load_balancer, cpu, -1) != cpu)
4138 static DEFINE_SPINLOCK(balancing);
4141 * It checks each scheduling domain to see if it is due to be balanced,
4142 * and initiates a balancing operation if so.
4144 * Balancing parameters are set up in arch_init_sched_domains.
4146 static void rebalance_domains(int cpu, enum cpu_idle_type idle)
4149 struct rq *rq = cpu_rq(cpu);
4150 unsigned long interval;
4151 struct sched_domain *sd;
4152 /* Earliest time when we have to do rebalance again */
4153 unsigned long next_balance = jiffies + 60*HZ;
4154 int update_next_balance = 0;
4158 /* Fails alloc? Rebalancing probably not a priority right now. */
4159 if (!alloc_cpumask_var(&tmp, GFP_ATOMIC))
4162 for_each_domain(cpu, sd) {
4163 if (!(sd->flags & SD_LOAD_BALANCE))
4166 interval = sd->balance_interval;
4167 if (idle != CPU_IDLE)
4168 interval *= sd->busy_factor;
4170 /* scale ms to jiffies */
4171 interval = msecs_to_jiffies(interval);
4172 if (unlikely(!interval))
4174 if (interval > HZ*NR_CPUS/10)
4175 interval = HZ*NR_CPUS/10;
4177 need_serialize = sd->flags & SD_SERIALIZE;
4179 if (need_serialize) {
4180 if (!spin_trylock(&balancing))
4184 if (time_after_eq(jiffies, sd->last_balance + interval)) {
4185 if (load_balance(cpu, rq, sd, idle, &balance, tmp)) {
4187 * We've pulled tasks over so either we're no
4188 * longer idle, or one of our SMT siblings is
4191 idle = CPU_NOT_IDLE;
4193 sd->last_balance = jiffies;
4196 spin_unlock(&balancing);
4198 if (time_after(next_balance, sd->last_balance + interval)) {
4199 next_balance = sd->last_balance + interval;
4200 update_next_balance = 1;
4204 * Stop the load balance at this level. There is another
4205 * CPU in our sched group which is doing load balancing more
4213 * next_balance will be updated only when there is a need.
4214 * When the cpu is attached to null domain for ex, it will not be
4217 if (likely(update_next_balance))
4218 rq->next_balance = next_balance;
4220 free_cpumask_var(tmp);
4224 * run_rebalance_domains is triggered when needed from the scheduler tick.
4225 * In CONFIG_NO_HZ case, the idle load balance owner will do the
4226 * rebalancing for all the cpus for whom scheduler ticks are stopped.
4228 static void run_rebalance_domains(struct softirq_action *h)
4230 int this_cpu = smp_processor_id();
4231 struct rq *this_rq = cpu_rq(this_cpu);
4232 enum cpu_idle_type idle = this_rq->idle_at_tick ?
4233 CPU_IDLE : CPU_NOT_IDLE;
4235 rebalance_domains(this_cpu, idle);
4239 * If this cpu is the owner for idle load balancing, then do the
4240 * balancing on behalf of the other idle cpus whose ticks are
4243 if (this_rq->idle_at_tick &&
4244 atomic_read(&nohz.load_balancer) == this_cpu) {
4248 for_each_cpu(balance_cpu, nohz.cpu_mask) {
4249 if (balance_cpu == this_cpu)
4253 * If this cpu gets work to do, stop the load balancing
4254 * work being done for other cpus. Next load
4255 * balancing owner will pick it up.
4260 rebalance_domains(balance_cpu, CPU_IDLE);
4262 rq = cpu_rq(balance_cpu);
4263 if (time_after(this_rq->next_balance, rq->next_balance))
4264 this_rq->next_balance = rq->next_balance;
4270 static inline int on_null_domain(int cpu)
4272 return !rcu_dereference(cpu_rq(cpu)->sd);
4276 * Trigger the SCHED_SOFTIRQ if it is time to do periodic load balancing.
4278 * In case of CONFIG_NO_HZ, this is the place where we nominate a new
4279 * idle load balancing owner or decide to stop the periodic load balancing,
4280 * if the whole system is idle.
4282 static inline void trigger_load_balance(struct rq *rq, int cpu)
4286 * If we were in the nohz mode recently and busy at the current
4287 * scheduler tick, then check if we need to nominate new idle
4290 if (rq->in_nohz_recently && !rq->idle_at_tick) {
4291 rq->in_nohz_recently = 0;
4293 if (atomic_read(&nohz.load_balancer) == cpu) {
4294 cpumask_clear_cpu(cpu, nohz.cpu_mask);
4295 atomic_set(&nohz.load_balancer, -1);
4298 if (atomic_read(&nohz.load_balancer) == -1) {
4300 * simple selection for now: Nominate the
4301 * first cpu in the nohz list to be the next
4304 * TBD: Traverse the sched domains and nominate
4305 * the nearest cpu in the nohz.cpu_mask.
4307 int ilb = cpumask_first(nohz.cpu_mask);
4309 if (ilb < nr_cpu_ids)
4315 * If this cpu is idle and doing idle load balancing for all the
4316 * cpus with ticks stopped, is it time for that to stop?
4318 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) == cpu &&
4319 cpumask_weight(nohz.cpu_mask) == num_online_cpus()) {
4325 * If this cpu is idle and the idle load balancing is done by
4326 * someone else, then no need raise the SCHED_SOFTIRQ
4328 if (rq->idle_at_tick && atomic_read(&nohz.load_balancer) != cpu &&
4329 cpumask_test_cpu(cpu, nohz.cpu_mask))
4332 /* Don't need to rebalance while attached to NULL domain */
4333 if (time_after_eq(jiffies, rq->next_balance) &&
4334 likely(!on_null_domain(cpu)))
4335 raise_softirq(SCHED_SOFTIRQ);
4338 #else /* CONFIG_SMP */
4341 * on UP we do not need to balance between CPUs:
4343 static inline void idle_balance(int cpu, struct rq *rq)
4349 DEFINE_PER_CPU(struct kernel_stat, kstat);
4351 EXPORT_PER_CPU_SYMBOL(kstat);
4354 * Return any ns on the sched_clock that have not yet been banked in
4355 * @p in case that task is currently running.
4357 unsigned long long task_delta_exec(struct task_struct *p)
4359 unsigned long flags;
4363 rq = task_rq_lock(p, &flags);
4365 if (task_current(rq, p)) {
4368 update_rq_clock(rq);
4369 delta_exec = rq->clock - p->se.exec_start;
4370 if ((s64)delta_exec > 0)
4374 task_rq_unlock(rq, &flags);
4380 * Account user cpu time to a process.
4381 * @p: the process that the cpu time gets accounted to
4382 * @cputime: the cpu time spent in user space since the last update
4383 * @cputime_scaled: cputime scaled by cpu frequency
4385 void account_user_time(struct task_struct *p, cputime_t cputime,
4386 cputime_t cputime_scaled)
4388 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4391 /* Add user time to process. */
4392 p->utime = cputime_add(p->utime, cputime);
4393 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
4394 account_group_user_time(p, cputime);
4396 /* Add user time to cpustat. */
4397 tmp = cputime_to_cputime64(cputime);
4398 if (TASK_NICE(p) > 0)
4399 cpustat->nice = cputime64_add(cpustat->nice, tmp);
4401 cpustat->user = cputime64_add(cpustat->user, tmp);
4402 /* Account for user time used */
4403 acct_update_integrals(p);
4407 * Account guest cpu time to a process.
4408 * @p: the process that the cpu time gets accounted to
4409 * @cputime: the cpu time spent in virtual machine since the last update
4410 * @cputime_scaled: cputime scaled by cpu frequency
4412 static void account_guest_time(struct task_struct *p, cputime_t cputime,
4413 cputime_t cputime_scaled)
4416 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4418 tmp = cputime_to_cputime64(cputime);
4420 /* Add guest time to process. */
4421 p->utime = cputime_add(p->utime, cputime);
4422 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
4423 account_group_user_time(p, cputime);
4424 p->gtime = cputime_add(p->gtime, cputime);
4426 /* Add guest time to cpustat. */
4427 cpustat->user = cputime64_add(cpustat->user, tmp);
4428 cpustat->guest = cputime64_add(cpustat->guest, tmp);
4432 * Account system cpu time to a process.
4433 * @p: the process that the cpu time gets accounted to
4434 * @hardirq_offset: the offset to subtract from hardirq_count()
4435 * @cputime: the cpu time spent in kernel space since the last update
4436 * @cputime_scaled: cputime scaled by cpu frequency
4438 void account_system_time(struct task_struct *p, int hardirq_offset,
4439 cputime_t cputime, cputime_t cputime_scaled)
4441 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4444 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
4445 account_guest_time(p, cputime, cputime_scaled);
4449 /* Add system time to process. */
4450 p->stime = cputime_add(p->stime, cputime);
4451 p->stimescaled = cputime_add(p->stimescaled, cputime_scaled);
4452 account_group_system_time(p, cputime);
4454 /* Add system time to cpustat. */
4455 tmp = cputime_to_cputime64(cputime);
4456 if (hardirq_count() - hardirq_offset)
4457 cpustat->irq = cputime64_add(cpustat->irq, tmp);
4458 else if (softirq_count())
4459 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
4461 cpustat->system = cputime64_add(cpustat->system, tmp);
4463 /* Account for system time used */
4464 acct_update_integrals(p);
4468 * Account for involuntary wait time.
4469 * @steal: the cpu time spent in involuntary wait
4471 void account_steal_time(cputime_t cputime)
4473 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4474 cputime64_t cputime64 = cputime_to_cputime64(cputime);
4476 cpustat->steal = cputime64_add(cpustat->steal, cputime64);
4480 * Account for idle time.
4481 * @cputime: the cpu time spent in idle wait
4483 void account_idle_time(cputime_t cputime)
4485 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
4486 cputime64_t cputime64 = cputime_to_cputime64(cputime);
4487 struct rq *rq = this_rq();
4489 if (atomic_read(&rq->nr_iowait) > 0)
4490 cpustat->iowait = cputime64_add(cpustat->iowait, cputime64);
4492 cpustat->idle = cputime64_add(cpustat->idle, cputime64);
4495 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
4498 * Account a single tick of cpu time.
4499 * @p: the process that the cpu time gets accounted to
4500 * @user_tick: indicates if the tick is a user or a system tick
4502 void account_process_tick(struct task_struct *p, int user_tick)
4504 cputime_t one_jiffy = jiffies_to_cputime(1);
4505 cputime_t one_jiffy_scaled = cputime_to_scaled(one_jiffy);
4506 struct rq *rq = this_rq();
4509 account_user_time(p, one_jiffy, one_jiffy_scaled);
4510 else if (p != rq->idle)
4511 account_system_time(p, HARDIRQ_OFFSET, one_jiffy,
4514 account_idle_time(one_jiffy);
4518 * Account multiple ticks of steal time.
4519 * @p: the process from which the cpu time has been stolen
4520 * @ticks: number of stolen ticks
4522 void account_steal_ticks(unsigned long ticks)
4524 account_steal_time(jiffies_to_cputime(ticks));
4528 * Account multiple ticks of idle time.
4529 * @ticks: number of stolen ticks
4531 void account_idle_ticks(unsigned long ticks)
4533 account_idle_time(jiffies_to_cputime(ticks));
4539 * Use precise platform statistics if available:
4541 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
4542 cputime_t task_utime(struct task_struct *p)
4547 cputime_t task_stime(struct task_struct *p)
4552 cputime_t task_utime(struct task_struct *p)
4554 clock_t utime = cputime_to_clock_t(p->utime),
4555 total = utime + cputime_to_clock_t(p->stime);
4559 * Use CFS's precise accounting:
4561 temp = (u64)nsec_to_clock_t(p->se.sum_exec_runtime);
4565 do_div(temp, total);
4567 utime = (clock_t)temp;
4569 p->prev_utime = max(p->prev_utime, clock_t_to_cputime(utime));
4570 return p->prev_utime;
4573 cputime_t task_stime(struct task_struct *p)
4578 * Use CFS's precise accounting. (we subtract utime from
4579 * the total, to make sure the total observed by userspace
4580 * grows monotonically - apps rely on that):
4582 stime = nsec_to_clock_t(p->se.sum_exec_runtime) -
4583 cputime_to_clock_t(task_utime(p));
4586 p->prev_stime = max(p->prev_stime, clock_t_to_cputime(stime));
4588 return p->prev_stime;
4592 inline cputime_t task_gtime(struct task_struct *p)
4598 * This function gets called by the timer code, with HZ frequency.
4599 * We call it with interrupts disabled.
4601 * It also gets called by the fork code, when changing the parent's
4604 void scheduler_tick(void)
4606 int cpu = smp_processor_id();
4607 struct rq *rq = cpu_rq(cpu);
4608 struct task_struct *curr = rq->curr;
4612 spin_lock(&rq->lock);
4613 update_rq_clock(rq);
4614 update_cpu_load(rq);
4615 curr->sched_class->task_tick(rq, curr, 0);
4616 spin_unlock(&rq->lock);
4619 rq->idle_at_tick = idle_cpu(cpu);
4620 trigger_load_balance(rq, cpu);
4624 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
4625 defined(CONFIG_PREEMPT_TRACER))
4627 static inline unsigned long get_parent_ip(unsigned long addr)
4629 if (in_lock_functions(addr)) {
4630 addr = CALLER_ADDR2;
4631 if (in_lock_functions(addr))
4632 addr = CALLER_ADDR3;
4637 void __kprobes add_preempt_count(int val)
4639 #ifdef CONFIG_DEBUG_PREEMPT
4643 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
4646 preempt_count() += val;
4647 #ifdef CONFIG_DEBUG_PREEMPT
4649 * Spinlock count overflowing soon?
4651 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
4654 if (preempt_count() == val)
4655 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4657 EXPORT_SYMBOL(add_preempt_count);
4659 void __kprobes sub_preempt_count(int val)
4661 #ifdef CONFIG_DEBUG_PREEMPT
4665 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
4668 * Is the spinlock portion underflowing?
4670 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
4671 !(preempt_count() & PREEMPT_MASK)))
4675 if (preempt_count() == val)
4676 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
4677 preempt_count() -= val;
4679 EXPORT_SYMBOL(sub_preempt_count);
4684 * Print scheduling while atomic bug:
4686 static noinline void __schedule_bug(struct task_struct *prev)
4688 struct pt_regs *regs = get_irq_regs();
4690 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
4691 prev->comm, prev->pid, preempt_count());
4693 debug_show_held_locks(prev);
4695 if (irqs_disabled())
4696 print_irqtrace_events(prev);
4705 * Various schedule()-time debugging checks and statistics:
4707 static inline void schedule_debug(struct task_struct *prev)
4710 * Test if we are atomic. Since do_exit() needs to call into
4711 * schedule() atomically, we ignore that path for now.
4712 * Otherwise, whine if we are scheduling when we should not be.
4714 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
4715 __schedule_bug(prev);
4717 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
4719 schedstat_inc(this_rq(), sched_count);
4720 #ifdef CONFIG_SCHEDSTATS
4721 if (unlikely(prev->lock_depth >= 0)) {
4722 schedstat_inc(this_rq(), bkl_count);
4723 schedstat_inc(prev, sched_info.bkl_count);
4728 static void put_prev_task(struct rq *rq, struct task_struct *prev)
4730 if (prev->state == TASK_RUNNING) {
4731 u64 runtime = prev->se.sum_exec_runtime;
4733 runtime -= prev->se.prev_sum_exec_runtime;
4734 runtime = min_t(u64, runtime, 2*sysctl_sched_migration_cost);
4737 * In order to avoid avg_overlap growing stale when we are
4738 * indeed overlapping and hence not getting put to sleep, grow
4739 * the avg_overlap on preemption.
4741 * We use the average preemption runtime because that
4742 * correlates to the amount of cache footprint a task can
4745 update_avg(&prev->se.avg_overlap, runtime);
4747 prev->sched_class->put_prev_task(rq, prev);
4751 * Pick up the highest-prio task:
4753 static inline struct task_struct *
4754 pick_next_task(struct rq *rq)
4756 const struct sched_class *class;
4757 struct task_struct *p;
4760 * Optimization: we know that if all tasks are in
4761 * the fair class we can call that function directly:
4763 if (likely(rq->nr_running == rq->cfs.nr_running)) {
4764 p = fair_sched_class.pick_next_task(rq);
4769 class = sched_class_highest;
4771 p = class->pick_next_task(rq);
4775 * Will never be NULL as the idle class always
4776 * returns a non-NULL p:
4778 class = class->next;
4783 * schedule() is the main scheduler function.
4785 asmlinkage void __sched schedule(void)
4787 struct task_struct *prev, *next;
4788 unsigned long *switch_count;
4794 cpu = smp_processor_id();
4798 switch_count = &prev->nivcsw;
4800 release_kernel_lock(prev);
4801 need_resched_nonpreemptible:
4803 schedule_debug(prev);
4805 if (sched_feat(HRTICK))
4808 spin_lock_irq(&rq->lock);
4809 update_rq_clock(rq);
4810 clear_tsk_need_resched(prev);
4812 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
4813 if (unlikely(signal_pending_state(prev->state, prev)))
4814 prev->state = TASK_RUNNING;
4816 deactivate_task(rq, prev, 1);
4817 switch_count = &prev->nvcsw;
4821 if (prev->sched_class->pre_schedule)
4822 prev->sched_class->pre_schedule(rq, prev);
4825 if (unlikely(!rq->nr_running))
4826 idle_balance(cpu, rq);
4828 put_prev_task(rq, prev);
4829 next = pick_next_task(rq);
4831 if (likely(prev != next)) {
4832 sched_info_switch(prev, next);
4838 context_switch(rq, prev, next); /* unlocks the rq */
4840 * the context switch might have flipped the stack from under
4841 * us, hence refresh the local variables.
4843 cpu = smp_processor_id();
4846 spin_unlock_irq(&rq->lock);
4848 if (unlikely(reacquire_kernel_lock(current) < 0))
4849 goto need_resched_nonpreemptible;
4851 preempt_enable_no_resched();
4852 if (unlikely(test_thread_flag(TIF_NEED_RESCHED)))
4855 EXPORT_SYMBOL(schedule);
4857 #ifdef CONFIG_PREEMPT
4859 * this is the entry point to schedule() from in-kernel preemption
4860 * off of preempt_enable. Kernel preemptions off return from interrupt
4861 * occur there and call schedule directly.
4863 asmlinkage void __sched preempt_schedule(void)
4865 struct thread_info *ti = current_thread_info();
4868 * If there is a non-zero preempt_count or interrupts are disabled,
4869 * we do not want to preempt the current task. Just return..
4871 if (likely(ti->preempt_count || irqs_disabled()))
4875 add_preempt_count(PREEMPT_ACTIVE);
4877 sub_preempt_count(PREEMPT_ACTIVE);
4880 * Check again in case we missed a preemption opportunity
4881 * between schedule and now.
4884 } while (need_resched());
4886 EXPORT_SYMBOL(preempt_schedule);
4889 * this is the entry point to schedule() from kernel preemption
4890 * off of irq context.
4891 * Note, that this is called and return with irqs disabled. This will
4892 * protect us against recursive calling from irq.
4894 asmlinkage void __sched preempt_schedule_irq(void)
4896 struct thread_info *ti = current_thread_info();
4898 /* Catch callers which need to be fixed */
4899 BUG_ON(ti->preempt_count || !irqs_disabled());
4902 add_preempt_count(PREEMPT_ACTIVE);
4905 local_irq_disable();
4906 sub_preempt_count(PREEMPT_ACTIVE);
4909 * Check again in case we missed a preemption opportunity
4910 * between schedule and now.
4913 } while (need_resched());
4916 #endif /* CONFIG_PREEMPT */
4918 int default_wake_function(wait_queue_t *curr, unsigned mode, int sync,
4921 return try_to_wake_up(curr->private, mode, sync);
4923 EXPORT_SYMBOL(default_wake_function);
4926 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
4927 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
4928 * number) then we wake all the non-exclusive tasks and one exclusive task.
4930 * There are circumstances in which we can try to wake a task which has already
4931 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
4932 * zero in this (rare) case, and we handle it by continuing to scan the queue.
4934 void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
4935 int nr_exclusive, int sync, void *key)
4937 wait_queue_t *curr, *next;
4939 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
4940 unsigned flags = curr->flags;
4942 if (curr->func(curr, mode, sync, key) &&
4943 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
4949 * __wake_up - wake up threads blocked on a waitqueue.
4951 * @mode: which threads
4952 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4953 * @key: is directly passed to the wakeup function
4955 void __wake_up(wait_queue_head_t *q, unsigned int mode,
4956 int nr_exclusive, void *key)
4958 unsigned long flags;
4960 spin_lock_irqsave(&q->lock, flags);
4961 __wake_up_common(q, mode, nr_exclusive, 0, key);
4962 spin_unlock_irqrestore(&q->lock, flags);
4964 EXPORT_SYMBOL(__wake_up);
4967 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
4969 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
4971 __wake_up_common(q, mode, 1, 0, NULL);
4975 * __wake_up_sync - wake up threads blocked on a waitqueue.
4977 * @mode: which threads
4978 * @nr_exclusive: how many wake-one or wake-many threads to wake up
4980 * The sync wakeup differs that the waker knows that it will schedule
4981 * away soon, so while the target thread will be woken up, it will not
4982 * be migrated to another CPU - ie. the two threads are 'synchronized'
4983 * with each other. This can prevent needless bouncing between CPUs.
4985 * On UP it can prevent extra preemption.
4988 __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
4990 unsigned long flags;
4996 if (unlikely(!nr_exclusive))
4999 spin_lock_irqsave(&q->lock, flags);
5000 __wake_up_common(q, mode, nr_exclusive, sync, NULL);
5001 spin_unlock_irqrestore(&q->lock, flags);
5003 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
5006 * complete: - signals a single thread waiting on this completion
5007 * @x: holds the state of this particular completion
5009 * This will wake up a single thread waiting on this completion. Threads will be
5010 * awakened in the same order in which they were queued.
5012 * See also complete_all(), wait_for_completion() and related routines.
5014 void complete(struct completion *x)
5016 unsigned long flags;
5018 spin_lock_irqsave(&x->wait.lock, flags);
5020 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
5021 spin_unlock_irqrestore(&x->wait.lock, flags);
5023 EXPORT_SYMBOL(complete);
5026 * complete_all: - signals all threads waiting on this completion
5027 * @x: holds the state of this particular completion
5029 * This will wake up all threads waiting on this particular completion event.
5031 void complete_all(struct completion *x)
5033 unsigned long flags;
5035 spin_lock_irqsave(&x->wait.lock, flags);
5036 x->done += UINT_MAX/2;
5037 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
5038 spin_unlock_irqrestore(&x->wait.lock, flags);
5040 EXPORT_SYMBOL(complete_all);
5042 static inline long __sched
5043 do_wait_for_common(struct completion *x, long timeout, int state)
5046 DECLARE_WAITQUEUE(wait, current);
5048 wait.flags |= WQ_FLAG_EXCLUSIVE;
5049 __add_wait_queue_tail(&x->wait, &wait);
5051 if (signal_pending_state(state, current)) {
5052 timeout = -ERESTARTSYS;
5055 __set_current_state(state);
5056 spin_unlock_irq(&x->wait.lock);
5057 timeout = schedule_timeout(timeout);
5058 spin_lock_irq(&x->wait.lock);
5059 } while (!x->done && timeout);
5060 __remove_wait_queue(&x->wait, &wait);
5065 return timeout ?: 1;
5069 wait_for_common(struct completion *x, long timeout, int state)
5073 spin_lock_irq(&x->wait.lock);
5074 timeout = do_wait_for_common(x, timeout, state);
5075 spin_unlock_irq(&x->wait.lock);
5080 * wait_for_completion: - waits for completion of a task
5081 * @x: holds the state of this particular completion
5083 * This waits to be signaled for completion of a specific task. It is NOT
5084 * interruptible and there is no timeout.
5086 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
5087 * and interrupt capability. Also see complete().
5089 void __sched wait_for_completion(struct completion *x)
5091 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
5093 EXPORT_SYMBOL(wait_for_completion);
5096 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
5097 * @x: holds the state of this particular completion
5098 * @timeout: timeout value in jiffies
5100 * This waits for either a completion of a specific task to be signaled or for a
5101 * specified timeout to expire. The timeout is in jiffies. It is not
5104 unsigned long __sched
5105 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
5107 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
5109 EXPORT_SYMBOL(wait_for_completion_timeout);
5112 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
5113 * @x: holds the state of this particular completion
5115 * This waits for completion of a specific task to be signaled. It is
5118 int __sched wait_for_completion_interruptible(struct completion *x)
5120 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
5121 if (t == -ERESTARTSYS)
5125 EXPORT_SYMBOL(wait_for_completion_interruptible);
5128 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
5129 * @x: holds the state of this particular completion
5130 * @timeout: timeout value in jiffies
5132 * This waits for either a completion of a specific task to be signaled or for a
5133 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
5135 unsigned long __sched
5136 wait_for_completion_interruptible_timeout(struct completion *x,
5137 unsigned long timeout)
5139 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
5141 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
5144 * wait_for_completion_killable: - waits for completion of a task (killable)
5145 * @x: holds the state of this particular completion
5147 * This waits to be signaled for completion of a specific task. It can be
5148 * interrupted by a kill signal.
5150 int __sched wait_for_completion_killable(struct completion *x)
5152 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
5153 if (t == -ERESTARTSYS)
5157 EXPORT_SYMBOL(wait_for_completion_killable);
5160 * try_wait_for_completion - try to decrement a completion without blocking
5161 * @x: completion structure
5163 * Returns: 0 if a decrement cannot be done without blocking
5164 * 1 if a decrement succeeded.
5166 * If a completion is being used as a counting completion,
5167 * attempt to decrement the counter without blocking. This
5168 * enables us to avoid waiting if the resource the completion
5169 * is protecting is not available.
5171 bool try_wait_for_completion(struct completion *x)
5175 spin_lock_irq(&x->wait.lock);
5180 spin_unlock_irq(&x->wait.lock);
5183 EXPORT_SYMBOL(try_wait_for_completion);
5186 * completion_done - Test to see if a completion has any waiters
5187 * @x: completion structure
5189 * Returns: 0 if there are waiters (wait_for_completion() in progress)
5190 * 1 if there are no waiters.
5193 bool completion_done(struct completion *x)
5197 spin_lock_irq(&x->wait.lock);
5200 spin_unlock_irq(&x->wait.lock);
5203 EXPORT_SYMBOL(completion_done);
5206 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
5208 unsigned long flags;
5211 init_waitqueue_entry(&wait, current);
5213 __set_current_state(state);
5215 spin_lock_irqsave(&q->lock, flags);
5216 __add_wait_queue(q, &wait);
5217 spin_unlock(&q->lock);
5218 timeout = schedule_timeout(timeout);
5219 spin_lock_irq(&q->lock);
5220 __remove_wait_queue(q, &wait);
5221 spin_unlock_irqrestore(&q->lock, flags);
5226 void __sched interruptible_sleep_on(wait_queue_head_t *q)
5228 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
5230 EXPORT_SYMBOL(interruptible_sleep_on);
5233 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
5235 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
5237 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
5239 void __sched sleep_on(wait_queue_head_t *q)
5241 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
5243 EXPORT_SYMBOL(sleep_on);
5245 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
5247 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
5249 EXPORT_SYMBOL(sleep_on_timeout);
5251 #ifdef CONFIG_RT_MUTEXES
5254 * rt_mutex_setprio - set the current priority of a task
5256 * @prio: prio value (kernel-internal form)
5258 * This function changes the 'effective' priority of a task. It does
5259 * not touch ->normal_prio like __setscheduler().
5261 * Used by the rt_mutex code to implement priority inheritance logic.
5263 void rt_mutex_setprio(struct task_struct *p, int prio)
5265 unsigned long flags;
5266 int oldprio, on_rq, running;
5268 const struct sched_class *prev_class = p->sched_class;
5270 BUG_ON(prio < 0 || prio > MAX_PRIO);
5272 rq = task_rq_lock(p, &flags);
5273 update_rq_clock(rq);
5276 on_rq = p->se.on_rq;
5277 running = task_current(rq, p);
5279 dequeue_task(rq, p, 0);
5281 p->sched_class->put_prev_task(rq, p);
5284 p->sched_class = &rt_sched_class;
5286 p->sched_class = &fair_sched_class;
5291 p->sched_class->set_curr_task(rq);
5293 enqueue_task(rq, p, 0);
5295 check_class_changed(rq, p, prev_class, oldprio, running);
5297 task_rq_unlock(rq, &flags);
5302 void set_user_nice(struct task_struct *p, long nice)
5304 int old_prio, delta, on_rq;
5305 unsigned long flags;
5308 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
5311 * We have to be careful, if called from sys_setpriority(),
5312 * the task might be in the middle of scheduling on another CPU.
5314 rq = task_rq_lock(p, &flags);
5315 update_rq_clock(rq);
5317 * The RT priorities are set via sched_setscheduler(), but we still
5318 * allow the 'normal' nice value to be set - but as expected
5319 * it wont have any effect on scheduling until the task is
5320 * SCHED_FIFO/SCHED_RR:
5322 if (task_has_rt_policy(p)) {
5323 p->static_prio = NICE_TO_PRIO(nice);
5326 on_rq = p->se.on_rq;
5328 dequeue_task(rq, p, 0);
5330 p->static_prio = NICE_TO_PRIO(nice);
5333 p->prio = effective_prio(p);
5334 delta = p->prio - old_prio;
5337 enqueue_task(rq, p, 0);
5339 * If the task increased its priority or is running and
5340 * lowered its priority, then reschedule its CPU:
5342 if (delta < 0 || (delta > 0 && task_running(rq, p)))
5343 resched_task(rq->curr);
5346 task_rq_unlock(rq, &flags);
5348 EXPORT_SYMBOL(set_user_nice);
5351 * can_nice - check if a task can reduce its nice value
5355 int can_nice(const struct task_struct *p, const int nice)
5357 /* convert nice value [19,-20] to rlimit style value [1,40] */
5358 int nice_rlim = 20 - nice;
5360 return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur ||
5361 capable(CAP_SYS_NICE));
5364 #ifdef __ARCH_WANT_SYS_NICE
5367 * sys_nice - change the priority of the current process.
5368 * @increment: priority increment
5370 * sys_setpriority is a more generic, but much slower function that
5371 * does similar things.
5373 SYSCALL_DEFINE1(nice, int, increment)
5378 * Setpriority might change our priority at the same moment.
5379 * We don't have to worry. Conceptually one call occurs first
5380 * and we have a single winner.
5382 if (increment < -40)
5387 nice = TASK_NICE(current) + increment;
5393 if (increment < 0 && !can_nice(current, nice))
5396 retval = security_task_setnice(current, nice);
5400 set_user_nice(current, nice);
5407 * task_prio - return the priority value of a given task.
5408 * @p: the task in question.
5410 * This is the priority value as seen by users in /proc.
5411 * RT tasks are offset by -200. Normal tasks are centered
5412 * around 0, value goes from -16 to +15.
5414 int task_prio(const struct task_struct *p)
5416 return p->prio - MAX_RT_PRIO;
5420 * task_nice - return the nice value of a given task.
5421 * @p: the task in question.
5423 int task_nice(const struct task_struct *p)
5425 return TASK_NICE(p);
5427 EXPORT_SYMBOL(task_nice);
5430 * idle_cpu - is a given cpu idle currently?
5431 * @cpu: the processor in question.
5433 int idle_cpu(int cpu)
5435 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
5439 * idle_task - return the idle task for a given cpu.
5440 * @cpu: the processor in question.
5442 struct task_struct *idle_task(int cpu)
5444 return cpu_rq(cpu)->idle;
5448 * find_process_by_pid - find a process with a matching PID value.
5449 * @pid: the pid in question.
5451 static struct task_struct *find_process_by_pid(pid_t pid)
5453 return pid ? find_task_by_vpid(pid) : current;
5456 /* Actually do priority change: must hold rq lock. */
5458 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
5460 BUG_ON(p->se.on_rq);
5463 switch (p->policy) {
5467 p->sched_class = &fair_sched_class;
5471 p->sched_class = &rt_sched_class;
5475 p->rt_priority = prio;
5476 p->normal_prio = normal_prio(p);
5477 /* we are holding p->pi_lock already */
5478 p->prio = rt_mutex_getprio(p);
5483 * check the target process has a UID that matches the current process's
5485 static bool check_same_owner(struct task_struct *p)
5487 const struct cred *cred = current_cred(), *pcred;
5491 pcred = __task_cred(p);
5492 match = (cred->euid == pcred->euid ||
5493 cred->euid == pcred->uid);
5498 static int __sched_setscheduler(struct task_struct *p, int policy,
5499 struct sched_param *param, bool user)
5501 int retval, oldprio, oldpolicy = -1, on_rq, running;
5502 unsigned long flags;
5503 const struct sched_class *prev_class = p->sched_class;
5506 /* may grab non-irq protected spin_locks */
5507 BUG_ON(in_interrupt());
5509 /* double check policy once rq lock held */
5511 policy = oldpolicy = p->policy;
5512 else if (policy != SCHED_FIFO && policy != SCHED_RR &&
5513 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
5514 policy != SCHED_IDLE)
5517 * Valid priorities for SCHED_FIFO and SCHED_RR are
5518 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
5519 * SCHED_BATCH and SCHED_IDLE is 0.
5521 if (param->sched_priority < 0 ||
5522 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
5523 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
5525 if (rt_policy(policy) != (param->sched_priority != 0))
5529 * Allow unprivileged RT tasks to decrease priority:
5531 if (user && !capable(CAP_SYS_NICE)) {
5532 if (rt_policy(policy)) {
5533 unsigned long rlim_rtprio;
5535 if (!lock_task_sighand(p, &flags))
5537 rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur;
5538 unlock_task_sighand(p, &flags);
5540 /* can't set/change the rt policy */
5541 if (policy != p->policy && !rlim_rtprio)
5544 /* can't increase priority */
5545 if (param->sched_priority > p->rt_priority &&
5546 param->sched_priority > rlim_rtprio)
5550 * Like positive nice levels, dont allow tasks to
5551 * move out of SCHED_IDLE either:
5553 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
5556 /* can't change other user's priorities */
5557 if (!check_same_owner(p))
5562 #ifdef CONFIG_RT_GROUP_SCHED
5564 * Do not allow realtime tasks into groups that have no runtime
5567 if (rt_bandwidth_enabled() && rt_policy(policy) &&
5568 task_group(p)->rt_bandwidth.rt_runtime == 0)
5572 retval = security_task_setscheduler(p, policy, param);
5578 * make sure no PI-waiters arrive (or leave) while we are
5579 * changing the priority of the task:
5581 spin_lock_irqsave(&p->pi_lock, flags);
5583 * To be able to change p->policy safely, the apropriate
5584 * runqueue lock must be held.
5586 rq = __task_rq_lock(p);
5587 /* recheck policy now with rq lock held */
5588 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
5589 policy = oldpolicy = -1;
5590 __task_rq_unlock(rq);
5591 spin_unlock_irqrestore(&p->pi_lock, flags);
5594 update_rq_clock(rq);
5595 on_rq = p->se.on_rq;
5596 running = task_current(rq, p);
5598 deactivate_task(rq, p, 0);
5600 p->sched_class->put_prev_task(rq, p);
5603 __setscheduler(rq, p, policy, param->sched_priority);
5606 p->sched_class->set_curr_task(rq);
5608 activate_task(rq, p, 0);
5610 check_class_changed(rq, p, prev_class, oldprio, running);
5612 __task_rq_unlock(rq);
5613 spin_unlock_irqrestore(&p->pi_lock, flags);
5615 rt_mutex_adjust_pi(p);
5621 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
5622 * @p: the task in question.
5623 * @policy: new policy.
5624 * @param: structure containing the new RT priority.
5626 * NOTE that the task may be already dead.
5628 int sched_setscheduler(struct task_struct *p, int policy,
5629 struct sched_param *param)
5631 return __sched_setscheduler(p, policy, param, true);
5633 EXPORT_SYMBOL_GPL(sched_setscheduler);
5636 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
5637 * @p: the task in question.
5638 * @policy: new policy.
5639 * @param: structure containing the new RT priority.
5641 * Just like sched_setscheduler, only don't bother checking if the
5642 * current context has permission. For example, this is needed in
5643 * stop_machine(): we create temporary high priority worker threads,
5644 * but our caller might not have that capability.
5646 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
5647 struct sched_param *param)
5649 return __sched_setscheduler(p, policy, param, false);
5653 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
5655 struct sched_param lparam;
5656 struct task_struct *p;
5659 if (!param || pid < 0)
5661 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
5666 p = find_process_by_pid(pid);
5668 retval = sched_setscheduler(p, policy, &lparam);
5675 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
5676 * @pid: the pid in question.
5677 * @policy: new policy.
5678 * @param: structure containing the new RT priority.
5680 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
5681 struct sched_param __user *, param)
5683 /* negative values for policy are not valid */
5687 return do_sched_setscheduler(pid, policy, param);
5691 * sys_sched_setparam - set/change the RT priority of a thread
5692 * @pid: the pid in question.
5693 * @param: structure containing the new RT priority.
5695 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
5697 return do_sched_setscheduler(pid, -1, param);
5701 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
5702 * @pid: the pid in question.
5704 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
5706 struct task_struct *p;
5713 read_lock(&tasklist_lock);
5714 p = find_process_by_pid(pid);
5716 retval = security_task_getscheduler(p);
5720 read_unlock(&tasklist_lock);
5725 * sys_sched_getscheduler - get the RT priority of a thread
5726 * @pid: the pid in question.
5727 * @param: structure containing the RT priority.
5729 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
5731 struct sched_param lp;
5732 struct task_struct *p;
5735 if (!param || pid < 0)
5738 read_lock(&tasklist_lock);
5739 p = find_process_by_pid(pid);
5744 retval = security_task_getscheduler(p);
5748 lp.sched_priority = p->rt_priority;
5749 read_unlock(&tasklist_lock);
5752 * This one might sleep, we cannot do it with a spinlock held ...
5754 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
5759 read_unlock(&tasklist_lock);
5763 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
5765 cpumask_var_t cpus_allowed, new_mask;
5766 struct task_struct *p;
5770 read_lock(&tasklist_lock);
5772 p = find_process_by_pid(pid);
5774 read_unlock(&tasklist_lock);
5780 * It is not safe to call set_cpus_allowed with the
5781 * tasklist_lock held. We will bump the task_struct's
5782 * usage count and then drop tasklist_lock.
5785 read_unlock(&tasklist_lock);
5787 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
5791 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
5793 goto out_free_cpus_allowed;
5796 if (!check_same_owner(p) && !capable(CAP_SYS_NICE))
5799 retval = security_task_setscheduler(p, 0, NULL);
5803 cpuset_cpus_allowed(p, cpus_allowed);
5804 cpumask_and(new_mask, in_mask, cpus_allowed);
5806 retval = set_cpus_allowed_ptr(p, new_mask);
5809 cpuset_cpus_allowed(p, cpus_allowed);
5810 if (!cpumask_subset(new_mask, cpus_allowed)) {
5812 * We must have raced with a concurrent cpuset
5813 * update. Just reset the cpus_allowed to the
5814 * cpuset's cpus_allowed
5816 cpumask_copy(new_mask, cpus_allowed);
5821 free_cpumask_var(new_mask);
5822 out_free_cpus_allowed:
5823 free_cpumask_var(cpus_allowed);
5830 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
5831 struct cpumask *new_mask)
5833 if (len < cpumask_size())
5834 cpumask_clear(new_mask);
5835 else if (len > cpumask_size())
5836 len = cpumask_size();
5838 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
5842 * sys_sched_setaffinity - set the cpu affinity of a process
5843 * @pid: pid of the process
5844 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5845 * @user_mask_ptr: user-space pointer to the new cpu mask
5847 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
5848 unsigned long __user *, user_mask_ptr)
5850 cpumask_var_t new_mask;
5853 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
5856 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
5858 retval = sched_setaffinity(pid, new_mask);
5859 free_cpumask_var(new_mask);
5863 long sched_getaffinity(pid_t pid, struct cpumask *mask)
5865 struct task_struct *p;
5869 read_lock(&tasklist_lock);
5872 p = find_process_by_pid(pid);
5876 retval = security_task_getscheduler(p);
5880 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
5883 read_unlock(&tasklist_lock);
5890 * sys_sched_getaffinity - get the cpu affinity of a process
5891 * @pid: pid of the process
5892 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
5893 * @user_mask_ptr: user-space pointer to hold the current cpu mask
5895 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
5896 unsigned long __user *, user_mask_ptr)
5901 if (len < cpumask_size())
5904 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
5907 ret = sched_getaffinity(pid, mask);
5909 if (copy_to_user(user_mask_ptr, mask, cpumask_size()))
5912 ret = cpumask_size();
5914 free_cpumask_var(mask);
5920 * sys_sched_yield - yield the current processor to other threads.
5922 * This function yields the current CPU to other tasks. If there are no
5923 * other threads running on this CPU then this function will return.
5925 SYSCALL_DEFINE0(sched_yield)
5927 struct rq *rq = this_rq_lock();
5929 schedstat_inc(rq, yld_count);
5930 current->sched_class->yield_task(rq);
5933 * Since we are going to call schedule() anyway, there's
5934 * no need to preempt or enable interrupts:
5936 __release(rq->lock);
5937 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
5938 _raw_spin_unlock(&rq->lock);
5939 preempt_enable_no_resched();
5946 static void __cond_resched(void)
5948 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
5949 __might_sleep(__FILE__, __LINE__);
5952 * The BKS might be reacquired before we have dropped
5953 * PREEMPT_ACTIVE, which could trigger a second
5954 * cond_resched() call.
5957 add_preempt_count(PREEMPT_ACTIVE);
5959 sub_preempt_count(PREEMPT_ACTIVE);
5960 } while (need_resched());
5963 int __sched _cond_resched(void)
5965 if (need_resched() && !(preempt_count() & PREEMPT_ACTIVE) &&
5966 system_state == SYSTEM_RUNNING) {
5972 EXPORT_SYMBOL(_cond_resched);
5975 * cond_resched_lock() - if a reschedule is pending, drop the given lock,
5976 * call schedule, and on return reacquire the lock.
5978 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
5979 * operations here to prevent schedule() from being called twice (once via
5980 * spin_unlock(), once by hand).
5982 int cond_resched_lock(spinlock_t *lock)
5984 int resched = need_resched() && system_state == SYSTEM_RUNNING;
5987 if (spin_needbreak(lock) || resched) {
5989 if (resched && need_resched())
5998 EXPORT_SYMBOL(cond_resched_lock);
6000 int __sched cond_resched_softirq(void)
6002 BUG_ON(!in_softirq());
6004 if (need_resched() && system_state == SYSTEM_RUNNING) {
6012 EXPORT_SYMBOL(cond_resched_softirq);
6015 * yield - yield the current processor to other threads.
6017 * This is a shortcut for kernel-space yielding - it marks the
6018 * thread runnable and calls sys_sched_yield().
6020 void __sched yield(void)
6022 set_current_state(TASK_RUNNING);
6025 EXPORT_SYMBOL(yield);
6028 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
6029 * that process accounting knows that this is a task in IO wait state.
6031 * But don't do that if it is a deliberate, throttling IO wait (this task
6032 * has set its backing_dev_info: the queue against which it should throttle)
6034 void __sched io_schedule(void)
6036 struct rq *rq = &__raw_get_cpu_var(runqueues);
6038 delayacct_blkio_start();
6039 atomic_inc(&rq->nr_iowait);
6041 atomic_dec(&rq->nr_iowait);
6042 delayacct_blkio_end();
6044 EXPORT_SYMBOL(io_schedule);
6046 long __sched io_schedule_timeout(long timeout)
6048 struct rq *rq = &__raw_get_cpu_var(runqueues);
6051 delayacct_blkio_start();
6052 atomic_inc(&rq->nr_iowait);
6053 ret = schedule_timeout(timeout);
6054 atomic_dec(&rq->nr_iowait);
6055 delayacct_blkio_end();
6060 * sys_sched_get_priority_max - return maximum RT priority.
6061 * @policy: scheduling class.
6063 * this syscall returns the maximum rt_priority that can be used
6064 * by a given scheduling class.
6066 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
6073 ret = MAX_USER_RT_PRIO-1;
6085 * sys_sched_get_priority_min - return minimum RT priority.
6086 * @policy: scheduling class.
6088 * this syscall returns the minimum rt_priority that can be used
6089 * by a given scheduling class.
6091 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
6109 * sys_sched_rr_get_interval - return the default timeslice of a process.
6110 * @pid: pid of the process.
6111 * @interval: userspace pointer to the timeslice value.
6113 * this syscall writes the default timeslice value of a given process
6114 * into the user-space timespec buffer. A value of '0' means infinity.
6116 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
6117 struct timespec __user *, interval)
6119 struct task_struct *p;
6120 unsigned int time_slice;
6128 read_lock(&tasklist_lock);
6129 p = find_process_by_pid(pid);
6133 retval = security_task_getscheduler(p);
6138 * Time slice is 0 for SCHED_FIFO tasks and for SCHED_OTHER
6139 * tasks that are on an otherwise idle runqueue:
6142 if (p->policy == SCHED_RR) {
6143 time_slice = DEF_TIMESLICE;
6144 } else if (p->policy != SCHED_FIFO) {
6145 struct sched_entity *se = &p->se;
6146 unsigned long flags;
6149 rq = task_rq_lock(p, &flags);
6150 if (rq->cfs.load.weight)
6151 time_slice = NS_TO_JIFFIES(sched_slice(&rq->cfs, se));
6152 task_rq_unlock(rq, &flags);
6154 read_unlock(&tasklist_lock);
6155 jiffies_to_timespec(time_slice, &t);
6156 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
6160 read_unlock(&tasklist_lock);
6164 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
6166 void sched_show_task(struct task_struct *p)
6168 unsigned long free = 0;
6171 state = p->state ? __ffs(p->state) + 1 : 0;
6172 printk(KERN_INFO "%-13.13s %c", p->comm,
6173 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
6174 #if BITS_PER_LONG == 32
6175 if (state == TASK_RUNNING)
6176 printk(KERN_CONT " running ");
6178 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
6180 if (state == TASK_RUNNING)
6181 printk(KERN_CONT " running task ");
6183 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
6185 #ifdef CONFIG_DEBUG_STACK_USAGE
6187 unsigned long *n = end_of_stack(p);
6190 free = (unsigned long)n - (unsigned long)end_of_stack(p);
6193 printk(KERN_CONT "%5lu %5d %6d\n", free,
6194 task_pid_nr(p), task_pid_nr(p->real_parent));
6196 show_stack(p, NULL);
6199 void show_state_filter(unsigned long state_filter)
6201 struct task_struct *g, *p;
6203 #if BITS_PER_LONG == 32
6205 " task PC stack pid father\n");
6208 " task PC stack pid father\n");
6210 read_lock(&tasklist_lock);
6211 do_each_thread(g, p) {
6213 * reset the NMI-timeout, listing all files on a slow
6214 * console might take alot of time:
6216 touch_nmi_watchdog();
6217 if (!state_filter || (p->state & state_filter))
6219 } while_each_thread(g, p);
6221 touch_all_softlockup_watchdogs();
6223 #ifdef CONFIG_SCHED_DEBUG
6224 sysrq_sched_debug_show();
6226 read_unlock(&tasklist_lock);
6228 * Only show locks if all tasks are dumped:
6230 if (state_filter == -1)
6231 debug_show_all_locks();
6234 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
6236 idle->sched_class = &idle_sched_class;
6240 * init_idle - set up an idle thread for a given CPU
6241 * @idle: task in question
6242 * @cpu: cpu the idle task belongs to
6244 * NOTE: this function does not set the idle thread's NEED_RESCHED
6245 * flag, to make booting more robust.
6247 void __cpuinit init_idle(struct task_struct *idle, int cpu)
6249 struct rq *rq = cpu_rq(cpu);
6250 unsigned long flags;
6252 spin_lock_irqsave(&rq->lock, flags);
6255 idle->se.exec_start = sched_clock();
6257 idle->prio = idle->normal_prio = MAX_PRIO;
6258 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
6259 __set_task_cpu(idle, cpu);
6261 rq->curr = rq->idle = idle;
6262 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
6265 spin_unlock_irqrestore(&rq->lock, flags);
6267 /* Set the preempt count _outside_ the spinlocks! */
6268 #if defined(CONFIG_PREEMPT)
6269 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
6271 task_thread_info(idle)->preempt_count = 0;
6274 * The idle tasks have their own, simple scheduling class:
6276 idle->sched_class = &idle_sched_class;
6277 ftrace_graph_init_task(idle);
6281 * In a system that switches off the HZ timer nohz_cpu_mask
6282 * indicates which cpus entered this state. This is used
6283 * in the rcu update to wait only for active cpus. For system
6284 * which do not switch off the HZ timer nohz_cpu_mask should
6285 * always be CPU_BITS_NONE.
6287 cpumask_var_t nohz_cpu_mask;
6290 * Increase the granularity value when there are more CPUs,
6291 * because with more CPUs the 'effective latency' as visible
6292 * to users decreases. But the relationship is not linear,
6293 * so pick a second-best guess by going with the log2 of the
6296 * This idea comes from the SD scheduler of Con Kolivas:
6298 static inline void sched_init_granularity(void)
6300 unsigned int factor = 1 + ilog2(num_online_cpus());
6301 const unsigned long limit = 200000000;
6303 sysctl_sched_min_granularity *= factor;
6304 if (sysctl_sched_min_granularity > limit)
6305 sysctl_sched_min_granularity = limit;
6307 sysctl_sched_latency *= factor;
6308 if (sysctl_sched_latency > limit)
6309 sysctl_sched_latency = limit;
6311 sysctl_sched_wakeup_granularity *= factor;
6313 sysctl_sched_shares_ratelimit *= factor;
6318 * This is how migration works:
6320 * 1) we queue a struct migration_req structure in the source CPU's
6321 * runqueue and wake up that CPU's migration thread.
6322 * 2) we down() the locked semaphore => thread blocks.
6323 * 3) migration thread wakes up (implicitly it forces the migrated
6324 * thread off the CPU)
6325 * 4) it gets the migration request and checks whether the migrated
6326 * task is still in the wrong runqueue.
6327 * 5) if it's in the wrong runqueue then the migration thread removes
6328 * it and puts it into the right queue.
6329 * 6) migration thread up()s the semaphore.
6330 * 7) we wake up and the migration is done.
6334 * Change a given task's CPU affinity. Migrate the thread to a
6335 * proper CPU and schedule it away if the CPU it's executing on
6336 * is removed from the allowed bitmask.
6338 * NOTE: the caller must have a valid reference to the task, the
6339 * task must not exit() & deallocate itself prematurely. The
6340 * call is not atomic; no spinlocks may be held.
6342 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
6344 struct migration_req req;
6345 unsigned long flags;
6349 rq = task_rq_lock(p, &flags);
6350 if (!cpumask_intersects(new_mask, cpu_online_mask)) {
6355 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
6356 !cpumask_equal(&p->cpus_allowed, new_mask))) {
6361 if (p->sched_class->set_cpus_allowed)
6362 p->sched_class->set_cpus_allowed(p, new_mask);
6364 cpumask_copy(&p->cpus_allowed, new_mask);
6365 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
6368 /* Can the task run on the task's current CPU? If so, we're done */
6369 if (cpumask_test_cpu(task_cpu(p), new_mask))
6372 if (migrate_task(p, cpumask_any_and(cpu_online_mask, new_mask), &req)) {
6373 /* Need help from migration thread: drop lock and wait. */
6374 task_rq_unlock(rq, &flags);
6375 wake_up_process(rq->migration_thread);
6376 wait_for_completion(&req.done);
6377 tlb_migrate_finish(p->mm);
6381 task_rq_unlock(rq, &flags);
6385 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
6388 * Move (not current) task off this cpu, onto dest cpu. We're doing
6389 * this because either it can't run here any more (set_cpus_allowed()
6390 * away from this CPU, or CPU going down), or because we're
6391 * attempting to rebalance this task on exec (sched_exec).
6393 * So we race with normal scheduler movements, but that's OK, as long
6394 * as the task is no longer on this CPU.
6396 * Returns non-zero if task was successfully migrated.
6398 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
6400 struct rq *rq_dest, *rq_src;
6403 if (unlikely(!cpu_active(dest_cpu)))
6406 rq_src = cpu_rq(src_cpu);
6407 rq_dest = cpu_rq(dest_cpu);
6409 double_rq_lock(rq_src, rq_dest);
6410 /* Already moved. */
6411 if (task_cpu(p) != src_cpu)
6413 /* Affinity changed (again). */
6414 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
6417 on_rq = p->se.on_rq;
6419 deactivate_task(rq_src, p, 0);
6421 set_task_cpu(p, dest_cpu);
6423 activate_task(rq_dest, p, 0);
6424 check_preempt_curr(rq_dest, p, 0);
6429 double_rq_unlock(rq_src, rq_dest);
6434 * migration_thread - this is a highprio system thread that performs
6435 * thread migration by bumping thread off CPU then 'pushing' onto
6438 static int migration_thread(void *data)
6440 int cpu = (long)data;
6444 BUG_ON(rq->migration_thread != current);
6446 set_current_state(TASK_INTERRUPTIBLE);
6447 while (!kthread_should_stop()) {
6448 struct migration_req *req;
6449 struct list_head *head;
6451 spin_lock_irq(&rq->lock);
6453 if (cpu_is_offline(cpu)) {
6454 spin_unlock_irq(&rq->lock);
6458 if (rq->active_balance) {
6459 active_load_balance(rq, cpu);
6460 rq->active_balance = 0;
6463 head = &rq->migration_queue;
6465 if (list_empty(head)) {
6466 spin_unlock_irq(&rq->lock);
6468 set_current_state(TASK_INTERRUPTIBLE);
6471 req = list_entry(head->next, struct migration_req, list);
6472 list_del_init(head->next);
6474 spin_unlock(&rq->lock);
6475 __migrate_task(req->task, cpu, req->dest_cpu);
6478 complete(&req->done);
6480 __set_current_state(TASK_RUNNING);
6484 /* Wait for kthread_stop */
6485 set_current_state(TASK_INTERRUPTIBLE);
6486 while (!kthread_should_stop()) {
6488 set_current_state(TASK_INTERRUPTIBLE);
6490 __set_current_state(TASK_RUNNING);
6494 #ifdef CONFIG_HOTPLUG_CPU
6496 static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu)
6500 local_irq_disable();
6501 ret = __migrate_task(p, src_cpu, dest_cpu);
6507 * Figure out where task on dead CPU should go, use force if necessary.
6509 static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
6512 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(dead_cpu));
6515 /* Look for allowed, online CPU in same node. */
6516 for_each_cpu_and(dest_cpu, nodemask, cpu_online_mask)
6517 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
6520 /* Any allowed, online CPU? */
6521 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_online_mask);
6522 if (dest_cpu < nr_cpu_ids)
6525 /* No more Mr. Nice Guy. */
6526 if (dest_cpu >= nr_cpu_ids) {
6527 cpuset_cpus_allowed_locked(p, &p->cpus_allowed);
6528 dest_cpu = cpumask_any_and(cpu_online_mask, &p->cpus_allowed);
6531 * Don't tell them about moving exiting tasks or
6532 * kernel threads (both mm NULL), since they never
6535 if (p->mm && printk_ratelimit()) {
6536 printk(KERN_INFO "process %d (%s) no "
6537 "longer affine to cpu%d\n",
6538 task_pid_nr(p), p->comm, dead_cpu);
6543 /* It can have affinity changed while we were choosing. */
6544 if (unlikely(!__migrate_task_irq(p, dead_cpu, dest_cpu)))
6549 * While a dead CPU has no uninterruptible tasks queued at this point,
6550 * it might still have a nonzero ->nr_uninterruptible counter, because
6551 * for performance reasons the counter is not stricly tracking tasks to
6552 * their home CPUs. So we just add the counter to another CPU's counter,
6553 * to keep the global sum constant after CPU-down:
6555 static void migrate_nr_uninterruptible(struct rq *rq_src)
6557 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_online_mask));
6558 unsigned long flags;
6560 local_irq_save(flags);
6561 double_rq_lock(rq_src, rq_dest);
6562 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
6563 rq_src->nr_uninterruptible = 0;
6564 double_rq_unlock(rq_src, rq_dest);
6565 local_irq_restore(flags);
6568 /* Run through task list and migrate tasks from the dead cpu. */
6569 static void migrate_live_tasks(int src_cpu)
6571 struct task_struct *p, *t;
6573 read_lock(&tasklist_lock);
6575 do_each_thread(t, p) {
6579 if (task_cpu(p) == src_cpu)
6580 move_task_off_dead_cpu(src_cpu, p);
6581 } while_each_thread(t, p);
6583 read_unlock(&tasklist_lock);
6587 * Schedules idle task to be the next runnable task on current CPU.
6588 * It does so by boosting its priority to highest possible.
6589 * Used by CPU offline code.
6591 void sched_idle_next(void)
6593 int this_cpu = smp_processor_id();
6594 struct rq *rq = cpu_rq(this_cpu);
6595 struct task_struct *p = rq->idle;
6596 unsigned long flags;
6598 /* cpu has to be offline */
6599 BUG_ON(cpu_online(this_cpu));
6602 * Strictly not necessary since rest of the CPUs are stopped by now
6603 * and interrupts disabled on the current cpu.
6605 spin_lock_irqsave(&rq->lock, flags);
6607 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6609 update_rq_clock(rq);
6610 activate_task(rq, p, 0);
6612 spin_unlock_irqrestore(&rq->lock, flags);
6616 * Ensures that the idle task is using init_mm right before its cpu goes
6619 void idle_task_exit(void)
6621 struct mm_struct *mm = current->active_mm;
6623 BUG_ON(cpu_online(smp_processor_id()));
6626 switch_mm(mm, &init_mm, current);
6630 /* called under rq->lock with disabled interrupts */
6631 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
6633 struct rq *rq = cpu_rq(dead_cpu);
6635 /* Must be exiting, otherwise would be on tasklist. */
6636 BUG_ON(!p->exit_state);
6638 /* Cannot have done final schedule yet: would have vanished. */
6639 BUG_ON(p->state == TASK_DEAD);
6644 * Drop lock around migration; if someone else moves it,
6645 * that's OK. No task can be added to this CPU, so iteration is
6648 spin_unlock_irq(&rq->lock);
6649 move_task_off_dead_cpu(dead_cpu, p);
6650 spin_lock_irq(&rq->lock);
6655 /* release_task() removes task from tasklist, so we won't find dead tasks. */
6656 static void migrate_dead_tasks(unsigned int dead_cpu)
6658 struct rq *rq = cpu_rq(dead_cpu);
6659 struct task_struct *next;
6662 if (!rq->nr_running)
6664 update_rq_clock(rq);
6665 next = pick_next_task(rq);
6668 next->sched_class->put_prev_task(rq, next);
6669 migrate_dead(dead_cpu, next);
6673 #endif /* CONFIG_HOTPLUG_CPU */
6675 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
6677 static struct ctl_table sd_ctl_dir[] = {
6679 .procname = "sched_domain",
6685 static struct ctl_table sd_ctl_root[] = {
6687 .ctl_name = CTL_KERN,
6688 .procname = "kernel",
6690 .child = sd_ctl_dir,
6695 static struct ctl_table *sd_alloc_ctl_entry(int n)
6697 struct ctl_table *entry =
6698 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
6703 static void sd_free_ctl_entry(struct ctl_table **tablep)
6705 struct ctl_table *entry;
6708 * In the intermediate directories, both the child directory and
6709 * procname are dynamically allocated and could fail but the mode
6710 * will always be set. In the lowest directory the names are
6711 * static strings and all have proc handlers.
6713 for (entry = *tablep; entry->mode; entry++) {
6715 sd_free_ctl_entry(&entry->child);
6716 if (entry->proc_handler == NULL)
6717 kfree(entry->procname);
6725 set_table_entry(struct ctl_table *entry,
6726 const char *procname, void *data, int maxlen,
6727 mode_t mode, proc_handler *proc_handler)
6729 entry->procname = procname;
6731 entry->maxlen = maxlen;
6733 entry->proc_handler = proc_handler;
6736 static struct ctl_table *
6737 sd_alloc_ctl_domain_table(struct sched_domain *sd)
6739 struct ctl_table *table = sd_alloc_ctl_entry(13);
6744 set_table_entry(&table[0], "min_interval", &sd->min_interval,
6745 sizeof(long), 0644, proc_doulongvec_minmax);
6746 set_table_entry(&table[1], "max_interval", &sd->max_interval,
6747 sizeof(long), 0644, proc_doulongvec_minmax);
6748 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
6749 sizeof(int), 0644, proc_dointvec_minmax);
6750 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
6751 sizeof(int), 0644, proc_dointvec_minmax);
6752 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
6753 sizeof(int), 0644, proc_dointvec_minmax);
6754 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
6755 sizeof(int), 0644, proc_dointvec_minmax);
6756 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
6757 sizeof(int), 0644, proc_dointvec_minmax);
6758 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
6759 sizeof(int), 0644, proc_dointvec_minmax);
6760 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
6761 sizeof(int), 0644, proc_dointvec_minmax);
6762 set_table_entry(&table[9], "cache_nice_tries",
6763 &sd->cache_nice_tries,
6764 sizeof(int), 0644, proc_dointvec_minmax);
6765 set_table_entry(&table[10], "flags", &sd->flags,
6766 sizeof(int), 0644, proc_dointvec_minmax);
6767 set_table_entry(&table[11], "name", sd->name,
6768 CORENAME_MAX_SIZE, 0444, proc_dostring);
6769 /* &table[12] is terminator */
6774 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
6776 struct ctl_table *entry, *table;
6777 struct sched_domain *sd;
6778 int domain_num = 0, i;
6781 for_each_domain(cpu, sd)
6783 entry = table = sd_alloc_ctl_entry(domain_num + 1);
6788 for_each_domain(cpu, sd) {
6789 snprintf(buf, 32, "domain%d", i);
6790 entry->procname = kstrdup(buf, GFP_KERNEL);
6792 entry->child = sd_alloc_ctl_domain_table(sd);
6799 static struct ctl_table_header *sd_sysctl_header;
6800 static void register_sched_domain_sysctl(void)
6802 int i, cpu_num = num_online_cpus();
6803 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
6806 WARN_ON(sd_ctl_dir[0].child);
6807 sd_ctl_dir[0].child = entry;
6812 for_each_online_cpu(i) {
6813 snprintf(buf, 32, "cpu%d", i);
6814 entry->procname = kstrdup(buf, GFP_KERNEL);
6816 entry->child = sd_alloc_ctl_cpu_table(i);
6820 WARN_ON(sd_sysctl_header);
6821 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
6824 /* may be called multiple times per register */
6825 static void unregister_sched_domain_sysctl(void)
6827 if (sd_sysctl_header)
6828 unregister_sysctl_table(sd_sysctl_header);
6829 sd_sysctl_header = NULL;
6830 if (sd_ctl_dir[0].child)
6831 sd_free_ctl_entry(&sd_ctl_dir[0].child);
6834 static void register_sched_domain_sysctl(void)
6837 static void unregister_sched_domain_sysctl(void)
6842 static void set_rq_online(struct rq *rq)
6845 const struct sched_class *class;
6847 cpumask_set_cpu(rq->cpu, rq->rd->online);
6850 for_each_class(class) {
6851 if (class->rq_online)
6852 class->rq_online(rq);
6857 static void set_rq_offline(struct rq *rq)
6860 const struct sched_class *class;
6862 for_each_class(class) {
6863 if (class->rq_offline)
6864 class->rq_offline(rq);
6867 cpumask_clear_cpu(rq->cpu, rq->rd->online);
6873 * migration_call - callback that gets triggered when a CPU is added.
6874 * Here we can start up the necessary migration thread for the new CPU.
6876 static int __cpuinit
6877 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
6879 struct task_struct *p;
6880 int cpu = (long)hcpu;
6881 unsigned long flags;
6886 case CPU_UP_PREPARE:
6887 case CPU_UP_PREPARE_FROZEN:
6888 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
6891 kthread_bind(p, cpu);
6892 /* Must be high prio: stop_machine expects to yield to it. */
6893 rq = task_rq_lock(p, &flags);
6894 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
6895 task_rq_unlock(rq, &flags);
6896 cpu_rq(cpu)->migration_thread = p;
6900 case CPU_ONLINE_FROZEN:
6901 /* Strictly unnecessary, as first user will wake it. */
6902 wake_up_process(cpu_rq(cpu)->migration_thread);
6904 /* Update our root-domain */
6906 spin_lock_irqsave(&rq->lock, flags);
6908 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
6912 spin_unlock_irqrestore(&rq->lock, flags);
6915 #ifdef CONFIG_HOTPLUG_CPU
6916 case CPU_UP_CANCELED:
6917 case CPU_UP_CANCELED_FROZEN:
6918 if (!cpu_rq(cpu)->migration_thread)
6920 /* Unbind it from offline cpu so it can run. Fall thru. */
6921 kthread_bind(cpu_rq(cpu)->migration_thread,
6922 cpumask_any(cpu_online_mask));
6923 kthread_stop(cpu_rq(cpu)->migration_thread);
6924 cpu_rq(cpu)->migration_thread = NULL;
6928 case CPU_DEAD_FROZEN:
6929 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
6930 migrate_live_tasks(cpu);
6932 kthread_stop(rq->migration_thread);
6933 rq->migration_thread = NULL;
6934 /* Idle task back to normal (off runqueue, low prio) */
6935 spin_lock_irq(&rq->lock);
6936 update_rq_clock(rq);
6937 deactivate_task(rq, rq->idle, 0);
6938 rq->idle->static_prio = MAX_PRIO;
6939 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
6940 rq->idle->sched_class = &idle_sched_class;
6941 migrate_dead_tasks(cpu);
6942 spin_unlock_irq(&rq->lock);
6944 migrate_nr_uninterruptible(rq);
6945 BUG_ON(rq->nr_running != 0);
6948 * No need to migrate the tasks: it was best-effort if
6949 * they didn't take sched_hotcpu_mutex. Just wake up
6952 spin_lock_irq(&rq->lock);
6953 while (!list_empty(&rq->migration_queue)) {
6954 struct migration_req *req;
6956 req = list_entry(rq->migration_queue.next,
6957 struct migration_req, list);
6958 list_del_init(&req->list);
6959 spin_unlock_irq(&rq->lock);
6960 complete(&req->done);
6961 spin_lock_irq(&rq->lock);
6963 spin_unlock_irq(&rq->lock);
6967 case CPU_DYING_FROZEN:
6968 /* Update our root-domain */
6970 spin_lock_irqsave(&rq->lock, flags);
6972 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
6975 spin_unlock_irqrestore(&rq->lock, flags);
6982 /* Register at highest priority so that task migration (migrate_all_tasks)
6983 * happens before everything else.
6985 static struct notifier_block __cpuinitdata migration_notifier = {
6986 .notifier_call = migration_call,
6990 static int __init migration_init(void)
6992 void *cpu = (void *)(long)smp_processor_id();
6995 /* Start one for the boot CPU: */
6996 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
6997 BUG_ON(err == NOTIFY_BAD);
6998 migration_call(&migration_notifier, CPU_ONLINE, cpu);
6999 register_cpu_notifier(&migration_notifier);
7003 early_initcall(migration_init);
7008 #ifdef CONFIG_SCHED_DEBUG
7010 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
7011 struct cpumask *groupmask)
7013 struct sched_group *group = sd->groups;
7016 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
7017 cpumask_clear(groupmask);
7019 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
7021 if (!(sd->flags & SD_LOAD_BALANCE)) {
7022 printk("does not load-balance\n");
7024 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
7029 printk(KERN_CONT "span %s level %s\n", str, sd->name);
7031 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
7032 printk(KERN_ERR "ERROR: domain->span does not contain "
7035 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
7036 printk(KERN_ERR "ERROR: domain->groups does not contain"
7040 printk(KERN_DEBUG "%*s groups:", level + 1, "");
7044 printk(KERN_ERR "ERROR: group is NULL\n");
7048 if (!group->__cpu_power) {
7049 printk(KERN_CONT "\n");
7050 printk(KERN_ERR "ERROR: domain->cpu_power not "
7055 if (!cpumask_weight(sched_group_cpus(group))) {
7056 printk(KERN_CONT "\n");
7057 printk(KERN_ERR "ERROR: empty group\n");
7061 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
7062 printk(KERN_CONT "\n");
7063 printk(KERN_ERR "ERROR: repeated CPUs\n");
7067 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
7069 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
7070 printk(KERN_CONT " %s", str);
7072 group = group->next;
7073 } while (group != sd->groups);
7074 printk(KERN_CONT "\n");
7076 if (!cpumask_equal(sched_domain_span(sd), groupmask))
7077 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
7080 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
7081 printk(KERN_ERR "ERROR: parent span is not a superset "
7082 "of domain->span\n");
7086 static void sched_domain_debug(struct sched_domain *sd, int cpu)
7088 cpumask_var_t groupmask;
7092 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
7096 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
7098 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
7099 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
7104 if (sched_domain_debug_one(sd, cpu, level, groupmask))
7111 free_cpumask_var(groupmask);
7113 #else /* !CONFIG_SCHED_DEBUG */
7114 # define sched_domain_debug(sd, cpu) do { } while (0)
7115 #endif /* CONFIG_SCHED_DEBUG */
7117 static int sd_degenerate(struct sched_domain *sd)
7119 if (cpumask_weight(sched_domain_span(sd)) == 1)
7122 /* Following flags need at least 2 groups */
7123 if (sd->flags & (SD_LOAD_BALANCE |
7124 SD_BALANCE_NEWIDLE |
7128 SD_SHARE_PKG_RESOURCES)) {
7129 if (sd->groups != sd->groups->next)
7133 /* Following flags don't use groups */
7134 if (sd->flags & (SD_WAKE_IDLE |
7143 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
7145 unsigned long cflags = sd->flags, pflags = parent->flags;
7147 if (sd_degenerate(parent))
7150 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
7153 /* Does parent contain flags not in child? */
7154 /* WAKE_BALANCE is a subset of WAKE_AFFINE */
7155 if (cflags & SD_WAKE_AFFINE)
7156 pflags &= ~SD_WAKE_BALANCE;
7157 /* Flags needing groups don't count if only 1 group in parent */
7158 if (parent->groups == parent->groups->next) {
7159 pflags &= ~(SD_LOAD_BALANCE |
7160 SD_BALANCE_NEWIDLE |
7164 SD_SHARE_PKG_RESOURCES);
7165 if (nr_node_ids == 1)
7166 pflags &= ~SD_SERIALIZE;
7168 if (~cflags & pflags)
7174 static void free_rootdomain(struct root_domain *rd)
7176 cpupri_cleanup(&rd->cpupri);
7178 free_cpumask_var(rd->rto_mask);
7179 free_cpumask_var(rd->online);
7180 free_cpumask_var(rd->span);
7184 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
7186 struct root_domain *old_rd = NULL;
7187 unsigned long flags;
7189 spin_lock_irqsave(&rq->lock, flags);
7194 if (cpumask_test_cpu(rq->cpu, old_rd->online))
7197 cpumask_clear_cpu(rq->cpu, old_rd->span);
7200 * If we dont want to free the old_rt yet then
7201 * set old_rd to NULL to skip the freeing later
7204 if (!atomic_dec_and_test(&old_rd->refcount))
7208 atomic_inc(&rd->refcount);
7211 cpumask_set_cpu(rq->cpu, rd->span);
7212 if (cpumask_test_cpu(rq->cpu, cpu_online_mask))
7215 spin_unlock_irqrestore(&rq->lock, flags);
7218 free_rootdomain(old_rd);
7221 static int __init_refok init_rootdomain(struct root_domain *rd, bool bootmem)
7223 memset(rd, 0, sizeof(*rd));
7226 alloc_bootmem_cpumask_var(&def_root_domain.span);
7227 alloc_bootmem_cpumask_var(&def_root_domain.online);
7228 alloc_bootmem_cpumask_var(&def_root_domain.rto_mask);
7229 cpupri_init(&rd->cpupri, true);
7233 if (!alloc_cpumask_var(&rd->span, GFP_KERNEL))
7235 if (!alloc_cpumask_var(&rd->online, GFP_KERNEL))
7237 if (!alloc_cpumask_var(&rd->rto_mask, GFP_KERNEL))
7240 if (cpupri_init(&rd->cpupri, false) != 0)
7245 free_cpumask_var(rd->rto_mask);
7247 free_cpumask_var(rd->online);
7249 free_cpumask_var(rd->span);
7254 static void init_defrootdomain(void)
7256 init_rootdomain(&def_root_domain, true);
7258 atomic_set(&def_root_domain.refcount, 1);
7261 static struct root_domain *alloc_rootdomain(void)
7263 struct root_domain *rd;
7265 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
7269 if (init_rootdomain(rd, false) != 0) {
7278 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
7279 * hold the hotplug lock.
7282 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
7284 struct rq *rq = cpu_rq(cpu);
7285 struct sched_domain *tmp;
7287 /* Remove the sched domains which do not contribute to scheduling. */
7288 for (tmp = sd; tmp; ) {
7289 struct sched_domain *parent = tmp->parent;
7293 if (sd_parent_degenerate(tmp, parent)) {
7294 tmp->parent = parent->parent;
7296 parent->parent->child = tmp;
7301 if (sd && sd_degenerate(sd)) {
7307 sched_domain_debug(sd, cpu);
7309 rq_attach_root(rq, rd);
7310 rcu_assign_pointer(rq->sd, sd);
7313 /* cpus with isolated domains */
7314 static cpumask_var_t cpu_isolated_map;
7316 /* Setup the mask of cpus configured for isolated domains */
7317 static int __init isolated_cpu_setup(char *str)
7319 cpulist_parse(str, cpu_isolated_map);
7323 __setup("isolcpus=", isolated_cpu_setup);
7326 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
7327 * to a function which identifies what group(along with sched group) a CPU
7328 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
7329 * (due to the fact that we keep track of groups covered with a struct cpumask).
7331 * init_sched_build_groups will build a circular linked list of the groups
7332 * covered by the given span, and will set each group's ->cpumask correctly,
7333 * and ->cpu_power to 0.
7336 init_sched_build_groups(const struct cpumask *span,
7337 const struct cpumask *cpu_map,
7338 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
7339 struct sched_group **sg,
7340 struct cpumask *tmpmask),
7341 struct cpumask *covered, struct cpumask *tmpmask)
7343 struct sched_group *first = NULL, *last = NULL;
7346 cpumask_clear(covered);
7348 for_each_cpu(i, span) {
7349 struct sched_group *sg;
7350 int group = group_fn(i, cpu_map, &sg, tmpmask);
7353 if (cpumask_test_cpu(i, covered))
7356 cpumask_clear(sched_group_cpus(sg));
7357 sg->__cpu_power = 0;
7359 for_each_cpu(j, span) {
7360 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
7363 cpumask_set_cpu(j, covered);
7364 cpumask_set_cpu(j, sched_group_cpus(sg));
7375 #define SD_NODES_PER_DOMAIN 16
7380 * find_next_best_node - find the next node to include in a sched_domain
7381 * @node: node whose sched_domain we're building
7382 * @used_nodes: nodes already in the sched_domain
7384 * Find the next node to include in a given scheduling domain. Simply
7385 * finds the closest node not already in the @used_nodes map.
7387 * Should use nodemask_t.
7389 static int find_next_best_node(int node, nodemask_t *used_nodes)
7391 int i, n, val, min_val, best_node = 0;
7395 for (i = 0; i < nr_node_ids; i++) {
7396 /* Start at @node */
7397 n = (node + i) % nr_node_ids;
7399 if (!nr_cpus_node(n))
7402 /* Skip already used nodes */
7403 if (node_isset(n, *used_nodes))
7406 /* Simple min distance search */
7407 val = node_distance(node, n);
7409 if (val < min_val) {
7415 node_set(best_node, *used_nodes);
7420 * sched_domain_node_span - get a cpumask for a node's sched_domain
7421 * @node: node whose cpumask we're constructing
7422 * @span: resulting cpumask
7424 * Given a node, construct a good cpumask for its sched_domain to span. It
7425 * should be one that prevents unnecessary balancing, but also spreads tasks
7428 static void sched_domain_node_span(int node, struct cpumask *span)
7430 nodemask_t used_nodes;
7433 cpumask_clear(span);
7434 nodes_clear(used_nodes);
7436 cpumask_or(span, span, cpumask_of_node(node));
7437 node_set(node, used_nodes);
7439 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
7440 int next_node = find_next_best_node(node, &used_nodes);
7442 cpumask_or(span, span, cpumask_of_node(next_node));
7445 #endif /* CONFIG_NUMA */
7447 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
7450 * The cpus mask in sched_group and sched_domain hangs off the end.
7451 * FIXME: use cpumask_var_t or dynamic percpu alloc to avoid wasting space
7452 * for nr_cpu_ids < CONFIG_NR_CPUS.
7454 struct static_sched_group {
7455 struct sched_group sg;
7456 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
7459 struct static_sched_domain {
7460 struct sched_domain sd;
7461 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
7465 * SMT sched-domains:
7467 #ifdef CONFIG_SCHED_SMT
7468 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
7469 static DEFINE_PER_CPU(struct static_sched_group, sched_group_cpus);
7472 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
7473 struct sched_group **sg, struct cpumask *unused)
7476 *sg = &per_cpu(sched_group_cpus, cpu).sg;
7479 #endif /* CONFIG_SCHED_SMT */
7482 * multi-core sched-domains:
7484 #ifdef CONFIG_SCHED_MC
7485 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
7486 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
7487 #endif /* CONFIG_SCHED_MC */
7489 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
7491 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
7492 struct sched_group **sg, struct cpumask *mask)
7496 cpumask_and(mask, &per_cpu(cpu_sibling_map, cpu), cpu_map);
7497 group = cpumask_first(mask);
7499 *sg = &per_cpu(sched_group_core, group).sg;
7502 #elif defined(CONFIG_SCHED_MC)
7504 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
7505 struct sched_group **sg, struct cpumask *unused)
7508 *sg = &per_cpu(sched_group_core, cpu).sg;
7513 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
7514 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
7517 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
7518 struct sched_group **sg, struct cpumask *mask)
7521 #ifdef CONFIG_SCHED_MC
7522 cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map);
7523 group = cpumask_first(mask);
7524 #elif defined(CONFIG_SCHED_SMT)
7525 cpumask_and(mask, &per_cpu(cpu_sibling_map, cpu), cpu_map);
7526 group = cpumask_first(mask);
7531 *sg = &per_cpu(sched_group_phys, group).sg;
7537 * The init_sched_build_groups can't handle what we want to do with node
7538 * groups, so roll our own. Now each node has its own list of groups which
7539 * gets dynamically allocated.
7541 static DEFINE_PER_CPU(struct static_sched_domain, node_domains);
7542 static struct sched_group ***sched_group_nodes_bycpu;
7544 static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains);
7545 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
7547 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
7548 struct sched_group **sg,
7549 struct cpumask *nodemask)
7553 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map);
7554 group = cpumask_first(nodemask);
7557 *sg = &per_cpu(sched_group_allnodes, group).sg;
7561 static void init_numa_sched_groups_power(struct sched_group *group_head)
7563 struct sched_group *sg = group_head;
7569 for_each_cpu(j, sched_group_cpus(sg)) {
7570 struct sched_domain *sd;
7572 sd = &per_cpu(phys_domains, j).sd;
7573 if (j != cpumask_first(sched_group_cpus(sd->groups))) {
7575 * Only add "power" once for each
7581 sg_inc_cpu_power(sg, sd->groups->__cpu_power);
7584 } while (sg != group_head);
7586 #endif /* CONFIG_NUMA */
7589 /* Free memory allocated for various sched_group structures */
7590 static void free_sched_groups(const struct cpumask *cpu_map,
7591 struct cpumask *nodemask)
7595 for_each_cpu(cpu, cpu_map) {
7596 struct sched_group **sched_group_nodes
7597 = sched_group_nodes_bycpu[cpu];
7599 if (!sched_group_nodes)
7602 for (i = 0; i < nr_node_ids; i++) {
7603 struct sched_group *oldsg, *sg = sched_group_nodes[i];
7605 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
7606 if (cpumask_empty(nodemask))
7616 if (oldsg != sched_group_nodes[i])
7619 kfree(sched_group_nodes);
7620 sched_group_nodes_bycpu[cpu] = NULL;
7623 #else /* !CONFIG_NUMA */
7624 static void free_sched_groups(const struct cpumask *cpu_map,
7625 struct cpumask *nodemask)
7628 #endif /* CONFIG_NUMA */
7631 * Initialize sched groups cpu_power.
7633 * cpu_power indicates the capacity of sched group, which is used while
7634 * distributing the load between different sched groups in a sched domain.
7635 * Typically cpu_power for all the groups in a sched domain will be same unless
7636 * there are asymmetries in the topology. If there are asymmetries, group
7637 * having more cpu_power will pickup more load compared to the group having
7640 * cpu_power will be a multiple of SCHED_LOAD_SCALE. This multiple represents
7641 * the maximum number of tasks a group can handle in the presence of other idle
7642 * or lightly loaded groups in the same sched domain.
7644 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
7646 struct sched_domain *child;
7647 struct sched_group *group;
7649 WARN_ON(!sd || !sd->groups);
7651 if (cpu != cpumask_first(sched_group_cpus(sd->groups)))
7656 sd->groups->__cpu_power = 0;
7659 * For perf policy, if the groups in child domain share resources
7660 * (for example cores sharing some portions of the cache hierarchy
7661 * or SMT), then set this domain groups cpu_power such that each group
7662 * can handle only one task, when there are other idle groups in the
7663 * same sched domain.
7665 if (!child || (!(sd->flags & SD_POWERSAVINGS_BALANCE) &&
7667 (SD_SHARE_CPUPOWER | SD_SHARE_PKG_RESOURCES)))) {
7668 sg_inc_cpu_power(sd->groups, SCHED_LOAD_SCALE);
7673 * add cpu_power of each child group to this groups cpu_power
7675 group = child->groups;
7677 sg_inc_cpu_power(sd->groups, group->__cpu_power);
7678 group = group->next;
7679 } while (group != child->groups);
7683 * Initializers for schedule domains
7684 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
7687 #ifdef CONFIG_SCHED_DEBUG
7688 # define SD_INIT_NAME(sd, type) sd->name = #type
7690 # define SD_INIT_NAME(sd, type) do { } while (0)
7693 #define SD_INIT(sd, type) sd_init_##type(sd)
7695 #define SD_INIT_FUNC(type) \
7696 static noinline void sd_init_##type(struct sched_domain *sd) \
7698 memset(sd, 0, sizeof(*sd)); \
7699 *sd = SD_##type##_INIT; \
7700 sd->level = SD_LV_##type; \
7701 SD_INIT_NAME(sd, type); \
7706 SD_INIT_FUNC(ALLNODES)
7709 #ifdef CONFIG_SCHED_SMT
7710 SD_INIT_FUNC(SIBLING)
7712 #ifdef CONFIG_SCHED_MC
7716 static int default_relax_domain_level = -1;
7718 static int __init setup_relax_domain_level(char *str)
7722 val = simple_strtoul(str, NULL, 0);
7723 if (val < SD_LV_MAX)
7724 default_relax_domain_level = val;
7728 __setup("relax_domain_level=", setup_relax_domain_level);
7730 static void set_domain_attribute(struct sched_domain *sd,
7731 struct sched_domain_attr *attr)
7735 if (!attr || attr->relax_domain_level < 0) {
7736 if (default_relax_domain_level < 0)
7739 request = default_relax_domain_level;
7741 request = attr->relax_domain_level;
7742 if (request < sd->level) {
7743 /* turn off idle balance on this domain */
7744 sd->flags &= ~(SD_WAKE_IDLE|SD_BALANCE_NEWIDLE);
7746 /* turn on idle balance on this domain */
7747 sd->flags |= (SD_WAKE_IDLE_FAR|SD_BALANCE_NEWIDLE);
7752 * Build sched domains for a given set of cpus and attach the sched domains
7753 * to the individual cpus
7755 static int __build_sched_domains(const struct cpumask *cpu_map,
7756 struct sched_domain_attr *attr)
7758 int i, err = -ENOMEM;
7759 struct root_domain *rd;
7760 cpumask_var_t nodemask, this_sibling_map, this_core_map, send_covered,
7763 cpumask_var_t domainspan, covered, notcovered;
7764 struct sched_group **sched_group_nodes = NULL;
7765 int sd_allnodes = 0;
7767 if (!alloc_cpumask_var(&domainspan, GFP_KERNEL))
7769 if (!alloc_cpumask_var(&covered, GFP_KERNEL))
7770 goto free_domainspan;
7771 if (!alloc_cpumask_var(¬covered, GFP_KERNEL))
7775 if (!alloc_cpumask_var(&nodemask, GFP_KERNEL))
7776 goto free_notcovered;
7777 if (!alloc_cpumask_var(&this_sibling_map, GFP_KERNEL))
7779 if (!alloc_cpumask_var(&this_core_map, GFP_KERNEL))
7780 goto free_this_sibling_map;
7781 if (!alloc_cpumask_var(&send_covered, GFP_KERNEL))
7782 goto free_this_core_map;
7783 if (!alloc_cpumask_var(&tmpmask, GFP_KERNEL))
7784 goto free_send_covered;
7788 * Allocate the per-node list of sched groups
7790 sched_group_nodes = kcalloc(nr_node_ids, sizeof(struct sched_group *),
7792 if (!sched_group_nodes) {
7793 printk(KERN_WARNING "Can not alloc sched group node list\n");
7798 rd = alloc_rootdomain();
7800 printk(KERN_WARNING "Cannot alloc root domain\n");
7801 goto free_sched_groups;
7805 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = sched_group_nodes;
7809 * Set up domains for cpus specified by the cpu_map.
7811 for_each_cpu(i, cpu_map) {
7812 struct sched_domain *sd = NULL, *p;
7814 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(i)), cpu_map);
7817 if (cpumask_weight(cpu_map) >
7818 SD_NODES_PER_DOMAIN*cpumask_weight(nodemask)) {
7819 sd = &per_cpu(allnodes_domains, i).sd;
7820 SD_INIT(sd, ALLNODES);
7821 set_domain_attribute(sd, attr);
7822 cpumask_copy(sched_domain_span(sd), cpu_map);
7823 cpu_to_allnodes_group(i, cpu_map, &sd->groups, tmpmask);
7829 sd = &per_cpu(node_domains, i).sd;
7831 set_domain_attribute(sd, attr);
7832 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
7836 cpumask_and(sched_domain_span(sd),
7837 sched_domain_span(sd), cpu_map);
7841 sd = &per_cpu(phys_domains, i).sd;
7843 set_domain_attribute(sd, attr);
7844 cpumask_copy(sched_domain_span(sd), nodemask);
7848 cpu_to_phys_group(i, cpu_map, &sd->groups, tmpmask);
7850 #ifdef CONFIG_SCHED_MC
7852 sd = &per_cpu(core_domains, i).sd;
7854 set_domain_attribute(sd, attr);
7855 cpumask_and(sched_domain_span(sd), cpu_map,
7856 cpu_coregroup_mask(i));
7859 cpu_to_core_group(i, cpu_map, &sd->groups, tmpmask);
7862 #ifdef CONFIG_SCHED_SMT
7864 sd = &per_cpu(cpu_domains, i).sd;
7865 SD_INIT(sd, SIBLING);
7866 set_domain_attribute(sd, attr);
7867 cpumask_and(sched_domain_span(sd),
7868 &per_cpu(cpu_sibling_map, i), cpu_map);
7871 cpu_to_cpu_group(i, cpu_map, &sd->groups, tmpmask);
7875 #ifdef CONFIG_SCHED_SMT
7876 /* Set up CPU (sibling) groups */
7877 for_each_cpu(i, cpu_map) {
7878 cpumask_and(this_sibling_map,
7879 &per_cpu(cpu_sibling_map, i), cpu_map);
7880 if (i != cpumask_first(this_sibling_map))
7883 init_sched_build_groups(this_sibling_map, cpu_map,
7885 send_covered, tmpmask);
7889 #ifdef CONFIG_SCHED_MC
7890 /* Set up multi-core groups */
7891 for_each_cpu(i, cpu_map) {
7892 cpumask_and(this_core_map, cpu_coregroup_mask(i), cpu_map);
7893 if (i != cpumask_first(this_core_map))
7896 init_sched_build_groups(this_core_map, cpu_map,
7898 send_covered, tmpmask);
7902 /* Set up physical groups */
7903 for (i = 0; i < nr_node_ids; i++) {
7904 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
7905 if (cpumask_empty(nodemask))
7908 init_sched_build_groups(nodemask, cpu_map,
7910 send_covered, tmpmask);
7914 /* Set up node groups */
7916 init_sched_build_groups(cpu_map, cpu_map,
7917 &cpu_to_allnodes_group,
7918 send_covered, tmpmask);
7921 for (i = 0; i < nr_node_ids; i++) {
7922 /* Set up node groups */
7923 struct sched_group *sg, *prev;
7926 cpumask_clear(covered);
7927 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
7928 if (cpumask_empty(nodemask)) {
7929 sched_group_nodes[i] = NULL;
7933 sched_domain_node_span(i, domainspan);
7934 cpumask_and(domainspan, domainspan, cpu_map);
7936 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
7939 printk(KERN_WARNING "Can not alloc domain group for "
7943 sched_group_nodes[i] = sg;
7944 for_each_cpu(j, nodemask) {
7945 struct sched_domain *sd;
7947 sd = &per_cpu(node_domains, j).sd;
7950 sg->__cpu_power = 0;
7951 cpumask_copy(sched_group_cpus(sg), nodemask);
7953 cpumask_or(covered, covered, nodemask);
7956 for (j = 0; j < nr_node_ids; j++) {
7957 int n = (i + j) % nr_node_ids;
7959 cpumask_complement(notcovered, covered);
7960 cpumask_and(tmpmask, notcovered, cpu_map);
7961 cpumask_and(tmpmask, tmpmask, domainspan);
7962 if (cpumask_empty(tmpmask))
7965 cpumask_and(tmpmask, tmpmask, cpumask_of_node(n));
7966 if (cpumask_empty(tmpmask))
7969 sg = kmalloc_node(sizeof(struct sched_group) +
7974 "Can not alloc domain group for node %d\n", j);
7977 sg->__cpu_power = 0;
7978 cpumask_copy(sched_group_cpus(sg), tmpmask);
7979 sg->next = prev->next;
7980 cpumask_or(covered, covered, tmpmask);
7987 /* Calculate CPU power for physical packages and nodes */
7988 #ifdef CONFIG_SCHED_SMT
7989 for_each_cpu(i, cpu_map) {
7990 struct sched_domain *sd = &per_cpu(cpu_domains, i).sd;
7992 init_sched_groups_power(i, sd);
7995 #ifdef CONFIG_SCHED_MC
7996 for_each_cpu(i, cpu_map) {
7997 struct sched_domain *sd = &per_cpu(core_domains, i).sd;
7999 init_sched_groups_power(i, sd);
8003 for_each_cpu(i, cpu_map) {
8004 struct sched_domain *sd = &per_cpu(phys_domains, i).sd;
8006 init_sched_groups_power(i, sd);
8010 for (i = 0; i < nr_node_ids; i++)
8011 init_numa_sched_groups_power(sched_group_nodes[i]);
8014 struct sched_group *sg;
8016 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
8018 init_numa_sched_groups_power(sg);
8022 /* Attach the domains */
8023 for_each_cpu(i, cpu_map) {
8024 struct sched_domain *sd;
8025 #ifdef CONFIG_SCHED_SMT
8026 sd = &per_cpu(cpu_domains, i).sd;
8027 #elif defined(CONFIG_SCHED_MC)
8028 sd = &per_cpu(core_domains, i).sd;
8030 sd = &per_cpu(phys_domains, i).sd;
8032 cpu_attach_domain(sd, rd, i);
8038 free_cpumask_var(tmpmask);
8040 free_cpumask_var(send_covered);
8042 free_cpumask_var(this_core_map);
8043 free_this_sibling_map:
8044 free_cpumask_var(this_sibling_map);
8046 free_cpumask_var(nodemask);
8049 free_cpumask_var(notcovered);
8051 free_cpumask_var(covered);
8053 free_cpumask_var(domainspan);
8060 kfree(sched_group_nodes);
8066 free_sched_groups(cpu_map, tmpmask);
8067 free_rootdomain(rd);
8072 static int build_sched_domains(const struct cpumask *cpu_map)
8074 return __build_sched_domains(cpu_map, NULL);
8077 static struct cpumask *doms_cur; /* current sched domains */
8078 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
8079 static struct sched_domain_attr *dattr_cur;
8080 /* attribues of custom domains in 'doms_cur' */
8083 * Special case: If a kmalloc of a doms_cur partition (array of
8084 * cpumask) fails, then fallback to a single sched domain,
8085 * as determined by the single cpumask fallback_doms.
8087 static cpumask_var_t fallback_doms;
8090 * arch_update_cpu_topology lets virtualized architectures update the
8091 * cpu core maps. It is supposed to return 1 if the topology changed
8092 * or 0 if it stayed the same.
8094 int __attribute__((weak)) arch_update_cpu_topology(void)
8100 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
8101 * For now this just excludes isolated cpus, but could be used to
8102 * exclude other special cases in the future.
8104 static int arch_init_sched_domains(const struct cpumask *cpu_map)
8108 arch_update_cpu_topology();
8110 doms_cur = kmalloc(cpumask_size(), GFP_KERNEL);
8112 doms_cur = fallback_doms;
8113 cpumask_andnot(doms_cur, cpu_map, cpu_isolated_map);
8115 err = build_sched_domains(doms_cur);
8116 register_sched_domain_sysctl();
8121 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
8122 struct cpumask *tmpmask)
8124 free_sched_groups(cpu_map, tmpmask);
8128 * Detach sched domains from a group of cpus specified in cpu_map
8129 * These cpus will now be attached to the NULL domain
8131 static void detach_destroy_domains(const struct cpumask *cpu_map)
8133 /* Save because hotplug lock held. */
8134 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
8137 for_each_cpu(i, cpu_map)
8138 cpu_attach_domain(NULL, &def_root_domain, i);
8139 synchronize_sched();
8140 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
8143 /* handle null as "default" */
8144 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
8145 struct sched_domain_attr *new, int idx_new)
8147 struct sched_domain_attr tmp;
8154 return !memcmp(cur ? (cur + idx_cur) : &tmp,
8155 new ? (new + idx_new) : &tmp,
8156 sizeof(struct sched_domain_attr));
8160 * Partition sched domains as specified by the 'ndoms_new'
8161 * cpumasks in the array doms_new[] of cpumasks. This compares
8162 * doms_new[] to the current sched domain partitioning, doms_cur[].
8163 * It destroys each deleted domain and builds each new domain.
8165 * 'doms_new' is an array of cpumask's of length 'ndoms_new'.
8166 * The masks don't intersect (don't overlap.) We should setup one
8167 * sched domain for each mask. CPUs not in any of the cpumasks will
8168 * not be load balanced. If the same cpumask appears both in the
8169 * current 'doms_cur' domains and in the new 'doms_new', we can leave
8172 * The passed in 'doms_new' should be kmalloc'd. This routine takes
8173 * ownership of it and will kfree it when done with it. If the caller
8174 * failed the kmalloc call, then it can pass in doms_new == NULL &&
8175 * ndoms_new == 1, and partition_sched_domains() will fallback to
8176 * the single partition 'fallback_doms', it also forces the domains
8179 * If doms_new == NULL it will be replaced with cpu_online_mask.
8180 * ndoms_new == 0 is a special case for destroying existing domains,
8181 * and it will not create the default domain.
8183 * Call with hotplug lock held
8185 /* FIXME: Change to struct cpumask *doms_new[] */
8186 void partition_sched_domains(int ndoms_new, struct cpumask *doms_new,
8187 struct sched_domain_attr *dattr_new)
8192 mutex_lock(&sched_domains_mutex);
8194 /* always unregister in case we don't destroy any domains */
8195 unregister_sched_domain_sysctl();
8197 /* Let architecture update cpu core mappings. */
8198 new_topology = arch_update_cpu_topology();
8200 n = doms_new ? ndoms_new : 0;
8202 /* Destroy deleted domains */
8203 for (i = 0; i < ndoms_cur; i++) {
8204 for (j = 0; j < n && !new_topology; j++) {
8205 if (cpumask_equal(&doms_cur[i], &doms_new[j])
8206 && dattrs_equal(dattr_cur, i, dattr_new, j))
8209 /* no match - a current sched domain not in new doms_new[] */
8210 detach_destroy_domains(doms_cur + i);
8215 if (doms_new == NULL) {
8217 doms_new = fallback_doms;
8218 cpumask_andnot(&doms_new[0], cpu_online_mask, cpu_isolated_map);
8219 WARN_ON_ONCE(dattr_new);
8222 /* Build new domains */
8223 for (i = 0; i < ndoms_new; i++) {
8224 for (j = 0; j < ndoms_cur && !new_topology; j++) {
8225 if (cpumask_equal(&doms_new[i], &doms_cur[j])
8226 && dattrs_equal(dattr_new, i, dattr_cur, j))
8229 /* no match - add a new doms_new */
8230 __build_sched_domains(doms_new + i,
8231 dattr_new ? dattr_new + i : NULL);
8236 /* Remember the new sched domains */
8237 if (doms_cur != fallback_doms)
8239 kfree(dattr_cur); /* kfree(NULL) is safe */
8240 doms_cur = doms_new;
8241 dattr_cur = dattr_new;
8242 ndoms_cur = ndoms_new;
8244 register_sched_domain_sysctl();
8246 mutex_unlock(&sched_domains_mutex);
8249 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
8250 static void arch_reinit_sched_domains(void)
8254 /* Destroy domains first to force the rebuild */
8255 partition_sched_domains(0, NULL, NULL);
8257 rebuild_sched_domains();
8261 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
8263 unsigned int level = 0;
8265 if (sscanf(buf, "%u", &level) != 1)
8269 * level is always be positive so don't check for
8270 * level < POWERSAVINGS_BALANCE_NONE which is 0
8271 * What happens on 0 or 1 byte write,
8272 * need to check for count as well?
8275 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
8279 sched_smt_power_savings = level;
8281 sched_mc_power_savings = level;
8283 arch_reinit_sched_domains();
8288 #ifdef CONFIG_SCHED_MC
8289 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
8292 return sprintf(page, "%u\n", sched_mc_power_savings);
8294 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
8295 const char *buf, size_t count)
8297 return sched_power_savings_store(buf, count, 0);
8299 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
8300 sched_mc_power_savings_show,
8301 sched_mc_power_savings_store);
8304 #ifdef CONFIG_SCHED_SMT
8305 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
8308 return sprintf(page, "%u\n", sched_smt_power_savings);
8310 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
8311 const char *buf, size_t count)
8313 return sched_power_savings_store(buf, count, 1);
8315 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
8316 sched_smt_power_savings_show,
8317 sched_smt_power_savings_store);
8320 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
8324 #ifdef CONFIG_SCHED_SMT
8326 err = sysfs_create_file(&cls->kset.kobj,
8327 &attr_sched_smt_power_savings.attr);
8329 #ifdef CONFIG_SCHED_MC
8330 if (!err && mc_capable())
8331 err = sysfs_create_file(&cls->kset.kobj,
8332 &attr_sched_mc_power_savings.attr);
8336 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
8338 #ifndef CONFIG_CPUSETS
8340 * Add online and remove offline CPUs from the scheduler domains.
8341 * When cpusets are enabled they take over this function.
8343 static int update_sched_domains(struct notifier_block *nfb,
8344 unsigned long action, void *hcpu)
8348 case CPU_ONLINE_FROZEN:
8350 case CPU_DEAD_FROZEN:
8351 partition_sched_domains(1, NULL, NULL);
8360 static int update_runtime(struct notifier_block *nfb,
8361 unsigned long action, void *hcpu)
8363 int cpu = (int)(long)hcpu;
8366 case CPU_DOWN_PREPARE:
8367 case CPU_DOWN_PREPARE_FROZEN:
8368 disable_runtime(cpu_rq(cpu));
8371 case CPU_DOWN_FAILED:
8372 case CPU_DOWN_FAILED_FROZEN:
8374 case CPU_ONLINE_FROZEN:
8375 enable_runtime(cpu_rq(cpu));
8383 void __init sched_init_smp(void)
8385 cpumask_var_t non_isolated_cpus;
8387 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
8389 #if defined(CONFIG_NUMA)
8390 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
8392 BUG_ON(sched_group_nodes_bycpu == NULL);
8395 mutex_lock(&sched_domains_mutex);
8396 arch_init_sched_domains(cpu_online_mask);
8397 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
8398 if (cpumask_empty(non_isolated_cpus))
8399 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
8400 mutex_unlock(&sched_domains_mutex);
8403 #ifndef CONFIG_CPUSETS
8404 /* XXX: Theoretical race here - CPU may be hotplugged now */
8405 hotcpu_notifier(update_sched_domains, 0);
8408 /* RT runtime code needs to handle some hotplug events */
8409 hotcpu_notifier(update_runtime, 0);
8413 /* Move init over to a non-isolated CPU */
8414 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
8416 sched_init_granularity();
8417 free_cpumask_var(non_isolated_cpus);
8419 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
8420 init_sched_rt_class();
8423 void __init sched_init_smp(void)
8425 sched_init_granularity();
8427 #endif /* CONFIG_SMP */
8429 int in_sched_functions(unsigned long addr)
8431 return in_lock_functions(addr) ||
8432 (addr >= (unsigned long)__sched_text_start
8433 && addr < (unsigned long)__sched_text_end);
8436 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
8438 cfs_rq->tasks_timeline = RB_ROOT;
8439 INIT_LIST_HEAD(&cfs_rq->tasks);
8440 #ifdef CONFIG_FAIR_GROUP_SCHED
8443 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
8446 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
8448 struct rt_prio_array *array;
8451 array = &rt_rq->active;
8452 for (i = 0; i < MAX_RT_PRIO; i++) {
8453 INIT_LIST_HEAD(array->queue + i);
8454 __clear_bit(i, array->bitmap);
8456 /* delimiter for bitsearch: */
8457 __set_bit(MAX_RT_PRIO, array->bitmap);
8459 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
8460 rt_rq->highest_prio.curr = MAX_RT_PRIO;
8462 rt_rq->highest_prio.next = MAX_RT_PRIO;
8466 rt_rq->rt_nr_migratory = 0;
8467 rt_rq->overloaded = 0;
8468 plist_head_init(&rq->rt.pushable_tasks, &rq->lock);
8472 rt_rq->rt_throttled = 0;
8473 rt_rq->rt_runtime = 0;
8474 spin_lock_init(&rt_rq->rt_runtime_lock);
8476 #ifdef CONFIG_RT_GROUP_SCHED
8477 rt_rq->rt_nr_boosted = 0;
8482 #ifdef CONFIG_FAIR_GROUP_SCHED
8483 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
8484 struct sched_entity *se, int cpu, int add,
8485 struct sched_entity *parent)
8487 struct rq *rq = cpu_rq(cpu);
8488 tg->cfs_rq[cpu] = cfs_rq;
8489 init_cfs_rq(cfs_rq, rq);
8492 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
8495 /* se could be NULL for init_task_group */
8500 se->cfs_rq = &rq->cfs;
8502 se->cfs_rq = parent->my_q;
8505 se->load.weight = tg->shares;
8506 se->load.inv_weight = 0;
8507 se->parent = parent;
8511 #ifdef CONFIG_RT_GROUP_SCHED
8512 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
8513 struct sched_rt_entity *rt_se, int cpu, int add,
8514 struct sched_rt_entity *parent)
8516 struct rq *rq = cpu_rq(cpu);
8518 tg->rt_rq[cpu] = rt_rq;
8519 init_rt_rq(rt_rq, rq);
8521 rt_rq->rt_se = rt_se;
8522 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
8524 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
8526 tg->rt_se[cpu] = rt_se;
8531 rt_se->rt_rq = &rq->rt;
8533 rt_se->rt_rq = parent->my_q;
8535 rt_se->my_q = rt_rq;
8536 rt_se->parent = parent;
8537 INIT_LIST_HEAD(&rt_se->run_list);
8541 void __init sched_init(void)
8544 unsigned long alloc_size = 0, ptr;
8546 #ifdef CONFIG_FAIR_GROUP_SCHED
8547 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8549 #ifdef CONFIG_RT_GROUP_SCHED
8550 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
8552 #ifdef CONFIG_USER_SCHED
8556 * As sched_init() is called before page_alloc is setup,
8557 * we use alloc_bootmem().
8560 ptr = (unsigned long)alloc_bootmem(alloc_size);
8562 #ifdef CONFIG_FAIR_GROUP_SCHED
8563 init_task_group.se = (struct sched_entity **)ptr;
8564 ptr += nr_cpu_ids * sizeof(void **);
8566 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
8567 ptr += nr_cpu_ids * sizeof(void **);
8569 #ifdef CONFIG_USER_SCHED
8570 root_task_group.se = (struct sched_entity **)ptr;
8571 ptr += nr_cpu_ids * sizeof(void **);
8573 root_task_group.cfs_rq = (struct cfs_rq **)ptr;
8574 ptr += nr_cpu_ids * sizeof(void **);
8575 #endif /* CONFIG_USER_SCHED */
8576 #endif /* CONFIG_FAIR_GROUP_SCHED */
8577 #ifdef CONFIG_RT_GROUP_SCHED
8578 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
8579 ptr += nr_cpu_ids * sizeof(void **);
8581 init_task_group.rt_rq = (struct rt_rq **)ptr;
8582 ptr += nr_cpu_ids * sizeof(void **);
8584 #ifdef CONFIG_USER_SCHED
8585 root_task_group.rt_se = (struct sched_rt_entity **)ptr;
8586 ptr += nr_cpu_ids * sizeof(void **);
8588 root_task_group.rt_rq = (struct rt_rq **)ptr;
8589 ptr += nr_cpu_ids * sizeof(void **);
8590 #endif /* CONFIG_USER_SCHED */
8591 #endif /* CONFIG_RT_GROUP_SCHED */
8595 init_defrootdomain();
8598 init_rt_bandwidth(&def_rt_bandwidth,
8599 global_rt_period(), global_rt_runtime());
8601 #ifdef CONFIG_RT_GROUP_SCHED
8602 init_rt_bandwidth(&init_task_group.rt_bandwidth,
8603 global_rt_period(), global_rt_runtime());
8604 #ifdef CONFIG_USER_SCHED
8605 init_rt_bandwidth(&root_task_group.rt_bandwidth,
8606 global_rt_period(), RUNTIME_INF);
8607 #endif /* CONFIG_USER_SCHED */
8608 #endif /* CONFIG_RT_GROUP_SCHED */
8610 #ifdef CONFIG_GROUP_SCHED
8611 list_add(&init_task_group.list, &task_groups);
8612 INIT_LIST_HEAD(&init_task_group.children);
8614 #ifdef CONFIG_USER_SCHED
8615 INIT_LIST_HEAD(&root_task_group.children);
8616 init_task_group.parent = &root_task_group;
8617 list_add(&init_task_group.siblings, &root_task_group.children);
8618 #endif /* CONFIG_USER_SCHED */
8619 #endif /* CONFIG_GROUP_SCHED */
8621 for_each_possible_cpu(i) {
8625 spin_lock_init(&rq->lock);
8627 init_cfs_rq(&rq->cfs, rq);
8628 init_rt_rq(&rq->rt, rq);
8629 #ifdef CONFIG_FAIR_GROUP_SCHED
8630 init_task_group.shares = init_task_group_load;
8631 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
8632 #ifdef CONFIG_CGROUP_SCHED
8634 * How much cpu bandwidth does init_task_group get?
8636 * In case of task-groups formed thr' the cgroup filesystem, it
8637 * gets 100% of the cpu resources in the system. This overall
8638 * system cpu resource is divided among the tasks of
8639 * init_task_group and its child task-groups in a fair manner,
8640 * based on each entity's (task or task-group's) weight
8641 * (se->load.weight).
8643 * In other words, if init_task_group has 10 tasks of weight
8644 * 1024) and two child groups A0 and A1 (of weight 1024 each),
8645 * then A0's share of the cpu resource is:
8647 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
8649 * We achieve this by letting init_task_group's tasks sit
8650 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
8652 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
8653 #elif defined CONFIG_USER_SCHED
8654 root_task_group.shares = NICE_0_LOAD;
8655 init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, 0, NULL);
8657 * In case of task-groups formed thr' the user id of tasks,
8658 * init_task_group represents tasks belonging to root user.
8659 * Hence it forms a sibling of all subsequent groups formed.
8660 * In this case, init_task_group gets only a fraction of overall
8661 * system cpu resource, based on the weight assigned to root
8662 * user's cpu share (INIT_TASK_GROUP_LOAD). This is accomplished
8663 * by letting tasks of init_task_group sit in a separate cfs_rq
8664 * (init_cfs_rq) and having one entity represent this group of
8665 * tasks in rq->cfs (i.e init_task_group->se[] != NULL).
8667 init_tg_cfs_entry(&init_task_group,
8668 &per_cpu(init_cfs_rq, i),
8669 &per_cpu(init_sched_entity, i), i, 1,
8670 root_task_group.se[i]);
8673 #endif /* CONFIG_FAIR_GROUP_SCHED */
8675 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
8676 #ifdef CONFIG_RT_GROUP_SCHED
8677 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
8678 #ifdef CONFIG_CGROUP_SCHED
8679 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
8680 #elif defined CONFIG_USER_SCHED
8681 init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, 0, NULL);
8682 init_tg_rt_entry(&init_task_group,
8683 &per_cpu(init_rt_rq, i),
8684 &per_cpu(init_sched_rt_entity, i), i, 1,
8685 root_task_group.rt_se[i]);
8689 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
8690 rq->cpu_load[j] = 0;
8694 rq->active_balance = 0;
8695 rq->next_balance = jiffies;
8699 rq->migration_thread = NULL;
8700 INIT_LIST_HEAD(&rq->migration_queue);
8701 rq_attach_root(rq, &def_root_domain);
8704 atomic_set(&rq->nr_iowait, 0);
8707 set_load_weight(&init_task);
8709 #ifdef CONFIG_PREEMPT_NOTIFIERS
8710 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
8714 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
8717 #ifdef CONFIG_RT_MUTEXES
8718 plist_head_init(&init_task.pi_waiters, &init_task.pi_lock);
8722 * The boot idle thread does lazy MMU switching as well:
8724 atomic_inc(&init_mm.mm_count);
8725 enter_lazy_tlb(&init_mm, current);
8728 * Make us the idle thread. Technically, schedule() should not be
8729 * called from this thread, however somewhere below it might be,
8730 * but because we are the idle thread, we just pick up running again
8731 * when this runqueue becomes "idle".
8733 init_idle(current, smp_processor_id());
8735 * During early bootup we pretend to be a normal task:
8737 current->sched_class = &fair_sched_class;
8739 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
8740 alloc_bootmem_cpumask_var(&nohz_cpu_mask);
8743 alloc_bootmem_cpumask_var(&nohz.cpu_mask);
8745 alloc_bootmem_cpumask_var(&cpu_isolated_map);
8748 scheduler_running = 1;
8751 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
8752 void __might_sleep(char *file, int line)
8755 static unsigned long prev_jiffy; /* ratelimiting */
8757 if ((!in_atomic() && !irqs_disabled()) ||
8758 system_state != SYSTEM_RUNNING || oops_in_progress)
8760 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
8762 prev_jiffy = jiffies;
8765 "BUG: sleeping function called from invalid context at %s:%d\n",
8768 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
8769 in_atomic(), irqs_disabled(),
8770 current->pid, current->comm);
8772 debug_show_held_locks(current);
8773 if (irqs_disabled())
8774 print_irqtrace_events(current);
8778 EXPORT_SYMBOL(__might_sleep);
8781 #ifdef CONFIG_MAGIC_SYSRQ
8782 static void normalize_task(struct rq *rq, struct task_struct *p)
8786 update_rq_clock(rq);
8787 on_rq = p->se.on_rq;
8789 deactivate_task(rq, p, 0);
8790 __setscheduler(rq, p, SCHED_NORMAL, 0);
8792 activate_task(rq, p, 0);
8793 resched_task(rq->curr);
8797 void normalize_rt_tasks(void)
8799 struct task_struct *g, *p;
8800 unsigned long flags;
8803 read_lock_irqsave(&tasklist_lock, flags);
8804 do_each_thread(g, p) {
8806 * Only normalize user tasks:
8811 p->se.exec_start = 0;
8812 #ifdef CONFIG_SCHEDSTATS
8813 p->se.wait_start = 0;
8814 p->se.sleep_start = 0;
8815 p->se.block_start = 0;
8820 * Renice negative nice level userspace
8823 if (TASK_NICE(p) < 0 && p->mm)
8824 set_user_nice(p, 0);
8828 spin_lock(&p->pi_lock);
8829 rq = __task_rq_lock(p);
8831 normalize_task(rq, p);
8833 __task_rq_unlock(rq);
8834 spin_unlock(&p->pi_lock);
8835 } while_each_thread(g, p);
8837 read_unlock_irqrestore(&tasklist_lock, flags);
8840 #endif /* CONFIG_MAGIC_SYSRQ */
8844 * These functions are only useful for the IA64 MCA handling.
8846 * They can only be called when the whole system has been
8847 * stopped - every CPU needs to be quiescent, and no scheduling
8848 * activity can take place. Using them for anything else would
8849 * be a serious bug, and as a result, they aren't even visible
8850 * under any other configuration.
8854 * curr_task - return the current task for a given cpu.
8855 * @cpu: the processor in question.
8857 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8859 struct task_struct *curr_task(int cpu)
8861 return cpu_curr(cpu);
8865 * set_curr_task - set the current task for a given cpu.
8866 * @cpu: the processor in question.
8867 * @p: the task pointer to set.
8869 * Description: This function must only be used when non-maskable interrupts
8870 * are serviced on a separate stack. It allows the architecture to switch the
8871 * notion of the current task on a cpu in a non-blocking manner. This function
8872 * must be called with all CPU's synchronized, and interrupts disabled, the
8873 * and caller must save the original value of the current task (see
8874 * curr_task() above) and restore that value before reenabling interrupts and
8875 * re-starting the system.
8877 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
8879 void set_curr_task(int cpu, struct task_struct *p)
8886 #ifdef CONFIG_FAIR_GROUP_SCHED
8887 static void free_fair_sched_group(struct task_group *tg)
8891 for_each_possible_cpu(i) {
8893 kfree(tg->cfs_rq[i]);
8903 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8905 struct cfs_rq *cfs_rq;
8906 struct sched_entity *se;
8910 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
8913 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
8917 tg->shares = NICE_0_LOAD;
8919 for_each_possible_cpu(i) {
8922 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
8923 GFP_KERNEL, cpu_to_node(i));
8927 se = kzalloc_node(sizeof(struct sched_entity),
8928 GFP_KERNEL, cpu_to_node(i));
8932 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
8941 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8943 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
8944 &cpu_rq(cpu)->leaf_cfs_rq_list);
8947 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8949 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
8951 #else /* !CONFG_FAIR_GROUP_SCHED */
8952 static inline void free_fair_sched_group(struct task_group *tg)
8957 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
8962 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
8966 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8969 #endif /* CONFIG_FAIR_GROUP_SCHED */
8971 #ifdef CONFIG_RT_GROUP_SCHED
8972 static void free_rt_sched_group(struct task_group *tg)
8976 destroy_rt_bandwidth(&tg->rt_bandwidth);
8978 for_each_possible_cpu(i) {
8980 kfree(tg->rt_rq[i]);
8982 kfree(tg->rt_se[i]);
8990 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8992 struct rt_rq *rt_rq;
8993 struct sched_rt_entity *rt_se;
8997 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
9000 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
9004 init_rt_bandwidth(&tg->rt_bandwidth,
9005 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
9007 for_each_possible_cpu(i) {
9010 rt_rq = kzalloc_node(sizeof(struct rt_rq),
9011 GFP_KERNEL, cpu_to_node(i));
9015 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
9016 GFP_KERNEL, cpu_to_node(i));
9020 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
9029 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
9031 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
9032 &cpu_rq(cpu)->leaf_rt_rq_list);
9035 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
9037 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
9039 #else /* !CONFIG_RT_GROUP_SCHED */
9040 static inline void free_rt_sched_group(struct task_group *tg)
9045 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
9050 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
9054 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
9057 #endif /* CONFIG_RT_GROUP_SCHED */
9059 #ifdef CONFIG_GROUP_SCHED
9060 static void free_sched_group(struct task_group *tg)
9062 free_fair_sched_group(tg);
9063 free_rt_sched_group(tg);
9067 /* allocate runqueue etc for a new task group */
9068 struct task_group *sched_create_group(struct task_group *parent)
9070 struct task_group *tg;
9071 unsigned long flags;
9074 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
9076 return ERR_PTR(-ENOMEM);
9078 if (!alloc_fair_sched_group(tg, parent))
9081 if (!alloc_rt_sched_group(tg, parent))
9084 spin_lock_irqsave(&task_group_lock, flags);
9085 for_each_possible_cpu(i) {
9086 register_fair_sched_group(tg, i);
9087 register_rt_sched_group(tg, i);
9089 list_add_rcu(&tg->list, &task_groups);
9091 WARN_ON(!parent); /* root should already exist */
9093 tg->parent = parent;
9094 INIT_LIST_HEAD(&tg->children);
9095 list_add_rcu(&tg->siblings, &parent->children);
9096 spin_unlock_irqrestore(&task_group_lock, flags);
9101 free_sched_group(tg);
9102 return ERR_PTR(-ENOMEM);
9105 /* rcu callback to free various structures associated with a task group */
9106 static void free_sched_group_rcu(struct rcu_head *rhp)
9108 /* now it should be safe to free those cfs_rqs */
9109 free_sched_group(container_of(rhp, struct task_group, rcu));
9112 /* Destroy runqueue etc associated with a task group */
9113 void sched_destroy_group(struct task_group *tg)
9115 unsigned long flags;
9118 spin_lock_irqsave(&task_group_lock, flags);
9119 for_each_possible_cpu(i) {
9120 unregister_fair_sched_group(tg, i);
9121 unregister_rt_sched_group(tg, i);
9123 list_del_rcu(&tg->list);
9124 list_del_rcu(&tg->siblings);
9125 spin_unlock_irqrestore(&task_group_lock, flags);
9127 /* wait for possible concurrent references to cfs_rqs complete */
9128 call_rcu(&tg->rcu, free_sched_group_rcu);
9131 /* change task's runqueue when it moves between groups.
9132 * The caller of this function should have put the task in its new group
9133 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
9134 * reflect its new group.
9136 void sched_move_task(struct task_struct *tsk)
9139 unsigned long flags;
9142 rq = task_rq_lock(tsk, &flags);
9144 update_rq_clock(rq);
9146 running = task_current(rq, tsk);
9147 on_rq = tsk->se.on_rq;
9150 dequeue_task(rq, tsk, 0);
9151 if (unlikely(running))
9152 tsk->sched_class->put_prev_task(rq, tsk);
9154 set_task_rq(tsk, task_cpu(tsk));
9156 #ifdef CONFIG_FAIR_GROUP_SCHED
9157 if (tsk->sched_class->moved_group)
9158 tsk->sched_class->moved_group(tsk);
9161 if (unlikely(running))
9162 tsk->sched_class->set_curr_task(rq);
9164 enqueue_task(rq, tsk, 0);
9166 task_rq_unlock(rq, &flags);
9168 #endif /* CONFIG_GROUP_SCHED */
9170 #ifdef CONFIG_FAIR_GROUP_SCHED
9171 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
9173 struct cfs_rq *cfs_rq = se->cfs_rq;
9178 dequeue_entity(cfs_rq, se, 0);
9180 se->load.weight = shares;
9181 se->load.inv_weight = 0;
9184 enqueue_entity(cfs_rq, se, 0);
9187 static void set_se_shares(struct sched_entity *se, unsigned long shares)
9189 struct cfs_rq *cfs_rq = se->cfs_rq;
9190 struct rq *rq = cfs_rq->rq;
9191 unsigned long flags;
9193 spin_lock_irqsave(&rq->lock, flags);
9194 __set_se_shares(se, shares);
9195 spin_unlock_irqrestore(&rq->lock, flags);
9198 static DEFINE_MUTEX(shares_mutex);
9200 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
9203 unsigned long flags;
9206 * We can't change the weight of the root cgroup.
9211 if (shares < MIN_SHARES)
9212 shares = MIN_SHARES;
9213 else if (shares > MAX_SHARES)
9214 shares = MAX_SHARES;
9216 mutex_lock(&shares_mutex);
9217 if (tg->shares == shares)
9220 spin_lock_irqsave(&task_group_lock, flags);
9221 for_each_possible_cpu(i)
9222 unregister_fair_sched_group(tg, i);
9223 list_del_rcu(&tg->siblings);
9224 spin_unlock_irqrestore(&task_group_lock, flags);
9226 /* wait for any ongoing reference to this group to finish */
9227 synchronize_sched();
9230 * Now we are free to modify the group's share on each cpu
9231 * w/o tripping rebalance_share or load_balance_fair.
9233 tg->shares = shares;
9234 for_each_possible_cpu(i) {
9238 cfs_rq_set_shares(tg->cfs_rq[i], 0);
9239 set_se_shares(tg->se[i], shares);
9243 * Enable load balance activity on this group, by inserting it back on
9244 * each cpu's rq->leaf_cfs_rq_list.
9246 spin_lock_irqsave(&task_group_lock, flags);
9247 for_each_possible_cpu(i)
9248 register_fair_sched_group(tg, i);
9249 list_add_rcu(&tg->siblings, &tg->parent->children);
9250 spin_unlock_irqrestore(&task_group_lock, flags);
9252 mutex_unlock(&shares_mutex);
9256 unsigned long sched_group_shares(struct task_group *tg)
9262 #ifdef CONFIG_RT_GROUP_SCHED
9264 * Ensure that the real time constraints are schedulable.
9266 static DEFINE_MUTEX(rt_constraints_mutex);
9268 static unsigned long to_ratio(u64 period, u64 runtime)
9270 if (runtime == RUNTIME_INF)
9273 return div64_u64(runtime << 20, period);
9276 /* Must be called with tasklist_lock held */
9277 static inline int tg_has_rt_tasks(struct task_group *tg)
9279 struct task_struct *g, *p;
9281 do_each_thread(g, p) {
9282 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
9284 } while_each_thread(g, p);
9289 struct rt_schedulable_data {
9290 struct task_group *tg;
9295 static int tg_schedulable(struct task_group *tg, void *data)
9297 struct rt_schedulable_data *d = data;
9298 struct task_group *child;
9299 unsigned long total, sum = 0;
9300 u64 period, runtime;
9302 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
9303 runtime = tg->rt_bandwidth.rt_runtime;
9306 period = d->rt_period;
9307 runtime = d->rt_runtime;
9310 #ifdef CONFIG_USER_SCHED
9311 if (tg == &root_task_group) {
9312 period = global_rt_period();
9313 runtime = global_rt_runtime();
9318 * Cannot have more runtime than the period.
9320 if (runtime > period && runtime != RUNTIME_INF)
9324 * Ensure we don't starve existing RT tasks.
9326 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
9329 total = to_ratio(period, runtime);
9332 * Nobody can have more than the global setting allows.
9334 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
9338 * The sum of our children's runtime should not exceed our own.
9340 list_for_each_entry_rcu(child, &tg->children, siblings) {
9341 period = ktime_to_ns(child->rt_bandwidth.rt_period);
9342 runtime = child->rt_bandwidth.rt_runtime;
9344 if (child == d->tg) {
9345 period = d->rt_period;
9346 runtime = d->rt_runtime;
9349 sum += to_ratio(period, runtime);
9358 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
9360 struct rt_schedulable_data data = {
9362 .rt_period = period,
9363 .rt_runtime = runtime,
9366 return walk_tg_tree(tg_schedulable, tg_nop, &data);
9369 static int tg_set_bandwidth(struct task_group *tg,
9370 u64 rt_period, u64 rt_runtime)
9374 mutex_lock(&rt_constraints_mutex);
9375 read_lock(&tasklist_lock);
9376 err = __rt_schedulable(tg, rt_period, rt_runtime);
9380 spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
9381 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
9382 tg->rt_bandwidth.rt_runtime = rt_runtime;
9384 for_each_possible_cpu(i) {
9385 struct rt_rq *rt_rq = tg->rt_rq[i];
9387 spin_lock(&rt_rq->rt_runtime_lock);
9388 rt_rq->rt_runtime = rt_runtime;
9389 spin_unlock(&rt_rq->rt_runtime_lock);
9391 spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
9393 read_unlock(&tasklist_lock);
9394 mutex_unlock(&rt_constraints_mutex);
9399 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
9401 u64 rt_runtime, rt_period;
9403 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
9404 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
9405 if (rt_runtime_us < 0)
9406 rt_runtime = RUNTIME_INF;
9408 return tg_set_bandwidth(tg, rt_period, rt_runtime);
9411 long sched_group_rt_runtime(struct task_group *tg)
9415 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
9418 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
9419 do_div(rt_runtime_us, NSEC_PER_USEC);
9420 return rt_runtime_us;
9423 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
9425 u64 rt_runtime, rt_period;
9427 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
9428 rt_runtime = tg->rt_bandwidth.rt_runtime;
9433 return tg_set_bandwidth(tg, rt_period, rt_runtime);
9436 long sched_group_rt_period(struct task_group *tg)
9440 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
9441 do_div(rt_period_us, NSEC_PER_USEC);
9442 return rt_period_us;
9445 static int sched_rt_global_constraints(void)
9447 u64 runtime, period;
9450 if (sysctl_sched_rt_period <= 0)
9453 runtime = global_rt_runtime();
9454 period = global_rt_period();
9457 * Sanity check on the sysctl variables.
9459 if (runtime > period && runtime != RUNTIME_INF)
9462 mutex_lock(&rt_constraints_mutex);
9463 read_lock(&tasklist_lock);
9464 ret = __rt_schedulable(NULL, 0, 0);
9465 read_unlock(&tasklist_lock);
9466 mutex_unlock(&rt_constraints_mutex);
9471 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
9473 /* Don't accept realtime tasks when there is no way for them to run */
9474 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
9480 #else /* !CONFIG_RT_GROUP_SCHED */
9481 static int sched_rt_global_constraints(void)
9483 unsigned long flags;
9486 if (sysctl_sched_rt_period <= 0)
9489 spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
9490 for_each_possible_cpu(i) {
9491 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
9493 spin_lock(&rt_rq->rt_runtime_lock);
9494 rt_rq->rt_runtime = global_rt_runtime();
9495 spin_unlock(&rt_rq->rt_runtime_lock);
9497 spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
9501 #endif /* CONFIG_RT_GROUP_SCHED */
9503 int sched_rt_handler(struct ctl_table *table, int write,
9504 struct file *filp, void __user *buffer, size_t *lenp,
9508 int old_period, old_runtime;
9509 static DEFINE_MUTEX(mutex);
9512 old_period = sysctl_sched_rt_period;
9513 old_runtime = sysctl_sched_rt_runtime;
9515 ret = proc_dointvec(table, write, filp, buffer, lenp, ppos);
9517 if (!ret && write) {
9518 ret = sched_rt_global_constraints();
9520 sysctl_sched_rt_period = old_period;
9521 sysctl_sched_rt_runtime = old_runtime;
9523 def_rt_bandwidth.rt_runtime = global_rt_runtime();
9524 def_rt_bandwidth.rt_period =
9525 ns_to_ktime(global_rt_period());
9528 mutex_unlock(&mutex);
9533 #ifdef CONFIG_CGROUP_SCHED
9535 /* return corresponding task_group object of a cgroup */
9536 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
9538 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
9539 struct task_group, css);
9542 static struct cgroup_subsys_state *
9543 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
9545 struct task_group *tg, *parent;
9547 if (!cgrp->parent) {
9548 /* This is early initialization for the top cgroup */
9549 return &init_task_group.css;
9552 parent = cgroup_tg(cgrp->parent);
9553 tg = sched_create_group(parent);
9555 return ERR_PTR(-ENOMEM);
9561 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9563 struct task_group *tg = cgroup_tg(cgrp);
9565 sched_destroy_group(tg);
9569 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9570 struct task_struct *tsk)
9572 #ifdef CONFIG_RT_GROUP_SCHED
9573 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
9576 /* We don't support RT-tasks being in separate groups */
9577 if (tsk->sched_class != &fair_sched_class)
9585 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
9586 struct cgroup *old_cont, struct task_struct *tsk)
9588 sched_move_task(tsk);
9591 #ifdef CONFIG_FAIR_GROUP_SCHED
9592 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
9595 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
9598 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
9600 struct task_group *tg = cgroup_tg(cgrp);
9602 return (u64) tg->shares;
9604 #endif /* CONFIG_FAIR_GROUP_SCHED */
9606 #ifdef CONFIG_RT_GROUP_SCHED
9607 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
9610 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
9613 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
9615 return sched_group_rt_runtime(cgroup_tg(cgrp));
9618 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
9621 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
9624 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
9626 return sched_group_rt_period(cgroup_tg(cgrp));
9628 #endif /* CONFIG_RT_GROUP_SCHED */
9630 static struct cftype cpu_files[] = {
9631 #ifdef CONFIG_FAIR_GROUP_SCHED
9634 .read_u64 = cpu_shares_read_u64,
9635 .write_u64 = cpu_shares_write_u64,
9638 #ifdef CONFIG_RT_GROUP_SCHED
9640 .name = "rt_runtime_us",
9641 .read_s64 = cpu_rt_runtime_read,
9642 .write_s64 = cpu_rt_runtime_write,
9645 .name = "rt_period_us",
9646 .read_u64 = cpu_rt_period_read_uint,
9647 .write_u64 = cpu_rt_period_write_uint,
9652 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
9654 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
9657 struct cgroup_subsys cpu_cgroup_subsys = {
9659 .create = cpu_cgroup_create,
9660 .destroy = cpu_cgroup_destroy,
9661 .can_attach = cpu_cgroup_can_attach,
9662 .attach = cpu_cgroup_attach,
9663 .populate = cpu_cgroup_populate,
9664 .subsys_id = cpu_cgroup_subsys_id,
9668 #endif /* CONFIG_CGROUP_SCHED */
9670 #ifdef CONFIG_CGROUP_CPUACCT
9673 * CPU accounting code for task groups.
9675 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
9676 * (balbir@in.ibm.com).
9679 /* track cpu usage of a group of tasks and its child groups */
9681 struct cgroup_subsys_state css;
9682 /* cpuusage holds pointer to a u64-type object on every cpu */
9684 struct cpuacct *parent;
9687 struct cgroup_subsys cpuacct_subsys;
9689 /* return cpu accounting group corresponding to this container */
9690 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
9692 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
9693 struct cpuacct, css);
9696 /* return cpu accounting group to which this task belongs */
9697 static inline struct cpuacct *task_ca(struct task_struct *tsk)
9699 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
9700 struct cpuacct, css);
9703 /* create a new cpu accounting group */
9704 static struct cgroup_subsys_state *cpuacct_create(
9705 struct cgroup_subsys *ss, struct cgroup *cgrp)
9707 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
9710 return ERR_PTR(-ENOMEM);
9712 ca->cpuusage = alloc_percpu(u64);
9713 if (!ca->cpuusage) {
9715 return ERR_PTR(-ENOMEM);
9719 ca->parent = cgroup_ca(cgrp->parent);
9724 /* destroy an existing cpu accounting group */
9726 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
9728 struct cpuacct *ca = cgroup_ca(cgrp);
9730 free_percpu(ca->cpuusage);
9734 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
9736 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9739 #ifndef CONFIG_64BIT
9741 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
9743 spin_lock_irq(&cpu_rq(cpu)->lock);
9745 spin_unlock_irq(&cpu_rq(cpu)->lock);
9753 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
9755 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9757 #ifndef CONFIG_64BIT
9759 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
9761 spin_lock_irq(&cpu_rq(cpu)->lock);
9763 spin_unlock_irq(&cpu_rq(cpu)->lock);
9769 /* return total cpu usage (in nanoseconds) of a group */
9770 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
9772 struct cpuacct *ca = cgroup_ca(cgrp);
9773 u64 totalcpuusage = 0;
9776 for_each_present_cpu(i)
9777 totalcpuusage += cpuacct_cpuusage_read(ca, i);
9779 return totalcpuusage;
9782 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
9785 struct cpuacct *ca = cgroup_ca(cgrp);
9794 for_each_present_cpu(i)
9795 cpuacct_cpuusage_write(ca, i, 0);
9801 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
9804 struct cpuacct *ca = cgroup_ca(cgroup);
9808 for_each_present_cpu(i) {
9809 percpu = cpuacct_cpuusage_read(ca, i);
9810 seq_printf(m, "%llu ", (unsigned long long) percpu);
9812 seq_printf(m, "\n");
9816 static struct cftype files[] = {
9819 .read_u64 = cpuusage_read,
9820 .write_u64 = cpuusage_write,
9823 .name = "usage_percpu",
9824 .read_seq_string = cpuacct_percpu_seq_read,
9829 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
9831 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
9835 * charge this task's execution time to its accounting group.
9837 * called with rq->lock held.
9839 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
9844 if (unlikely(!cpuacct_subsys.active))
9847 cpu = task_cpu(tsk);
9850 for (; ca; ca = ca->parent) {
9851 u64 *cpuusage = percpu_ptr(ca->cpuusage, cpu);
9852 *cpuusage += cputime;
9856 struct cgroup_subsys cpuacct_subsys = {
9858 .create = cpuacct_create,
9859 .destroy = cpuacct_destroy,
9860 .populate = cpuacct_populate,
9861 .subsys_id = cpuacct_subsys_id,
9863 #endif /* CONFIG_CGROUP_CPUACCT */