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 ->cpus_allowed
920 static inline int task_is_waking(struct task_struct *p)
922 return unlikely(p->state == TASK_WAKING);
926 * __task_rq_lock - lock the runqueue a given task resides on.
927 * Must be called interrupts disabled.
929 static inline struct rq *__task_rq_lock(struct task_struct *p)
936 raw_spin_lock(&rq->lock);
937 if (likely(rq == task_rq(p)))
939 raw_spin_unlock(&rq->lock);
944 * task_rq_lock - lock the runqueue a given task resides on and disable
945 * interrupts. Note the ordering: we can safely lookup the task_rq without
946 * explicitly disabling preemption.
948 static struct rq *task_rq_lock(struct task_struct *p, unsigned long *flags)
954 local_irq_save(*flags);
956 raw_spin_lock(&rq->lock);
957 if (likely(rq == task_rq(p)))
959 raw_spin_unlock_irqrestore(&rq->lock, *flags);
963 void task_rq_unlock_wait(struct task_struct *p)
965 struct rq *rq = task_rq(p);
967 smp_mb(); /* spin-unlock-wait is not a full memory barrier */
968 raw_spin_unlock_wait(&rq->lock);
971 static void __task_rq_unlock(struct rq *rq)
974 raw_spin_unlock(&rq->lock);
977 static inline void task_rq_unlock(struct rq *rq, unsigned long *flags)
980 raw_spin_unlock_irqrestore(&rq->lock, *flags);
984 * this_rq_lock - lock this runqueue and disable interrupts.
986 static struct rq *this_rq_lock(void)
993 raw_spin_lock(&rq->lock);
998 #ifdef CONFIG_SCHED_HRTICK
1000 * Use HR-timers to deliver accurate preemption points.
1002 * Its all a bit involved since we cannot program an hrt while holding the
1003 * rq->lock. So what we do is store a state in in rq->hrtick_* and ask for a
1006 * When we get rescheduled we reprogram the hrtick_timer outside of the
1012 * - enabled by features
1013 * - hrtimer is actually high res
1015 static inline int hrtick_enabled(struct rq *rq)
1017 if (!sched_feat(HRTICK))
1019 if (!cpu_active(cpu_of(rq)))
1021 return hrtimer_is_hres_active(&rq->hrtick_timer);
1024 static void hrtick_clear(struct rq *rq)
1026 if (hrtimer_active(&rq->hrtick_timer))
1027 hrtimer_cancel(&rq->hrtick_timer);
1031 * High-resolution timer tick.
1032 * Runs from hardirq context with interrupts disabled.
1034 static enum hrtimer_restart hrtick(struct hrtimer *timer)
1036 struct rq *rq = container_of(timer, struct rq, hrtick_timer);
1038 WARN_ON_ONCE(cpu_of(rq) != smp_processor_id());
1040 raw_spin_lock(&rq->lock);
1041 update_rq_clock(rq);
1042 rq->curr->sched_class->task_tick(rq, rq->curr, 1);
1043 raw_spin_unlock(&rq->lock);
1045 return HRTIMER_NORESTART;
1050 * called from hardirq (IPI) context
1052 static void __hrtick_start(void *arg)
1054 struct rq *rq = arg;
1056 raw_spin_lock(&rq->lock);
1057 hrtimer_restart(&rq->hrtick_timer);
1058 rq->hrtick_csd_pending = 0;
1059 raw_spin_unlock(&rq->lock);
1063 * Called to set the hrtick timer state.
1065 * called with rq->lock held and irqs disabled
1067 static void hrtick_start(struct rq *rq, u64 delay)
1069 struct hrtimer *timer = &rq->hrtick_timer;
1070 ktime_t time = ktime_add_ns(timer->base->get_time(), delay);
1072 hrtimer_set_expires(timer, time);
1074 if (rq == this_rq()) {
1075 hrtimer_restart(timer);
1076 } else if (!rq->hrtick_csd_pending) {
1077 __smp_call_function_single(cpu_of(rq), &rq->hrtick_csd, 0);
1078 rq->hrtick_csd_pending = 1;
1083 hotplug_hrtick(struct notifier_block *nfb, unsigned long action, void *hcpu)
1085 int cpu = (int)(long)hcpu;
1088 case CPU_UP_CANCELED:
1089 case CPU_UP_CANCELED_FROZEN:
1090 case CPU_DOWN_PREPARE:
1091 case CPU_DOWN_PREPARE_FROZEN:
1093 case CPU_DEAD_FROZEN:
1094 hrtick_clear(cpu_rq(cpu));
1101 static __init void init_hrtick(void)
1103 hotcpu_notifier(hotplug_hrtick, 0);
1107 * Called to set the hrtick timer state.
1109 * called with rq->lock held and irqs disabled
1111 static void hrtick_start(struct rq *rq, u64 delay)
1113 __hrtimer_start_range_ns(&rq->hrtick_timer, ns_to_ktime(delay), 0,
1114 HRTIMER_MODE_REL_PINNED, 0);
1117 static inline void init_hrtick(void)
1120 #endif /* CONFIG_SMP */
1122 static void init_rq_hrtick(struct rq *rq)
1125 rq->hrtick_csd_pending = 0;
1127 rq->hrtick_csd.flags = 0;
1128 rq->hrtick_csd.func = __hrtick_start;
1129 rq->hrtick_csd.info = rq;
1132 hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
1133 rq->hrtick_timer.function = hrtick;
1135 #else /* CONFIG_SCHED_HRTICK */
1136 static inline void hrtick_clear(struct rq *rq)
1140 static inline void init_rq_hrtick(struct rq *rq)
1144 static inline void init_hrtick(void)
1147 #endif /* CONFIG_SCHED_HRTICK */
1150 * resched_task - mark a task 'to be rescheduled now'.
1152 * On UP this means the setting of the need_resched flag, on SMP it
1153 * might also involve a cross-CPU call to trigger the scheduler on
1158 #ifndef tsk_is_polling
1159 #define tsk_is_polling(t) test_tsk_thread_flag(t, TIF_POLLING_NRFLAG)
1162 static void resched_task(struct task_struct *p)
1166 assert_raw_spin_locked(&task_rq(p)->lock);
1168 if (test_tsk_need_resched(p))
1171 set_tsk_need_resched(p);
1174 if (cpu == smp_processor_id())
1177 /* NEED_RESCHED must be visible before we test polling */
1179 if (!tsk_is_polling(p))
1180 smp_send_reschedule(cpu);
1183 static void resched_cpu(int cpu)
1185 struct rq *rq = cpu_rq(cpu);
1186 unsigned long flags;
1188 if (!raw_spin_trylock_irqsave(&rq->lock, flags))
1190 resched_task(cpu_curr(cpu));
1191 raw_spin_unlock_irqrestore(&rq->lock, flags);
1196 * When add_timer_on() enqueues a timer into the timer wheel of an
1197 * idle CPU then this timer might expire before the next timer event
1198 * which is scheduled to wake up that CPU. In case of a completely
1199 * idle system the next event might even be infinite time into the
1200 * future. wake_up_idle_cpu() ensures that the CPU is woken up and
1201 * leaves the inner idle loop so the newly added timer is taken into
1202 * account when the CPU goes back to idle and evaluates the timer
1203 * wheel for the next timer event.
1205 void wake_up_idle_cpu(int cpu)
1207 struct rq *rq = cpu_rq(cpu);
1209 if (cpu == smp_processor_id())
1213 * This is safe, as this function is called with the timer
1214 * wheel base lock of (cpu) held. When the CPU is on the way
1215 * to idle and has not yet set rq->curr to idle then it will
1216 * be serialized on the timer wheel base lock and take the new
1217 * timer into account automatically.
1219 if (rq->curr != rq->idle)
1223 * We can set TIF_RESCHED on the idle task of the other CPU
1224 * lockless. The worst case is that the other CPU runs the
1225 * idle task through an additional NOOP schedule()
1227 set_tsk_need_resched(rq->idle);
1229 /* NEED_RESCHED must be visible before we test polling */
1231 if (!tsk_is_polling(rq->idle))
1232 smp_send_reschedule(cpu);
1235 int nohz_ratelimit(int cpu)
1237 struct rq *rq = cpu_rq(cpu);
1238 u64 diff = rq->clock - rq->nohz_stamp;
1240 rq->nohz_stamp = rq->clock;
1242 return diff < (NSEC_PER_SEC / HZ) >> 1;
1245 #endif /* CONFIG_NO_HZ */
1247 static u64 sched_avg_period(void)
1249 return (u64)sysctl_sched_time_avg * NSEC_PER_MSEC / 2;
1252 static void sched_avg_update(struct rq *rq)
1254 s64 period = sched_avg_period();
1256 while ((s64)(rq->clock - rq->age_stamp) > period) {
1257 rq->age_stamp += period;
1262 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1264 rq->rt_avg += rt_delta;
1265 sched_avg_update(rq);
1268 #else /* !CONFIG_SMP */
1269 static void resched_task(struct task_struct *p)
1271 assert_raw_spin_locked(&task_rq(p)->lock);
1272 set_tsk_need_resched(p);
1275 static void sched_rt_avg_update(struct rq *rq, u64 rt_delta)
1278 #endif /* CONFIG_SMP */
1280 #if BITS_PER_LONG == 32
1281 # define WMULT_CONST (~0UL)
1283 # define WMULT_CONST (1UL << 32)
1286 #define WMULT_SHIFT 32
1289 * Shift right and round:
1291 #define SRR(x, y) (((x) + (1UL << ((y) - 1))) >> (y))
1294 * delta *= weight / lw
1296 static unsigned long
1297 calc_delta_mine(unsigned long delta_exec, unsigned long weight,
1298 struct load_weight *lw)
1302 if (!lw->inv_weight) {
1303 if (BITS_PER_LONG > 32 && unlikely(lw->weight >= WMULT_CONST))
1306 lw->inv_weight = 1 + (WMULT_CONST-lw->weight/2)
1310 tmp = (u64)delta_exec * weight;
1312 * Check whether we'd overflow the 64-bit multiplication:
1314 if (unlikely(tmp > WMULT_CONST))
1315 tmp = SRR(SRR(tmp, WMULT_SHIFT/2) * lw->inv_weight,
1318 tmp = SRR(tmp * lw->inv_weight, WMULT_SHIFT);
1320 return (unsigned long)min(tmp, (u64)(unsigned long)LONG_MAX);
1323 static inline void update_load_add(struct load_weight *lw, unsigned long inc)
1329 static inline void update_load_sub(struct load_weight *lw, unsigned long dec)
1336 * To aid in avoiding the subversion of "niceness" due to uneven distribution
1337 * of tasks with abnormal "nice" values across CPUs the contribution that
1338 * each task makes to its run queue's load is weighted according to its
1339 * scheduling class and "nice" value. For SCHED_NORMAL tasks this is just a
1340 * scaled version of the new time slice allocation that they receive on time
1344 #define WEIGHT_IDLEPRIO 3
1345 #define WMULT_IDLEPRIO 1431655765
1348 * Nice levels are multiplicative, with a gentle 10% change for every
1349 * nice level changed. I.e. when a CPU-bound task goes from nice 0 to
1350 * nice 1, it will get ~10% less CPU time than another CPU-bound task
1351 * that remained on nice 0.
1353 * The "10% effect" is relative and cumulative: from _any_ nice level,
1354 * if you go up 1 level, it's -10% CPU usage, if you go down 1 level
1355 * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25.
1356 * If a task goes up by ~10% and another task goes down by ~10% then
1357 * the relative distance between them is ~25%.)
1359 static const int prio_to_weight[40] = {
1360 /* -20 */ 88761, 71755, 56483, 46273, 36291,
1361 /* -15 */ 29154, 23254, 18705, 14949, 11916,
1362 /* -10 */ 9548, 7620, 6100, 4904, 3906,
1363 /* -5 */ 3121, 2501, 1991, 1586, 1277,
1364 /* 0 */ 1024, 820, 655, 526, 423,
1365 /* 5 */ 335, 272, 215, 172, 137,
1366 /* 10 */ 110, 87, 70, 56, 45,
1367 /* 15 */ 36, 29, 23, 18, 15,
1371 * Inverse (2^32/x) values of the prio_to_weight[] array, precalculated.
1373 * In cases where the weight does not change often, we can use the
1374 * precalculated inverse to speed up arithmetics by turning divisions
1375 * into multiplications:
1377 static const u32 prio_to_wmult[40] = {
1378 /* -20 */ 48388, 59856, 76040, 92818, 118348,
1379 /* -15 */ 147320, 184698, 229616, 287308, 360437,
1380 /* -10 */ 449829, 563644, 704093, 875809, 1099582,
1381 /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326,
1382 /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587,
1383 /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126,
1384 /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717,
1385 /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153,
1388 /* Time spent by the tasks of the cpu accounting group executing in ... */
1389 enum cpuacct_stat_index {
1390 CPUACCT_STAT_USER, /* ... user mode */
1391 CPUACCT_STAT_SYSTEM, /* ... kernel mode */
1393 CPUACCT_STAT_NSTATS,
1396 #ifdef CONFIG_CGROUP_CPUACCT
1397 static void cpuacct_charge(struct task_struct *tsk, u64 cputime);
1398 static void cpuacct_update_stats(struct task_struct *tsk,
1399 enum cpuacct_stat_index idx, cputime_t val);
1401 static inline void cpuacct_charge(struct task_struct *tsk, u64 cputime) {}
1402 static inline void cpuacct_update_stats(struct task_struct *tsk,
1403 enum cpuacct_stat_index idx, cputime_t val) {}
1406 static inline void inc_cpu_load(struct rq *rq, unsigned long load)
1408 update_load_add(&rq->load, load);
1411 static inline void dec_cpu_load(struct rq *rq, unsigned long load)
1413 update_load_sub(&rq->load, load);
1416 #if (defined(CONFIG_SMP) && defined(CONFIG_FAIR_GROUP_SCHED)) || defined(CONFIG_RT_GROUP_SCHED)
1417 typedef int (*tg_visitor)(struct task_group *, void *);
1420 * Iterate the full tree, calling @down when first entering a node and @up when
1421 * leaving it for the final time.
1423 static int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
1425 struct task_group *parent, *child;
1429 parent = &root_task_group;
1431 ret = (*down)(parent, data);
1434 list_for_each_entry_rcu(child, &parent->children, siblings) {
1441 ret = (*up)(parent, data);
1446 parent = parent->parent;
1455 static int tg_nop(struct task_group *tg, void *data)
1462 /* Used instead of source_load when we know the type == 0 */
1463 static unsigned long weighted_cpuload(const int cpu)
1465 return cpu_rq(cpu)->load.weight;
1469 * Return a low guess at the load of a migration-source cpu weighted
1470 * according to the scheduling class and "nice" value.
1472 * We want to under-estimate the load of migration sources, to
1473 * balance conservatively.
1475 static unsigned long source_load(int cpu, int type)
1477 struct rq *rq = cpu_rq(cpu);
1478 unsigned long total = weighted_cpuload(cpu);
1480 if (type == 0 || !sched_feat(LB_BIAS))
1483 return min(rq->cpu_load[type-1], total);
1487 * Return a high guess at the load of a migration-target cpu weighted
1488 * according to the scheduling class and "nice" value.
1490 static unsigned long target_load(int cpu, int type)
1492 struct rq *rq = cpu_rq(cpu);
1493 unsigned long total = weighted_cpuload(cpu);
1495 if (type == 0 || !sched_feat(LB_BIAS))
1498 return max(rq->cpu_load[type-1], total);
1501 static struct sched_group *group_of(int cpu)
1503 struct sched_domain *sd = rcu_dereference_sched(cpu_rq(cpu)->sd);
1511 static unsigned long power_of(int cpu)
1513 struct sched_group *group = group_of(cpu);
1516 return SCHED_LOAD_SCALE;
1518 return group->cpu_power;
1521 static int task_hot(struct task_struct *p, u64 now, struct sched_domain *sd);
1523 static unsigned long cpu_avg_load_per_task(int cpu)
1525 struct rq *rq = cpu_rq(cpu);
1526 unsigned long nr_running = ACCESS_ONCE(rq->nr_running);
1529 rq->avg_load_per_task = rq->load.weight / nr_running;
1531 rq->avg_load_per_task = 0;
1533 return rq->avg_load_per_task;
1536 #ifdef CONFIG_FAIR_GROUP_SCHED
1538 static __read_mostly unsigned long __percpu *update_shares_data;
1540 static void __set_se_shares(struct sched_entity *se, unsigned long shares);
1543 * Calculate and set the cpu's group shares.
1545 static void update_group_shares_cpu(struct task_group *tg, int cpu,
1546 unsigned long sd_shares,
1547 unsigned long sd_rq_weight,
1548 unsigned long *usd_rq_weight)
1550 unsigned long shares, rq_weight;
1553 rq_weight = usd_rq_weight[cpu];
1556 rq_weight = NICE_0_LOAD;
1560 * \Sum_j shares_j * rq_weight_i
1561 * shares_i = -----------------------------
1562 * \Sum_j rq_weight_j
1564 shares = (sd_shares * rq_weight) / sd_rq_weight;
1565 shares = clamp_t(unsigned long, shares, MIN_SHARES, MAX_SHARES);
1567 if (abs(shares - tg->se[cpu]->load.weight) >
1568 sysctl_sched_shares_thresh) {
1569 struct rq *rq = cpu_rq(cpu);
1570 unsigned long flags;
1572 raw_spin_lock_irqsave(&rq->lock, flags);
1573 tg->cfs_rq[cpu]->rq_weight = boost ? 0 : rq_weight;
1574 tg->cfs_rq[cpu]->shares = boost ? 0 : shares;
1575 __set_se_shares(tg->se[cpu], shares);
1576 raw_spin_unlock_irqrestore(&rq->lock, flags);
1581 * Re-compute the task group their per cpu shares over the given domain.
1582 * This needs to be done in a bottom-up fashion because the rq weight of a
1583 * parent group depends on the shares of its child groups.
1585 static int tg_shares_up(struct task_group *tg, void *data)
1587 unsigned long weight, rq_weight = 0, sum_weight = 0, shares = 0;
1588 unsigned long *usd_rq_weight;
1589 struct sched_domain *sd = data;
1590 unsigned long flags;
1596 local_irq_save(flags);
1597 usd_rq_weight = per_cpu_ptr(update_shares_data, smp_processor_id());
1599 for_each_cpu(i, sched_domain_span(sd)) {
1600 weight = tg->cfs_rq[i]->load.weight;
1601 usd_rq_weight[i] = weight;
1603 rq_weight += weight;
1605 * If there are currently no tasks on the cpu pretend there
1606 * is one of average load so that when a new task gets to
1607 * run here it will not get delayed by group starvation.
1610 weight = NICE_0_LOAD;
1612 sum_weight += weight;
1613 shares += tg->cfs_rq[i]->shares;
1617 rq_weight = sum_weight;
1619 if ((!shares && rq_weight) || shares > tg->shares)
1620 shares = tg->shares;
1622 if (!sd->parent || !(sd->parent->flags & SD_LOAD_BALANCE))
1623 shares = tg->shares;
1625 for_each_cpu(i, sched_domain_span(sd))
1626 update_group_shares_cpu(tg, i, shares, rq_weight, usd_rq_weight);
1628 local_irq_restore(flags);
1634 * Compute the cpu's hierarchical load factor for each task group.
1635 * This needs to be done in a top-down fashion because the load of a child
1636 * group is a fraction of its parents load.
1638 static int tg_load_down(struct task_group *tg, void *data)
1641 long cpu = (long)data;
1644 load = cpu_rq(cpu)->load.weight;
1646 load = tg->parent->cfs_rq[cpu]->h_load;
1647 load *= tg->cfs_rq[cpu]->shares;
1648 load /= tg->parent->cfs_rq[cpu]->load.weight + 1;
1651 tg->cfs_rq[cpu]->h_load = load;
1656 static void update_shares(struct sched_domain *sd)
1661 if (root_task_group_empty())
1664 now = cpu_clock(raw_smp_processor_id());
1665 elapsed = now - sd->last_update;
1667 if (elapsed >= (s64)(u64)sysctl_sched_shares_ratelimit) {
1668 sd->last_update = now;
1669 walk_tg_tree(tg_nop, tg_shares_up, sd);
1673 static void update_h_load(long cpu)
1675 if (root_task_group_empty())
1678 walk_tg_tree(tg_load_down, tg_nop, (void *)cpu);
1683 static inline void update_shares(struct sched_domain *sd)
1689 #ifdef CONFIG_PREEMPT
1691 static void double_rq_lock(struct rq *rq1, struct rq *rq2);
1694 * fair double_lock_balance: Safely acquires both rq->locks in a fair
1695 * way at the expense of forcing extra atomic operations in all
1696 * invocations. This assures that the double_lock is acquired using the
1697 * same underlying policy as the spinlock_t on this architecture, which
1698 * reduces latency compared to the unfair variant below. However, it
1699 * also adds more overhead and therefore may reduce throughput.
1701 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1702 __releases(this_rq->lock)
1703 __acquires(busiest->lock)
1704 __acquires(this_rq->lock)
1706 raw_spin_unlock(&this_rq->lock);
1707 double_rq_lock(this_rq, busiest);
1714 * Unfair double_lock_balance: Optimizes throughput at the expense of
1715 * latency by eliminating extra atomic operations when the locks are
1716 * already in proper order on entry. This favors lower cpu-ids and will
1717 * grant the double lock to lower cpus over higher ids under contention,
1718 * regardless of entry order into the function.
1720 static int _double_lock_balance(struct rq *this_rq, struct rq *busiest)
1721 __releases(this_rq->lock)
1722 __acquires(busiest->lock)
1723 __acquires(this_rq->lock)
1727 if (unlikely(!raw_spin_trylock(&busiest->lock))) {
1728 if (busiest < this_rq) {
1729 raw_spin_unlock(&this_rq->lock);
1730 raw_spin_lock(&busiest->lock);
1731 raw_spin_lock_nested(&this_rq->lock,
1732 SINGLE_DEPTH_NESTING);
1735 raw_spin_lock_nested(&busiest->lock,
1736 SINGLE_DEPTH_NESTING);
1741 #endif /* CONFIG_PREEMPT */
1744 * double_lock_balance - lock the busiest runqueue, this_rq is locked already.
1746 static int double_lock_balance(struct rq *this_rq, struct rq *busiest)
1748 if (unlikely(!irqs_disabled())) {
1749 /* printk() doesn't work good under rq->lock */
1750 raw_spin_unlock(&this_rq->lock);
1754 return _double_lock_balance(this_rq, busiest);
1757 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)
1758 __releases(busiest->lock)
1760 raw_spin_unlock(&busiest->lock);
1761 lock_set_subclass(&this_rq->lock.dep_map, 0, _RET_IP_);
1765 * double_rq_lock - safely lock two runqueues
1767 * Note this does not disable interrupts like task_rq_lock,
1768 * you need to do so manually before calling.
1770 static void double_rq_lock(struct rq *rq1, struct rq *rq2)
1771 __acquires(rq1->lock)
1772 __acquires(rq2->lock)
1774 BUG_ON(!irqs_disabled());
1776 raw_spin_lock(&rq1->lock);
1777 __acquire(rq2->lock); /* Fake it out ;) */
1780 raw_spin_lock(&rq1->lock);
1781 raw_spin_lock_nested(&rq2->lock, SINGLE_DEPTH_NESTING);
1783 raw_spin_lock(&rq2->lock);
1784 raw_spin_lock_nested(&rq1->lock, SINGLE_DEPTH_NESTING);
1790 * double_rq_unlock - safely unlock two runqueues
1792 * Note this does not restore interrupts like task_rq_unlock,
1793 * you need to do so manually after calling.
1795 static void double_rq_unlock(struct rq *rq1, struct rq *rq2)
1796 __releases(rq1->lock)
1797 __releases(rq2->lock)
1799 raw_spin_unlock(&rq1->lock);
1801 raw_spin_unlock(&rq2->lock);
1803 __release(rq2->lock);
1808 #ifdef CONFIG_FAIR_GROUP_SCHED
1809 static void cfs_rq_set_shares(struct cfs_rq *cfs_rq, unsigned long shares)
1812 cfs_rq->shares = shares;
1817 static void calc_load_account_active(struct rq *this_rq);
1818 static void update_sysctl(void);
1819 static int get_update_sysctl_factor(void);
1821 static inline void __set_task_cpu(struct task_struct *p, unsigned int cpu)
1823 set_task_rq(p, cpu);
1826 * After ->cpu is set up to a new value, task_rq_lock(p, ...) can be
1827 * successfuly executed on another CPU. We must ensure that updates of
1828 * per-task data have been completed by this moment.
1831 task_thread_info(p)->cpu = cpu;
1835 static const struct sched_class rt_sched_class;
1837 #define sched_class_highest (&rt_sched_class)
1838 #define for_each_class(class) \
1839 for (class = sched_class_highest; class; class = class->next)
1841 #include "sched_stats.h"
1843 static void inc_nr_running(struct rq *rq)
1848 static void dec_nr_running(struct rq *rq)
1853 static void set_load_weight(struct task_struct *p)
1855 if (task_has_rt_policy(p)) {
1856 p->se.load.weight = prio_to_weight[0] * 2;
1857 p->se.load.inv_weight = prio_to_wmult[0] >> 1;
1862 * SCHED_IDLE tasks get minimal weight:
1864 if (p->policy == SCHED_IDLE) {
1865 p->se.load.weight = WEIGHT_IDLEPRIO;
1866 p->se.load.inv_weight = WMULT_IDLEPRIO;
1870 p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO];
1871 p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO];
1874 static void update_avg(u64 *avg, u64 sample)
1876 s64 diff = sample - *avg;
1881 enqueue_task(struct rq *rq, struct task_struct *p, int wakeup, bool head)
1883 update_rq_clock(rq);
1884 sched_info_queued(p);
1885 p->sched_class->enqueue_task(rq, p, wakeup, head);
1889 static void dequeue_task(struct rq *rq, struct task_struct *p, int sleep)
1891 update_rq_clock(rq);
1892 sched_info_dequeued(p);
1893 p->sched_class->dequeue_task(rq, p, sleep);
1898 * activate_task - move a task to the runqueue.
1900 static void activate_task(struct rq *rq, struct task_struct *p, int wakeup)
1902 if (task_contributes_to_load(p))
1903 rq->nr_uninterruptible--;
1905 enqueue_task(rq, p, wakeup, false);
1910 * deactivate_task - remove a task from the runqueue.
1912 static void deactivate_task(struct rq *rq, struct task_struct *p, int sleep)
1914 if (task_contributes_to_load(p))
1915 rq->nr_uninterruptible++;
1917 dequeue_task(rq, p, sleep);
1921 #include "sched_idletask.c"
1922 #include "sched_fair.c"
1923 #include "sched_rt.c"
1924 #ifdef CONFIG_SCHED_DEBUG
1925 # include "sched_debug.c"
1929 * __normal_prio - return the priority that is based on the static prio
1931 static inline int __normal_prio(struct task_struct *p)
1933 return p->static_prio;
1937 * Calculate the expected normal priority: i.e. priority
1938 * without taking RT-inheritance into account. Might be
1939 * boosted by interactivity modifiers. Changes upon fork,
1940 * setprio syscalls, and whenever the interactivity
1941 * estimator recalculates.
1943 static inline int normal_prio(struct task_struct *p)
1947 if (task_has_rt_policy(p))
1948 prio = MAX_RT_PRIO-1 - p->rt_priority;
1950 prio = __normal_prio(p);
1955 * Calculate the current priority, i.e. the priority
1956 * taken into account by the scheduler. This value might
1957 * be boosted by RT tasks, or might be boosted by
1958 * interactivity modifiers. Will be RT if the task got
1959 * RT-boosted. If not then it returns p->normal_prio.
1961 static int effective_prio(struct task_struct *p)
1963 p->normal_prio = normal_prio(p);
1965 * If we are RT tasks or we were boosted to RT priority,
1966 * keep the priority unchanged. Otherwise, update priority
1967 * to the normal priority:
1969 if (!rt_prio(p->prio))
1970 return p->normal_prio;
1975 * task_curr - is this task currently executing on a CPU?
1976 * @p: the task in question.
1978 inline int task_curr(const struct task_struct *p)
1980 return cpu_curr(task_cpu(p)) == p;
1983 static inline void check_class_changed(struct rq *rq, struct task_struct *p,
1984 const struct sched_class *prev_class,
1985 int oldprio, int running)
1987 if (prev_class != p->sched_class) {
1988 if (prev_class->switched_from)
1989 prev_class->switched_from(rq, p, running);
1990 p->sched_class->switched_to(rq, p, running);
1992 p->sched_class->prio_changed(rq, p, oldprio, running);
1997 * Is this task likely cache-hot:
2000 task_hot(struct task_struct *p, u64 now, struct sched_domain *sd)
2004 if (p->sched_class != &fair_sched_class)
2008 * Buddy candidates are cache hot:
2010 if (sched_feat(CACHE_HOT_BUDDY) && this_rq()->nr_running &&
2011 (&p->se == cfs_rq_of(&p->se)->next ||
2012 &p->se == cfs_rq_of(&p->se)->last))
2015 if (sysctl_sched_migration_cost == -1)
2017 if (sysctl_sched_migration_cost == 0)
2020 delta = now - p->se.exec_start;
2022 return delta < (s64)sysctl_sched_migration_cost;
2025 void set_task_cpu(struct task_struct *p, unsigned int new_cpu)
2027 #ifdef CONFIG_SCHED_DEBUG
2029 * We should never call set_task_cpu() on a blocked task,
2030 * ttwu() will sort out the placement.
2032 WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING &&
2033 !(task_thread_info(p)->preempt_count & PREEMPT_ACTIVE));
2036 trace_sched_migrate_task(p, new_cpu);
2038 if (task_cpu(p) != new_cpu) {
2039 p->se.nr_migrations++;
2040 perf_sw_event(PERF_COUNT_SW_CPU_MIGRATIONS, 1, 1, NULL, 0);
2043 __set_task_cpu(p, new_cpu);
2046 struct migration_req {
2047 struct list_head list;
2049 struct task_struct *task;
2052 struct completion done;
2056 * The task's runqueue lock must be held.
2057 * Returns true if you have to wait for migration thread.
2060 migrate_task(struct task_struct *p, int dest_cpu, struct migration_req *req)
2062 struct rq *rq = task_rq(p);
2065 * If the task is not on a runqueue (and not running), then
2066 * the next wake-up will properly place the task.
2068 if (!p->se.on_rq && !task_running(rq, p))
2071 init_completion(&req->done);
2073 req->dest_cpu = dest_cpu;
2074 list_add(&req->list, &rq->migration_queue);
2080 * wait_task_context_switch - wait for a thread to complete at least one
2083 * @p must not be current.
2085 void wait_task_context_switch(struct task_struct *p)
2087 unsigned long nvcsw, nivcsw, flags;
2095 * The runqueue is assigned before the actual context
2096 * switch. We need to take the runqueue lock.
2098 * We could check initially without the lock but it is
2099 * very likely that we need to take the lock in every
2102 rq = task_rq_lock(p, &flags);
2103 running = task_running(rq, p);
2104 task_rq_unlock(rq, &flags);
2106 if (likely(!running))
2109 * The switch count is incremented before the actual
2110 * context switch. We thus wait for two switches to be
2111 * sure at least one completed.
2113 if ((p->nvcsw - nvcsw) > 1)
2115 if ((p->nivcsw - nivcsw) > 1)
2123 * wait_task_inactive - wait for a thread to unschedule.
2125 * If @match_state is nonzero, it's the @p->state value just checked and
2126 * not expected to change. If it changes, i.e. @p might have woken up,
2127 * then return zero. When we succeed in waiting for @p to be off its CPU,
2128 * we return a positive number (its total switch count). If a second call
2129 * a short while later returns the same number, the caller can be sure that
2130 * @p has remained unscheduled the whole time.
2132 * The caller must ensure that the task *will* unschedule sometime soon,
2133 * else this function might spin for a *long* time. This function can't
2134 * be called with interrupts off, or it may introduce deadlock with
2135 * smp_call_function() if an IPI is sent by the same process we are
2136 * waiting to become inactive.
2138 unsigned long wait_task_inactive(struct task_struct *p, long match_state)
2140 unsigned long flags;
2147 * We do the initial early heuristics without holding
2148 * any task-queue locks at all. We'll only try to get
2149 * the runqueue lock when things look like they will
2155 * If the task is actively running on another CPU
2156 * still, just relax and busy-wait without holding
2159 * NOTE! Since we don't hold any locks, it's not
2160 * even sure that "rq" stays as the right runqueue!
2161 * But we don't care, since "task_running()" will
2162 * return false if the runqueue has changed and p
2163 * is actually now running somewhere else!
2165 while (task_running(rq, p)) {
2166 if (match_state && unlikely(p->state != match_state))
2172 * Ok, time to look more closely! We need the rq
2173 * lock now, to be *sure*. If we're wrong, we'll
2174 * just go back and repeat.
2176 rq = task_rq_lock(p, &flags);
2177 trace_sched_wait_task(rq, p);
2178 running = task_running(rq, p);
2179 on_rq = p->se.on_rq;
2181 if (!match_state || p->state == match_state)
2182 ncsw = p->nvcsw | LONG_MIN; /* sets MSB */
2183 task_rq_unlock(rq, &flags);
2186 * If it changed from the expected state, bail out now.
2188 if (unlikely(!ncsw))
2192 * Was it really running after all now that we
2193 * checked with the proper locks actually held?
2195 * Oops. Go back and try again..
2197 if (unlikely(running)) {
2203 * It's not enough that it's not actively running,
2204 * it must be off the runqueue _entirely_, and not
2207 * So if it was still runnable (but just not actively
2208 * running right now), it's preempted, and we should
2209 * yield - it could be a while.
2211 if (unlikely(on_rq)) {
2212 schedule_timeout_uninterruptible(1);
2217 * Ahh, all good. It wasn't running, and it wasn't
2218 * runnable, which means that it will never become
2219 * running in the future either. We're all done!
2228 * kick_process - kick a running thread to enter/exit the kernel
2229 * @p: the to-be-kicked thread
2231 * Cause a process which is running on another CPU to enter
2232 * kernel-mode, without any delay. (to get signals handled.)
2234 * NOTE: this function doesnt have to take the runqueue lock,
2235 * because all it wants to ensure is that the remote task enters
2236 * the kernel. If the IPI races and the task has been migrated
2237 * to another CPU then no harm is done and the purpose has been
2240 void kick_process(struct task_struct *p)
2246 if ((cpu != smp_processor_id()) && task_curr(p))
2247 smp_send_reschedule(cpu);
2250 EXPORT_SYMBOL_GPL(kick_process);
2251 #endif /* CONFIG_SMP */
2254 * task_oncpu_function_call - call a function on the cpu on which a task runs
2255 * @p: the task to evaluate
2256 * @func: the function to be called
2257 * @info: the function call argument
2259 * Calls the function @func when the task is currently running. This might
2260 * be on the current CPU, which just calls the function directly
2262 void task_oncpu_function_call(struct task_struct *p,
2263 void (*func) (void *info), void *info)
2270 smp_call_function_single(cpu, func, info, 1);
2276 * ->cpus_allowed is protected by either TASK_WAKING or rq->lock held.
2278 static int select_fallback_rq(int cpu, struct task_struct *p)
2281 const struct cpumask *nodemask = cpumask_of_node(cpu_to_node(cpu));
2283 /* Look for allowed, online CPU in same node. */
2284 for_each_cpu_and(dest_cpu, nodemask, cpu_active_mask)
2285 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
2288 /* Any allowed, online CPU? */
2289 dest_cpu = cpumask_any_and(&p->cpus_allowed, cpu_active_mask);
2290 if (dest_cpu < nr_cpu_ids)
2293 /* No more Mr. Nice Guy. */
2294 if (unlikely(dest_cpu >= nr_cpu_ids)) {
2295 dest_cpu = cpuset_cpus_allowed_fallback(p);
2297 * Don't tell them about moving exiting tasks or
2298 * kernel threads (both mm NULL), since they never
2301 if (p->mm && printk_ratelimit()) {
2302 printk(KERN_INFO "process %d (%s) no "
2303 "longer affine to cpu%d\n",
2304 task_pid_nr(p), p->comm, cpu);
2312 * The caller (fork, wakeup) owns TASK_WAKING, ->cpus_allowed is stable.
2315 int select_task_rq(struct rq *rq, struct task_struct *p, int sd_flags, int wake_flags)
2317 int cpu = p->sched_class->select_task_rq(rq, p, sd_flags, wake_flags);
2320 * In order not to call set_task_cpu() on a blocking task we need
2321 * to rely on ttwu() to place the task on a valid ->cpus_allowed
2324 * Since this is common to all placement strategies, this lives here.
2326 * [ this allows ->select_task() to simply return task_cpu(p) and
2327 * not worry about this generic constraint ]
2329 if (unlikely(!cpumask_test_cpu(cpu, &p->cpus_allowed) ||
2331 cpu = select_fallback_rq(task_cpu(p), p);
2338 * try_to_wake_up - wake up a thread
2339 * @p: the to-be-woken-up thread
2340 * @state: the mask of task states that can be woken
2341 * @sync: do a synchronous wakeup?
2343 * Put it on the run-queue if it's not already there. The "current"
2344 * thread is always on the run-queue (except when the actual
2345 * re-schedule is in progress), and as such you're allowed to do
2346 * the simpler "current->state = TASK_RUNNING" to mark yourself
2347 * runnable without the overhead of this.
2349 * returns failure only if the task is already active.
2351 static int try_to_wake_up(struct task_struct *p, unsigned int state,
2354 int cpu, orig_cpu, this_cpu, success = 0;
2355 unsigned long flags;
2358 this_cpu = get_cpu();
2361 rq = task_rq_lock(p, &flags);
2362 if (!(p->state & state))
2372 if (unlikely(task_running(rq, p)))
2376 * In order to handle concurrent wakeups and release the rq->lock
2377 * we put the task in TASK_WAKING state.
2379 * First fix up the nr_uninterruptible count:
2381 if (task_contributes_to_load(p)) {
2382 if (likely(cpu_online(orig_cpu)))
2383 rq->nr_uninterruptible--;
2385 this_rq()->nr_uninterruptible--;
2387 p->state = TASK_WAKING;
2389 if (p->sched_class->task_waking)
2390 p->sched_class->task_waking(rq, p);
2392 cpu = select_task_rq(rq, p, SD_BALANCE_WAKE, wake_flags);
2393 if (cpu != orig_cpu)
2394 set_task_cpu(p, cpu);
2395 __task_rq_unlock(rq);
2398 raw_spin_lock(&rq->lock);
2401 * We migrated the task without holding either rq->lock, however
2402 * since the task is not on the task list itself, nobody else
2403 * will try and migrate the task, hence the rq should match the
2404 * cpu we just moved it to.
2406 WARN_ON(task_cpu(p) != cpu);
2407 WARN_ON(p->state != TASK_WAKING);
2409 #ifdef CONFIG_SCHEDSTATS
2410 schedstat_inc(rq, ttwu_count);
2411 if (cpu == this_cpu)
2412 schedstat_inc(rq, ttwu_local);
2414 struct sched_domain *sd;
2415 for_each_domain(this_cpu, sd) {
2416 if (cpumask_test_cpu(cpu, sched_domain_span(sd))) {
2417 schedstat_inc(sd, ttwu_wake_remote);
2422 #endif /* CONFIG_SCHEDSTATS */
2425 #endif /* CONFIG_SMP */
2426 schedstat_inc(p, se.statistics.nr_wakeups);
2427 if (wake_flags & WF_SYNC)
2428 schedstat_inc(p, se.statistics.nr_wakeups_sync);
2429 if (orig_cpu != cpu)
2430 schedstat_inc(p, se.statistics.nr_wakeups_migrate);
2431 if (cpu == this_cpu)
2432 schedstat_inc(p, se.statistics.nr_wakeups_local);
2434 schedstat_inc(p, se.statistics.nr_wakeups_remote);
2435 activate_task(rq, p, 1);
2439 trace_sched_wakeup(rq, p, success);
2440 check_preempt_curr(rq, p, wake_flags);
2442 p->state = TASK_RUNNING;
2444 if (p->sched_class->task_woken)
2445 p->sched_class->task_woken(rq, p);
2447 if (unlikely(rq->idle_stamp)) {
2448 u64 delta = rq->clock - rq->idle_stamp;
2449 u64 max = 2*sysctl_sched_migration_cost;
2454 update_avg(&rq->avg_idle, delta);
2459 task_rq_unlock(rq, &flags);
2466 * wake_up_process - Wake up a specific process
2467 * @p: The process to be woken up.
2469 * Attempt to wake up the nominated process and move it to the set of runnable
2470 * processes. Returns 1 if the process was woken up, 0 if it was already
2473 * It may be assumed that this function implies a write memory barrier before
2474 * changing the task state if and only if any tasks are woken up.
2476 int wake_up_process(struct task_struct *p)
2478 return try_to_wake_up(p, TASK_ALL, 0);
2480 EXPORT_SYMBOL(wake_up_process);
2482 int wake_up_state(struct task_struct *p, unsigned int state)
2484 return try_to_wake_up(p, state, 0);
2488 * Perform scheduler related setup for a newly forked process p.
2489 * p is forked by current.
2491 * __sched_fork() is basic setup used by init_idle() too:
2493 static void __sched_fork(struct task_struct *p)
2495 p->se.exec_start = 0;
2496 p->se.sum_exec_runtime = 0;
2497 p->se.prev_sum_exec_runtime = 0;
2498 p->se.nr_migrations = 0;
2500 #ifdef CONFIG_SCHEDSTATS
2501 memset(&p->se.statistics, 0, sizeof(p->se.statistics));
2504 INIT_LIST_HEAD(&p->rt.run_list);
2506 INIT_LIST_HEAD(&p->se.group_node);
2508 #ifdef CONFIG_PREEMPT_NOTIFIERS
2509 INIT_HLIST_HEAD(&p->preempt_notifiers);
2514 * fork()/clone()-time setup:
2516 void sched_fork(struct task_struct *p, int clone_flags)
2518 int cpu = get_cpu();
2522 * We mark the process as running here. This guarantees that
2523 * nobody will actually run it, and a signal or other external
2524 * event cannot wake it up and insert it on the runqueue either.
2526 p->state = TASK_RUNNING;
2529 * Revert to default priority/policy on fork if requested.
2531 if (unlikely(p->sched_reset_on_fork)) {
2532 if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) {
2533 p->policy = SCHED_NORMAL;
2534 p->normal_prio = p->static_prio;
2537 if (PRIO_TO_NICE(p->static_prio) < 0) {
2538 p->static_prio = NICE_TO_PRIO(0);
2539 p->normal_prio = p->static_prio;
2544 * We don't need the reset flag anymore after the fork. It has
2545 * fulfilled its duty:
2547 p->sched_reset_on_fork = 0;
2551 * Make sure we do not leak PI boosting priority to the child.
2553 p->prio = current->normal_prio;
2555 if (!rt_prio(p->prio))
2556 p->sched_class = &fair_sched_class;
2558 if (p->sched_class->task_fork)
2559 p->sched_class->task_fork(p);
2561 set_task_cpu(p, cpu);
2563 #if defined(CONFIG_SCHEDSTATS) || defined(CONFIG_TASK_DELAY_ACCT)
2564 if (likely(sched_info_on()))
2565 memset(&p->sched_info, 0, sizeof(p->sched_info));
2567 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
2570 #ifdef CONFIG_PREEMPT
2571 /* Want to start with kernel preemption disabled. */
2572 task_thread_info(p)->preempt_count = 1;
2574 plist_node_init(&p->pushable_tasks, MAX_PRIO);
2580 * wake_up_new_task - wake up a newly created task for the first time.
2582 * This function will do some initial scheduler statistics housekeeping
2583 * that must be done for every newly created context, then puts the task
2584 * on the runqueue and wakes it.
2586 void wake_up_new_task(struct task_struct *p, unsigned long clone_flags)
2588 unsigned long flags;
2590 int cpu __maybe_unused = get_cpu();
2593 rq = task_rq_lock(p, &flags);
2594 p->state = TASK_WAKING;
2597 * Fork balancing, do it here and not earlier because:
2598 * - cpus_allowed can change in the fork path
2599 * - any previously selected cpu might disappear through hotplug
2601 * We set TASK_WAKING so that select_task_rq() can drop rq->lock
2602 * without people poking at ->cpus_allowed.
2604 cpu = select_task_rq(rq, p, SD_BALANCE_FORK, 0);
2605 set_task_cpu(p, cpu);
2607 p->state = TASK_RUNNING;
2608 task_rq_unlock(rq, &flags);
2611 rq = task_rq_lock(p, &flags);
2612 activate_task(rq, p, 0);
2613 trace_sched_wakeup_new(rq, p, 1);
2614 check_preempt_curr(rq, p, WF_FORK);
2616 if (p->sched_class->task_woken)
2617 p->sched_class->task_woken(rq, p);
2619 task_rq_unlock(rq, &flags);
2623 #ifdef CONFIG_PREEMPT_NOTIFIERS
2626 * preempt_notifier_register - tell me when current is being preempted & rescheduled
2627 * @notifier: notifier struct to register
2629 void preempt_notifier_register(struct preempt_notifier *notifier)
2631 hlist_add_head(¬ifier->link, ¤t->preempt_notifiers);
2633 EXPORT_SYMBOL_GPL(preempt_notifier_register);
2636 * preempt_notifier_unregister - no longer interested in preemption notifications
2637 * @notifier: notifier struct to unregister
2639 * This is safe to call from within a preemption notifier.
2641 void preempt_notifier_unregister(struct preempt_notifier *notifier)
2643 hlist_del(¬ifier->link);
2645 EXPORT_SYMBOL_GPL(preempt_notifier_unregister);
2647 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2649 struct preempt_notifier *notifier;
2650 struct hlist_node *node;
2652 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2653 notifier->ops->sched_in(notifier, raw_smp_processor_id());
2657 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2658 struct task_struct *next)
2660 struct preempt_notifier *notifier;
2661 struct hlist_node *node;
2663 hlist_for_each_entry(notifier, node, &curr->preempt_notifiers, link)
2664 notifier->ops->sched_out(notifier, next);
2667 #else /* !CONFIG_PREEMPT_NOTIFIERS */
2669 static void fire_sched_in_preempt_notifiers(struct task_struct *curr)
2674 fire_sched_out_preempt_notifiers(struct task_struct *curr,
2675 struct task_struct *next)
2679 #endif /* CONFIG_PREEMPT_NOTIFIERS */
2682 * prepare_task_switch - prepare to switch tasks
2683 * @rq: the runqueue preparing to switch
2684 * @prev: the current task that is being switched out
2685 * @next: the task we are going to switch to.
2687 * This is called with the rq lock held and interrupts off. It must
2688 * be paired with a subsequent finish_task_switch after the context
2691 * prepare_task_switch sets up locking and calls architecture specific
2695 prepare_task_switch(struct rq *rq, struct task_struct *prev,
2696 struct task_struct *next)
2698 fire_sched_out_preempt_notifiers(prev, next);
2699 prepare_lock_switch(rq, next);
2700 prepare_arch_switch(next);
2704 * finish_task_switch - clean up after a task-switch
2705 * @rq: runqueue associated with task-switch
2706 * @prev: the thread we just switched away from.
2708 * finish_task_switch must be called after the context switch, paired
2709 * with a prepare_task_switch call before the context switch.
2710 * finish_task_switch will reconcile locking set up by prepare_task_switch,
2711 * and do any other architecture-specific cleanup actions.
2713 * Note that we may have delayed dropping an mm in context_switch(). If
2714 * so, we finish that here outside of the runqueue lock. (Doing it
2715 * with the lock held can cause deadlocks; see schedule() for
2718 static void finish_task_switch(struct rq *rq, struct task_struct *prev)
2719 __releases(rq->lock)
2721 struct mm_struct *mm = rq->prev_mm;
2727 * A task struct has one reference for the use as "current".
2728 * If a task dies, then it sets TASK_DEAD in tsk->state and calls
2729 * schedule one last time. The schedule call will never return, and
2730 * the scheduled task must drop that reference.
2731 * The test for TASK_DEAD must occur while the runqueue locks are
2732 * still held, otherwise prev could be scheduled on another cpu, die
2733 * there before we look at prev->state, and then the reference would
2735 * Manfred Spraul <manfred@colorfullife.com>
2737 prev_state = prev->state;
2738 finish_arch_switch(prev);
2739 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
2740 local_irq_disable();
2741 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
2742 perf_event_task_sched_in(current);
2743 #ifdef __ARCH_WANT_INTERRUPTS_ON_CTXSW
2745 #endif /* __ARCH_WANT_INTERRUPTS_ON_CTXSW */
2746 finish_lock_switch(rq, prev);
2748 fire_sched_in_preempt_notifiers(current);
2751 if (unlikely(prev_state == TASK_DEAD)) {
2753 * Remove function-return probe instances associated with this
2754 * task and put them back on the free list.
2756 kprobe_flush_task(prev);
2757 put_task_struct(prev);
2763 /* assumes rq->lock is held */
2764 static inline void pre_schedule(struct rq *rq, struct task_struct *prev)
2766 if (prev->sched_class->pre_schedule)
2767 prev->sched_class->pre_schedule(rq, prev);
2770 /* rq->lock is NOT held, but preemption is disabled */
2771 static inline void post_schedule(struct rq *rq)
2773 if (rq->post_schedule) {
2774 unsigned long flags;
2776 raw_spin_lock_irqsave(&rq->lock, flags);
2777 if (rq->curr->sched_class->post_schedule)
2778 rq->curr->sched_class->post_schedule(rq);
2779 raw_spin_unlock_irqrestore(&rq->lock, flags);
2781 rq->post_schedule = 0;
2787 static inline void pre_schedule(struct rq *rq, struct task_struct *p)
2791 static inline void post_schedule(struct rq *rq)
2798 * schedule_tail - first thing a freshly forked thread must call.
2799 * @prev: the thread we just switched away from.
2801 asmlinkage void schedule_tail(struct task_struct *prev)
2802 __releases(rq->lock)
2804 struct rq *rq = this_rq();
2806 finish_task_switch(rq, prev);
2809 * FIXME: do we need to worry about rq being invalidated by the
2814 #ifdef __ARCH_WANT_UNLOCKED_CTXSW
2815 /* In this case, finish_task_switch does not reenable preemption */
2818 if (current->set_child_tid)
2819 put_user(task_pid_vnr(current), current->set_child_tid);
2823 * context_switch - switch to the new MM and the new
2824 * thread's register state.
2827 context_switch(struct rq *rq, struct task_struct *prev,
2828 struct task_struct *next)
2830 struct mm_struct *mm, *oldmm;
2832 prepare_task_switch(rq, prev, next);
2833 trace_sched_switch(rq, prev, next);
2835 oldmm = prev->active_mm;
2837 * For paravirt, this is coupled with an exit in switch_to to
2838 * combine the page table reload and the switch backend into
2841 arch_start_context_switch(prev);
2844 next->active_mm = oldmm;
2845 atomic_inc(&oldmm->mm_count);
2846 enter_lazy_tlb(oldmm, next);
2848 switch_mm(oldmm, mm, next);
2850 if (likely(!prev->mm)) {
2851 prev->active_mm = NULL;
2852 rq->prev_mm = oldmm;
2855 * Since the runqueue lock will be released by the next
2856 * task (which is an invalid locking op but in the case
2857 * of the scheduler it's an obvious special-case), so we
2858 * do an early lockdep release here:
2860 #ifndef __ARCH_WANT_UNLOCKED_CTXSW
2861 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
2864 /* Here we just switch the register state and the stack. */
2865 switch_to(prev, next, prev);
2869 * this_rq must be evaluated again because prev may have moved
2870 * CPUs since it called schedule(), thus the 'rq' on its stack
2871 * frame will be invalid.
2873 finish_task_switch(this_rq(), prev);
2877 * nr_running, nr_uninterruptible and nr_context_switches:
2879 * externally visible scheduler statistics: current number of runnable
2880 * threads, current number of uninterruptible-sleeping threads, total
2881 * number of context switches performed since bootup.
2883 unsigned long nr_running(void)
2885 unsigned long i, sum = 0;
2887 for_each_online_cpu(i)
2888 sum += cpu_rq(i)->nr_running;
2893 unsigned long nr_uninterruptible(void)
2895 unsigned long i, sum = 0;
2897 for_each_possible_cpu(i)
2898 sum += cpu_rq(i)->nr_uninterruptible;
2901 * Since we read the counters lockless, it might be slightly
2902 * inaccurate. Do not allow it to go below zero though:
2904 if (unlikely((long)sum < 0))
2910 unsigned long long nr_context_switches(void)
2913 unsigned long long sum = 0;
2915 for_each_possible_cpu(i)
2916 sum += cpu_rq(i)->nr_switches;
2921 unsigned long nr_iowait(void)
2923 unsigned long i, sum = 0;
2925 for_each_possible_cpu(i)
2926 sum += atomic_read(&cpu_rq(i)->nr_iowait);
2931 unsigned long nr_iowait_cpu(void)
2933 struct rq *this = this_rq();
2934 return atomic_read(&this->nr_iowait);
2937 unsigned long this_cpu_load(void)
2939 struct rq *this = this_rq();
2940 return this->cpu_load[0];
2944 /* Variables and functions for calc_load */
2945 static atomic_long_t calc_load_tasks;
2946 static unsigned long calc_load_update;
2947 unsigned long avenrun[3];
2948 EXPORT_SYMBOL(avenrun);
2951 * get_avenrun - get the load average array
2952 * @loads: pointer to dest load array
2953 * @offset: offset to add
2954 * @shift: shift count to shift the result left
2956 * These values are estimates at best, so no need for locking.
2958 void get_avenrun(unsigned long *loads, unsigned long offset, int shift)
2960 loads[0] = (avenrun[0] + offset) << shift;
2961 loads[1] = (avenrun[1] + offset) << shift;
2962 loads[2] = (avenrun[2] + offset) << shift;
2965 static unsigned long
2966 calc_load(unsigned long load, unsigned long exp, unsigned long active)
2969 load += active * (FIXED_1 - exp);
2970 return load >> FSHIFT;
2974 * calc_load - update the avenrun load estimates 10 ticks after the
2975 * CPUs have updated calc_load_tasks.
2977 void calc_global_load(void)
2979 unsigned long upd = calc_load_update + 10;
2982 if (time_before(jiffies, upd))
2985 active = atomic_long_read(&calc_load_tasks);
2986 active = active > 0 ? active * FIXED_1 : 0;
2988 avenrun[0] = calc_load(avenrun[0], EXP_1, active);
2989 avenrun[1] = calc_load(avenrun[1], EXP_5, active);
2990 avenrun[2] = calc_load(avenrun[2], EXP_15, active);
2992 calc_load_update += LOAD_FREQ;
2996 * Either called from update_cpu_load() or from a cpu going idle
2998 static void calc_load_account_active(struct rq *this_rq)
3000 long nr_active, delta;
3002 nr_active = this_rq->nr_running;
3003 nr_active += (long) this_rq->nr_uninterruptible;
3005 if (nr_active != this_rq->calc_load_active) {
3006 delta = nr_active - this_rq->calc_load_active;
3007 this_rq->calc_load_active = nr_active;
3008 atomic_long_add(delta, &calc_load_tasks);
3013 * Update rq->cpu_load[] statistics. This function is usually called every
3014 * scheduler tick (TICK_NSEC).
3016 static void update_cpu_load(struct rq *this_rq)
3018 unsigned long this_load = this_rq->load.weight;
3021 this_rq->nr_load_updates++;
3023 /* Update our load: */
3024 for (i = 0, scale = 1; i < CPU_LOAD_IDX_MAX; i++, scale += scale) {
3025 unsigned long old_load, new_load;
3027 /* scale is effectively 1 << i now, and >> i divides by scale */
3029 old_load = this_rq->cpu_load[i];
3030 new_load = this_load;
3032 * Round up the averaging division if load is increasing. This
3033 * prevents us from getting stuck on 9 if the load is 10, for
3036 if (new_load > old_load)
3037 new_load += scale-1;
3038 this_rq->cpu_load[i] = (old_load*(scale-1) + new_load) >> i;
3041 if (time_after_eq(jiffies, this_rq->calc_load_update)) {
3042 this_rq->calc_load_update += LOAD_FREQ;
3043 calc_load_account_active(this_rq);
3050 * sched_exec - execve() is a valuable balancing opportunity, because at
3051 * this point the task has the smallest effective memory and cache footprint.
3053 void sched_exec(void)
3055 struct task_struct *p = current;
3056 struct migration_req req;
3057 unsigned long flags;
3061 rq = task_rq_lock(p, &flags);
3062 dest_cpu = p->sched_class->select_task_rq(rq, p, SD_BALANCE_EXEC, 0);
3063 if (dest_cpu == smp_processor_id())
3067 * select_task_rq() can race against ->cpus_allowed
3069 if (cpumask_test_cpu(dest_cpu, &p->cpus_allowed) &&
3070 likely(cpu_active(dest_cpu)) &&
3071 migrate_task(p, dest_cpu, &req)) {
3072 /* Need to wait for migration thread (might exit: take ref). */
3073 struct task_struct *mt = rq->migration_thread;
3075 get_task_struct(mt);
3076 task_rq_unlock(rq, &flags);
3077 wake_up_process(mt);
3078 put_task_struct(mt);
3079 wait_for_completion(&req.done);
3084 task_rq_unlock(rq, &flags);
3089 DEFINE_PER_CPU(struct kernel_stat, kstat);
3091 EXPORT_PER_CPU_SYMBOL(kstat);
3094 * Return any ns on the sched_clock that have not yet been accounted in
3095 * @p in case that task is currently running.
3097 * Called with task_rq_lock() held on @rq.
3099 static u64 do_task_delta_exec(struct task_struct *p, struct rq *rq)
3103 if (task_current(rq, p)) {
3104 update_rq_clock(rq);
3105 ns = rq->clock - p->se.exec_start;
3113 unsigned long long task_delta_exec(struct task_struct *p)
3115 unsigned long flags;
3119 rq = task_rq_lock(p, &flags);
3120 ns = do_task_delta_exec(p, rq);
3121 task_rq_unlock(rq, &flags);
3127 * Return accounted runtime for the task.
3128 * In case the task is currently running, return the runtime plus current's
3129 * pending runtime that have not been accounted yet.
3131 unsigned long long task_sched_runtime(struct task_struct *p)
3133 unsigned long flags;
3137 rq = task_rq_lock(p, &flags);
3138 ns = p->se.sum_exec_runtime + do_task_delta_exec(p, rq);
3139 task_rq_unlock(rq, &flags);
3145 * Return sum_exec_runtime for the thread group.
3146 * In case the task is currently running, return the sum plus current's
3147 * pending runtime that have not been accounted yet.
3149 * Note that the thread group might have other running tasks as well,
3150 * so the return value not includes other pending runtime that other
3151 * running tasks might have.
3153 unsigned long long thread_group_sched_runtime(struct task_struct *p)
3155 struct task_cputime totals;
3156 unsigned long flags;
3160 rq = task_rq_lock(p, &flags);
3161 thread_group_cputime(p, &totals);
3162 ns = totals.sum_exec_runtime + do_task_delta_exec(p, rq);
3163 task_rq_unlock(rq, &flags);
3169 * Account user cpu time to a process.
3170 * @p: the process that the cpu time gets accounted to
3171 * @cputime: the cpu time spent in user space since the last update
3172 * @cputime_scaled: cputime scaled by cpu frequency
3174 void account_user_time(struct task_struct *p, cputime_t cputime,
3175 cputime_t cputime_scaled)
3177 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3180 /* Add user time to process. */
3181 p->utime = cputime_add(p->utime, cputime);
3182 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
3183 account_group_user_time(p, cputime);
3185 /* Add user time to cpustat. */
3186 tmp = cputime_to_cputime64(cputime);
3187 if (TASK_NICE(p) > 0)
3188 cpustat->nice = cputime64_add(cpustat->nice, tmp);
3190 cpustat->user = cputime64_add(cpustat->user, tmp);
3192 cpuacct_update_stats(p, CPUACCT_STAT_USER, cputime);
3193 /* Account for user time used */
3194 acct_update_integrals(p);
3198 * Account guest cpu time to a process.
3199 * @p: the process that the cpu time gets accounted to
3200 * @cputime: the cpu time spent in virtual machine since the last update
3201 * @cputime_scaled: cputime scaled by cpu frequency
3203 static void account_guest_time(struct task_struct *p, cputime_t cputime,
3204 cputime_t cputime_scaled)
3207 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3209 tmp = cputime_to_cputime64(cputime);
3211 /* Add guest time to process. */
3212 p->utime = cputime_add(p->utime, cputime);
3213 p->utimescaled = cputime_add(p->utimescaled, cputime_scaled);
3214 account_group_user_time(p, cputime);
3215 p->gtime = cputime_add(p->gtime, cputime);
3217 /* Add guest time to cpustat. */
3218 if (TASK_NICE(p) > 0) {
3219 cpustat->nice = cputime64_add(cpustat->nice, tmp);
3220 cpustat->guest_nice = cputime64_add(cpustat->guest_nice, tmp);
3222 cpustat->user = cputime64_add(cpustat->user, tmp);
3223 cpustat->guest = cputime64_add(cpustat->guest, tmp);
3228 * Account system cpu time to a process.
3229 * @p: the process that the cpu time gets accounted to
3230 * @hardirq_offset: the offset to subtract from hardirq_count()
3231 * @cputime: the cpu time spent in kernel space since the last update
3232 * @cputime_scaled: cputime scaled by cpu frequency
3234 void account_system_time(struct task_struct *p, int hardirq_offset,
3235 cputime_t cputime, cputime_t cputime_scaled)
3237 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3240 if ((p->flags & PF_VCPU) && (irq_count() - hardirq_offset == 0)) {
3241 account_guest_time(p, cputime, cputime_scaled);
3245 /* Add system time to process. */
3246 p->stime = cputime_add(p->stime, cputime);
3247 p->stimescaled = cputime_add(p->stimescaled, cputime_scaled);
3248 account_group_system_time(p, cputime);
3250 /* Add system time to cpustat. */
3251 tmp = cputime_to_cputime64(cputime);
3252 if (hardirq_count() - hardirq_offset)
3253 cpustat->irq = cputime64_add(cpustat->irq, tmp);
3254 else if (softirq_count())
3255 cpustat->softirq = cputime64_add(cpustat->softirq, tmp);
3257 cpustat->system = cputime64_add(cpustat->system, tmp);
3259 cpuacct_update_stats(p, CPUACCT_STAT_SYSTEM, cputime);
3261 /* Account for system time used */
3262 acct_update_integrals(p);
3266 * Account for involuntary wait time.
3267 * @steal: the cpu time spent in involuntary wait
3269 void account_steal_time(cputime_t cputime)
3271 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3272 cputime64_t cputime64 = cputime_to_cputime64(cputime);
3274 cpustat->steal = cputime64_add(cpustat->steal, cputime64);
3278 * Account for idle time.
3279 * @cputime: the cpu time spent in idle wait
3281 void account_idle_time(cputime_t cputime)
3283 struct cpu_usage_stat *cpustat = &kstat_this_cpu.cpustat;
3284 cputime64_t cputime64 = cputime_to_cputime64(cputime);
3285 struct rq *rq = this_rq();
3287 if (atomic_read(&rq->nr_iowait) > 0)
3288 cpustat->iowait = cputime64_add(cpustat->iowait, cputime64);
3290 cpustat->idle = cputime64_add(cpustat->idle, cputime64);
3293 #ifndef CONFIG_VIRT_CPU_ACCOUNTING
3296 * Account a single tick of cpu time.
3297 * @p: the process that the cpu time gets accounted to
3298 * @user_tick: indicates if the tick is a user or a system tick
3300 void account_process_tick(struct task_struct *p, int user_tick)
3302 cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy);
3303 struct rq *rq = this_rq();
3306 account_user_time(p, cputime_one_jiffy, one_jiffy_scaled);
3307 else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET))
3308 account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy,
3311 account_idle_time(cputime_one_jiffy);
3315 * Account multiple ticks of steal time.
3316 * @p: the process from which the cpu time has been stolen
3317 * @ticks: number of stolen ticks
3319 void account_steal_ticks(unsigned long ticks)
3321 account_steal_time(jiffies_to_cputime(ticks));
3325 * Account multiple ticks of idle time.
3326 * @ticks: number of stolen ticks
3328 void account_idle_ticks(unsigned long ticks)
3330 account_idle_time(jiffies_to_cputime(ticks));
3336 * Use precise platform statistics if available:
3338 #ifdef CONFIG_VIRT_CPU_ACCOUNTING
3339 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3345 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3347 struct task_cputime cputime;
3349 thread_group_cputime(p, &cputime);
3351 *ut = cputime.utime;
3352 *st = cputime.stime;
3356 #ifndef nsecs_to_cputime
3357 # define nsecs_to_cputime(__nsecs) nsecs_to_jiffies(__nsecs)
3360 void task_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3362 cputime_t rtime, utime = p->utime, total = cputime_add(utime, p->stime);
3365 * Use CFS's precise accounting:
3367 rtime = nsecs_to_cputime(p->se.sum_exec_runtime);
3372 temp = (u64)(rtime * utime);
3373 do_div(temp, total);
3374 utime = (cputime_t)temp;
3379 * Compare with previous values, to keep monotonicity:
3381 p->prev_utime = max(p->prev_utime, utime);
3382 p->prev_stime = max(p->prev_stime, cputime_sub(rtime, p->prev_utime));
3384 *ut = p->prev_utime;
3385 *st = p->prev_stime;
3389 * Must be called with siglock held.
3391 void thread_group_times(struct task_struct *p, cputime_t *ut, cputime_t *st)
3393 struct signal_struct *sig = p->signal;
3394 struct task_cputime cputime;
3395 cputime_t rtime, utime, total;
3397 thread_group_cputime(p, &cputime);
3399 total = cputime_add(cputime.utime, cputime.stime);
3400 rtime = nsecs_to_cputime(cputime.sum_exec_runtime);
3405 temp = (u64)(rtime * cputime.utime);
3406 do_div(temp, total);
3407 utime = (cputime_t)temp;
3411 sig->prev_utime = max(sig->prev_utime, utime);
3412 sig->prev_stime = max(sig->prev_stime,
3413 cputime_sub(rtime, sig->prev_utime));
3415 *ut = sig->prev_utime;
3416 *st = sig->prev_stime;
3421 * This function gets called by the timer code, with HZ frequency.
3422 * We call it with interrupts disabled.
3424 * It also gets called by the fork code, when changing the parent's
3427 void scheduler_tick(void)
3429 int cpu = smp_processor_id();
3430 struct rq *rq = cpu_rq(cpu);
3431 struct task_struct *curr = rq->curr;
3435 raw_spin_lock(&rq->lock);
3436 update_rq_clock(rq);
3437 update_cpu_load(rq);
3438 curr->sched_class->task_tick(rq, curr, 0);
3439 raw_spin_unlock(&rq->lock);
3441 perf_event_task_tick(curr);
3444 rq->idle_at_tick = idle_cpu(cpu);
3445 trigger_load_balance(rq, cpu);
3449 notrace unsigned long get_parent_ip(unsigned long addr)
3451 if (in_lock_functions(addr)) {
3452 addr = CALLER_ADDR2;
3453 if (in_lock_functions(addr))
3454 addr = CALLER_ADDR3;
3459 #if defined(CONFIG_PREEMPT) && (defined(CONFIG_DEBUG_PREEMPT) || \
3460 defined(CONFIG_PREEMPT_TRACER))
3462 void __kprobes add_preempt_count(int val)
3464 #ifdef CONFIG_DEBUG_PREEMPT
3468 if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0)))
3471 preempt_count() += val;
3472 #ifdef CONFIG_DEBUG_PREEMPT
3474 * Spinlock count overflowing soon?
3476 DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >=
3479 if (preempt_count() == val)
3480 trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3482 EXPORT_SYMBOL(add_preempt_count);
3484 void __kprobes sub_preempt_count(int val)
3486 #ifdef CONFIG_DEBUG_PREEMPT
3490 if (DEBUG_LOCKS_WARN_ON(val > preempt_count()))
3493 * Is the spinlock portion underflowing?
3495 if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) &&
3496 !(preempt_count() & PREEMPT_MASK)))
3500 if (preempt_count() == val)
3501 trace_preempt_on(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
3502 preempt_count() -= val;
3504 EXPORT_SYMBOL(sub_preempt_count);
3509 * Print scheduling while atomic bug:
3511 static noinline void __schedule_bug(struct task_struct *prev)
3513 struct pt_regs *regs = get_irq_regs();
3515 printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n",
3516 prev->comm, prev->pid, preempt_count());
3518 debug_show_held_locks(prev);
3520 if (irqs_disabled())
3521 print_irqtrace_events(prev);
3530 * Various schedule()-time debugging checks and statistics:
3532 static inline void schedule_debug(struct task_struct *prev)
3535 * Test if we are atomic. Since do_exit() needs to call into
3536 * schedule() atomically, we ignore that path for now.
3537 * Otherwise, whine if we are scheduling when we should not be.
3539 if (unlikely(in_atomic_preempt_off() && !prev->exit_state))
3540 __schedule_bug(prev);
3542 profile_hit(SCHED_PROFILING, __builtin_return_address(0));
3544 schedstat_inc(this_rq(), sched_count);
3545 #ifdef CONFIG_SCHEDSTATS
3546 if (unlikely(prev->lock_depth >= 0)) {
3547 schedstat_inc(this_rq(), bkl_count);
3548 schedstat_inc(prev, sched_info.bkl_count);
3553 static void put_prev_task(struct rq *rq, struct task_struct *prev)
3556 update_rq_clock(rq);
3557 rq->skip_clock_update = 0;
3558 prev->sched_class->put_prev_task(rq, prev);
3562 * Pick up the highest-prio task:
3564 static inline struct task_struct *
3565 pick_next_task(struct rq *rq)
3567 const struct sched_class *class;
3568 struct task_struct *p;
3571 * Optimization: we know that if all tasks are in
3572 * the fair class we can call that function directly:
3574 if (likely(rq->nr_running == rq->cfs.nr_running)) {
3575 p = fair_sched_class.pick_next_task(rq);
3580 class = sched_class_highest;
3582 p = class->pick_next_task(rq);
3586 * Will never be NULL as the idle class always
3587 * returns a non-NULL p:
3589 class = class->next;
3594 * schedule() is the main scheduler function.
3596 asmlinkage void __sched schedule(void)
3598 struct task_struct *prev, *next;
3599 unsigned long *switch_count;
3605 cpu = smp_processor_id();
3609 switch_count = &prev->nivcsw;
3611 release_kernel_lock(prev);
3612 need_resched_nonpreemptible:
3614 schedule_debug(prev);
3616 if (sched_feat(HRTICK))
3619 raw_spin_lock_irq(&rq->lock);
3620 clear_tsk_need_resched(prev);
3622 if (prev->state && !(preempt_count() & PREEMPT_ACTIVE)) {
3623 if (unlikely(signal_pending_state(prev->state, prev)))
3624 prev->state = TASK_RUNNING;
3626 deactivate_task(rq, prev, 1);
3627 switch_count = &prev->nvcsw;
3630 pre_schedule(rq, prev);
3632 if (unlikely(!rq->nr_running))
3633 idle_balance(cpu, rq);
3635 put_prev_task(rq, prev);
3636 next = pick_next_task(rq);
3638 if (likely(prev != next)) {
3639 sched_info_switch(prev, next);
3640 perf_event_task_sched_out(prev, next);
3646 context_switch(rq, prev, next); /* unlocks the rq */
3648 * the context switch might have flipped the stack from under
3649 * us, hence refresh the local variables.
3651 cpu = smp_processor_id();
3654 raw_spin_unlock_irq(&rq->lock);
3658 if (unlikely(reacquire_kernel_lock(current) < 0)) {
3660 switch_count = &prev->nivcsw;
3661 goto need_resched_nonpreemptible;
3664 preempt_enable_no_resched();
3668 EXPORT_SYMBOL(schedule);
3670 #ifdef CONFIG_MUTEX_SPIN_ON_OWNER
3672 * Look out! "owner" is an entirely speculative pointer
3673 * access and not reliable.
3675 int mutex_spin_on_owner(struct mutex *lock, struct thread_info *owner)
3680 if (!sched_feat(OWNER_SPIN))
3683 #ifdef CONFIG_DEBUG_PAGEALLOC
3685 * Need to access the cpu field knowing that
3686 * DEBUG_PAGEALLOC could have unmapped it if
3687 * the mutex owner just released it and exited.
3689 if (probe_kernel_address(&owner->cpu, cpu))
3696 * Even if the access succeeded (likely case),
3697 * the cpu field may no longer be valid.
3699 if (cpu >= nr_cpumask_bits)
3703 * We need to validate that we can do a
3704 * get_cpu() and that we have the percpu area.
3706 if (!cpu_online(cpu))
3713 * Owner changed, break to re-assess state.
3715 if (lock->owner != owner)
3719 * Is that owner really running on that cpu?
3721 if (task_thread_info(rq->curr) != owner || need_resched())
3731 #ifdef CONFIG_PREEMPT
3733 * this is the entry point to schedule() from in-kernel preemption
3734 * off of preempt_enable. Kernel preemptions off return from interrupt
3735 * occur there and call schedule directly.
3737 asmlinkage void __sched preempt_schedule(void)
3739 struct thread_info *ti = current_thread_info();
3742 * If there is a non-zero preempt_count or interrupts are disabled,
3743 * we do not want to preempt the current task. Just return..
3745 if (likely(ti->preempt_count || irqs_disabled()))
3749 add_preempt_count(PREEMPT_ACTIVE);
3751 sub_preempt_count(PREEMPT_ACTIVE);
3754 * Check again in case we missed a preemption opportunity
3755 * between schedule and now.
3758 } while (need_resched());
3760 EXPORT_SYMBOL(preempt_schedule);
3763 * this is the entry point to schedule() from kernel preemption
3764 * off of irq context.
3765 * Note, that this is called and return with irqs disabled. This will
3766 * protect us against recursive calling from irq.
3768 asmlinkage void __sched preempt_schedule_irq(void)
3770 struct thread_info *ti = current_thread_info();
3772 /* Catch callers which need to be fixed */
3773 BUG_ON(ti->preempt_count || !irqs_disabled());
3776 add_preempt_count(PREEMPT_ACTIVE);
3779 local_irq_disable();
3780 sub_preempt_count(PREEMPT_ACTIVE);
3783 * Check again in case we missed a preemption opportunity
3784 * between schedule and now.
3787 } while (need_resched());
3790 #endif /* CONFIG_PREEMPT */
3792 int default_wake_function(wait_queue_t *curr, unsigned mode, int wake_flags,
3795 return try_to_wake_up(curr->private, mode, wake_flags);
3797 EXPORT_SYMBOL(default_wake_function);
3800 * The core wakeup function. Non-exclusive wakeups (nr_exclusive == 0) just
3801 * wake everything up. If it's an exclusive wakeup (nr_exclusive == small +ve
3802 * number) then we wake all the non-exclusive tasks and one exclusive task.
3804 * There are circumstances in which we can try to wake a task which has already
3805 * started to run but is not in state TASK_RUNNING. try_to_wake_up() returns
3806 * zero in this (rare) case, and we handle it by continuing to scan the queue.
3808 static void __wake_up_common(wait_queue_head_t *q, unsigned int mode,
3809 int nr_exclusive, int wake_flags, void *key)
3811 wait_queue_t *curr, *next;
3813 list_for_each_entry_safe(curr, next, &q->task_list, task_list) {
3814 unsigned flags = curr->flags;
3816 if (curr->func(curr, mode, wake_flags, key) &&
3817 (flags & WQ_FLAG_EXCLUSIVE) && !--nr_exclusive)
3823 * __wake_up - wake up threads blocked on a waitqueue.
3825 * @mode: which threads
3826 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3827 * @key: is directly passed to the wakeup function
3829 * It may be assumed that this function implies a write memory barrier before
3830 * changing the task state if and only if any tasks are woken up.
3832 void __wake_up(wait_queue_head_t *q, unsigned int mode,
3833 int nr_exclusive, void *key)
3835 unsigned long flags;
3837 spin_lock_irqsave(&q->lock, flags);
3838 __wake_up_common(q, mode, nr_exclusive, 0, key);
3839 spin_unlock_irqrestore(&q->lock, flags);
3841 EXPORT_SYMBOL(__wake_up);
3844 * Same as __wake_up but called with the spinlock in wait_queue_head_t held.
3846 void __wake_up_locked(wait_queue_head_t *q, unsigned int mode)
3848 __wake_up_common(q, mode, 1, 0, NULL);
3851 void __wake_up_locked_key(wait_queue_head_t *q, unsigned int mode, void *key)
3853 __wake_up_common(q, mode, 1, 0, key);
3857 * __wake_up_sync_key - wake up threads blocked on a waitqueue.
3859 * @mode: which threads
3860 * @nr_exclusive: how many wake-one or wake-many threads to wake up
3861 * @key: opaque value to be passed to wakeup targets
3863 * The sync wakeup differs that the waker knows that it will schedule
3864 * away soon, so while the target thread will be woken up, it will not
3865 * be migrated to another CPU - ie. the two threads are 'synchronized'
3866 * with each other. This can prevent needless bouncing between CPUs.
3868 * On UP it can prevent extra preemption.
3870 * It may be assumed that this function implies a write memory barrier before
3871 * changing the task state if and only if any tasks are woken up.
3873 void __wake_up_sync_key(wait_queue_head_t *q, unsigned int mode,
3874 int nr_exclusive, void *key)
3876 unsigned long flags;
3877 int wake_flags = WF_SYNC;
3882 if (unlikely(!nr_exclusive))
3885 spin_lock_irqsave(&q->lock, flags);
3886 __wake_up_common(q, mode, nr_exclusive, wake_flags, key);
3887 spin_unlock_irqrestore(&q->lock, flags);
3889 EXPORT_SYMBOL_GPL(__wake_up_sync_key);
3892 * __wake_up_sync - see __wake_up_sync_key()
3894 void __wake_up_sync(wait_queue_head_t *q, unsigned int mode, int nr_exclusive)
3896 __wake_up_sync_key(q, mode, nr_exclusive, NULL);
3898 EXPORT_SYMBOL_GPL(__wake_up_sync); /* For internal use only */
3901 * complete: - signals a single thread waiting on this completion
3902 * @x: holds the state of this particular completion
3904 * This will wake up a single thread waiting on this completion. Threads will be
3905 * awakened in the same order in which they were queued.
3907 * See also complete_all(), wait_for_completion() and related routines.
3909 * It may be assumed that this function implies a write memory barrier before
3910 * changing the task state if and only if any tasks are woken up.
3912 void complete(struct completion *x)
3914 unsigned long flags;
3916 spin_lock_irqsave(&x->wait.lock, flags);
3918 __wake_up_common(&x->wait, TASK_NORMAL, 1, 0, NULL);
3919 spin_unlock_irqrestore(&x->wait.lock, flags);
3921 EXPORT_SYMBOL(complete);
3924 * complete_all: - signals all threads waiting on this completion
3925 * @x: holds the state of this particular completion
3927 * This will wake up all threads waiting on this particular completion event.
3929 * It may be assumed that this function implies a write memory barrier before
3930 * changing the task state if and only if any tasks are woken up.
3932 void complete_all(struct completion *x)
3934 unsigned long flags;
3936 spin_lock_irqsave(&x->wait.lock, flags);
3937 x->done += UINT_MAX/2;
3938 __wake_up_common(&x->wait, TASK_NORMAL, 0, 0, NULL);
3939 spin_unlock_irqrestore(&x->wait.lock, flags);
3941 EXPORT_SYMBOL(complete_all);
3943 static inline long __sched
3944 do_wait_for_common(struct completion *x, long timeout, int state)
3947 DECLARE_WAITQUEUE(wait, current);
3949 wait.flags |= WQ_FLAG_EXCLUSIVE;
3950 __add_wait_queue_tail(&x->wait, &wait);
3952 if (signal_pending_state(state, current)) {
3953 timeout = -ERESTARTSYS;
3956 __set_current_state(state);
3957 spin_unlock_irq(&x->wait.lock);
3958 timeout = schedule_timeout(timeout);
3959 spin_lock_irq(&x->wait.lock);
3960 } while (!x->done && timeout);
3961 __remove_wait_queue(&x->wait, &wait);
3966 return timeout ?: 1;
3970 wait_for_common(struct completion *x, long timeout, int state)
3974 spin_lock_irq(&x->wait.lock);
3975 timeout = do_wait_for_common(x, timeout, state);
3976 spin_unlock_irq(&x->wait.lock);
3981 * wait_for_completion: - waits for completion of a task
3982 * @x: holds the state of this particular completion
3984 * This waits to be signaled for completion of a specific task. It is NOT
3985 * interruptible and there is no timeout.
3987 * See also similar routines (i.e. wait_for_completion_timeout()) with timeout
3988 * and interrupt capability. Also see complete().
3990 void __sched wait_for_completion(struct completion *x)
3992 wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_UNINTERRUPTIBLE);
3994 EXPORT_SYMBOL(wait_for_completion);
3997 * wait_for_completion_timeout: - waits for completion of a task (w/timeout)
3998 * @x: holds the state of this particular completion
3999 * @timeout: timeout value in jiffies
4001 * This waits for either a completion of a specific task to be signaled or for a
4002 * specified timeout to expire. The timeout is in jiffies. It is not
4005 unsigned long __sched
4006 wait_for_completion_timeout(struct completion *x, unsigned long timeout)
4008 return wait_for_common(x, timeout, TASK_UNINTERRUPTIBLE);
4010 EXPORT_SYMBOL(wait_for_completion_timeout);
4013 * wait_for_completion_interruptible: - waits for completion of a task (w/intr)
4014 * @x: holds the state of this particular completion
4016 * This waits for completion of a specific task to be signaled. It is
4019 int __sched wait_for_completion_interruptible(struct completion *x)
4021 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_INTERRUPTIBLE);
4022 if (t == -ERESTARTSYS)
4026 EXPORT_SYMBOL(wait_for_completion_interruptible);
4029 * wait_for_completion_interruptible_timeout: - waits for completion (w/(to,intr))
4030 * @x: holds the state of this particular completion
4031 * @timeout: timeout value in jiffies
4033 * This waits for either a completion of a specific task to be signaled or for a
4034 * specified timeout to expire. It is interruptible. The timeout is in jiffies.
4036 unsigned long __sched
4037 wait_for_completion_interruptible_timeout(struct completion *x,
4038 unsigned long timeout)
4040 return wait_for_common(x, timeout, TASK_INTERRUPTIBLE);
4042 EXPORT_SYMBOL(wait_for_completion_interruptible_timeout);
4045 * wait_for_completion_killable: - waits for completion of a task (killable)
4046 * @x: holds the state of this particular completion
4048 * This waits to be signaled for completion of a specific task. It can be
4049 * interrupted by a kill signal.
4051 int __sched wait_for_completion_killable(struct completion *x)
4053 long t = wait_for_common(x, MAX_SCHEDULE_TIMEOUT, TASK_KILLABLE);
4054 if (t == -ERESTARTSYS)
4058 EXPORT_SYMBOL(wait_for_completion_killable);
4061 * try_wait_for_completion - try to decrement a completion without blocking
4062 * @x: completion structure
4064 * Returns: 0 if a decrement cannot be done without blocking
4065 * 1 if a decrement succeeded.
4067 * If a completion is being used as a counting completion,
4068 * attempt to decrement the counter without blocking. This
4069 * enables us to avoid waiting if the resource the completion
4070 * is protecting is not available.
4072 bool try_wait_for_completion(struct completion *x)
4074 unsigned long flags;
4077 spin_lock_irqsave(&x->wait.lock, flags);
4082 spin_unlock_irqrestore(&x->wait.lock, flags);
4085 EXPORT_SYMBOL(try_wait_for_completion);
4088 * completion_done - Test to see if a completion has any waiters
4089 * @x: completion structure
4091 * Returns: 0 if there are waiters (wait_for_completion() in progress)
4092 * 1 if there are no waiters.
4095 bool completion_done(struct completion *x)
4097 unsigned long flags;
4100 spin_lock_irqsave(&x->wait.lock, flags);
4103 spin_unlock_irqrestore(&x->wait.lock, flags);
4106 EXPORT_SYMBOL(completion_done);
4109 sleep_on_common(wait_queue_head_t *q, int state, long timeout)
4111 unsigned long flags;
4114 init_waitqueue_entry(&wait, current);
4116 __set_current_state(state);
4118 spin_lock_irqsave(&q->lock, flags);
4119 __add_wait_queue(q, &wait);
4120 spin_unlock(&q->lock);
4121 timeout = schedule_timeout(timeout);
4122 spin_lock_irq(&q->lock);
4123 __remove_wait_queue(q, &wait);
4124 spin_unlock_irqrestore(&q->lock, flags);
4129 void __sched interruptible_sleep_on(wait_queue_head_t *q)
4131 sleep_on_common(q, TASK_INTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4133 EXPORT_SYMBOL(interruptible_sleep_on);
4136 interruptible_sleep_on_timeout(wait_queue_head_t *q, long timeout)
4138 return sleep_on_common(q, TASK_INTERRUPTIBLE, timeout);
4140 EXPORT_SYMBOL(interruptible_sleep_on_timeout);
4142 void __sched sleep_on(wait_queue_head_t *q)
4144 sleep_on_common(q, TASK_UNINTERRUPTIBLE, MAX_SCHEDULE_TIMEOUT);
4146 EXPORT_SYMBOL(sleep_on);
4148 long __sched sleep_on_timeout(wait_queue_head_t *q, long timeout)
4150 return sleep_on_common(q, TASK_UNINTERRUPTIBLE, timeout);
4152 EXPORT_SYMBOL(sleep_on_timeout);
4154 #ifdef CONFIG_RT_MUTEXES
4157 * rt_mutex_setprio - set the current priority of a task
4159 * @prio: prio value (kernel-internal form)
4161 * This function changes the 'effective' priority of a task. It does
4162 * not touch ->normal_prio like __setscheduler().
4164 * Used by the rt_mutex code to implement priority inheritance logic.
4166 void rt_mutex_setprio(struct task_struct *p, int prio)
4168 unsigned long flags;
4169 int oldprio, on_rq, running;
4171 const struct sched_class *prev_class;
4173 BUG_ON(prio < 0 || prio > MAX_PRIO);
4175 rq = task_rq_lock(p, &flags);
4178 prev_class = p->sched_class;
4179 on_rq = p->se.on_rq;
4180 running = task_current(rq, p);
4182 dequeue_task(rq, p, 0);
4184 p->sched_class->put_prev_task(rq, p);
4187 p->sched_class = &rt_sched_class;
4189 p->sched_class = &fair_sched_class;
4194 p->sched_class->set_curr_task(rq);
4196 enqueue_task(rq, p, 0, oldprio < prio);
4198 check_class_changed(rq, p, prev_class, oldprio, running);
4200 task_rq_unlock(rq, &flags);
4205 void set_user_nice(struct task_struct *p, long nice)
4207 int old_prio, delta, on_rq;
4208 unsigned long flags;
4211 if (TASK_NICE(p) == nice || nice < -20 || nice > 19)
4214 * We have to be careful, if called from sys_setpriority(),
4215 * the task might be in the middle of scheduling on another CPU.
4217 rq = task_rq_lock(p, &flags);
4219 * The RT priorities are set via sched_setscheduler(), but we still
4220 * allow the 'normal' nice value to be set - but as expected
4221 * it wont have any effect on scheduling until the task is
4222 * SCHED_FIFO/SCHED_RR:
4224 if (task_has_rt_policy(p)) {
4225 p->static_prio = NICE_TO_PRIO(nice);
4228 on_rq = p->se.on_rq;
4230 dequeue_task(rq, p, 0);
4232 p->static_prio = NICE_TO_PRIO(nice);
4235 p->prio = effective_prio(p);
4236 delta = p->prio - old_prio;
4239 enqueue_task(rq, p, 0, false);
4241 * If the task increased its priority or is running and
4242 * lowered its priority, then reschedule its CPU:
4244 if (delta < 0 || (delta > 0 && task_running(rq, p)))
4245 resched_task(rq->curr);
4248 task_rq_unlock(rq, &flags);
4250 EXPORT_SYMBOL(set_user_nice);
4253 * can_nice - check if a task can reduce its nice value
4257 int can_nice(const struct task_struct *p, const int nice)
4259 /* convert nice value [19,-20] to rlimit style value [1,40] */
4260 int nice_rlim = 20 - nice;
4262 return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) ||
4263 capable(CAP_SYS_NICE));
4266 #ifdef __ARCH_WANT_SYS_NICE
4269 * sys_nice - change the priority of the current process.
4270 * @increment: priority increment
4272 * sys_setpriority is a more generic, but much slower function that
4273 * does similar things.
4275 SYSCALL_DEFINE1(nice, int, increment)
4280 * Setpriority might change our priority at the same moment.
4281 * We don't have to worry. Conceptually one call occurs first
4282 * and we have a single winner.
4284 if (increment < -40)
4289 nice = TASK_NICE(current) + increment;
4295 if (increment < 0 && !can_nice(current, nice))
4298 retval = security_task_setnice(current, nice);
4302 set_user_nice(current, nice);
4309 * task_prio - return the priority value of a given task.
4310 * @p: the task in question.
4312 * This is the priority value as seen by users in /proc.
4313 * RT tasks are offset by -200. Normal tasks are centered
4314 * around 0, value goes from -16 to +15.
4316 int task_prio(const struct task_struct *p)
4318 return p->prio - MAX_RT_PRIO;
4322 * task_nice - return the nice value of a given task.
4323 * @p: the task in question.
4325 int task_nice(const struct task_struct *p)
4327 return TASK_NICE(p);
4329 EXPORT_SYMBOL(task_nice);
4332 * idle_cpu - is a given cpu idle currently?
4333 * @cpu: the processor in question.
4335 int idle_cpu(int cpu)
4337 return cpu_curr(cpu) == cpu_rq(cpu)->idle;
4341 * idle_task - return the idle task for a given cpu.
4342 * @cpu: the processor in question.
4344 struct task_struct *idle_task(int cpu)
4346 return cpu_rq(cpu)->idle;
4350 * find_process_by_pid - find a process with a matching PID value.
4351 * @pid: the pid in question.
4353 static struct task_struct *find_process_by_pid(pid_t pid)
4355 return pid ? find_task_by_vpid(pid) : current;
4358 /* Actually do priority change: must hold rq lock. */
4360 __setscheduler(struct rq *rq, struct task_struct *p, int policy, int prio)
4362 BUG_ON(p->se.on_rq);
4365 p->rt_priority = prio;
4366 p->normal_prio = normal_prio(p);
4367 /* we are holding p->pi_lock already */
4368 p->prio = rt_mutex_getprio(p);
4369 if (rt_prio(p->prio))
4370 p->sched_class = &rt_sched_class;
4372 p->sched_class = &fair_sched_class;
4377 * check the target process has a UID that matches the current process's
4379 static bool check_same_owner(struct task_struct *p)
4381 const struct cred *cred = current_cred(), *pcred;
4385 pcred = __task_cred(p);
4386 match = (cred->euid == pcred->euid ||
4387 cred->euid == pcred->uid);
4392 static int __sched_setscheduler(struct task_struct *p, int policy,
4393 struct sched_param *param, bool user)
4395 int retval, oldprio, oldpolicy = -1, on_rq, running;
4396 unsigned long flags;
4397 const struct sched_class *prev_class;
4401 /* may grab non-irq protected spin_locks */
4402 BUG_ON(in_interrupt());
4404 /* double check policy once rq lock held */
4406 reset_on_fork = p->sched_reset_on_fork;
4407 policy = oldpolicy = p->policy;
4409 reset_on_fork = !!(policy & SCHED_RESET_ON_FORK);
4410 policy &= ~SCHED_RESET_ON_FORK;
4412 if (policy != SCHED_FIFO && policy != SCHED_RR &&
4413 policy != SCHED_NORMAL && policy != SCHED_BATCH &&
4414 policy != SCHED_IDLE)
4419 * Valid priorities for SCHED_FIFO and SCHED_RR are
4420 * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL,
4421 * SCHED_BATCH and SCHED_IDLE is 0.
4423 if (param->sched_priority < 0 ||
4424 (p->mm && param->sched_priority > MAX_USER_RT_PRIO-1) ||
4425 (!p->mm && param->sched_priority > MAX_RT_PRIO-1))
4427 if (rt_policy(policy) != (param->sched_priority != 0))
4431 * Allow unprivileged RT tasks to decrease priority:
4433 if (user && !capable(CAP_SYS_NICE)) {
4434 if (rt_policy(policy)) {
4435 unsigned long rlim_rtprio;
4437 if (!lock_task_sighand(p, &flags))
4439 rlim_rtprio = task_rlimit(p, RLIMIT_RTPRIO);
4440 unlock_task_sighand(p, &flags);
4442 /* can't set/change the rt policy */
4443 if (policy != p->policy && !rlim_rtprio)
4446 /* can't increase priority */
4447 if (param->sched_priority > p->rt_priority &&
4448 param->sched_priority > rlim_rtprio)
4452 * Like positive nice levels, dont allow tasks to
4453 * move out of SCHED_IDLE either:
4455 if (p->policy == SCHED_IDLE && policy != SCHED_IDLE)
4458 /* can't change other user's priorities */
4459 if (!check_same_owner(p))
4462 /* Normal users shall not reset the sched_reset_on_fork flag */
4463 if (p->sched_reset_on_fork && !reset_on_fork)
4468 #ifdef CONFIG_RT_GROUP_SCHED
4470 * Do not allow realtime tasks into groups that have no runtime
4473 if (rt_bandwidth_enabled() && rt_policy(policy) &&
4474 task_group(p)->rt_bandwidth.rt_runtime == 0)
4478 retval = security_task_setscheduler(p, policy, param);
4484 * make sure no PI-waiters arrive (or leave) while we are
4485 * changing the priority of the task:
4487 raw_spin_lock_irqsave(&p->pi_lock, flags);
4489 * To be able to change p->policy safely, the apropriate
4490 * runqueue lock must be held.
4492 rq = __task_rq_lock(p);
4493 /* recheck policy now with rq lock held */
4494 if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) {
4495 policy = oldpolicy = -1;
4496 __task_rq_unlock(rq);
4497 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4500 on_rq = p->se.on_rq;
4501 running = task_current(rq, p);
4503 deactivate_task(rq, p, 0);
4505 p->sched_class->put_prev_task(rq, p);
4507 p->sched_reset_on_fork = reset_on_fork;
4510 prev_class = p->sched_class;
4511 __setscheduler(rq, p, policy, param->sched_priority);
4514 p->sched_class->set_curr_task(rq);
4516 activate_task(rq, p, 0);
4518 check_class_changed(rq, p, prev_class, oldprio, running);
4520 __task_rq_unlock(rq);
4521 raw_spin_unlock_irqrestore(&p->pi_lock, flags);
4523 rt_mutex_adjust_pi(p);
4529 * sched_setscheduler - change the scheduling policy and/or RT priority of a thread.
4530 * @p: the task in question.
4531 * @policy: new policy.
4532 * @param: structure containing the new RT priority.
4534 * NOTE that the task may be already dead.
4536 int sched_setscheduler(struct task_struct *p, int policy,
4537 struct sched_param *param)
4539 return __sched_setscheduler(p, policy, param, true);
4541 EXPORT_SYMBOL_GPL(sched_setscheduler);
4544 * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace.
4545 * @p: the task in question.
4546 * @policy: new policy.
4547 * @param: structure containing the new RT priority.
4549 * Just like sched_setscheduler, only don't bother checking if the
4550 * current context has permission. For example, this is needed in
4551 * stop_machine(): we create temporary high priority worker threads,
4552 * but our caller might not have that capability.
4554 int sched_setscheduler_nocheck(struct task_struct *p, int policy,
4555 struct sched_param *param)
4557 return __sched_setscheduler(p, policy, param, false);
4561 do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param)
4563 struct sched_param lparam;
4564 struct task_struct *p;
4567 if (!param || pid < 0)
4569 if (copy_from_user(&lparam, param, sizeof(struct sched_param)))
4574 p = find_process_by_pid(pid);
4576 retval = sched_setscheduler(p, policy, &lparam);
4583 * sys_sched_setscheduler - set/change the scheduler policy and RT priority
4584 * @pid: the pid in question.
4585 * @policy: new policy.
4586 * @param: structure containing the new RT priority.
4588 SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy,
4589 struct sched_param __user *, param)
4591 /* negative values for policy are not valid */
4595 return do_sched_setscheduler(pid, policy, param);
4599 * sys_sched_setparam - set/change the RT priority of a thread
4600 * @pid: the pid in question.
4601 * @param: structure containing the new RT priority.
4603 SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param)
4605 return do_sched_setscheduler(pid, -1, param);
4609 * sys_sched_getscheduler - get the policy (scheduling class) of a thread
4610 * @pid: the pid in question.
4612 SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid)
4614 struct task_struct *p;
4622 p = find_process_by_pid(pid);
4624 retval = security_task_getscheduler(p);
4627 | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0);
4634 * sys_sched_getparam - get the RT priority of a thread
4635 * @pid: the pid in question.
4636 * @param: structure containing the RT priority.
4638 SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param)
4640 struct sched_param lp;
4641 struct task_struct *p;
4644 if (!param || pid < 0)
4648 p = find_process_by_pid(pid);
4653 retval = security_task_getscheduler(p);
4657 lp.sched_priority = p->rt_priority;
4661 * This one might sleep, we cannot do it with a spinlock held ...
4663 retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0;
4672 long sched_setaffinity(pid_t pid, const struct cpumask *in_mask)
4674 cpumask_var_t cpus_allowed, new_mask;
4675 struct task_struct *p;
4681 p = find_process_by_pid(pid);
4688 /* Prevent p going away */
4692 if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) {
4696 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) {
4698 goto out_free_cpus_allowed;
4701 if (!check_same_owner(p) && !capable(CAP_SYS_NICE))
4704 retval = security_task_setscheduler(p, 0, NULL);
4708 cpuset_cpus_allowed(p, cpus_allowed);
4709 cpumask_and(new_mask, in_mask, cpus_allowed);
4711 retval = set_cpus_allowed_ptr(p, new_mask);
4714 cpuset_cpus_allowed(p, cpus_allowed);
4715 if (!cpumask_subset(new_mask, cpus_allowed)) {
4717 * We must have raced with a concurrent cpuset
4718 * update. Just reset the cpus_allowed to the
4719 * cpuset's cpus_allowed
4721 cpumask_copy(new_mask, cpus_allowed);
4726 free_cpumask_var(new_mask);
4727 out_free_cpus_allowed:
4728 free_cpumask_var(cpus_allowed);
4735 static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len,
4736 struct cpumask *new_mask)
4738 if (len < cpumask_size())
4739 cpumask_clear(new_mask);
4740 else if (len > cpumask_size())
4741 len = cpumask_size();
4743 return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0;
4747 * sys_sched_setaffinity - set the cpu affinity of a process
4748 * @pid: pid of the process
4749 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4750 * @user_mask_ptr: user-space pointer to the new cpu mask
4752 SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len,
4753 unsigned long __user *, user_mask_ptr)
4755 cpumask_var_t new_mask;
4758 if (!alloc_cpumask_var(&new_mask, GFP_KERNEL))
4761 retval = get_user_cpu_mask(user_mask_ptr, len, new_mask);
4763 retval = sched_setaffinity(pid, new_mask);
4764 free_cpumask_var(new_mask);
4768 long sched_getaffinity(pid_t pid, struct cpumask *mask)
4770 struct task_struct *p;
4771 unsigned long flags;
4779 p = find_process_by_pid(pid);
4783 retval = security_task_getscheduler(p);
4787 rq = task_rq_lock(p, &flags);
4788 cpumask_and(mask, &p->cpus_allowed, cpu_online_mask);
4789 task_rq_unlock(rq, &flags);
4799 * sys_sched_getaffinity - get the cpu affinity of a process
4800 * @pid: pid of the process
4801 * @len: length in bytes of the bitmask pointed to by user_mask_ptr
4802 * @user_mask_ptr: user-space pointer to hold the current cpu mask
4804 SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len,
4805 unsigned long __user *, user_mask_ptr)
4810 if (len < nr_cpu_ids)
4812 if (len & (sizeof(unsigned long)-1))
4815 if (!alloc_cpumask_var(&mask, GFP_KERNEL))
4818 ret = sched_getaffinity(pid, mask);
4820 size_t retlen = min_t(size_t, len, cpumask_size());
4822 if (copy_to_user(user_mask_ptr, mask, retlen))
4827 free_cpumask_var(mask);
4833 * sys_sched_yield - yield the current processor to other threads.
4835 * This function yields the current CPU to other tasks. If there are no
4836 * other threads running on this CPU then this function will return.
4838 SYSCALL_DEFINE0(sched_yield)
4840 struct rq *rq = this_rq_lock();
4842 schedstat_inc(rq, yld_count);
4843 current->sched_class->yield_task(rq);
4846 * Since we are going to call schedule() anyway, there's
4847 * no need to preempt or enable interrupts:
4849 __release(rq->lock);
4850 spin_release(&rq->lock.dep_map, 1, _THIS_IP_);
4851 do_raw_spin_unlock(&rq->lock);
4852 preempt_enable_no_resched();
4859 static inline int should_resched(void)
4861 return need_resched() && !(preempt_count() & PREEMPT_ACTIVE);
4864 static void __cond_resched(void)
4866 add_preempt_count(PREEMPT_ACTIVE);
4868 sub_preempt_count(PREEMPT_ACTIVE);
4871 int __sched _cond_resched(void)
4873 if (should_resched()) {
4879 EXPORT_SYMBOL(_cond_resched);
4882 * __cond_resched_lock() - if a reschedule is pending, drop the given lock,
4883 * call schedule, and on return reacquire the lock.
4885 * This works OK both with and without CONFIG_PREEMPT. We do strange low-level
4886 * operations here to prevent schedule() from being called twice (once via
4887 * spin_unlock(), once by hand).
4889 int __cond_resched_lock(spinlock_t *lock)
4891 int resched = should_resched();
4894 lockdep_assert_held(lock);
4896 if (spin_needbreak(lock) || resched) {
4907 EXPORT_SYMBOL(__cond_resched_lock);
4909 int __sched __cond_resched_softirq(void)
4911 BUG_ON(!in_softirq());
4913 if (should_resched()) {
4921 EXPORT_SYMBOL(__cond_resched_softirq);
4924 * yield - yield the current processor to other threads.
4926 * This is a shortcut for kernel-space yielding - it marks the
4927 * thread runnable and calls sys_sched_yield().
4929 void __sched yield(void)
4931 set_current_state(TASK_RUNNING);
4934 EXPORT_SYMBOL(yield);
4937 * This task is about to go to sleep on IO. Increment rq->nr_iowait so
4938 * that process accounting knows that this is a task in IO wait state.
4940 void __sched io_schedule(void)
4942 struct rq *rq = raw_rq();
4944 delayacct_blkio_start();
4945 atomic_inc(&rq->nr_iowait);
4946 current->in_iowait = 1;
4948 current->in_iowait = 0;
4949 atomic_dec(&rq->nr_iowait);
4950 delayacct_blkio_end();
4952 EXPORT_SYMBOL(io_schedule);
4954 long __sched io_schedule_timeout(long timeout)
4956 struct rq *rq = raw_rq();
4959 delayacct_blkio_start();
4960 atomic_inc(&rq->nr_iowait);
4961 current->in_iowait = 1;
4962 ret = schedule_timeout(timeout);
4963 current->in_iowait = 0;
4964 atomic_dec(&rq->nr_iowait);
4965 delayacct_blkio_end();
4970 * sys_sched_get_priority_max - return maximum RT priority.
4971 * @policy: scheduling class.
4973 * this syscall returns the maximum rt_priority that can be used
4974 * by a given scheduling class.
4976 SYSCALL_DEFINE1(sched_get_priority_max, int, policy)
4983 ret = MAX_USER_RT_PRIO-1;
4995 * sys_sched_get_priority_min - return minimum RT priority.
4996 * @policy: scheduling class.
4998 * this syscall returns the minimum rt_priority that can be used
4999 * by a given scheduling class.
5001 SYSCALL_DEFINE1(sched_get_priority_min, int, policy)
5019 * sys_sched_rr_get_interval - return the default timeslice of a process.
5020 * @pid: pid of the process.
5021 * @interval: userspace pointer to the timeslice value.
5023 * this syscall writes the default timeslice value of a given process
5024 * into the user-space timespec buffer. A value of '0' means infinity.
5026 SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid,
5027 struct timespec __user *, interval)
5029 struct task_struct *p;
5030 unsigned int time_slice;
5031 unsigned long flags;
5041 p = find_process_by_pid(pid);
5045 retval = security_task_getscheduler(p);
5049 rq = task_rq_lock(p, &flags);
5050 time_slice = p->sched_class->get_rr_interval(rq, p);
5051 task_rq_unlock(rq, &flags);
5054 jiffies_to_timespec(time_slice, &t);
5055 retval = copy_to_user(interval, &t, sizeof(t)) ? -EFAULT : 0;
5063 static const char stat_nam[] = TASK_STATE_TO_CHAR_STR;
5065 void sched_show_task(struct task_struct *p)
5067 unsigned long free = 0;
5070 state = p->state ? __ffs(p->state) + 1 : 0;
5071 printk(KERN_INFO "%-13.13s %c", p->comm,
5072 state < sizeof(stat_nam) - 1 ? stat_nam[state] : '?');
5073 #if BITS_PER_LONG == 32
5074 if (state == TASK_RUNNING)
5075 printk(KERN_CONT " running ");
5077 printk(KERN_CONT " %08lx ", thread_saved_pc(p));
5079 if (state == TASK_RUNNING)
5080 printk(KERN_CONT " running task ");
5082 printk(KERN_CONT " %016lx ", thread_saved_pc(p));
5084 #ifdef CONFIG_DEBUG_STACK_USAGE
5085 free = stack_not_used(p);
5087 printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free,
5088 task_pid_nr(p), task_pid_nr(p->real_parent),
5089 (unsigned long)task_thread_info(p)->flags);
5091 show_stack(p, NULL);
5094 void show_state_filter(unsigned long state_filter)
5096 struct task_struct *g, *p;
5098 #if BITS_PER_LONG == 32
5100 " task PC stack pid father\n");
5103 " task PC stack pid father\n");
5105 read_lock(&tasklist_lock);
5106 do_each_thread(g, p) {
5108 * reset the NMI-timeout, listing all files on a slow
5109 * console might take alot of time:
5111 touch_nmi_watchdog();
5112 if (!state_filter || (p->state & state_filter))
5114 } while_each_thread(g, p);
5116 touch_all_softlockup_watchdogs();
5118 #ifdef CONFIG_SCHED_DEBUG
5119 sysrq_sched_debug_show();
5121 read_unlock(&tasklist_lock);
5123 * Only show locks if all tasks are dumped:
5126 debug_show_all_locks();
5129 void __cpuinit init_idle_bootup_task(struct task_struct *idle)
5131 idle->sched_class = &idle_sched_class;
5135 * init_idle - set up an idle thread for a given CPU
5136 * @idle: task in question
5137 * @cpu: cpu the idle task belongs to
5139 * NOTE: this function does not set the idle thread's NEED_RESCHED
5140 * flag, to make booting more robust.
5142 void __cpuinit init_idle(struct task_struct *idle, int cpu)
5144 struct rq *rq = cpu_rq(cpu);
5145 unsigned long flags;
5147 raw_spin_lock_irqsave(&rq->lock, flags);
5150 idle->state = TASK_RUNNING;
5151 idle->se.exec_start = sched_clock();
5153 cpumask_copy(&idle->cpus_allowed, cpumask_of(cpu));
5154 __set_task_cpu(idle, cpu);
5156 rq->curr = rq->idle = idle;
5157 #if defined(CONFIG_SMP) && defined(__ARCH_WANT_UNLOCKED_CTXSW)
5160 raw_spin_unlock_irqrestore(&rq->lock, flags);
5162 /* Set the preempt count _outside_ the spinlocks! */
5163 #if defined(CONFIG_PREEMPT)
5164 task_thread_info(idle)->preempt_count = (idle->lock_depth >= 0);
5166 task_thread_info(idle)->preempt_count = 0;
5169 * The idle tasks have their own, simple scheduling class:
5171 idle->sched_class = &idle_sched_class;
5172 ftrace_graph_init_task(idle);
5176 * In a system that switches off the HZ timer nohz_cpu_mask
5177 * indicates which cpus entered this state. This is used
5178 * in the rcu update to wait only for active cpus. For system
5179 * which do not switch off the HZ timer nohz_cpu_mask should
5180 * always be CPU_BITS_NONE.
5182 cpumask_var_t nohz_cpu_mask;
5185 * Increase the granularity value when there are more CPUs,
5186 * because with more CPUs the 'effective latency' as visible
5187 * to users decreases. But the relationship is not linear,
5188 * so pick a second-best guess by going with the log2 of the
5191 * This idea comes from the SD scheduler of Con Kolivas:
5193 static int get_update_sysctl_factor(void)
5195 unsigned int cpus = min_t(int, num_online_cpus(), 8);
5196 unsigned int factor;
5198 switch (sysctl_sched_tunable_scaling) {
5199 case SCHED_TUNABLESCALING_NONE:
5202 case SCHED_TUNABLESCALING_LINEAR:
5205 case SCHED_TUNABLESCALING_LOG:
5207 factor = 1 + ilog2(cpus);
5214 static void update_sysctl(void)
5216 unsigned int factor = get_update_sysctl_factor();
5218 #define SET_SYSCTL(name) \
5219 (sysctl_##name = (factor) * normalized_sysctl_##name)
5220 SET_SYSCTL(sched_min_granularity);
5221 SET_SYSCTL(sched_latency);
5222 SET_SYSCTL(sched_wakeup_granularity);
5223 SET_SYSCTL(sched_shares_ratelimit);
5227 static inline void sched_init_granularity(void)
5234 * This is how migration works:
5236 * 1) we queue a struct migration_req structure in the source CPU's
5237 * runqueue and wake up that CPU's migration thread.
5238 * 2) we down() the locked semaphore => thread blocks.
5239 * 3) migration thread wakes up (implicitly it forces the migrated
5240 * thread off the CPU)
5241 * 4) it gets the migration request and checks whether the migrated
5242 * task is still in the wrong runqueue.
5243 * 5) if it's in the wrong runqueue then the migration thread removes
5244 * it and puts it into the right queue.
5245 * 6) migration thread up()s the semaphore.
5246 * 7) we wake up and the migration is done.
5250 * Change a given task's CPU affinity. Migrate the thread to a
5251 * proper CPU and schedule it away if the CPU it's executing on
5252 * is removed from the allowed bitmask.
5254 * NOTE: the caller must have a valid reference to the task, the
5255 * task must not exit() & deallocate itself prematurely. The
5256 * call is not atomic; no spinlocks may be held.
5258 int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask)
5260 struct migration_req req;
5261 unsigned long flags;
5266 * Serialize against TASK_WAKING so that ttwu() and wunt() can
5267 * drop the rq->lock and still rely on ->cpus_allowed.
5270 while (task_is_waking(p))
5272 rq = task_rq_lock(p, &flags);
5273 if (task_is_waking(p)) {
5274 task_rq_unlock(rq, &flags);
5278 if (!cpumask_intersects(new_mask, cpu_active_mask)) {
5283 if (unlikely((p->flags & PF_THREAD_BOUND) && p != current &&
5284 !cpumask_equal(&p->cpus_allowed, new_mask))) {
5289 if (p->sched_class->set_cpus_allowed)
5290 p->sched_class->set_cpus_allowed(p, new_mask);
5292 cpumask_copy(&p->cpus_allowed, new_mask);
5293 p->rt.nr_cpus_allowed = cpumask_weight(new_mask);
5296 /* Can the task run on the task's current CPU? If so, we're done */
5297 if (cpumask_test_cpu(task_cpu(p), new_mask))
5300 if (migrate_task(p, cpumask_any_and(cpu_active_mask, new_mask), &req)) {
5301 /* Need help from migration thread: drop lock and wait. */
5302 struct task_struct *mt = rq->migration_thread;
5304 get_task_struct(mt);
5305 task_rq_unlock(rq, &flags);
5306 wake_up_process(rq->migration_thread);
5307 put_task_struct(mt);
5308 wait_for_completion(&req.done);
5309 tlb_migrate_finish(p->mm);
5313 task_rq_unlock(rq, &flags);
5317 EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr);
5320 * Move (not current) task off this cpu, onto dest cpu. We're doing
5321 * this because either it can't run here any more (set_cpus_allowed()
5322 * away from this CPU, or CPU going down), or because we're
5323 * attempting to rebalance this task on exec (sched_exec).
5325 * So we race with normal scheduler movements, but that's OK, as long
5326 * as the task is no longer on this CPU.
5328 * Returns non-zero if task was successfully migrated.
5330 static int __migrate_task(struct task_struct *p, int src_cpu, int dest_cpu)
5332 struct rq *rq_dest, *rq_src;
5335 if (unlikely(!cpu_active(dest_cpu)))
5338 rq_src = cpu_rq(src_cpu);
5339 rq_dest = cpu_rq(dest_cpu);
5341 double_rq_lock(rq_src, rq_dest);
5342 /* Already moved. */
5343 if (task_cpu(p) != src_cpu)
5345 /* Affinity changed (again). */
5346 if (!cpumask_test_cpu(dest_cpu, &p->cpus_allowed))
5350 * If we're not on a rq, the next wake-up will ensure we're
5354 deactivate_task(rq_src, p, 0);
5355 set_task_cpu(p, dest_cpu);
5356 activate_task(rq_dest, p, 0);
5357 check_preempt_curr(rq_dest, p, 0);
5362 double_rq_unlock(rq_src, rq_dest);
5366 #define RCU_MIGRATION_IDLE 0
5367 #define RCU_MIGRATION_NEED_QS 1
5368 #define RCU_MIGRATION_GOT_QS 2
5369 #define RCU_MIGRATION_MUST_SYNC 3
5372 * migration_thread - this is a highprio system thread that performs
5373 * thread migration by bumping thread off CPU then 'pushing' onto
5376 static int migration_thread(void *data)
5379 int cpu = (long)data;
5383 BUG_ON(rq->migration_thread != current);
5385 set_current_state(TASK_INTERRUPTIBLE);
5386 while (!kthread_should_stop()) {
5387 struct migration_req *req;
5388 struct list_head *head;
5390 raw_spin_lock_irq(&rq->lock);
5392 if (cpu_is_offline(cpu)) {
5393 raw_spin_unlock_irq(&rq->lock);
5397 if (rq->active_balance) {
5398 active_load_balance(rq, cpu);
5399 rq->active_balance = 0;
5402 head = &rq->migration_queue;
5404 if (list_empty(head)) {
5405 raw_spin_unlock_irq(&rq->lock);
5407 set_current_state(TASK_INTERRUPTIBLE);
5410 req = list_entry(head->next, struct migration_req, list);
5411 list_del_init(head->next);
5413 if (req->task != NULL) {
5414 raw_spin_unlock(&rq->lock);
5415 __migrate_task(req->task, cpu, req->dest_cpu);
5416 } else if (likely(cpu == (badcpu = smp_processor_id()))) {
5417 req->dest_cpu = RCU_MIGRATION_GOT_QS;
5418 raw_spin_unlock(&rq->lock);
5420 req->dest_cpu = RCU_MIGRATION_MUST_SYNC;
5421 raw_spin_unlock(&rq->lock);
5422 WARN_ONCE(1, "migration_thread() on CPU %d, expected %d\n", badcpu, cpu);
5426 complete(&req->done);
5428 __set_current_state(TASK_RUNNING);
5433 #ifdef CONFIG_HOTPLUG_CPU
5435 * Figure out where task on dead CPU should go, use force if necessary.
5437 void move_task_off_dead_cpu(int dead_cpu, struct task_struct *p)
5439 struct rq *rq = cpu_rq(dead_cpu);
5440 int needs_cpu, uninitialized_var(dest_cpu);
5441 unsigned long flags;
5443 local_irq_save(flags);
5445 raw_spin_lock(&rq->lock);
5446 needs_cpu = (task_cpu(p) == dead_cpu) && (p->state != TASK_WAKING);
5448 dest_cpu = select_fallback_rq(dead_cpu, p);
5449 raw_spin_unlock(&rq->lock);
5451 * It can only fail if we race with set_cpus_allowed(),
5452 * in the racer should migrate the task anyway.
5455 __migrate_task(p, dead_cpu, dest_cpu);
5456 local_irq_restore(flags);
5460 * While a dead CPU has no uninterruptible tasks queued at this point,
5461 * it might still have a nonzero ->nr_uninterruptible counter, because
5462 * for performance reasons the counter is not stricly tracking tasks to
5463 * their home CPUs. So we just add the counter to another CPU's counter,
5464 * to keep the global sum constant after CPU-down:
5466 static void migrate_nr_uninterruptible(struct rq *rq_src)
5468 struct rq *rq_dest = cpu_rq(cpumask_any(cpu_active_mask));
5469 unsigned long flags;
5471 local_irq_save(flags);
5472 double_rq_lock(rq_src, rq_dest);
5473 rq_dest->nr_uninterruptible += rq_src->nr_uninterruptible;
5474 rq_src->nr_uninterruptible = 0;
5475 double_rq_unlock(rq_src, rq_dest);
5476 local_irq_restore(flags);
5479 /* Run through task list and migrate tasks from the dead cpu. */
5480 static void migrate_live_tasks(int src_cpu)
5482 struct task_struct *p, *t;
5484 read_lock(&tasklist_lock);
5486 do_each_thread(t, p) {
5490 if (task_cpu(p) == src_cpu)
5491 move_task_off_dead_cpu(src_cpu, p);
5492 } while_each_thread(t, p);
5494 read_unlock(&tasklist_lock);
5498 * Schedules idle task to be the next runnable task on current CPU.
5499 * It does so by boosting its priority to highest possible.
5500 * Used by CPU offline code.
5502 void sched_idle_next(void)
5504 int this_cpu = smp_processor_id();
5505 struct rq *rq = cpu_rq(this_cpu);
5506 struct task_struct *p = rq->idle;
5507 unsigned long flags;
5509 /* cpu has to be offline */
5510 BUG_ON(cpu_online(this_cpu));
5513 * Strictly not necessary since rest of the CPUs are stopped by now
5514 * and interrupts disabled on the current cpu.
5516 raw_spin_lock_irqsave(&rq->lock, flags);
5518 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
5520 activate_task(rq, p, 0);
5522 raw_spin_unlock_irqrestore(&rq->lock, flags);
5526 * Ensures that the idle task is using init_mm right before its cpu goes
5529 void idle_task_exit(void)
5531 struct mm_struct *mm = current->active_mm;
5533 BUG_ON(cpu_online(smp_processor_id()));
5536 switch_mm(mm, &init_mm, current);
5540 /* called under rq->lock with disabled interrupts */
5541 static void migrate_dead(unsigned int dead_cpu, struct task_struct *p)
5543 struct rq *rq = cpu_rq(dead_cpu);
5545 /* Must be exiting, otherwise would be on tasklist. */
5546 BUG_ON(!p->exit_state);
5548 /* Cannot have done final schedule yet: would have vanished. */
5549 BUG_ON(p->state == TASK_DEAD);
5554 * Drop lock around migration; if someone else moves it,
5555 * that's OK. No task can be added to this CPU, so iteration is
5558 raw_spin_unlock_irq(&rq->lock);
5559 move_task_off_dead_cpu(dead_cpu, p);
5560 raw_spin_lock_irq(&rq->lock);
5565 /* release_task() removes task from tasklist, so we won't find dead tasks. */
5566 static void migrate_dead_tasks(unsigned int dead_cpu)
5568 struct rq *rq = cpu_rq(dead_cpu);
5569 struct task_struct *next;
5572 if (!rq->nr_running)
5574 next = pick_next_task(rq);
5577 next->sched_class->put_prev_task(rq, next);
5578 migrate_dead(dead_cpu, next);
5584 * remove the tasks which were accounted by rq from calc_load_tasks.
5586 static void calc_global_load_remove(struct rq *rq)
5588 atomic_long_sub(rq->calc_load_active, &calc_load_tasks);
5589 rq->calc_load_active = 0;
5591 #endif /* CONFIG_HOTPLUG_CPU */
5593 #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_SYSCTL)
5595 static struct ctl_table sd_ctl_dir[] = {
5597 .procname = "sched_domain",
5603 static struct ctl_table sd_ctl_root[] = {
5605 .procname = "kernel",
5607 .child = sd_ctl_dir,
5612 static struct ctl_table *sd_alloc_ctl_entry(int n)
5614 struct ctl_table *entry =
5615 kcalloc(n, sizeof(struct ctl_table), GFP_KERNEL);
5620 static void sd_free_ctl_entry(struct ctl_table **tablep)
5622 struct ctl_table *entry;
5625 * In the intermediate directories, both the child directory and
5626 * procname are dynamically allocated and could fail but the mode
5627 * will always be set. In the lowest directory the names are
5628 * static strings and all have proc handlers.
5630 for (entry = *tablep; entry->mode; entry++) {
5632 sd_free_ctl_entry(&entry->child);
5633 if (entry->proc_handler == NULL)
5634 kfree(entry->procname);
5642 set_table_entry(struct ctl_table *entry,
5643 const char *procname, void *data, int maxlen,
5644 mode_t mode, proc_handler *proc_handler)
5646 entry->procname = procname;
5648 entry->maxlen = maxlen;
5650 entry->proc_handler = proc_handler;
5653 static struct ctl_table *
5654 sd_alloc_ctl_domain_table(struct sched_domain *sd)
5656 struct ctl_table *table = sd_alloc_ctl_entry(13);
5661 set_table_entry(&table[0], "min_interval", &sd->min_interval,
5662 sizeof(long), 0644, proc_doulongvec_minmax);
5663 set_table_entry(&table[1], "max_interval", &sd->max_interval,
5664 sizeof(long), 0644, proc_doulongvec_minmax);
5665 set_table_entry(&table[2], "busy_idx", &sd->busy_idx,
5666 sizeof(int), 0644, proc_dointvec_minmax);
5667 set_table_entry(&table[3], "idle_idx", &sd->idle_idx,
5668 sizeof(int), 0644, proc_dointvec_minmax);
5669 set_table_entry(&table[4], "newidle_idx", &sd->newidle_idx,
5670 sizeof(int), 0644, proc_dointvec_minmax);
5671 set_table_entry(&table[5], "wake_idx", &sd->wake_idx,
5672 sizeof(int), 0644, proc_dointvec_minmax);
5673 set_table_entry(&table[6], "forkexec_idx", &sd->forkexec_idx,
5674 sizeof(int), 0644, proc_dointvec_minmax);
5675 set_table_entry(&table[7], "busy_factor", &sd->busy_factor,
5676 sizeof(int), 0644, proc_dointvec_minmax);
5677 set_table_entry(&table[8], "imbalance_pct", &sd->imbalance_pct,
5678 sizeof(int), 0644, proc_dointvec_minmax);
5679 set_table_entry(&table[9], "cache_nice_tries",
5680 &sd->cache_nice_tries,
5681 sizeof(int), 0644, proc_dointvec_minmax);
5682 set_table_entry(&table[10], "flags", &sd->flags,
5683 sizeof(int), 0644, proc_dointvec_minmax);
5684 set_table_entry(&table[11], "name", sd->name,
5685 CORENAME_MAX_SIZE, 0444, proc_dostring);
5686 /* &table[12] is terminator */
5691 static ctl_table *sd_alloc_ctl_cpu_table(int cpu)
5693 struct ctl_table *entry, *table;
5694 struct sched_domain *sd;
5695 int domain_num = 0, i;
5698 for_each_domain(cpu, sd)
5700 entry = table = sd_alloc_ctl_entry(domain_num + 1);
5705 for_each_domain(cpu, sd) {
5706 snprintf(buf, 32, "domain%d", i);
5707 entry->procname = kstrdup(buf, GFP_KERNEL);
5709 entry->child = sd_alloc_ctl_domain_table(sd);
5716 static struct ctl_table_header *sd_sysctl_header;
5717 static void register_sched_domain_sysctl(void)
5719 int i, cpu_num = num_possible_cpus();
5720 struct ctl_table *entry = sd_alloc_ctl_entry(cpu_num + 1);
5723 WARN_ON(sd_ctl_dir[0].child);
5724 sd_ctl_dir[0].child = entry;
5729 for_each_possible_cpu(i) {
5730 snprintf(buf, 32, "cpu%d", i);
5731 entry->procname = kstrdup(buf, GFP_KERNEL);
5733 entry->child = sd_alloc_ctl_cpu_table(i);
5737 WARN_ON(sd_sysctl_header);
5738 sd_sysctl_header = register_sysctl_table(sd_ctl_root);
5741 /* may be called multiple times per register */
5742 static void unregister_sched_domain_sysctl(void)
5744 if (sd_sysctl_header)
5745 unregister_sysctl_table(sd_sysctl_header);
5746 sd_sysctl_header = NULL;
5747 if (sd_ctl_dir[0].child)
5748 sd_free_ctl_entry(&sd_ctl_dir[0].child);
5751 static void register_sched_domain_sysctl(void)
5754 static void unregister_sched_domain_sysctl(void)
5759 static void set_rq_online(struct rq *rq)
5762 const struct sched_class *class;
5764 cpumask_set_cpu(rq->cpu, rq->rd->online);
5767 for_each_class(class) {
5768 if (class->rq_online)
5769 class->rq_online(rq);
5774 static void set_rq_offline(struct rq *rq)
5777 const struct sched_class *class;
5779 for_each_class(class) {
5780 if (class->rq_offline)
5781 class->rq_offline(rq);
5784 cpumask_clear_cpu(rq->cpu, rq->rd->online);
5790 * migration_call - callback that gets triggered when a CPU is added.
5791 * Here we can start up the necessary migration thread for the new CPU.
5793 static int __cpuinit
5794 migration_call(struct notifier_block *nfb, unsigned long action, void *hcpu)
5796 struct task_struct *p;
5797 int cpu = (long)hcpu;
5798 unsigned long flags;
5803 case CPU_UP_PREPARE:
5804 case CPU_UP_PREPARE_FROZEN:
5805 p = kthread_create(migration_thread, hcpu, "migration/%d", cpu);
5808 kthread_bind(p, cpu);
5809 /* Must be high prio: stop_machine expects to yield to it. */
5810 rq = task_rq_lock(p, &flags);
5811 __setscheduler(rq, p, SCHED_FIFO, MAX_RT_PRIO-1);
5812 task_rq_unlock(rq, &flags);
5814 cpu_rq(cpu)->migration_thread = p;
5815 rq->calc_load_update = calc_load_update;
5819 case CPU_ONLINE_FROZEN:
5820 /* Strictly unnecessary, as first user will wake it. */
5821 wake_up_process(cpu_rq(cpu)->migration_thread);
5823 /* Update our root-domain */
5825 raw_spin_lock_irqsave(&rq->lock, flags);
5827 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5831 raw_spin_unlock_irqrestore(&rq->lock, flags);
5834 #ifdef CONFIG_HOTPLUG_CPU
5835 case CPU_UP_CANCELED:
5836 case CPU_UP_CANCELED_FROZEN:
5837 if (!cpu_rq(cpu)->migration_thread)
5839 /* Unbind it from offline cpu so it can run. Fall thru. */
5840 kthread_bind(cpu_rq(cpu)->migration_thread,
5841 cpumask_any(cpu_online_mask));
5842 kthread_stop(cpu_rq(cpu)->migration_thread);
5843 put_task_struct(cpu_rq(cpu)->migration_thread);
5844 cpu_rq(cpu)->migration_thread = NULL;
5848 case CPU_DEAD_FROZEN:
5849 migrate_live_tasks(cpu);
5851 kthread_stop(rq->migration_thread);
5852 put_task_struct(rq->migration_thread);
5853 rq->migration_thread = NULL;
5854 /* Idle task back to normal (off runqueue, low prio) */
5855 raw_spin_lock_irq(&rq->lock);
5856 deactivate_task(rq, rq->idle, 0);
5857 __setscheduler(rq, rq->idle, SCHED_NORMAL, 0);
5858 rq->idle->sched_class = &idle_sched_class;
5859 migrate_dead_tasks(cpu);
5860 raw_spin_unlock_irq(&rq->lock);
5861 migrate_nr_uninterruptible(rq);
5862 BUG_ON(rq->nr_running != 0);
5863 calc_global_load_remove(rq);
5865 * No need to migrate the tasks: it was best-effort if
5866 * they didn't take sched_hotcpu_mutex. Just wake up
5869 raw_spin_lock_irq(&rq->lock);
5870 while (!list_empty(&rq->migration_queue)) {
5871 struct migration_req *req;
5873 req = list_entry(rq->migration_queue.next,
5874 struct migration_req, list);
5875 list_del_init(&req->list);
5876 raw_spin_unlock_irq(&rq->lock);
5877 complete(&req->done);
5878 raw_spin_lock_irq(&rq->lock);
5880 raw_spin_unlock_irq(&rq->lock);
5884 case CPU_DYING_FROZEN:
5885 /* Update our root-domain */
5887 raw_spin_lock_irqsave(&rq->lock, flags);
5889 BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span));
5892 raw_spin_unlock_irqrestore(&rq->lock, flags);
5900 * Register at high priority so that task migration (migrate_all_tasks)
5901 * happens before everything else. This has to be lower priority than
5902 * the notifier in the perf_event subsystem, though.
5904 static struct notifier_block __cpuinitdata migration_notifier = {
5905 .notifier_call = migration_call,
5909 static int __init migration_init(void)
5911 void *cpu = (void *)(long)smp_processor_id();
5914 /* Start one for the boot CPU: */
5915 err = migration_call(&migration_notifier, CPU_UP_PREPARE, cpu);
5916 BUG_ON(err == NOTIFY_BAD);
5917 migration_call(&migration_notifier, CPU_ONLINE, cpu);
5918 register_cpu_notifier(&migration_notifier);
5922 early_initcall(migration_init);
5927 #ifdef CONFIG_SCHED_DEBUG
5929 static __read_mostly int sched_domain_debug_enabled;
5931 static int __init sched_domain_debug_setup(char *str)
5933 sched_domain_debug_enabled = 1;
5937 early_param("sched_debug", sched_domain_debug_setup);
5939 static int sched_domain_debug_one(struct sched_domain *sd, int cpu, int level,
5940 struct cpumask *groupmask)
5942 struct sched_group *group = sd->groups;
5945 cpulist_scnprintf(str, sizeof(str), sched_domain_span(sd));
5946 cpumask_clear(groupmask);
5948 printk(KERN_DEBUG "%*s domain %d: ", level, "", level);
5950 if (!(sd->flags & SD_LOAD_BALANCE)) {
5951 printk("does not load-balance\n");
5953 printk(KERN_ERR "ERROR: !SD_LOAD_BALANCE domain"
5958 printk(KERN_CONT "span %s level %s\n", str, sd->name);
5960 if (!cpumask_test_cpu(cpu, sched_domain_span(sd))) {
5961 printk(KERN_ERR "ERROR: domain->span does not contain "
5964 if (!cpumask_test_cpu(cpu, sched_group_cpus(group))) {
5965 printk(KERN_ERR "ERROR: domain->groups does not contain"
5969 printk(KERN_DEBUG "%*s groups:", level + 1, "");
5973 printk(KERN_ERR "ERROR: group is NULL\n");
5977 if (!group->cpu_power) {
5978 printk(KERN_CONT "\n");
5979 printk(KERN_ERR "ERROR: domain->cpu_power not "
5984 if (!cpumask_weight(sched_group_cpus(group))) {
5985 printk(KERN_CONT "\n");
5986 printk(KERN_ERR "ERROR: empty group\n");
5990 if (cpumask_intersects(groupmask, sched_group_cpus(group))) {
5991 printk(KERN_CONT "\n");
5992 printk(KERN_ERR "ERROR: repeated CPUs\n");
5996 cpumask_or(groupmask, groupmask, sched_group_cpus(group));
5998 cpulist_scnprintf(str, sizeof(str), sched_group_cpus(group));
6000 printk(KERN_CONT " %s", str);
6001 if (group->cpu_power != SCHED_LOAD_SCALE) {
6002 printk(KERN_CONT " (cpu_power = %d)",
6006 group = group->next;
6007 } while (group != sd->groups);
6008 printk(KERN_CONT "\n");
6010 if (!cpumask_equal(sched_domain_span(sd), groupmask))
6011 printk(KERN_ERR "ERROR: groups don't span domain->span\n");
6014 !cpumask_subset(groupmask, sched_domain_span(sd->parent)))
6015 printk(KERN_ERR "ERROR: parent span is not a superset "
6016 "of domain->span\n");
6020 static void sched_domain_debug(struct sched_domain *sd, int cpu)
6022 cpumask_var_t groupmask;
6025 if (!sched_domain_debug_enabled)
6029 printk(KERN_DEBUG "CPU%d attaching NULL sched-domain.\n", cpu);
6033 printk(KERN_DEBUG "CPU%d attaching sched-domain:\n", cpu);
6035 if (!alloc_cpumask_var(&groupmask, GFP_KERNEL)) {
6036 printk(KERN_DEBUG "Cannot load-balance (out of memory)\n");
6041 if (sched_domain_debug_one(sd, cpu, level, groupmask))
6048 free_cpumask_var(groupmask);
6050 #else /* !CONFIG_SCHED_DEBUG */
6051 # define sched_domain_debug(sd, cpu) do { } while (0)
6052 #endif /* CONFIG_SCHED_DEBUG */
6054 static int sd_degenerate(struct sched_domain *sd)
6056 if (cpumask_weight(sched_domain_span(sd)) == 1)
6059 /* Following flags need at least 2 groups */
6060 if (sd->flags & (SD_LOAD_BALANCE |
6061 SD_BALANCE_NEWIDLE |
6065 SD_SHARE_PKG_RESOURCES)) {
6066 if (sd->groups != sd->groups->next)
6070 /* Following flags don't use groups */
6071 if (sd->flags & (SD_WAKE_AFFINE))
6078 sd_parent_degenerate(struct sched_domain *sd, struct sched_domain *parent)
6080 unsigned long cflags = sd->flags, pflags = parent->flags;
6082 if (sd_degenerate(parent))
6085 if (!cpumask_equal(sched_domain_span(sd), sched_domain_span(parent)))
6088 /* Flags needing groups don't count if only 1 group in parent */
6089 if (parent->groups == parent->groups->next) {
6090 pflags &= ~(SD_LOAD_BALANCE |
6091 SD_BALANCE_NEWIDLE |
6095 SD_SHARE_PKG_RESOURCES);
6096 if (nr_node_ids == 1)
6097 pflags &= ~SD_SERIALIZE;
6099 if (~cflags & pflags)
6105 static void free_rootdomain(struct root_domain *rd)
6107 synchronize_sched();
6109 cpupri_cleanup(&rd->cpupri);
6111 free_cpumask_var(rd->rto_mask);
6112 free_cpumask_var(rd->online);
6113 free_cpumask_var(rd->span);
6117 static void rq_attach_root(struct rq *rq, struct root_domain *rd)
6119 struct root_domain *old_rd = NULL;
6120 unsigned long flags;
6122 raw_spin_lock_irqsave(&rq->lock, flags);
6127 if (cpumask_test_cpu(rq->cpu, old_rd->online))
6130 cpumask_clear_cpu(rq->cpu, old_rd->span);
6133 * If we dont want to free the old_rt yet then
6134 * set old_rd to NULL to skip the freeing later
6137 if (!atomic_dec_and_test(&old_rd->refcount))
6141 atomic_inc(&rd->refcount);
6144 cpumask_set_cpu(rq->cpu, rd->span);
6145 if (cpumask_test_cpu(rq->cpu, cpu_active_mask))
6148 raw_spin_unlock_irqrestore(&rq->lock, flags);
6151 free_rootdomain(old_rd);
6154 static int init_rootdomain(struct root_domain *rd, bool bootmem)
6156 gfp_t gfp = GFP_KERNEL;
6158 memset(rd, 0, sizeof(*rd));
6163 if (!alloc_cpumask_var(&rd->span, gfp))
6165 if (!alloc_cpumask_var(&rd->online, gfp))
6167 if (!alloc_cpumask_var(&rd->rto_mask, gfp))
6170 if (cpupri_init(&rd->cpupri, bootmem) != 0)
6175 free_cpumask_var(rd->rto_mask);
6177 free_cpumask_var(rd->online);
6179 free_cpumask_var(rd->span);
6184 static void init_defrootdomain(void)
6186 init_rootdomain(&def_root_domain, true);
6188 atomic_set(&def_root_domain.refcount, 1);
6191 static struct root_domain *alloc_rootdomain(void)
6193 struct root_domain *rd;
6195 rd = kmalloc(sizeof(*rd), GFP_KERNEL);
6199 if (init_rootdomain(rd, false) != 0) {
6208 * Attach the domain 'sd' to 'cpu' as its base domain. Callers must
6209 * hold the hotplug lock.
6212 cpu_attach_domain(struct sched_domain *sd, struct root_domain *rd, int cpu)
6214 struct rq *rq = cpu_rq(cpu);
6215 struct sched_domain *tmp;
6217 /* Remove the sched domains which do not contribute to scheduling. */
6218 for (tmp = sd; tmp; ) {
6219 struct sched_domain *parent = tmp->parent;
6223 if (sd_parent_degenerate(tmp, parent)) {
6224 tmp->parent = parent->parent;
6226 parent->parent->child = tmp;
6231 if (sd && sd_degenerate(sd)) {
6237 sched_domain_debug(sd, cpu);
6239 rq_attach_root(rq, rd);
6240 rcu_assign_pointer(rq->sd, sd);
6243 /* cpus with isolated domains */
6244 static cpumask_var_t cpu_isolated_map;
6246 /* Setup the mask of cpus configured for isolated domains */
6247 static int __init isolated_cpu_setup(char *str)
6249 alloc_bootmem_cpumask_var(&cpu_isolated_map);
6250 cpulist_parse(str, cpu_isolated_map);
6254 __setup("isolcpus=", isolated_cpu_setup);
6257 * init_sched_build_groups takes the cpumask we wish to span, and a pointer
6258 * to a function which identifies what group(along with sched group) a CPU
6259 * belongs to. The return value of group_fn must be a >= 0 and < nr_cpu_ids
6260 * (due to the fact that we keep track of groups covered with a struct cpumask).
6262 * init_sched_build_groups will build a circular linked list of the groups
6263 * covered by the given span, and will set each group's ->cpumask correctly,
6264 * and ->cpu_power to 0.
6267 init_sched_build_groups(const struct cpumask *span,
6268 const struct cpumask *cpu_map,
6269 int (*group_fn)(int cpu, const struct cpumask *cpu_map,
6270 struct sched_group **sg,
6271 struct cpumask *tmpmask),
6272 struct cpumask *covered, struct cpumask *tmpmask)
6274 struct sched_group *first = NULL, *last = NULL;
6277 cpumask_clear(covered);
6279 for_each_cpu(i, span) {
6280 struct sched_group *sg;
6281 int group = group_fn(i, cpu_map, &sg, tmpmask);
6284 if (cpumask_test_cpu(i, covered))
6287 cpumask_clear(sched_group_cpus(sg));
6290 for_each_cpu(j, span) {
6291 if (group_fn(j, cpu_map, NULL, tmpmask) != group)
6294 cpumask_set_cpu(j, covered);
6295 cpumask_set_cpu(j, sched_group_cpus(sg));
6306 #define SD_NODES_PER_DOMAIN 16
6311 * find_next_best_node - find the next node to include in a sched_domain
6312 * @node: node whose sched_domain we're building
6313 * @used_nodes: nodes already in the sched_domain
6315 * Find the next node to include in a given scheduling domain. Simply
6316 * finds the closest node not already in the @used_nodes map.
6318 * Should use nodemask_t.
6320 static int find_next_best_node(int node, nodemask_t *used_nodes)
6322 int i, n, val, min_val, best_node = 0;
6326 for (i = 0; i < nr_node_ids; i++) {
6327 /* Start at @node */
6328 n = (node + i) % nr_node_ids;
6330 if (!nr_cpus_node(n))
6333 /* Skip already used nodes */
6334 if (node_isset(n, *used_nodes))
6337 /* Simple min distance search */
6338 val = node_distance(node, n);
6340 if (val < min_val) {
6346 node_set(best_node, *used_nodes);
6351 * sched_domain_node_span - get a cpumask for a node's sched_domain
6352 * @node: node whose cpumask we're constructing
6353 * @span: resulting cpumask
6355 * Given a node, construct a good cpumask for its sched_domain to span. It
6356 * should be one that prevents unnecessary balancing, but also spreads tasks
6359 static void sched_domain_node_span(int node, struct cpumask *span)
6361 nodemask_t used_nodes;
6364 cpumask_clear(span);
6365 nodes_clear(used_nodes);
6367 cpumask_or(span, span, cpumask_of_node(node));
6368 node_set(node, used_nodes);
6370 for (i = 1; i < SD_NODES_PER_DOMAIN; i++) {
6371 int next_node = find_next_best_node(node, &used_nodes);
6373 cpumask_or(span, span, cpumask_of_node(next_node));
6376 #endif /* CONFIG_NUMA */
6378 int sched_smt_power_savings = 0, sched_mc_power_savings = 0;
6381 * The cpus mask in sched_group and sched_domain hangs off the end.
6383 * ( See the the comments in include/linux/sched.h:struct sched_group
6384 * and struct sched_domain. )
6386 struct static_sched_group {
6387 struct sched_group sg;
6388 DECLARE_BITMAP(cpus, CONFIG_NR_CPUS);
6391 struct static_sched_domain {
6392 struct sched_domain sd;
6393 DECLARE_BITMAP(span, CONFIG_NR_CPUS);
6399 cpumask_var_t domainspan;
6400 cpumask_var_t covered;
6401 cpumask_var_t notcovered;
6403 cpumask_var_t nodemask;
6404 cpumask_var_t this_sibling_map;
6405 cpumask_var_t this_core_map;
6406 cpumask_var_t send_covered;
6407 cpumask_var_t tmpmask;
6408 struct sched_group **sched_group_nodes;
6409 struct root_domain *rd;
6413 sa_sched_groups = 0,
6418 sa_this_sibling_map,
6420 sa_sched_group_nodes,
6430 * SMT sched-domains:
6432 #ifdef CONFIG_SCHED_SMT
6433 static DEFINE_PER_CPU(struct static_sched_domain, cpu_domains);
6434 static DEFINE_PER_CPU(struct static_sched_group, sched_groups);
6437 cpu_to_cpu_group(int cpu, const struct cpumask *cpu_map,
6438 struct sched_group **sg, struct cpumask *unused)
6441 *sg = &per_cpu(sched_groups, cpu).sg;
6444 #endif /* CONFIG_SCHED_SMT */
6447 * multi-core sched-domains:
6449 #ifdef CONFIG_SCHED_MC
6450 static DEFINE_PER_CPU(struct static_sched_domain, core_domains);
6451 static DEFINE_PER_CPU(struct static_sched_group, sched_group_core);
6452 #endif /* CONFIG_SCHED_MC */
6454 #if defined(CONFIG_SCHED_MC) && defined(CONFIG_SCHED_SMT)
6456 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
6457 struct sched_group **sg, struct cpumask *mask)
6461 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
6462 group = cpumask_first(mask);
6464 *sg = &per_cpu(sched_group_core, group).sg;
6467 #elif defined(CONFIG_SCHED_MC)
6469 cpu_to_core_group(int cpu, const struct cpumask *cpu_map,
6470 struct sched_group **sg, struct cpumask *unused)
6473 *sg = &per_cpu(sched_group_core, cpu).sg;
6478 static DEFINE_PER_CPU(struct static_sched_domain, phys_domains);
6479 static DEFINE_PER_CPU(struct static_sched_group, sched_group_phys);
6482 cpu_to_phys_group(int cpu, const struct cpumask *cpu_map,
6483 struct sched_group **sg, struct cpumask *mask)
6486 #ifdef CONFIG_SCHED_MC
6487 cpumask_and(mask, cpu_coregroup_mask(cpu), cpu_map);
6488 group = cpumask_first(mask);
6489 #elif defined(CONFIG_SCHED_SMT)
6490 cpumask_and(mask, topology_thread_cpumask(cpu), cpu_map);
6491 group = cpumask_first(mask);
6496 *sg = &per_cpu(sched_group_phys, group).sg;
6502 * The init_sched_build_groups can't handle what we want to do with node
6503 * groups, so roll our own. Now each node has its own list of groups which
6504 * gets dynamically allocated.
6506 static DEFINE_PER_CPU(struct static_sched_domain, node_domains);
6507 static struct sched_group ***sched_group_nodes_bycpu;
6509 static DEFINE_PER_CPU(struct static_sched_domain, allnodes_domains);
6510 static DEFINE_PER_CPU(struct static_sched_group, sched_group_allnodes);
6512 static int cpu_to_allnodes_group(int cpu, const struct cpumask *cpu_map,
6513 struct sched_group **sg,
6514 struct cpumask *nodemask)
6518 cpumask_and(nodemask, cpumask_of_node(cpu_to_node(cpu)), cpu_map);
6519 group = cpumask_first(nodemask);
6522 *sg = &per_cpu(sched_group_allnodes, group).sg;
6526 static void init_numa_sched_groups_power(struct sched_group *group_head)
6528 struct sched_group *sg = group_head;
6534 for_each_cpu(j, sched_group_cpus(sg)) {
6535 struct sched_domain *sd;
6537 sd = &per_cpu(phys_domains, j).sd;
6538 if (j != group_first_cpu(sd->groups)) {
6540 * Only add "power" once for each
6546 sg->cpu_power += sd->groups->cpu_power;
6549 } while (sg != group_head);
6552 static int build_numa_sched_groups(struct s_data *d,
6553 const struct cpumask *cpu_map, int num)
6555 struct sched_domain *sd;
6556 struct sched_group *sg, *prev;
6559 cpumask_clear(d->covered);
6560 cpumask_and(d->nodemask, cpumask_of_node(num), cpu_map);
6561 if (cpumask_empty(d->nodemask)) {
6562 d->sched_group_nodes[num] = NULL;
6566 sched_domain_node_span(num, d->domainspan);
6567 cpumask_and(d->domainspan, d->domainspan, cpu_map);
6569 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
6572 printk(KERN_WARNING "Can not alloc domain group for node %d\n",
6576 d->sched_group_nodes[num] = sg;
6578 for_each_cpu(j, d->nodemask) {
6579 sd = &per_cpu(node_domains, j).sd;
6584 cpumask_copy(sched_group_cpus(sg), d->nodemask);
6586 cpumask_or(d->covered, d->covered, d->nodemask);
6589 for (j = 0; j < nr_node_ids; j++) {
6590 n = (num + j) % nr_node_ids;
6591 cpumask_complement(d->notcovered, d->covered);
6592 cpumask_and(d->tmpmask, d->notcovered, cpu_map);
6593 cpumask_and(d->tmpmask, d->tmpmask, d->domainspan);
6594 if (cpumask_empty(d->tmpmask))
6596 cpumask_and(d->tmpmask, d->tmpmask, cpumask_of_node(n));
6597 if (cpumask_empty(d->tmpmask))
6599 sg = kmalloc_node(sizeof(struct sched_group) + cpumask_size(),
6603 "Can not alloc domain group for node %d\n", j);
6607 cpumask_copy(sched_group_cpus(sg), d->tmpmask);
6608 sg->next = prev->next;
6609 cpumask_or(d->covered, d->covered, d->tmpmask);
6616 #endif /* CONFIG_NUMA */
6619 /* Free memory allocated for various sched_group structures */
6620 static void free_sched_groups(const struct cpumask *cpu_map,
6621 struct cpumask *nodemask)
6625 for_each_cpu(cpu, cpu_map) {
6626 struct sched_group **sched_group_nodes
6627 = sched_group_nodes_bycpu[cpu];
6629 if (!sched_group_nodes)
6632 for (i = 0; i < nr_node_ids; i++) {
6633 struct sched_group *oldsg, *sg = sched_group_nodes[i];
6635 cpumask_and(nodemask, cpumask_of_node(i), cpu_map);
6636 if (cpumask_empty(nodemask))
6646 if (oldsg != sched_group_nodes[i])
6649 kfree(sched_group_nodes);
6650 sched_group_nodes_bycpu[cpu] = NULL;
6653 #else /* !CONFIG_NUMA */
6654 static void free_sched_groups(const struct cpumask *cpu_map,
6655 struct cpumask *nodemask)
6658 #endif /* CONFIG_NUMA */
6661 * Initialize sched groups cpu_power.
6663 * cpu_power indicates the capacity of sched group, which is used while
6664 * distributing the load between different sched groups in a sched domain.
6665 * Typically cpu_power for all the groups in a sched domain will be same unless
6666 * there are asymmetries in the topology. If there are asymmetries, group
6667 * having more cpu_power will pickup more load compared to the group having
6670 static void init_sched_groups_power(int cpu, struct sched_domain *sd)
6672 struct sched_domain *child;
6673 struct sched_group *group;
6677 WARN_ON(!sd || !sd->groups);
6679 if (cpu != group_first_cpu(sd->groups))
6684 sd->groups->cpu_power = 0;
6687 power = SCHED_LOAD_SCALE;
6688 weight = cpumask_weight(sched_domain_span(sd));
6690 * SMT siblings share the power of a single core.
6691 * Usually multiple threads get a better yield out of
6692 * that one core than a single thread would have,
6693 * reflect that in sd->smt_gain.
6695 if ((sd->flags & SD_SHARE_CPUPOWER) && weight > 1) {
6696 power *= sd->smt_gain;
6698 power >>= SCHED_LOAD_SHIFT;
6700 sd->groups->cpu_power += power;
6705 * Add cpu_power of each child group to this groups cpu_power.
6707 group = child->groups;
6709 sd->groups->cpu_power += group->cpu_power;
6710 group = group->next;
6711 } while (group != child->groups);
6715 * Initializers for schedule domains
6716 * Non-inlined to reduce accumulated stack pressure in build_sched_domains()
6719 #ifdef CONFIG_SCHED_DEBUG
6720 # define SD_INIT_NAME(sd, type) sd->name = #type
6722 # define SD_INIT_NAME(sd, type) do { } while (0)
6725 #define SD_INIT(sd, type) sd_init_##type(sd)
6727 #define SD_INIT_FUNC(type) \
6728 static noinline void sd_init_##type(struct sched_domain *sd) \
6730 memset(sd, 0, sizeof(*sd)); \
6731 *sd = SD_##type##_INIT; \
6732 sd->level = SD_LV_##type; \
6733 SD_INIT_NAME(sd, type); \
6738 SD_INIT_FUNC(ALLNODES)
6741 #ifdef CONFIG_SCHED_SMT
6742 SD_INIT_FUNC(SIBLING)
6744 #ifdef CONFIG_SCHED_MC
6748 static int default_relax_domain_level = -1;
6750 static int __init setup_relax_domain_level(char *str)
6754 val = simple_strtoul(str, NULL, 0);
6755 if (val < SD_LV_MAX)
6756 default_relax_domain_level = val;
6760 __setup("relax_domain_level=", setup_relax_domain_level);
6762 static void set_domain_attribute(struct sched_domain *sd,
6763 struct sched_domain_attr *attr)
6767 if (!attr || attr->relax_domain_level < 0) {
6768 if (default_relax_domain_level < 0)
6771 request = default_relax_domain_level;
6773 request = attr->relax_domain_level;
6774 if (request < sd->level) {
6775 /* turn off idle balance on this domain */
6776 sd->flags &= ~(SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6778 /* turn on idle balance on this domain */
6779 sd->flags |= (SD_BALANCE_WAKE|SD_BALANCE_NEWIDLE);
6783 static void __free_domain_allocs(struct s_data *d, enum s_alloc what,
6784 const struct cpumask *cpu_map)
6787 case sa_sched_groups:
6788 free_sched_groups(cpu_map, d->tmpmask); /* fall through */
6789 d->sched_group_nodes = NULL;
6791 free_rootdomain(d->rd); /* fall through */
6793 free_cpumask_var(d->tmpmask); /* fall through */
6794 case sa_send_covered:
6795 free_cpumask_var(d->send_covered); /* fall through */
6796 case sa_this_core_map:
6797 free_cpumask_var(d->this_core_map); /* fall through */
6798 case sa_this_sibling_map:
6799 free_cpumask_var(d->this_sibling_map); /* fall through */
6801 free_cpumask_var(d->nodemask); /* fall through */
6802 case sa_sched_group_nodes:
6804 kfree(d->sched_group_nodes); /* fall through */
6806 free_cpumask_var(d->notcovered); /* fall through */
6808 free_cpumask_var(d->covered); /* fall through */
6810 free_cpumask_var(d->domainspan); /* fall through */
6817 static enum s_alloc __visit_domain_allocation_hell(struct s_data *d,
6818 const struct cpumask *cpu_map)
6821 if (!alloc_cpumask_var(&d->domainspan, GFP_KERNEL))
6823 if (!alloc_cpumask_var(&d->covered, GFP_KERNEL))
6824 return sa_domainspan;
6825 if (!alloc_cpumask_var(&d->notcovered, GFP_KERNEL))
6827 /* Allocate the per-node list of sched groups */
6828 d->sched_group_nodes = kcalloc(nr_node_ids,
6829 sizeof(struct sched_group *), GFP_KERNEL);
6830 if (!d->sched_group_nodes) {
6831 printk(KERN_WARNING "Can not alloc sched group node list\n");
6832 return sa_notcovered;
6834 sched_group_nodes_bycpu[cpumask_first(cpu_map)] = d->sched_group_nodes;
6836 if (!alloc_cpumask_var(&d->nodemask, GFP_KERNEL))
6837 return sa_sched_group_nodes;
6838 if (!alloc_cpumask_var(&d->this_sibling_map, GFP_KERNEL))
6840 if (!alloc_cpumask_var(&d->this_core_map, GFP_KERNEL))
6841 return sa_this_sibling_map;
6842 if (!alloc_cpumask_var(&d->send_covered, GFP_KERNEL))
6843 return sa_this_core_map;
6844 if (!alloc_cpumask_var(&d->tmpmask, GFP_KERNEL))
6845 return sa_send_covered;
6846 d->rd = alloc_rootdomain();
6848 printk(KERN_WARNING "Cannot alloc root domain\n");
6851 return sa_rootdomain;
6854 static struct sched_domain *__build_numa_sched_domains(struct s_data *d,
6855 const struct cpumask *cpu_map, struct sched_domain_attr *attr, int i)
6857 struct sched_domain *sd = NULL;
6859 struct sched_domain *parent;
6862 if (cpumask_weight(cpu_map) >
6863 SD_NODES_PER_DOMAIN * cpumask_weight(d->nodemask)) {
6864 sd = &per_cpu(allnodes_domains, i).sd;
6865 SD_INIT(sd, ALLNODES);
6866 set_domain_attribute(sd, attr);
6867 cpumask_copy(sched_domain_span(sd), cpu_map);
6868 cpu_to_allnodes_group(i, cpu_map, &sd->groups, d->tmpmask);
6873 sd = &per_cpu(node_domains, i).sd;
6875 set_domain_attribute(sd, attr);
6876 sched_domain_node_span(cpu_to_node(i), sched_domain_span(sd));
6877 sd->parent = parent;
6880 cpumask_and(sched_domain_span(sd), sched_domain_span(sd), cpu_map);
6885 static struct sched_domain *__build_cpu_sched_domain(struct s_data *d,
6886 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6887 struct sched_domain *parent, int i)
6889 struct sched_domain *sd;
6890 sd = &per_cpu(phys_domains, i).sd;
6892 set_domain_attribute(sd, attr);
6893 cpumask_copy(sched_domain_span(sd), d->nodemask);
6894 sd->parent = parent;
6897 cpu_to_phys_group(i, cpu_map, &sd->groups, d->tmpmask);
6901 static struct sched_domain *__build_mc_sched_domain(struct s_data *d,
6902 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6903 struct sched_domain *parent, int i)
6905 struct sched_domain *sd = parent;
6906 #ifdef CONFIG_SCHED_MC
6907 sd = &per_cpu(core_domains, i).sd;
6909 set_domain_attribute(sd, attr);
6910 cpumask_and(sched_domain_span(sd), cpu_map, cpu_coregroup_mask(i));
6911 sd->parent = parent;
6913 cpu_to_core_group(i, cpu_map, &sd->groups, d->tmpmask);
6918 static struct sched_domain *__build_smt_sched_domain(struct s_data *d,
6919 const struct cpumask *cpu_map, struct sched_domain_attr *attr,
6920 struct sched_domain *parent, int i)
6922 struct sched_domain *sd = parent;
6923 #ifdef CONFIG_SCHED_SMT
6924 sd = &per_cpu(cpu_domains, i).sd;
6925 SD_INIT(sd, SIBLING);
6926 set_domain_attribute(sd, attr);
6927 cpumask_and(sched_domain_span(sd), cpu_map, topology_thread_cpumask(i));
6928 sd->parent = parent;
6930 cpu_to_cpu_group(i, cpu_map, &sd->groups, d->tmpmask);
6935 static void build_sched_groups(struct s_data *d, enum sched_domain_level l,
6936 const struct cpumask *cpu_map, int cpu)
6939 #ifdef CONFIG_SCHED_SMT
6940 case SD_LV_SIBLING: /* set up CPU (sibling) groups */
6941 cpumask_and(d->this_sibling_map, cpu_map,
6942 topology_thread_cpumask(cpu));
6943 if (cpu == cpumask_first(d->this_sibling_map))
6944 init_sched_build_groups(d->this_sibling_map, cpu_map,
6946 d->send_covered, d->tmpmask);
6949 #ifdef CONFIG_SCHED_MC
6950 case SD_LV_MC: /* set up multi-core groups */
6951 cpumask_and(d->this_core_map, cpu_map, cpu_coregroup_mask(cpu));
6952 if (cpu == cpumask_first(d->this_core_map))
6953 init_sched_build_groups(d->this_core_map, cpu_map,
6955 d->send_covered, d->tmpmask);
6958 case SD_LV_CPU: /* set up physical groups */
6959 cpumask_and(d->nodemask, cpumask_of_node(cpu), cpu_map);
6960 if (!cpumask_empty(d->nodemask))
6961 init_sched_build_groups(d->nodemask, cpu_map,
6963 d->send_covered, d->tmpmask);
6966 case SD_LV_ALLNODES:
6967 init_sched_build_groups(cpu_map, cpu_map, &cpu_to_allnodes_group,
6968 d->send_covered, d->tmpmask);
6977 * Build sched domains for a given set of cpus and attach the sched domains
6978 * to the individual cpus
6980 static int __build_sched_domains(const struct cpumask *cpu_map,
6981 struct sched_domain_attr *attr)
6983 enum s_alloc alloc_state = sa_none;
6985 struct sched_domain *sd;
6991 alloc_state = __visit_domain_allocation_hell(&d, cpu_map);
6992 if (alloc_state != sa_rootdomain)
6994 alloc_state = sa_sched_groups;
6997 * Set up domains for cpus specified by the cpu_map.
6999 for_each_cpu(i, cpu_map) {
7000 cpumask_and(d.nodemask, cpumask_of_node(cpu_to_node(i)),
7003 sd = __build_numa_sched_domains(&d, cpu_map, attr, i);
7004 sd = __build_cpu_sched_domain(&d, cpu_map, attr, sd, i);
7005 sd = __build_mc_sched_domain(&d, cpu_map, attr, sd, i);
7006 sd = __build_smt_sched_domain(&d, cpu_map, attr, sd, i);
7009 for_each_cpu(i, cpu_map) {
7010 build_sched_groups(&d, SD_LV_SIBLING, cpu_map, i);
7011 build_sched_groups(&d, SD_LV_MC, cpu_map, i);
7014 /* Set up physical groups */
7015 for (i = 0; i < nr_node_ids; i++)
7016 build_sched_groups(&d, SD_LV_CPU, cpu_map, i);
7019 /* Set up node groups */
7021 build_sched_groups(&d, SD_LV_ALLNODES, cpu_map, 0);
7023 for (i = 0; i < nr_node_ids; i++)
7024 if (build_numa_sched_groups(&d, cpu_map, i))
7028 /* Calculate CPU power for physical packages and nodes */
7029 #ifdef CONFIG_SCHED_SMT
7030 for_each_cpu(i, cpu_map) {
7031 sd = &per_cpu(cpu_domains, i).sd;
7032 init_sched_groups_power(i, sd);
7035 #ifdef CONFIG_SCHED_MC
7036 for_each_cpu(i, cpu_map) {
7037 sd = &per_cpu(core_domains, i).sd;
7038 init_sched_groups_power(i, sd);
7042 for_each_cpu(i, cpu_map) {
7043 sd = &per_cpu(phys_domains, i).sd;
7044 init_sched_groups_power(i, sd);
7048 for (i = 0; i < nr_node_ids; i++)
7049 init_numa_sched_groups_power(d.sched_group_nodes[i]);
7051 if (d.sd_allnodes) {
7052 struct sched_group *sg;
7054 cpu_to_allnodes_group(cpumask_first(cpu_map), cpu_map, &sg,
7056 init_numa_sched_groups_power(sg);
7060 /* Attach the domains */
7061 for_each_cpu(i, cpu_map) {
7062 #ifdef CONFIG_SCHED_SMT
7063 sd = &per_cpu(cpu_domains, i).sd;
7064 #elif defined(CONFIG_SCHED_MC)
7065 sd = &per_cpu(core_domains, i).sd;
7067 sd = &per_cpu(phys_domains, i).sd;
7069 cpu_attach_domain(sd, d.rd, i);
7072 d.sched_group_nodes = NULL; /* don't free this we still need it */
7073 __free_domain_allocs(&d, sa_tmpmask, cpu_map);
7077 __free_domain_allocs(&d, alloc_state, cpu_map);
7081 static int build_sched_domains(const struct cpumask *cpu_map)
7083 return __build_sched_domains(cpu_map, NULL);
7086 static cpumask_var_t *doms_cur; /* current sched domains */
7087 static int ndoms_cur; /* number of sched domains in 'doms_cur' */
7088 static struct sched_domain_attr *dattr_cur;
7089 /* attribues of custom domains in 'doms_cur' */
7092 * Special case: If a kmalloc of a doms_cur partition (array of
7093 * cpumask) fails, then fallback to a single sched domain,
7094 * as determined by the single cpumask fallback_doms.
7096 static cpumask_var_t fallback_doms;
7099 * arch_update_cpu_topology lets virtualized architectures update the
7100 * cpu core maps. It is supposed to return 1 if the topology changed
7101 * or 0 if it stayed the same.
7103 int __attribute__((weak)) arch_update_cpu_topology(void)
7108 cpumask_var_t *alloc_sched_domains(unsigned int ndoms)
7111 cpumask_var_t *doms;
7113 doms = kmalloc(sizeof(*doms) * ndoms, GFP_KERNEL);
7116 for (i = 0; i < ndoms; i++) {
7117 if (!alloc_cpumask_var(&doms[i], GFP_KERNEL)) {
7118 free_sched_domains(doms, i);
7125 void free_sched_domains(cpumask_var_t doms[], unsigned int ndoms)
7128 for (i = 0; i < ndoms; i++)
7129 free_cpumask_var(doms[i]);
7134 * Set up scheduler domains and groups. Callers must hold the hotplug lock.
7135 * For now this just excludes isolated cpus, but could be used to
7136 * exclude other special cases in the future.
7138 static int arch_init_sched_domains(const struct cpumask *cpu_map)
7142 arch_update_cpu_topology();
7144 doms_cur = alloc_sched_domains(ndoms_cur);
7146 doms_cur = &fallback_doms;
7147 cpumask_andnot(doms_cur[0], cpu_map, cpu_isolated_map);
7149 err = build_sched_domains(doms_cur[0]);
7150 register_sched_domain_sysctl();
7155 static void arch_destroy_sched_domains(const struct cpumask *cpu_map,
7156 struct cpumask *tmpmask)
7158 free_sched_groups(cpu_map, tmpmask);
7162 * Detach sched domains from a group of cpus specified in cpu_map
7163 * These cpus will now be attached to the NULL domain
7165 static void detach_destroy_domains(const struct cpumask *cpu_map)
7167 /* Save because hotplug lock held. */
7168 static DECLARE_BITMAP(tmpmask, CONFIG_NR_CPUS);
7171 for_each_cpu(i, cpu_map)
7172 cpu_attach_domain(NULL, &def_root_domain, i);
7173 synchronize_sched();
7174 arch_destroy_sched_domains(cpu_map, to_cpumask(tmpmask));
7177 /* handle null as "default" */
7178 static int dattrs_equal(struct sched_domain_attr *cur, int idx_cur,
7179 struct sched_domain_attr *new, int idx_new)
7181 struct sched_domain_attr tmp;
7188 return !memcmp(cur ? (cur + idx_cur) : &tmp,
7189 new ? (new + idx_new) : &tmp,
7190 sizeof(struct sched_domain_attr));
7194 * Partition sched domains as specified by the 'ndoms_new'
7195 * cpumasks in the array doms_new[] of cpumasks. This compares
7196 * doms_new[] to the current sched domain partitioning, doms_cur[].
7197 * It destroys each deleted domain and builds each new domain.
7199 * 'doms_new' is an array of cpumask_var_t's of length 'ndoms_new'.
7200 * The masks don't intersect (don't overlap.) We should setup one
7201 * sched domain for each mask. CPUs not in any of the cpumasks will
7202 * not be load balanced. If the same cpumask appears both in the
7203 * current 'doms_cur' domains and in the new 'doms_new', we can leave
7206 * The passed in 'doms_new' should be allocated using
7207 * alloc_sched_domains. This routine takes ownership of it and will
7208 * free_sched_domains it when done with it. If the caller failed the
7209 * alloc call, then it can pass in doms_new == NULL && ndoms_new == 1,
7210 * and partition_sched_domains() will fallback to the single partition
7211 * 'fallback_doms', it also forces the domains to be rebuilt.
7213 * If doms_new == NULL it will be replaced with cpu_online_mask.
7214 * ndoms_new == 0 is a special case for destroying existing domains,
7215 * and it will not create the default domain.
7217 * Call with hotplug lock held
7219 void partition_sched_domains(int ndoms_new, cpumask_var_t doms_new[],
7220 struct sched_domain_attr *dattr_new)
7225 mutex_lock(&sched_domains_mutex);
7227 /* always unregister in case we don't destroy any domains */
7228 unregister_sched_domain_sysctl();
7230 /* Let architecture update cpu core mappings. */
7231 new_topology = arch_update_cpu_topology();
7233 n = doms_new ? ndoms_new : 0;
7235 /* Destroy deleted domains */
7236 for (i = 0; i < ndoms_cur; i++) {
7237 for (j = 0; j < n && !new_topology; j++) {
7238 if (cpumask_equal(doms_cur[i], doms_new[j])
7239 && dattrs_equal(dattr_cur, i, dattr_new, j))
7242 /* no match - a current sched domain not in new doms_new[] */
7243 detach_destroy_domains(doms_cur[i]);
7248 if (doms_new == NULL) {
7250 doms_new = &fallback_doms;
7251 cpumask_andnot(doms_new[0], cpu_active_mask, cpu_isolated_map);
7252 WARN_ON_ONCE(dattr_new);
7255 /* Build new domains */
7256 for (i = 0; i < ndoms_new; i++) {
7257 for (j = 0; j < ndoms_cur && !new_topology; j++) {
7258 if (cpumask_equal(doms_new[i], doms_cur[j])
7259 && dattrs_equal(dattr_new, i, dattr_cur, j))
7262 /* no match - add a new doms_new */
7263 __build_sched_domains(doms_new[i],
7264 dattr_new ? dattr_new + i : NULL);
7269 /* Remember the new sched domains */
7270 if (doms_cur != &fallback_doms)
7271 free_sched_domains(doms_cur, ndoms_cur);
7272 kfree(dattr_cur); /* kfree(NULL) is safe */
7273 doms_cur = doms_new;
7274 dattr_cur = dattr_new;
7275 ndoms_cur = ndoms_new;
7277 register_sched_domain_sysctl();
7279 mutex_unlock(&sched_domains_mutex);
7282 #if defined(CONFIG_SCHED_MC) || defined(CONFIG_SCHED_SMT)
7283 static void arch_reinit_sched_domains(void)
7287 /* Destroy domains first to force the rebuild */
7288 partition_sched_domains(0, NULL, NULL);
7290 rebuild_sched_domains();
7294 static ssize_t sched_power_savings_store(const char *buf, size_t count, int smt)
7296 unsigned int level = 0;
7298 if (sscanf(buf, "%u", &level) != 1)
7302 * level is always be positive so don't check for
7303 * level < POWERSAVINGS_BALANCE_NONE which is 0
7304 * What happens on 0 or 1 byte write,
7305 * need to check for count as well?
7308 if (level >= MAX_POWERSAVINGS_BALANCE_LEVELS)
7312 sched_smt_power_savings = level;
7314 sched_mc_power_savings = level;
7316 arch_reinit_sched_domains();
7321 #ifdef CONFIG_SCHED_MC
7322 static ssize_t sched_mc_power_savings_show(struct sysdev_class *class,
7323 struct sysdev_class_attribute *attr,
7326 return sprintf(page, "%u\n", sched_mc_power_savings);
7328 static ssize_t sched_mc_power_savings_store(struct sysdev_class *class,
7329 struct sysdev_class_attribute *attr,
7330 const char *buf, size_t count)
7332 return sched_power_savings_store(buf, count, 0);
7334 static SYSDEV_CLASS_ATTR(sched_mc_power_savings, 0644,
7335 sched_mc_power_savings_show,
7336 sched_mc_power_savings_store);
7339 #ifdef CONFIG_SCHED_SMT
7340 static ssize_t sched_smt_power_savings_show(struct sysdev_class *dev,
7341 struct sysdev_class_attribute *attr,
7344 return sprintf(page, "%u\n", sched_smt_power_savings);
7346 static ssize_t sched_smt_power_savings_store(struct sysdev_class *dev,
7347 struct sysdev_class_attribute *attr,
7348 const char *buf, size_t count)
7350 return sched_power_savings_store(buf, count, 1);
7352 static SYSDEV_CLASS_ATTR(sched_smt_power_savings, 0644,
7353 sched_smt_power_savings_show,
7354 sched_smt_power_savings_store);
7357 int __init sched_create_sysfs_power_savings_entries(struct sysdev_class *cls)
7361 #ifdef CONFIG_SCHED_SMT
7363 err = sysfs_create_file(&cls->kset.kobj,
7364 &attr_sched_smt_power_savings.attr);
7366 #ifdef CONFIG_SCHED_MC
7367 if (!err && mc_capable())
7368 err = sysfs_create_file(&cls->kset.kobj,
7369 &attr_sched_mc_power_savings.attr);
7373 #endif /* CONFIG_SCHED_MC || CONFIG_SCHED_SMT */
7375 #ifndef CONFIG_CPUSETS
7377 * Add online and remove offline CPUs from the scheduler domains.
7378 * When cpusets are enabled they take over this function.
7380 static int update_sched_domains(struct notifier_block *nfb,
7381 unsigned long action, void *hcpu)
7385 case CPU_ONLINE_FROZEN:
7386 case CPU_DOWN_PREPARE:
7387 case CPU_DOWN_PREPARE_FROZEN:
7388 case CPU_DOWN_FAILED:
7389 case CPU_DOWN_FAILED_FROZEN:
7390 partition_sched_domains(1, NULL, NULL);
7399 static int update_runtime(struct notifier_block *nfb,
7400 unsigned long action, void *hcpu)
7402 int cpu = (int)(long)hcpu;
7405 case CPU_DOWN_PREPARE:
7406 case CPU_DOWN_PREPARE_FROZEN:
7407 disable_runtime(cpu_rq(cpu));
7410 case CPU_DOWN_FAILED:
7411 case CPU_DOWN_FAILED_FROZEN:
7413 case CPU_ONLINE_FROZEN:
7414 enable_runtime(cpu_rq(cpu));
7422 void __init sched_init_smp(void)
7424 cpumask_var_t non_isolated_cpus;
7426 alloc_cpumask_var(&non_isolated_cpus, GFP_KERNEL);
7427 alloc_cpumask_var(&fallback_doms, GFP_KERNEL);
7429 #if defined(CONFIG_NUMA)
7430 sched_group_nodes_bycpu = kzalloc(nr_cpu_ids * sizeof(void **),
7432 BUG_ON(sched_group_nodes_bycpu == NULL);
7435 mutex_lock(&sched_domains_mutex);
7436 arch_init_sched_domains(cpu_active_mask);
7437 cpumask_andnot(non_isolated_cpus, cpu_possible_mask, cpu_isolated_map);
7438 if (cpumask_empty(non_isolated_cpus))
7439 cpumask_set_cpu(smp_processor_id(), non_isolated_cpus);
7440 mutex_unlock(&sched_domains_mutex);
7443 #ifndef CONFIG_CPUSETS
7444 /* XXX: Theoretical race here - CPU may be hotplugged now */
7445 hotcpu_notifier(update_sched_domains, 0);
7448 /* RT runtime code needs to handle some hotplug events */
7449 hotcpu_notifier(update_runtime, 0);
7453 /* Move init over to a non-isolated CPU */
7454 if (set_cpus_allowed_ptr(current, non_isolated_cpus) < 0)
7456 sched_init_granularity();
7457 free_cpumask_var(non_isolated_cpus);
7459 init_sched_rt_class();
7462 void __init sched_init_smp(void)
7464 sched_init_granularity();
7466 #endif /* CONFIG_SMP */
7468 const_debug unsigned int sysctl_timer_migration = 1;
7470 int in_sched_functions(unsigned long addr)
7472 return in_lock_functions(addr) ||
7473 (addr >= (unsigned long)__sched_text_start
7474 && addr < (unsigned long)__sched_text_end);
7477 static void init_cfs_rq(struct cfs_rq *cfs_rq, struct rq *rq)
7479 cfs_rq->tasks_timeline = RB_ROOT;
7480 INIT_LIST_HEAD(&cfs_rq->tasks);
7481 #ifdef CONFIG_FAIR_GROUP_SCHED
7484 cfs_rq->min_vruntime = (u64)(-(1LL << 20));
7487 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
7489 struct rt_prio_array *array;
7492 array = &rt_rq->active;
7493 for (i = 0; i < MAX_RT_PRIO; i++) {
7494 INIT_LIST_HEAD(array->queue + i);
7495 __clear_bit(i, array->bitmap);
7497 /* delimiter for bitsearch: */
7498 __set_bit(MAX_RT_PRIO, array->bitmap);
7500 #if defined CONFIG_SMP || defined CONFIG_RT_GROUP_SCHED
7501 rt_rq->highest_prio.curr = MAX_RT_PRIO;
7503 rt_rq->highest_prio.next = MAX_RT_PRIO;
7507 rt_rq->rt_nr_migratory = 0;
7508 rt_rq->overloaded = 0;
7509 plist_head_init_raw(&rt_rq->pushable_tasks, &rq->lock);
7513 rt_rq->rt_throttled = 0;
7514 rt_rq->rt_runtime = 0;
7515 raw_spin_lock_init(&rt_rq->rt_runtime_lock);
7517 #ifdef CONFIG_RT_GROUP_SCHED
7518 rt_rq->rt_nr_boosted = 0;
7523 #ifdef CONFIG_FAIR_GROUP_SCHED
7524 static void init_tg_cfs_entry(struct task_group *tg, struct cfs_rq *cfs_rq,
7525 struct sched_entity *se, int cpu, int add,
7526 struct sched_entity *parent)
7528 struct rq *rq = cpu_rq(cpu);
7529 tg->cfs_rq[cpu] = cfs_rq;
7530 init_cfs_rq(cfs_rq, rq);
7533 list_add(&cfs_rq->leaf_cfs_rq_list, &rq->leaf_cfs_rq_list);
7536 /* se could be NULL for init_task_group */
7541 se->cfs_rq = &rq->cfs;
7543 se->cfs_rq = parent->my_q;
7546 se->load.weight = tg->shares;
7547 se->load.inv_weight = 0;
7548 se->parent = parent;
7552 #ifdef CONFIG_RT_GROUP_SCHED
7553 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
7554 struct sched_rt_entity *rt_se, int cpu, int add,
7555 struct sched_rt_entity *parent)
7557 struct rq *rq = cpu_rq(cpu);
7559 tg->rt_rq[cpu] = rt_rq;
7560 init_rt_rq(rt_rq, rq);
7562 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
7564 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
7566 tg->rt_se[cpu] = rt_se;
7571 rt_se->rt_rq = &rq->rt;
7573 rt_se->rt_rq = parent->my_q;
7575 rt_se->my_q = rt_rq;
7576 rt_se->parent = parent;
7577 INIT_LIST_HEAD(&rt_se->run_list);
7581 void __init sched_init(void)
7584 unsigned long alloc_size = 0, ptr;
7586 #ifdef CONFIG_FAIR_GROUP_SCHED
7587 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7589 #ifdef CONFIG_RT_GROUP_SCHED
7590 alloc_size += 2 * nr_cpu_ids * sizeof(void **);
7592 #ifdef CONFIG_CPUMASK_OFFSTACK
7593 alloc_size += num_possible_cpus() * cpumask_size();
7596 ptr = (unsigned long)kzalloc(alloc_size, GFP_NOWAIT);
7598 #ifdef CONFIG_FAIR_GROUP_SCHED
7599 init_task_group.se = (struct sched_entity **)ptr;
7600 ptr += nr_cpu_ids * sizeof(void **);
7602 init_task_group.cfs_rq = (struct cfs_rq **)ptr;
7603 ptr += nr_cpu_ids * sizeof(void **);
7605 #endif /* CONFIG_FAIR_GROUP_SCHED */
7606 #ifdef CONFIG_RT_GROUP_SCHED
7607 init_task_group.rt_se = (struct sched_rt_entity **)ptr;
7608 ptr += nr_cpu_ids * sizeof(void **);
7610 init_task_group.rt_rq = (struct rt_rq **)ptr;
7611 ptr += nr_cpu_ids * sizeof(void **);
7613 #endif /* CONFIG_RT_GROUP_SCHED */
7614 #ifdef CONFIG_CPUMASK_OFFSTACK
7615 for_each_possible_cpu(i) {
7616 per_cpu(load_balance_tmpmask, i) = (void *)ptr;
7617 ptr += cpumask_size();
7619 #endif /* CONFIG_CPUMASK_OFFSTACK */
7623 init_defrootdomain();
7626 init_rt_bandwidth(&def_rt_bandwidth,
7627 global_rt_period(), global_rt_runtime());
7629 #ifdef CONFIG_RT_GROUP_SCHED
7630 init_rt_bandwidth(&init_task_group.rt_bandwidth,
7631 global_rt_period(), global_rt_runtime());
7632 #endif /* CONFIG_RT_GROUP_SCHED */
7634 #ifdef CONFIG_CGROUP_SCHED
7635 list_add(&init_task_group.list, &task_groups);
7636 INIT_LIST_HEAD(&init_task_group.children);
7638 #endif /* CONFIG_CGROUP_SCHED */
7640 #if defined CONFIG_FAIR_GROUP_SCHED && defined CONFIG_SMP
7641 update_shares_data = __alloc_percpu(nr_cpu_ids * sizeof(unsigned long),
7642 __alignof__(unsigned long));
7644 for_each_possible_cpu(i) {
7648 raw_spin_lock_init(&rq->lock);
7650 rq->calc_load_active = 0;
7651 rq->calc_load_update = jiffies + LOAD_FREQ;
7652 init_cfs_rq(&rq->cfs, rq);
7653 init_rt_rq(&rq->rt, rq);
7654 #ifdef CONFIG_FAIR_GROUP_SCHED
7655 init_task_group.shares = init_task_group_load;
7656 INIT_LIST_HEAD(&rq->leaf_cfs_rq_list);
7657 #ifdef CONFIG_CGROUP_SCHED
7659 * How much cpu bandwidth does init_task_group get?
7661 * In case of task-groups formed thr' the cgroup filesystem, it
7662 * gets 100% of the cpu resources in the system. This overall
7663 * system cpu resource is divided among the tasks of
7664 * init_task_group and its child task-groups in a fair manner,
7665 * based on each entity's (task or task-group's) weight
7666 * (se->load.weight).
7668 * In other words, if init_task_group has 10 tasks of weight
7669 * 1024) and two child groups A0 and A1 (of weight 1024 each),
7670 * then A0's share of the cpu resource is:
7672 * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33%
7674 * We achieve this by letting init_task_group's tasks sit
7675 * directly in rq->cfs (i.e init_task_group->se[] = NULL).
7677 init_tg_cfs_entry(&init_task_group, &rq->cfs, NULL, i, 1, NULL);
7679 #endif /* CONFIG_FAIR_GROUP_SCHED */
7681 rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime;
7682 #ifdef CONFIG_RT_GROUP_SCHED
7683 INIT_LIST_HEAD(&rq->leaf_rt_rq_list);
7684 #ifdef CONFIG_CGROUP_SCHED
7685 init_tg_rt_entry(&init_task_group, &rq->rt, NULL, i, 1, NULL);
7689 for (j = 0; j < CPU_LOAD_IDX_MAX; j++)
7690 rq->cpu_load[j] = 0;
7694 rq->post_schedule = 0;
7695 rq->active_balance = 0;
7696 rq->next_balance = jiffies;
7700 rq->migration_thread = NULL;
7702 rq->avg_idle = 2*sysctl_sched_migration_cost;
7703 INIT_LIST_HEAD(&rq->migration_queue);
7704 rq_attach_root(rq, &def_root_domain);
7707 atomic_set(&rq->nr_iowait, 0);
7710 set_load_weight(&init_task);
7712 #ifdef CONFIG_PREEMPT_NOTIFIERS
7713 INIT_HLIST_HEAD(&init_task.preempt_notifiers);
7717 open_softirq(SCHED_SOFTIRQ, run_rebalance_domains);
7720 #ifdef CONFIG_RT_MUTEXES
7721 plist_head_init_raw(&init_task.pi_waiters, &init_task.pi_lock);
7725 * The boot idle thread does lazy MMU switching as well:
7727 atomic_inc(&init_mm.mm_count);
7728 enter_lazy_tlb(&init_mm, current);
7731 * Make us the idle thread. Technically, schedule() should not be
7732 * called from this thread, however somewhere below it might be,
7733 * but because we are the idle thread, we just pick up running again
7734 * when this runqueue becomes "idle".
7736 init_idle(current, smp_processor_id());
7738 calc_load_update = jiffies + LOAD_FREQ;
7741 * During early bootup we pretend to be a normal task:
7743 current->sched_class = &fair_sched_class;
7745 /* Allocate the nohz_cpu_mask if CONFIG_CPUMASK_OFFSTACK */
7746 zalloc_cpumask_var(&nohz_cpu_mask, GFP_NOWAIT);
7749 zalloc_cpumask_var(&nohz.cpu_mask, GFP_NOWAIT);
7750 alloc_cpumask_var(&nohz.ilb_grp_nohz_mask, GFP_NOWAIT);
7752 /* May be allocated at isolcpus cmdline parse time */
7753 if (cpu_isolated_map == NULL)
7754 zalloc_cpumask_var(&cpu_isolated_map, GFP_NOWAIT);
7759 scheduler_running = 1;
7762 #ifdef CONFIG_DEBUG_SPINLOCK_SLEEP
7763 static inline int preempt_count_equals(int preempt_offset)
7765 int nested = (preempt_count() & ~PREEMPT_ACTIVE) + rcu_preempt_depth();
7767 return (nested == PREEMPT_INATOMIC_BASE + preempt_offset);
7770 void __might_sleep(const char *file, int line, int preempt_offset)
7773 static unsigned long prev_jiffy; /* ratelimiting */
7775 if ((preempt_count_equals(preempt_offset) && !irqs_disabled()) ||
7776 system_state != SYSTEM_RUNNING || oops_in_progress)
7778 if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy)
7780 prev_jiffy = jiffies;
7783 "BUG: sleeping function called from invalid context at %s:%d\n",
7786 "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n",
7787 in_atomic(), irqs_disabled(),
7788 current->pid, current->comm);
7790 debug_show_held_locks(current);
7791 if (irqs_disabled())
7792 print_irqtrace_events(current);
7796 EXPORT_SYMBOL(__might_sleep);
7799 #ifdef CONFIG_MAGIC_SYSRQ
7800 static void normalize_task(struct rq *rq, struct task_struct *p)
7804 on_rq = p->se.on_rq;
7806 deactivate_task(rq, p, 0);
7807 __setscheduler(rq, p, SCHED_NORMAL, 0);
7809 activate_task(rq, p, 0);
7810 resched_task(rq->curr);
7814 void normalize_rt_tasks(void)
7816 struct task_struct *g, *p;
7817 unsigned long flags;
7820 read_lock_irqsave(&tasklist_lock, flags);
7821 do_each_thread(g, p) {
7823 * Only normalize user tasks:
7828 p->se.exec_start = 0;
7829 #ifdef CONFIG_SCHEDSTATS
7830 p->se.statistics.wait_start = 0;
7831 p->se.statistics.sleep_start = 0;
7832 p->se.statistics.block_start = 0;
7837 * Renice negative nice level userspace
7840 if (TASK_NICE(p) < 0 && p->mm)
7841 set_user_nice(p, 0);
7845 raw_spin_lock(&p->pi_lock);
7846 rq = __task_rq_lock(p);
7848 normalize_task(rq, p);
7850 __task_rq_unlock(rq);
7851 raw_spin_unlock(&p->pi_lock);
7852 } while_each_thread(g, p);
7854 read_unlock_irqrestore(&tasklist_lock, flags);
7857 #endif /* CONFIG_MAGIC_SYSRQ */
7861 * These functions are only useful for the IA64 MCA handling.
7863 * They can only be called when the whole system has been
7864 * stopped - every CPU needs to be quiescent, and no scheduling
7865 * activity can take place. Using them for anything else would
7866 * be a serious bug, and as a result, they aren't even visible
7867 * under any other configuration.
7871 * curr_task - return the current task for a given cpu.
7872 * @cpu: the processor in question.
7874 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7876 struct task_struct *curr_task(int cpu)
7878 return cpu_curr(cpu);
7882 * set_curr_task - set the current task for a given cpu.
7883 * @cpu: the processor in question.
7884 * @p: the task pointer to set.
7886 * Description: This function must only be used when non-maskable interrupts
7887 * are serviced on a separate stack. It allows the architecture to switch the
7888 * notion of the current task on a cpu in a non-blocking manner. This function
7889 * must be called with all CPU's synchronized, and interrupts disabled, the
7890 * and caller must save the original value of the current task (see
7891 * curr_task() above) and restore that value before reenabling interrupts and
7892 * re-starting the system.
7894 * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED!
7896 void set_curr_task(int cpu, struct task_struct *p)
7903 #ifdef CONFIG_FAIR_GROUP_SCHED
7904 static void free_fair_sched_group(struct task_group *tg)
7908 for_each_possible_cpu(i) {
7910 kfree(tg->cfs_rq[i]);
7920 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
7922 struct cfs_rq *cfs_rq;
7923 struct sched_entity *se;
7927 tg->cfs_rq = kzalloc(sizeof(cfs_rq) * nr_cpu_ids, GFP_KERNEL);
7930 tg->se = kzalloc(sizeof(se) * nr_cpu_ids, GFP_KERNEL);
7934 tg->shares = NICE_0_LOAD;
7936 for_each_possible_cpu(i) {
7939 cfs_rq = kzalloc_node(sizeof(struct cfs_rq),
7940 GFP_KERNEL, cpu_to_node(i));
7944 se = kzalloc_node(sizeof(struct sched_entity),
7945 GFP_KERNEL, cpu_to_node(i));
7949 init_tg_cfs_entry(tg, cfs_rq, se, i, 0, parent->se[i]);
7960 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
7962 list_add_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list,
7963 &cpu_rq(cpu)->leaf_cfs_rq_list);
7966 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
7968 list_del_rcu(&tg->cfs_rq[cpu]->leaf_cfs_rq_list);
7970 #else /* !CONFG_FAIR_GROUP_SCHED */
7971 static inline void free_fair_sched_group(struct task_group *tg)
7976 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
7981 static inline void register_fair_sched_group(struct task_group *tg, int cpu)
7985 static inline void unregister_fair_sched_group(struct task_group *tg, int cpu)
7988 #endif /* CONFIG_FAIR_GROUP_SCHED */
7990 #ifdef CONFIG_RT_GROUP_SCHED
7991 static void free_rt_sched_group(struct task_group *tg)
7995 destroy_rt_bandwidth(&tg->rt_bandwidth);
7997 for_each_possible_cpu(i) {
7999 kfree(tg->rt_rq[i]);
8001 kfree(tg->rt_se[i]);
8009 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8011 struct rt_rq *rt_rq;
8012 struct sched_rt_entity *rt_se;
8016 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
8019 tg->rt_se = kzalloc(sizeof(rt_se) * nr_cpu_ids, GFP_KERNEL);
8023 init_rt_bandwidth(&tg->rt_bandwidth,
8024 ktime_to_ns(def_rt_bandwidth.rt_period), 0);
8026 for_each_possible_cpu(i) {
8029 rt_rq = kzalloc_node(sizeof(struct rt_rq),
8030 GFP_KERNEL, cpu_to_node(i));
8034 rt_se = kzalloc_node(sizeof(struct sched_rt_entity),
8035 GFP_KERNEL, cpu_to_node(i));
8039 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
8050 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8052 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
8053 &cpu_rq(cpu)->leaf_rt_rq_list);
8056 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8058 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
8060 #else /* !CONFIG_RT_GROUP_SCHED */
8061 static inline void free_rt_sched_group(struct task_group *tg)
8066 int alloc_rt_sched_group(struct task_group *tg, struct task_group *parent)
8071 static inline void register_rt_sched_group(struct task_group *tg, int cpu)
8075 static inline void unregister_rt_sched_group(struct task_group *tg, int cpu)
8078 #endif /* CONFIG_RT_GROUP_SCHED */
8080 #ifdef CONFIG_CGROUP_SCHED
8081 static void free_sched_group(struct task_group *tg)
8083 free_fair_sched_group(tg);
8084 free_rt_sched_group(tg);
8088 /* allocate runqueue etc for a new task group */
8089 struct task_group *sched_create_group(struct task_group *parent)
8091 struct task_group *tg;
8092 unsigned long flags;
8095 tg = kzalloc(sizeof(*tg), GFP_KERNEL);
8097 return ERR_PTR(-ENOMEM);
8099 if (!alloc_fair_sched_group(tg, parent))
8102 if (!alloc_rt_sched_group(tg, parent))
8105 spin_lock_irqsave(&task_group_lock, flags);
8106 for_each_possible_cpu(i) {
8107 register_fair_sched_group(tg, i);
8108 register_rt_sched_group(tg, i);
8110 list_add_rcu(&tg->list, &task_groups);
8112 WARN_ON(!parent); /* root should already exist */
8114 tg->parent = parent;
8115 INIT_LIST_HEAD(&tg->children);
8116 list_add_rcu(&tg->siblings, &parent->children);
8117 spin_unlock_irqrestore(&task_group_lock, flags);
8122 free_sched_group(tg);
8123 return ERR_PTR(-ENOMEM);
8126 /* rcu callback to free various structures associated with a task group */
8127 static void free_sched_group_rcu(struct rcu_head *rhp)
8129 /* now it should be safe to free those cfs_rqs */
8130 free_sched_group(container_of(rhp, struct task_group, rcu));
8133 /* Destroy runqueue etc associated with a task group */
8134 void sched_destroy_group(struct task_group *tg)
8136 unsigned long flags;
8139 spin_lock_irqsave(&task_group_lock, flags);
8140 for_each_possible_cpu(i) {
8141 unregister_fair_sched_group(tg, i);
8142 unregister_rt_sched_group(tg, i);
8144 list_del_rcu(&tg->list);
8145 list_del_rcu(&tg->siblings);
8146 spin_unlock_irqrestore(&task_group_lock, flags);
8148 /* wait for possible concurrent references to cfs_rqs complete */
8149 call_rcu(&tg->rcu, free_sched_group_rcu);
8152 /* change task's runqueue when it moves between groups.
8153 * The caller of this function should have put the task in its new group
8154 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
8155 * reflect its new group.
8157 void sched_move_task(struct task_struct *tsk)
8160 unsigned long flags;
8163 rq = task_rq_lock(tsk, &flags);
8165 running = task_current(rq, tsk);
8166 on_rq = tsk->se.on_rq;
8169 dequeue_task(rq, tsk, 0);
8170 if (unlikely(running))
8171 tsk->sched_class->put_prev_task(rq, tsk);
8173 set_task_rq(tsk, task_cpu(tsk));
8175 #ifdef CONFIG_FAIR_GROUP_SCHED
8176 if (tsk->sched_class->moved_group)
8177 tsk->sched_class->moved_group(tsk, on_rq);
8180 if (unlikely(running))
8181 tsk->sched_class->set_curr_task(rq);
8183 enqueue_task(rq, tsk, 0, false);
8185 task_rq_unlock(rq, &flags);
8187 #endif /* CONFIG_CGROUP_SCHED */
8189 #ifdef CONFIG_FAIR_GROUP_SCHED
8190 static void __set_se_shares(struct sched_entity *se, unsigned long shares)
8192 struct cfs_rq *cfs_rq = se->cfs_rq;
8197 dequeue_entity(cfs_rq, se, 0);
8199 se->load.weight = shares;
8200 se->load.inv_weight = 0;
8203 enqueue_entity(cfs_rq, se, 0);
8206 static void set_se_shares(struct sched_entity *se, unsigned long shares)
8208 struct cfs_rq *cfs_rq = se->cfs_rq;
8209 struct rq *rq = cfs_rq->rq;
8210 unsigned long flags;
8212 raw_spin_lock_irqsave(&rq->lock, flags);
8213 __set_se_shares(se, shares);
8214 raw_spin_unlock_irqrestore(&rq->lock, flags);
8217 static DEFINE_MUTEX(shares_mutex);
8219 int sched_group_set_shares(struct task_group *tg, unsigned long shares)
8222 unsigned long flags;
8225 * We can't change the weight of the root cgroup.
8230 if (shares < MIN_SHARES)
8231 shares = MIN_SHARES;
8232 else if (shares > MAX_SHARES)
8233 shares = MAX_SHARES;
8235 mutex_lock(&shares_mutex);
8236 if (tg->shares == shares)
8239 spin_lock_irqsave(&task_group_lock, flags);
8240 for_each_possible_cpu(i)
8241 unregister_fair_sched_group(tg, i);
8242 list_del_rcu(&tg->siblings);
8243 spin_unlock_irqrestore(&task_group_lock, flags);
8245 /* wait for any ongoing reference to this group to finish */
8246 synchronize_sched();
8249 * Now we are free to modify the group's share on each cpu
8250 * w/o tripping rebalance_share or load_balance_fair.
8252 tg->shares = shares;
8253 for_each_possible_cpu(i) {
8257 cfs_rq_set_shares(tg->cfs_rq[i], 0);
8258 set_se_shares(tg->se[i], shares);
8262 * Enable load balance activity on this group, by inserting it back on
8263 * each cpu's rq->leaf_cfs_rq_list.
8265 spin_lock_irqsave(&task_group_lock, flags);
8266 for_each_possible_cpu(i)
8267 register_fair_sched_group(tg, i);
8268 list_add_rcu(&tg->siblings, &tg->parent->children);
8269 spin_unlock_irqrestore(&task_group_lock, flags);
8271 mutex_unlock(&shares_mutex);
8275 unsigned long sched_group_shares(struct task_group *tg)
8281 #ifdef CONFIG_RT_GROUP_SCHED
8283 * Ensure that the real time constraints are schedulable.
8285 static DEFINE_MUTEX(rt_constraints_mutex);
8287 static unsigned long to_ratio(u64 period, u64 runtime)
8289 if (runtime == RUNTIME_INF)
8292 return div64_u64(runtime << 20, period);
8295 /* Must be called with tasklist_lock held */
8296 static inline int tg_has_rt_tasks(struct task_group *tg)
8298 struct task_struct *g, *p;
8300 do_each_thread(g, p) {
8301 if (rt_task(p) && rt_rq_of_se(&p->rt)->tg == tg)
8303 } while_each_thread(g, p);
8308 struct rt_schedulable_data {
8309 struct task_group *tg;
8314 static int tg_schedulable(struct task_group *tg, void *data)
8316 struct rt_schedulable_data *d = data;
8317 struct task_group *child;
8318 unsigned long total, sum = 0;
8319 u64 period, runtime;
8321 period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8322 runtime = tg->rt_bandwidth.rt_runtime;
8325 period = d->rt_period;
8326 runtime = d->rt_runtime;
8330 * Cannot have more runtime than the period.
8332 if (runtime > period && runtime != RUNTIME_INF)
8336 * Ensure we don't starve existing RT tasks.
8338 if (rt_bandwidth_enabled() && !runtime && tg_has_rt_tasks(tg))
8341 total = to_ratio(period, runtime);
8344 * Nobody can have more than the global setting allows.
8346 if (total > to_ratio(global_rt_period(), global_rt_runtime()))
8350 * The sum of our children's runtime should not exceed our own.
8352 list_for_each_entry_rcu(child, &tg->children, siblings) {
8353 period = ktime_to_ns(child->rt_bandwidth.rt_period);
8354 runtime = child->rt_bandwidth.rt_runtime;
8356 if (child == d->tg) {
8357 period = d->rt_period;
8358 runtime = d->rt_runtime;
8361 sum += to_ratio(period, runtime);
8370 static int __rt_schedulable(struct task_group *tg, u64 period, u64 runtime)
8372 struct rt_schedulable_data data = {
8374 .rt_period = period,
8375 .rt_runtime = runtime,
8378 return walk_tg_tree(tg_schedulable, tg_nop, &data);
8381 static int tg_set_bandwidth(struct task_group *tg,
8382 u64 rt_period, u64 rt_runtime)
8386 mutex_lock(&rt_constraints_mutex);
8387 read_lock(&tasklist_lock);
8388 err = __rt_schedulable(tg, rt_period, rt_runtime);
8392 raw_spin_lock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8393 tg->rt_bandwidth.rt_period = ns_to_ktime(rt_period);
8394 tg->rt_bandwidth.rt_runtime = rt_runtime;
8396 for_each_possible_cpu(i) {
8397 struct rt_rq *rt_rq = tg->rt_rq[i];
8399 raw_spin_lock(&rt_rq->rt_runtime_lock);
8400 rt_rq->rt_runtime = rt_runtime;
8401 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8403 raw_spin_unlock_irq(&tg->rt_bandwidth.rt_runtime_lock);
8405 read_unlock(&tasklist_lock);
8406 mutex_unlock(&rt_constraints_mutex);
8411 int sched_group_set_rt_runtime(struct task_group *tg, long rt_runtime_us)
8413 u64 rt_runtime, rt_period;
8415 rt_period = ktime_to_ns(tg->rt_bandwidth.rt_period);
8416 rt_runtime = (u64)rt_runtime_us * NSEC_PER_USEC;
8417 if (rt_runtime_us < 0)
8418 rt_runtime = RUNTIME_INF;
8420 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8423 long sched_group_rt_runtime(struct task_group *tg)
8427 if (tg->rt_bandwidth.rt_runtime == RUNTIME_INF)
8430 rt_runtime_us = tg->rt_bandwidth.rt_runtime;
8431 do_div(rt_runtime_us, NSEC_PER_USEC);
8432 return rt_runtime_us;
8435 int sched_group_set_rt_period(struct task_group *tg, long rt_period_us)
8437 u64 rt_runtime, rt_period;
8439 rt_period = (u64)rt_period_us * NSEC_PER_USEC;
8440 rt_runtime = tg->rt_bandwidth.rt_runtime;
8445 return tg_set_bandwidth(tg, rt_period, rt_runtime);
8448 long sched_group_rt_period(struct task_group *tg)
8452 rt_period_us = ktime_to_ns(tg->rt_bandwidth.rt_period);
8453 do_div(rt_period_us, NSEC_PER_USEC);
8454 return rt_period_us;
8457 static int sched_rt_global_constraints(void)
8459 u64 runtime, period;
8462 if (sysctl_sched_rt_period <= 0)
8465 runtime = global_rt_runtime();
8466 period = global_rt_period();
8469 * Sanity check on the sysctl variables.
8471 if (runtime > period && runtime != RUNTIME_INF)
8474 mutex_lock(&rt_constraints_mutex);
8475 read_lock(&tasklist_lock);
8476 ret = __rt_schedulable(NULL, 0, 0);
8477 read_unlock(&tasklist_lock);
8478 mutex_unlock(&rt_constraints_mutex);
8483 int sched_rt_can_attach(struct task_group *tg, struct task_struct *tsk)
8485 /* Don't accept realtime tasks when there is no way for them to run */
8486 if (rt_task(tsk) && tg->rt_bandwidth.rt_runtime == 0)
8492 #else /* !CONFIG_RT_GROUP_SCHED */
8493 static int sched_rt_global_constraints(void)
8495 unsigned long flags;
8498 if (sysctl_sched_rt_period <= 0)
8502 * There's always some RT tasks in the root group
8503 * -- migration, kstopmachine etc..
8505 if (sysctl_sched_rt_runtime == 0)
8508 raw_spin_lock_irqsave(&def_rt_bandwidth.rt_runtime_lock, flags);
8509 for_each_possible_cpu(i) {
8510 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
8512 raw_spin_lock(&rt_rq->rt_runtime_lock);
8513 rt_rq->rt_runtime = global_rt_runtime();
8514 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8516 raw_spin_unlock_irqrestore(&def_rt_bandwidth.rt_runtime_lock, flags);
8520 #endif /* CONFIG_RT_GROUP_SCHED */
8522 int sched_rt_handler(struct ctl_table *table, int write,
8523 void __user *buffer, size_t *lenp,
8527 int old_period, old_runtime;
8528 static DEFINE_MUTEX(mutex);
8531 old_period = sysctl_sched_rt_period;
8532 old_runtime = sysctl_sched_rt_runtime;
8534 ret = proc_dointvec(table, write, buffer, lenp, ppos);
8536 if (!ret && write) {
8537 ret = sched_rt_global_constraints();
8539 sysctl_sched_rt_period = old_period;
8540 sysctl_sched_rt_runtime = old_runtime;
8542 def_rt_bandwidth.rt_runtime = global_rt_runtime();
8543 def_rt_bandwidth.rt_period =
8544 ns_to_ktime(global_rt_period());
8547 mutex_unlock(&mutex);
8552 #ifdef CONFIG_CGROUP_SCHED
8554 /* return corresponding task_group object of a cgroup */
8555 static inline struct task_group *cgroup_tg(struct cgroup *cgrp)
8557 return container_of(cgroup_subsys_state(cgrp, cpu_cgroup_subsys_id),
8558 struct task_group, css);
8561 static struct cgroup_subsys_state *
8562 cpu_cgroup_create(struct cgroup_subsys *ss, struct cgroup *cgrp)
8564 struct task_group *tg, *parent;
8566 if (!cgrp->parent) {
8567 /* This is early initialization for the top cgroup */
8568 return &init_task_group.css;
8571 parent = cgroup_tg(cgrp->parent);
8572 tg = sched_create_group(parent);
8574 return ERR_PTR(-ENOMEM);
8580 cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
8582 struct task_group *tg = cgroup_tg(cgrp);
8584 sched_destroy_group(tg);
8588 cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk)
8590 #ifdef CONFIG_RT_GROUP_SCHED
8591 if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk))
8594 /* We don't support RT-tasks being in separate groups */
8595 if (tsk->sched_class != &fair_sched_class)
8602 cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
8603 struct task_struct *tsk, bool threadgroup)
8605 int retval = cpu_cgroup_can_attach_task(cgrp, tsk);
8609 struct task_struct *c;
8611 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
8612 retval = cpu_cgroup_can_attach_task(cgrp, c);
8624 cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp,
8625 struct cgroup *old_cont, struct task_struct *tsk,
8628 sched_move_task(tsk);
8630 struct task_struct *c;
8632 list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) {
8639 #ifdef CONFIG_FAIR_GROUP_SCHED
8640 static int cpu_shares_write_u64(struct cgroup *cgrp, struct cftype *cftype,
8643 return sched_group_set_shares(cgroup_tg(cgrp), shareval);
8646 static u64 cpu_shares_read_u64(struct cgroup *cgrp, struct cftype *cft)
8648 struct task_group *tg = cgroup_tg(cgrp);
8650 return (u64) tg->shares;
8652 #endif /* CONFIG_FAIR_GROUP_SCHED */
8654 #ifdef CONFIG_RT_GROUP_SCHED
8655 static int cpu_rt_runtime_write(struct cgroup *cgrp, struct cftype *cft,
8658 return sched_group_set_rt_runtime(cgroup_tg(cgrp), val);
8661 static s64 cpu_rt_runtime_read(struct cgroup *cgrp, struct cftype *cft)
8663 return sched_group_rt_runtime(cgroup_tg(cgrp));
8666 static int cpu_rt_period_write_uint(struct cgroup *cgrp, struct cftype *cftype,
8669 return sched_group_set_rt_period(cgroup_tg(cgrp), rt_period_us);
8672 static u64 cpu_rt_period_read_uint(struct cgroup *cgrp, struct cftype *cft)
8674 return sched_group_rt_period(cgroup_tg(cgrp));
8676 #endif /* CONFIG_RT_GROUP_SCHED */
8678 static struct cftype cpu_files[] = {
8679 #ifdef CONFIG_FAIR_GROUP_SCHED
8682 .read_u64 = cpu_shares_read_u64,
8683 .write_u64 = cpu_shares_write_u64,
8686 #ifdef CONFIG_RT_GROUP_SCHED
8688 .name = "rt_runtime_us",
8689 .read_s64 = cpu_rt_runtime_read,
8690 .write_s64 = cpu_rt_runtime_write,
8693 .name = "rt_period_us",
8694 .read_u64 = cpu_rt_period_read_uint,
8695 .write_u64 = cpu_rt_period_write_uint,
8700 static int cpu_cgroup_populate(struct cgroup_subsys *ss, struct cgroup *cont)
8702 return cgroup_add_files(cont, ss, cpu_files, ARRAY_SIZE(cpu_files));
8705 struct cgroup_subsys cpu_cgroup_subsys = {
8707 .create = cpu_cgroup_create,
8708 .destroy = cpu_cgroup_destroy,
8709 .can_attach = cpu_cgroup_can_attach,
8710 .attach = cpu_cgroup_attach,
8711 .populate = cpu_cgroup_populate,
8712 .subsys_id = cpu_cgroup_subsys_id,
8716 #endif /* CONFIG_CGROUP_SCHED */
8718 #ifdef CONFIG_CGROUP_CPUACCT
8721 * CPU accounting code for task groups.
8723 * Based on the work by Paul Menage (menage@google.com) and Balbir Singh
8724 * (balbir@in.ibm.com).
8727 /* track cpu usage of a group of tasks and its child groups */
8729 struct cgroup_subsys_state css;
8730 /* cpuusage holds pointer to a u64-type object on every cpu */
8731 u64 __percpu *cpuusage;
8732 struct percpu_counter cpustat[CPUACCT_STAT_NSTATS];
8733 struct cpuacct *parent;
8736 struct cgroup_subsys cpuacct_subsys;
8738 /* return cpu accounting group corresponding to this container */
8739 static inline struct cpuacct *cgroup_ca(struct cgroup *cgrp)
8741 return container_of(cgroup_subsys_state(cgrp, cpuacct_subsys_id),
8742 struct cpuacct, css);
8745 /* return cpu accounting group to which this task belongs */
8746 static inline struct cpuacct *task_ca(struct task_struct *tsk)
8748 return container_of(task_subsys_state(tsk, cpuacct_subsys_id),
8749 struct cpuacct, css);
8752 /* create a new cpu accounting group */
8753 static struct cgroup_subsys_state *cpuacct_create(
8754 struct cgroup_subsys *ss, struct cgroup *cgrp)
8756 struct cpuacct *ca = kzalloc(sizeof(*ca), GFP_KERNEL);
8762 ca->cpuusage = alloc_percpu(u64);
8766 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
8767 if (percpu_counter_init(&ca->cpustat[i], 0))
8768 goto out_free_counters;
8771 ca->parent = cgroup_ca(cgrp->parent);
8777 percpu_counter_destroy(&ca->cpustat[i]);
8778 free_percpu(ca->cpuusage);
8782 return ERR_PTR(-ENOMEM);
8785 /* destroy an existing cpu accounting group */
8787 cpuacct_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp)
8789 struct cpuacct *ca = cgroup_ca(cgrp);
8792 for (i = 0; i < CPUACCT_STAT_NSTATS; i++)
8793 percpu_counter_destroy(&ca->cpustat[i]);
8794 free_percpu(ca->cpuusage);
8798 static u64 cpuacct_cpuusage_read(struct cpuacct *ca, int cpu)
8800 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8803 #ifndef CONFIG_64BIT
8805 * Take rq->lock to make 64-bit read safe on 32-bit platforms.
8807 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8809 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8817 static void cpuacct_cpuusage_write(struct cpuacct *ca, int cpu, u64 val)
8819 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8821 #ifndef CONFIG_64BIT
8823 * Take rq->lock to make 64-bit write safe on 32-bit platforms.
8825 raw_spin_lock_irq(&cpu_rq(cpu)->lock);
8827 raw_spin_unlock_irq(&cpu_rq(cpu)->lock);
8833 /* return total cpu usage (in nanoseconds) of a group */
8834 static u64 cpuusage_read(struct cgroup *cgrp, struct cftype *cft)
8836 struct cpuacct *ca = cgroup_ca(cgrp);
8837 u64 totalcpuusage = 0;
8840 for_each_present_cpu(i)
8841 totalcpuusage += cpuacct_cpuusage_read(ca, i);
8843 return totalcpuusage;
8846 static int cpuusage_write(struct cgroup *cgrp, struct cftype *cftype,
8849 struct cpuacct *ca = cgroup_ca(cgrp);
8858 for_each_present_cpu(i)
8859 cpuacct_cpuusage_write(ca, i, 0);
8865 static int cpuacct_percpu_seq_read(struct cgroup *cgroup, struct cftype *cft,
8868 struct cpuacct *ca = cgroup_ca(cgroup);
8872 for_each_present_cpu(i) {
8873 percpu = cpuacct_cpuusage_read(ca, i);
8874 seq_printf(m, "%llu ", (unsigned long long) percpu);
8876 seq_printf(m, "\n");
8880 static const char *cpuacct_stat_desc[] = {
8881 [CPUACCT_STAT_USER] = "user",
8882 [CPUACCT_STAT_SYSTEM] = "system",
8885 static int cpuacct_stats_show(struct cgroup *cgrp, struct cftype *cft,
8886 struct cgroup_map_cb *cb)
8888 struct cpuacct *ca = cgroup_ca(cgrp);
8891 for (i = 0; i < CPUACCT_STAT_NSTATS; i++) {
8892 s64 val = percpu_counter_read(&ca->cpustat[i]);
8893 val = cputime64_to_clock_t(val);
8894 cb->fill(cb, cpuacct_stat_desc[i], val);
8899 static struct cftype files[] = {
8902 .read_u64 = cpuusage_read,
8903 .write_u64 = cpuusage_write,
8906 .name = "usage_percpu",
8907 .read_seq_string = cpuacct_percpu_seq_read,
8911 .read_map = cpuacct_stats_show,
8915 static int cpuacct_populate(struct cgroup_subsys *ss, struct cgroup *cgrp)
8917 return cgroup_add_files(cgrp, ss, files, ARRAY_SIZE(files));
8921 * charge this task's execution time to its accounting group.
8923 * called with rq->lock held.
8925 static void cpuacct_charge(struct task_struct *tsk, u64 cputime)
8930 if (unlikely(!cpuacct_subsys.active))
8933 cpu = task_cpu(tsk);
8939 for (; ca; ca = ca->parent) {
8940 u64 *cpuusage = per_cpu_ptr(ca->cpuusage, cpu);
8941 *cpuusage += cputime;
8948 * When CONFIG_VIRT_CPU_ACCOUNTING is enabled one jiffy can be very large
8949 * in cputime_t units. As a result, cpuacct_update_stats calls
8950 * percpu_counter_add with values large enough to always overflow the
8951 * per cpu batch limit causing bad SMP scalability.
8953 * To fix this we scale percpu_counter_batch by cputime_one_jiffy so we
8954 * batch the same amount of time with CONFIG_VIRT_CPU_ACCOUNTING disabled
8955 * and enabled. We cap it at INT_MAX which is the largest allowed batch value.
8958 #define CPUACCT_BATCH \
8959 min_t(long, percpu_counter_batch * cputime_one_jiffy, INT_MAX)
8961 #define CPUACCT_BATCH 0
8965 * Charge the system/user time to the task's accounting group.
8967 static void cpuacct_update_stats(struct task_struct *tsk,
8968 enum cpuacct_stat_index idx, cputime_t val)
8971 int batch = CPUACCT_BATCH;
8973 if (unlikely(!cpuacct_subsys.active))
8980 __percpu_counter_add(&ca->cpustat[idx], val, batch);
8986 struct cgroup_subsys cpuacct_subsys = {
8988 .create = cpuacct_create,
8989 .destroy = cpuacct_destroy,
8990 .populate = cpuacct_populate,
8991 .subsys_id = cpuacct_subsys_id,
8993 #endif /* CONFIG_CGROUP_CPUACCT */
8997 int rcu_expedited_torture_stats(char *page)
9001 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
9003 void synchronize_sched_expedited(void)
9006 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
9008 #else /* #ifndef CONFIG_SMP */
9010 static DEFINE_PER_CPU(struct migration_req, rcu_migration_req);
9011 static DEFINE_MUTEX(rcu_sched_expedited_mutex);
9013 #define RCU_EXPEDITED_STATE_POST -2
9014 #define RCU_EXPEDITED_STATE_IDLE -1
9016 static int rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
9018 int rcu_expedited_torture_stats(char *page)
9023 cnt += sprintf(&page[cnt], "state: %d /", rcu_expedited_state);
9024 for_each_online_cpu(cpu) {
9025 cnt += sprintf(&page[cnt], " %d:%d",
9026 cpu, per_cpu(rcu_migration_req, cpu).dest_cpu);
9028 cnt += sprintf(&page[cnt], "\n");
9031 EXPORT_SYMBOL_GPL(rcu_expedited_torture_stats);
9033 static long synchronize_sched_expedited_count;
9036 * Wait for an rcu-sched grace period to elapse, but use "big hammer"
9037 * approach to force grace period to end quickly. This consumes
9038 * significant time on all CPUs, and is thus not recommended for
9039 * any sort of common-case code.
9041 * Note that it is illegal to call this function while holding any
9042 * lock that is acquired by a CPU-hotplug notifier. Failing to
9043 * observe this restriction will result in deadlock.
9045 void synchronize_sched_expedited(void)
9048 unsigned long flags;
9049 bool need_full_sync = 0;
9051 struct migration_req *req;
9055 smp_mb(); /* ensure prior mod happens before capturing snap. */
9056 snap = ACCESS_ONCE(synchronize_sched_expedited_count) + 1;
9058 while (!mutex_trylock(&rcu_sched_expedited_mutex)) {
9060 if (trycount++ < 10)
9061 udelay(trycount * num_online_cpus());
9063 synchronize_sched();
9066 if (ACCESS_ONCE(synchronize_sched_expedited_count) - snap > 0) {
9067 smp_mb(); /* ensure test happens before caller kfree */
9072 rcu_expedited_state = RCU_EXPEDITED_STATE_POST;
9073 for_each_online_cpu(cpu) {
9075 req = &per_cpu(rcu_migration_req, cpu);
9076 init_completion(&req->done);
9078 req->dest_cpu = RCU_MIGRATION_NEED_QS;
9079 raw_spin_lock_irqsave(&rq->lock, flags);
9080 list_add(&req->list, &rq->migration_queue);
9081 raw_spin_unlock_irqrestore(&rq->lock, flags);
9082 wake_up_process(rq->migration_thread);
9084 for_each_online_cpu(cpu) {
9085 rcu_expedited_state = cpu;
9086 req = &per_cpu(rcu_migration_req, cpu);
9088 wait_for_completion(&req->done);
9089 raw_spin_lock_irqsave(&rq->lock, flags);
9090 if (unlikely(req->dest_cpu == RCU_MIGRATION_MUST_SYNC))
9092 req->dest_cpu = RCU_MIGRATION_IDLE;
9093 raw_spin_unlock_irqrestore(&rq->lock, flags);
9095 rcu_expedited_state = RCU_EXPEDITED_STATE_IDLE;
9096 synchronize_sched_expedited_count++;
9097 mutex_unlock(&rcu_sched_expedited_mutex);
9100 synchronize_sched();
9102 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
9104 #endif /* #else #ifndef CONFIG_SMP */