4 * Kernel scheduler and related syscalls
6 * Copyright (C) 1991-2002 Linus Torvalds
8 * 1996-12-23 Modified by Dave Grothe to fix bugs in semaphores and
9 * make semaphores SMP safe
10 * 1998-11-19 Implemented schedule_timeout() and related stuff
12 * 2002-01-04 New ultra-scalable O(1) scheduler by Ingo Molnar:
13 * hybrid priority-list and round-robin design with
14 * an array-switch method of distributing timeslices
15 * and per-CPU runqueues. Cleanups and useful suggestions
16 * by Davide Libenzi, preemptible kernel bits by Robert Love.
17 * 2003-09-03 Interactivity tuning by Con Kolivas.
18 * 2004-04-02 Scheduler domains code by Nick Piggin
19 * 2007-04-15 Work begun on replacing all interactivity tuning with a
20 * fair scheduling design by Con Kolivas.
21 * 2007-05-05 Load balancing (smp-nice) and other improvements
23 * 2007-05-06 Interactivity improvements to CFS by Mike Galbraith
24 * 2007-07-01 Group scheduling enhancements by Srivatsa Vaddagiri
25 * 2007-11-29 RT balancing improvements by Steven Rostedt, Gregory Haskins,
26 * Thomas Gleixner, Mike Kravetz
30 #include <linux/module.h>
31 #include <linux/nmi.h>
32 #include <linux/init.h>
33 #include <linux/uaccess.h>
34 #include <linux/highmem.h>
35 #include <linux/smp_lock.h>
36 #include <asm/mmu_context.h>
37 #include <linux/interrupt.h>
38 #include <linux/capability.h>
39 #include <linux/completion.h>
40 #include <linux/kernel_stat.h>
41 #include <linux/debug_locks.h>
42 #include <linux/perf_event.h>
43 #include <linux/security.h>
44 #include <linux/notifier.h>
45 #include <linux/profile.h>
46 #include <linux/freezer.h>
47 #include <linux/vmalloc.h>
48 #include <linux/blkdev.h>
49 #include <linux/delay.h>
50 #include <linux/pid_namespace.h>
51 #include <linux/smp.h>
52 #include <linux/threads.h>
53 #include <linux/timer.h>
54 #include <linux/rcupdate.h>
55 #include <linux/cpu.h>
56 #include <linux/cpuset.h>
57 #include <linux/percpu.h>
58 #include <linux/kthread.h>
59 #include <linux/proc_fs.h>
60 #include <linux/seq_file.h>
61 #include <linux/sysctl.h>
62 #include <linux/syscalls.h>
63 #include <linux/times.h>
64 #include <linux/tsacct_kern.h>
65 #include <linux/kprobes.h>
66 #include <linux/delayacct.h>
67 #include <linux/unistd.h>
68 #include <linux/pagemap.h>
69 #include <linux/hrtimer.h>
70 #include <linux/tick.h>
71 #include <linux/debugfs.h>
72 #include <linux/ctype.h>
73 #include <linux/ftrace.h>
76 #include <asm/irq_regs.h>
78 #include "sched_cpupri.h"
80 #define CREATE_TRACE_POINTS
81 #include <trace/events/sched.h>
84 * Convert user-nice values [ -20 ... 0 ... 19 ]
85 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
88 #define NICE_TO_PRIO(nice) (MAX_RT_PRIO + (nice) + 20)
89 #define PRIO_TO_NICE(prio) ((prio) - MAX_RT_PRIO - 20)
90 #define TASK_NICE(p) PRIO_TO_NICE((p)->static_prio)
93 * 'User priority' is the nice value converted to something we
94 * can work with better when scaling various scheduler parameters,
95 * it's a [ 0 ... 39 ] range.
97 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
98 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
99 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
102 * Helpers for converting nanosecond timing to jiffy resolution
104 #define NS_TO_JIFFIES(TIME) ((unsigned long)(TIME) / (NSEC_PER_SEC / HZ))
106 #define NICE_0_LOAD SCHED_LOAD_SCALE
107 #define NICE_0_SHIFT SCHED_LOAD_SHIFT
110 * These are the 'tuning knobs' of the scheduler:
112 * default timeslice is 100 msecs (used only for SCHED_RR tasks).
113 * Timeslices get refilled after they expire.
115 #define DEF_TIMESLICE (100 * HZ / 1000)
118 * single value that denotes runtime == period, ie unlimited time.
120 #define RUNTIME_INF ((u64)~0ULL)
122 static inline int rt_policy(int policy)
124 if (unlikely(policy == SCHED_FIFO || policy == SCHED_RR))
129 static inline int task_has_rt_policy(struct task_struct *p)
131 return rt_policy(p->policy);
135 * This is the priority-queue data structure of the RT scheduling class:
137 struct rt_prio_array {
138 DECLARE_BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter */
139 struct list_head queue[MAX_RT_PRIO];
142 struct rt_bandwidth {
143 /* nests inside the rq lock: */
144 raw_spinlock_t rt_runtime_lock;
147 struct hrtimer rt_period_timer;
150 static struct rt_bandwidth def_rt_bandwidth;
152 static int do_sched_rt_period_timer(struct rt_bandwidth *rt_b, int overrun);
154 static enum hrtimer_restart sched_rt_period_timer(struct hrtimer *timer)
156 struct rt_bandwidth *rt_b =
157 container_of(timer, struct rt_bandwidth, rt_period_timer);
163 now = hrtimer_cb_get_time(timer);
164 overrun = hrtimer_forward(timer, now, rt_b->rt_period);
169 idle = do_sched_rt_period_timer(rt_b, overrun);
172 return idle ? HRTIMER_NORESTART : HRTIMER_RESTART;
176 void init_rt_bandwidth(struct rt_bandwidth *rt_b, u64 period, u64 runtime)
178 rt_b->rt_period = ns_to_ktime(period);
179 rt_b->rt_runtime = runtime;
181 raw_spin_lock_init(&rt_b->rt_runtime_lock);
183 hrtimer_init(&rt_b->rt_period_timer,
184 CLOCK_MONOTONIC, HRTIMER_MODE_REL);
185 rt_b->rt_period_timer.function = sched_rt_period_timer;
188 static inline int rt_bandwidth_enabled(void)
190 return sysctl_sched_rt_runtime >= 0;
193 static void start_rt_bandwidth(struct rt_bandwidth *rt_b)
197 if (!rt_bandwidth_enabled() || rt_b->rt_runtime == RUNTIME_INF)
200 if (hrtimer_active(&rt_b->rt_period_timer))
203 raw_spin_lock(&rt_b->rt_runtime_lock);
208 if (hrtimer_active(&rt_b->rt_period_timer))
211 now = hrtimer_cb_get_time(&rt_b->rt_period_timer);
212 hrtimer_forward(&rt_b->rt_period_timer, now, rt_b->rt_period);
214 soft = hrtimer_get_softexpires(&rt_b->rt_period_timer);
215 hard = hrtimer_get_expires(&rt_b->rt_period_timer);
216 delta = ktime_to_ns(ktime_sub(hard, soft));
217 __hrtimer_start_range_ns(&rt_b->rt_period_timer, soft, delta,
218 HRTIMER_MODE_ABS_PINNED, 0);
220 raw_spin_unlock(&rt_b->rt_runtime_lock);
223 #ifdef CONFIG_RT_GROUP_SCHED
224 static void destroy_rt_bandwidth(struct rt_bandwidth *rt_b)
226 hrtimer_cancel(&rt_b->rt_period_timer);
231 * sched_domains_mutex serializes calls to arch_init_sched_domains,
232 * detach_destroy_domains and partition_sched_domains.
234 static DEFINE_MUTEX(sched_domains_mutex);
236 #ifdef CONFIG_CGROUP_SCHED
238 #include <linux/cgroup.h>
242 static LIST_HEAD(task_groups);
244 /* task group related information */
246 struct cgroup_subsys_state css;
248 #ifdef CONFIG_FAIR_GROUP_SCHED
249 /* schedulable entities of this group on each cpu */
250 struct sched_entity **se;
251 /* runqueue "owned" by this group on each cpu */
252 struct cfs_rq **cfs_rq;
253 unsigned long shares;
256 #ifdef CONFIG_RT_GROUP_SCHED
257 struct sched_rt_entity **rt_se;
258 struct rt_rq **rt_rq;
260 struct rt_bandwidth rt_bandwidth;
264 struct list_head list;
266 struct task_group *parent;
267 struct list_head siblings;
268 struct list_head children;
271 #define root_task_group init_task_group
273 /* task_group_lock serializes add/remove of task groups and also changes to
274 * a task group's cpu shares.
276 static DEFINE_SPINLOCK(task_group_lock);
278 #ifdef CONFIG_FAIR_GROUP_SCHED
281 static int root_task_group_empty(void)
283 return list_empty(&root_task_group.children);
287 # define INIT_TASK_GROUP_LOAD NICE_0_LOAD
290 * A weight of 0 or 1 can cause arithmetics problems.
291 * A weight of a cfs_rq is the sum of weights of which entities
292 * are queued on this cfs_rq, so a weight of a entity should not be
293 * too large, so as the shares value of a task group.
294 * (The default weight is 1024 - so there's no practical
295 * limitation from this.)
298 #define MAX_SHARES (1UL << 18)
300 static int init_task_group_load = INIT_TASK_GROUP_LOAD;
303 /* Default task group.
304 * Every task in system belong to this group at bootup.
306 struct task_group init_task_group;
308 /* return group to which a task belongs */
309 static inline struct task_group *task_group(struct task_struct *p)
311 struct task_group *tg;
313 #ifdef CONFIG_CGROUP_SCHED
314 tg = container_of(task_subsys_state(p, cpu_cgroup_subsys_id),
315 struct task_group, css);
317 tg = &init_task_group;
322 /* Change a task's cfs_rq and parent entity if it moves across CPUs/groups */
323 static inline void set_task_rq(struct task_struct *p, unsigned int cpu)
325 #ifdef CONFIG_FAIR_GROUP_SCHED
326 p->se.cfs_rq = task_group(p)->cfs_rq[cpu];
327 p->se.parent = task_group(p)->se[cpu];
330 #ifdef CONFIG_RT_GROUP_SCHED
331 p->rt.rt_rq = task_group(p)->rt_rq[cpu];
332 p->rt.parent = task_group(p)->rt_se[cpu];
338 static inline void set_task_rq(struct task_struct *p, unsigned int cpu) { }
339 static inline struct task_group *task_group(struct task_struct *p)
344 #endif /* CONFIG_CGROUP_SCHED */
346 /* CFS-related fields in a runqueue */
348 struct load_weight load;
349 unsigned long nr_running;
354 struct rb_root tasks_timeline;
355 struct rb_node *rb_leftmost;
357 struct list_head tasks;
358 struct list_head *balance_iterator;
361 * 'curr' points to currently running entity on this cfs_rq.
362 * It is set to NULL otherwise (i.e when none are currently running).
364 struct sched_entity *curr, *next, *last;
366 unsigned int nr_spread_over;
368 #ifdef CONFIG_FAIR_GROUP_SCHED
369 struct rq *rq; /* cpu runqueue to which this cfs_rq is attached */
372 * leaf cfs_rqs are those that hold tasks (lowest schedulable entity in
373 * a hierarchy). Non-leaf lrqs hold other higher schedulable entities
374 * (like users, containers etc.)
376 * leaf_cfs_rq_list ties together list of leaf cfs_rq's in a cpu. This
377 * list is used during load balance.
379 struct list_head leaf_cfs_rq_list;
380 struct task_group *tg; /* group that "owns" this runqueue */
384 * the part of load.weight contributed by tasks
386 unsigned long task_weight;
389 * h_load = weight * f(tg)
391 * Where f(tg) is the recursive weight fraction assigned to
394 unsigned long h_load;
397 * this cpu's part of tg->shares
399 unsigned long shares;
402 * load.weight at the time we set shares
404 unsigned long rq_weight;
409 /* Real-Time classes' related field in a runqueue: */
411 struct rt_prio_array active;
412 unsigned long rt_nr_running;
413 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
415 int curr; /* highest queued rt task prio */
417 int next; /* next highest */
422 unsigned long rt_nr_migratory;
423 unsigned long rt_nr_total;
425 struct plist_head pushable_tasks;
430 /* Nests inside the rq lock: */
431 raw_spinlock_t rt_runtime_lock;
433 #ifdef CONFIG_RT_GROUP_SCHED
434 unsigned long rt_nr_boosted;
437 struct list_head leaf_rt_rq_list;
438 struct task_group *tg;
445 * We add the notion of a root-domain which will be used to define per-domain
446 * variables. Each exclusive cpuset essentially defines an island domain by
447 * fully partitioning the member cpus from any other cpuset. Whenever a new
448 * exclusive cpuset is created, we also create and attach a new root-domain
455 cpumask_var_t online;
458 * The "RT overload" flag: it gets set if a CPU has more than
459 * one runnable RT task.
461 cpumask_var_t rto_mask;
464 struct cpupri cpupri;
469 * By default the system creates a single root-domain with all cpus as
470 * members (mimicking the global state we have today).
472 static struct root_domain def_root_domain;
477 * This is the main, per-CPU runqueue data structure.
479 * Locking rule: those places that want to lock multiple runqueues
480 * (such as the load balancing or the thread migration code), lock
481 * acquire operations must be ordered by ascending &runqueue.
488 * nr_running and cpu_load should be in the same cacheline because
489 * remote CPUs use both these fields when doing load calculation.
491 unsigned long nr_running;
492 #define CPU_LOAD_IDX_MAX 5
493 unsigned long cpu_load[CPU_LOAD_IDX_MAX];
496 unsigned char in_nohz_recently;
498 unsigned int skip_clock_update;
500 /* capture load from *all* tasks on this cpu: */
501 struct load_weight load;
502 unsigned long nr_load_updates;
508 #ifdef CONFIG_FAIR_GROUP_SCHED
509 /* list of leaf cfs_rq on this cpu: */
510 struct list_head leaf_cfs_rq_list;
512 #ifdef CONFIG_RT_GROUP_SCHED
513 struct list_head leaf_rt_rq_list;
517 * This is part of a global counter where only the total sum
518 * over all CPUs matters. A task can increase this counter on
519 * one CPU and if it got migrated afterwards it may decrease
520 * it on another CPU. Always updated under the runqueue lock:
522 unsigned long nr_uninterruptible;
524 struct task_struct *curr, *idle;
525 unsigned long next_balance;
526 struct mm_struct *prev_mm;
533 struct root_domain *rd;
534 struct sched_domain *sd;
536 unsigned char idle_at_tick;
537 /* For active balancing */
541 /* cpu of this runqueue: */
545 unsigned long avg_load_per_task;
547 struct task_struct *migration_thread;
548 struct list_head migration_queue;
556 /* calc_load related fields */
557 unsigned long calc_load_update;
558 long calc_load_active;
560 #ifdef CONFIG_SCHED_HRTICK
562 int hrtick_csd_pending;
563 struct call_single_data hrtick_csd;
565 struct hrtimer hrtick_timer;
568 #ifdef CONFIG_SCHEDSTATS
570 struct sched_info rq_sched_info;
571 unsigned long long rq_cpu_time;
572 /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */
574 /* sys_sched_yield() stats */
575 unsigned int yld_count;
577 /* schedule() stats */
578 unsigned int sched_switch;
579 unsigned int sched_count;
580 unsigned int sched_goidle;
582 /* try_to_wake_up() stats */
583 unsigned int ttwu_count;
584 unsigned int ttwu_local;
587 unsigned int bkl_count;
591 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues);
594 void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags)
596 rq->curr->sched_class->check_preempt_curr(rq, p, flags);
599 * A queue event has occurred, and we're going to schedule. In
600 * this case, we can save a useless back to back clock update.
602 if (test_tsk_need_resched(p))
603 rq->skip_clock_update = 1;
606 static inline int cpu_of(struct rq *rq)
615 #define rcu_dereference_check_sched_domain(p) \
616 rcu_dereference_check((p), \
617 rcu_read_lock_sched_held() || \
618 lockdep_is_held(&sched_domains_mutex))
621 * The domain tree (rq->sd) is protected by RCU's quiescent state transition.
622 * See detach_destroy_domains: synchronize_sched for details.
624 * The domain tree of any CPU may only be accessed from within
625 * preempt-disabled sections.
627 #define for_each_domain(cpu, __sd) \
628 for (__sd = rcu_dereference_check_sched_domain(cpu_rq(cpu)->sd); __sd; __sd = __sd->parent)
630 #define cpu_rq(cpu) (&per_cpu(runqueues, (cpu)))
631 #define this_rq() (&__get_cpu_var(runqueues))
632 #define task_rq(p) cpu_rq(task_cpu(p))
633 #define cpu_curr(cpu) (cpu_rq(cpu)->curr)
634 #define raw_rq() (&__raw_get_cpu_var(runqueues))
636 inline void update_rq_clock(struct rq *rq)
638 if (!rq->skip_clock_update)
639 rq->clock = sched_clock_cpu(cpu_of(rq));
643 * Tunables that become constants when CONFIG_SCHED_DEBUG is off:
645 #ifdef CONFIG_SCHED_DEBUG
646 # define const_debug __read_mostly
648 # define const_debug static const
653 * @cpu: the processor in question.
655 * Returns true if the current cpu runqueue is locked.
656 * This interface allows printk to be called with the runqueue lock
657 * held and know whether or not it is OK to wake up the klogd.
659 int runqueue_is_locked(int cpu)
661 return raw_spin_is_locked(&cpu_rq(cpu)->lock);
665 * Debugging: various feature bits
668 #define SCHED_FEAT(name, enabled) \
669 __SCHED_FEAT_##name ,
672 #include "sched_features.h"
677 #define SCHED_FEAT(name, enabled) \
678 (1UL << __SCHED_FEAT_##name) * enabled |
680 const_debug unsigned int sysctl_sched_features =
681 #include "sched_features.h"
686 #ifdef CONFIG_SCHED_DEBUG
687 #define SCHED_FEAT(name, enabled) \
690 static __read_mostly char *sched_feat_names[] = {
691 #include "sched_features.h"
697 static int sched_feat_show(struct seq_file *m, void *v)
701 for (i = 0; sched_feat_names[i]; i++) {
702 if (!(sysctl_sched_features & (1UL << i)))
704 seq_printf(m, "%s ", sched_feat_names[i]);
712 sched_feat_write(struct file *filp, const char __user *ubuf,
713 size_t cnt, loff_t *ppos)
723 if (copy_from_user(&buf, ubuf, cnt))
728 if (strncmp(buf, "NO_", 3) == 0) {
733 for (i = 0; sched_feat_names[i]; i++) {
734 int len = strlen(sched_feat_names[i]);
736 if (strncmp(cmp, sched_feat_names[i], len) == 0) {
738 sysctl_sched_features &= ~(1UL << i);
740 sysctl_sched_features |= (1UL << i);
745 if (!sched_feat_names[i])
753 static int sched_feat_open(struct inode *inode, struct file *filp)
755 return single_open(filp, sched_feat_show, NULL);
758 static const struct file_operations sched_feat_fops = {
759 .open = sched_feat_open,
760 .write = sched_feat_write,
763 .release = single_release,
766 static __init int sched_init_debug(void)
768 debugfs_create_file("sched_features", 0644, NULL, NULL,
773 late_initcall(sched_init_debug);
777 #define sched_feat(x) (sysctl_sched_features & (1UL << __SCHED_FEAT_##x))
780 * Number of tasks to iterate in a single balance run.
781 * Limited because this is done with IRQs disabled.
783 const_debug unsigned int sysctl_sched_nr_migrate = 32;
786 * ratelimit for updating the group shares.
789 unsigned int sysctl_sched_shares_ratelimit = 250000;
790 unsigned int normalized_sysctl_sched_shares_ratelimit = 250000;
793 * Inject some fuzzyness into changing the per-cpu group shares
794 * this avoids remote rq-locks at the expense of fairness.
797 unsigned int sysctl_sched_shares_thresh = 4;
800 * period over which we average the RT time consumption, measured
805 const_debug unsigned int sysctl_sched_time_avg = MSEC_PER_SEC;
808 * period over which we measure -rt task cpu usage in us.
811 unsigned int sysctl_sched_rt_period = 1000000;
813 static __read_mostly int scheduler_running;
816 * part of the period that we allow rt tasks to run in us.
819 int sysctl_sched_rt_runtime = 950000;
821 static inline u64 global_rt_period(void)
823 return (u64)sysctl_sched_rt_period * NSEC_PER_USEC;
826 static inline u64 global_rt_runtime(void)
828 if (sysctl_sched_rt_runtime < 0)
831 return (u64)sysctl_sched_rt_runtime * NSEC_PER_USEC;
834 #ifndef prepare_arch_switch
835 # define prepare_arch_switch(next) do { } while (0)
837 #ifndef finish_arch_switch
838 # define finish_arch_switch(prev) do { } while (0)
841 static inline int task_current(struct rq *rq, struct task_struct *p)
843 return rq->curr == p;
846 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
847 static inline int task_running(struct rq *rq, struct task_struct *p)
849 return task_current(rq, p);
852 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
856 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
858 #ifdef CONFIG_DEBUG_SPINLOCK
859 /* this is a valid case when another task releases the spinlock */
860 rq->lock.owner = current;
863 * If we are tracking spinlock dependencies then we have to
864 * fix up the runqueue lock - which gets 'carried over' from
867 spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_);
869 raw_spin_unlock_irq(&rq->lock);
872 #else /* __ARCH_WANT_UNLOCKED_CTXSW */
873 static inline int task_running(struct rq *rq, struct task_struct *p)
878 return task_current(rq, p);
882 static inline void prepare_lock_switch(struct rq *rq, struct task_struct *next)
886 * We can optimise this out completely for !SMP, because the
887 * SMP rebalancing from interrupt is the only thing that cares
892 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
893 raw_spin_unlock_irq(&rq->lock);
895 raw_spin_unlock(&rq->lock);
899 static inline void finish_lock_switch(struct rq *rq, struct task_struct *prev)
903 * After ->oncpu is cleared, the task can be moved to a different CPU.
904 * We must ensure this doesn't happen until the switch is completely
910 #ifndef __ARCH_WANT_INTERRUPTS_ON_CTXSW
914 #endif /* __ARCH_WANT_UNLOCKED_CTXSW */
917 * Check whether the task is waking, we use this to synchronize against
918 * ttwu() so that task_cpu() reports a stable number.
920 * We need to make an exception for PF_STARTING tasks because the fork
921 * path might require task_rq_lock() to work, eg. it can call
922 * set_cpus_allowed_ptr() from the cpuset clone_ns code.
924 static inline int task_is_waking(struct task_struct *p)
926 return unlikely((p->state == TASK_WAKING) && !(p->flags & PF_STARTING));
930 * __task_rq_lock - lock the runqueue a given task resides on.
931 * Must be called interrupts disabled.
933 static inline struct rq *__task_rq_lock(struct task_struct *p)
939 while (task_is_waking(p))
942 raw_spin_lock(&rq->lock);
943 if (likely(rq == task_rq(p) && !task_is_waking(p)))
945 raw_spin_unlock(&rq->lock);
950 * task_rq_lock - lock the runqueue a given task resides on and disable
951 * interrupts. Note the ordering: we can safely lookup the task_rq without
952 * explicitly disabling preemption.
954 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
960 while (task_is_waking(p))
962 local_irq_save(*flags);
964 raw_spin_lock(&rq->lock);
965 if (likely(rq == task_rq(p) && !task_is_waking(p)))
967 raw_spin_unlock_irqrestore(&rq->lock, *flags);
971 void task_rq_unlock_wait(struct task_struct *p)
973 struct rq *rq = task_rq(p);
975 smp_mb(); /* spin-unlock-wait is not a full memory barrier */
976 raw_spin_unlock_wait(&rq->lock);
979 static void __task_rq_unlock(struct rq *rq)
982 raw_spin_unlock(&rq->lock);
985 static inline void task_rq_unlock(struct rq *rq, unsigned long *flags)
988 raw_spin_unlock_irqrestore(&rq->lock, *flags);
992 * this_rq_lock - lock this runqueue and disable interrupts.
994 static struct rq *this_rq_lock(void)
1001 raw_spin_lock(&rq->lock);
1006 #ifdef CONFIG_SCHED_HRTICK
1008 * Use HR-timers to deliver accurate preemption points.
1010 * Its all a bit involved since we cannot program an hrt while holding the
1011 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1014 * When we get rescheduled we reprogram the hrtick_timer outside of the
1020 * - enabled by features
1021 * - hrtimer is actually high res
1023 static inline int hrtick_enabled(struct rq *rq)
1025 if (!sched_feat(HRTICK))
1027 if (!cpu_active(cpu_of(rq)))
1029 return hrtimer_is_hres_active(&rq->hrtick_timer);
1032 static void hrtick_clear(struct rq *rq)
1034 if (hrtimer_active(&rq->hrtick_timer))
1035 hrtimer_cancel(&rq->hrtick_timer);
1039 * High-resolution timer tick.
1040 * Runs from hardirq context with interrupts disabled.
1042 static enum hrtimer_restart hrtick(struct hrtimer *timer)
1044 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
1046 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
1048 raw_spin_lock(&rq->lock);
1049 update_rq_clock(rq);
1050 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
1051 raw_spin_unlock(&rq->lock);
1053 return HRTIMER_NORESTART;
1058 * called from hardirq (IPI) context
1060 static void __hrtick_start(void *arg)
1062 struct rq *rq = arg;
1064 raw_spin_lock(&rq->lock);
1065 hrtimer_restart(&rq->hrtick_timer);
1066 rq->hrtick_csd_pending = 0;
1067 raw_spin_unlock(&rq->lock);
1071 * Called to set the hrtick timer state.
1073 * called with rq->lock held and irqs disabled
1075 static void hrtick_start(struct rq *rq, u64 delay)
1077 struct hrtimer *timer = &rq->hrtick_timer;
1078 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
1080 hrtimer_set_expires(timer, time);
1082 if (rq == this_rq()) {
1083 hrtimer_restart(timer);
1084 } else if (!rq->hrtick_csd_pending) {
1085 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0);
1086 rq->hrtick_csd_pending = 1;
1091 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
1093 int cpu = (int)(long)hcpu;
1096 case CPU_UP_CANCELED:
1097 case CPU_UP_CANCELED_FROZEN:
1098 case CPU_DOWN_PREPARE:
1099 case CPU_DOWN_PREPARE_FROZEN:
1101 case CPU_DEAD_FROZEN:
1102 hrtick_clear(cpu_rq(cpu));
1109 static __init void init_hrtick(void)
1111 hotcpu_notifier(hotplug_hrtick, 0);
1115 * Called to set the hrtick timer state.
1117 * called with rq->lock held and irqs disabled
1119 static void hrtick_start(struct rq *rq, u64 delay)
1121 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
1122 HRTIMER_MODE_REL_PINNED, 0);
1125 static inline void init_hrtick(void)
1128 #endif /* CONFIG_SMP */
1130 static void init_rq_hrtick(struct rq *rq)
1133 rq->hrtick_csd_pending = 0;
1135 rq->hrtick_csd.flags = 0;
1136 rq->hrtick_csd.func = __hrtick_start;
1137 rq->hrtick_csd.info = rq;
1140 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1141 rq->hrtick_timer.function = hrtick;
1143 #else /* CONFIG_SCHED_HRTICK */
1144 static inline void hrtick_clear(struct rq *rq)
1148 static inline void init_rq_hrtick(struct rq *rq)
1152 static inline void init_hrtick(void)
1155 #endif /* CONFIG_SCHED_HRTICK */
1158 * resched_task - mark a task 'to be rescheduled now'.
1160 * On UP this means the setting of the need_resched flag, on SMP it
1161 * might also involve a cross-CPU call to trigger the scheduler on
1166 #ifndef tsk_is_polling
1167 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1170 static void resched_task(struct task_struct *p)
1174 assert_raw_spin_locked(&task_rq(p)->lock);
1176 if (test_tsk_need_resched(p))
1179 set_tsk_need_resched(p);
1182 if (cpu == smp_processor_id())
1185 /* NEED_RESCHED must be visible before we test polling */
1187 if (!tsk_is_polling(p))
1188 smp_send_reschedule(cpu);
1191 static void resched_cpu(int cpu)
1193 struct rq *rq = cpu_rq(cpu);
1194 unsigned long flags;
1196 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
1198 resched_task(cpu_curr(cpu));
1199 raw_spin_unlock_irqrestore(&rq->lock, flags);
1204 * When add_timer_on() enqueues a timer into the timer wheel of an
1205 * idle CPU then this timer might expire before the next timer event
1206 * which is scheduled to wake up that CPU. In case of a completely
1207 * idle system the next event might even be infinite time into the
1208 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1209 * leaves the inner idle loop so the newly added timer is taken into
1210 * account when the CPU goes back to idle and evaluates the timer
1211 * wheel for the next timer event.
1213 void wake_up_idle_cpu(int cpu)
1215 struct rq *rq = cpu_rq(cpu);
1217 if (cpu == smp_processor_id())
1221 * This is safe, as this function is called with the timer
1222 * wheel base lock of (cpu) held. When the CPU is on the way
1223 * to idle and has not yet set rq->curr to idle then it will
1224 * be serialized on the timer wheel base lock and take the new
1225 * timer into account automatically.
1227 if (rq->curr != rq->idle)
1231 * We can set TIF_RESCHED on the idle task of the other CPU
1232 * lockless. The worst case is that the other CPU runs the
1233 * idle task through an additional NOOP schedule()
1235 set_tsk_need_resched(rq->idle);
1237 /* NEED_RESCHED must be visible before we test polling */
1239 if (!tsk_is_polling(rq->idle))
1240 smp_send_reschedule(cpu);
1243 int nohz_ratelimit(int cpu)
1245 struct rq *rq = cpu_rq(cpu);
1246 u64 diff = rq->clock - rq->nohz_stamp;
1248 rq->nohz_stamp = rq->clock;
1250 return diff < (NSEC_PER_SEC / HZ) >> 1;
1253 #endif /* CONFIG_NO_HZ */
1255 static u64 sched_avg_period(void)
1257 return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2;
1260 static void sched_avg_update(struct rq *rq)
1262 s64 period = sched_avg_period();
1264 while ((s64)(rq->clock - rq->age_stamp) > period) {
1265 rq->age_stamp += period;
1270 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1272 rq->rt_avg += rt_delta;
1273 sched_avg_update(rq);
1276 #else /* !CONFIG_SMP */
1277 static void resched_task(struct task_struct *p)
1279 assert_raw_spin_locked(&task_rq(p)->lock);
1280 set_tsk_need_resched(p);
1283 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1286 #endif /* CONFIG_SMP */
1288 #if BITS_PER_LONG == 32
1289 # define WMULT_CONST (~0UL)
1291 # define WMULT_CONST (1UL << 32)
1294 #define WMULT_SHIFT 32
1297 * Shift right and round:
1299 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1302 * delta *= weight / lw
1304 static unsigned long
1305 calc_delta_mine(unsigned long delta_exec, unsigned long weight,
1306 struct load_weight *lw)
1310 if (!lw->inv_weight) {
1311 if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST))
1314 lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2)
1318 tmp = (u64)delta_exec * weight;
1320 * Check whether we'd overflow the 64-bit multiplication:
1322 if (unlikely(tmp > WMULT_CONST))
1323 tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight,
1326 tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT);
1328 return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX);
1331 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
1337 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
1344 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1345 * of tasks with abnormal "nice" values across CPUs the contribution that
1346 * each task makes to its run queue's load is weighted according to its
1347 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1348 * scaled version of the new time slice allocation that they receive on time
1352 #define WEIGHT_IDLEPRIO 3
1353 #define WMULT_IDLEPRIO 1431655765
1356 * Nice levels are multiplicative, with a gentle 10% change for every
1357 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1358 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1359 * that remained on nice 0.
1361 * The "10% effect" is relative and cumulative: from _any_ nice level,
1362 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1363 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1364 * If a task goes up by ~10% and another task goes down by ~10% then
1365 * the relative distance between them is ~25%.)
1367 static const int prio_to_weight[40] = {
1368 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1369 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1370 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1371 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1372 /* 0 */ 1024, 820, 655, 526, 423,
1373 /* 5 */ 335, 272, 215, 172, 137,
1374 /* 10 */ 110, 87, 70, 56, 45,
1375 /* 15 */ 36, 29, 23, 18, 15,
1379 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1381 * In cases where the weight does not change often, we can use the
1382 * precalculated inverse to speed up arithmetics by turning divisions
1383 * into multiplications:
1385 static const u32 prio_to_wmult[40] = {
1386 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1387 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1388 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1389 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1390 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1391 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1392 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1393 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1396 /* Time spent by the tasks of the cpu accounting group executing in ... */
1397 enum cpuacct_stat_index {
1398 CPUACCT_STAT_USER, /* ... user mode */
1399 CPUACCT_STAT_SYSTEM, /* ... kernel mode */
1401 CPUACCT_STAT_NSTATS,
1404 #ifdef CONFIG_CGROUP_CPUACCT
1405 static void cpuacct_charge(struct task_struct *tsk, u64 cputime);
1406 static void cpuacct_update_stats(struct task_struct *tsk,
1407 enum cpuacct_stat_index idx, cputime_t val);
1409 static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {}
1410 static inline void cpuacct_update_stats(struct task_struct *tsk,
1411 enum cpuacct_stat_index idx, cputime_t val) {}
1414 static inline void inc_cpu_load(struct rq *rq, unsigned long load)
1416 update_load_add(&rq->load, load);
1419 static inline void dec_cpu_load(struct rq *rq, unsigned long load)
1421 update_load_sub(&rq->load, load);
1424 #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED)
1425 typedef int (*tg_visitor)(struct task_group *, void *);
1428 * Iterate the full tree, calling @down when first entering a node and @up when
1429 * leaving it for the final time.
1431 static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
1433 struct task_group *parent, *child;
1437 parent = &root_task_group;
1439 ret = (*down)(parent, data);
1442 list_for_each_entry_rcu(child, &parent->children, siblings) {
1449 ret = (*up)(parent, data);
1454 parent = parent->parent;
1463 static int tg_nop(struct task_group *tg, void *data)
1470 /* Used instead of source_load when we know the type == 0 */
1471 static unsigned long weighted_cpuload(const int cpu)
1473 return cpu_rq(cpu)->load.weight;
1477 * Return a low guess at the load of a migration-source cpu weighted
1478 * according to the scheduling class and "nice" value.
1480 * We want to under-estimate the load of migration sources, to
1481 * balance conservatively.
1483 static unsigned long source_load(int cpu, int type)
1485 struct rq *rq = cpu_rq(cpu);
1486 unsigned long total = weighted_cpuload(cpu);
1488 if (type == 0 || !sched_feat(LB_BIAS))
1491 return min(rq->cpu_load[type-1], total);
1495 * Return a high guess at the load of a migration-target cpu weighted
1496 * according to the scheduling class and "nice" value.
1498 static unsigned long target_load(int cpu, int type)
1500 struct rq *rq = cpu_rq(cpu);
1501 unsigned long total = weighted_cpuload(cpu);
1503 if (type == 0 || !sched_feat(LB_BIAS))
1506 return max(rq->cpu_load[type-1], total);
1509 static struct sched_group *group_of(int cpu)
1511 struct sched_domain *sd = rcu_dereference_sched(cpu_rq(cpu)->sd);
1519 static unsigned long power_of(int cpu)
1521 struct sched_group *group = group_of(cpu);
1524 return SCHED_LOAD_SCALE;
1526 return group->cpu_power;
1529 static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd);
1531 static unsigned long cpu_avg_load_per_task(int cpu)
1533 struct rq *rq = cpu_rq(cpu);
1534 unsigned long nr_running = ACCESS_ONCE(rq->nr_running);
1537 rq->avg_load_per_task = rq->load.weight / nr_running;
1539 rq->avg_load_per_task = 0;
1541 return rq->avg_load_per_task;
1544 #ifdef CONFIG_FAIR_GROUP_SCHED
1546 static __read_mostly unsigned long *update_shares_data;
1548 static void __set_se_shares(struct sched_entity *se, unsigned long shares);
1551 * Calculate and set the cpu's group shares.
1553 static void update_group_shares_cpu(struct task_group *tg, int cpu,
1554 unsigned long sd_shares,
1555 unsigned long sd_rq_weight,
1556 unsigned long *usd_rq_weight)
1558 unsigned long shares, rq_weight;
1561 rq_weight = usd_rq_weight[cpu];
1564 rq_weight = NICE_0_LOAD;
1568 * \Sum_j shares_j * rq_weight_i
1569 * shares_i = -----------------------------
1570 * \Sum_j rq_weight_j
1572 shares = (sd_shares * rq_weight) / sd_rq_weight;
1573 shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES);
1575 if (abs(shares - tg->se[cpu]->load.weight) >
1576 sysctl_sched_shares_thresh) {
1577 struct rq *rq = cpu_rq(cpu);
1578 unsigned long flags;
1580 raw_spin_lock_irqsave(&rq->lock, flags);
1581 tg->cfs_rq[cpu]->rq_weight = boost ? 0 : rq_weight;
1582 tg->cfs_rq[cpu]->shares = boost ? 0 : shares;
1583 __set_se_shares(tg->se[cpu], shares);
1584 raw_spin_unlock_irqrestore(&rq->lock, flags);
1589 * Re-compute the task group their per cpu shares over the given domain.
1590 * This needs to be done in a bottom-up fashion because the rq weight of a
1591 * parent group depends on the shares of its child groups.
1593 static int tg_shares_up(struct task_group *tg, void *data)
1595 unsigned long weight, rq_weight = 0, sum_weight = 0, shares = 0;
1596 unsigned long *usd_rq_weight;
1597 struct sched_domain *sd = data;
1598 unsigned long flags;
1604 local_irq_save(flags);
1605 usd_rq_weight = per_cpu_ptr(update_shares_data, smp_processor_id());
1607 for_each_cpu(i, sched_domain_span(sd)) {
1608 weight = tg->cfs_rq[i]->load.weight;
1609 usd_rq_weight[i] = weight;
1611 rq_weight += weight;
1613 * If there are currently no tasks on the cpu pretend there
1614 * is one of average load so that when a new task gets to
1615 * run here it will not get delayed by group starvation.
1618 weight = NICE_0_LOAD;
1620 sum_weight += weight;
1621 shares += tg->cfs_rq[i]->shares;
1625 rq_weight = sum_weight;
1627 if ((!shares && rq_weight) || shares > tg->shares)
1628 shares = tg->shares;
1630 if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE))
1631 shares = tg->shares;
1633 for_each_cpu(i, sched_domain_span(sd))
1634 update_group_shares_cpu(tg, i, shares, rq_weight, usd_rq_weight);
1636 local_irq_restore(flags);
1642 * Compute the cpu's hierarchical load factor for each task group.
1643 * This needs to be done in a top-down fashion because the load of a child
1644 * group is a fraction of its parents load.
1646 static int tg_load_down(struct task_group *tg, void *data)
1649 long cpu = (long)data;
1652 load = cpu_rq(cpu)->load.weight;
1654 load = tg->parent->cfs_rq[cpu]->h_load;
1655 load *= tg->cfs_rq[cpu]->shares;
1656 load /= tg->parent->cfs_rq[cpu]->load.weight + 1;
1659 tg->cfs_rq[cpu]->h_load = load;
1664 static void update_shares(struct sched_domain *sd)
1669 if (root_task_group_empty())
1672 now = cpu_clock(raw_smp_processor_id());
1673 elapsed = now - sd->last_update;
1675 if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) {
1676 sd->last_update = now;
1677 walk_tg_tree(tg_nop, tg_shares_up, sd);
1681 static void update_h_load(long cpu)
1683 if (root_task_group_empty())
1686 walk_tg_tree(tg_load_down, tg_nop, (void *)cpu);
1691 static inline void update_shares(struct sched_domain *sd)
1697 #ifdef CONFIG_PREEMPT
1699 static void double_rq_lock(struct rq *rq1, struct rq *rq2);
1702 * fair double_lock_balance: Safely acquires both rq->locks in a fair
1703 * way at the expense of forcing extra atomic operations in all
1704 * invocations. This assures that the double_lock is acquired using the
1705 * same underlying policy as the spinlock_t on this architecture, which
1706 * reduces latency compared to the unfair variant below. However, it
1707 * also adds more overhead and therefore may reduce throughput.
1709 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1710 __releases(this_rq->lock)
1711 __acquires(busiest->lock)
1712 __acquires(this_rq->lock)
1714 raw_spin_unlock(&this_rq->lock);
1715 double_rq_lock(this_rq, busiest);
1722 * Unfair double_lock_balance: Optimizes throughput at the expense of
1723 * latency by eliminating extra atomic operations when the locks are
1724 * already in proper order on entry. This favors lower cpu-ids and will
1725 * grant the double lock to lower cpus over higher ids under contention,
1726 * regardless of entry order into the function.
1728 static int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1729 __releases(this_rq->lock)
1730 __acquires(busiest->lock)
1731 __acquires(this_rq->lock)
1735 if (unlikely(!raw_spin_trylock(&busiest->lock))) {
1736 if (busiest < this_rq) {
1737 raw_spin_unlock(&this_rq->lock);
1738 raw_spin_lock(&busiest->lock);
1739 raw_spin_lock_nested(&this_rq->lock,
1740 SINGLE_DEPTH_NESTING);
1743 raw_spin_lock_nested(&busiest->lock,
1744 SINGLE_DEPTH_NESTING);
1749 #endif /* CONFIG_PREEMPT */
1752 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
1754 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
1756 if (unlikely(!irqs_disabled())) {
1757 /* printk() doesn't work good under rq->lock */
1758 raw_spin_unlock(&this_rq->lock);
1762 return _double_lock_balance(this_rq, busiest);
1765 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
1766 __releases(busiest->lock)
1768 raw_spin_unlock(&busiest->lock);
1769 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
1773 * double_rq_lock - safely lock two runqueues
1775 * Note this does not disable interrupts like task_rq_lock,
1776 * you need to do so manually before calling.
1778 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
1779 __acquires(rq1->lock)
1780 __acquires(rq2->lock)
1782 BUG_ON(!irqs_disabled());
1784 raw_spin_lock(&rq1->lock);
1785 __acquire(rq2->lock); /* Fake it out ;) */
1788 raw_spin_lock(&rq1->lock);
1789 raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
1791 raw_spin_lock(&rq2->lock);
1792 raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
1798 * double_rq_unlock - safely unlock two runqueues
1800 * Note this does not restore interrupts like task_rq_unlock,
1801 * you need to do so manually after calling.
1803 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
1804 __releases(rq1->lock)
1805 __releases(rq2->lock)
1807 raw_spin_unlock(&rq1->lock);
1809 raw_spin_unlock(&rq2->lock);
1811 __release(rq2->lock);
1816 #ifdef CONFIG_FAIR_GROUP_SCHED
1817 static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares)
1820 cfs_rq->shares = shares;
1825 static void calc_load_account_active(struct rq *this_rq);
1826 static void update_sysctl(void);
1827 static int get_update_sysctl_factor(void);
1829 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1831 set_task_rq(p, cpu);
1834 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1835 * successfuly executed on another CPU. We must ensure that updates of
1836 * per-task data have been completed by this moment.
1839 task_thread_info(p)->cpu = cpu;
1843 static const struct sched_class rt_sched_class;
1845 #define sched_class_highest (&rt_sched_class)
1846 #define for_each_class(class) \
1847 for (class = sched_class_highest; class; class = class->next)
1849 #include "sched_stats.h"
1851 static void inc_nr_running(struct rq *rq)
1856 static void dec_nr_running(struct rq *rq)
1861 static void set_load_weight(struct task_struct *p)
1863 if (task_has_rt_policy(p)) {
1864 p->se.load.weight = prio_to_weight[0] * 2;
1865 p->se.load.inv_weight = prio_to_wmult[0] >> 1;
1870 * SCHED_IDLE tasks get minimal weight:
1872 if (p->policy == SCHED_IDLE) {
1873 p->se.load.weight = WEIGHT_IDLEPRIO;
1874 p->se.load.inv_weight = WMULT_IDLEPRIO;
1878 p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO];
1879 p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO];
1882 static void update_avg(u64 *avg, u64 sample)
1884 s64 diff = sample - *avg;
1889 enqueue_task(struct rq *rq, struct task_struct *p, int wakeup, bool head)
1891 update_rq_clock(rq);
1892 sched_info_queued(p);
1893 p->sched_class->enqueue_task(rq, p, wakeup, head);
1897 static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep)
1899 update_rq_clock(rq);
1900 sched_info_dequeued(p);
1901 p->sched_class->dequeue_task(rq, p, sleep);
1906 * activate_task - move a task to the runqueue.
1908 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup)
1910 if (task_contributes_to_load(p))
1911 rq->nr_uninterruptible--;
1913 enqueue_task(rq, p, wakeup, false);
1918 * deactivate_task - remove a task from the runqueue.
1920 static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep)
1922 if (task_contributes_to_load(p))
1923 rq->nr_uninterruptible++;
1925 dequeue_task(rq, p, sleep);
1929 #include "sched_idletask.c"
1930 #include "sched_fair.c"
1931 #include "sched_rt.c"
1932 #ifdef CONFIG_SCHED_DEBUG
1933 # include "sched_debug.c"
1937 * __normal_prio - return the priority that is based on the static prio
1939 static inline int __normal_prio(struct task_struct *p)
1941 return p->static_prio;
1945 * Calculate the expected normal priority: i.e. priority
1946 * without taking RT-inheritance into account. Might be
1947 * boosted by interactivity modifiers. Changes upon fork,
1948 * setprio syscalls, and whenever the interactivity
1949 * estimator recalculates.
1951 static inline int normal_prio(struct task_struct *p)
1955 if (task_has_rt_policy(p))
1956 prio = MAX_RT_PRIO-1 - p->rt_priority;
1958 prio = __normal_prio(p);
1963 * Calculate the current priority, i.e. the priority
1964 * taken into account by the scheduler. This value might
1965 * be boosted by RT tasks, or might be boosted by
1966 * interactivity modifiers. Will be RT if the task got
1967 * RT-boosted. If not then it returns p->normal_prio.
1969 static int effective_prio(struct task_struct *p)
1971 p->normal_prio = normal_prio(p);
1973 * If we are RT tasks or we were boosted to RT priority,
1974 * keep the priority unchanged. Otherwise, update priority
1975 * to the normal priority:
1977 if (!rt_prio(p->prio))
1978 return p->normal_prio;
1983 * task_curr - is this task currently executing on a CPU?
1984 * @p: the task in question.
1986 inline int task_curr(const struct task_struct *p)
1988 return cpu_curr(task_cpu(p)) == p;
1991 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1992 const struct sched_class *prev_class,
1993 int oldprio, int running)
1995 if (prev_class != p->sched_class) {
1996 if (prev_class->switched_from)
1997 prev_class->switched_from(rq, p, running);
1998 p->sched_class->switched_to(rq, p, running);
2000 p->sched_class->prio_changed(rq, p, oldprio, running);
2005 * Is this task likely cache-hot:
2008 task_hot(struct task_struct *p, u64 now, struct sched_domain *sd)
2012 if (p->sched_class != &fair_sched_class)
2016 * Buddy candidates are cache hot:
2018 if (sched_feat(CACHE_HOT_BUDDY) && this_rq()->nr_running &&
2019 (&p->se == cfs_rq_of(&p->se)->next ||
2020 &p->se == cfs_rq_of(&p->se)->last))
2023 if (sysctl_sched_migration_cost == -1)
2025 if (sysctl_sched_migration_cost == 0)
2028 delta = now - p->se.exec_start;
2030 return delta < (s64)sysctl_sched_migration_cost;
2033 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
2035 #ifdef CONFIG_SCHED_DEBUG
2037 * We should never call set_task_cpu() on a blocked task,
2038 * ttwu() will sort out the placement.
2040 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
2041 !(task_thread_info(p)->preempt_count & PREEMPT_ACTIVE));
2044 trace_sched_migrate_task(p, new_cpu);
2046 if (task_cpu(p) != new_cpu) {
2047 p->se.nr_migrations++;
2048 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, 1, NULL, 0);
2051 __set_task_cpu(p, new_cpu);
2054 struct migration_req {
2055 struct list_head list;
2057 struct task_struct *task;
2060 struct completion done;
2064 * The task's runqueue lock must be held.
2065 * Returns true if you have to wait for migration thread.
2068 migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req)
2070 struct rq *rq = task_rq(p);
2073 * If the task is not on a runqueue (and not running), then
2074 * the next wake-up will properly place the task.
2076 if (!p->se.on_rq && !task_running(rq, p))
2079 init_completion(&req->done);
2081 req->dest_cpu = dest_cpu;
2082 list_add(&req->list, &rq->migration_queue);
2088 * wait_task_context_switch - wait for a thread to complete at least one
2091 * @p must not be current.
2093 void wait_task_context_switch(struct task_struct *p)
2095 unsigned long nvcsw, nivcsw, flags;
2103 * The runqueue is assigned before the actual context
2104 * switch. We need to take the runqueue lock.
2106 * We could check initially without the lock but it is
2107 * very likely that we need to take the lock in every
2110 rq = task_rq_lock(p, &flags);
2111 running = task_running(rq, p);
2112 task_rq_unlock(rq, &flags);
2114 if (likely(!running))
2117 * The switch count is incremented before the actual
2118 * context switch. We thus wait for two switches to be
2119 * sure at least one completed.
2121 if ((p->nvcsw - nvcsw) > 1)
2123 if ((p->nivcsw - nivcsw) > 1)
2131 * wait_task_inactive - wait for a thread to unschedule.
2133 * If @match_state is nonzero, it's the @p->state value just checked and
2134 * not expected to change. If it changes, i.e. @p might have woken up,
2135 * then return zero. When we succeed in waiting for @p to be off its CPU,
2136 * we return a positive number (its total switch count). If a second call
2137 * a short while later returns the same number, the caller can be sure that
2138 * @p has remained unscheduled the whole time.
2140 * The caller must ensure that the task *will* unschedule sometime soon,
2141 * else this function might spin for a *long* time. This function can't
2142 * be called with interrupts off, or it may introduce deadlock with
2143 * smp_call_function() if an IPI is sent by the same process we are
2144 * waiting to become inactive.
2146 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2148 unsigned long flags;
2155 * We do the initial early heuristics without holding
2156 * any task-queue locks at all. We'll only try to get
2157 * the runqueue lock when things look like they will
2163 * If the task is actively running on another CPU
2164 * still, just relax and busy-wait without holding
2167 * NOTE! Since we don't hold any locks, it's not
2168 * even sure that "rq" stays as the right runqueue!
2169 * But we don't care, since "task_running()" will
2170 * return false if the runqueue has changed and p
2171 * is actually now running somewhere else!
2173 while (task_running(rq, p)) {
2174 if (match_state && unlikely(p->state != match_state))
2180 * Ok, time to look more closely! We need the rq
2181 * lock now, to be *sure*. If we're wrong, we'll
2182 * just go back and repeat.
2184 rq = task_rq_lock(p, &flags);
2185 trace_sched_wait_task(rq, p);
2186 running = task_running(rq, p);
2187 on_rq = p->se.on_rq;
2189 if (!match_state || p->state == match_state)
2190 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
2191 task_rq_unlock(rq, &flags);
2194 * If it changed from the expected state, bail out now.
2196 if (unlikely(!ncsw))
2200 * Was it really running after all now that we
2201 * checked with the proper locks actually held?
2203 * Oops. Go back and try again..
2205 if (unlikely(running)) {
2211 * It's not enough that it's not actively running,
2212 * it must be off the runqueue _entirely_, and not
2215 * So if it was still runnable (but just not actively
2216 * running right now), it's preempted, and we should
2217 * yield - it could be a while.
2219 if (unlikely(on_rq)) {
2220 schedule_timeout_uninterruptible(1);
2225 * Ahh, all good. It wasn't running, and it wasn't
2226 * runnable, which means that it will never become
2227 * running in the future either. We're all done!
2236 * kick_process - kick a running thread to enter/exit the kernel
2237 * @p: the to-be-kicked thread
2239 * Cause a process which is running on another CPU to enter
2240 * kernel-mode, without any delay. (to get signals handled.)
2242 * NOTE: this function doesnt have to take the runqueue lock,
2243 * because all it wants to ensure is that the remote task enters
2244 * the kernel. If the IPI races and the task has been migrated
2245 * to another CPU then no harm is done and the purpose has been
2248 void kick_process(struct task_struct *p)
2254 if ((cpu != smp_processor_id()) && task_curr(p))
2255 smp_send_reschedule(cpu);
2258 EXPORT_SYMBOL_GPL(kick_process);
2259 #endif /* CONFIG_SMP */
2262 * task_oncpu_function_call - call a function on the cpu on which a task runs
2263 * @p: the task to evaluate
2264 * @func: the function to be called
2265 * @info: the function call argument
2267 * Calls the function @func when the task is currently running. This might
2268 * be on the current CPU, which just calls the function directly
2270 void task_oncpu_function_call(struct task_struct *p,
2271 void (*func) (void *info), void *info)
2278 smp_call_function_single(cpu, func, info, 1);
2283 static int select_fallback_rq(int cpu, struct task_struct *p)
2286 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(cpu));
2288 /* Look for allowed, online CPU in same node. */
2289 for_each_cpu_and(dest_cpu, nodemask, cpu_active_mask)
2290 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
2293 /* Any allowed, online CPU? */
2294 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_active_mask);
2295 if (dest_cpu < nr_cpu_ids)
2298 /* No more Mr. Nice Guy. */
2299 if (dest_cpu >= nr_cpu_ids) {
2301 cpuset_cpus_allowed_locked(p, &p->cpus_allowed);
2303 dest_cpu = cpumask_any_and(cpu_active_mask, &p->cpus_allowed);
2306 * Don't tell them about moving exiting tasks or
2307 * kernel threads (both mm NULL), since they never
2310 if (p->mm && printk_ratelimit()) {
2311 printk(KERN_INFO "process %d (%s) no "
2312 "longer affine to cpu%d\n",
2313 task_pid_nr(p), p->comm, cpu);
2321 * Gets called from 3 sites (exec, fork, wakeup), since it is called without
2322 * holding rq->lock we need to ensure ->cpus_allowed is stable, this is done
2325 * exec: is unstable, retry loop
2326 * fork & wake-up: serialize ->cpus_allowed against TASK_WAKING
2329 int select_task_rq(struct task_struct *p, int sd_flags, int wake_flags)
2331 int cpu = p->sched_class->select_task_rq(p, sd_flags, wake_flags);
2334 * In order not to call set_task_cpu() on a blocking task we need
2335 * to rely on ttwu() to place the task on a valid ->cpus_allowed
2338 * Since this is common to all placement strategies, this lives here.
2340 * [ this allows ->select_task() to simply return task_cpu(p) and
2341 * not worry about this generic constraint ]
2343 if (unlikely(!cpumask_test_cpu(cpu, &p->cpus_allowed) ||
2345 cpu = select_fallback_rq(task_cpu(p), p);
2352 * try_to_wake_up - wake up a thread
2353 * @p: the to-be-woken-up thread
2354 * @state: the mask of task states that can be woken
2355 * @sync: do a synchronous wakeup?
2357 * Put it on the run-queue if it's not already there. The "current"
2358 * thread is always on the run-queue (except when the actual
2359 * re-schedule is in progress), and as such you're allowed to do
2360 * the simpler "current->state = TASK_RUNNING" to mark yourself
2361 * runnable without the overhead of this.
2363 * returns failure only if the task is already active.
2365 static int try_to_wake_up(struct task_struct *p, unsigned int state,
2368 int cpu, orig_cpu, this_cpu, success = 0;
2369 unsigned long flags;
2372 this_cpu = get_cpu();
2375 rq = task_rq_lock(p, &flags);
2376 if (!(p->state & state))
2386 if (unlikely(task_running(rq, p)))
2390 * In order to handle concurrent wakeups and release the rq->lock
2391 * we put the task in TASK_WAKING state.
2393 * First fix up the nr_uninterruptible count:
2395 if (task_contributes_to_load(p))
2396 rq->nr_uninterruptible--;
2397 p->state = TASK_WAKING;
2399 if (p->sched_class->task_waking)
2400 p->sched_class->task_waking(rq, p);
2402 __task_rq_unlock(rq);
2404 cpu = select_task_rq(p, SD_BALANCE_WAKE, wake_flags);
2405 if (cpu != orig_cpu) {
2407 * Since we migrate the task without holding any rq->lock,
2408 * we need to be careful with task_rq_lock(), since that
2409 * might end up locking an invalid rq.
2411 set_task_cpu(p, cpu);
2415 raw_spin_lock(&rq->lock);
2418 * We migrated the task without holding either rq->lock, however
2419 * since the task is not on the task list itself, nobody else
2420 * will try and migrate the task, hence the rq should match the
2421 * cpu we just moved it to.
2423 WARN_ON(task_cpu(p) != cpu);
2424 WARN_ON(p->state != TASK_WAKING);
2426 #ifdef CONFIG_SCHEDSTATS
2427 schedstat_inc(rq, ttwu_count);
2428 if (cpu == this_cpu)
2429 schedstat_inc(rq, ttwu_local);
2431 struct sched_domain *sd;
2432 for_each_domain(this_cpu, sd) {
2433 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2434 schedstat_inc(sd, ttwu_wake_remote);
2439 #endif /* CONFIG_SCHEDSTATS */
2442 #endif /* CONFIG_SMP */
2443 schedstat_inc(p, se.statistics.nr_wakeups);
2444 if (wake_flags & WF_SYNC)
2445 schedstat_inc(p, se.statistics.nr_wakeups_sync);
2446 if (orig_cpu != cpu)
2447 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
2448 if (cpu == this_cpu)
2449 schedstat_inc(p, se.statistics.nr_wakeups_local);
2451 schedstat_inc(p, se.statistics.nr_wakeups_remote);
2452 activate_task(rq, p, 1);
2456 trace_sched_wakeup(rq, p, success);
2457 check_preempt_curr(rq, p, wake_flags);
2459 p->state = TASK_RUNNING;
2461 if (p->sched_class->task_woken)
2462 p->sched_class->task_woken(rq, p);
2464 if (unlikely(rq->idle_stamp)) {
2465 u64 delta = rq->clock - rq->idle_stamp;
2466 u64 max = 2*sysctl_sched_migration_cost;
2471 update_avg(&rq->avg_idle, delta);
2476 task_rq_unlock(rq, &flags);
2483 * wake_up_process - Wake up a specific process
2484 * @p: The process to be woken up.
2486 * Attempt to wake up the nominated process and move it to the set of runnable
2487 * processes. Returns 1 if the process was woken up, 0 if it was already
2490 * It may be assumed that this function implies a write memory barrier before
2491 * changing the task state if and only if any tasks are woken up.
2493 int wake_up_process(struct task_struct *p)
2495 return try_to_wake_up(p, TASK_ALL, 0);
2497 EXPORT_SYMBOL(wake_up_process);
2499 int wake_up_state(struct task_struct *p, unsigned int state)
2501 return try_to_wake_up(p, state, 0);
2505 * Perform scheduler related setup for a newly forked process p.
2506 * p is forked by current.
2508 * __sched_fork() is basic setup used by init_idle() too:
2510 static void __sched_fork(struct task_struct *p)
2512 p->se.exec_start = 0;
2513 p->se.sum_exec_runtime = 0;
2514 p->se.prev_sum_exec_runtime = 0;
2515 p->se.nr_migrations = 0;
2517 #ifdef CONFIG_SCHEDSTATS
2518 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
2521 INIT_LIST_HEAD(&p->rt.run_list);
2523 INIT_LIST_HEAD(&p->se.group_node);
2525 #ifdef CONFIG_PREEMPT_NOTIFIERS
2526 INIT_HLIST_HEAD(&p->preempt_notifiers);
2531 * fork()/clone()-time setup:
2533 void sched_fork(struct task_struct *p, int clone_flags)
2535 int cpu = get_cpu();
2539 * We mark the process as waking here. This guarantees that
2540 * nobody will actually run it, and a signal or other external
2541 * event cannot wake it up and insert it on the runqueue either.
2543 p->state = TASK_WAKING;
2546 * Revert to default priority/policy on fork if requested.
2548 if (unlikely(p->sched_reset_on_fork)) {
2549 if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) {
2550 p->policy = SCHED_NORMAL;
2551 p->normal_prio = p->static_prio;
2554 if (PRIO_TO_NICE(p->static_prio) < 0) {
2555 p->static_prio = NICE_TO_PRIO(0);
2556 p->normal_prio = p->static_prio;
2561 * We don't need the reset flag anymore after the fork. It has
2562 * fulfilled its duty:
2564 p->sched_reset_on_fork = 0;
2568 * Make sure we do not leak PI boosting priority to the child.
2570 p->prio = current->normal_prio;
2572 if (!rt_prio(p->prio))
2573 p->sched_class = &fair_sched_class;
2575 if (p->sched_class->task_fork)
2576 p->sched_class->task_fork(p);
2578 set_task_cpu(p, cpu);
2580 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2581 if (likely(sched_info_on()))
2582 memset(&p->sched_info, 0, sizeof(p->sched_info));
2584 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2587 #ifdef CONFIG_PREEMPT
2588 /* Want to start with kernel preemption disabled. */
2589 task_thread_info(p)->preempt_count = 1;
2591 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2597 * wake_up_new_task - wake up a newly created task for the first time.
2599 * This function will do some initial scheduler statistics housekeeping
2600 * that must be done for every newly created context, then puts the task
2601 * on the runqueue and wakes it.
2603 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2605 unsigned long flags;
2607 int cpu = get_cpu();
2611 * Fork balancing, do it here and not earlier because:
2612 * - cpus_allowed can change in the fork path
2613 * - any previously selected cpu might disappear through hotplug
2615 * We still have TASK_WAKING but PF_STARTING is gone now, meaning
2616 * ->cpus_allowed is stable, we have preemption disabled, meaning
2617 * cpu_online_mask is stable.
2619 cpu = select_task_rq(p, SD_BALANCE_FORK, 0);
2620 set_task_cpu(p, cpu);
2624 * Since the task is not on the rq and we still have TASK_WAKING set
2625 * nobody else will migrate this task.
2628 raw_spin_lock_irqsave(&rq->lock, flags);
2630 BUG_ON(p->state != TASK_WAKING);
2631 p->state = TASK_RUNNING;
2632 activate_task(rq, p, 0);
2633 trace_sched_wakeup_new(rq, p, 1);
2634 check_preempt_curr(rq, p, WF_FORK);
2636 if (p->sched_class->task_woken)
2637 p->sched_class->task_woken(rq, p);
2639 task_rq_unlock(rq, &flags);
2643 #ifdef CONFIG_PREEMPT_NOTIFIERS
2646 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2647 * @notifier: notifier struct to register
2649 void preempt_notifier_register(struct preempt_notifier *notifier)
2651 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2653 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2656 * preempt_notifier_unregister - no longer interested in preemption notifications
2657 * @notifier: notifier struct to unregister
2659 * This is safe to call from within a preemption notifier.
2661 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2663 hlist_del(¬ifier->link);
2665 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2667 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2669 struct preempt_notifier *notifier;
2670 struct hlist_node *node;
2672 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2673 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2677 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2678 struct task_struct *next)
2680 struct preempt_notifier *notifier;
2681 struct hlist_node *node;
2683 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2684 notifier->ops->sched_out(notifier, next);
2687 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2689 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2694 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2695 struct task_struct *next)
2699 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2702 * prepare_task_switch - prepare to switch tasks
2703 * @rq: the runqueue preparing to switch
2704 * @prev: the current task that is being switched out
2705 * @next: the task we are going to switch to.
2707 * This is called with the rq lock held and interrupts off. It must
2708 * be paired with a subsequent finish_task_switch after the context
2711 * prepare_task_switch sets up locking and calls architecture specific
2715 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2716 struct task_struct *next)
2718 fire_sched_out_preempt_notifiers(prev, next);
2719 prepare_lock_switch(rq, next);
2720 prepare_arch_switch(next);
2724 * finish_task_switch - clean up after a task-switch
2725 * @rq: runqueue associated with task-switch
2726 * @prev: the thread we just switched away from.
2728 * finish_task_switch must be called after the context switch, paired
2729 * with a prepare_task_switch call before the context switch.
2730 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2731 * and do any other architecture-specific cleanup actions.
2733 * Note that we may have delayed dropping an mm in context_switch(). If
2734 * so, we finish that here outside of the runqueue lock. (Doing it
2735 * with the lock held can cause deadlocks; see schedule() for
2738 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2739 __releases(rq->lock)
2741 struct mm_struct *mm = rq->prev_mm;
2747 * A task struct has one reference for the use as "current".
2748 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2749 * schedule one last time. The schedule call will never return, and
2750 * the scheduled task must drop that reference.
2751 * The test for TASK_DEAD must occur while the runqueue locks are
2752 * still held, otherwise prev could be scheduled on another cpu, die
2753 * there before we look at prev->state, and then the reference would
2755 * Manfred Spraul <manfred@colorfullife.com>
2757 prev_state = prev->state;
2758 finish_arch_switch(prev);
2759 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
2760 local_irq_disable();
2761 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
2762 perf_event_task_sched_in(current);
2763 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
2765 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
2766 finish_lock_switch(rq, prev);
2768 fire_sched_in_preempt_notifiers(current);
2771 if (unlikely(prev_state == TASK_DEAD)) {
2773 * Remove function-return probe instances associated with this
2774 * task and put them back on the free list.
2776 kprobe_flush_task(prev);
2777 put_task_struct(prev);
2783 /* assumes rq->lock is held */
2784 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
2786 if (prev->sched_class->pre_schedule)
2787 prev->sched_class->pre_schedule(rq, prev);
2790 /* rq->lock is NOT held, but preemption is disabled */
2791 static inline void post_schedule(struct rq *rq)
2793 if (rq->post_schedule) {
2794 unsigned long flags;
2796 raw_spin_lock_irqsave(&rq->lock, flags);
2797 if (rq->curr->sched_class->post_schedule)
2798 rq->curr->sched_class->post_schedule(rq);
2799 raw_spin_unlock_irqrestore(&rq->lock, flags);
2801 rq->post_schedule = 0;
2807 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
2811 static inline void post_schedule(struct rq *rq)
2818 * schedule_tail - first thing a freshly forked thread must call.
2819 * @prev: the thread we just switched away from.
2821 asmlinkage void schedule_tail(struct task_struct *prev)
2822 __releases(rq->lock)
2824 struct rq *rq = this_rq();
2826 finish_task_switch(rq, prev);
2829 * FIXME: do we need to worry about rq being invalidated by the
2834 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2835 /* In this case, finish_task_switch does not reenable preemption */
2838 if (current->set_child_tid)
2839 put_user(task_pid_vnr(current), current->set_child_tid);
2843 * context_switch - switch to the new MM and the new
2844 * thread's register state.
2847 context_switch(struct rq *rq, struct task_struct *prev,
2848 struct task_struct *next)
2850 struct mm_struct *mm, *oldmm;
2852 prepare_task_switch(rq, prev, next);
2853 trace_sched_switch(rq, prev, next);
2855 oldmm = prev->active_mm;
2857 * For paravirt, this is coupled with an exit in switch_to to
2858 * combine the page table reload and the switch backend into
2861 arch_start_context_switch(prev);
2864 next->active_mm = oldmm;
2865 atomic_inc(&oldmm->mm_count);
2866 enter_lazy_tlb(oldmm, next);
2868 switch_mm(oldmm, mm, next);
2870 if (likely(!prev->mm)) {
2871 prev->active_mm = NULL;
2872 rq->prev_mm = oldmm;
2875 * Since the runqueue lock will be released by the next
2876 * task (which is an invalid locking op but in the case
2877 * of the scheduler it's an obvious special-case), so we
2878 * do an early lockdep release here:
2880 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2881 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2884 /* Here we just switch the register state and the stack. */
2885 switch_to(prev, next, prev);
2889 * this_rq must be evaluated again because prev may have moved
2890 * CPUs since it called schedule(), thus the 'rq' on its stack
2891 * frame will be invalid.
2893 finish_task_switch(this_rq(), prev);
2897 * nr_running, nr_uninterruptible and nr_context_switches:
2899 * externally visible scheduler statistics: current number of runnable
2900 * threads, current number of uninterruptible-sleeping threads, total
2901 * number of context switches performed since bootup.
2903 unsigned long nr_running(void)
2905 unsigned long i, sum = 0;
2907 for_each_online_cpu(i)
2908 sum += cpu_rq(i)->nr_running;
2913 unsigned long nr_uninterruptible(void)
2915 unsigned long i, sum = 0;
2917 for_each_possible_cpu(i)
2918 sum += cpu_rq(i)->nr_uninterruptible;
2921 * Since we read the counters lockless, it might be slightly
2922 * inaccurate. Do not allow it to go below zero though:
2924 if (unlikely((long)sum < 0))
2930 unsigned long long nr_context_switches(void)
2933 unsigned long long sum = 0;
2935 for_each_possible_cpu(i)
2936 sum += cpu_rq(i)->nr_switches;
2941 unsigned long nr_iowait(void)
2943 unsigned long i, sum = 0;
2945 for_each_possible_cpu(i)
2946 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2951 unsigned long nr_iowait_cpu(void)
2953 struct rq *this = this_rq();
2954 return atomic_read(&this->nr_iowait);
2957 unsigned long this_cpu_load(void)
2959 struct rq *this = this_rq();
2960 return this->cpu_load[0];
2964 /* Variables and functions for calc_load */
2965 static atomic_long_t calc_load_tasks;
2966 static unsigned long calc_load_update;
2967 unsigned long avenrun[3];
2968 EXPORT_SYMBOL(avenrun);
2971 * get_avenrun - get the load average array
2972 * @loads: pointer to dest load array
2973 * @offset: offset to add
2974 * @shift: shift count to shift the result left
2976 * These values are estimates at best, so no need for locking.
2978 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
2980 loads[0] = (avenrun[0] + offset) << shift;
2981 loads[1] = (avenrun[1] + offset) << shift;
2982 loads[2] = (avenrun[2] + offset) << shift;
2985 static unsigned long
2986 calc_load(unsigned long load, unsigned long exp, unsigned long active)
2989 load += active * (FIXED_1 - exp);
2990 return load >> FSHIFT;
2994 * calc_load - update the avenrun load estimates 10 ticks after the
2995 * CPUs have updated calc_load_tasks.
2997 void calc_global_load(void)
2999 unsigned long upd = calc_load_update + 10;
3002 if (time_before(jiffies, upd))
3005 active = atomic_long_read(&calc_load_tasks);
3006 active = active > 0 ? active * FIXED_1 : 0;
3008 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
3009 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
3010 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
3012 calc_load_update += LOAD_FREQ;
3016 * Either called from update_cpu_load() or from a cpu going idle
3018 static void calc_load_account_active(struct rq *this_rq)
3020 long nr_active, delta;
3022 nr_active = this_rq->nr_running;
3023 nr_active += (long) this_rq->nr_uninterruptible;
3025 if (nr_active != this_rq->calc_load_active) {
3026 delta = nr_active - this_rq->calc_load_active;
3027 this_rq->calc_load_active = nr_active;
3028 atomic_long_add(delta, &calc_load_tasks);
3033 * Update rq->cpu_load[] statistics. This function is usually called every
3034 * scheduler tick (TICK_NSEC).
3036 static void update_cpu_load(struct rq *this_rq)
3038 unsigned long this_load = this_rq->load.weight;
3041 this_rq->nr_load_updates++;
3043 /* Update our load: */
3044 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
3045 unsigned long old_load, new_load;
3047 /* scale is effectively 1 << i now, and >> i divides by scale */
3049 old_load = this_rq->cpu_load[i];
3050 new_load = this_load;
3052 * Round up the averaging division if load is increasing. This
3053 * prevents us from getting stuck on 9 if the load is 10, for
3056 if (new_load > old_load)
3057 new_load += scale-1;
3058 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
3061 if (time_after_eq(jiffies, this_rq->calc_load_update)) {
3062 this_rq->calc_load_update += LOAD_FREQ;
3063 calc_load_account_active(this_rq);
3070 * sched_exec - execve() is a valuable balancing opportunity, because at
3071 * this point the task has the smallest effective memory and cache footprint.
3073 void sched_exec(void)
3075 struct task_struct *p = current;
3076 struct migration_req req;
3077 int dest_cpu, this_cpu;
3078 unsigned long flags;
3082 this_cpu = get_cpu();
3083 dest_cpu = select_task_rq(p, SD_BALANCE_EXEC, 0);
3084 if (dest_cpu == this_cpu) {
3089 rq = task_rq_lock(p, &flags);
3093 * select_task_rq() can race against ->cpus_allowed
3095 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed)
3096 || unlikely(!cpu_active(dest_cpu))) {
3097 task_rq_unlock(rq, &flags);
3101 /* force the process onto the specified CPU */
3102 if (migrate_task(p, dest_cpu, &req)) {
3103 /* Need to wait for migration thread (might exit: take ref). */
3104 struct task_struct *mt = rq->migration_thread;
3106 get_task_struct(mt);
3107 task_rq_unlock(rq, &flags);
3108 wake_up_process(mt);
3109 put_task_struct(mt);
3110 wait_for_completion(&req.done);
3114 task_rq_unlock(rq, &flags);
3119 DEFINE_PER_CPU(struct kernel_stat, kstat);
3121 EXPORT_PER_CPU_SYMBOL(kstat);
3124 * Return any ns on the sched_clock that have not yet been accounted in
3125 * @p in case that task is currently running.
3127 * Called with task_rq_lock() held on @rq.
3129 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
3133 if (task_current(rq, p)) {
3134 update_rq_clock(rq);
3135 ns = rq->clock - p->se.exec_start;
3143 unsigned long long task_delta_exec(struct task_struct *p)
3145 unsigned long flags;
3149 rq = task_rq_lock(p, &flags);
3150 ns = do_task_delta_exec(p, rq);
3151 task_rq_unlock(rq, &flags);
3157 * Return accounted runtime for the task.
3158 * In case the task is currently running, return the runtime plus current's
3159 * pending runtime that have not been accounted yet.
3161 unsigned long long task_sched_runtime(struct task_struct *p)
3163 unsigned long flags;
3167 rq = task_rq_lock(p, &flags);
3168 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
3169 task_rq_unlock(rq, &flags);
3175 * Return sum_exec_runtime for the thread group.
3176 * In case the task is currently running, return the sum plus current's
3177 * pending runtime that have not been accounted yet.
3179 * Note that the thread group might have other running tasks as well,
3180 * so the return value not includes other pending runtime that other
3181 * running tasks might have.
3183 unsigned long long thread_group_sched_runtime(struct task_struct *p)
3185 struct task_cputime totals;
3186 unsigned long flags;
3190 rq = task_rq_lock(p, &flags);
3191 thread_group_cputime(p, &totals);
3192 ns = totals.sum_exec_runtime + do_task_delta_exec(p, rq);
3193 task_rq_unlock(rq, &flags);
3199 * Account user cpu time to a process.
3200 * @p: the process that the cpu time gets accounted to
3201 * @cputime: the cpu time spent in user space since the last update
3202 * @cputime_scaled: cputime scaled by cpu frequency
3204 void account_user_time(struct task_struct *p, cputime_t cputime,
3205 cputime_t cputime_scaled)
3207 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3210 /* Add user time to process. */
3211 p->utime = cputime_add(p->utime, cputime);
3212 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
3213 account_group_user_time(p, cputime);
3215 /* Add user time to cpustat. */
3216 tmp = cputime_to_cputime64(cputime);
3217 if (TASK_NICE(p) > 0)
3218 cpustat->nice = cputime64_add(cpustat->nice, tmp);
3220 cpustat->user = cputime64_add(cpustat->user, tmp);
3222 cpuacct_update_stats(p, CPUACCT_STAT_USER, cputime);
3223 /* Account for user time used */
3224 acct_update_integrals(p);
3228 * Account guest cpu time to a process.
3229 * @p: the process that the cpu time gets accounted to
3230 * @cputime: the cpu time spent in virtual machine since the last update
3231 * @cputime_scaled: cputime scaled by cpu frequency
3233 static void account_guest_time(struct task_struct *p, cputime_t cputime,
3234 cputime_t cputime_scaled)
3237 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3239 tmp = cputime_to_cputime64(cputime);
3241 /* Add guest time to process. */
3242 p->utime = cputime_add(p->utime, cputime);
3243 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
3244 account_group_user_time(p, cputime);
3245 p->gtime = cputime_add(p->gtime, cputime);
3247 /* Add guest time to cpustat. */
3248 if (TASK_NICE(p) > 0) {
3249 cpustat->nice = cputime64_add(cpustat->nice, tmp);
3250 cpustat->guest_nice = cputime64_add(cpustat->guest_nice, tmp);
3252 cpustat->user = cputime64_add(cpustat->user, tmp);
3253 cpustat->guest = cputime64_add(cpustat->guest, tmp);
3258 * Account system cpu time to a process.
3259 * @p: the process that the cpu time gets accounted to
3260 * @hardirq_offset: the offset to subtract from hardirq_count()
3261 * @cputime: the cpu time spent in kernel space since the last update
3262 * @cputime_scaled: cputime scaled by cpu frequency
3264 void account_system_time(struct task_struct *p, int hardirq_offset,
3265 cputime_t cputime, cputime_t cputime_scaled)
3267 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3270 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
3271 account_guest_time(p, cputime, cputime_scaled);
3275 /* Add system time to process. */
3276 p->stime = cputime_add(p->stime, cputime);
3277 p->stimescaled = cputime_add(p->stimescaled, cputime_scaled);
3278 account_group_system_time(p, cputime);
3280 /* Add system time to cpustat. */
3281 tmp = cputime_to_cputime64(cputime);
3282 if (hardirq_count() - hardirq_offset)
3283 cpustat->irq = cputime64_add(cpustat->irq, tmp);
3284 else if (softirq_count())
3285 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
3287 cpustat->system = cputime64_add(cpustat->system, tmp);
3289 cpuacct_update_stats(p, CPUACCT_STAT_SYSTEM, cputime);
3291 /* Account for system time used */
3292 acct_update_integrals(p);
3296 * Account for involuntary wait time.
3297 * @steal: the cpu time spent in involuntary wait
3299 void account_steal_time(cputime_t cputime)
3301 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3302 cputime64_t cputime64 = cputime_to_cputime64(cputime);
3304 cpustat->steal = cputime64_add(cpustat->steal, cputime64);
3308 * Account for idle time.
3309 * @cputime: the cpu time spent in idle wait
3311 void account_idle_time(cputime_t cputime)
3313 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3314 cputime64_t cputime64 = cputime_to_cputime64(cputime);
3315 struct rq *rq = this_rq();
3317 if (atomic_read(&rq->nr_iowait) > 0)
3318 cpustat->iowait = cputime64_add(cpustat->iowait, cputime64);
3320 cpustat->idle = cputime64_add(cpustat->idle, cputime64);
3323 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
3326 * Account a single tick of cpu time.
3327 * @p: the process that the cpu time gets accounted to
3328 * @user_tick: indicates if the tick is a user or a system tick
3330 void account_process_tick(struct task_struct *p, int user_tick)
3332 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
3333 struct rq *rq = this_rq();
3336 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
3337 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
3338 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
3341 account_idle_time(cputime_one_jiffy);
3345 * Account multiple ticks of steal time.
3346 * @p: the process from which the cpu time has been stolen
3347 * @ticks: number of stolen ticks
3349 void account_steal_ticks(unsigned long ticks)
3351 account_steal_time(jiffies_to_cputime(ticks));
3355 * Account multiple ticks of idle time.
3356 * @ticks: number of stolen ticks
3358 void account_idle_ticks(unsigned long ticks)
3360 account_idle_time(jiffies_to_cputime(ticks));
3366 * Use precise platform statistics if available:
3368 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
3369 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3375 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3377 struct task_cputime cputime;
3379 thread_group_cputime(p, &cputime);
3381 *ut = cputime.utime;
3382 *st = cputime.stime;
3386 #ifndef nsecs_to_cputime
3387 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
3390 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3392 cputime_t rtime, utime = p->utime, total = cputime_add(utime, p->stime);
3395 * Use CFS's precise accounting:
3397 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
3402 temp = (u64)(rtime * utime);
3403 do_div(temp, total);
3404 utime = (cputime_t)temp;
3409 * Compare with previous values, to keep monotonicity:
3411 p->prev_utime = max(p->prev_utime, utime);
3412 p->prev_stime = max(p->prev_stime, cputime_sub(rtime, p->prev_utime));
3414 *ut = p->prev_utime;
3415 *st = p->prev_stime;
3419 * Must be called with siglock held.
3421 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3423 struct signal_struct *sig = p->signal;
3424 struct task_cputime cputime;
3425 cputime_t rtime, utime, total;
3427 thread_group_cputime(p, &cputime);
3429 total = cputime_add(cputime.utime, cputime.stime);
3430 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
3435 temp = (u64)(rtime * cputime.utime);
3436 do_div(temp, total);
3437 utime = (cputime_t)temp;
3441 sig->prev_utime = max(sig->prev_utime, utime);
3442 sig->prev_stime = max(sig->prev_stime,
3443 cputime_sub(rtime, sig->prev_utime));
3445 *ut = sig->prev_utime;
3446 *st = sig->prev_stime;
3451 * This function gets called by the timer code, with HZ frequency.
3452 * We call it with interrupts disabled.
3454 * It also gets called by the fork code, when changing the parent's
3457 void scheduler_tick(void)
3459 int cpu = smp_processor_id();
3460 struct rq *rq = cpu_rq(cpu);
3461 struct task_struct *curr = rq->curr;
3465 raw_spin_lock(&rq->lock);
3466 update_rq_clock(rq);
3467 update_cpu_load(rq);
3468 curr->sched_class->task_tick(rq, curr, 0);
3469 raw_spin_unlock(&rq->lock);
3471 perf_event_task_tick(curr);
3474 rq->idle_at_tick = idle_cpu(cpu);
3475 trigger_load_balance(rq, cpu);
3479 notrace unsigned long get_parent_ip(unsigned long addr)
3481 if (in_lock_functions(addr)) {
3482 addr = CALLER_ADDR2;
3483 if (in_lock_functions(addr))
3484 addr = CALLER_ADDR3;
3489 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
3490 defined(CONFIG_PREEMPT_TRACER))
3492 void __kprobes add_preempt_count(int val)
3494 #ifdef CONFIG_DEBUG_PREEMPT
3498 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3501 preempt_count() += val;
3502 #ifdef CONFIG_DEBUG_PREEMPT
3504 * Spinlock count overflowing soon?
3506 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
3509 if (preempt_count() == val)
3510 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3512 EXPORT_SYMBOL(add_preempt_count);
3514 void __kprobes sub_preempt_count(int val)
3516 #ifdef CONFIG_DEBUG_PREEMPT
3520 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
3523 * Is the spinlock portion underflowing?
3525 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
3526 !(preempt_count() & PREEMPT_MASK)))
3530 if (preempt_count() == val)
3531 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3532 preempt_count() -= val;
3534 EXPORT_SYMBOL(sub_preempt_count);
3539 * Print scheduling while atomic bug:
3541 static noinline void __schedule_bug(struct task_struct *prev)
3543 struct pt_regs *regs = get_irq_regs();
3545 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
3546 prev->comm, prev->pid, preempt_count());
3548 debug_show_held_locks(prev);
3550 if (irqs_disabled())
3551 print_irqtrace_events(prev);
3560 * Various schedule()-time debugging checks and statistics:
3562 static inline void schedule_debug(struct task_struct *prev)
3565 * Test if we are atomic. Since do_exit() needs to call into
3566 * schedule() atomically, we ignore that path for now.
3567 * Otherwise, whine if we are scheduling when we should not be.
3569 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
3570 __schedule_bug(prev);
3572 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
3574 schedstat_inc(this_rq(), sched_count);
3575 #ifdef CONFIG_SCHEDSTATS
3576 if (unlikely(prev->lock_depth >= 0)) {
3577 schedstat_inc(this_rq(), bkl_count);
3578 schedstat_inc(prev, sched_info.bkl_count);
3583 static void put_prev_task(struct rq *rq, struct task_struct *prev)
3586 update_rq_clock(rq);
3587 rq->skip_clock_update = 0;
3588 prev->sched_class->put_prev_task(rq, prev);
3592 * Pick up the highest-prio task:
3594 static inline struct task_struct *
3595 pick_next_task(struct rq *rq)
3597 const struct sched_class *class;
3598 struct task_struct *p;
3601 * Optimization: we know that if all tasks are in
3602 * the fair class we can call that function directly:
3604 if (likely(rq->nr_running == rq->cfs.nr_running)) {
3605 p = fair_sched_class.pick_next_task(rq);
3610 class = sched_class_highest;
3612 p = class->pick_next_task(rq);
3616 * Will never be NULL as the idle class always
3617 * returns a non-NULL p:
3619 class = class->next;
3624 * schedule() is the main scheduler function.
3626 asmlinkage void __sched schedule(void)
3628 struct task_struct *prev, *next;
3629 unsigned long *switch_count;
3635 cpu = smp_processor_id();
3639 switch_count = &prev->nivcsw;
3641 release_kernel_lock(prev);
3642 need_resched_nonpreemptible:
3644 schedule_debug(prev);
3646 if (sched_feat(HRTICK))
3649 raw_spin_lock_irq(&rq->lock);
3650 clear_tsk_need_resched(prev);
3652 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
3653 if (unlikely(signal_pending_state(prev->state, prev)))
3654 prev->state = TASK_RUNNING;
3656 deactivate_task(rq, prev, 1);
3657 switch_count = &prev->nvcsw;
3660 pre_schedule(rq, prev);
3662 if (unlikely(!rq->nr_running))
3663 idle_balance(cpu, rq);
3665 put_prev_task(rq, prev);
3666 next = pick_next_task(rq);
3668 if (likely(prev != next)) {
3669 sched_info_switch(prev, next);
3670 perf_event_task_sched_out(prev, next);
3676 context_switch(rq, prev, next); /* unlocks the rq */
3678 * the context switch might have flipped the stack from under
3679 * us, hence refresh the local variables.
3681 cpu = smp_processor_id();
3684 raw_spin_unlock_irq(&rq->lock);
3688 if (unlikely(reacquire_kernel_lock(current) < 0)) {
3690 switch_count = &prev->nivcsw;
3691 goto need_resched_nonpreemptible;
3694 preempt_enable_no_resched();
3698 EXPORT_SYMBOL(schedule);
3700 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
3702 * Look out! "owner" is an entirely speculative pointer
3703 * access and not reliable.
3705 int mutex_spin_on_owner(struct mutex *lock, struct thread_info *owner)
3710 if (!sched_feat(OWNER_SPIN))
3713 #ifdef CONFIG_DEBUG_PAGEALLOC
3715 * Need to access the cpu field knowing that
3716 * DEBUG_PAGEALLOC could have unmapped it if
3717 * the mutex owner just released it and exited.
3719 if (probe_kernel_address(&owner->cpu, cpu))
3726 * Even if the access succeeded (likely case),
3727 * the cpu field may no longer be valid.
3729 if (cpu >= nr_cpumask_bits)
3733 * We need to validate that we can do a
3734 * get_cpu() and that we have the percpu area.
3736 if (!cpu_online(cpu))
3743 * Owner changed, break to re-assess state.
3745 if (lock->owner != owner)
3749 * Is that owner really running on that cpu?
3751 if (task_thread_info(rq->curr) != owner || need_resched())
3761 #ifdef CONFIG_PREEMPT
3763 * this is the entry point to schedule() from in-kernel preemption
3764 * off of preempt_enable. Kernel preemptions off return from interrupt
3765 * occur there and call schedule directly.
3767 asmlinkage void __sched preempt_schedule(void)
3769 struct thread_info *ti = current_thread_info();
3772 * If there is a non-zero preempt_count or interrupts are disabled,
3773 * we do not want to preempt the current task. Just return..
3775 if (likely(ti->preempt_count || irqs_disabled()))
3779 add_preempt_count(PREEMPT_ACTIVE);
3781 sub_preempt_count(PREEMPT_ACTIVE);
3784 * Check again in case we missed a preemption opportunity
3785 * between schedule and now.
3788 } while (need_resched());
3790 EXPORT_SYMBOL(preempt_schedule);
3793 * this is the entry point to schedule() from kernel preemption
3794 * off of irq context.
3795 * Note, that this is called and return with irqs disabled. This will
3796 * protect us against recursive calling from irq.
3798 asmlinkage void __sched preempt_schedule_irq(void)
3800 struct thread_info *ti = current_thread_info();
3802 /* Catch callers which need to be fixed */
3803 BUG_ON(ti->preempt_count || !irqs_disabled());
3806 add_preempt_count(PREEMPT_ACTIVE);
3809 local_irq_disable();
3810 sub_preempt_count(PREEMPT_ACTIVE);
3813 * Check again in case we missed a preemption opportunity
3814 * between schedule and now.
3817 } while (need_resched());
3820 #endif /* CONFIG_PREEMPT */
3822 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3825 return try_to_wake_up(curr->private, mode, wake_flags);
3827 EXPORT_SYMBOL(default_wake_function);
3830 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
3831 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
3832 * number) then we wake all the non-exclusive tasks and one exclusive task.
3834 * There are circumstances in which we can try to wake a task which has already
3835 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
3836 * zero in this (rare) case, and we handle it by continuing to scan the queue.
3838 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
3839 int nr_exclusive, int wake_flags, void *key)
3841 wait_queue_t *curr, *next;
3843 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
3844 unsigned flags = curr->flags;
3846 if (curr->func(curr, mode, wake_flags, key) &&
3847 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
3853 * __wake_up - wake up threads blocked on a waitqueue.
3855 * @mode: which threads
3856 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3857 * @key: is directly passed to the wakeup function
3859 * It may be assumed that this function implies a write memory barrier before
3860 * changing the task state if and only if any tasks are woken up.
3862 void __wake_up(wait_queue_head_t *q, unsigned int mode,
3863 int nr_exclusive, void *key)
3865 unsigned long flags;
3867 spin_lock_irqsave(&q->lock, flags);
3868 __wake_up_common(q, mode, nr_exclusive, 0, key);
3869 spin_unlock_irqrestore(&q->lock, flags);
3871 EXPORT_SYMBOL(__wake_up);
3874 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
3876 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
3878 __wake_up_common(q, mode, 1, 0, NULL);
3881 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
3883 __wake_up_common(q, mode, 1, 0, key);
3887 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
3889 * @mode: which threads
3890 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3891 * @key: opaque value to be passed to wakeup targets
3893 * The sync wakeup differs that the waker knows that it will schedule
3894 * away soon, so while the target thread will be woken up, it will not
3895 * be migrated to another CPU - ie. the two threads are 'synchronized'
3896 * with each other. This can prevent needless bouncing between CPUs.
3898 * On UP it can prevent extra preemption.
3900 * It may be assumed that this function implies a write memory barrier before
3901 * changing the task state if and only if any tasks are woken up.
3903 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
3904 int nr_exclusive, void *key)
3906 unsigned long flags;
3907 int wake_flags = WF_SYNC;
3912 if (unlikely(!nr_exclusive))
3915 spin_lock_irqsave(&q->lock, flags);
3916 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
3917 spin_unlock_irqrestore(&q->lock, flags);
3919 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
3922 * __wake_up_sync - see __wake_up_sync_key()
3924 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
3926 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
3928 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
3931 * complete: - signals a single thread waiting on this completion
3932 * @x: holds the state of this particular completion
3934 * This will wake up a single thread waiting on this completion. Threads will be
3935 * awakened in the same order in which they were queued.
3937 * See also complete_all(), wait_for_completion() and related routines.
3939 * It may be assumed that this function implies a write memory barrier before
3940 * changing the task state if and only if any tasks are woken up.
3942 void complete(struct completion *x)
3944 unsigned long flags;
3946 spin_lock_irqsave(&x->wait.lock, flags);
3948 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
3949 spin_unlock_irqrestore(&x->wait.lock, flags);
3951 EXPORT_SYMBOL(complete);
3954 * complete_all: - signals all threads waiting on this completion
3955 * @x: holds the state of this particular completion
3957 * This will wake up all threads waiting on this particular completion event.
3959 * It may be assumed that this function implies a write memory barrier before
3960 * changing the task state if and only if any tasks are woken up.
3962 void complete_all(struct completion *x)
3964 unsigned long flags;
3966 spin_lock_irqsave(&x->wait.lock, flags);
3967 x->done += UINT_MAX/2;
3968 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
3969 spin_unlock_irqrestore(&x->wait.lock, flags);
3971 EXPORT_SYMBOL(complete_all);
3973 static inline long __sched
3974 do_wait_for_common(struct completion *x, long timeout, int state)
3977 DECLARE_WAITQUEUE(wait, current);
3979 wait.flags |= WQ_FLAG_EXCLUSIVE;
3980 __add_wait_queue_tail(&x->wait, &wait);
3982 if (signal_pending_state(state, current)) {
3983 timeout = -ERESTARTSYS;
3986 __set_current_state(state);
3987 spin_unlock_irq(&x->wait.lock);
3988 timeout = schedule_timeout(timeout);
3989 spin_lock_irq(&x->wait.lock);
3990 } while (!x->done && timeout);
3991 __remove_wait_queue(&x->wait, &wait);
3996 return timeout ?: 1;
4000 wait_for_common(struct completion *x, long timeout, int state)
4004 spin_lock_irq(&x->wait.lock);
4005 timeout = do_wait_for_common(x, timeout, state);
4006 spin_unlock_irq(&x->wait.lock);
4011 * wait_for_completion: - waits for completion of a task
4012 * @x: holds the state of this particular completion
4014 * This waits to be signaled for completion of a specific task. It is NOT
4015 * interruptible and there is no timeout.
4017 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
4018 * and interrupt capability. Also see complete().
4020 void __sched wait_for_completion(struct completion *x)
4022 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
4024 EXPORT_SYMBOL(wait_for_completion);
4027 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
4028 * @x: holds the state of this particular completion
4029 * @timeout: timeout value in jiffies
4031 * This waits for either a completion of a specific task to be signaled or for a
4032 * specified timeout to expire. The timeout is in jiffies. It is not
4035 unsigned long __sched
4036 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
4038 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
4040 EXPORT_SYMBOL(wait_for_completion_timeout);
4043 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
4044 * @x: holds the state of this particular completion
4046 * This waits for completion of a specific task to be signaled. It is
4049 int __sched wait_for_completion_interruptible(struct completion *x)
4051 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
4052 if (t == -ERESTARTSYS)
4056 EXPORT_SYMBOL(wait_for_completion_interruptible);
4059 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
4060 * @x: holds the state of this particular completion
4061 * @timeout: timeout value in jiffies
4063 * This waits for either a completion of a specific task to be signaled or for a
4064 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
4066 unsigned long __sched
4067 wait_for_completion_interruptible_timeout(struct completion *x,
4068 unsigned long timeout)
4070 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
4072 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
4075 * wait_for_completion_killable: - waits for completion of a task (killable)
4076 * @x: holds the state of this particular completion
4078 * This waits to be signaled for completion of a specific task. It can be
4079 * interrupted by a kill signal.
4081 int __sched wait_for_completion_killable(struct completion *x)
4083 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
4084 if (t == -ERESTARTSYS)
4088 EXPORT_SYMBOL(wait_for_completion_killable);
4091 * try_wait_for_completion - try to decrement a completion without blocking
4092 * @x: completion structure
4094 * Returns: 0 if a decrement cannot be done without blocking
4095 * 1 if a decrement succeeded.
4097 * If a completion is being used as a counting completion,
4098 * attempt to decrement the counter without blocking. This
4099 * enables us to avoid waiting if the resource the completion
4100 * is protecting is not available.
4102 bool try_wait_for_completion(struct completion *x)
4104 unsigned long flags;
4107 spin_lock_irqsave(&x->wait.lock, flags);
4112 spin_unlock_irqrestore(&x->wait.lock, flags);
4115 EXPORT_SYMBOL(try_wait_for_completion);
4118 * completion_done - Test to see if a completion has any waiters
4119 * @x: completion structure
4121 * Returns: 0 if there are waiters (wait_for_completion() in progress)
4122 * 1 if there are no waiters.
4125 bool completion_done(struct completion *x)
4127 unsigned long flags;
4130 spin_lock_irqsave(&x->wait.lock, flags);
4133 spin_unlock_irqrestore(&x->wait.lock, flags);
4136 EXPORT_SYMBOL(completion_done);
4139 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
4141 unsigned long flags;
4144 init_waitqueue_entry(&wait, current);
4146 __set_current_state(state);
4148 spin_lock_irqsave(&q->lock, flags);
4149 __add_wait_queue(q, &wait);
4150 spin_unlock(&q->lock);
4151 timeout = schedule_timeout(timeout);
4152 spin_lock_irq(&q->lock);
4153 __remove_wait_queue(q, &wait);
4154 spin_unlock_irqrestore(&q->lock, flags);
4159 void __sched interruptible_sleep_on(wait_queue_head_t *q)
4161 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4163 EXPORT_SYMBOL(interruptible_sleep_on);
4166 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
4168 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
4170 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
4172 void __sched sleep_on(wait_queue_head_t *q)
4174 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4176 EXPORT_SYMBOL(sleep_on);
4178 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
4180 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
4182 EXPORT_SYMBOL(sleep_on_timeout);
4184 #ifdef CONFIG_RT_MUTEXES
4187 * rt_mutex_setprio - set the current priority of a task
4189 * @prio: prio value (kernel-internal form)
4191 * This function changes the 'effective' priority of a task. It does
4192 * not touch ->normal_prio like __setscheduler().
4194 * Used by the rt_mutex code to implement priority inheritance logic.
4196 void rt_mutex_setprio(struct task_struct *p, int prio)
4198 unsigned long flags;
4199 int oldprio, on_rq, running;
4201 const struct sched_class *prev_class;
4203 BUG_ON(prio < 0 || prio > MAX_PRIO);
4205 rq = task_rq_lock(p, &flags);
4208 prev_class = p->sched_class;
4209 on_rq = p->se.on_rq;
4210 running = task_current(rq, p);
4212 dequeue_task(rq, p, 0);
4214 p->sched_class->put_prev_task(rq, p);
4217 p->sched_class = &rt_sched_class;
4219 p->sched_class = &fair_sched_class;
4224 p->sched_class->set_curr_task(rq);
4226 enqueue_task(rq, p, 0, oldprio < prio);
4228 check_class_changed(rq, p, prev_class, oldprio, running);
4230 task_rq_unlock(rq, &flags);
4235 void set_user_nice(struct task_struct *p, long nice)
4237 int old_prio, delta, on_rq;
4238 unsigned long flags;
4241 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
4244 * We have to be careful, if called from sys_setpriority(),
4245 * the task might be in the middle of scheduling on another CPU.
4247 rq = task_rq_lock(p, &flags);
4249 * The RT priorities are set via sched_setscheduler(), but we still
4250 * allow the 'normal' nice value to be set - but as expected
4251 * it wont have any effect on scheduling until the task is
4252 * SCHED_FIFO/SCHED_RR:
4254 if (task_has_rt_policy(p)) {
4255 p->static_prio = NICE_TO_PRIO(nice);
4258 on_rq = p->se.on_rq;
4260 dequeue_task(rq, p, 0);
4262 p->static_prio = NICE_TO_PRIO(nice);
4265 p->prio = effective_prio(p);
4266 delta = p->prio - old_prio;
4269 enqueue_task(rq, p, 0, false);
4271 * If the task increased its priority or is running and
4272 * lowered its priority, then reschedule its CPU:
4274 if (delta < 0 || (delta > 0 && task_running(rq, p)))
4275 resched_task(rq->curr);
4278 task_rq_unlock(rq, &flags);
4280 EXPORT_SYMBOL(set_user_nice);
4283 * can_nice - check if a task can reduce its nice value
4287 int can_nice(const struct task_struct *p, const int nice)
4289 /* convert nice value [19,-20] to rlimit style value [1,40] */
4290 int nice_rlim = 20 - nice;
4292 return (nice_rlim <= p->signal->rlim[RLIMIT_NICE].rlim_cur ||
4293 capable(CAP_SYS_NICE));
4296 #ifdef __ARCH_WANT_SYS_NICE
4299 * sys_nice - change the priority of the current process.
4300 * @increment: priority increment
4302 * sys_setpriority is a more generic, but much slower function that
4303 * does similar things.
4305 SYSCALL_DEFINE1(nice, int, increment)
4310 * Setpriority might change our priority at the same moment.
4311 * We don't have to worry. Conceptually one call occurs first
4312 * and we have a single winner.
4314 if (increment < -40)
4319 nice = TASK_NICE(current) + increment;
4325 if (increment < 0 && !can_nice(current, nice))
4328 retval = security_task_setnice(current, nice);
4332 set_user_nice(current, nice);
4339 * task_prio - return the priority value of a given task.
4340 * @p: the task in question.
4342 * This is the priority value as seen by users in /proc.
4343 * RT tasks are offset by -200. Normal tasks are centered
4344 * around 0, value goes from -16 to +15.
4346 int task_prio(const struct task_struct *p)
4348 return p->prio - MAX_RT_PRIO;
4352 * task_nice - return the nice value of a given task.
4353 * @p: the task in question.
4355 int task_nice(const struct task_struct *p)
4357 return TASK_NICE(p);
4359 EXPORT_SYMBOL(task_nice);
4362 * idle_cpu - is a given cpu idle currently?
4363 * @cpu: the processor in question.
4365 int idle_cpu(int cpu)
4367 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
4371 * idle_task - return the idle task for a given cpu.
4372 * @cpu: the processor in question.
4374 struct task_struct *idle_task(int cpu)
4376 return cpu_rq(cpu)->idle;
4380 * find_process_by_pid - find a process with a matching PID value.
4381 * @pid: the pid in question.
4383 static struct task_struct *find_process_by_pid(pid_t pid)
4385 return pid ? find_task_by_vpid(pid) : current;
4388 /* Actually do priority change: must hold rq lock. */
4390 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
4392 BUG_ON(p->se.on_rq);
4395 p->rt_priority = prio;
4396 p->normal_prio = normal_prio(p);
4397 /* we are holding p->pi_lock already */
4398 p->prio = rt_mutex_getprio(p);
4399 if (rt_prio(p->prio))
4400 p->sched_class = &rt_sched_class;
4402 p->sched_class = &fair_sched_class;
4407 * check the target process has a UID that matches the current process's
4409 static bool check_same_owner(struct task_struct *p)
4411 const struct cred *cred = current_cred(), *pcred;
4415 pcred = __task_cred(p);
4416 match = (cred->euid == pcred->euid ||
4417 cred->euid == pcred->uid);
4422 static int __sched_setscheduler(struct task_struct *p, int policy,
4423 struct sched_param *param, bool user)
4425 int retval, oldprio, oldpolicy = -1, on_rq, running;
4426 unsigned long flags;
4427 const struct sched_class *prev_class;
4431 /* may grab non-irq protected spin_locks */
4432 BUG_ON(in_interrupt());
4434 /* double check policy once rq lock held */
4436 reset_on_fork = p->sched_reset_on_fork;
4437 policy = oldpolicy = p->policy;
4439 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
4440 policy &= ~SCHED_RESET_ON_FORK;
4442 if (policy != SCHED_FIFO && policy != SCHED_RR &&
4443 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
4444 policy != SCHED_IDLE)
4449 * Valid priorities for SCHED_FIFO and SCHED_RR are
4450 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4451 * SCHED_BATCH and SCHED_IDLE is 0.
4453 if (param->sched_priority < 0 ||
4454 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
4455 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
4457 if (rt_policy(policy) != (param->sched_priority != 0))
4461 * Allow unprivileged RT tasks to decrease priority:
4463 if (user && !capable(CAP_SYS_NICE)) {
4464 if (rt_policy(policy)) {
4465 unsigned long rlim_rtprio;
4467 if (!lock_task_sighand(p, &flags))
4469 rlim_rtprio = p->signal->rlim[RLIMIT_RTPRIO].rlim_cur;
4470 unlock_task_sighand(p, &flags);
4472 /* can't set/change the rt policy */
4473 if (policy != p->policy && !rlim_rtprio)
4476 /* can't increase priority */
4477 if (param->sched_priority > p->rt_priority &&
4478 param->sched_priority > rlim_rtprio)
4482 * Like positive nice levels, dont allow tasks to
4483 * move out of SCHED_IDLE either:
4485 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
4488 /* can't change other user's priorities */
4489 if (!check_same_owner(p))
4492 /* Normal users shall not reset the sched_reset_on_fork flag */
4493 if (p->sched_reset_on_fork && !reset_on_fork)
4498 #ifdef CONFIG_RT_GROUP_SCHED
4500 * Do not allow realtime tasks into groups that have no runtime
4503 if (rt_bandwidth_enabled() && rt_policy(policy) &&
4504 task_group(p)->rt_bandwidth.rt_runtime == 0)
4508 retval = security_task_setscheduler(p, policy, param);
4514 * make sure no PI-waiters arrive (or leave) while we are
4515 * changing the priority of the task:
4517 raw_spin_lock_irqsave(&p->pi_lock, flags);
4519 * To be able to change p->policy safely, the apropriate
4520 * runqueue lock must be held.
4522 rq = __task_rq_lock(p);
4523 /* recheck policy now with rq lock held */
4524 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
4525 policy = oldpolicy = -1;
4526 __task_rq_unlock(rq);
4527 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4530 on_rq = p->se.on_rq;
4531 running = task_current(rq, p);
4533 deactivate_task(rq, p, 0);
4535 p->sched_class->put_prev_task(rq, p);
4537 p->sched_reset_on_fork = reset_on_fork;
4540 prev_class = p->sched_class;
4541 __setscheduler(rq, p, policy, param->sched_priority);
4544 p->sched_class->set_curr_task(rq);
4546 activate_task(rq, p, 0);
4548 check_class_changed(rq, p, prev_class, oldprio, running);
4550 __task_rq_unlock(rq);
4551 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4553 rt_mutex_adjust_pi(p);
4559 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4560 * @p: the task in question.
4561 * @policy: new policy.
4562 * @param: structure containing the new RT priority.
4564 * NOTE that the task may be already dead.
4566 int sched_setscheduler(struct task_struct *p, int policy,
4567 struct sched_param *param)
4569 return __sched_setscheduler(p, policy, param, true);
4571 EXPORT_SYMBOL_GPL(sched_setscheduler);
4574 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
4575 * @p: the task in question.
4576 * @policy: new policy.
4577 * @param: structure containing the new RT priority.
4579 * Just like sched_setscheduler, only don't bother checking if the
4580 * current context has permission. For example, this is needed in
4581 * stop_machine(): we create temporary high priority worker threads,
4582 * but our caller might not have that capability.
4584 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
4585 struct sched_param *param)
4587 return __sched_setscheduler(p, policy, param, false);
4591 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
4593 struct sched_param lparam;
4594 struct task_struct *p;
4597 if (!param || pid < 0)
4599 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
4604 p = find_process_by_pid(pid);
4606 retval = sched_setscheduler(p, policy, &lparam);
4613 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4614 * @pid: the pid in question.
4615 * @policy: new policy.
4616 * @param: structure containing the new RT priority.
4618 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
4619 struct sched_param __user *, param)
4621 /* negative values for policy are not valid */
4625 return do_sched_setscheduler(pid, policy, param);
4629 * sys_sched_setparam - set/change the RT priority of a thread
4630 * @pid: the pid in question.
4631 * @param: structure containing the new RT priority.
4633 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
4635 return do_sched_setscheduler(pid, -1, param);
4639 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4640 * @pid: the pid in question.
4642 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
4644 struct task_struct *p;
4652 p = find_process_by_pid(pid);
4654 retval = security_task_getscheduler(p);
4657 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
4664 * sys_sched_getparam - get the RT priority of a thread
4665 * @pid: the pid in question.
4666 * @param: structure containing the RT priority.
4668 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
4670 struct sched_param lp;
4671 struct task_struct *p;
4674 if (!param || pid < 0)
4678 p = find_process_by_pid(pid);
4683 retval = security_task_getscheduler(p);
4687 lp.sched_priority = p->rt_priority;
4691 * This one might sleep, we cannot do it with a spinlock held ...
4693 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
4702 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4704 cpumask_var_t cpus_allowed, new_mask;
4705 struct task_struct *p;
4711 p = find_process_by_pid(pid);
4718 /* Prevent p going away */
4722 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4726 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4728 goto out_free_cpus_allowed;
4731 if (!check_same_owner(p) && !capable(CAP_SYS_NICE))
4734 retval = security_task_setscheduler(p, 0, NULL);
4738 cpuset_cpus_allowed(p, cpus_allowed);
4739 cpumask_and(new_mask, in_mask, cpus_allowed);
4741 retval = set_cpus_allowed_ptr(p, new_mask);
4744 cpuset_cpus_allowed(p, cpus_allowed);
4745 if (!cpumask_subset(new_mask, cpus_allowed)) {
4747 * We must have raced with a concurrent cpuset
4748 * update. Just reset the cpus_allowed to the
4749 * cpuset's cpus_allowed
4751 cpumask_copy(new_mask, cpus_allowed);
4756 free_cpumask_var(new_mask);
4757 out_free_cpus_allowed:
4758 free_cpumask_var(cpus_allowed);
4765 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4766 struct cpumask *new_mask)
4768 if (len < cpumask_size())
4769 cpumask_clear(new_mask);
4770 else if (len > cpumask_size())
4771 len = cpumask_size();
4773 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4777 * sys_sched_setaffinity - set the cpu affinity of a process
4778 * @pid: pid of the process
4779 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4780 * @user_mask_ptr: user-space pointer to the new cpu mask
4782 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4783 unsigned long __user *, user_mask_ptr)
4785 cpumask_var_t new_mask;
4788 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4791 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4793 retval = sched_setaffinity(pid, new_mask);
4794 free_cpumask_var(new_mask);
4798 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4800 struct task_struct *p;
4801 unsigned long flags;
4809 p = find_process_by_pid(pid);
4813 retval = security_task_getscheduler(p);
4817 rq = task_rq_lock(p, &flags);
4818 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
4819 task_rq_unlock(rq, &flags);
4829 * sys_sched_getaffinity - get the cpu affinity of a process
4830 * @pid: pid of the process
4831 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4832 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4834 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4835 unsigned long __user *, user_mask_ptr)
4840 if (len < cpumask_size())
4843 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4846 ret = sched_getaffinity(pid, mask);
4848 if (copy_to_user(user_mask_ptr, mask, cpumask_size()))
4851 ret = cpumask_size();
4853 free_cpumask_var(mask);
4859 * sys_sched_yield - yield the current processor to other threads.
4861 * This function yields the current CPU to other tasks. If there are no
4862 * other threads running on this CPU then this function will return.
4864 SYSCALL_DEFINE0(sched_yield)
4866 struct rq *rq = this_rq_lock();
4868 schedstat_inc(rq, yld_count);
4869 current->sched_class->yield_task(rq);
4872 * Since we are going to call schedule() anyway, there's
4873 * no need to preempt or enable interrupts:
4875 __release(rq->lock);
4876 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4877 do_raw_spin_unlock(&rq->lock);
4878 preempt_enable_no_resched();
4885 static inline int should_resched(void)
4887 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
4890 static void __cond_resched(void)
4892 add_preempt_count(PREEMPT_ACTIVE);
4894 sub_preempt_count(PREEMPT_ACTIVE);
4897 int __sched _cond_resched(void)
4899 if (should_resched()) {
4905 EXPORT_SYMBOL(_cond_resched);
4908 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4909 * call schedule, and on return reacquire the lock.
4911 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4912 * operations here to prevent schedule() from being called twice (once via
4913 * spin_unlock(), once by hand).
4915 int __cond_resched_lock(spinlock_t *lock)
4917 int resched = should_resched();
4920 lockdep_assert_held(lock);
4922 if (spin_needbreak(lock) || resched) {
4933 EXPORT_SYMBOL(__cond_resched_lock);
4935 int __sched __cond_resched_softirq(void)
4937 BUG_ON(!in_softirq());
4939 if (should_resched()) {
4947 EXPORT_SYMBOL(__cond_resched_softirq);
4950 * yield - yield the current processor to other threads.
4952 * This is a shortcut for kernel-space yielding - it marks the
4953 * thread runnable and calls sys_sched_yield().
4955 void __sched yield(void)
4957 set_current_state(TASK_RUNNING);
4960 EXPORT_SYMBOL(yield);
4963 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
4964 * that process accounting knows that this is a task in IO wait state.
4966 void __sched io_schedule(void)
4968 struct rq *rq = raw_rq();
4970 delayacct_blkio_start();
4971 atomic_inc(&rq->nr_iowait);
4972 current->in_iowait = 1;
4974 current->in_iowait = 0;
4975 atomic_dec(&rq->nr_iowait);
4976 delayacct_blkio_end();
4978 EXPORT_SYMBOL(io_schedule);
4980 long __sched io_schedule_timeout(long timeout)
4982 struct rq *rq = raw_rq();
4985 delayacct_blkio_start();
4986 atomic_inc(&rq->nr_iowait);
4987 current->in_iowait = 1;
4988 ret = schedule_timeout(timeout);
4989 current->in_iowait = 0;
4990 atomic_dec(&rq->nr_iowait);
4991 delayacct_blkio_end();
4996 * sys_sched_get_priority_max - return maximum RT priority.
4997 * @policy: scheduling class.
4999 * this syscall returns the maximum rt_priority that can be used
5000 * by a given scheduling class.
5002 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
5009 ret = MAX_USER_RT_PRIO-1;
5021 * sys_sched_get_priority_min - return minimum RT priority.
5022 * @policy: scheduling class.
5024 * this syscall returns the minimum rt_priority that can be used
5025 * by a given scheduling class.
5027 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
5045 * sys_sched_rr_get_interval - return the default timeslice of a process.
5046 * @pid: pid of the process.
5047 * @interval: userspace pointer to the timeslice value.
5049 * this syscall writes the default timeslice value of a given process
5050 * into the user-space timespec buffer. A value of '0' means infinity.
5052 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
5053 struct timespec __user *, interval)
5055 struct task_struct *p;
5056 unsigned int time_slice;
5057 unsigned long flags;
5067 p = find_process_by_pid(pid);
5071 retval = security_task_getscheduler(p);
5075 rq = task_rq_lock(p, &flags);
5076 time_slice = p->sched_class->get_rr_interval(rq, p);
5077 task_rq_unlock(rq, &flags);
5080 jiffies_to_timespec(time_slice, &t);
5081 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
5089 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
5091 void sched_show_task(struct task_struct *p)
5093 unsigned long free = 0;
5096 state = p->state ? __ffs(p->state) + 1 : 0;
5097 printk(KERN_INFO "%-13.13s %c", p->comm,
5098 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
5099 #if BITS_PER_LONG == 32
5100 if (state == TASK_RUNNING)
5101 printk(KERN_CONT " running ");
5103 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
5105 if (state == TASK_RUNNING)
5106 printk(KERN_CONT " running task ");
5108 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
5110 #ifdef CONFIG_DEBUG_STACK_USAGE
5111 free = stack_not_used(p);
5113 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
5114 task_pid_nr(p), task_pid_nr(p->real_parent),
5115 (unsigned long)task_thread_info(p)->flags);
5117 show_stack(p, NULL);
5120 void show_state_filter(unsigned long state_filter)
5122 struct task_struct *g, *p;
5124 #if BITS_PER_LONG == 32
5126 " task PC stack pid father\n");
5129 " task PC stack pid father\n");
5131 read_lock(&tasklist_lock);
5132 do_each_thread(g, p) {
5134 * reset the NMI-timeout, listing all files on a slow
5135 * console might take alot of time:
5137 touch_nmi_watchdog();
5138 if (!state_filter || (p->state & state_filter))
5140 } while_each_thread(g, p);
5142 touch_all_softlockup_watchdogs();
5144 #ifdef CONFIG_SCHED_DEBUG
5145 sysrq_sched_debug_show();
5147 read_unlock(&tasklist_lock);
5149 * Only show locks if all tasks are dumped:
5152 debug_show_all_locks();
5155 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
5157 idle->sched_class = &idle_sched_class;
5161 * init_idle - set up an idle thread for a given CPU
5162 * @idle: task in question
5163 * @cpu: cpu the idle task belongs to
5165 * NOTE: this function does not set the idle thread's NEED_RESCHED
5166 * flag, to make booting more robust.
5168 void __cpuinit init_idle(struct task_struct *idle, int cpu)
5170 struct rq *rq = cpu_rq(cpu);
5171 unsigned long flags;
5173 raw_spin_lock_irqsave(&rq->lock, flags);
5176 idle->state = TASK_RUNNING;
5177 idle->se.exec_start = sched_clock();
5179 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
5180 __set_task_cpu(idle, cpu);
5182 rq->curr = rq->idle = idle;
5183 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
5186 raw_spin_unlock_irqrestore(&rq->lock, flags);
5188 /* Set the preempt count _outside_ the spinlocks! */
5189 #if defined(CONFIG_PREEMPT)
5190 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
5192 task_thread_info(idle)->preempt_count = 0;
5195 * The idle tasks have their own, simple scheduling class:
5197 idle->sched_class = &idle_sched_class;
5198 ftrace_graph_init_task(idle);
5202 * In a system that switches off the HZ timer nohz_cpu_mask
5203 * indicates which cpus entered this state. This is used
5204 * in the rcu update to wait only for active cpus. For system
5205 * which do not switch off the HZ timer nohz_cpu_mask should
5206 * always be CPU_BITS_NONE.
5208 cpumask_var_t nohz_cpu_mask;
5211 * Increase the granularity value when there are more CPUs,
5212 * because with more CPUs the 'effective latency' as visible
5213 * to users decreases. But the relationship is not linear,
5214 * so pick a second-best guess by going with the log2 of the
5217 * This idea comes from the SD scheduler of Con Kolivas:
5219 static int get_update_sysctl_factor(void)
5221 unsigned int cpus = min_t(int, num_online_cpus(), 8);
5222 unsigned int factor;
5224 switch (sysctl_sched_tunable_scaling) {
5225 case SCHED_TUNABLESCALING_NONE:
5228 case SCHED_TUNABLESCALING_LINEAR:
5231 case SCHED_TUNABLESCALING_LOG:
5233 factor = 1 + ilog2(cpus);
5240 static void update_sysctl(void)
5242 unsigned int factor = get_update_sysctl_factor();
5244 #define SET_SYSCTL(name) \
5245 (sysctl_##name = (factor) * normalized_sysctl_##name)
5246 SET_SYSCTL(sched_min_granularity);
5247 SET_SYSCTL(sched_latency);
5248 SET_SYSCTL(sched_wakeup_granularity);
5249 SET_SYSCTL(sched_shares_ratelimit);
5253 static inline void sched_init_granularity(void)
5260 * This is how migration works:
5262 * 1) we queue a struct migration_req structure in the source CPU's
5263 * runqueue and wake up that CPU's migration thread.
5264 * 2) we down() the locked semaphore => thread blocks.
5265 * 3) migration thread wakes up (implicitly it forces the migrated
5266 * thread off the CPU)
5267 * 4) it gets the migration request and checks whether the migrated
5268 * task is still in the wrong runqueue.
5269 * 5) if it's in the wrong runqueue then the migration thread removes
5270 * it and puts it into the right queue.
5271 * 6) migration thread up()s the semaphore.
5272 * 7) we wake up and the migration is done.
5276 * Change a given task's CPU affinity. Migrate the thread to a
5277 * proper CPU and schedule it away if the CPU it's executing on
5278 * is removed from the allowed bitmask.
5280 * NOTE: the caller must have a valid reference to the task, the
5281 * task must not exit() & deallocate itself prematurely. The
5282 * call is not atomic; no spinlocks may be held.
5284 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
5286 struct migration_req req;
5287 unsigned long flags;
5291 rq = task_rq_lock(p, &flags);
5293 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
5298 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
5299 !cpumask_equal(&p->cpus_allowed, new_mask))) {
5304 if (p->sched_class->set_cpus_allowed)
5305 p->sched_class->set_cpus_allowed(p, new_mask);
5307 cpumask_copy(&p->cpus_allowed, new_mask);
5308 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
5311 /* Can the task run on the task's current CPU? If so, we're done */
5312 if (cpumask_test_cpu(task_cpu(p), new_mask))
5315 if (migrate_task(p, cpumask_any_and(cpu_active_mask, new_mask), &req)) {
5316 /* Need help from migration thread: drop lock and wait. */
5317 struct task_struct *mt = rq->migration_thread;
5319 get_task_struct(mt);
5320 task_rq_unlock(rq, &flags);
5321 wake_up_process(rq->migration_thread);
5322 put_task_struct(mt);
5323 wait_for_completion(&req.done);
5324 tlb_migrate_finish(p->mm);
5328 task_rq_unlock(rq, &flags);
5332 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
5335 * Move (not current) task off this cpu, onto dest cpu. We're doing
5336 * this because either it can't run here any more (set_cpus_allowed()
5337 * away from this CPU, or CPU going down), or because we're
5338 * attempting to rebalance this task on exec (sched_exec).
5340 * So we race with normal scheduler movements, but that's OK, as long
5341 * as the task is no longer on this CPU.
5343 * Returns non-zero if task was successfully migrated.
5345 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
5347 struct rq *rq_dest, *rq_src;
5350 if (unlikely(!cpu_active(dest_cpu)))
5353 rq_src = cpu_rq(src_cpu);
5354 rq_dest = cpu_rq(dest_cpu);
5356 double_rq_lock(rq_src, rq_dest);
5357 /* Already moved. */
5358 if (task_cpu(p) != src_cpu)
5360 /* Affinity changed (again). */
5361 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
5365 * If we're not on a rq, the next wake-up will ensure we're
5369 deactivate_task(rq_src, p, 0);
5370 set_task_cpu(p, dest_cpu);
5371 activate_task(rq_dest, p, 0);
5372 check_preempt_curr(rq_dest, p, 0);
5377 double_rq_unlock(rq_src, rq_dest);
5381 #define RCU_MIGRATION_IDLE 0
5382 #define RCU_MIGRATION_NEED_QS 1
5383 #define RCU_MIGRATION_GOT_QS 2
5384 #define RCU_MIGRATION_MUST_SYNC 3
5387 * migration_thread - this is a highprio system thread that performs
5388 * thread migration by bumping thread off CPU then 'pushing' onto
5391 static int migration_thread(void *data)
5394 int cpu = (long)data;
5398 BUG_ON(rq->migration_thread != current);
5400 set_current_state(TASK_INTERRUPTIBLE);
5401 while (!kthread_should_stop()) {
5402 struct migration_req *req;
5403 struct list_head *head;
5405 raw_spin_lock_irq(&rq->lock);
5407 if (cpu_is_offline(cpu)) {
5408 raw_spin_unlock_irq(&rq->lock);
5412 if (rq->active_balance) {
5413 active_load_balance(rq, cpu);
5414 rq->active_balance = 0;
5417 head = &rq->migration_queue;
5419 if (list_empty(head)) {
5420 raw_spin_unlock_irq(&rq->lock);
5422 set_current_state(TASK_INTERRUPTIBLE);
5425 req = list_entry(head->next, struct migration_req, list);
5426 list_del_init(head->next);
5428 if (req->task != NULL) {
5429 raw_spin_unlock(&rq->lock);
5430 __migrate_task(req->task, cpu, req->dest_cpu);
5431 } else if (likely(cpu == (badcpu = smp_processor_id()))) {
5432 req->dest_cpu = RCU_MIGRATION_GOT_QS;
5433 raw_spin_unlock(&rq->lock);
5435 req->dest_cpu = RCU_MIGRATION_MUST_SYNC;
5436 raw_spin_unlock(&rq->lock);
5437 WARN_ONCE(1, "migration_thread() on CPU %d, expected %d\n", badcpu, cpu);
5441 complete(&req->done);
5443 __set_current_state(TASK_RUNNING);
5448 #ifdef CONFIG_HOTPLUG_CPU
5450 static int __migrate_task_irq(struct task_struct *p, int src_cpu, int dest_cpu)
5454 local_irq_disable();
5455 ret = __migrate_task(p, src_cpu, dest_cpu);
5461 * Figure out where task on dead CPU should go, use force if necessary.
5463 static void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
5468 dest_cpu = select_fallback_rq(dead_cpu, p);
5470 /* It can have affinity changed while we were choosing. */
5471 if (unlikely(!__migrate_task_irq(p, dead_cpu, dest_cpu)))
5476 * While a dead CPU has no uninterruptible tasks queued at this point,
5477 * it might still have a nonzero ->nr_uninterruptible counter, because
5478 * for performance reasons the counter is not stricly tracking tasks to
5479 * their home CPUs. So we just add the counter to another CPU's counter,
5480 * to keep the global sum constant after CPU-down:
5482 static void migrate_nr_uninterruptible(struct rq *rq_src)
5484 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
5485 unsigned long flags;
5487 local_irq_save(flags);
5488 double_rq_lock(rq_src, rq_dest);
5489 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
5490 rq_src->nr_uninterruptible = 0;
5491 double_rq_unlock(rq_src, rq_dest);
5492 local_irq_restore(flags);
5495 /* Run through task list and migrate tasks from the dead cpu. */
5496 static void migrate_live_tasks(int src_cpu)
5498 struct task_struct *p, *t;
5500 read_lock(&tasklist_lock);
5502 do_each_thread(t, p) {
5506 if (task_cpu(p) == src_cpu)
5507 move_task_off_dead_cpu(src_cpu, p);
5508 } while_each_thread(t, p);
5510 read_unlock(&tasklist_lock);
5514 * Schedules idle task to be the next runnable task on current CPU.
5515 * It does so by boosting its priority to highest possible.
5516 * Used by CPU offline code.
5518 void sched_idle_next(void)
5520 int this_cpu = smp_processor_id();
5521 struct rq *rq = cpu_rq(this_cpu);
5522 struct task_struct *p = rq->idle;
5523 unsigned long flags;
5525 /* cpu has to be offline */
5526 BUG_ON(cpu_online(this_cpu));
5529 * Strictly not necessary since rest of the CPUs are stopped by now
5530 * and interrupts disabled on the current cpu.
5532 raw_spin_lock_irqsave(&rq->lock, flags);
5534 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
5536 activate_task(rq, p, 0);
5538 raw_spin_unlock_irqrestore(&rq->lock, flags);
5542 * Ensures that the idle task is using init_mm right before its cpu goes
5545 void idle_task_exit(void)
5547 struct mm_struct *mm = current->active_mm;
5549 BUG_ON(cpu_online(smp_processor_id()));
5552 switch_mm(mm, &init_mm, current);
5556 /* called under rq->lock with disabled interrupts */
5557 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
5559 struct rq *rq = cpu_rq(dead_cpu);
5561 /* Must be exiting, otherwise would be on tasklist. */
5562 BUG_ON(!p->exit_state);
5564 /* Cannot have done final schedule yet: would have vanished. */
5565 BUG_ON(p->state == TASK_DEAD);
5570 * Drop lock around migration; if someone else moves it,
5571 * that's OK. No task can be added to this CPU, so iteration is
5574 raw_spin_unlock_irq(&rq->lock);
5575 move_task_off_dead_cpu(dead_cpu, p);
5576 raw_spin_lock_irq(&rq->lock);
5581 /* release_task() removes task from tasklist, so we won't find dead tasks. */
5582 static void migrate_dead_tasks(unsigned int dead_cpu)
5584 struct rq *rq = cpu_rq(dead_cpu);
5585 struct task_struct *next;
5588 if (!rq->nr_running)
5590 next = pick_next_task(rq);
5593 next->sched_class->put_prev_task(rq, next);
5594 migrate_dead(dead_cpu, next);
5600 * remove the tasks which were accounted by rq from calc_load_tasks.
5602 static void calc_global_load_remove(struct rq *rq)
5604 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
5605 rq->calc_load_active = 0;
5607 #endif /* CONFIG_HOTPLUG_CPU */
5609 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
5611 static struct ctl_table sd_ctl_dir[] = {
5613 .procname = "sched_domain",
5619 static struct ctl_table sd_ctl_root[] = {
5621 .procname = "kernel",
5623 .child = sd_ctl_dir,
5628 static struct ctl_table *sd_alloc_ctl_entry(int n)
5630 struct ctl_table *entry =
5631 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
5636 static void sd_free_ctl_entry(struct ctl_table **tablep)
5638 struct ctl_table *entry;
5641 * In the intermediate directories, both the child directory and
5642 * procname are dynamically allocated and could fail but the mode
5643 * will always be set. In the lowest directory the names are
5644 * static strings and all have proc handlers.
5646 for (entry = *tablep; entry->mode; entry++) {
5648 sd_free_ctl_entry(&entry->child);
5649 if (entry->proc_handler == NULL)
5650 kfree(entry->procname);
5658 set_table_entry(struct ctl_table *entry,
5659 const char *procname, void *data, int maxlen,
5660 mode_t mode, proc_handler *proc_handler)
5662 entry->procname = procname;
5664 entry->maxlen = maxlen;
5666 entry->proc_handler = proc_handler;
5669 static struct ctl_table *
5670 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5672 struct ctl_table *table = sd_alloc_ctl_entry(13);
5677 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5678 sizeof(long), 0644, proc_doulongvec_minmax);
5679 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5680 sizeof(long), 0644, proc_doulongvec_minmax);
5681 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5682 sizeof(int), 0644, proc_dointvec_minmax);
5683 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5684 sizeof(int), 0644, proc_dointvec_minmax);
5685 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5686 sizeof(int), 0644, proc_dointvec_minmax);
5687 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5688 sizeof(int), 0644, proc_dointvec_minmax);
5689 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5690 sizeof(int), 0644, proc_dointvec_minmax);
5691 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5692 sizeof(int), 0644, proc_dointvec_minmax);
5693 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5694 sizeof(int), 0644, proc_dointvec_minmax);
5695 set_table_entry(&table[9], "cache_nice_tries",
5696 &sd->cache_nice_tries,
5697 sizeof(int), 0644, proc_dointvec_minmax);
5698 set_table_entry(&table[10], "flags", &sd->flags,
5699 sizeof(int), 0644, proc_dointvec_minmax);
5700 set_table_entry(&table[11], "name", sd->name,
5701 CORENAME_MAX_SIZE, 0444, proc_dostring);
5702 /* &table[12] is terminator */
5707 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5709 struct ctl_table *entry, *table;
5710 struct sched_domain *sd;
5711 int domain_num = 0, i;
5714 for_each_domain(cpu, sd)
5716 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5721 for_each_domain(cpu, sd) {
5722 snprintf(buf, 32, "domain%d", i);
5723 entry->procname = kstrdup(buf, GFP_KERNEL);
5725 entry->child = sd_alloc_ctl_domain_table(sd);
5732 static struct ctl_table_header *sd_sysctl_header;
5733 static void register_sched_domain_sysctl(void)
5735 int i, cpu_num = num_possible_cpus();
5736 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5739 WARN_ON(sd_ctl_dir[0].child);
5740 sd_ctl_dir[0].child = entry;
5745 for_each_possible_cpu(i) {
5746 snprintf(buf, 32, "cpu%d", i);
5747 entry->procname = kstrdup(buf, GFP_KERNEL);
5749 entry->child = sd_alloc_ctl_cpu_table(i);
5753 WARN_ON(sd_sysctl_header);
5754 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5757 /* may be called multiple times per register */
5758 static void unregister_sched_domain_sysctl(void)
5760 if (sd_sysctl_header)
5761 unregister_sysctl_table(sd_sysctl_header);
5762 sd_sysctl_header = NULL;
5763 if (sd_ctl_dir[0].child)
5764 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5767 static void register_sched_domain_sysctl(void)
5770 static void unregister_sched_domain_sysctl(void)
5775 static void set_rq_online(struct rq *rq)
5778 const struct sched_class *class;
5780 cpumask_set_cpu(rq->cpu, rq->rd->online);
5783 for_each_class(class) {
5784 if (class->rq_online)
5785 class->rq_online(rq);
5790 static void set_rq_offline(struct rq *rq)
5793 const struct sched_class *class;
5795 for_each_class(class) {
5796 if (class->rq_offline)
5797 class->rq_offline(rq);
5800 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5806 * migration_call - callback that gets triggered when a CPU is added.
5807 * Here we can start up the necessary migration thread for the new CPU.
5809 static int __cpuinit
5810 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5812 struct task_struct *p;
5813 int cpu = (long)hcpu;
5814 unsigned long flags;
5819 case CPU_UP_PREPARE:
5820 case CPU_UP_PREPARE_FROZEN:
5821 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
5824 kthread_bind(p, cpu);
5825 /* Must be high prio: stop_machine expects to yield to it. */
5826 rq = task_rq_lock(p, &flags);
5827 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
5828 task_rq_unlock(rq, &flags);
5830 cpu_rq(cpu)->migration_thread = p;
5831 rq->calc_load_update = calc_load_update;
5835 case CPU_ONLINE_FROZEN:
5836 /* Strictly unnecessary, as first user will wake it. */
5837 wake_up_process(cpu_rq(cpu)->migration_thread);
5839 /* Update our root-domain */
5841 raw_spin_lock_irqsave(&rq->lock, flags);
5843 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5847 raw_spin_unlock_irqrestore(&rq->lock, flags);
5850 #ifdef CONFIG_HOTPLUG_CPU
5851 case CPU_UP_CANCELED:
5852 case CPU_UP_CANCELED_FROZEN:
5853 if (!cpu_rq(cpu)->migration_thread)
5855 /* Unbind it from offline cpu so it can run. Fall thru. */
5856 kthread_bind(cpu_rq(cpu)->migration_thread,
5857 cpumask_any(cpu_online_mask));
5858 kthread_stop(cpu_rq(cpu)->migration_thread);
5859 put_task_struct(cpu_rq(cpu)->migration_thread);
5860 cpu_rq(cpu)->migration_thread = NULL;
5864 case CPU_DEAD_FROZEN:
5865 cpuset_lock(); /* around calls to cpuset_cpus_allowed_lock() */
5866 migrate_live_tasks(cpu);
5868 kthread_stop(rq->migration_thread);
5869 put_task_struct(rq->migration_thread);
5870 rq->migration_thread = NULL;
5871 /* Idle task back to normal (off runqueue, low prio) */
5872 raw_spin_lock_irq(&rq->lock);
5873 deactivate_task(rq, rq->idle, 0);
5874 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
5875 rq->idle->sched_class = &idle_sched_class;
5876 migrate_dead_tasks(cpu);
5877 raw_spin_unlock_irq(&rq->lock);
5879 migrate_nr_uninterruptible(rq);
5880 BUG_ON(rq->nr_running != 0);
5881 calc_global_load_remove(rq);
5883 * No need to migrate the tasks: it was best-effort if
5884 * they didn't take sched_hotcpu_mutex. Just wake up
5887 raw_spin_lock_irq(&rq->lock);
5888 while (!list_empty(&rq->migration_queue)) {
5889 struct migration_req *req;
5891 req = list_entry(rq->migration_queue.next,
5892 struct migration_req, list);
5893 list_del_init(&req->list);
5894 raw_spin_unlock_irq(&rq->lock);
5895 complete(&req->done);
5896 raw_spin_lock_irq(&rq->lock);
5898 raw_spin_unlock_irq(&rq->lock);
5902 case CPU_DYING_FROZEN:
5903 /* Update our root-domain */
5905 raw_spin_lock_irqsave(&rq->lock, flags);
5907 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5910 raw_spin_unlock_irqrestore(&rq->lock, flags);
5918 * Register at high priority so that task migration (migrate_all_tasks)
5919 * happens before everything else. This has to be lower priority than
5920 * the notifier in the perf_event subsystem, though.
5922 static struct notifier_block __cpuinitdata migration_notifier = {
5923 .notifier_call = migration_call,
5927 static int __init migration_init(void)
5929 void *cpu = (void *)(long)smp_processor_id();
5932 /* Start one for the boot CPU: */
5933 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
5934 BUG_ON(err == NOTIFY_BAD);
5935 migration_call(&migration_notifier, CPU_ONLINE, cpu);
5936 register_cpu_notifier(&migration_notifier);
5940 early_initcall(migration_init);
5945 #ifdef CONFIG_SCHED_DEBUG
5947 static __read_mostly int sched_domain_debug_enabled;
5949 static int __init sched_domain_debug_setup(char *str)
5951 sched_domain_debug_enabled = 1;
5955 early_param("sched_debug", sched_domain_debug_setup);
5957 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5958 struct cpumask *groupmask)
5960 struct sched_group *group = sd->groups;
5963 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
5964 cpumask_clear(groupmask);
5966 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5968 if (!(sd->flags & SD_LOAD_BALANCE)) {
5969 printk("does not load-balance\n");
5971 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5976 printk(KERN_CONT "span %s level %s\n", str, sd->name);
5978 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5979 printk(KERN_ERR "ERROR: domain->span does not contain "
5982 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5983 printk(KERN_ERR "ERROR: domain->groups does not contain"
5987 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5991 printk(KERN_ERR "ERROR: group is NULL\n");
5995 if (!group->cpu_power) {
5996 printk(KERN_CONT "\n");
5997 printk(KERN_ERR "ERROR: domain->cpu_power not "
6002 if (!cpumask_weight(sched_group_cpus(group))) {
6003 printk(KERN_CONT "\n");
6004 printk(KERN_ERR "ERROR: empty group\n");
6008 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
6009 printk(KERN_CONT "\n");
6010 printk(KERN_ERR "ERROR: repeated CPUs\n");
6014 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
6016 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
6018 printk(KERN_CONT " %s", str);
6019 if (group->cpu_power != SCHED_LOAD_SCALE) {
6020 printk(KERN_CONT " (cpu_power = %d)",
6024 group = group->next;
6025 } while (group != sd->groups);
6026 printk(KERN_CONT "\n");
6028 if (!cpumask_equal(sched_domain_span(sd), groupmask))
6029 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
6032 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
6033 printk(KERN_ERR "ERROR: parent span is not a superset "
6034 "of domain->span\n");
6038 static void sched_domain_debug(struct sched_domain *sd, int cpu)
6040 cpumask_var_t groupmask;
6043 if (!sched_domain_debug_enabled)
6047 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
6051 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
6053 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
6054 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
6059 if (sched_domain_debug_one(sd, cpu, level, groupmask))
6066 free_cpumask_var(groupmask);
6068 #else /* !CONFIG_SCHED_DEBUG */
6069 # define sched_domain_debug(sd, cpu) do { } while (0)
6070 #endif /* CONFIG_SCHED_DEBUG */
6072 static int sd_degenerate(struct sched_domain *sd)
6074 if (cpumask_weight(sched_domain_span(sd)) == 1)
6077 /* Following flags need at least 2 groups */
6078 if (sd->flags & (SD_LOAD_BALANCE |
6079 SD_BALANCE_NEWIDLE |
6083 SD_SHARE_PKG_RESOURCES)) {
6084 if (sd->groups != sd->groups->next)
6088 /* Following flags don't use groups */
6089 if (sd->flags & (SD_WAKE_AFFINE))
6096 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
6098 unsigned long cflags = sd->flags, pflags = parent->flags;
6100 if (sd_degenerate(parent))
6103 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
6106 /* Flags needing groups don't count if only 1 group in parent */
6107 if (parent->groups == parent->groups->next) {
6108 pflags &= ~(SD_LOAD_BALANCE |
6109 SD_BALANCE_NEWIDLE |
6113 SD_SHARE_PKG_RESOURCES);
6114 if (nr_node_ids == 1)
6115 pflags &= ~SD_SERIALIZE;
6117 if (~cflags & pflags)
6123 static void free_rootdomain(struct root_domain *rd)
6125 synchronize_sched();
6127 cpupri_cleanup(&rd->cpupri);
6129 free_cpumask_var(rd->rto_mask);
6130 free_cpumask_var(rd->online);
6131 free_cpumask_var(rd->span);
6135 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
6137 struct root_domain *old_rd = NULL;
6138 unsigned long flags;
6140 raw_spin_lock_irqsave(&rq->lock, flags);
6145 if (cpumask_test_cpu(rq->cpu, old_rd->online))
6148 cpumask_clear_cpu(rq->cpu, old_rd->span);
6151 * If we dont want to free the old_rt yet then
6152 * set old_rd to NULL to skip the freeing later
6155 if (!atomic_dec_and_test(&old_rd->refcount))
6159 atomic_inc(&rd->refcount);
6162 cpumask_set_cpu(rq->cpu, rd->span);
6163 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
6166 raw_spin_unlock_irqrestore(&rq->lock, flags);
6169 free_rootdomain(old_rd);
6172 static int init_rootdomain(struct root_domain *rd, bool bootmem)
6174 gfp_t gfp = GFP_KERNEL;
6176 memset(rd, 0, sizeof(*rd));
6181 if (!alloc_cpumask_var(&rd->span, gfp))
6183 if (!alloc_cpumask_var(&rd->online, gfp))
6185 if (!alloc_cpumask_var(&rd->rto_mask, gfp))
6188 if (cpupri_init(&rd->cpupri, bootmem) != 0)
6193 free_cpumask_var(rd->rto_mask);
6195 free_cpumask_var(rd->online);
6197 free_cpumask_var(rd->span);
6202 static void init_defrootdomain(void)
6204 init_rootdomain(&def_root_domain, true);
6206 atomic_set(&def_root_domain.refcount, 1);
6209 static struct root_domain *alloc_rootdomain(void)
6211 struct root_domain *rd;
6213 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
6217 if (init_rootdomain(rd, false) != 0) {
6226 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6227 * hold the hotplug lock.
6230 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
6232 struct rq *rq = cpu_rq(cpu);
6233 struct sched_domain *tmp;
6235 /* Remove the sched domains which do not contribute to scheduling. */
6236 for (tmp = sd; tmp; ) {
6237 struct sched_domain *parent = tmp->parent;
6241 if (sd_parent_degenerate(tmp, parent)) {
6242 tmp->parent = parent->parent;
6244 parent->parent->child = tmp;
6249 if (sd && sd_degenerate(sd)) {
6255 sched_domain_debug(sd, cpu);
6257 rq_attach_root(rq, rd);
6258 rcu_assign_pointer(rq->sd, sd);
6261 /* cpus with isolated domains */
6262 static cpumask_var_t cpu_isolated_map;
6264 /* Setup the mask of cpus configured for isolated domains */
6265 static int __init isolated_cpu_setup(char *str)
6267 alloc_bootmem_cpumask_var(&cpu_isolated_map);
6268 cpulist_parse(str, cpu_isolated_map);
6272 __setup("isolcpus=", isolated_cpu_setup);
6275 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
6276 * to a function which identifies what group(along with sched group) a CPU
6277 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
6278 * (due to the fact that we keep track of groups covered with a struct cpumask).
6280 * init_sched_build_groups will build a circular linked list of the groups
6281 * covered by the given span, and will set each group's ->cpumask correctly,
6282 * and ->cpu_power to 0.
6285 init_sched_build_groups(const struct cpumask *span,
6286 const struct cpumask *cpu_map,
6287 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
6288 struct sched_group **sg,
6289 struct cpumask *tmpmask),
6290 struct cpumask *covered, struct cpumask *tmpmask)
6292 struct sched_group *first = NULL, *last = NULL;
6295 cpumask_clear(covered);
6297 for_each_cpu(i, span) {
6298 struct sched_group *sg;
6299 int group = group_fn(i, cpu_map, &sg, tmpmask);
6302 if (cpumask_test_cpu(i, covered))
6305 cpumask_clear(sched_group_cpus(sg));
6308 for_each_cpu(j, span) {
6309 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
6312 cpumask_set_cpu(j, covered);
6313 cpumask_set_cpu(j, sched_group_cpus(sg));
6324 #define SD_NODES_PER_DOMAIN 16
6329 * find_next_best_node - find the next node to include in a sched_domain
6330 * @node: node whose sched_domain we're building
6331 * @used_nodes: nodes already in the sched_domain
6333 * Find the next node to include in a given scheduling domain. Simply
6334 * finds the closest node not already in the @used_nodes map.
6336 * Should use nodemask_t.
6338 static int find_next_best_node(int node, nodemask_t *used_nodes)
6340 int i, n, val, min_val, best_node = 0;
6344 for (i = 0; i < nr_node_ids; i++) {
6345 /* Start at @node */
6346 n = (node + i) % nr_node_ids;
6348 if (!nr_cpus_node(n))
6351 /* Skip already used nodes */
6352 if (node_isset(n, *used_nodes))
6355 /* Simple min distance search */
6356 val = node_distance(node, n);
6358 if (val < min_val) {
6364 node_set(best_node, *used_nodes);
6369 * sched_domain_node_span - get a cpumask for a node's sched_domain
6370 * @node: node whose cpumask we're constructing
6371 * @span: resulting cpumask
6373 * Given a node, construct a good cpumask for its sched_domain to span. It
6374 * should be one that prevents unnecessary balancing, but also spreads tasks
6377 static void sched_domain_node_span(int node, struct cpumask *span)
6379 nodemask_t used_nodes;
6382 cpumask_clear(span);
6383 nodes_clear(used_nodes);
6385 cpumask_or(span, span, cpumask_of_node(node));
6386 node_set(node, used_nodes);
6388 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
6389 int next_node = find_next_best_node(node, &used_nodes);
6391 cpumask_or(span, span, cpumask_of_node(next_node));
6394 #endif /* CONFIG_NUMA */
6396 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
6399 * The cpus mask in sched_group and sched_domain hangs off the end.
6401 * ( See the the comments in include/linux/sched.h:struct sched_group
6402 * and struct sched_domain. )
6404 struct static_sched_group {
6405 struct sched_group sg;
6406 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
6409 struct static_sched_domain {
6410 struct sched_domain sd;
6411 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
6417 cpumask_var_t domainspan;
6418 cpumask_var_t covered;
6419 cpumask_var_t notcovered;
6421 cpumask_var_t nodemask;
6422 cpumask_var_t this_sibling_map;
6423 cpumask_var_t this_core_map;
6424 cpumask_var_t send_covered;
6425 cpumask_var_t tmpmask;
6426 struct sched_group **sched_group_nodes;
6427 struct root_domain *rd;
6431 sa_sched_groups = 0,
6436 sa_this_sibling_map,
6438 sa_sched_group_nodes,
6448 * SMT sched-domains:
6450 #ifdef CONFIG_SCHED_SMT
6451 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
6452 static DEFINE_PER_CPU(struct static_sched_group, sched_groups);
6455 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
6456 struct sched_group **sg, struct cpumask *unused)
6459 *sg = &per_cpu(sched_groups, cpu).sg;
6462 #endif /* CONFIG_SCHED_SMT */
6465 * multi-core sched-domains:
6467 #ifdef CONFIG_SCHED_MC
6468 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
6469 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
6470 #endif /* CONFIG_SCHED_MC */
6472 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
6474 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
6475 struct sched_group **sg, struct cpumask *mask)
6479 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
6480 group = cpumask_first(mask);
6482 *sg = &per_cpu(sched_group_core, group).sg;
6485 #elif defined(CONFIG_SCHED_MC)
6487 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
6488 struct sched_group **sg, struct cpumask *unused)
6491 *sg = &per_cpu(sched_group_core, cpu).sg;
6496 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
6497 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
6500 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
6501 struct sched_group **sg, struct cpumask *mask)
6504 #ifdef CONFIG_SCHED_MC
6505 cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map);
6506 group = cpumask_first(mask);
6507 #elif defined(CONFIG_SCHED_SMT)
6508 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
6509 group = cpumask_first(mask);
6514 *sg = &per_cpu(sched_group_phys, group).sg;
6520 * The init_sched_build_groups can't handle what we want to do with node
6521 * groups, so roll our own. Now each node has its own list of groups which
6522 * gets dynamically allocated.
6524 static DEFINE_PER_CPU(struct static_sched_domain, node_domains);
6525 static struct sched_group ***sched_group_nodes_bycpu;
6527 static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains);
6528 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
6530 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
6531 struct sched_group **sg,
6532 struct cpumask *nodemask)
6536 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map);
6537 group = cpumask_first(nodemask);
6540 *sg = &per_cpu(sched_group_allnodes, group).sg;
6544 static void init_numa_sched_groups_power(struct sched_group *group_head)
6546 struct sched_group *sg = group_head;
6552 for_each_cpu(j, sched_group_cpus(sg)) {
6553 struct sched_domain *sd;
6555 sd = &per_cpu(phys_domains, j).sd;
6556 if (j != group_first_cpu(sd->groups)) {
6558 * Only add "power" once for each
6564 sg->cpu_power += sd->groups->cpu_power;
6567 } while (sg != group_head);
6570 static int build_numa_sched_groups(struct s_data *d,
6571 const struct cpumask *cpu_map, int num)
6573 struct sched_domain *sd;
6574 struct sched_group *sg, *prev;
6577 cpumask_clear(d->covered);
6578 cpumask_and(d->nodemask, cpumask_of_node(num), cpu_map);
6579 if (cpumask_empty(d->nodemask)) {
6580 d->sched_group_nodes[num] = NULL;
6584 sched_domain_node_span(num, d->domainspan);
6585 cpumask_and(d->domainspan, d->domainspan, cpu_map);
6587 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
6590 printk(KERN_WARNING "Can not alloc domain group for node %d\n",
6594 d->sched_group_nodes[num] = sg;
6596 for_each_cpu(j, d->nodemask) {
6597 sd = &per_cpu(node_domains, j).sd;
6602 cpumask_copy(sched_group_cpus(sg), d->nodemask);
6604 cpumask_or(d->covered, d->covered, d->nodemask);
6607 for (j = 0; j < nr_node_ids; j++) {
6608 n = (num + j) % nr_node_ids;
6609 cpumask_complement(d->notcovered, d->covered);
6610 cpumask_and(d->tmpmask, d->notcovered, cpu_map);
6611 cpumask_and(d->tmpmask, d->tmpmask, d->domainspan);
6612 if (cpumask_empty(d->tmpmask))
6614 cpumask_and(d->tmpmask, d->tmpmask, cpumask_of_node(n));
6615 if (cpumask_empty(d->tmpmask))
6617 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
6621 "Can not alloc domain group for node %d\n", j);
6625 cpumask_copy(sched_group_cpus(sg), d->tmpmask);
6626 sg->next = prev->next;
6627 cpumask_or(d->covered, d->covered, d->tmpmask);
6634 #endif /* CONFIG_NUMA */
6637 /* Free memory allocated for various sched_group structures */
6638 static void free_sched_groups(const struct cpumask *cpu_map,
6639 struct cpumask *nodemask)
6643 for_each_cpu(cpu, cpu_map) {
6644 struct sched_group **sched_group_nodes
6645 = sched_group_nodes_bycpu[cpu];
6647 if (!sched_group_nodes)
6650 for (i = 0; i < nr_node_ids; i++) {
6651 struct sched_group *oldsg, *sg = sched_group_nodes[i];
6653 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
6654 if (cpumask_empty(nodemask))
6664 if (oldsg != sched_group_nodes[i])
6667 kfree(sched_group_nodes);
6668 sched_group_nodes_bycpu[cpu] = NULL;
6671 #else /* !CONFIG_NUMA */
6672 static void free_sched_groups(const struct cpumask *cpu_map,
6673 struct cpumask *nodemask)
6676 #endif /* CONFIG_NUMA */
6679 * Initialize sched groups cpu_power.
6681 * cpu_power indicates the capacity of sched group, which is used while
6682 * distributing the load between different sched groups in a sched domain.
6683 * Typically cpu_power for all the groups in a sched domain will be same unless
6684 * there are asymmetries in the topology. If there are asymmetries, group
6685 * having more cpu_power will pickup more load compared to the group having
6688 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
6690 struct sched_domain *child;
6691 struct sched_group *group;
6695 WARN_ON(!sd || !sd->groups);
6697 if (cpu != group_first_cpu(sd->groups))
6702 sd->groups->cpu_power = 0;
6705 power = SCHED_LOAD_SCALE;
6706 weight = cpumask_weight(sched_domain_span(sd));
6708 * SMT siblings share the power of a single core.
6709 * Usually multiple threads get a better yield out of
6710 * that one core than a single thread would have,
6711 * reflect that in sd->smt_gain.
6713 if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) {
6714 power *= sd->smt_gain;
6716 power >>= SCHED_LOAD_SHIFT;
6718 sd->groups->cpu_power += power;
6723 * Add cpu_power of each child group to this groups cpu_power.
6725 group = child->groups;
6727 sd->groups->cpu_power += group->cpu_power;
6728 group = group->next;
6729 } while (group != child->groups);
6733 * Initializers for schedule domains
6734 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6737 #ifdef CONFIG_SCHED_DEBUG
6738 # define SD_INIT_NAME(sd, type) sd->name = #type
6740 # define SD_INIT_NAME(sd, type) do { } while (0)
6743 #define SD_INIT(sd, type) sd_init_##type(sd)
6745 #define SD_INIT_FUNC(type) \
6746 static noinline void sd_init_##type(struct sched_domain *sd) \
6748 memset(sd, 0, sizeof(*sd)); \
6749 *sd = SD_##type##_INIT; \
6750 sd->level = SD_LV_##type; \
6751 SD_INIT_NAME(sd, type); \
6756 SD_INIT_FUNC(ALLNODES)
6759 #ifdef CONFIG_SCHED_SMT
6760 SD_INIT_FUNC(SIBLING)
6762 #ifdef CONFIG_SCHED_MC
6766 static int default_relax_domain_level = -1;
6768 static int __init setup_relax_domain_level(char *str)
6772 val = simple_strtoul(str, NULL, 0);
6773 if (val < SD_LV_MAX)
6774 default_relax_domain_level = val;
6778 __setup("relax_domain_level=", setup_relax_domain_level);
6780 static void set_domain_attribute(struct sched_domain *sd,
6781 struct sched_domain_attr *attr)
6785 if (!attr || attr->relax_domain_level < 0) {
6786 if (default_relax_domain_level < 0)
6789 request = default_relax_domain_level;
6791 request = attr->relax_domain_level;
6792 if (request < sd->level) {
6793 /* turn off idle balance on this domain */
6794 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6796 /* turn on idle balance on this domain */
6797 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6801 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6802 const struct cpumask *cpu_map)
6805 case sa_sched_groups:
6806 free_sched_groups(cpu_map, d->tmpmask); /* fall through */
6807 d->sched_group_nodes = NULL;
6809 free_rootdomain(d->rd); /* fall through */
6811 free_cpumask_var(d->tmpmask); /* fall through */
6812 case sa_send_covered:
6813 free_cpumask_var(d->send_covered); /* fall through */
6814 case sa_this_core_map:
6815 free_cpumask_var(d->this_core_map); /* fall through */
6816 case sa_this_sibling_map:
6817 free_cpumask_var(d->this_sibling_map); /* fall through */
6819 free_cpumask_var(d->nodemask); /* fall through */
6820 case sa_sched_group_nodes:
6822 kfree(d->sched_group_nodes); /* fall through */
6824 free_cpumask_var(d->notcovered); /* fall through */
6826 free_cpumask_var(d->covered); /* fall through */
6828 free_cpumask_var(d->domainspan); /* fall through */
6835 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6836 const struct cpumask *cpu_map)
6839 if (!alloc_cpumask_var(&d->domainspan, GFP_KERNEL))
6841 if (!alloc_cpumask_var(&d->covered, GFP_KERNEL))
6842 return sa_domainspan;
6843 if (!alloc_cpumask_var(&d->notcovered, GFP_KERNEL))
6845 /* Allocate the per-node list of sched groups */
6846 d->sched_group_nodes = kcalloc(nr_node_ids,
6847 sizeof(struct sched_group *), GFP_KERNEL);
6848 if (!d->sched_group_nodes) {
6849 printk(KERN_WARNING "Can not alloc sched group node list\n");
6850 return sa_notcovered;
6852 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = d->sched_group_nodes;
6854 if (!alloc_cpumask_var(&d->nodemask, GFP_KERNEL))
6855 return sa_sched_group_nodes;
6856 if (!alloc_cpumask_var(&d->this_sibling_map, GFP_KERNEL))
6858 if (!alloc_cpumask_var(&d->this_core_map, GFP_KERNEL))
6859 return sa_this_sibling_map;
6860 if (!alloc_cpumask_var(&d->send_covered, GFP_KERNEL))
6861 return sa_this_core_map;
6862 if (!alloc_cpumask_var(&d->tmpmask, GFP_KERNEL))
6863 return sa_send_covered;
6864 d->rd = alloc_rootdomain();
6866 printk(KERN_WARNING "Cannot alloc root domain\n");
6869 return sa_rootdomain;
6872 static struct sched_domain *__build_numa_sched_domains(struct s_data *d,
6873 const struct cpumask *cpu_map, struct sched_domain_attr *attr, int i)
6875 struct sched_domain *sd = NULL;
6877 struct sched_domain *parent;
6880 if (cpumask_weight(cpu_map) >
6881 SD_NODES_PER_DOMAIN * cpumask_weight(d->nodemask)) {
6882 sd = &per_cpu(allnodes_domains, i).sd;
6883 SD_INIT(sd, ALLNODES);
6884 set_domain_attribute(sd, attr);
6885 cpumask_copy(sched_domain_span(sd), cpu_map);
6886 cpu_to_allnodes_group(i, cpu_map, &sd->groups, d->tmpmask);
6891 sd = &per_cpu(node_domains, i).sd;
6893 set_domain_attribute(sd, attr);
6894 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
6895 sd->parent = parent;
6898 cpumask_and(sched_domain_span(sd), sched_domain_span(sd), cpu_map);
6903 static struct sched_domain *__build_cpu_sched_domain(struct s_data *d,
6904 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6905 struct sched_domain *parent, int i)
6907 struct sched_domain *sd;
6908 sd = &per_cpu(phys_domains, i).sd;
6910 set_domain_attribute(sd, attr);
6911 cpumask_copy(sched_domain_span(sd), d->nodemask);
6912 sd->parent = parent;
6915 cpu_to_phys_group(i, cpu_map, &sd->groups, d->tmpmask);
6919 static struct sched_domain *__build_mc_sched_domain(struct s_data *d,
6920 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6921 struct sched_domain *parent, int i)
6923 struct sched_domain *sd = parent;
6924 #ifdef CONFIG_SCHED_MC
6925 sd = &per_cpu(core_domains, i).sd;
6927 set_domain_attribute(sd, attr);
6928 cpumask_and(sched_domain_span(sd), cpu_map, cpu_coregroup_mask(i));
6929 sd->parent = parent;
6931 cpu_to_core_group(i, cpu_map, &sd->groups, d->tmpmask);
6936 static struct sched_domain *__build_smt_sched_domain(struct s_data *d,
6937 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6938 struct sched_domain *parent, int i)
6940 struct sched_domain *sd = parent;
6941 #ifdef CONFIG_SCHED_SMT
6942 sd = &per_cpu(cpu_domains, i).sd;
6943 SD_INIT(sd, SIBLING);
6944 set_domain_attribute(sd, attr);
6945 cpumask_and(sched_domain_span(sd), cpu_map, topology_thread_cpumask(i));
6946 sd->parent = parent;
6948 cpu_to_cpu_group(i, cpu_map, &sd->groups, d->tmpmask);
6953 static void build_sched_groups(struct s_data *d, enum sched_domain_level l,
6954 const struct cpumask *cpu_map, int cpu)
6957 #ifdef CONFIG_SCHED_SMT
6958 case SD_LV_SIBLING: /* set up CPU (sibling) groups */
6959 cpumask_and(d->this_sibling_map, cpu_map,
6960 topology_thread_cpumask(cpu));
6961 if (cpu == cpumask_first(d->this_sibling_map))
6962 init_sched_build_groups(d->this_sibling_map, cpu_map,
6964 d->send_covered, d->tmpmask);
6967 #ifdef CONFIG_SCHED_MC
6968 case SD_LV_MC: /* set up multi-core groups */
6969 cpumask_and(d->this_core_map, cpu_map, cpu_coregroup_mask(cpu));
6970 if (cpu == cpumask_first(d->this_core_map))
6971 init_sched_build_groups(d->this_core_map, cpu_map,
6973 d->send_covered, d->tmpmask);
6976 case SD_LV_CPU: /* set up physical groups */
6977 cpumask_and(d->nodemask, cpumask_of_node(cpu), cpu_map);
6978 if (!cpumask_empty(d->nodemask))
6979 init_sched_build_groups(d->nodemask, cpu_map,
6981 d->send_covered, d->tmpmask);
6984 case SD_LV_ALLNODES:
6985 init_sched_build_groups(cpu_map, cpu_map, &cpu_to_allnodes_group,
6986 d->send_covered, d->tmpmask);
6995 * Build sched domains for a given set of cpus and attach the sched domains
6996 * to the individual cpus
6998 static int __build_sched_domains(const struct cpumask *cpu_map,
6999 struct sched_domain_attr *attr)
7001 enum s_alloc alloc_state = sa_none;
7003 struct sched_domain *sd;
7009 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
7010 if (alloc_state != sa_rootdomain)
7012 alloc_state = sa_sched_groups;
7015 * Set up domains for cpus specified by the cpu_map.
7017 for_each_cpu(i, cpu_map) {
7018 cpumask_and(d.nodemask, cpumask_of_node(cpu_to_node(i)),
7021 sd = __build_numa_sched_domains(&d, cpu_map, attr, i);
7022 sd = __build_cpu_sched_domain(&d, cpu_map, attr, sd, i);
7023 sd = __build_mc_sched_domain(&d, cpu_map, attr, sd, i);
7024 sd = __build_smt_sched_domain(&d, cpu_map, attr, sd, i);
7027 for_each_cpu(i, cpu_map) {
7028 build_sched_groups(&d, SD_LV_SIBLING, cpu_map, i);
7029 build_sched_groups(&d, SD_LV_MC, cpu_map, i);
7032 /* Set up physical groups */
7033 for (i = 0; i < nr_node_ids; i++)
7034 build_sched_groups(&d, SD_LV_CPU, cpu_map, i);
7037 /* Set up node groups */
7039 build_sched_groups(&d, SD_LV_ALLNODES, cpu_map, 0);
7041 for (i = 0; i < nr_node_ids; i++)
7042 if (build_numa_sched_groups(&d, cpu_map, i))
7046 /* Calculate CPU power for physical packages and nodes */
7047 #ifdef CONFIG_SCHED_SMT
7048 for_each_cpu(i, cpu_map) {
7049 sd = &per_cpu(cpu_domains, i).sd;
7050 init_sched_groups_power(i, sd);
7053 #ifdef CONFIG_SCHED_MC
7054 for_each_cpu(i, cpu_map) {
7055 sd = &per_cpu(core_domains, i).sd;
7056 init_sched_groups_power(i, sd);
7060 for_each_cpu(i, cpu_map) {
7061 sd = &per_cpu(phys_domains, i).sd;
7062 init_sched_groups_power(i, sd);
7066 for (i = 0; i < nr_node_ids; i++)
7067 init_numa_sched_groups_power(d.sched_group_nodes[i]);
7069 if (d.sd_allnodes) {
7070 struct sched_group *sg;
7072 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
7074 init_numa_sched_groups_power(sg);
7078 /* Attach the domains */
7079 for_each_cpu(i, cpu_map) {
7080 #ifdef CONFIG_SCHED_SMT
7081 sd = &per_cpu(cpu_domains, i).sd;
7082 #elif defined(CONFIG_SCHED_MC)
7083 sd = &per_cpu(core_domains, i).sd;
7085 sd = &per_cpu(phys_domains, i).sd;
7087 cpu_attach_domain(sd, d.rd, i);
7090 d.sched_group_nodes = NULL; /* don't free this we still need it */
7091 __free_domain_allocs(&d, sa_tmpmask, cpu_map);
7095 __free_domain_allocs(&d, alloc_state, cpu_map);
7099 static int build_sched_domains(const struct cpumask *cpu_map)
7101 return __build_sched_domains(cpu_map, NULL);
7104 static cpumask_var_t *doms_cur; /* current sched domains */
7105 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
7106 static struct sched_domain_attr *dattr_cur;
7107 /* attribues of custom domains in 'doms_cur' */
7110 * Special case: If a kmalloc of a doms_cur partition (array of
7111 * cpumask) fails, then fallback to a single sched domain,
7112 * as determined by the single cpumask fallback_doms.
7114 static cpumask_var_t fallback_doms;
7117 * arch_update_cpu_topology lets virtualized architectures update the
7118 * cpu core maps. It is supposed to return 1 if the topology changed
7119 * or 0 if it stayed the same.
7121 int __attribute__((weak)) arch_update_cpu_topology(void)
7126 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
7129 cpumask_var_t *doms;
7131 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
7134 for (i = 0; i < ndoms; i++) {
7135 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
7136 free_sched_domains(doms, i);
7143 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
7146 for (i = 0; i < ndoms; i++)
7147 free_cpumask_var(doms[i]);
7152 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7153 * For now this just excludes isolated cpus, but could be used to
7154 * exclude other special cases in the future.
7156 static int arch_init_sched_domains(const struct cpumask *cpu_map)
7160 arch_update_cpu_topology();
7162 doms_cur = alloc_sched_domains(ndoms_cur);
7164 doms_cur = &fallback_doms;
7165 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
7167 err = build_sched_domains(doms_cur[0]);
7168 register_sched_domain_sysctl();
7173 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
7174 struct cpumask *tmpmask)
7176 free_sched_groups(cpu_map, tmpmask);
7180 * Detach sched domains from a group of cpus specified in cpu_map
7181 * These cpus will now be attached to the NULL domain
7183 static void detach_destroy_domains(const struct cpumask *cpu_map)
7185 /* Save because hotplug lock held. */
7186 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
7189 for_each_cpu(i, cpu_map)
7190 cpu_attach_domain(NULL, &def_root_domain, i);
7191 synchronize_sched();
7192 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
7195 /* handle null as "default" */
7196 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
7197 struct sched_domain_attr *new, int idx_new)
7199 struct sched_domain_attr tmp;
7206 return !memcmp(cur ? (cur + idx_cur) : &tmp,
7207 new ? (new + idx_new) : &tmp,
7208 sizeof(struct sched_domain_attr));
7212 * Partition sched domains as specified by the 'ndoms_new'
7213 * cpumasks in the array doms_new[] of cpumasks. This compares
7214 * doms_new[] to the current sched domain partitioning, doms_cur[].
7215 * It destroys each deleted domain and builds each new domain.
7217 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
7218 * The masks don't intersect (don't overlap.) We should setup one
7219 * sched domain for each mask. CPUs not in any of the cpumasks will
7220 * not be load balanced. If the same cpumask appears both in the
7221 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7224 * The passed in 'doms_new' should be allocated using
7225 * alloc_sched_domains. This routine takes ownership of it and will
7226 * free_sched_domains it when done with it. If the caller failed the
7227 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
7228 * and partition_sched_domains() will fallback to the single partition
7229 * 'fallback_doms', it also forces the domains to be rebuilt.
7231 * If doms_new == NULL it will be replaced with cpu_online_mask.
7232 * ndoms_new == 0 is a special case for destroying existing domains,
7233 * and it will not create the default domain.
7235 * Call with hotplug lock held
7237 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
7238 struct sched_domain_attr *dattr_new)
7243 mutex_lock(&sched_domains_mutex);
7245 /* always unregister in case we don't destroy any domains */
7246 unregister_sched_domain_sysctl();
7248 /* Let architecture update cpu core mappings. */
7249 new_topology = arch_update_cpu_topology();
7251 n = doms_new ? ndoms_new : 0;
7253 /* Destroy deleted domains */
7254 for (i = 0; i < ndoms_cur; i++) {
7255 for (j = 0; j < n && !new_topology; j++) {
7256 if (cpumask_equal(doms_cur[i], doms_new[j])
7257 && dattrs_equal(dattr_cur, i, dattr_new, j))
7260 /* no match - a current sched domain not in new doms_new[] */
7261 detach_destroy_domains(doms_cur[i]);
7266 if (doms_new == NULL) {
7268 doms_new = &fallback_doms;
7269 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
7270 WARN_ON_ONCE(dattr_new);
7273 /* Build new domains */
7274 for (i = 0; i < ndoms_new; i++) {
7275 for (j = 0; j < ndoms_cur && !new_topology; j++) {
7276 if (cpumask_equal(doms_new[i], doms_cur[j])
7277 && dattrs_equal(dattr_new, i, dattr_cur, j))
7280 /* no match - add a new doms_new */
7281 __build_sched_domains(doms_new[i],
7282 dattr_new ? dattr_new + i : NULL);
7287 /* Remember the new sched domains */
7288 if (doms_cur != &fallback_doms)
7289 free_sched_domains(doms_cur, ndoms_cur);
7290 kfree(dattr_cur); /* kfree(NULL) is safe */
7291 doms_cur = doms_new;
7292 dattr_cur = dattr_new;
7293 ndoms_cur = ndoms_new;
7295 register_sched_domain_sysctl();
7297 mutex_unlock(&sched_domains_mutex);
7300 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
7301 static void arch_reinit_sched_domains(void)
7305 /* Destroy domains first to force the rebuild */
7306 partition_sched_domains(0, NULL, NULL);
7308 rebuild_sched_domains();
7312 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
7314 unsigned int level = 0;
7316 if (sscanf(buf, "%u", &level) != 1)
7320 * level is always be positive so don't check for
7321 * level < POWERSAVINGS_BALANCE_NONE which is 0
7322 * What happens on 0 or 1 byte write,
7323 * need to check for count as well?
7326 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
7330 sched_smt_power_savings = level;
7332 sched_mc_power_savings = level;
7334 arch_reinit_sched_domains();
7339 #ifdef CONFIG_SCHED_MC
7340 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
7343 return sprintf(page, "%u\n", sched_mc_power_savings);
7345 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
7346 const char *buf, size_t count)
7348 return sched_power_savings_store(buf, count, 0);
7350 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
7351 sched_mc_power_savings_show,
7352 sched_mc_power_savings_store);
7355 #ifdef CONFIG_SCHED_SMT
7356 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
7359 return sprintf(page, "%u\n", sched_smt_power_savings);
7361 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
7362 const char *buf, size_t count)
7364 return sched_power_savings_store(buf, count, 1);
7366 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
7367 sched_smt_power_savings_show,
7368 sched_smt_power_savings_store);
7371 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
7375 #ifdef CONFIG_SCHED_SMT
7377 err = sysfs_create_file(&cls->kset.kobj,
7378 &attr_sched_smt_power_savings.attr);
7380 #ifdef CONFIG_SCHED_MC
7381 if (!err && mc_capable())
7382 err = sysfs_create_file(&cls->kset.kobj,
7383 &attr_sched_mc_power_savings.attr);
7387 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
7389 #ifndef CONFIG_CPUSETS
7391 * Add online and remove offline CPUs from the scheduler domains.
7392 * When cpusets are enabled they take over this function.
7394 static int update_sched_domains(struct notifier_block *nfb,
7395 unsigned long action, void *hcpu)
7399 case CPU_ONLINE_FROZEN:
7400 case CPU_DOWN_PREPARE:
7401 case CPU_DOWN_PREPARE_FROZEN:
7402 case CPU_DOWN_FAILED:
7403 case CPU_DOWN_FAILED_FROZEN:
7404 partition_sched_domains(1, NULL, NULL);
7413 static int update_runtime(struct notifier_block *nfb,
7414 unsigned long action, void *hcpu)
7416 int cpu = (int)(long)hcpu;
7419 case CPU_DOWN_PREPARE:
7420 case CPU_DOWN_PREPARE_FROZEN:
7421 disable_runtime(cpu_rq(cpu));
7424 case CPU_DOWN_FAILED:
7425 case CPU_DOWN_FAILED_FROZEN:
7427 case CPU_ONLINE_FROZEN:
7428 enable_runtime(cpu_rq(cpu));
7436 void __init sched_init_smp(void)
7438 cpumask_var_t non_isolated_cpus;
7440 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
7441 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
7443 #if defined(CONFIG_NUMA)
7444 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
7446 BUG_ON(sched_group_nodes_bycpu == NULL);
7449 mutex_lock(&sched_domains_mutex);
7450 arch_init_sched_domains(cpu_active_mask);
7451 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
7452 if (cpumask_empty(non_isolated_cpus))
7453 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
7454 mutex_unlock(&sched_domains_mutex);
7457 #ifndef CONFIG_CPUSETS
7458 /* XXX: Theoretical race here - CPU may be hotplugged now */
7459 hotcpu_notifier(update_sched_domains, 0);
7462 /* RT runtime code needs to handle some hotplug events */
7463 hotcpu_notifier(update_runtime, 0);
7467 /* Move init over to a non-isolated CPU */
7468 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
7470 sched_init_granularity();
7471 free_cpumask_var(non_isolated_cpus);
7473 init_sched_rt_class();
7476 void __init sched_init_smp(void)
7478 sched_init_granularity();
7480 #endif /* CONFIG_SMP */
7482 const_debug unsigned int sysctl_timer_migration = 1;
7484 int in_sched_functions(unsigned long addr)
7486 return in_lock_functions(addr) ||
7487 (addr >= (unsigned long)__sched_text_start
7488 && addr < (unsigned long)__sched_text_end);
7491 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
7493 cfs_rq->tasks_timeline = RB_ROOT;
7494 INIT_LIST_HEAD(&cfs_rq->tasks);
7495 #ifdef CONFIG_FAIR_GROUP_SCHED
7498 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
7501 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
7503 struct rt_prio_array *array;
7506 array = &rt_rq->active;
7507 for (i = 0; i < MAX_RT_PRIO; i++) {
7508 INIT_LIST_HEAD(array->queue + i);
7509 __clear_bit(i, array->bitmap);
7511 /* delimiter for bitsearch: */
7512 __set_bit(MAX_RT_PRIO, array->bitmap);
7514 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
7515 rt_rq->highest_prio.curr = MAX_RT_PRIO;
7517 rt_rq->highest_prio.next = MAX_RT_PRIO;
7521 rt_rq->rt_nr_migratory = 0;
7522 rt_rq->overloaded = 0;
7523 plist_head_init_raw(&rt_rq->pushable_tasks, &rq->lock);
7527 rt_rq->rt_throttled = 0;
7528 rt_rq->rt_runtime = 0;
7529 raw_spin_lock_init(&rt_rq->rt_runtime_lock);
7531 #ifdef CONFIG_RT_GROUP_SCHED
7532 rt_rq->rt_nr_boosted = 0;
7537 #ifdef CONFIG_FAIR_GROUP_SCHED
7538 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
7539 struct sched_entity *se, int cpu, int add,
7540 struct sched_entity *parent)
7542 struct rq *rq = cpu_rq(cpu);
7543 tg->cfs_rq[cpu] = cfs_rq;
7544 init_cfs_rq(cfs_rq, rq);
7547 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
7550 /* se could be NULL for init_task_group */
7555 se->cfs_rq = &rq->cfs;
7557 se->cfs_rq = parent->my_q;
7560 se->load.weight = tg->shares;
7561 se->load.inv_weight = 0;
7562 se->parent = parent;
7566 #ifdef CONFIG_RT_GROUP_SCHED
7567 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
7568 struct sched_rt_entity *rt_se, int cpu, int add,
7569 struct sched_rt_entity *parent)
7571 struct rq *rq = cpu_rq(cpu);
7573 tg->rt_rq[cpu] = rt_rq;
7574 init_rt_rq(rt_rq, rq);
7576 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
7578 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
7580 tg->rt_se[cpu] = rt_se;
7585 rt_se->rt_rq = &rq->rt;
7587 rt_se->rt_rq = parent->my_q;
7589 rt_se->my_q = rt_rq;
7590 rt_se->parent = parent;
7591 INIT_LIST_HEAD(&rt_se->run_list);
7595 void __init sched_init(void)
7598 unsigned long alloc_size = 0, ptr;
7600 #ifdef CONFIG_FAIR_GROUP_SCHED
7601 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7603 #ifdef CONFIG_RT_GROUP_SCHED
7604 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7606 #ifdef CONFIG_CPUMASK_OFFSTACK
7607 alloc_size += num_possible_cpus() * cpumask_size();
7610 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
7612 #ifdef CONFIG_FAIR_GROUP_SCHED
7613 init_task_group.se = (struct sched_entity **)ptr;
7614 ptr += nr_cpu_ids * sizeof(void **);
7616 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
7617 ptr += nr_cpu_ids * sizeof(void **);
7619 #endif /* CONFIG_FAIR_GROUP_SCHED */
7620 #ifdef CONFIG_RT_GROUP_SCHED
7621 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
7622 ptr += nr_cpu_ids * sizeof(void **);
7624 init_task_group.rt_rq = (struct rt_rq **)ptr;
7625 ptr += nr_cpu_ids * sizeof(void **);
7627 #endif /* CONFIG_RT_GROUP_SCHED */
7628 #ifdef CONFIG_CPUMASK_OFFSTACK
7629 for_each_possible_cpu(i) {
7630 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
7631 ptr += cpumask_size();
7633 #endif /* CONFIG_CPUMASK_OFFSTACK */
7637 init_defrootdomain();
7640 init_rt_bandwidth(&def_rt_bandwidth,
7641 global_rt_period(), global_rt_runtime());
7643 #ifdef CONFIG_RT_GROUP_SCHED
7644 init_rt_bandwidth(&init_task_group.rt_bandwidth,
7645 global_rt_period(), global_rt_runtime());
7646 #endif /* CONFIG_RT_GROUP_SCHED */
7648 #ifdef CONFIG_CGROUP_SCHED
7649 list_add(&init_task_group.list, &task_groups);
7650 INIT_LIST_HEAD(&init_task_group.children);
7652 #endif /* CONFIG_CGROUP_SCHED */
7654 #if defined CONFIG_FAIR_GROUP_SCHED && defined CONFIG_SMP
7655 update_shares_data = __alloc_percpu(nr_cpu_ids * sizeof(unsigned long),
7656 __alignof__(unsigned long));
7658 for_each_possible_cpu(i) {
7662 raw_spin_lock_init(&rq->lock);
7664 rq->calc_load_active = 0;
7665 rq->calc_load_update = jiffies + LOAD_FREQ;
7666 init_cfs_rq(&rq->cfs, rq);
7667 init_rt_rq(&rq->rt, rq);
7668 #ifdef CONFIG_FAIR_GROUP_SCHED
7669 init_task_group.shares = init_task_group_load;
7670 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
7671 #ifdef CONFIG_CGROUP_SCHED
7673 * How much cpu bandwidth does init_task_group get?
7675 * In case of task-groups formed thr' the cgroup filesystem, it
7676 * gets 100% of the cpu resources in the system. This overall
7677 * system cpu resource is divided among the tasks of
7678 * init_task_group and its child task-groups in a fair manner,
7679 * based on each entity's (task or task-group's) weight
7680 * (se->load.weight).
7682 * In other words, if init_task_group has 10 tasks of weight
7683 * 1024) and two child groups A0 and A1 (of weight 1024 each),
7684 * then A0's share of the cpu resource is:
7686 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
7688 * We achieve this by letting init_task_group's tasks sit
7689 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
7691 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
7693 #endif /* CONFIG_FAIR_GROUP_SCHED */
7695 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
7696 #ifdef CONFIG_RT_GROUP_SCHED
7697 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
7698 #ifdef CONFIG_CGROUP_SCHED
7699 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
7703 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
7704 rq->cpu_load[j] = 0;
7708 rq->post_schedule = 0;
7709 rq->active_balance = 0;
7710 rq->next_balance = jiffies;
7714 rq->migration_thread = NULL;
7716 rq->avg_idle = 2*sysctl_sched_migration_cost;
7717 INIT_LIST_HEAD(&rq->migration_queue);
7718 rq_attach_root(rq, &def_root_domain);
7721 atomic_set(&rq->nr_iowait, 0);
7724 set_load_weight(&init_task);
7726 #ifdef CONFIG_PREEMPT_NOTIFIERS
7727 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
7731 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
7734 #ifdef CONFIG_RT_MUTEXES
7735 plist_head_init_raw(&init_task.pi_waiters, &init_task.pi_lock);
7739 * The boot idle thread does lazy MMU switching as well:
7741 atomic_inc(&init_mm.mm_count);
7742 enter_lazy_tlb(&init_mm, current);
7745 * Make us the idle thread. Technically, schedule() should not be
7746 * called from this thread, however somewhere below it might be,
7747 * but because we are the idle thread, we just pick up running again
7748 * when this runqueue becomes "idle".
7750 init_idle(current, smp_processor_id());
7752 calc_load_update = jiffies + LOAD_FREQ;
7755 * During early bootup we pretend to be a normal task:
7757 current->sched_class = &fair_sched_class;
7759 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
7760 zalloc_cpumask_var(&nohz_cpu_mask, GFP_NOWAIT);
7763 zalloc_cpumask_var(&nohz.cpu_mask, GFP_NOWAIT);
7764 alloc_cpumask_var(&nohz.ilb_grp_nohz_mask, GFP_NOWAIT);
7766 /* May be allocated at isolcpus cmdline parse time */
7767 if (cpu_isolated_map == NULL)
7768 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7773 scheduler_running = 1;
7776 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
7777 static inline int preempt_count_equals(int preempt_offset)
7779 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
7781 return (nested == PREEMPT_INATOMIC_BASE + preempt_offset);
7784 void __might_sleep(const char *file, int line, int preempt_offset)
7787 static unsigned long prev_jiffy; /* ratelimiting */
7789 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
7790 system_state != SYSTEM_RUNNING || oops_in_progress)
7792 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7794 prev_jiffy = jiffies;
7797 "BUG: sleeping function called from invalid context at %s:%d\n",
7800 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7801 in_atomic(), irqs_disabled(),
7802 current->pid, current->comm);
7804 debug_show_held_locks(current);
7805 if (irqs_disabled())
7806 print_irqtrace_events(current);
7810 EXPORT_SYMBOL(__might_sleep);
7813 #ifdef CONFIG_MAGIC_SYSRQ
7814 static void normalize_task(struct rq *rq, struct task_struct *p)
7818 on_rq = p->se.on_rq;
7820 deactivate_task(rq, p, 0);
7821 __setscheduler(rq, p, SCHED_NORMAL, 0);
7823 activate_task(rq, p, 0);
7824 resched_task(rq->curr);
7828 void normalize_rt_tasks(void)
7830 struct task_struct *g, *p;
7831 unsigned long flags;
7834 read_lock_irqsave(&tasklist_lock, flags);
7835 do_each_thread(g, p) {
7837 * Only normalize user tasks:
7842 p->se.exec_start = 0;
7843 #ifdef CONFIG_SCHEDSTATS
7844 p->se.statistics.wait_start = 0;
7845 p->se.statistics.sleep_start = 0;
7846 p->se.statistics.block_start = 0;
7851 * Renice negative nice level userspace
7854 if (TASK_NICE(p) < 0 && p->mm)
7855 set_user_nice(p, 0);
7859 raw_spin_lock(&p->pi_lock);
7860 rq = __task_rq_lock(p);
7862 normalize_task(rq, p);
7864 __task_rq_unlock(rq);
7865 raw_spin_unlock(&p->pi_lock);
7866 } while_each_thread(g, p);
7868 read_unlock_irqrestore(&tasklist_lock, flags);
7871 #endif /* CONFIG_MAGIC_SYSRQ */
7875 * These functions are only useful for the IA64 MCA handling.
7877 * They can only be called when the whole system has been
7878 * stopped - every CPU needs to be quiescent, and no scheduling
7879 * activity can take place. Using them for anything else would
7880 * be a serious bug, and as a result, they aren't even visible
7881 * under any other configuration.
7885 * curr_task - return the current task for a given cpu.
7886 * @cpu: the processor in question.
7888 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7890 struct task_struct *curr_task(int cpu)
7892 return cpu_curr(cpu);
7896 * set_curr_task - set the current task for a given cpu.
7897 * @cpu: the processor in question.
7898 * @p: the task pointer to set.
7900 * Description: This function must only be used when non-maskable interrupts
7901 * are serviced on a separate stack. It allows the architecture to switch the
7902 * notion of the current task on a cpu in a non-blocking manner. This function
7903 * must be called with all CPU's synchronized, and interrupts disabled, the
7904 * and caller must save the original value of the current task (see
7905 * curr_task() above) and restore that value before reenabling interrupts and
7906 * re-starting the system.
7908 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7910 void set_curr_task(int cpu, struct task_struct *p)
7917 #ifdef CONFIG_FAIR_GROUP_SCHED
7918 static void free_fair_sched_group(struct task_group *tg)
7922 for_each_possible_cpu(i) {
7924 kfree(tg->cfs_rq[i]);
7934 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
7936 struct cfs_rq *cfs_rq;
7937 struct sched_entity *se;
7941 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
7944 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
7948 tg->shares = NICE_0_LOAD;
7950 for_each_possible_cpu(i) {
7953 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
7954 GFP_KERNEL, cpu_to_node(i));
7958 se = kzalloc_node(sizeof(struct sched_entity),
7959 GFP_KERNEL, cpu_to_node(i));
7963 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
7974 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
7976 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
7977 &cpu_rq(cpu)->leaf_cfs_rq_list);
7980 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
7982 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
7984 #else /* !CONFG_FAIR_GROUP_SCHED */
7985 static inline void free_fair_sched_group(struct task_group *tg)
7990 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
7995 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
7999 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
8002 #endif /* CONFIG_FAIR_GROUP_SCHED */
8004 #ifdef CONFIG_RT_GROUP_SCHED
8005 static void free_rt_sched_group(struct task_group *tg)
8009 destroy_rt_bandwidth(&tg->rt_bandwidth);
8011 for_each_possible_cpu(i) {
8013 kfree(tg->rt_rq[i]);
8015 kfree(tg->rt_se[i]);
8023 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8025 struct rt_rq *rt_rq;
8026 struct sched_rt_entity *rt_se;
8030 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
8033 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
8037 init_rt_bandwidth(&tg->rt_bandwidth,
8038 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
8040 for_each_possible_cpu(i) {
8043 rt_rq = kzalloc_node(sizeof(struct rt_rq),
8044 GFP_KERNEL, cpu_to_node(i));
8048 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
8049 GFP_KERNEL, cpu_to_node(i));
8053 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
8064 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8066 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
8067 &cpu_rq(cpu)->leaf_rt_rq_list);
8070 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8072 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
8074 #else /* !CONFIG_RT_GROUP_SCHED */
8075 static inline void free_rt_sched_group(struct task_group *tg)
8080 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8085 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8089 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8092 #endif /* CONFIG_RT_GROUP_SCHED */
8094 #ifdef CONFIG_CGROUP_SCHED
8095 static void free_sched_group(struct task_group *tg)
8097 free_fair_sched_group(tg);
8098 free_rt_sched_group(tg);
8102 /* allocate runqueue etc for a new task group */
8103 struct task_group *sched_create_group(struct task_group *parent)
8105 struct task_group *tg;
8106 unsigned long flags;
8109 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
8111 return ERR_PTR(-ENOMEM);
8113 if (!alloc_fair_sched_group(tg, parent))
8116 if (!alloc_rt_sched_group(tg, parent))
8119 spin_lock_irqsave(&task_group_lock, flags);
8120 for_each_possible_cpu(i) {
8121 register_fair_sched_group(tg, i);
8122 register_rt_sched_group(tg, i);
8124 list_add_rcu(&tg->list, &task_groups);
8126 WARN_ON(!parent); /* root should already exist */
8128 tg->parent = parent;
8129 INIT_LIST_HEAD(&tg->children);
8130 list_add_rcu(&tg->siblings, &parent->children);
8131 spin_unlock_irqrestore(&task_group_lock, flags);
8136 free_sched_group(tg);
8137 return ERR_PTR(-ENOMEM);
8140 /* rcu callback to free various structures associated with a task group */
8141 static void free_sched_group_rcu(struct rcu_head *rhp)
8143 /* now it should be safe to free those cfs_rqs */
8144 free_sched_group(container_of(rhp, struct task_group, rcu));
8147 /* Destroy runqueue etc associated with a task group */
8148 void sched_destroy_group(struct task_group *tg)
8150 unsigned long flags;
8153 spin_lock_irqsave(&task_group_lock, flags);
8154 for_each_possible_cpu(i) {
8155 unregister_fair_sched_group(tg, i);
8156 unregister_rt_sched_group(tg, i);
8158 list_del_rcu(&tg->list);
8159 list_del_rcu(&tg->siblings);
8160 spin_unlock_irqrestore(&task_group_lock, flags);
8162 /* wait for possible concurrent references to cfs_rqs complete */
8163 call_rcu(&tg->rcu, free_sched_group_rcu);
8166 /* change task's runqueue when it moves between groups.
8167 * The caller of this function should have put the task in its new group
8168 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
8169 * reflect its new group.
8171 void sched_move_task(struct task_struct *tsk)
8174 unsigned long flags;
8177 rq = task_rq_lock(tsk, &flags);
8179 running = task_current(rq, tsk);
8180 on_rq = tsk->se.on_rq;
8183 dequeue_task(rq, tsk, 0);
8184 if (unlikely(running))
8185 tsk->sched_class->put_prev_task(rq, tsk);
8187 set_task_rq(tsk, task_cpu(tsk));
8189 #ifdef CONFIG_FAIR_GROUP_SCHED
8190 if (tsk->sched_class->moved_group)
8191 tsk->sched_class->moved_group(tsk, on_rq);
8194 if (unlikely(running))
8195 tsk->sched_class->set_curr_task(rq);
8197 enqueue_task(rq, tsk, 0, false);
8199 task_rq_unlock(rq, &flags);
8201 #endif /* CONFIG_CGROUP_SCHED */
8203 #ifdef CONFIG_FAIR_GROUP_SCHED
8204 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
8206 struct cfs_rq *cfs_rq = se->cfs_rq;
8211 dequeue_entity(cfs_rq, se, 0);
8213 se->load.weight = shares;
8214 se->load.inv_weight = 0;
8217 enqueue_entity(cfs_rq, se, 0);
8220 static void set_se_shares(struct sched_entity *se, unsigned long shares)
8222 struct cfs_rq *cfs_rq = se->cfs_rq;
8223 struct rq *rq = cfs_rq->rq;
8224 unsigned long flags;
8226 raw_spin_lock_irqsave(&rq->lock, flags);
8227 __set_se_shares(se, shares);
8228 raw_spin_unlock_irqrestore(&rq->lock, flags);
8231 static DEFINE_MUTEX(shares_mutex);
8233 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
8236 unsigned long flags;
8239 * We can't change the weight of the root cgroup.
8244 if (shares < MIN_SHARES)
8245 shares = MIN_SHARES;
8246 else if (shares > MAX_SHARES)
8247 shares = MAX_SHARES;
8249 mutex_lock(&shares_mutex);
8250 if (tg->shares == shares)
8253 spin_lock_irqsave(&task_group_lock, flags);
8254 for_each_possible_cpu(i)
8255 unregister_fair_sched_group(tg, i);
8256 list_del_rcu(&tg->siblings);
8257 spin_unlock_irqrestore(&task_group_lock, flags);
8259 /* wait for any ongoing reference to this group to finish */
8260 synchronize_sched();
8263 * Now we are free to modify the group's share on each cpu
8264 * w/o tripping rebalance_share or load_balance_fair.
8266 tg->shares = shares;
8267 for_each_possible_cpu(i) {
8271 cfs_rq_set_shares(tg->cfs_rq[i], 0);
8272 set_se_shares(tg->se[i], shares);
8276 * Enable load balance activity on this group, by inserting it back on
8277 * each cpu's rq->leaf_cfs_rq_list.
8279 spin_lock_irqsave(&task_group_lock, flags);
8280 for_each_possible_cpu(i)
8281 register_fair_sched_group(tg, i);
8282 list_add_rcu(&tg->siblings, &tg->parent->children);
8283 spin_unlock_irqrestore(&task_group_lock, flags);
8285 mutex_unlock(&shares_mutex);
8289 unsigned long sched_group_shares(struct task_group *tg)
8295 #ifdef CONFIG_RT_GROUP_SCHED
8297 * Ensure that the real time constraints are schedulable.
8299 static DEFINE_MUTEX(rt_constraints_mutex);
8301 static unsigned long to_ratio(u64 period, u64 runtime)
8303 if (runtime == RUNTIME_INF)
8306 return div64_u64(runtime << 20, period);
8309 /* Must be called with tasklist_lock held */
8310 static inline int tg_has_rt_tasks(struct task_group *tg)
8312 struct task_struct *g, *p;
8314 do_each_thread(g, p) {
8315 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
8317 } while_each_thread(g, p);
8322 struct rt_schedulable_data {
8323 struct task_group *tg;
8328 static int tg_schedulable(struct task_group *tg, void *data)
8330 struct rt_schedulable_data *d = data;
8331 struct task_group *child;
8332 unsigned long total, sum = 0;
8333 u64 period, runtime;
8335 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8336 runtime = tg->rt_bandwidth.rt_runtime;
8339 period = d->rt_period;
8340 runtime = d->rt_runtime;
8344 * Cannot have more runtime than the period.
8346 if (runtime > period && runtime != RUNTIME_INF)
8350 * Ensure we don't starve existing RT tasks.
8352 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
8355 total = to_ratio(period, runtime);
8358 * Nobody can have more than the global setting allows.
8360 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
8364 * The sum of our children's runtime should not exceed our own.
8366 list_for_each_entry_rcu(child, &tg->children, siblings) {
8367 period = ktime_to_ns(child->rt_bandwidth.rt_period);
8368 runtime = child->rt_bandwidth.rt_runtime;
8370 if (child == d->tg) {
8371 period = d->rt_period;
8372 runtime = d->rt_runtime;
8375 sum += to_ratio(period, runtime);
8384 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
8386 struct rt_schedulable_data data = {
8388 .rt_period = period,
8389 .rt_runtime = runtime,
8392 return walk_tg_tree(tg_schedulable, tg_nop, &data);
8395 static int tg_set_bandwidth(struct task_group *tg,
8396 u64 rt_period, u64 rt_runtime)
8400 mutex_lock(&rt_constraints_mutex);
8401 read_lock(&tasklist_lock);
8402 err = __rt_schedulable(tg, rt_period, rt_runtime);
8406 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8407 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
8408 tg->rt_bandwidth.rt_runtime = rt_runtime;
8410 for_each_possible_cpu(i) {
8411 struct rt_rq *rt_rq = tg->rt_rq[i];
8413 raw_spin_lock(&rt_rq->rt_runtime_lock);
8414 rt_rq->rt_runtime = rt_runtime;
8415 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8417 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8419 read_unlock(&tasklist_lock);
8420 mutex_unlock(&rt_constraints_mutex);
8425 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
8427 u64 rt_runtime, rt_period;
8429 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8430 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
8431 if (rt_runtime_us < 0)
8432 rt_runtime = RUNTIME_INF;
8434 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8437 long sched_group_rt_runtime(struct task_group *tg)
8441 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
8444 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
8445 do_div(rt_runtime_us, NSEC_PER_USEC);
8446 return rt_runtime_us;
8449 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
8451 u64 rt_runtime, rt_period;
8453 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
8454 rt_runtime = tg->rt_bandwidth.rt_runtime;
8459 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8462 long sched_group_rt_period(struct task_group *tg)
8466 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
8467 do_div(rt_period_us, NSEC_PER_USEC);
8468 return rt_period_us;
8471 static int sched_rt_global_constraints(void)
8473 u64 runtime, period;
8476 if (sysctl_sched_rt_period <= 0)
8479 runtime = global_rt_runtime();
8480 period = global_rt_period();
8483 * Sanity check on the sysctl variables.
8485 if (runtime > period && runtime != RUNTIME_INF)
8488 mutex_lock(&rt_constraints_mutex);
8489 read_lock(&tasklist_lock);
8490 ret = __rt_schedulable(NULL, 0, 0);
8491 read_unlock(&tasklist_lock);
8492 mutex_unlock(&rt_constraints_mutex);
8497 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
8499 /* Don't accept realtime tasks when there is no way for them to run */
8500 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
8506 #else /* !CONFIG_RT_GROUP_SCHED */
8507 static int sched_rt_global_constraints(void)
8509 unsigned long flags;
8512 if (sysctl_sched_rt_period <= 0)
8516 * There's always some RT tasks in the root group
8517 * -- migration, kstopmachine etc..
8519 if (sysctl_sched_rt_runtime == 0)
8522 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
8523 for_each_possible_cpu(i) {
8524 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
8526 raw_spin_lock(&rt_rq->rt_runtime_lock);
8527 rt_rq->rt_runtime = global_rt_runtime();
8528 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8530 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
8534 #endif /* CONFIG_RT_GROUP_SCHED */
8536 int sched_rt_handler(struct ctl_table *table, int write,
8537 void __user *buffer, size_t *lenp,
8541 int old_period, old_runtime;
8542 static DEFINE_MUTEX(mutex);
8545 old_period = sysctl_sched_rt_period;
8546 old_runtime = sysctl_sched_rt_runtime;
8548 ret = proc_dointvec(table, write, buffer, lenp, ppos);
8550 if (!ret && write) {
8551 ret = sched_rt_global_constraints();
8553 sysctl_sched_rt_period = old_period;
8554 sysctl_sched_rt_runtime = old_runtime;
8556 def_rt_bandwidth.rt_runtime = global_rt_runtime();
8557 def_rt_bandwidth.rt_period =
8558 ns_to_ktime(global_rt_period());
8561 mutex_unlock(&mutex);
8566 #ifdef CONFIG_CGROUP_SCHED
8568 /* return corresponding task_group object of a cgroup */
8569 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
8571 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
8572 struct task_group, css);
8575 static struct cgroup_subsys_state *
8576 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
8578 struct task_group *tg, *parent;
8580 if (!cgrp->parent) {
8581 /* This is early initialization for the top cgroup */
8582 return &init_task_group.css;
8585 parent = cgroup_tg(cgrp->parent);
8586 tg = sched_create_group(parent);
8588 return ERR_PTR(-ENOMEM);
8594 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
8596 struct task_group *tg = cgroup_tg(cgrp);
8598 sched_destroy_group(tg);
8602 cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
8604 #ifdef CONFIG_RT_GROUP_SCHED
8605 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
8608 /* We don't support RT-tasks being in separate groups */
8609 if (tsk->sched_class != &fair_sched_class)
8616 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
8617 struct task_struct *tsk, bool threadgroup)
8619 int retval = cpu_cgroup_can_attach_task(cgrp, tsk);
8623 struct task_struct *c;
8625 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
8626 retval = cpu_cgroup_can_attach_task(cgrp, c);
8638 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
8639 struct cgroup *old_cont, struct task_struct *tsk,
8642 sched_move_task(tsk);
8644 struct task_struct *c;
8646 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
8653 #ifdef CONFIG_FAIR_GROUP_SCHED
8654 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
8657 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
8660 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
8662 struct task_group *tg = cgroup_tg(cgrp);
8664 return (u64) tg->shares;
8666 #endif /* CONFIG_FAIR_GROUP_SCHED */
8668 #ifdef CONFIG_RT_GROUP_SCHED
8669 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
8672 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
8675 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
8677 return sched_group_rt_runtime(cgroup_tg(cgrp));
8680 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
8683 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
8686 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
8688 return sched_group_rt_period(cgroup_tg(cgrp));
8690 #endif /* CONFIG_RT_GROUP_SCHED */
8692 static struct cftype cpu_files[] = {
8693 #ifdef CONFIG_FAIR_GROUP_SCHED
8696 .read_u64 = cpu_shares_read_u64,
8697 .write_u64 = cpu_shares_write_u64,
8700 #ifdef CONFIG_RT_GROUP_SCHED
8702 .name = "rt_runtime_us",
8703 .read_s64 = cpu_rt_runtime_read,
8704 .write_s64 = cpu_rt_runtime_write,
8707 .name = "rt_period_us",
8708 .read_u64 = cpu_rt_period_read_uint,
8709 .write_u64 = cpu_rt_period_write_uint,
8714 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
8716 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
8719 struct cgroup_subsys cpu_cgroup_subsys = {
8721 .create = cpu_cgroup_create,
8722 .destroy = cpu_cgroup_destroy,
8723 .can_attach = cpu_cgroup_can_attach,
8724 .attach = cpu_cgroup_attach,
8725 .populate = cpu_cgroup_populate,
8726 .subsys_id = cpu_cgroup_subsys_id,
8730 #endif /* CONFIG_CGROUP_SCHED */
8732 #ifdef CONFIG_CGROUP_CPUACCT
8735 * CPU accounting code for task groups.
8737 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
8738 * (balbir@in.ibm.com).
8741 /* track cpu usage of a group of tasks and its child groups */
8743 struct cgroup_subsys_state css;
8744 /* cpuusage holds pointer to a u64-type object on every cpu */
8746 struct percpu_counter cpustat[CPUACCT_STAT_NSTATS];
8747 struct cpuacct *parent;
8750 struct cgroup_subsys cpuacct_subsys;
8752 /* return cpu accounting group corresponding to this container */
8753 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
8755 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
8756 struct cpuacct, css);
8759 /* return cpu accounting group to which this task belongs */
8760 static inline struct cpuacct *task_ca(struct task_struct *tsk)
8762 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
8763 struct cpuacct, css);
8766 /* create a new cpu accounting group */
8767 static struct cgroup_subsys_state *cpuacct_create(
8768 struct cgroup_subsys *ss, struct cgroup *cgrp)
8770 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
8776 ca->cpuusage = alloc_percpu(u64);
8780 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
8781 if (percpu_counter_init(&ca->cpustat[i], 0))
8782 goto out_free_counters;
8785 ca->parent = cgroup_ca(cgrp->parent);
8791 percpu_counter_destroy(&ca->cpustat[i]);
8792 free_percpu(ca->cpuusage);
8796 return ERR_PTR(-ENOMEM);
8799 /* destroy an existing cpu accounting group */
8801 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
8803 struct cpuacct *ca = cgroup_ca(cgrp);
8806 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
8807 percpu_counter_destroy(&ca->cpustat[i]);
8808 free_percpu(ca->cpuusage);
8812 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
8814 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8817 #ifndef CONFIG_64BIT
8819 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
8821 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8823 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8831 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
8833 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8835 #ifndef CONFIG_64BIT
8837 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
8839 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8841 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8847 /* return total cpu usage (in nanoseconds) of a group */
8848 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
8850 struct cpuacct *ca = cgroup_ca(cgrp);
8851 u64 totalcpuusage = 0;
8854 for_each_present_cpu(i)
8855 totalcpuusage += cpuacct_cpuusage_read(ca, i);
8857 return totalcpuusage;
8860 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
8863 struct cpuacct *ca = cgroup_ca(cgrp);
8872 for_each_present_cpu(i)
8873 cpuacct_cpuusage_write(ca, i, 0);
8879 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
8882 struct cpuacct *ca = cgroup_ca(cgroup);
8886 for_each_present_cpu(i) {
8887 percpu = cpuacct_cpuusage_read(ca, i);
8888 seq_printf(m, "%llu ", (unsigned long long) percpu);
8890 seq_printf(m, "\n");
8894 static const char *cpuacct_stat_desc[] = {
8895 [CPUACCT_STAT_USER] = "user",
8896 [CPUACCT_STAT_SYSTEM] = "system",
8899 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
8900 struct cgroup_map_cb *cb)
8902 struct cpuacct *ca = cgroup_ca(cgrp);
8905 for (i = 0; i < CPUACCT_STAT_NSTATS; i++) {
8906 s64 val = percpu_counter_read(&ca->cpustat[i]);
8907 val = cputime64_to_clock_t(val);
8908 cb->fill(cb, cpuacct_stat_desc[i], val);
8913 static struct cftype files[] = {
8916 .read_u64 = cpuusage_read,
8917 .write_u64 = cpuusage_write,
8920 .name = "usage_percpu",
8921 .read_seq_string = cpuacct_percpu_seq_read,
8925 .read_map = cpuacct_stats_show,
8929 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
8931 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
8935 * charge this task's execution time to its accounting group.
8937 * called with rq->lock held.
8939 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
8944 if (unlikely(!cpuacct_subsys.active))
8947 cpu = task_cpu(tsk);
8953 for (; ca; ca = ca->parent) {
8954 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8955 *cpuusage += cputime;
8962 * When CONFIG_VIRT_CPU_ACCOUNTING is enabled one jiffy can be very large
8963 * in cputime_t units. As a result, cpuacct_update_stats calls
8964 * percpu_counter_add with values large enough to always overflow the
8965 * per cpu batch limit causing bad SMP scalability.
8967 * To fix this we scale percpu_counter_batch by cputime_one_jiffy so we
8968 * batch the same amount of time with CONFIG_VIRT_CPU_ACCOUNTING disabled
8969 * and enabled. We cap it at INT_MAX which is the largest allowed batch value.
8972 #define CPUACCT_BATCH \
8973 min_t(long, percpu_counter_batch * cputime_one_jiffy, INT_MAX)
8975 #define CPUACCT_BATCH 0
8979 * Charge the system/user time to the task's accounting group.
8981 static void cpuacct_update_stats(struct task_struct *tsk,
8982 enum cpuacct_stat_index idx, cputime_t val)
8985 int batch = CPUACCT_BATCH;
8987 if (unlikely(!cpuacct_subsys.active))
8994 __percpu_counter_add(&ca->cpustat[idx], val, batch);
9000 struct cgroup_subsys cpuacct_subsys = {
9002 .create = cpuacct_create,
9003 .destroy = cpuacct_destroy,
9004 .populate = cpuacct_populate,
9005 .subsys_id = cpuacct_subsys_id,
9007 #endif /* CONFIG_CGROUP_CPUACCT */
9011 int rcu_expedited_torture_stats(char *page)
9015 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
9017 void synchronize_sched_expedited(void)
9020 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
9022 #else /* #ifndef CONFIG_SMP */
9024 static DEFINE_PER_CPU(struct migration_req, rcu_migration_req);
9025 static DEFINE_MUTEX(rcu_sched_expedited_mutex);
9027 #define RCU_EXPEDITED_STATE_POST -2
9028 #define RCU_EXPEDITED_STATE_IDLE -1
9030 static int rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
9032 int rcu_expedited_torture_stats(char *page)
9037 cnt += sprintf(&page[cnt], "state: %d /", rcu_expedited_state);
9038 for_each_online_cpu(cpu) {
9039 cnt += sprintf(&page[cnt], " %d:%d",
9040 cpu, per_cpu(rcu_migration_req, cpu).dest_cpu);
9042 cnt += sprintf(&page[cnt], "\n");
9045 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
9047 static long synchronize_sched_expedited_count;
9050 * Wait for an rcu-sched grace period to elapse, but use "big hammer"
9051 * approach to force grace period to end quickly. This consumes
9052 * significant time on all CPUs, and is thus not recommended for
9053 * any sort of common-case code.
9055 * Note that it is illegal to call this function while holding any
9056 * lock that is acquired by a CPU-hotplug notifier. Failing to
9057 * observe this restriction will result in deadlock.
9059 void synchronize_sched_expedited(void)
9062 unsigned long flags;
9063 bool need_full_sync = 0;
9065 struct migration_req *req;
9069 smp_mb(); /* ensure prior mod happens before capturing snap. */
9070 snap = ACCESS_ONCE(synchronize_sched_expedited_count) + 1;
9072 while (!mutex_trylock(&rcu_sched_expedited_mutex)) {
9074 if (trycount++ < 10)
9075 udelay(trycount * num_online_cpus());
9077 synchronize_sched();
9080 if (ACCESS_ONCE(synchronize_sched_expedited_count) - snap > 0) {
9081 smp_mb(); /* ensure test happens before caller kfree */
9086 rcu_expedited_state = RCU_EXPEDITED_STATE_POST;
9087 for_each_online_cpu(cpu) {
9089 req = &per_cpu(rcu_migration_req, cpu);
9090 init_completion(&req->done);
9092 req->dest_cpu = RCU_MIGRATION_NEED_QS;
9093 raw_spin_lock_irqsave(&rq->lock, flags);
9094 list_add(&req->list, &rq->migration_queue);
9095 raw_spin_unlock_irqrestore(&rq->lock, flags);
9096 wake_up_process(rq->migration_thread);
9098 for_each_online_cpu(cpu) {
9099 rcu_expedited_state = cpu;
9100 req = &per_cpu(rcu_migration_req, cpu);
9102 wait_for_completion(&req->done);
9103 raw_spin_lock_irqsave(&rq->lock, flags);
9104 if (unlikely(req->dest_cpu == RCU_MIGRATION_MUST_SYNC))
9106 req->dest_cpu = RCU_MIGRATION_IDLE;
9107 raw_spin_unlock_irqrestore(&rq->lock, flags);
9109 rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
9110 synchronize_sched_expedited_count++;
9111 mutex_unlock(&rcu_sched_expedited_mutex);
9114 synchronize_sched();
9116 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
9118 #endif /* #else #ifndef CONFIG_SMP */